๐ŸŽ“ University Curriculum & Practical Lab Manuals

Computer Science Practical Labs Catalog

Explore 14 standardized computer science practical laboratory categories. Every experiment includes formal Aims, Learning Objectives, Algorithms, Verified Source Code, Sample Inputs/Outputs, Test Cases, and Viva Voce Q&As.

Categories: 14 Subjects (A to N)
Format: 18-Point Standard
Execution: Client-Side & 100% Free
Direct: 1-Click Open in IDE
Syllabus Completion 0 / 84
Avg Quiz Score -
Bookmarked Labs 0
โšก
Microprocessor & Microcontroller (MPMC) Simulator 8085 โ€ข 8086 โ€ข 8051
Simulate assembly code, input data into memory, inspect live registers, flags, and step-by-step outputs.
Launch MPMC Simulator โ†’
How to Use Curriculum Labs: Select your department and semester below to filter matching syllabus experiments. Click any lab card to open interactive theory, algorithm flowchart, and runnable in-browser code.
Department:
6 Academic Tracks โ€ข 84 Experiments
Semester:

๐Ÿ”ฌ University Practical Laboratory Curriculum & Viva Voce Manual

Standardized undergraduate computer science and engineering laboratory syllabus reference. Includes rigorous algorithms, complete runnable source implementations, expected outputs, time complexity bounds, viva questions, and the official 18-point university lab record documentation format.

๐Ÿ“‹ Official 18-Point University Lab Record Standardization Format

Academic Compliance โ€ข AICTE & ABET Guidelines

To ensure strict adherence to university academic grading criteria and accreditation bodies, every engineering practical laboratory experiment on VAB-CODE follows the standardized 18-point documentation structure:

Points 1 to 9: Formulation & Design

1. Experiment Title & Date: Clear curricular identifier.
2. Aim / Problem Statement: Concise statement of technical objective.
3. Apparatus & Software Environment: Compiler versions (GCC, Java 17, Python 3.11, MySQL).
4. Learning Objectives: Specific skills and competencies acquired.
5. Theoretical Background: Underlying mathematical or algorithmic foundations.
6. Mathematical Equations: Formal equations, asymptotic bounds, and formulas.
7. Architectural Flowchart: Logic diagram depicting program execution flow.
8. Step-by-Step Algorithm: Language-agnostic pseudocode steps.
9. Input Data Specifications: Domain constraints and variable ranges.

Points 10 to 18: Implementation & Evaluation

10. Complete Source Code: Syntactically verified and fully indented code.
11. Comments & Error Handling: Boundary safety and explanatory annotations.
12. Compilation & Build Commands: Exact terminal CLI invocation.
13. Sample Test Case (Nominal): Standard expected input and output.
14. Boundary Test Case (Edge): Zero, null, negative, or max-scale inputs.
15. Expected Terminal Output: Exact stdout transcript.
16. Result & Conclusion: Verification that the stated aim was fulfilled.
17. Viva Voce Questions & Model Answers: Oral examination preparation.
18. Academic References: Standard textbooks (Cormen, Silberschatz, Tanenbaum).

๐Ÿ’ป Academic Track 1: Programming Fundamentals & Data Structures

Pointers โ€ข Dynamic Memory (malloc/free) โ€ข Linear & Non-Linear Lists

Data structures establish memory layout models and access patterns for algorithmic processing. Linear data structures (arrays, linked lists, stacks, queues) enforce sequential predecessor-successor relationships, whereas non-linear structures (trees, graphs) represent hierarchical and arbitrary network topologies.

Experiment 1: Implementation of Singly Linked List Operations

Aim: To write a modular C program to implement dynamic singly linked list operations: insertion at beginning/end, deletion by value, reversal of nodes, and display.
Algorithm:
1. Define struct Node containing integer data and pointer struct Node* next.
2. Insert at Beginning: Allocate memory via malloc(sizeof(struct Node)). Set newNode->next = head; update head = newNode.
3. Reverse: Initialize three pointers: prev = NULL, curr = head, next = NULL. In a loop while curr != NULL: save next = curr->next; reverse pointer curr->next = prev; advance prev = curr; advance curr = next. Set head = prev.

