(SEM III) THEORY EXAMINATION 2022-23 DATA STRUCTURE

This question paper is designed to evaluate the student’s understanding of core concepts in Data Structures and Algorithms, along with their ability to apply theoretical knowledge to practical problem-solving. It covers fundamental data structures, algorithm analysis, searching and sorting techniques, recursion, trees, graphs, hashing, and memory organization. The paper ensures balanced assessment through concept-based short questions, analytical mid-length questions, and extensive problem-solving in long questions.

The paper is divided into three sections:

SECTION A — Short Answer Questions (20 Marks)

This section consists of 10 compulsory questions, each carrying 2 marks, aimed at testing the student’s foundational understanding. Topics include:

Algorithm complexity cases (best/average/worst)

Trees (BST, heaps, complete binary trees)                  Queues, recursion fundamentals

Sorting methods (internal vs external)                       Graph traversal concepts

Expression trees                                                          Role of stacks in recursion

These questions check conceptual clarity and definitions essential for solving higher-level problems.

SECTION B — Analytical/Medium-Length Questions (30 Marks)

Students must attempt any 3 out of 5 questions, each carrying 10 marks.
This section tests the application of data structures and algorithms on:

Memory layout of multi-dimensional arrays               Stack implementation using linked lists

Quick sort algorithm and dry-run                               Dijkstra’s shortest path algorithm

Tree construction from traversals

These questions require step-by-step reasoning, algorithm tracing, coding ability, and structural interpretation.

SECTION C — Long Answer / Problem-Solving Questions (30 Marks)

Students must attempt any one part from each sub-question, covering:

Polynomial representation via linked lists

Doubly linked lists                                         Infix to postfix conversion

Circular queue implementation                    Hashing and collision resolution

Heap sort                                                      Spanning trees using Prim’s algorithm

Floyd-Warshall for all-pair shortest paths    AVL tree rotations

B-Tree insertion

These questions assess deeper understanding, algorithm implementation, efficiency evaluation, and multi-step calculations.

Overall Purpose

This question paper assesses the student’s ability to:

Understand and analyze data structures

Implement algorithms efficiently

Evaluate time and space complexity

Use recursion, trees, and graphs for computation

Solve real-world problems using appropriate data structures

Write clear, structured algorithms and code logic