BSc Computer Science - Undergraduate
| Module | Topic | Format |
|---|---|---|
| Unit I | Introduction to Data Structures | |
| Unit II | Linear Data Structures | |
| Unit III | Non-Linear Data Structures | |
| Slides | Trees & Binary Search Trees | |
| Slides | Sorting Algorithms | |
| Slides | Searching Algorithms & Hashing | |
| Slides | Algorithm Analysis & Asymptotic Notation (Big O) |
| Lab | Topic | Exercises | Format |
|---|---|---|---|
| Lab 1 | Arrays & Algorithm Analysis | 22 exercises + LeetCode (Two Sum, Kadane's, etc.) | TXT |
| Lab 2 | Linked Lists | 24 exercises + LeetCode (Reverse LL, Cycle, Palindrome, etc.) | TXT |
| Lab 3 | Stacks & Queues | 21 exercises + LeetCode (Valid Parentheses, Min Stack, etc.) | TXT |
| Lab 4 | Trees & Binary Search Trees | 26 exercises + LeetCode (Max Depth, Validate BST, LCA, etc.) | TXT |
| Lab 5 | Sorting Algorithms | 21 exercises + LeetCode (Sort Colors, Kth Largest, etc.) | TXT |
| Lab 6 | Searching & Hashing | 24 exercises + LeetCode (Binary Search, Find Peak, etc.) | TXT |
C lecture01.c
C list_a.c
C list_b.c
C list_example.c
C doubly_linked_list.c
C circular_linked_list.c
C 13 exercises - count, reverse, search, etc.
C 12 exercises - balanced brackets, postfix, etc.
C 12 exercises - circular queue, deque, etc.
C 13 exercises - count nodes, height, LCA, validate BST, etc.
C 12 exercises - all sorts, binary search, counting sort, etc.
Student registration, polynomial representation, memory analysis
Doubly linked playlist, circular process scheduler, merge sorted lists
Undo system, balanced parentheses, base converter, expression evaluation
Browser history, stock span, next greater element, infix to prefix
Hospital ER system, circular queue printer, binary number generation
Priority task scheduler, deque sliding window, queue using stacks
Build BST by hand, insert/search/delete, height with recursive traces
Level order traversal, balanced tree check, LCA, sorted array to BST
Note: Assignments require live demonstration (viva). You must explain your code and answer questions about your implementation. AI-generated code will result in zero marks.
Complete university registration with students, courses, enrollments using multiple linked list types
OS heap memory simulation with first-fit, best-fit, worst-fit, compaction
Complete calculator with tokenizer, infix-postfix conversion, code syntax analyzer
Stack-based DFS maze solving with visualization, path finding, maze generation
Multi-queue service center with VIP handling, statistics, priority aging
BFS-based graph analysis with degrees of separation, friend recommendations
Tree-based file system with mkdir, ls, cd, find, rm, visual tree display
BST-based dictionary with auto-complete, spell check, file I/O, performance analysis
Midterm examination
Midterm examination 2021
Final examination
Practical examination
Practical examination
PDF Practical test
PDF Practical test
PDF Binary Search Tree test
PDF Quiz
gcc dsacode/binary_search_tree.c -o bst
./bst
gcc dsacode/sorting_algorithms.c -o sort
./sortLeetCode | HackerRank - Data Structures | VisuAlgo - Visualize Algorithms