Microprocessors - I Lab

Instruction: 3 Periods / week
Univ. Exam : 3 Hours
Sessional Marks: 50
Univ-Exam-Marks: 50
Digital Logic Design Experiments :
1. TTL Characteristics and TTL IC Gates
2. Multiplexers & Decoders
3. Flip-Flops
4. Counters
5. Shift Registers
6. Binary Adders & Subtractors
7. A L U
Assembly Language Programming :
1. 8085 Assembly Language Programming according to theory course microprocessors-I using the following trainers :
Keyboard Monitor of 8085μP Trainer.
Serial Monitor of 8085μP Trainer with Terminal
8085 Line Assembler of 8085μP Trainer with PC as Terminal
8085 Cross Assembler using In-Circuit Emulator (ICE) with 8085μP Trainer and PC as Terminal
2. 8086 Assembly Language Programming according to theory course Microprocessor-I using the following :
PC Assembler using TASM or MASM, TD or SYMDEB or CVD(Code View debugger)
Graded Problems are to be used according to the syllabus of MICROPROCESSORS-I

Electronics-II

Instruction: 3 Periods & 1 Tut /week

Univ. Exam : 3 Hours

Sessional Marks: 30

Univ-Exam-Marks:70

Feed Back Amplifiers:

Concept of Feedback Amplifiers – Effect of Negative Feed back on gain, nonlineardistortion, noise and Band width--Input and output impedances - Current Series andVoltage Series Feed back Amplifiers

Sinusoidal Oscillators:

Barkhansen Criterion of Oscillations – LC Oscillators -- Tuned Collector Oscillators – Hartley and Colpitts,– RC Oscillators, RC Phase Shift and Weinbridge Oscillators.- Frequency Stability of Oscillators—CrystalOscillators.

Operational Amplifiers :

Ideal Characteristics of an Operational Amplifier.– Applications of OP-Amp as an Inverting and NonInverting Amplifier, Summing and Subtracting Amplifier, Integrator, Differentiator

Multivibrators:

Collector Coupled astable Multivibrator - Collector-Coupled and Emitter-Coupled MonostableMultivibrators -- Fixed Bias and Self biased bistable Multivibrators -- Resolution time of a binary, Methodsof triggering a Binary.

Text Book:

1. Integrated Electronics – Millman and Halkiasv Tata Mc Graw hill Publications

Reference Books:

1. Electronics Devuces and Circuits by Sanjed Gupta, Dunpat Rai Publications

2. Pulse, Digital and Switching Waveforms – Millman and Taub, Tata Mc Graw hill Publications

Electronics Lab

Instruction: 3 Periods / week

Univ. Exam : 3 Hours

Sessional Marks: 50

Univ-Exam-Marks: 50

1. Input and Output Characteristics of a BJT in the CE mode.

2. Half Wave and Full Wave rectifiers.

3. R C Coupled amplifier – Frequency response with and without feedback.

4. Transistor Inverter.

5. Colpitts Oscillator.

6. Op-amp as an inverting and non-inverting amplifier.

7. Astable multivibrator.

8. Self-bias binary.

9. Logic Gates using diodes and transistors.

Data Structures

Instruction: 3 Periods & 1 Tut /week

Univ. Exam : 3 Hours

Sessional Marks: 30

Univ-Exam-Marks:70

Introduction to Data Structures: Information and Meaning – Representation of Multi- Dimensional Arrays _ Review of C Programming.

The Stack: Primitive operations – As an Abstract Data Type – Implementing the Stack operations in C.

Infix, Postfix and Prefix: Definitions, Evaluation and Conversions using C.

Recursion: Recursive Definition and Processes, Recursion in C and Recursive Implementation of Applications. Simulation of Recursion – Efficiency of Recursion.

Queues and Lists: The Queue as Abstract Data Type – Sequential Representation _Types of Queues – Operations – Implementation in C.

Linked List: Operations – Implementation of Stacks, Queues and priority Queues in C.

Circular Lists: Insertion, Deletion and Concatenation Operations _ Stacks and Queues as Circular Lists _ Doubly Linked Lists _Applications.

Trees: Binary Trees Operations and Applications.

Binary Tree Representation: Node Representation – Implicit array Representation – Choice of Representation – Binary Tree Traversal – Threaded Binary Trees and their Traversal – Trees and their Applications

Sorting: General Background: Efficiency – The big 0 Notation – Efficiency of Sorting. Bubble Sort and Quick Sort and their Efficiency – Selection Sorting – Binary Tree Sort – Heap Sort – Insertion Sorts – Shell Sort – Address calculation Sort – Merge and Radix Sorts.

Searching: Basic Searching Techniques: Dictionary as an Abstract Data Type – Algorithmic Notation – Sequential Searching and its Efficiency – Binary Search – Interpolation Search.

Tree Searching: Insertion into a Binary Search Tree – Deleting from a Binary Search Tree – Efficiency of Binary Search Tree operation

Graphs and Their Application: Graphs: Application of Graphs – Representation of Graphs in C – Transitive closure – Warshall’s Algorithm – Shortest Path Algorithm.

