đ 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
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).
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)$.
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.
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.
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.
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.
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.
Aim / Objective: To formulate, implement, and analyze Michael Nygard's Circuit Breaker finite state machine (CLOSED, OPEN, HALF-OPEN) from scratch to prevent cascading failures in cloud microservices.
Prerequisites & Domain Concepts
Distributed systems, finite state machines, timeouts, microservice architectures.
Asymptotic Complexity Bounds
âĸ Time Complexity: O(1) overhead wrapping function invocation
âĸ Space Complexity: O(1) tracking scalar state variables
Step-by-Step Algorithm
- Step 1: Define states: CLOSED, OPEN, HALF_OPEN.
- Step 2: Initialize failure_threshold = 3, recovery_timeout = 3.0s, failure_count = 0, state = CLOSED.
- Step 3: In execute(call_fn, *args): check if state == OPEN.
- Step 4: If state == OPEN: check if (current_time - last_failure_time) > recovery_timeout. If yes, transition to HALF_OPEN; else fail-fast and return fallback response.
- Step 5: Execute call_fn. If success: if state == HALF_OPEN, reset state = CLOSED and failure_count = 0. Return result.
- Step 6: If call_fn throws exception: increment failure_count. If failure_count >= failure_threshold, trip state = OPEN, record last_failure_time. Return fallback.
- Step 7: Simulate calling a flaky dependency over time: observe CLOSED -> OPEN -> Fast-Fail -> HALF-OPEN -> CLOSED recovery.
- Step 8: Output state transition log and resilience metrics.
Verified Academic Source Code (PYTHON)
class CircuitBreakerOpenException(Exception):
pass
class CircuitBreaker:
def __init__(self, failure_threshold=3, recovery_timeout=3.0):
self.failure_threshold = failure_threshold
self.recovery_timeout = recovery_timeout
self.state = "CLOSED"
self.failure_count = 0
self.last_failure_time = 0.0
def call(self, func, current_time, *args, **kwargs):
# 1. State: OPEN Check
if self.state == "OPEN":
elapsed = current_time - self.last_failure_time
if elapsed >= self.recovery_timeout:
self.state = "HALF-OPEN"
print(f" [STATE CHANGE: OPEN -> HALF-OPEN] Cooldown elapsed ({elapsed:.1f}s >= {self.recovery_timeout}s). Testing trial request...")
else:
# Fast-fail without hitting remote server
raise CircuitBreakerOpenException(f"Circuit is OPEN. Fast-failing request (Cooldown remaining: {self.recovery_timeout - elapsed:.1f}s)")
# 2. Execute call
try:
result = func(*args, **kwargs)
# Call succeeded!
if self.state == "HALF-OPEN":
self.state = "CLOSED"
self.failure_count = 0
print(f" [STATE CHANGE: HALF-OPEN -> CLOSED] Trial request succeeded! Circuit fully restored.")
elif self.state == "CLOSED":
self.failure_count = 0
return result
except Exception as e:
self.failure_count += 1
self.last_failure_time = current_time
print(f" -> Execution Failed: {e} (Failure Count: {self.failure_count}/{self.failure_threshold})")
if self.failure_count >= self.failure_threshold or self.state == "HALF-OPEN":
self.state = "OPEN"
print(f" [STATE CHANGE -> OPEN] Failure threshold breached! Tripping circuit breaker to OPEN.")
raise e
# Simulated Remote Microservice
def remote_payment_service(should_fail=False):
if should_fail:
raise ConnectionError("Remote Gateway Timeout (504)")
return {"status": "SUCCESS", "tx_id": "TX_99210"}
# Execution Simulation with Mock Clock
cb = CircuitBreaker(failure_threshold=3, recovery_timeout=3.0)
simulated_time = 0.0
print("=== Circuit Breaker Pattern for Microservice Resilience ===")
print(f"Config: Threshold = 3 failures | Recovery Cooldown = 3.0s | Initial State: {cb.state}\n")
# Phase 1: Normal Operation
print("--- Phase 1: Normal Operations (State: CLOSED) ---")
res = cb.call(lambda: remote_payment_service(should_fail=False), current_time=simulated_time)
print(f" Call Result: {res}\n")
# Phase 2: Remote service crashes; triggers 3 consecutive failures
print("--- Phase 2: Service Outage (3 Consecutive Failures) ---")
for i in range(1, 4):
simulated_time += 0.2
try:
cb.call(lambda: remote_payment_service(should_fail=True), current_time=simulated_time)
except Exception as err:
pass
print(f"Circuit Breaker Status: [{cb.state}]\n")
# Phase 3: Fast-Fail when Circuit is OPEN
print("--- Phase 3: Immediate Fast-Fail Calls (Protecting System Resources) ---")
for i in range(1, 3):
simulated_time += 0.5
try:
cb.call(lambda: remote_payment_service(should_fail=True), current_time=simulated_time)
except CircuitBreakerOpenException as cbe:
print(f" [FAST-FAIL INTERCEPTED] {cbe}")
print(f"Notice: Zero network requests reached the failing server during this phase.\n")
# Phase 4: Advance time past recovery cooldown (HALF-OPEN trial)
simulated_time += 3.5
print(f"--- Phase 4: Advance Time past Cooldown (Simulated Time: {simulated_time:.1f}s) ---")
# Remote service has recovered!
recovered_res = cb.call(lambda: remote_payment_service(should_fail=False), current_time=simulated_time)
print(f" Call Result: {recovered_res}")
print(f"Final Circuit State: [{cb.state}] (Ready for high throughput)")
Sample Test Input
3 failures trip circuit to OPEN; fast-fails requests during 3s cooldown; recovers on trial call
Expected Terminal Output
=== Circuit Breaker Pattern for Microservice Resilience ===
Config: Threshold = 3 failures | Recovery Cooldown = 3.0s | Initial State: CLOSED
--- Phase 1: Normal Operations (State: CLOSED) ---
Call Result: {'status': 'SUCCESS', 'tx_id': 'TX_99210'}
--- Phase 2: Service Outage (3 Consecutive Failures) ---
-> Execution Failed: Remote Gateway Timeout (504) (Failure Count: 1/3)
-> Execution Failed: Remote Gateway Timeout (504) (Failure Count: 2/3)
-> Execution Failed: Remote Gateway Timeout (504) (Failure Count: 3/3)
[STATE CHANGE -> OPEN] Failure threshold breached! Tripping circuit breaker to OPEN.
Circuit Breaker Status: [OPEN]
--- Phase 3: Immediate Fast-Fail Calls (Protecting System Resources) ---
[FAST-FAIL INTERCEPTED] Circuit is OPEN. Fast-failing request (Cooldown remaining: 2.5s)
[FAST-FAIL INTERCEPTED] Circuit is OPEN. Fast-failing request (Cooldown remaining: 2.0s)
Notice: Zero network requests reached the failing server during this phase.
--- Phase 4: Advance Time past Cooldown (Simulated Time: 4.6s) ---
[STATE CHANGE: OPEN -> HALF-OPEN] Cooldown elapsed (3.5s >= 3.0s). Testing trial request...
[STATE CHANGE: HALF-OPEN -> CLOSED] Trial request succeeded! Circuit fully restored.
Call Result: {'status': 'SUCCESS', 'tx_id': 'TX_99210'}
Final Circuit State: [CLOSED] (Ready for high throughput)
University Viva Voce Questions & Model Answers:
âĸ Q: What is a Cascading Failure in a microservice architecture?
âĸ Answer: When one upstream dependency fails or responds slowly, downstream services wait for timeouts, exhausting thread pools and memory until they also crash. This failure cascades across the entire architecture, taking down previously healthy services.
âĸ Q: What are the 3 states of a Circuit Breaker?
âĸ Answer: CLOSED (traffic flows normally; failures are counted), OPEN (requests fail immediately without hitting the remote dependency; allows the dependency to recover), and HALF-OPEN (allows a small trial canary request to test if the dependency has recovered).
âĸ Q: What is the "Fail-Fast" principle?
âĸ Answer: When a system knows an operation will fail, it reports failure immediately (in 0ms) rather than waiting for long network timeouts (e.g. 30 seconds), conserving client and server resources.
âĸ Q: What is the difference between Circuit Breaker and Retry with Exponential Backoff?
âĸ Answer: Retries are useful for isolated transient glitches. However, if a service is completely down, retrying hammers the struggling service with even more load (Retry Storm). A Circuit Breaker stops all calls to allow the service to recover.
âĸ Q: What is the Bulkhead Pattern and how does it complement Circuit Breakers?
âĸ Answer: The Bulkhead pattern isolates resources (e.g. separate thread pools or connection limits per service) so that if one external dependency hangs, it cannot exhaust the entire application's global thread pool.