🎓 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 6: Byte-Pair Encoding (BPE) Subword Tokenizer Simulation

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

📋 Experiment Overview & Curriculum Specifications

NLP & Generative AI â€ĸ Hard â€ĸ 35 mins

Aim / Objective: To formulate, implement, and analyze the Byte-Pair Encoding (BPE) subword tokenization algorithm used in modern LLMs (GPT-2, GPT-4, LLaMA) from scratch.

Prerequisites & Domain Concepts

String manipulation, dictionary counting, subword tokenization, LLM architectures.

Asymptotic Complexity Bounds

â€ĸ Time Complexity: O(M * N) where M is number of merge iterations and N is corpus token length
â€ĸ Space Complexity: O(|V|) for vocabulary and merge rule table

Step-by-Step Algorithm

  1. Step 1: Represent each training word as space-separated characters with special end-of-word marker </w>.
  2. Step 2: Count word frequencies across the corpus.
  3. Step 3: In each merge iteration: count frequencies of all adjacent symbol pairs across all words.
  4. Step 4: Find the most frequent symbol pair (e.g. ('e', 's')).
  5. Step 5: Record the pair in the ordered merge rules list.
  6. Step 6: Replace all occurrences of that pair in the corpus with the concatenated merged symbol.
  7. Step 7: Repeat until target number of merges is reached.
  8. Step 8: Tokenize an unseen word by applying the learned merge rules in their historical order.

Verified Academic Source Code (PYTHON)

import re
from collections import Counter, defaultdict

class BPETokenizer:
    def __init__(self, num_merges=6):
        self.num_merges = num_merges
        self.merges = []
        self.vocab = set()

    def _get_pair_frequencies(self, corpus_words):
        pairs = Counter()
        for word_tuple, freq in corpus_words.items():
            for i in range(len(word_tuple) - 1):
                pair = (word_tuple[i], word_tuple[i + 1])
                pairs[pair] += freq
        return pairs

    def _merge_pair(self, pair, corpus_words):
        new_corpus = {}
        bigram = re.escape(' '.join(pair))
        pattern = re.compile(r'(?<!S)' + bigram + r'(?!S)')
        replacement = ''.join(pair)

        for word_tuple, freq in corpus_words.items():
            word_str = ' '.join(word_tuple)
            merged_str = pattern.sub(replacement, word_str)
            new_corpus[tuple(merged_str.split())] = freq
        return new_corpus

    def fit(self, text_corpus):
        # Step 1: Initialize word counts with character tuples + end marker </w>
        raw_words = text_corpus.lower().split()
        corpus_words = Counter()
        for w in raw_words:
            char_tuple = tuple(list(w) + ['</w>'])
            corpus_words[char_tuple] += 1
            for ch in char_tuple:
                self.vocab.add(ch)

        print("=== Training Byte-Pair Encoding (BPE) Tokenizer ===")
        print(f"Initial Base Character Vocabulary: {sorted(list(self.vocab))}\n")

        # Step 2: Iteratively find and merge top bigrams
        for iteration in range(1, self.num_merges + 1):
            pair_freqs = self._get_pair_frequencies(corpus_words)
            if not pair_freqs:
                break

            top_pair, top_count = pair_freqs.most_common(1)[0]
            self.merges.append(top_pair)
            merged_symbol = ''.join(top_pair)
            self.vocab.add(merged_symbol)

            print(f"Merge {iteration}: Pair {top_pair} (Occurrences: {top_count}) -> '{merged_symbol}'")
            corpus_words = self._merge_pair(top_pair, corpus_words)

        print(f"\nFinal Vocabulary Size: {len(self.vocab)} subwords\n")

    def tokenize_word(self, word):
        """Applies learned merge operations in deterministic order"""
        current_tokens = list(word.lower()) + ['</w>']

        for pair in self.merges:
            pair_str = ''.join(pair)
            i = 0
            new_tokens = []
            while i < len(current_tokens):
                if i < len(current_tokens) - 1 and (current_tokens[i], current_tokens[i + 1]) == pair:
                    new_tokens.append(pair_str)
                    i += 2
                else:
                    new_tokens.append(current_tokens[i])
                    i += 1
            current_tokens = new_tokens

        return current_tokens