#include <stdio.h> #include <stdlib.h> struct Node { int data; struct Node* next; }; struct Node* insertBeginning(struct Node* head, int val) { struct Node* newNode = (struct Node*)malloc(sizeof(struct Node)); if (!newNode) { printf("Memory allocation failed!\n"); exit(1); } newNode->data = val; newNode->next = head; return newNode; } struct Node* reverseList(struct Node* head) { struct Node *prev = NULL, *curr = head, *next = NULL; while (curr != NULL) { next = curr->next; curr->next = prev; prev = curr; curr = next; } return prev; } void printList(struct Node* head) { struct Node* temp = head; while (temp) { printf("%d -> ", temp->data); temp = temp->next; } printf("NULL\n"); }
Viva Voce Questions:
โ€ข Q: Why is pointer reversal performed in $O(1)$ auxiliary space?
โ€ข Answer: Three temporary pointer variables (prev, curr, next) are reused across all loop iterations without allocating new heap memory, bounding space to $O(1)$.

โ˜• Academic Track 2: Object-Oriented Programming & Multi-Threading (Java)

Encapsulation โ€ข Polymorphism โ€ข Synchronized Monitors โ€ข Thread Safety

Object-oriented design organizes code around self-contained entities (objects) encapsulating state (attributes) and behavior (methods). Java implements concurrency using monitors and intrinsic thread locks.

Experiment 2: Inter-Thread Communication (Producer-Consumer Problem)

Aim: To demonstrate thread synchronization and inter-thread signaling in Java using a bounded buffer with synchronized methods, wait(), and notify().
Theory: When multiple concurrent threads access shared mutable state, race conditions emerge. Using intrinsic object monitors, the Producer thread waits when the buffer is full, and the Consumer thread waits when the buffer is empty.

import java.util.LinkedList; import java.util.Queue; class BoundedBuffer { private final Queue<Integer> queue = new LinkedList<>(); private final int CAPACITY = 5; public synchronized void produce(int item) throws InterruptedException { while (queue.size() == CAPACITY) { wait(); // Buffer full: release monitor and sleep } queue.add(item); System.out.println("Produced: " + item + " | Buffer size: " + queue.size()); notifyAll(); // Wake up waiting consumer threads } public synchronized int consume() throws InterruptedException { while (queue.isEmpty()) { wait(); // Buffer empty: release monitor and sleep } int item = queue.poll(); System.out.println("Consumed: " + item + " | Buffer size: " + queue.size()); notifyAll(); // Wake up waiting producer threads return item; } }
Viva Voce Questions:
โ€ข Q: Why must wait() always be called inside a while loop instead of an if statement?
โ€ข Answer: To guard against spurious wakeups, where a thread resumes execution without an explicit signal. The while loop re-checks the condition predicate before proceeding.

๐Ÿ—„๏ธ Academic Track 3: Database Management Systems & SQL Lab

Relational Algebra โ€ข Multi-Table Joins โ€ข Triggers & Stored Procedures

Relational databases store structured schemas governed by foreign keys and integrity constraints. SQL provides declarative data definition (DDL) and manipulation (DML).

Experiment 3: SQL Relational Queries, Grouping & Triggers

Aim: Create a University database schema (Department, Student, Course, Enrollment) and execute nested queries with GROUP BY, HAVING, and an automated audit trigger.

-- Schema Definition CREATE TABLE Student ( student_id INT PRIMARY KEY, name VARCHAR(50) NOT NULL, dept_id INT, gpa DECIMAL(3,2) ); CREATE TABLE CourseEnrollment ( enrollment_id INT PRIMARY KEY, student_id INT, course_name VARCHAR(50), grade VARCHAR(2), FOREIGN KEY (student_id) REFERENCES Student(student_id) ); -- Advanced Aggregation Query: Students with above-average GPA per Department SELECT s.student_id, s.name, s.gpa, s.dept_id FROM Student s WHERE s.gpa > ( SELECT AVG(s2.gpa) FROM Student s2 WHERE s2.dept_id = s.dept_id );
Viva Voce Questions:
โ€ข Q: What is the semantic difference between WHERE and HAVING in SQL?
โ€ข Answer: The WHERE clause filters individual records before aggregation occurs; the HAVING clause filters aggregated groups produced by GROUP BY.

โš™๏ธ Academic Track 4: Operating Systems & POSIX Systems Programming

Process Management (fork/exec) โ€ข CPU Scheduling โ€ข Pipes & IPC

System programming interfaces directly with the operating system kernel via system calls to manage processes, file descriptors, and virtual memory.

Experiment 4: Round Robin CPU Scheduling Simulation in C

Aim: Implement Round Robin scheduling with a given time quantum $Q$ to compute turnaround times, waiting times, and average response metrics.

#include <stdio.h> void roundRobin(int n, int burst[], int quantum) { int rem_burst[n]; for (int i = 0; i < n; i++) rem_burst[i] = burst[i]; int t = 0; // Current time int wait_time[n]; for (int i = 0; i < n; i++) wait_time[i] = 0; while (1) { int done = 1; for (int i = 0; i < n; i++) { if (rem_burst[i] > 0) { done = 0; if (rem_burst[i] > quantum) { t += quantum; rem_burst[i] -= quantum; } else { t += rem_burst[i]; wait_time[i] = t - burst[i]; rem_burst[i] = 0; } } } if (done == 1) break; } printf("PID\tBurst\tWaiting\tTurnaround\n"); for (int i = 0; i < n; i++) { printf("P%d\t%d\t%d\t%d\n", i+1, burst[i], wait_time[i], wait_time[i] + burst[i]); } }
Viva Voce Questions:
โ€ข Q: How does time quantum size affect Round Robin performance?
โ€ข Answer: An excessively large time quantum reduces Round Robin to FCFS; an excessively small quantum causes high context-switching overhead, degrading CPU throughput.

๐ŸŒ Academic Track 5: Computer Networks & Socket Programming

TCP/IP Sockets โ€ข Client-Server Model โ€ข Packet Sniffing & Routing

Socket programming enables inter-process network communication across distributed machines using IP addressing and port numbers.

Experiment 5: Client-Server TCP Echo Socket in Python

Aim: Implement an iterative TCP echo server and client using the standard Python socket library.

# Python 3: TCP Echo Server Implementation import socket def run_server(): server_sock = socket.socket(socket.AF_INET, socket.SOCK_STREAM) server_sock.setsockopt(socket.SOL_SOCKET, socket.SO_REUSEADDR, 1) server_sock.bind(('127.0.0.1', 8080)) server_sock.listen(5) print("TCP Server listening on 127.0.0.1:8080...") while True: client_sock, client_addr = server_sock.accept() print(f"Connection established from {client_addr}") data = client_sock.recv(1024) if data: print(f"Received payload: {data.decode()}") client_sock.sendall(data) # Echo data back client_sock.close()
Viva Voce Questions:
โ€ข Q: Why is SO_REUSEADDR recommended for TCP server sockets?
โ€ข Answer: It allows the server to immediately re-bind to the port even if previously closed sockets remain in the kernel's TIME_WAIT state.

๐Ÿค– Academic Track 6: AI, Machine Learning & Computer Vision

Supervised Learning โ€ข Feature Scaling โ€ข Confusion Matrix โ€ข Scikit-Learn

Machine learning builds predictive data-driven models by discovering functional mappings $f(X) \approx Y$ from empirical training sets.

Experiment 6: Supervised Classification with Decision Trees & Evaluation

Aim: Train a Decision Tree classifier, compute the Confusion Matrix, and calculate Accuracy, Precision, Recall, and F1-Score metrics.

from sklearn.datasets import load_iris from sklearn.model_selection import train_test_split from sklearn.tree import DecisionTreeClassifier from sklearn.metrics import classification_report, confusion_matrix # Load dataset and partition 80/20 iris = load_iris() X_train, X_test, y_train, y_test = train_test_split(iris.data, iris.target, test_size=0.2, random_state=42) # Train Decision Tree with Gini Impurity clf = DecisionTreeClassifier(criterion='gini', max_depth=3, random_state=42) clf.fit(X_train, y_train) # Evaluate model predictions y_pred = clf.predict(X_test) print("Confusion Matrix:\n", confusion_matrix(y_test, y_pred)) print("\nClassification Report:\n", classification_report(y_test, y_pred, target_names=iris.target_names))
Viva Voce Questions:
โ€ข Q: Why is Precision preferred over Accuracy in imbalanced datasets?
โ€ข Answer: Accuracy is deceptive when the majority class dominates (e.g. 99% negative cases); Precision ($TP / (TP + FP)$) measures exactness among positive predictions regardless of negative class volume.

๐Ÿ”ฌ Experiment 5: Infix to Postfix Conversion using Dijkstra's Shunting-Yard Algorithm

Standardized university practical engineering curriculum manual across Computer Science and Information Technology degree programs.

๐Ÿ“‹ Experiment Overview & Curriculum Specifications

Theory of Computation & Discrete Math โ€ข Medium โ€ข 30 mins

Aim / Objective: To formulate, implement, and analyze Edsger Dijkstra's Shunting-Yard Algorithm (1961) for converting standard infix mathematical expressions to Reverse Polish Notation (Postfix) using an operator stack.

Prerequisites & Domain Concepts

Stack data structure (LIFO: push/pop), operator precedence, string tokenization.

Asymptotic Complexity Bounds

โ€ข Time Complexity: O(N) linear in number of expression tokens
โ€ข Space Complexity: O(N) for operator stack and output queue

Step-by-Step Algorithm

  1. Step 1: Define operator precedence dictionary: { '+': 1, '-': 1, '*': 2, '/': 2, '^': 3 } and associativity ('^' is Right-associative, others Left-associative).
  2. Step 2: Initialize output_queue = [] and operator_stack = [].
  3. Step 3: Scan tokens from left to right:
  4. Step 4: If token is an operand (number/variable), append directly to output_queue.
  5. Step 5: If token is '(', push onto operator_stack.
  6. Step 6: If token is ')', pop operators from stack to output_queue until '(' is encountered; discard '('.
  7. Step 7: If token is an operator op1: while stack top is an operator op2 with higher precedence (or equal precedence and left-associative), pop op2 to output_queue; push op1.
  8. Step 8: Pop all remaining operators from stack to output_queue.
  9. Step 9: Evaluate resulting postfix using an operand stack.

Verified Academic Source Code (PYTHON)

import re

class ShuntingYardConverter:
    PRECEDENCE = {'+': 1, '-': 1, '*': 2, '/': 2, '^': 3}
    RIGHT_ASSOCIATIVE = {'^'}

    @classmethod
    def infix_to_postfix(cls, expression):
        tokens = re.findall(r'(\d+|[a-zA-Z]+|\^|\*|\/|\+|\-|\(|\))', expression)
        output_queue = []
        op_stack = []

        for token in tokens:
            if token.isalnum(): # Operand (Variable or Number)
                output_queue.append(token)
            elif token in cls.PRECEDENCE: # Operator
                op1 = token
                while op_stack and op_stack[-1] != '(':
                    op2 = op_stack[-1]
                    p1 = cls.PRECEDENCE[op1]
                    p2 = cls.PRECEDENCE.get(op2, 0)

                    # Precedence and Associativity rule check
                    if (p2 > p1) or (p2 == p1 and op1 not in cls.RIGHT_ASSOCIATIVE):
                        output_queue.append(op_stack.pop())
                    else:
                        break
                op_stack.append(op1)
            elif token == '(':
                op_stack.append(token)
            elif token == ')':
                while op_stack and op_stack[-1] != '(':
                    output_queue.append(op_stack.pop())
                if not op_stack:
                    raise ValueError("Mismatched parentheses (Missing '(')")
                op_stack.pop() # Discard '('

        # Drain remaining operators
        while op_stack:
            top = op_stack.pop()
            if top in ('(', ')'):
                raise ValueError("Mismatched parentheses")
            output_queue.append(top)

        return output_queue

    @staticmethod
    def evaluate_postfix(postfix_tokens):
        """Evaluates Reverse Polish Notation using an operand evaluation stack"""
        stack = []
        for token in postfix_tokens:
            if token.isdigit():
                stack.append(float(token))
            else: # Operator
                b = stack.pop()
                a = stack.pop()
                if token == '+': res = a + b
                elif token == '-': res = a - b
                elif token == '*': res = a * b
                elif token == '/': res = a / b
                elif token == '^': res = a ** b
                stack.append(res)
        return stack[0]

# Execution Simulation
expr_symbolic = "(A + B) * C - (D / E) ^ F"
expr_numeric = "(3 + 4) * 2 - (8 / 2) ^ 2"

print("=== Dijkstra's Shunting-Yard Algorithm ===")
print(f"1. Infix Expression (Symbolic) : {expr_symbolic}")
postfix_sym = ShuntingYardConverter.infix_to_postfix(expr_symbolic)
print(f"   Postfix (Reverse Polish)    : {' '.join(postfix_sym)}\n")

print(f"2. Infix Expression (Numeric)  : {expr_numeric}")
postfix_num = ShuntingYardConverter.infix_to_postfix(expr_numeric)
print(f"   Postfix (Reverse Polish)    : {' '.join(postfix_num)}")

eval_result = ShuntingYardConverter.evaluate_postfix(postfix_num)
print(f"   Evaluated Result            : {eval_result:.1f}")

# Verification: (7 * 2) - (4 ^ 2) = 14 - 16 = -2
expected_val = (3 + 4) * 2 - (8 / 2) ** 2
print(f"   Manual Verification         : (7 * 2) - (4 ^ 2) = 14 - 16 = {expected_val:.1f} [MATCH]")
โ–ถ Run in Online IDE

Sample Test Input

Infix symbolic "(A + B) * C - (D / E) ^ F" and numeric "(3 + 4) * 2 - (8 / 2) ^ 2"

Expected Terminal Output

=== Dijkstra's Shunting-Yard Algorithm ===
1. Infix Expression (Symbolic) : (A + B) * C - (D / E) ^ F
   Postfix (Reverse Polish)    : A B + C * D E / F ^ -

2. Infix Expression (Numeric)  : (3 + 4) * 2 - (8 / 2) ^ 2
   Postfix (Reverse Polish)    : 3 4 + 2 * 8 2 / 2 ^ -
   Evaluated Result            : -2.0
   Manual Verification         : (7 * 2) - (4 ^ 2) = 14 - 16 = -2.0 [MATCH]
University Viva Voce Questions & Model Answers:

โ€ข Q: Why is Reverse Polish Notation (Postfix) advantageous for computer hardware and virtual machines?
โ€ข Answer: Postfix expressions require zero parentheses and zero operator precedence lookup tables. A computer can evaluate a postfix expression in a single linear pass using a simple LIFO stack, which is how Forth, PostScript, and Java Bytecode execution engines operate.

โ€ข Q: How does the Shunting-Yard Algorithm handle operator associativity?
โ€ข Answer: For left-associative operators (like +, -, *, /), an incoming operator pops stack operators of equal or higher precedence. For right-associative operators (like exponentiation ^), it only pops operators of strictly higher precedence, allowing right-nested binding.

โ€ข Q: Why was the algorithm named "Shunting-Yard"?
โ€ข Answer: Edsger Dijkstra visualized the algorithm as a railroad switching yard (shunting yard): train cars (tokens) move down the track; operands pass straight through to the departure line, while operators are shunted onto a siding track (the stack) until needed.

โ€ข Q: What is the difference between Prefix (Polish) and Postfix (Reverse Polish) notation?
โ€ข Answer: Prefix notation (Polish) places operators before their operands (e.g. `+ 3 4`). Postfix notation (Reverse Polish) places operators after their operands (e.g. `3 4 +`). Both eliminate the need for parentheses.

โ€ข Q: What error indicates mismatched parentheses during the Shunting-Yard algorithm?
โ€ข Answer: If a right parenthesis `)` is encountered and the stack is emptied without finding a matching `(`, or if the stack still contains an unclosed `(` after all input tokens have been read.