EE-224-F DIGITAL ELECTRONICS LAB

Objective: To understand the digital logic and create various systems by using these logics.

1. Introduction to digital electronics lab- nomenclature of digital ICs, specifications, study of the

data sheet, concept of V_cc and ground, verification of the truth tables of logic gates using TTL ICs.

2. Implementation of the given Boolean function using logic gates in both SOP and POS forms.

3. Verification of state tables of RS, JK, T and D flip-flops using NAND & NOR gates.

4. Implementation and verification of Decoder/De-multiplexer and Encoder using logic gates.

5. Implementation of 4×1 multiplexer using logic gates.

6. Implementation of 4-bit parallel adder using 7483 IC.

7. Design, and verify the 4-bit synchronous counter.

8. Design, and verify the 4-bit asynchronous counter.

9. Static and Dynamic Characteristic of NAND and Schmitt-NAND gate(both TTL and

MOS) 10 Study of Arithmetic Logic Unit. 11. Mini Project.

NOTE : Ten experiments are to be performed, out of which at least seven experiments should be performed from above list. Remaining three experiments may either be performed from the above list or designed & setup by the concerned institution as per the scope of the syllabus.

Related posts:

1. UPTU Syllabus | ECS -351 : Logic Design Lab
2. EE-224-E DIGITAL ELECTRONICS LAB
3. MDU Syllabus | F-Scheme | EE-204-F DIGITAL ELECTRONICS

CSE-205 F Data Structures using ‘C’ Lab.

1. Write a program to search an element in a two-dimensional array using linear search.

2. Using iteration & recursion concepts write programs for finding the element in the array

using Binary Search Method

3. Write a program to perform following operations on tables using functions only a) Addition b) Subtraction c) Multiplication d) Transpose

4. Using iteration & recursion concepts write the programs for Quick Sort Technique

5. Write a program to implement the various operations on string such as length of string concatenation, reverse of a string & copy of a string to another.

6. Write a program for swapping of two numbers using ‘call by value’ and ‘call by reference strategies.

7. Write a program to implement binary search tree.

( Insertion and Deletion in Binary search Tree)

8. Write a program to create a linked list & perform operations such as insert, delete,
update, reverse in the link list

9 . Write the program for implementation of a file and performing operations such as insert, delete, update a record in the file.

10. Create a linked list and perform the following operations on it a) add a node b) Delete a node

11. Write a program to simulate the various searching & sorting algorithms and compare their timings for a list of 1000 elements.

12. Write a program to simulate the various graph traversing algorithms.

13. Write a program which simulates the various tree traversal algorithms.

Note: At least 5 to 10 more exercises to be given by the teacher concerned.

Related posts:

1. CSE-205 E Data Structures & Algorithms Lab.
2. MDU Syllabus | F-Scheme | CSE-201 F Data Structures Using ‘C’
3. UPTU Syllabus | ECS-352 : Data Structure Lab