Data Structures (BCS301) AKTU predicted paper 2026-27
AI-predicted paper for Data Structures based on 7 past papers (2020, 2021, 2022, 2023, 2024, 2025, 2026). NOT an official AKTU paper. Use as a revision tool only.
Paper pattern
- Section A: Attempt all questions. (14 marks)
- Section B: Attempt any THREE questions out of five. (21 marks)
- Section C: Attempt ONE question from each pair (a or b). (35 marks)
Why these questions
- Unit 4 (Trees) dominates — 21% avg weightage
- Asked every year: Introduction & Complexity Analysis, Arrays
- Due for comeback: Huffman Coding
- Most repeated topic: Stacks
Section A – 2-mark questions
- Define a sparse matrix. Suggest a space efficient representation for space matrices.
- Write the condition for empty and full circular queue.
- What are the 2 different forms of hashing?
- Differentiate between binary search tree and a heap.
- Compare adjacency matrix and adjacency list representations of graph.
- In a complete binary tree if the number of nodes is 1000000. What will be the height of complete binary tree.
- What is data structure? Give the classification of data structure in brief.
Section B – sample questions
- Each element of an array Data [20][50] requires 4 bytes of storage. Base address of Data is 2000. Determine the location of Data [10][10] when the array is stored as: (i) Row major (ii) Column major
- Explain two ways to represent a graph in memory and compare their advantages: (i) Adjacency matrix (ii) Adjacency List
- What do you mean by complexity? Describe the asymptotic notation with a suitable diagram.