Linked Representation of Graphs: Dijikstra’s Algorithm – Organizing the set of Graph Nodes – Application to Scheduling and its implication.

Graph Traversal and Spanning Forests – Undirected Graph and their Traversals, Applications and Efficiency – Minimal Spanning Trees –Prim’s and Kruskal’s Algorithms.

Textbooks:

1. Data Structures Using C and C++ Yddish Langsam, Moshe J. Augenstein and Aaron M. Tanenbaum, Prentice Hall Of India (2nd Edition) (Chapters 1 to 8)

2. Data Structures, Algorithms and Applications with C++, Sahani Mc-Graw Hill.

Note: All Implementation are Using C Language only.

Digital Logic Design

Instruction: 3 Periods & 1 Tut /week

Univ. Exam : 3 Hours

Sessional Marks: 30

Univ-Exam-Marks:70

1. Binary Systems, Boolean Algebra and Logic Gates.

Digital Systems. Binary Numbers. Number Base Conversions. Octal and HexadecimalNumbers. Complements. Signed Binary Numbers. Binary Codes. Binary Storage andRegisters. Binary Logic

Basic Definitions. Axiomatic Definition of Boolean Algebra. Basic Theorems andProperties of Boolean Algebra. Boolean Functions. Canonical and Standard Forms.Other Logic Operations. Digital Logic Gates. Integrated Circuits.

2. Combinational Logic Design, Gate-Level Minimization.

The Map Method. Four-Variable Map. Five-Variable Map. Product of SumsSimplification. Don't-Care Conditions. NAND and NOR Implementation. Other Two-Level Implementations. Exclusive-OR Function. Hardware Description Language(HDL).

Combinational Logic

Combinational Circuits. Analysis Procedure. Design Procedure. Binary Adder-Subtractor. Decimal Adder. Binary Multiplier. Magnitude Comparator. Decoders.Encoders. Multiplexers. HDL For Combinational Circuits.

3. Sequential Logic Design, Synchronous Sequential Logic

Sequential Circuits. Latches. Flip-Flops. Analysis of Clocked Sequential Circuits.HDL For Sequential Circuits. State Reduction and Assignment. Design Procedure.

Registers ad Counters.

Registers. Shift Registers. Ripple Counters. Synchronous Counters. Other Counters.HDL for Registers and Counters

Fundamentals of Asynchronous Sequential Logic

Introduction. Analysis Procedure. Circuits With Latches. Design Procedure. Hazards

4. Memory and Programmable Logic

Introduction. Random-Access Memory. Memory Decoding. Error Detection andCorrection. Read-Only Memory. Programmable Logic Array. Programmable ArrayLogic. Sequential Programmable Devices.

Text Book :

Digital Design, 3rd Edition, M. Morris Mano, Pearson Education, Inc.,2002

Reference Books:

1. Digital Logic Design Principles, Norman Balabanian and Bradley Carlson,John Wiley & Sons(Asia) Pte. Ltd., 2002

2. Fundamentals of Digital Circuits, A. Ananda Kumar, PHI, 2002

3. Digital Circuits and Design, 2nd Edition,S Salivahanan and S Arivazhagan,Vikas Publishing House Pvt. Ltd., 2003

4. Fundamentals of Digital Logic with VHDL Design, Stephen Brown andZvonko Vranesic, Tata McGraw-Hill Edition, 2002

Discrete Mathematical Structures - I

Introduction: Sets-Operations on sets-relations-functions-Proof methods and problem solving strategies-Fundamentals of Logic- Logical inferences-Methods of proof of an implication-First Order logic and Other Proof methods-Rules of inference for quantified Propositions-Mathematical Induction

Elementary Combinatorics: Basics of Counting- Combinations and Permutations-Their Enumeration with and without repetition-Binomial coefficients-Binomial and Multinomial Theorems-The Principle of Inclusion-Exclusion.

Recurrence Relations: Generating Functions of Sequences-Calculating their Coefficients-Recurrence relations-Solving recurrence relations-Method of characteristic Roots- Non-homogeneous Recurrence relations and their solutions

Relations and Digraphs: Relations and Directed Graphs-Special Properties of Binary relations- Equivalence Relations-Ordering Relations-Lattices and Enumeration- Operations on relations-Paths and Closures-Directed Graphs and Adjacency matrices- Applications of sorting, searching and topological sorting.

Graphs: Basic concepts-Isomorphism-subgraphs-Planar Graphs-Euler’s formula- Multigraphs and Euler circuits-Hamiltonian graphs-Chromatic numbers-Four color theorem.

Trees: Trees and their properties-Trees as graphs-spanning trees-Directed trees-Binary trees-Their traversals-Arithmetic and Boolean expressions as trees- height balanced trees.

Text Book:

"Discrete Mathematics for computer scientists & Mathematicians" by Joe L. Mott, Abraham Kandel & T. P. Baker, Prentice Hall of India Ltd, New Delhi

Reference Books:

1) "Discrete mathematics and its applications" by Keneth. H. Rosen, , Tata McGraw- Hill Publishing Company, New Delhi

2) "Discrete mathematics" by Richard Johnsonbaug, Pearson Education, New Delhi