This document is the AKTU B.Tech 3rd Semester – Data Structures (KCS301) Theory Examination Paper for the academic year 2020–21. It contains three sections (A, B, and C) with a total of 100 marks, designed to test a student’s understanding of data structures, algorithms, searching, sorting, hashing, graphs, trees, and recursion.
SECTION A (20 marks – Short Answer Questions)
This section has 10 questions, each of 2 marks, covering basic concepts like:
Time–space trade-off Array vs Linked List
Tail recursion Circular queue conditions
Heap creation Sequential vs Binary search
Transitive closure of a graph Adjacency multilist
Threaded binary tree Min heap
These questions check definitions and very short explanations.
SECTION B (30 marks – Long Answers)
Students must attempt any 3 out of 5 questions on:
Address calculation in 3D arrays Postfix evaluation + prefix conversion
Hash functions & collision handling BFS algorithm
Constructing binary tree using inorder & postorder
These require step-by-step explanations, diagrams, and examples.
SECTION C (50 marks – Detailed Analytical Questions)
This section has 5 sub-sections, and from each, the student answers 1 question (10 marks). Topics include:
Address calculation in triangular matrices Linked list insertion program
Infix to postfix using stacks Stack using linked list
Merge sort Index Sequential Search
Prim’s algorithm (graph diagram is provided on page 2) Floyd–Warshall algorithm
Extended, Complete & Threaded binary trees AVL tree insertion and array representation
These questions require complete algorithms, C programs, graph solving, tree construction, etc.
