2nd Sem
2nd Sem
2nd Sem
Course Synopsis: General concepts to be used in the design and analysis of digital
systems and introduces the principles of digital computer
organization and design.
Goals:
Course Contents:
Digital Systems, Binary Numbers, Number base conversion, Octal and hexadecimal
numbers, Binary Systems, Integrated Circuits
K-map, Two and three Variable Maps, Four variable Maps, Product of Sums, sum of
product simplification, NAND and NOR implementation
Laboratory works:
1. Familiarization with logic gates
2. Encodes and decodes
3. Multiplexer and de-multiplexer
4. Design of simple combination circuits
5. Design of adder/subtractor
6. Design f Flip-Flop
7. Clock driven sequential circuits
8. Conversion of parallel data into serial format
9. Generation of timing signal for sequential system
Text Book
Course Synopsis: This course contains the fundamental concepts of logic, reasoning
and algorithms.
Goal: After completing this course, the target student will gain knowledge in discrete
mathematics and finite state automata in an algorithmic approach. It helps the
target student in gaining fundamental and conceptual clarity in the area of Logic,
Reasoning, Algorithms, Recurrence Relation, and Graph Theory.
Course Contents:
Sequential Circuits and Finite state Machine, Finite State Automata, Language and
Grammars, Non-deterministic Finite State Automata, Language and Automata,
Regular Expression.
Goal: The course objective is to introduce the operation, programming, and application
of microprocessor.
Course Contents:
Fetch Operation and Timing Diagram, Execute Operation and Timing Diagram,
Machine Cycle and States
Functional Block Diagram and Pin configuration, Timing and Control Unit,
Registers, Data and Address Bus, Instructions, Operation Code and Operands,
Addressing Modes, Interrupts, Flags, Instructions and Data Flow
Memory Read, Memory Write, I/O Read, I/O Write, Direct Memory Access,
Interrupt, Types, Interrupt Masking, 8259 operation.
Unit 7. Input/ Output Interfaces 6 Hrs.
References:
Goal: To provide the concept of data structure and its implementation using
programming techniques.
Course Contents:
Unit 1: 14 Hrs.
1.1 Introduction to Data Structures: Information and its meaning, Array in C++:
The array as an ADT, Using one dimensional array, Two dimensional array,
Multi dimensional array, Structure , Union, Classes in C++.
1.2 The Stack: Introduction, definition, primitive operation, the stack as an abstract
data type, implementing the POP operation, testing for exceptional condition,
implementing the PUSH operation.
1.3 The Infix, Postfix & Prefix: Introduction, evaluating the postfix operation,
program to evaluate the postfix operation, limitation of program, converting
from one to another.
Unit 2: 31 Hrs.
2.1 Queues: Introduction, the queue and its sequential representation: The queue as
an abstract data type, implementation of queue, inserts operation, priority queue.
2.2 Linked Lists: Introduction, inserting and deleting the nodes from a list, linked
implementation of stack, getnode and freenode operation, linked
implementation of queue. Linked list as a data structure, circular lists, stack as a
circular list, queue as a circular list.
2.5 Selection and Tree Sorting: Introduction, straight selection sort, binary tree sort,
heapsort, insertion sort, merge and radix sort.
Laboratory works:
1. Write a code to multiply two matrixes and get the transpose of the third one.
2. Write a code to implement the stack, that should check overflow and
underflow also.
3. Write a code to convert any prefix number to postfix.
4. Write a code to convert any infix number to postfix.
5. Write a code to convert any post fix number to prefix.
6. Implement tower of Hanoi.
7. Write a code to implement different sorting techniques.
8. Write a code to demonstrate the binary search.
9. Write a code to implement the queue.
10. Write a code to convert stack operation to queue operation.
Text books: Data Structure Using C & C++, Langsam Yedidyah, Augenstein Moshe J.,
Tennenbaum Aaron M., PHI
Reference: The Design and Analysis of Algorithm, Nitin Upadhyay, SK Kataria &
Sons.
Homework
Assignment: Assignment should be given from the above units in throughout the
semester.
Prerequisite: C, C++
Goal: This course provides students with the knowledge of fundamental of linear
algebra and the theory of matrices. On completion of this course the student will
master the basic concepts and acquires skills in solving problems in linear
algebra.
Course Contents:
Text books: David C. lay: Linear Algebra and its applications, 3rd edition,
Pearson Education.
Course Synopsis: (a) Basic concepts of probability, entropy, classical and quantum
statistics.
(b) Simple concepts of quantum mechanics leading to Schrödinger
equation and its application to simple cases.
(c) Methods of solid state physics - crystal structure, band theory of
solids, free electron theory of metals and band theory of
semiconductors.
Goal: The course aims at providing fundamental physical concepts needed to understand
information processing and related devices,
Laboratory works:
1. To determine inter planer spacing of given crystal by electron diffraction method.
2. To determine the band gap of given sample
3. To determine the nature of charge carrier of a given simple by hall apparatus
4. Study NOT, AND, OR, NAND, NOR, EX-OR, EX-NOR gates
5. To study the temperature dependency of a given sample.
6. To study the characteristic of simple and zener diode
7. To construct and study CE amplifier
8. To construct and study CC amplifier
9. To construct and study CB amplifier
10. To study output input and transfer characteristics of NPN transistor.
Text books:
(1) Thermal physics: C. Kittel
(2) Modern Physics: Murgeshan
(3) Introduction to solid state physics: C. Kittel.
References books:
Course Synopsis: Cell Division, DNA structure and function, RNA, transcription and
translation process, mutation, gene regulation, recombinant DNA
technology.
Goal: The course is aimed at knowing the living organism at the molecular level. It also
focused on techniques for gene manipulation by using recombinant DNA
technology.
Course Contents:
Unit 1. 5 Hrs.
Unit 2. 9 Hrs.
Unit 3. 11 Hrs.
Unit 4. 6 Hrs.
Unit 5. 6 Hrs.
Recombinant DNA technology; introduction, tools for cloning, vectors and restriction
endonucleases, gene cloning and expression, application of recombinant DNA in
healthcare and agriculture industry
Laboratory Assignments:
1. Observation of stages of mitosis by cytological slide preparation from root tip of
onion.
2. Observation of stages of meiosis by cytological slide preparation from anthers.
3. Preparation of models of DNA, RNA and protein synthesis
4. Testing for DNA with Geulgen stain.
5. Testing fro DNA and RNA with Methyl Green Pyronin stain.
6. Counting of WBC and RBC in human blood.
Text Books: Biology by Villee, Solomon, Martin, Martion, Gerg, Davis 2nd Edition,
Saunders college publishing, USA.
Reference Book: Concepts in Biology by E.D. Enger & F.C. Ross, 9th Ed. Tata
McGraw Hill
Goal: It aims at providing students with the knowledge Earth and environmental science
and engineering
Course Contents:
Unit 1. 11 Hrs.
Unit 2. 11 Hrs.
2.1 hill slope stability: mechanics, Finite Difference Method and Finite Element
Method analysis
2.2 Underground excavation: roof control and database structures
Unit 3. 11 Hrs.
Unit 4. 12 Hrs.
Laboratory projects:
Practical
Text Books: No specific text book covering all materials but a working manual could
be easily prepared.
Reference:
Homework: Homework assignments covering lecture materials and primary
numerical exercises.
Course Synopsis: Concept of Sample Survey and Design, and their applications.
Goal: This course makes students able to understand the concept of Sample Survey and
Design, and their applications in the area of Science and Technology.
Course Contents: