(Approved by AICTE & Affiliated to AKTU, Lucknow)
About the Department Vision & Mission PEO-PO-PSO Programs Offered HOD’s Message Faculty & Lab Staff R&D University Syllabus Laboratories Faculty Innovations in Teaching Professional Chapter Student Achievements Magazine & News Letter MOU DAC
| List of Laboratory Courses | |
|---|---|
| S.No. | Name of the Laboratories |
| 1 | Data Structure Lab |
| 2 | Computer Organization and Architecture Lab |
| 3 | Cyber Security Lab |
| 4 | Python Programming Lab |
| 5 | Mini Project Lab |
| 6 | Operating System Lab |
| 7 | Web Technology Lab |
| 8 | Object Oriented Programming (Java) Lab |
| 9 | Software Engineering Lab |
| 10 | Computer Network Lab |
| 11 | Database Management System Lab |
| 12 | Internet of Things Lab |
| 13 | Design and Analysis of Algorithms Lab |
| 14 | Web Designing Workshop |
| 15 | Artificial Intelligence Lab |
| 16 | Mini Project Lab |
| 17 | Project and Research Lab |
| Name of the Laboratory: Data Structure Lab | |
|---|---|
| EX.NO. | LIST OF EXPERIMENTS |
| 1 | Implementing Sorting Techniques: Bubble Sort, Insertion Sort, Selection Sort, Shell, Sort, Radix Sort, Quick sort. |
| 2 | Implementing Searching and Hashing Techniques: Linear search, Binary search, Methods for Hashing: Modulo Division, Digit Extraction, Fold shift, Fold Boundary, Linear Probe for Collision Resolution. Direct and Subtraction hashing. |
| 3 | Implementing Stacks: Array implementation, Linked List implementation, Evaluation of postfix expression and balancing of parenthesis , Conversion of infix notation to postfix notation. |
| 4 | Implementing Queue: Linked List implementation of ordinary queue, Array implementation of circular queue, Linked List implementation of priority queue, Double ended queue. |
| 5 | Program to implement Tower of Hanoi. |
| 6 | Program to create a circular queue using an array. |
| 7 | Program to implement linear and binary search in an Array. |
| 8 | Implementing Linked List: Singly Linked Lists, Circular Linked List, Doubly Linked Lists: Insert, Display, Delete, Search, Count, Reverse (SLL), Polynomial, Addition, Comparative study of arrays and linked list |
| 9 | Implementing Trees: Binary search tree: Create, Recursive traversal: preorder, post order, in order, Search Largest, Node, Smallest Node, Count number of nodes, Heap: Min Heap, Max Heap: reheap Up, reheap Down, Delete, Expression Tree, Heapsort |
| 10 | Program to create a simple binary tree and implement traversal techniques. |
| 11 | Program to find the maximum depth/height of a tree. |
| 12 | Program to find the number of nodes and leaves in the binary search tree. |
| 13 | Program for creation of graph using adjacency matrix. |
| 14 | Program to implement BFS and DFS algorithm. |
| 15 | Program to implement the shortest path using Dijkstra's algorithm. |
| Name of the Laboratory: Computer Organization Lab | |
|---|---|
| EX.NO. | LIST OF EXPERIMENTS |
| 1 | Implementing HALF ADDER, FULL ADDER using basic logic gates |
| 2 | Implementing Binary -to -Gray, Gray -to -Binary code conversions. |
| 3 | Implementing 3-8 line DECODER. |
| 4 | Implementing 4x1 and 8x1 MULTIPLEXERS. |
| 5 | Verify the excitation tables of various FLIP-FLOPS. |
| 6 | Design of an 8-bit Input/ Output system with four 8-bit Internal Registers. |
| 7 | Design of an 8-bit ARITHMETIC LOGIC UNIT. |
| 8 | Design the data path of a computer from its register transfer language description. |
| 9 | Design the control unit of a computer using either hardwiring or microprogramming based on its register transfer language description. |
| 10 | Implement a simple instruction set computer with a control unit and a data path. |
| Name of the Laboratory: Cyber Security Workshop | |
|---|---|
| EX.NO. | LIST OF EXPERIMENTS |
| 1 | Basic Packet Inspection: Capture network traffic using Wireshark and analyze basic protocols like HTTP, DNS, and SMTP to understand how data is transmitted and received. |
| 2 | Detecting Suspicious Activity: Analyze network traffic to identify suspicious patterns, such as repeated connection attempts or unusual communication between hosts. |
| 3 | Malware Traffic Analysis: Analyze captured traffic to identify signs of malware communication, such as command-and-control traffic or data infiltration. |
| 4 | Password Sniffing: Simulate a scenario where a password is transmitted in plaintext. Use Wireshark to capture and analyze the packets to demonstrate the vulnerability and the importance of encryption. |
| 5 | ARP Poisoning Attack: Set up an ARP poisoning attack using tools like Ettercap. Analyze the captured packets to understand how the attack can lead to a Man-in-the-Middle scenario. |
| 6 | SQL Injection: Use DVWA to practice SQL injection attacks. Demonstrate how an attacker can manipulate input fields to extract, modify, or delete database information. |
| 7 | Cross-Site Scripting (XSS): Exploit XSS vulnerabilities in DVWA to inject malicious scripts into web pages. Show the potential impact of XSS attacks, such as stealing cookies or defacing websites. |
| 8 | Cross-Site Request Forgery (CSRF): Set up a CSRF attack in DVWA to demonstrate how attackers can manipulate authenticated users into performing unintended actions. |
| 9 | File Inclusion Vulnerabilities: Explore remote and local file inclusion vulnerabilities in DVWA. Show how attackers can include malicious files on a server and execute arbitrary code. |
| 10 | Brute-Force and Dictionary Attacks: Use DVWA to simulate login pages and demonstrate brute-force and dictionary attacks against weak passwords. Emphasize the importance of strong password policies. |
| Name of the Laboratory: Python Programming Lab | |
|---|---|
| EX.NO. | LIST OF EXPERIMENTS |
| 1 | To write a python program that takes in command line arguments as input and print the number of arguments. |
| 2 | To write a python program to perform Matrix Multiplication. |
| 3 | To write a python program to compute the GCD of two numbers. |
| 4 | To write a python program to find the most frequent words in the text file. |
| 5 | To write a python program to find the square root of a number. |
| 6 | To write a python program exponentiation (Power of Number) |
| 7 | To write a python program to find the maximum of a list of number. |
| 8 | To write a python program for Linear Search. |
| 9 | To write a python program for Binary Search. |
| 10 | To write a python program for Selection Sort. |
| 11 | To write a python program for Insertion Sort. |
| 12 | To write a python program for Merge Sort. |
| 13 | To write a python program for first n prime number. |
| 14 | To write a python program to simulate bouncing ball in Pygame. |
| Name of the Laboratory: Operating System Lab | |
|---|---|
| EX.NO. | LIST OF EXPERIMENTS |
| 1 |
Study of hardware and software requirements of different operating systems (UNIX, LINUX, WINDOWS XP, WINDOWS7/8) |
| 2 |
Execute various UNIX system calls for i. Process management ii. File management iii. Input/output Systems calls |
| 3 |
Implement CPU Scheduling Policies: i. SJF ii. Priority iii. FCFS iv. Multi-level Queue |
| 4 |
Implement file storage allocation technique: i. Contiguous (using array) ii. Linked-list (using linked-list) iii. Indirect allocation (indexing) |
| 5 |
Implementation of contiguous allocation techniques: i. Worst-Fit ii. Best-Fit iii. First-Fit |
| 6 |
Calculation of external and internal fragmentation: i. Free space list of blocks from system ii. List process file from the system |
| 7 | Implementation of compaction for the continually changing memory layout and calculate total movement of data. |
| 8 | Implementation of resource allocation graph (RAG). |
| 9 | Implementation of Banker's algorithm. |
| 10 | Conversion of resource allocation graph (RAG) to wait-for graph (WFG) for each type of method used for storing graph. |
| 11 | Implement the solution for Bounded Buffer (producer-consumer) problem using inter process communication techniques – Semaphores. |
| 12 | Implement the solutions for Readers-Writers problem using inter process communication technique – Semaphore. |
| Name of the Laboratory: Database Management System Lab | |
|---|---|
| EX.NO. | LIST OF EXPERIMENTS |
| 1 | Installation oracle/MYSQL |
| 2 | Creating Entity-Relationship Diagram using case tools. |
| 3 |
Writing SQL statements Using ORACLE/MYSQL: a) Writing basic SQL SELECT statements b) Restricting and sorting data c) Displaying data from multiple tables d) Aggregating data using group function e) Manipulating data f) Creating and managing tables |
| 4 | Normalization |
| 5 | Creating cursor |
| 6 | Creating procedure and functions |
| 7 | Creating packages and triggers |
| 8 | Design and implementation of payroll processing system |
| 9 | Design and implementation of Library information system |
| 10 | Design and implementation of Student Information System |
| 11 | Automatic Backup of Files and Recovery of Files |
| 12 |
Mini project (Design & Development of Data and Application) for following: a) Inventory Control System b) Material Requirement Processing c) Hospital Management System d) Railway Reservation System e) Personal Information System f) Web Based User Identification System g) Timetable Management System h) Hotel Management System |
| Name of the Laboratory: Design and Analysis of Algorithm Lab | |
|---|---|
| EX.NO. | LIST OF EXPERIMENTS |
| 1 | Program for Recursive Binary & Linear Search. |
| 2 | Program for Heap Sort. |
| 3 | Program for Merge Sort. |
| 4 | Program for Selection Sort. |
| 5 | Program for Insertion Sort. |
| 6 | Program for Quick Sort. |
| 7 | Knapsack Problem using Greedy Solution |
| 8 | Perform Travelling Salesman Problem |
| 9 | Find Minimum Spanning Tree using Kruskal's Algorithm |
| 10 | Implement N Queen Problem using Backtracking |
| 11 | Find Minimum Cost Spanning Tree of a given undirected graph using Prim's algorithm. |
| 12 |
Implement the 0/1 Knapsack problem using: (a) Dynamic Programming method (b) Greedy method |
| Name of the Laboratory: Software Engineering Lab | |
|---|---|
| EX.NO. | LIST OF EXPERIMENTS |
| 1 | Prepare a SRS document in line with the IEEE recommended standards. |
| 2 | Draw the use case diagram and specify the role of each of the actors. Also state the precondition, post condition and function of each use case. |
| 3 | Draw the activity diagram. |
| 4 | Identify the classes. Classify them as weak and strong classes and draw the class diagram. |
| 5 | Draw the sequence diagram for any two scenarios. |
| 6 | Draw the collaboration diagram. |
| 7 | Draw the state chart diagram. |
| 8 | Draw the component diagram. |
| 9 | Perform forward engineering in java. (Model to code conversion) |
| 10 | Perform reverse engineering in java. (Code to Model conversion) |
| 11 | Draw the deployment diagram. |
| Name of the Laboratory: Internet of Things Lab | |
|---|---|
| EX.NO. | LIST OF EXPERIMENTS |
| 1 | Wearable Computer With Temperature Distance Sensors |
| 2 | Weather Imaging CubeSat with Telemetry Transmission |
| 3 | IOT Water Pollution Monitor RC Boat |
| 4 | Mountain Climber Health & GPS Tracker |
| 5 | Contactless IOT Doorbell |
| 6 | IOT Smart Parking Using RFID |
| 7 | IOT Contactless Covid Testing Booth Automation |
| 8 | IOT Social Distancing & Monitoring Robot For Queue |
| 9 | IOT Covid Patient Health Monitor in Quarantine |
| 10 | IOT based Manhole Detection and Monitoring System |
| 11 | IOT based Smart Energy Meter Monitoring with Theft Detection |
| 12 | IOT based Three Phase Power Failure Monitoring with SMS Alerts |
| 13 | IOT based Intelligent Gas Leakage Detector Using Arduino |
| 14 | 360° Aerial Surveillance UAV With IOT Camera |
| Name of the Laboratory: Computer Networks Lab | |
|---|---|
| EX.NO. | LIST OF EXPERIMENTS |
| 1 | Implementation of Stop and Wait Protocol and Sliding Window Protocol. |
| 2 | Study of Socket Programming and Client – Server model |
| 3 | Write a code simulating ARP / RARP protocols. |
| 4 | Write a code simulating PING and TRACEROUTE commands |
| 5 | Create a socket for HTTP for web page upload and download. |
| 6 | Write a program to implement RPC (Remote Procedure Call) |
| 7 | Implementation of Subnetting. |
| 8 |
Applications using TCP Sockets like: a. Echo client and echo server b. Chat c. File Transfer |
| 9 |
Applications using TCP and UDP Sockets like: d. DNS e. SNMP f. File Transfer |
| 10 | Study of Network simulator (NS) and Simulation of Congestion Control Algorithms using NS |
| 11 | To learn handling and configuration of networking hardware like RJ-45 connector, CAT-6 cable, crimping tool, etc. |
| 12 | Configuration of router, hub, switch etc. (using real devices or simulators) |
| 13 | Running and using services/commands like ping, traceroute, nslookup, arp, telnet, ftp, etc. |
| 14 | Network packet analysis using tools like Wireshark, tcpdump, etc. |
| Name of the Laboratory: Data Structure Lab | |
|---|---|
| EX.NO. | LIST OF VALUE ADDED EXPERIMENTS |
| 1 | Sort a given set of n integer elements using the Quick Sort method and compute its time complexity. Run the program for varied values of n> 5000 and record the time taken to sort. Plot a graph of the time taken versus the non-graph sheet. The elements can be read from a file or can be generated using the random number generator. Demonstrate using Java how the divide and- conquer method works along with its time complexity analysis: worst case, average case, and best case |
| 2 | Design and implement to find a subset of a given set S= {S1, S2.... Sn} of n positive integers whose SUM is equal to a given positive integer d for example, if S= {1,2,3,6,8} and d=9, there are two solutions {1,2,6} and {1,8}. Display a suitable message, if the given problem instance does not have a solution |
| 3 | From a given vertex in a weighted connected graph, find shortest paths to other vertices using Dijkstra's algorithm & Floyd's algorithm |
| NAME OF THE LABORATORY: DESIGN AND ANALYSIS OF ALGORITHMS LAB | |
|---|---|
| EX.NO. | LIST OF VALUE ADDED EXPERIMENTS |
| 1 | Program to implement sparse matrix |
| 2 | Program to implement infix to postfix conversion using stack |
| 3 | Program to implement quick and radix sort |
| 4 | Program to exchange left and right sub tree |
| 5 | Program to create MST using Kruskal's algorithm |
| NAME OF THE LABORATORY: COMPUTER ORGANIZATION AND ARCHITECTURE LAB | |
|---|---|
| EX.NO. | LIST OF VALUE ADDED EXPERIMENTS |
| 1 | Assembling of parts of a computer: Motherboard, Processor, RAM, Hard Disk, SMPS, and I/O devices. |
| 2 | Acquainted with the parts of computers: Motherboard, Processor, RAM, Hard Disk, SMPS and I/O devices. |
| 3 | Implementing half subtractor using basic logic gates. |
| 4 | Implementing full subtractor using basic logic gates. |
| 5 | Implement a simple instruction set computer with a control unit and a data path. |
| NAME OF THE LABORATORY: WEB TECHNOLOGY LAB | |
|---|---|
| EX.NO. | LIST OF VALUE ADDED EXPERIMENTS |
| 1 | Write HTML code to display your CV in the navigator. |
| 2 | Design a web page using CSS which includes the following: i. Use different font and text styles ii. Set a background image for both the page and a single element on the page. iii. Define styles for links |
| 3 | Write a program using JavaScript for a Web Page to display browser information. |
| 4 | Write a JSP/servlet program to implement the single text field calculator. |
| NAME OF THE LABORATORY: WEB DESIGNING WORKSHOP | |
|---|---|
| EX.NO. | LIST OF VALUE ADDED EXPERIMENTS |
| 1 | Style an unordered list and a table using CSS. Add borders, background color, and spacing between cells. |
| 2 | Implement a webpage that changes its layout based on different screen widths (mobile, tablet, desktop) using media queries. |
| 3 | Style different text elements (heading, paragraph) using different font families, sizes, weights, and text alignments. Use Google Fonts for at least one font. |
| 4 | Create a form and use JavaScript to validate the input fields (e.g., check for empty fields, valid email format, and password length). |
| 5 | Write a JavaScript function that triggers an event when a button is clicked. Use a loop to iterate over an array and display each value in an HTML element (e.g., a list). |
| NAME OF THE LABORATORY: PYTHON PROGRAMMING | |
|---|---|
| EX.NO. | LIST OF VALUE ADDED EXPERIMENTS |
| 1 | To develop a system to manage Employee |
| 2 | To develop a system to Bank Account |
| 3 | To develop a system to manage student report card |
| 4 | Implement the concept of Classes and Objects using a real-world example. |
| 5 | Implement Selection Sort, and Merge sort algorithm. |
| NAME OF THE LABORATORY: DBMS LAB | |
|---|---|
| EX.NO. | LIST OF VALUE ADDED EXPERIMENTS |
| 1 | Mini Project (Application Development using (Oracle/MySQL)). e.g., E-learning Support System which has different modules like Admin, professor, student, and mentor. The first step is to register to access this website. In this system, we are providing discussion forums between students and professors. |
| 2 | Case Study: STUDENT PROGRESS MONITORING SYSTEM A database is to be designed for a college to monitor students' progress throughout their course of study. The students are reading for a degree (such as BA, BA(Hons), MSc, etc.) within the framework of the modular system. The college provides several modules, each being characterized by its code, title, credit value, module leader, teaching staff, and the department they come from. A module is coordinated by a module leader who shares teaching duties with one or more lecturers. ASSIGNMENT: Analyze the data required Normalize the attributes Create the logical data model using E-R diagram |
| 3 | GENERAL HOSPITAL A General Hospital consists of several specialized wards (such as Maternity, Podiatry, Oncology, etc.). Each ward hosts several patients, who were admitted on the recommendation of their own GP and confirmed by a consultant employed by the Hospital. On admission, the personal details of every patient are recorded. A separate register is to be held to store the information on the tests undertaken and the results of a prescribed treatment. Several tests may be conducted for each patient. Each patient is assigned to one leading consultant but may be examined by another doctor if required. Doctors are specialists in some branch of medicine and may be leading consultants for many patients, not necessarily from the same ward. ASSIGNMENT: Analyze the data required Normalize the attributes Create the logical data model using E-R diagrams |
| S. No | Name of the Laboratory | Equipment of Laboratory |
|---|---|---|
| 1 | Data Structure Lab |
CPU: Lenovo Processor: INTEL I5 RAM: 8 GB SSD: 256 GB Keyboard: ZEBION Mouse: ZEBION TFT: ZENITH LAN: 1Gbps UPS: 10KVA |
| 2 | Design and Analysis of Algorithms Lab | |
| 3 | Software Engineering Lab | |
| 4 | Computer Organization and Architecture Lab |
CPU: Lenovo Processor: INTEL I7 RAM: 16 GB SSD: 256 GB Keyboard: ZEBRONICS Mouse: ZEBRONICS TFT: ZEBRONICS LAN: 1Gbps UPS: 10KVA |
| 5 | Computer Network Lab | |
| 6 | Python Programming Lab | |
| 7 | Cyber Security Lab | |
| 8 | Web Technology Lab |
CPU: Lenovo Processor: INTEL I7 RAM: 16 GB SSD: 256 GB Keyboard: QUANTUM Mouse: QUANTUM TFT: ZENITH LAN: 1Gbps UPS: 10KVA |
| 9 | Web Designing Workshop | |
| 10 | Object Oriented Programming (Java) Lab | |
| 11 | Database Management System Lab |
CPU: Lenovo Processor: INTEL I7 RAM: 16 GB SSD: 256 GB Keyboard: QUANTUM Mouse: QUANTUM TFT: LENOVO LAN: 1Gbps UPS: 10KVA |
| 12 | Operating System Lab | |
| 13 | Project and Research Lab |
Compute Node: 5th Gen Intel® Xeon® Scalable, 6530 32 Cores, 64 Threads 4.0 GHz Max Turbo, 160 MB Cache Intel® UPI: 20 GT/s Master Node: 5th Gen Intel® Xeon® Scalable, 4510 12 Cores, 24 Threads 4.1 GHz Max Turbo, 30 MB Cache Intel® UPI: 16 GT/s System: HP Z4 G4 Workstation Intel Xeon W-2155 512 GB SSD, 64 GB RAM Nvidia Quadro P2000 HP 21.5" Monitor, USB Keyboard & Mouse LAN: 1Gbps UPS: 10KVA |
| 14 | Mini Project Lab |
CPU: Lenovo Processor: INTEL I5 RAM: 8 GB SSD: 256 GB Keyboard: QUANTUM Mouse: QUANTUM TFT: ACER LAN: 1Gbps UPS: 10KVA |