🎓 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 1: Deterministic Finite Automaton (DFA) Language Recognition Simulator

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

📋 Experiment Overview & Curriculum Specifications

Theory of Computation & Discrete Math â€ĸ Easy â€ĸ 25 mins

Aim / Objective: To formulate, implement, and analyze a formal Deterministic Finite Automaton (DFA) 5-tuple machine (Q, Sigma, delta, q0, F) recognizing regular binary languages.

Prerequisites & Domain Concepts

Formal languages, regular expressions, set theory, state transition graphs.

Asymptotic Complexity Bounds

â€ĸ Time Complexity: O(N) where N is length of input string (strictly 1 transition per character)
â€ĸ Space Complexity: O(1) memory overhead storing current state scalar

Step-by-Step Algorithm

  1. Step 1: Define states Q = {q0, q1, q2}, alphabet Sigma = {'0', '1'}, start state q0 = 'q0', and accepting states F = {'q2'}.
  2. Step 2: Define transition delta table: delta(q0, '0')='q1', delta(q0, '1')='q0', delta(q1, '0')='q1', delta(q1, '1')='q2', delta(q2, '0')='q1', delta(q2, '1')='q0'.
  3. Step 3: Construct DFASimulator class taking states, alphabet, transitions, start_state, and accept_states.
  4. Step 4: Implement process_string(input_str): initialize curr_state = start_state. Record state trace.
  5. Step 5: For each symbol in input_str: check if symbol in Sigma; lookup next_state = delta(curr_state, symbol); update curr_state.
  6. Step 6: Check if final curr_state in accept_states: if yes, return ACCEPT; else REJECT.
  7. Step 7: Test strings: "1001" (accept), "1010" (reject), "01" (accept), "1110" (reject).
  8. Step 8: Output transition execution trace and state machine verification.

Verified Academic Source Code (PYTHON)

class DeterministicFiniteAutomaton:
    def __init__(self, states, alphabet, transition_fn, start_state, accept_states):
        self.states = set(states)
        self.alphabet = set(alphabet)
        self.transition = transition_fn # dict: (state, symbol) -> next_state
        self.start_state = start_state
        self.accept_states = set(accept_states)

    def process(self, input_string):
        current_state = self.start_state
        trace = [(None, current_state)] # (symbol, state)

        for symbol in input_string:
            if symbol not in self.alphabet:
                raise ValueError(f"Symbol '{symbol}' not in alphabet {self.alphabet}")

            next_state = self.transition.get((current_state, symbol))
            if next_state is None:
                raise ValueError(f"Undefined transition from state '{current_state}' on symbol '{symbol}'")

            trace.append((symbol, next_state))
            current_state = next_state

        is_accepted = current_state in self.accept_states
        return is_accepted, current_state, trace

# DFA Definition: Accepts binary strings ending in "01"
# States:
#   q0: Start / Initial state (last seen was '1' or nothing)
#   q1: Last seen was '0' (potential start of "01")
#   q2: Accepting state (just witnessed "01")
states = {'q0', 'q1', 'q2'}
alphabet = {'0', '1'}
start = 'q0'
accepting = {'q2'}

# Transition Function delta: Q x Sigma -> Q
transitions = {
    ('q0', '0'): 'q1',
    ('q0', '1'): 'q0',
    ('q1', '0'): 'q1',
    ('q1', '1'): 'q2',
    ('q2', '0'): 'q1',
    ('q2', '1'): 'q0'
}

dfa = DeterministicFiniteAutomaton(states, alphabet, transitions, start, accepting)

print("=== Deterministic Finite Automaton (DFA) Simulator ===")
print("Language Recognized : L = { w in {0, 1}* | w ends in '01' }")
print("Formal 5-Tuple Definition: M = (Q, Sigma, delta, q0, F)")
print(f"  Q     (States)           : {states}")
print(f"  Sigma (Alphabet)         : {alphabet}")
print(f"  q0    (Start State)      : {start}")
print(f"  F     (Accepting States) : {accepting}\n")

