🎓 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 2: Token Bucket Rate Limiter for Cloud Microservices & API Gateways

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

📋 Experiment Overview & Curriculum Specifications

Cloud Computing & DevOps â€ĸ Medium â€ĸ 30 mins

Aim / Objective: To formulate, implement, and analyze the Token Bucket rate-limiting algorithm from scratch for cloud API gateways with burst capacity handling and continuous token replenishment.

Prerequisites & Domain Concepts

API gateway concepts, timestamps, modular arithmetic, concurrency limits.

Asymptotic Complexity Bounds

â€ĸ Time Complexity: O(1) constant time per check; no loops or sleeping threads
â€ĸ Space Complexity: O(U) where U is the number of active client IP addresses

Step-by-Step Algorithm

  1. Step 1: Define TokenBucket class with capacity C, refill_rate R (tokens/sec), current tokens, and last_refill_time.
  2. Step 2: Implement _refill(current_time): compute elapsed = current_time - last_refill_time. Add elapsed * refill_rate tokens. Clamp tokens = min(capacity, tokens). Update last_refill_time.
  3. Step 3: Implement allow_request(cost=1, current_time): call _refill; if tokens >= cost: tokens -= cost and return True (ALLOW); else return False (REJECT).
  4. Step 4: Create a RateLimiterManager mapping client_id (e.g. IP or API key) to individual TokenBucket instances.
  5. Step 5: Configure bucket with capacity = 5 tokens and refill_rate = 2 tokens/second.
  6. Step 6: Simulate a burst of 7 instantaneous requests: verify 5 succeed and 2 are blocked (HTTP 429).
  7. Step 7: Advance simulated time by 1.5 seconds: verify 3 tokens replenished and allow new requests.
  8. Step 8: Output execution timeline and throttle analysis.

Verified Academic Source Code (PYTHON)

class TokenBucket:
    def __init__(self, capacity=5, refill_rate=2.0, initial_time=0.0):
        self.capacity = capacity
        self.refill_rate = refill_rate # tokens per second
        self.tokens = float(capacity)
        self.last_refill_time = initial_time

    def _refill(self, current_time):
        elapsed = current_time - self.last_refill_time
        if elapsed > 0:
            # Lazy continuous token replenishment: elapsed * rate
            self.tokens = min(float(self.capacity), self.tokens + (elapsed * self.refill_rate))
            self.last_refill_time = current_time

    def consume(self, cost=1, current_time=0.0):
        self._refill(current_time)
        if self.tokens >= cost:
            self.tokens -= cost
            return True, self.tokens
        return False, self.tokens

class ApiGatewayRateLimiter:
    def __init__(self, capacity=5, refill_rate=2.0):
        self.capacity = capacity
        self.refill_rate = refill_rate
        self.client_buckets = {}

    def is_allowed(self, client_id, current_time):
        if client_id not in self.client_buckets:
            self.client_buckets[client_id] = TokenBucket(
                capacity=self.capacity,
                refill_rate=self.refill_rate,
                initial_time=current_time
            )
        bucket = self.client_buckets[client_id]
        allowed, remaining_tokens = bucket.consume(cost=1, current_time=current_time)
        return allowed, remaining_tokens

# Execution Simulation with Mock Clock
limiter = ApiGatewayRateLimiter(capacity=5, refill_rate=2.0)
client_ip = "203.0.113.88"

print("=== Token Bucket Rate Limiter (API Gateway) ===")
print(f"Bucket Config: Capacity = 5 tokens | Refill Rate = 2.0 tokens/sec")
print(f"Client Under Test: {client_ip}\n")

# Phase 1: Sudden Burst of 7 Instantaneous Requests at Time = 0.0s
print("--- Phase 1: Rapid Burst (7 Requests at t = 0.00s) ---")
for req_num in range(1, 8):
    allowed, tokens_left = limiter.is_allowed(client_ip, current_time=0.0)
    status = "[HTTP 200: ALLOWED]" if allowed else "[HTTP 429: THROTTLED]"
    print(f"  Request {req_num:2d} (t=0.00s) -> {status} (Remaining Tokens: {tokens_left:.2f})")

# Phase 2: Wait 1.5 seconds (should replenish 1.5 * 2 = 3.0 tokens)
print("\n--- Phase 2: Advance Time by 1.5 seconds (t = 1.50s) ---")
time_now = 1.50
print(f"Client idle for 1.50s -> Refill expected: 1.50s * 2.0 tokens/s = 3.0 tokens")

for req_num in range(8, 12):
    allowed, tokens_left = limiter.is_allowed(client_ip, current_time=time_now)
    status = "[HTTP 200: ALLOWED]" if allowed else "[HTTP 429: THROTTLED]"
    print(f"  Request {req_num:2d} (t={time_now:.2f}s) -> {status} (Remaining Tokens: {tokens_left:.2f})")