# Training Text with Morphological Repetitions
training_text = "low lower newest widest lowest lower newer wider lowest newer"

bpe = BPETokenizer(num_merges=6)
bpe.fit(training_text)

# Testing BPE on Seen and Unseen Words
test_words = ['lower', 'lowest', 'newer', 'widest', 'low', 'newest']
print("--- Subword Tokenization of Test Words ---")
for w in test_words:
    tokens = bpe.tokenize_word(w)
    print(f"Word: '{w:8}' -> BPE Subwords: {tokens}")
â–ļ Run in Online IDE

Sample Test Input

Training text: "low lower newest widest lowest lower newer wider lowest newer", num_merges=6

Expected Terminal Output

=== Training Byte-Pair Encoding (BPE) Tokenizer ===
Initial Base Character Vocabulary: ['</w>', 'd', 'e', 'i', 'l', 'n', 'o', 'r', 's', 't', 'w']

Merge 1: Pair ('e', 'r') (Occurrences: 6) -> 'er'
Merge 2: Pair ('er', '</w>') (Occurrences: 6) -> 'er</w>'
Merge 3: Pair ('e', 's') (Occurrences: 5) -> 'es'
Merge 4: Pair ('es', 't') (Occurrences: 5) -> 'est'
Merge 5: Pair ('est', '</w>') (Occurrences: 5) -> 'est</w>'
Merge 6: Pair ('l', 'o') (Occurrences: 5) -> 'lo'

Final Vocabulary Size: 17 subwords

--- Subword Tokenization of Test Words ---
Word: 'lower   ' -> BPE Subwords: ['lo', 'w', 'er</w>']
Word: 'lowest  ' -> BPE Subwords: ['lo', 'w', 'est</w>']
Word: 'newer   ' -> BPE Subwords: ['n', 'e', 'w', 'er</w>']
Word: 'widest  ' -> BPE Subwords: ['w', 'i', 'd', 'est</w>']
Word: 'low     ' -> BPE Subwords: ['lo', 'w', '</w>']
Word: 'newest  ' -> BPE Subwords: ['n', 'e', 'w', 'est</w>']
University Viva Voce Questions & Model Answers:

â€ĸ Q: Why is Byte-Pair Encoding (BPE) preferred over word-level tokenization in modern LLMs?
â€ĸ Answer: Word-level tokenization requires huge vocabularies and fails on typos, rare words, and new terms (producing [UNK] tokens). BPE has a compact vocabulary and can represent ANY word by breaking it down into smaller subword units or individual characters.

â€ĸ Q: How does Byte-level BPE (used in GPT-2 and LLaMA) differ from standard character BPE?
â€ĸ Answer: Character BPE starts with Unicode characters, which can still produce [UNK] on rare emojis or foreign scripts. Byte-level BPE starts with the 256 individual byte values of UTF-8, guaranteeing that EVERY possible string can be encoded with zero out-of-vocabulary tokens.

â€ĸ Q: How does BPE differ from WordPiece (used in BERT)?
â€ĸ Answer: BPE chooses merges based on raw pair frequency. WordPiece chooses candidate symbol merges that maximize the likelihood of the training data according to a unigram language model.

â€ĸ Q: What is the trade-off in setting the total number of BPE merge operations (vocabulary size)?
â€ĸ Answer: A small vocabulary creates longer sequence lengths (more tokens per sentence), increasing transformer compute cost (O(N^2)). A large vocabulary creates shorter sequences but increases embedding matrix parameters and memory.

â€ĸ Q: What is tokenization fertility?
â€ĸ Answer: Fertility is the average number of subword tokens produced per natural language word. High fertility indicates fragmented tokenization (common in under-represented languages), increasing inference cost.