test_strings = ["1001", "1010", "01", "1110", "0000", "1101"]

print(f"{'Input String':>14} | {'Decision':>10} | {'End State':>10} | {'State Transition Trace':>35}")
print("-" * 75)

for test_str in test_strings:
    accepted, final_st, trace = dfa.process(test_str)
    decision = "[ACCEPTED]" if accepted else "[REJECTED]"

    # Format trace: q0 ->(1)-> q0 ->(0)-> q1 ...
    trace_steps = [trace[0][1]]
    for sym, st in trace[1:]:
        trace_steps.append(f"--({sym})--> {st}")
    trace_str = " ".join(trace_steps)

    print(f"{test_str:>14} | {decision:>10} | {final_st:>10} | {trace_str:>35}")
â–ļ Run in Online IDE

Sample Test Input

Binary test strings: "1001", "1010", "01", "1110", "0000", "1101"

Expected Terminal Output

=== Deterministic Finite Automaton (DFA) Simulator ===
Language Recognized : L = { w in {0, 1}* | w ends in '01' }
Formal 5-Tuple Definition: M = (Q, Sigma, delta, q0, F)
  Q     (States)           : {'q1', 'q0', 'q2'}
  Sigma (Alphabet)         : {'0', '1'}
  q0    (Start State)      : q0
  F     (Accepting States) : {'q2'}

  Input String |   Decision |  End State |              State Transition Trace
---------------------------------------------------------------------------
          1001 | [ACCEPTED] |         q2 | q0 --(1)--> q0 --(0)--> q1 --(0)--> q1 --(1)--> q2
          1010 | [REJECTED] |         q1 | q0 --(1)--> q0 --(0)--> q1 --(1)--> q2 --(0)--> q1
            01 | [ACCEPTED] |         q2 |             q0 --(0)--> q1 --(1)--> q2
          1110 | [REJECTED] |         q1 | q0 --(1)--> q0 --(1)--> q0 --(1)--> q0 --(0)--> q1
          0000 | [REJECTED] |         q1 | q0 --(0)--> q1 --(0)--> q1 --(0)--> q1 --(0)--> q1
          1101 | [ACCEPTED] |         q2 | q0 --(1)--> q0 --(1)--> q0 --(0)--> q1 --(1)--> q2
University Viva Voce Questions & Model Answers:

â€ĸ Q: What is the formal 5-tuple mathematical definition of a DFA?
â€ĸ Answer: M = (Q, Sigma, delta, q0, F), where Q is a finite set of states, Sigma is a finite alphabet, delta is the transition function Q x Sigma -> Q, q0 is the initial start state, and F is the subset of final/accepting states.

â€ĸ Q: How does a DFA differ from a Non-Deterministic Finite Automaton (NFA)?
â€ĸ Answer: In a DFA, for every state and input symbol, there is exactly one deterministic next state, and epsilon (empty) transitions are forbidden. In an NFA, a state can transition to zero, one, or multiple states on a single symbol, and epsilon transitions are allowed.

â€ĸ Q: Are NFAs more powerful than DFAs in terms of language recognition?
â€ĸ Answer: No. By the Powerset Construction (Subset Construction) theorem, every NFA can be converted into an equivalent DFA that recognizes the identical regular language, although the DFA may have up to 2^|Q| states in the worst case.

â€ĸ Q: What is the Pumping Lemma for Regular Languages?
â€ĸ Answer: It states that for any regular language L, there exists a pumping length p such that any string w in L with |w| >= p can be partitioned into w = xyz satisfying |y| > 0, |xy| <= p, and for all i >= 0, xy^i z is in L. It is used to prove that non-regular languages (like 0^n 1^n) cannot be recognized by finite automata.

â€ĸ Q: What is DFA State Minimization (Hopcroft's Algorithm)?
â€ĸ Answer: DFA minimization finds the unique minimal DFA with the smallest number of states that recognizes the same language, by iteratively partitioning states into equivalence classes of indistinguishable states and merging them.