141351 DIGITAL LABORATORY 0 0 3 2
(Common to CSE & IT)
LIST OF EXPERIMENTS
1. Verification of Boolean theorems using digital logic gates
2. Design and implementation of combinational circuits using basic gates for
arbitrary functions, code converters, etc.
3. Design and implementation of 4-bit binary adder / subtractor using basic
gates and MSI devices
4. Design and implementation of parity generator / checker using basic
gates and MSI devices
5. Design and implementation of magnitude comparator
6. Design and implementation of application using multiplexers/
Demultiplexers
7. Design and implementation of Shift registers
8. Design and implementation of Synchronous and Asynchronous counters
9. Simulation of combinational circuits using Hardware Description
Language (VHDL/ Verilog HDL software required)
10. Simulation of sequential circuits using HDL (VHDL/ Verilog HDL software
required)
(Common to Information Technology & Computer Science Engineering)
List of equipments and components for a batch of 30 students (2 per batch)
S.NO Name of equipment/ component Quantity Reqd Remarks
1 Dual power supply/ single mode
powersupply
15/30 +12/-12V
2 IC Trainer 15 10 bit
3 Bread Boards 15
4 Multimeter 5
6 IC 7400 60
7 IC7402 60
8 IC 7404 60
9 IC 7486 60
10 IC 7408 60
11 IC 7432 60
12 IC 7483 60
13 IC74150 60
14 IC74151 40
15 IC74147 40
16 IC7445 4012
17 IC7476 40
18 IC7491 40
19 IC555 40
20 IC7494 40
21 IC7447 40
22 IC74180 40
23 IC7485 40
24 IC7473 40
25 IC74138 40
26 IC7411 40
27 IC7474 40
28 Computer with HDL software 30
29 Seven segment display 40
30 Assembled LED board/LEDs 40/200
31 Wires Single strand13
141352 DATA STRUCTURES LAB 0 0 3 2
AIM:
To develop programming skills in design and implementation of data structures and
their applications.
1. Implement singly and doubly linked lists.
2. Represent a polynomial as a linked list and write functions for polynomial
addition.
3. Implement stack and use it to convert infix to postfix expression
4. Implement a double-ended queue (dequeue) where insertion and deletion
operations are possible at both the ends.
5. Implement an expression tree. Produce its pre-order, in-order, and postorder traversals.
6. Implement binary search tree.
7. Implement insertion in AVL trees.
8. Implement priority queue using binary heaps
9. Implement hashing with open addressing.
10. Implement Prim's algorithm using priority queues to find MST of an
undirected graph.
Total: 45
List of Equipments and components for A Batch of 30 students (1 per batch)
1. SOFTWARE REQUIRED – TURBOC version 3 or GCC version 3.3.4.
2. OPERATING SYSTEM – WINDOWS 2000 / XP / NT OR LINUX
3. COMPUTERS REQUIRED – 30 Nos. (Minimum Requirement : Pentium III or
Pentium IV with 256 RAM and 40 GB harddisk) 14
141353 OBJECT ORIENTED PROGRAMMING LAB 0 0 3 2
(Common to CSE & IT)
1. Design C++ classes with static members, methods with default arguments, friend
functions. (For example, design matrix and vector classes with static allocation,
and a friend function to do matrix-vector multiplication)
2. Implement complex number class with necessary operator overloadings and type
conversions such as integer to complex, double to complex, complex to double
etc.
3. Implement Matrix class with dynamic memory allocation and necessary methods.
Give proper constructor, destructor, copy constructor, and overloading of
assignment operator.
4. Overload the new and delete operators to provide custom dynamic allocation of
memory.
5. Develop a template of linked-list class and its methods.
6. Develop templates of standard sorting algorithms such as bubble sort, insertion
sort, merge sort, and quick sort.
7. Design stack and queue classes with necessary exception handling.
8. Define Point class and an Arc class. Define a Graph class which represents
graph as a collection of Point objects and Arc objects. Write a method to find a
minimum cost spanning tree in a graph.
9. Develop with suitable hierarchy, classes for Point, Shape, Rectangle, Square,
Circle, Ellipse, Triangle, Polygon, etc. Design a simple test application to
demonstrate dynamic polymorphism and RTTI.
10. Write a C++ program that randomly generates complex numbers (use previously
designed Complex class) and writes them two per line in a file along with an
operator (+, -, *, or /). The numbers are written to file in the format (a + ib). Write
another program to read one line at a time from this file, perform the
corresponding operation on the two complex numbers read, and write the result
to another file (one per line).
(Common to Information Technology & Computer Science Engineering)
List of Equipments and software for a batch of 30 students
1. PC – 30 nos.
• Processor – 2.0 GHz or higher
• RAM – 256 MB or higher
• Hard disk – 20 GB or higher
• OS- Windows 2000/ Windows XP/ NT
2. Software – Turbo C (freeware) – to be installed in all PC’s.15
(Common to CSE & IT)
LIST OF EXPERIMENTS
1. Verification of Boolean theorems using digital logic gates
2. Design and implementation of combinational circuits using basic gates for
arbitrary functions, code converters, etc.
3. Design and implementation of 4-bit binary adder / subtractor using basic
gates and MSI devices
4. Design and implementation of parity generator / checker using basic
gates and MSI devices
5. Design and implementation of magnitude comparator
6. Design and implementation of application using multiplexers/
Demultiplexers
7. Design and implementation of Shift registers
8. Design and implementation of Synchronous and Asynchronous counters
9. Simulation of combinational circuits using Hardware Description
Language (VHDL/ Verilog HDL software required)
10. Simulation of sequential circuits using HDL (VHDL/ Verilog HDL software
required)
(Common to Information Technology & Computer Science Engineering)
List of equipments and components for a batch of 30 students (2 per batch)
S.NO Name of equipment/ component Quantity Reqd Remarks
1 Dual power supply/ single mode
powersupply
15/30 +12/-12V
2 IC Trainer 15 10 bit
3 Bread Boards 15
4 Multimeter 5
6 IC 7400 60
7 IC7402 60
8 IC 7404 60
9 IC 7486 60
10 IC 7408 60
11 IC 7432 60
12 IC 7483 60
13 IC74150 60
14 IC74151 40
15 IC74147 40
16 IC7445 4012
17 IC7476 40
18 IC7491 40
19 IC555 40
20 IC7494 40
21 IC7447 40
22 IC74180 40
23 IC7485 40
24 IC7473 40
25 IC74138 40
26 IC7411 40
27 IC7474 40
28 Computer with HDL software 30
29 Seven segment display 40
30 Assembled LED board/LEDs 40/200
31 Wires Single strand13
141352 DATA STRUCTURES LAB 0 0 3 2
AIM:
To develop programming skills in design and implementation of data structures and
their applications.
1. Implement singly and doubly linked lists.
2. Represent a polynomial as a linked list and write functions for polynomial
addition.
3. Implement stack and use it to convert infix to postfix expression
4. Implement a double-ended queue (dequeue) where insertion and deletion
operations are possible at both the ends.
5. Implement an expression tree. Produce its pre-order, in-order, and postorder traversals.
6. Implement binary search tree.
7. Implement insertion in AVL trees.
8. Implement priority queue using binary heaps
9. Implement hashing with open addressing.
10. Implement Prim's algorithm using priority queues to find MST of an
undirected graph.
Total: 45
List of Equipments and components for A Batch of 30 students (1 per batch)
1. SOFTWARE REQUIRED – TURBOC version 3 or GCC version 3.3.4.
2. OPERATING SYSTEM – WINDOWS 2000 / XP / NT OR LINUX
3. COMPUTERS REQUIRED – 30 Nos. (Minimum Requirement : Pentium III or
Pentium IV with 256 RAM and 40 GB harddisk) 14
141353 OBJECT ORIENTED PROGRAMMING LAB 0 0 3 2
(Common to CSE & IT)
1. Design C++ classes with static members, methods with default arguments, friend
functions. (For example, design matrix and vector classes with static allocation,
and a friend function to do matrix-vector multiplication)
2. Implement complex number class with necessary operator overloadings and type
conversions such as integer to complex, double to complex, complex to double
etc.
3. Implement Matrix class with dynamic memory allocation and necessary methods.
Give proper constructor, destructor, copy constructor, and overloading of
assignment operator.
4. Overload the new and delete operators to provide custom dynamic allocation of
memory.
5. Develop a template of linked-list class and its methods.
6. Develop templates of standard sorting algorithms such as bubble sort, insertion
sort, merge sort, and quick sort.
7. Design stack and queue classes with necessary exception handling.
8. Define Point class and an Arc class. Define a Graph class which represents
graph as a collection of Point objects and Arc objects. Write a method to find a
minimum cost spanning tree in a graph.
9. Develop with suitable hierarchy, classes for Point, Shape, Rectangle, Square,
Circle, Ellipse, Triangle, Polygon, etc. Design a simple test application to
demonstrate dynamic polymorphism and RTTI.
10. Write a C++ program that randomly generates complex numbers (use previously
designed Complex class) and writes them two per line in a file along with an
operator (+, -, *, or /). The numbers are written to file in the format (a + ib). Write
another program to read one line at a time from this file, perform the
corresponding operation on the two complex numbers read, and write the result
to another file (one per line).
(Common to Information Technology & Computer Science Engineering)
List of Equipments and software for a batch of 30 students
1. PC – 30 nos.
• Processor – 2.0 GHz or higher
• RAM – 256 MB or higher
• Hard disk – 20 GB or higher
• OS- Windows 2000/ Windows XP/ NT
2. Software – Turbo C (freeware) – to be installed in all PC’s.15
No comments:
Post a Comment