đ 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 Lloyd's K-Means unsupervised clustering algorithm from scratch with iterative centroid reassignment and inertia calculation.
Prerequisites & Domain Concepts
Multidimensional geometry, Euclidean distance, arithmetic mean, unsupervised learning concepts.
Asymptotic Complexity Bounds
âĸ Time Complexity: O(I * K * N * D) where I is iterations, K is clusters, N is samples, and D is dimensions
âĸ Space Complexity: O(N * D + K * D) for storing points and cluster centroids
Step-by-Step Algorithm
- Step 1: Define dataset X with 2D coordinates.
- Step 2: Choose K=2 and initialize centroids (e.g. first K points or random samples).
- Step 3: In Assignment step: For each point x in X, find centroid c_k with minimum Euclidean distance; assign x to cluster k.
- Step 4: In Update step: For each cluster k, calculate new centroid as the average of all assigned points.
- Step 5: Compute total centroid displacement delta = sum(||new_c - old_c||).
- Step 6: If delta < tolerance or max_iters reached, stop; otherwise repeat from Step 3.
- Step 7: Compute final Inertia (WCSS) and output cluster memberships.
Verified Academic Source Code (PYTHON)
import math
class KMeansClustering:
def __init__(self, k=2, max_iters=50, tol=1e-4):
self.k = k
self.max_iters = max_iters
self.tol = tol
self.centroids = []
self.clusters = {}
def _dist(self, p1, p2):
return math.sqrt(sum((a - b) ** 2 for a, b in zip(p1, p2)))
def fit(self, X):
# Step 1: Initialize centroids with first K data points
self.centroids = [list(pt) for pt in X[:self.k]]
print(f"=== K-Means Clustering Initiated (K={self.k}) ===")
for i, c in enumerate(self.centroids):
print(f"Initial Centroid {i}: ({c[0]:.2f}, {c[1]:.2f})")
print()
for iteration in range(1, self.max_iters + 1):
# Assignment Step: Clear and re-populate clusters
self.clusters = {i: [] for i in range(self.k)}
for pt in X:
# Find nearest centroid
distances = [self._dist(pt, c) for c in self.centroids]
closest_idx = distances.index(min(distances))
self.clusters[closest_idx].append(pt)
# Update Step: Recalculate centroids as cluster means
new_centroids = []
displacement = 0.0
for i in range(self.k):
pts = self.clusters[i]
if len(pts) > 0:
mean_x = sum(p[0] for p in pts) / len(pts)
mean_y = sum(p[1] for p in pts) / len(pts)
new_c = [mean_x, mean_y]
else:
new_c = self.centroids[i] # Keep empty centroid
displacement += self._dist(self.centroids[i], new_c)
new_centroids.append(new_c)
print(f"Iteration {iteration:2d} | Centroid Movement: {displacement:8.5f}")
self.centroids = new_centroids
# Check convergence
if displacement < self.tol:
print(f"\n>>> Converged at Iteration {iteration}! Displacement < {self.tol}")
break
# Compute Inertia (WCSS)
inertia = 0.0
for i in range(self.k):
for pt in self.clusters[i]:
inertia += self._dist(pt, self.centroids[i]) ** 2
return inertia
# Sample 2D Customer Data (Annual Income in $k, Spending Score 1-100)
X_data = [
[15.0, 39.0], [16.0, 41.0], [17.0, 35.0], [18.0, 42.0], # Group 1
[85.0, 80.0], [87.0, 85.0], [88.0, 82.0], [90.0, 88.0] # Group 2
]
kmeans = KMeansClustering(k=2)
final_inertia = kmeans.fit(X_data)
print(f"\nFinal Inertia (Within-Cluster Sum of Squares): {final_inertia:.2f}")
print("\nFinal Cluster Summary:")
for i in range(kmeans.k):
c = kmeans.centroids[i]
pts = kmeans.clusters[i]
print(f"Cluster {i} Centroid: ({c[0]:.2f}, {c[1]:.2f}) | Members: {len(pts)} points")
Sample Test Input
X_data: 8 customer points split into two clear clusters; K=2
Expected Terminal Output
=== K-Means Clustering Initiated (K=2) ===
Initial Centroid 0: (15.00, 39.00)
Initial Centroid 1: (16.00, 41.00)
Iteration 1 | Centroid Movement: 69.13600
Iteration 2 | Centroid Movement: 0.00000
>>> Converged at Iteration 2! Displacement < 0.0001
Final Inertia (Within-Cluster Sum of Squares): 75.50
Final Cluster Summary:
Cluster 0 Centroid: (16.50, 39.25) | Members: 4 points
Cluster 1 Centroid: (87.50, 83.75) | Members: 4 points
University Viva Voce Questions & Model Answers:
âĸ Q: What is the objective function of K-Means clustering?
âĸ Answer: Minimizing Within-Cluster Sum of Squares (WCSS) or Inertia, which is the sum of squared Euclidean distances between each point and its assigned cluster centroid.
âĸ Q: How does K-Means++ improve standard random centroid initialization?
âĸ Answer: K-Means++ selects the first centroid randomly, then selects each subsequent centroid with probability proportional to the squared distance from the nearest existing centroid, spreading centroids apart.
âĸ Q: What is the Elbow Method and how is it used?
âĸ Answer: The Elbow Method plots WCSS against different values of K. The optimal K is selected at the "elbow" bend where the rate of WCSS reduction sharply diminishes.
âĸ Q: What are the primary limitations of K-Means clustering?
âĸ Answer: It assumes clusters are spherical and isotropic with similar sizes; it is sensitive to outliers and initial centroid positions; and it requires specifying K beforehand.
âĸ Q: Can K-Means guarantee finding the global minimum?
âĸ Answer: No. Lloyd's algorithm is guaranteed to converge, but it converges to a local minimum depending on initial centroid choices. Running multiple random initializations (n_init) helps find better minima.