Cu 2nd Sem
Cu 2nd Sem
Cu 2nd Sem
Arrays 05 hours
1D, 2D and Multi-dimensional Arrays, Sparse Matrices. Polynomial representation
Stacks 05 hours
Array and linked representation of stack, Prefix, Infix and Postfix expressions, utility and
conversion of these expressions from one to another, evaluation of postfix and prefix
expression using stack, applications of stack, limitations of Array representation of stack.
Queues 05 hours
Array and Linked representation of Queue, Circular Queue, De-queue, Priority Queues.
Recursion 05 hours
Developing Recursive Definition of Simple Problems and their implementation; Advantages
and Limitations of Recursion; Understanding what goes behind Recursion (Internal Stack
Implementation), Tail recursion.
Trees 15 hours
Introduction to Tree as a data structure: Binary Trees (Recursive and Iterative Traversals),
Binary Search Tree (Traversal, Insertion, Deletion and Searching), Threaded Binary Trees
(Traversal and advantages).
Hashing 05 hours
Introduction to Hashing, Different hashing Techniques, Collision and resolving collision by
Open Addressing, Closed Hashing, Separate Chaining, Choosing a Hash Function.
CMS-A-CC-2-3-P: Data Structure Lab using C.
Core Course- 3: Practical, Credits - 02, Contact hours - 40.
Lab based on Data Structure theory except Threaded Binary Tree, Shell Sort, Radix Sort
and hashing
1. Write a program to search an element from a list. Give user the option to perform Linear or
Binary search.
2. Write a program to sort a list of elements. Give user the option to perform sorting using Insertion
sort, Bubble sort or Selection sort.
3. Implement Linked List. Include functions for insertion, deletion and search of a number, reverse
the list and concatenate two linked lists.
4. Implement Doubly Linked List. Include functions for insertion, deletion and search of a number,
reverse the list.
5. Implement Circular Linked List. Include functions for insertion, deletion and search of a
number, reverse the list.
6. Perform Stack operations using Linked List implementation.
7. Perform Stack operations using Array implementation.
8. Perform Queue operations using Array and linked list implementation.
9. Create and perform different operations on Double-ended Queues using Linked List
implementation.
10. Write a program to scan a polynomial using linked list and add two polynomials.
11. Write a program to create a Binary Search Tree and include following operations in tree:
(a) Insertion (Recursive and Iterative Implementation).
(b) Deletion.
(c) Search a node in BST.
(d) Display its preorder, postorder and inorder traversals recursively.
(e) Display its preorder, postorder and inorder traversals Iteratively.
(f) Display its level-by-level traversals.
(g) Count the non-leaf nodes and leaf nodes.
(h) Display height of tree.
(i) Create a mirror image of tree.
12. Write a program to reverse the order of the elements in the stack using additional stack.
13. Write a program to reverse the order of the elements in the stack using additional Queue.
Note: These are only sample programs; more can be included related to the theory.
Timer 04 hours
Construction and Functional description of 555, Mono-stable, Bi-stable and Astable
Operation, VCO.
Data Acquisition 04 hours
Digital to Analog Converter (DAC): R-2R ladder, Weighted resistor type.
Analog to Digital Converters (ADC): Flash, Counter, Successive Approximation Register
(SAR), Dual Slope type.
1. Study the forward characteristic of a p-n junction diode and calculate the static and dynamic
resistance.
2. Construct a Half wave rectifier using power diodes and study its load regulation characteristics
with and without capacitor filter.
3. Construct a full wave rectifier using power diodes and study its load regulation characteristics
with and without capacitor filter.
4. Construct a Bridge rectifier using power diodes and study its load regulation characteristics
with and without capacitor filter.
5. Study the reverse characteristic of a Zener diode and calculate the Zener voltage from the
characteristic curve and also calculate the value of current limiting resistance.
6. Construct a voltage regulator using Zener diode and study its load regulation characteristics.
7. Construct a positive and negative voltage regulator using three terminal linear voltage
regulators 78XX and 79XX. Study its load regulation characteristics.
8. Construct a variable positive voltage regulator using three terminal linear voltage regulator
LM317 and study its load regulation characteristics for different sets of output voltage.
9. Study the output characteristics of a transistor in CE mode and calculate the dc current gain ( )
from the graph.
10. Realize a NOT operation using a Transistor. Draw its transfer characteristics and measure the
threshold voltage.
11. Construct and study an Inverting amplifier using OPAMP with different sets of voltage gain
and calculate the gain from the graph.
12. Construct and study a non-inverting amplifier using OPAMP with different sets of voltage gain
and calculate the gain from the graph.
13. Construct and study an inverting adder using OPAMP capable of adding two inputs.
14. Construct and study a non-inverting adder using OPAMP capable of adding two inputs.
15. Construct and study a subtractor using OPAMP.
16. Construct and study the OPAMP as a subtractor.
17. Construct and study the OPAMP as a differentiator. Apply sine and square wave and study and
record the output waveforms.
18. Construct and study the OPAMP as an integrator. Apply sine and square wave and study and
record the output waveforms.
19. Construct an astable multivibrator using Timer 555.
20. Construct and study a R-2R ladder digital to analog converter.
21. Convert an analog signal into digital using ADC 0804/0808/0809.
Text/Reference Books
1. Electronic Devices & Circuits Theory, Boylestad & Nashelsky, Prentice Hall.
2. Electronics fundamental & Application, Chattopadhyay, Rakshit, New Age International
Publishers.
3. Op-Amps and Linear Integrated Circuits, R. A. Gayakwad, Prentice Hall.