IPU (New Scheme 2026 onward) · CSE · Semester 2
ICT-116T
87 practice questions for Data Structures (ICT-116T), arranged the way the paper is set: short-answer questions for the compulsory Question 1, then twelve-mark questions unit by unit. Compiled from the official GGSIPU 2026-27 syllabus. Answers are not included — the unit-wise notes for this paper are where they are worked out. This is not a previous year paper.
Complete unit-wise notes for ICT-116T, written against the GGSIPU 2026-30 first-year syllabus. Unit I: Abstract Data Types, Analysis, Representations and Sorting. Unit II: Trees: Binary, Search, Balanced, Heaps and Multi-way. Unit III: Hashing, Dictionaries, Tries, Disjoint Sets and Bit-fields. Unit IV: Graphs: Representation, Traversal, Spanning Trees and Shortest Paths. Each unit opens with the syllabus text as the scheme prints it, and closes with the questions this unit is actually asked. 155 pages.
Official GGSIPU syllabus for the B.Tech 2026-30 batch (first year, under USICT), applicable from the academic session 2026-27.
L 3 C 3
Teachers Continuous Evaluation: 40 marks. Term-End Semester Examination: 60 marks.
Abstract Data Types (specification, performance implications), growth of functions and asymptotic analysis, Master’s theorem (without proof). Analysis of array vs linked representations of lists/stacks/queues, Sparse Matrices (transpose and multiplication), Comparison-based sorting: insertion, shell, merge, quick, heap sort — algorithm and comparisons, Time and space complexity, Stability and adaptivity of sorts, Sorting in practice: library sorting functions, Sorting linked lists, Divide and conquer review via mergesort/quick sort, Introduction to non-comparison-based sorting (counting, radix — concept only).
Binary trees: traversal techniques, recursive vs non-recursive, Binary Search Trees (BST): insertion, deletion, search, AVL Trees: balancing, rotations, complexity, Heaps and priority queues: heapify, build-heap, insert/delete, Applications: expression trees, interval trees, use of recursion and stack in tree processing, Performance trade-offs among tree variants.Multi-way search trees: m-ary search tree, B-Trees (order, height, node structure, insertion, deletion), B+ Trees (leaf-level chaining, indexing applications), Search operations in B+ Trees
Hash tables: hash function design, collision handling (chaining, open addressing), Load factor, rehashing strategies, Dictionary ADT and map APIs, Trie data structure: insertion, search, memory model, Disjoint Sets (Union-Find) with path compression and union by rank, Bit-fields and memory efficiency
Graph representations: adjacency list, adjacency matrix, edge list, Graph traversal algorithms (BFS, DFS) and applications (cycle detection, component labeling), Minimum Spanning Tree (Kruskal, Prim), Shortest paths (Dijkstra, Bellman-Ford), Graph design for real applications (idea of social networks, compiler dependency graphs)