1. Verification of boolean theorems using logic gates.
2. Design and implementation of combinational circuits using logic gates for arbitrary functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:
5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system.
Course Outcomes:
• Outline basic Boolean theorems and verify their functionalities.
• Implement combinational circuits using logic gates.
• Design combinational circuits using MSI devices.
• Construct sequential circuits using HDL.
• Develop HDL models for combinational and sequentialcircuits
DATA STRUCTURES LABORATORY-18CS321
Objectives:
• To develop programming skills in design and implementation of data structures and their applications.
LIST OF EXPERIMENTS:
1. Write a C program that uses functions to perform the following.
a) Create a singly linked list of integers.
b) Insert a given integer to the above linked list.
c) Delete a given integer from the above linked list.
d) Display the contents of the above list after i)insertion ii) deletion.
2. Write a C program that uses functions to perform the following.
a) Create a doubly linked list of integers.
b) Insert a given integer to the above doubly linked list.
c) Delete a given integer from the above doubly linked list.
d) Display the contents of the above list after i) insertion ii) deletion.
3. Develop and execute a program in C to accept two polynomials add and subtract them and display the
resulting polynomial.
4. Write a C program that uses stack operations to convert a given infix expression into its postfix equivalent,
implement the stack using an array.
5. Design and develop a program in C to simulate the working of a queue of integers using an array. Provide
the following operations:i) insertion ii) deletion iii) display
6. Develop a C program to generate expression tree and display it in the following order : i) Preorder
ii) Postorder iii) Inorder
7. Write a C program that uses functions to perform the following.
a) Create a binary search tree of integers.
b) Traverse the above binary search tree recursively using postorder algorithm.
c) Traverse the above binary search tree non recursively using inorder algorithm
8. Write a C program that uses functions to perform the following.
a) Create an AVL tree of integers.
b) Insert a given integer in the right-left of the tree.
c) Delete a given integer from left-right of the tree.
9. Write C programs for implementing the following graph traversal and MST algorithms:
a) DFS Algorithm
b) Prims Algorithm.
10. Write C programs for implementing the following sorting methods to arrange a list of integers in ascending
order:
a) Bubble sort
b) Merge sort
Course Outcomes:
• Apply the concepts of singly and doubly linked lists.
• Implement the applications of stack and queue.
• Design the balanced tree concepts.
• Demonstrate the sorting algorithm techniques.
• Construct the minimum spanning tree.
PYTHON PROGRAMMING LABORATORY-18CS028
Objectives:
• To study python programs with conditionals and loops
• To use functions for python structured programs.
• To read and write data from and to files in python.
LIST OF EXPERIMENTS:
1. Write a program to display the largest number among three numbers.
2. Write a program to check the prime number and to display the twin prime numbers.
3. Write a program to display the Fibonacci series and multiplication table by using looping constructs.
4. Write a program for converting decimal to octal, hexadecimals and vice versa by using functions.
5. Write a function to compute the GCD of two numbers.
6. Write a function to perform sorting list of numbers.
7. With the help of string array or list, display a simple calendar in python program without using the calendar
module.
8. Demonstrate class and inheritance in python.
9. Create a text file using python file I/O. Read the content of the file and change them from lower to upper case
characters. Write the updated content in another file and display it.
10. Write a program to demonstrate the user-defined exception handling mechanism in Python.
11. Design and implement a graphical user interface to perform any arithmetic operation.
12. Write a python program to insert and retrieve data using MySQL.