# Phase 3: Steady-state requests spaced 0.5s apart (matching refill rate)
print("\n--- Phase 3: Steady-State Traffic (1 Request every 0.50s) ---")
for req_num in range(12, 16):
    time_now += 0.50 # Exactly matches refill rate: 0.5s * 2 = 1 token replenished!
    allowed, tokens_left = limiter.is_allowed(client_ip, current_time=time_now)
    status = "[HTTP 200: ALLOWED]" if allowed else "[HTTP 429: THROTTLED]"
    print(f"  Request {req_num:2d} (t={time_now:.2f}s) -> {status} (Remaining Tokens: {tokens_left:.2f})")
â–ļ Run in Online IDE

Sample Test Input

Capacity 5, refill rate 2 tokens/sec; 7 burst requests followed by time advance

Expected Terminal Output

=== Token Bucket Rate Limiter (API Gateway) ===
Bucket Config: Capacity = 5 tokens | Refill Rate = 2.0 tokens/sec
Client Under Test: 203.0.113.88

--- Phase 1: Rapid Burst (7 Requests at t = 0.00s) ---
  Request  1 (t=0.00s) -> [HTTP 200: ALLOWED] (Remaining Tokens: 4.00)
  Request  2 (t=0.00s) -> [HTTP 200: ALLOWED] (Remaining Tokens: 3.00)
  Request  3 (t=0.00s) -> [HTTP 200: ALLOWED] (Remaining Tokens: 2.00)
  Request  4 (t=0.00s) -> [HTTP 200: ALLOWED] (Remaining Tokens: 1.00)
  Request  5 (t=0.00s) -> [HTTP 200: ALLOWED] (Remaining Tokens: 0.00)
  Request  6 (t=0.00s) -> [HTTP 429: THROTTLED] (Remaining Tokens: 0.00)
  Request  7 (t=0.00s) -> [HTTP 429: THROTTLED] (Remaining Tokens: 0.00)

--- Phase 2: Advance Time by 1.5 seconds (t = 1.50s) ---
Client idle for 1.50s -> Refill expected: 1.50s * 2.0 tokens/s = 3.0 tokens
  Request  8 (t=1.50s) -> [HTTP 200: ALLOWED] (Remaining Tokens: 2.00)
  Request  9 (t=1.50s) -> [HTTP 200: ALLOWED] (Remaining Tokens: 1.00)
  Request 10 (t=1.50s) -> [HTTP 200: ALLOWED] (Remaining Tokens: 0.00)
  Request 11 (t=1.50s) -> [HTTP 429: THROTTLED] (Remaining Tokens: 0.00)

--- Phase 3: Steady-State Traffic (1 Request every 0.50s) ---
  Request 12 (t=2.00s) -> [HTTP 200: ALLOWED] (Remaining Tokens: 0.00)
  Request 13 (t=2.50s) -> [HTTP 200: ALLOWED] (Remaining Tokens: 0.00)
  Request 14 (t=3.00s) -> [HTTP 200: ALLOWED] (Remaining Tokens: 0.00)
  Request 15 (t=3.50s) -> [HTTP 200: ALLOWED] (Remaining Tokens: 0.00)
University Viva Voce Questions & Model Answers:

â€ĸ Q: How does the Token Bucket algorithm differ from the Leaky Bucket algorithm?
â€ĸ Answer: Token Bucket allows temporary burst traffic up to its bucket capacity C while enforcing average rate R. Leaky Bucket enforces a smooth, constant output rate, queuing or dropping bursts without permitting speed surges.

â€ĸ Q: Why is "Lazy Replenishment" superior to a recurring timer loop in rate limiting?
â€ĸ Answer: Running background timers for millions of clients wastes CPU and memory. Lazy replenishment computes token additions on-the-fly when a request arrives based on (now - last_time), requiring O(1) compute with zero background overhead.

â€ĸ Q: What HTTP status code and response headers should be returned when a rate limit is exceeded?
â€ĸ Answer: HTTP 429 Too Many Requests. Standard response headers include X-RateLimit-Limit (max capacity), X-RateLimit-Remaining (tokens left), and Retry-After (seconds until enough tokens replenish).

â€ĸ Q: What is the "Fixed Window Counter" vulnerability and how does Token Bucket fix it?
â€ĸ Answer: Fixed window resets counters at fixed boundary intervals (e.g. at the top of the minute). An attacker can send a full burst at 00:59 and another burst at 01:00, achieving 2x the allowed limit across that 2-second window. Token bucket continuously refills tokens, eliminating boundary edge spikes.

â€ĸ Q: How is rate limiting coordinated across multiple distributed API Gateway instances?
â€ĸ Answer: By storing token counts and timestamps in a centralized in-memory datastore like Redis. Atomic operations via Redis Lua scripts ensure race-free token deduction across multiple gateway instances.