Programming Lab
Lab Room No– A-303
Lab In charge- Dr. Neeraj Kumar
Lab Attendant – Mr. Sachin
Subjects– (i) Machine Learning Lab (ML-407P) (ii) Artificial Intelligence Lab (AI-302P) (iii) Data Structures and Algorithms Lab (OCSE-310P) (iv) Introduction to Software Engineering Lab (OCSE-413P) (v) C++ Programming Lab (OCSE-306P) (v) Introduction to Control System (EEC-355)
About Lab:
The Programming Lab in the Department of Electrical Engineering is designed to equip students with essential programming skills, computational thinking, and hands-on experience in software and system development. It serves as a versatile learning space for multiple core subjects and emerging technologies, supporting both academic and research endeavors. The lab is equipped with modern computers and the latest software tools to facilitate practical learning. It caters to a wide range of courses, blending foundational programming with advanced technologies to prepare students for the ever-evolving tech landscape.
Hardware Details: 20 computers (I9 Generation, 32 GB RAM, 512 GB SSD)
Software Details: Python, Prolog, NS2, Visual Studio
List of Experiment for Machine Learning Lab (ML-407P)
| S. No. | TITLE OF LAB EXPERIMENTS | CO |
| 1 | Introduction to JUPYTER IDE and its libraries Pandas and NumPy | CO1 |
| 2 | Program to demonstrate Simple Linear Regression. | CO2 |
| 3 | Program to demonstrate Logistic Regression. | CO2 |
| 4 | Program to demonstrate Decision Tree ID3 Algorithm. | CO2 |
| 5 | Program to demonstrate k-Nearest Neighbor flowers classification. | CO3 |
| 6 | Program to demonstrate Naïve- Bayes Classifier | CO3 |
| 7 | Program to demonstrate PCA and LDA on Iris dataset. | CO4 |
| 8 | Program to demonstrate DBSCAN clustering algorithm. | CO4 |
| ADDITIONAL EXPERIMENTS | ||
| 9 | Program to demonstrate K-Medoid clustering algorithm. | CO4 |
| 10 | Program to demonstrate K-Means Clustering Algorithm on Handwritten Dataset. | CO4 |
List of Experiment for Artificial Intelligence Lab (AI-302P)
| S. No. | TITLE OF LAB EXPERIMENTS | CO |
| 1 | Study of PROLOG. | CO1 |
| 2 | Write simple fact for the statements using PROLOG
a. Ram likes mango. b. Seema is a girl. c. Bill likes Cindy. d. Rose is red. e. John owns gold. |
CO1 |
| 3 | Write predicates, one converts centigrade temperatures to Fahrenheit, the other checks if a temperature is below freezing using PROLOG. | CO1 |
| 4 | Write a program to implement Breath First Search Traversal. | CO2 |
| 5 | Write a program to implement Water Jug Problem. | CO1 |
| 6 | Write a program to remove punctuations from the given string. | CO2 |
| 7 | Write a program to sort the sentence in alphabetical order. | CO3 |
| 8 | Write a program to implement Hangman game using python. | CO3 |
| Additional Experiments | ||
| 9 | Write a program to implement Hangman game. | CO4 |
| 10 | Write a program to implement Tic-Tac-Toe game. | CO4 |
List of Experiment for Data Structure and Algorithms
| S. No. | TITLE OF LAB EXPERIMENTS | CO |
| 1 | Create a linked list with nodes having information about a student and perform d. Insert a new node at specified position. e. Delete of a node with the roll number of student specified. f. Reversal of that linked list. | CO1 |
| 2 | Create doubly linked list with nodes having information about an employee and perform Insertion at front of doubly linked list and perform deletion at end of that doubly linked list. | CO1 |
| 3 | Create circular linked list having information about a college and perform Insertion at front perform Deletion at end. | CO1 |
| 4 | Implement sparse matrix using array. Description of program: a. Read a 2D array from the user. b. Store it in the sparse matrix form, use array of structures. c. Print the final array. | CO2 |
| 5 | Create a stack and perform Push, Pop, Peek and Traverse operations on the stack using Linked list. | CO2 |
| 6 | Implement Selection Sort, Bubble Sort, Insertion sort, Merge sort, Quick sort, and Heap Sort using array as a data structure. | CO3 |
| 7 | Create a Linear Queue using Linked List and implement different operations such as Insert, Delete, and Display the queue elements. | CO3 |
| 8 | Create a Binary Tree and perform Tree traversals (Preorder, Postorder, Inorder) using the concept of recursion. | CO4 |
| Additional Experiments | ||
| 9 | Implement two stacks in a using single array. | CO1 |
| 10 | Create a graph and perform DFS and BFS traversals. | CO4 |