đ 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 direct memory-mapped bitwise GPIO register operations (FIOxDIR, FIOxSET, FIOxCLR, FIOxPIN) on the NXP LPC-1768 ARM Cortex-M3 microcontroller.
Prerequisites & Domain Concepts
C bitwise operators (&, |, ^, ~, <<, >>), memory-mapped hardware pointers, hexadecimal notation.
Asymptotic Complexity Bounds
âĸ Time Complexity: O(1) single-cycle hardware register write instructions
âĸ Space Complexity: O(1) zero dynamic memory allocation
Step-by-Step Algorithm
- Step 1: Include LPC17xx.h hardware register definitions header.
- Step 2: Define bitmask for P1.19 to P1.22: (0x0F << 19) = (15 << 19).
- Step 3: Configure direction: LPC_GPIO1->FIODIR |= (0x0F << 19) to set pins 19-22 as outputs without disturbing other pins on Port 1.
- Step 4: Implement atomic pin write: to drive pin k HIGH, write LPC_GPIO1->FIOSET = (1 << k).
- Step 5: To drive pin k LOW, write LPC_GPIO1->FIOCLR = (1 << k).
- Step 6: In a main loop: iterate count from 0 to 15 (4-bit binary counter).
- Step 7: Clear all 4 pins using FIOCLR = (0x0F << 19); set active pins using FIOSET = (count << 19).
- Step 8: Execute calibrated delay loop and repeat.
Verified Academic Source Code (C)
/* LPC-1768 ARM Cortex-M3 GPIO Bitwise Control */
#include <stdio.h>
#include <stdint.h>
// Mock memory-mapped hardware register structure for simulation
typedef struct {
volatile uint32_t FIODIR; // Direction: 1 = Output, 0 = Input
volatile uint32_t RESERVED[3];
volatile uint32_t FIOMASK; // Port Mask Register
volatile uint32_t FIOPIN; // Port Pin Value Register
volatile uint32_t FIOSET; // Output Set Register (Write 1 -> Pin HIGH)
volatile uint32_t FIOCLR; // Output Clear Register (Write 1 -> Pin LOW)
} LPC_GPIO_TypeDef;
// Simulated Memory-Mapped Port 1
LPC_GPIO_TypeDef LPC_GPIO1_Instance = {0};
LPC_GPIO_TypeDef *LPC_GPIO1 = &LPC_GPIO1_Instance;
void gpio_init_leds(void) {
// Configure P1.19 to P1.22 as outputs (Bits 19, 20, 21, 22)
// 0x0F << 19 sets 4 consecutive bits high
LPC_GPIO1->FIODIR |= (0x0F << 19);
// Initialize all 4 pins to LOW (Clear)
LPC_GPIO1->FIOCLR = (0x0F << 19);
}
void display_binary_pattern(uint8_t count) {
uint8_t nibble = count & 0x0F;
// Step 1: Clear the 4 LED pins atomically
LPC_GPIO1->FIOCLR = (0x0F << 19);
// Step 2: Set the pins corresponding to active binary 1s
LPC_GPIO1->FIOSET = (nibble << 19);
// Update simulated physical FIOPIN state
LPC_GPIO1->FIOPIN = (LPC_GPIO1->FIOPIN & ~(0x0F << 19)) | (nibble << 19);
}
int main(void) {
printf("=== ARM Cortex-M3 (LPC-1768) GPIO Bitwise Manipulation ===\n");
gpio_init_leds();
printf("Port 1 FIODIR Configured: 0x%08X (P1.19-P1.22 Output Mode)\n\n", LPC_GPIO1->FIODIR);
printf("Simulating 4-Bit Binary Counter on LEDs P1.22 (MSB) to P1.19 (LSB):\n");
printf("%6s | %10s | %10s | %10s | %12s\n", "Decimal", "Binary", "FIOSET", "FIOCLR", "FIOPIN State");
printf("------------------------------------------------------------------\n");
for (uint8_t count = 0; count < 8; count++) {
display_binary_pattern(count);
char bin_str[5];
for (int b = 3; b >= 0; b--) {
bin_str[3 - b] = ((count >> b) & 1) ? '1' : '0';
}
bin_str[4] = '\0';
printf("%7d | %10s | 0x%08X | 0x%08X | 0x%08X\n",
count, bin_str, LPC_GPIO1->FIOSET, LPC_GPIO1->FIOCLR, LPC_GPIO1->FIOPIN);
}
printf("\nNotice: Atomic FIOSET and FIOCLR eliminate read-modify-write race hazards.\n");
return 0;
}
Sample Test Input
Execution of 4-bit binary counter loop from decimal 0 to 7 on pins P1.19-P1.22
Expected Terminal Output
=== ARM Cortex-M3 (LPC-1768) GPIO Bitwise Manipulation ===
Port 1 FIODIR Configured: 0x00780000 (P1.19-P1.22 Output Mode)
Simulating 4-Bit Binary Counter on LEDs P1.22 (MSB) to P1.19 (LSB):
Decimal | Binary | FIOSET | FIOCLR | FIOPIN State
------------------------------------------------------------------
0 | 0000 | 0x00000000 | 0x00780000 | 0x00000000
1 | 0001 | 0x00080000 | 0x00780000 | 0x00080000
2 | 0010 | 0x00100000 | 0x00780000 | 0x00100000
3 | 0011 | 0x00180000 | 0x00780000 | 0x00180000
4 | 0100 | 0x00200000 | 0x00780000 | 0x00200000
5 | 0101 | 0x00280000 | 0x00780000 | 0x00280000
6 | 0110 | 0x00300000 | 0x00780000 | 0x00300000
7 | 0111 | 0x00380000 | 0x00780000 | 0x00380000
Notice: Atomic FIOSET and FIOCLR eliminate read-modify-write race hazards.
University Viva Voce Questions & Model Answers:
âĸ Q: Why is the volatile keyword mandatory for embedded hardware register definitions in C?
âĸ Answer: `volatile` informs the compiler that the register memory address can change asynchronously outside the control of the program (e.g., via hardware signals or interrupts). This prevents the compiler from optimizing away reads or caching values in CPU registers.
âĸ Q: Why are atomic FIOSET/FIOCLR registers preferred over direct FIOPIN bitwise manipulation?
âĸ Answer: Using `FIOPIN |= (1 << 5)` performs a read-modify-write sequence: read register into CPU, OR bit, store back. If an interrupt fires between the read and write, the interrupt's changes are overwritten (race condition). Writing to FIOSET/FIOCLR is a single atomic hardware cycle.
âĸ Q: What is the function of the FIODIR register on LPC-1768?
âĸ Answer: FIODIR controls pin electrical direction. Setting bit k to 1 configures pin k as a digital output (driving HIGH or LOW). Clearing bit k to 0 configures pin k as a high-impedance digital input.
âĸ Q: What is Memory-Mapped I/O in the ARM architecture?
âĸ Answer: In Memory-Mapped I/O, peripheral registers share the exact same 4GB linear 32-bit address space as RAM and Flash ROM. Standard pointer dereferencing and assembly LDR/STR instructions are used to control hardware peripherals without special I/O instructions.
âĸ Q: What are Pull-up and Pull-down resistors in GPIO input pins?
âĸ Answer: When a GPIO pin is configured as an input and left disconnected (floating), electromagnetic noise causes it to fluctuate randomly between 0 and 1. An internal pull-up resistor gently pulls the pin to Vcc (logic 1), ensuring a deterministic default state.