This document is a B.Tech (Semester IV) Theory Examination Question Paper for the subject BOE406 – Basics Data Structure & Algorithms, from the academic session 2023–2024.
It is a 70-mark, 3-hour exam designed to test a student’s understanding of data structures, algorithm efficiency, recursion, sorting, searching, trees, graphs, queues, linked lists, arrays, and C-language implementation.
SECTION A – Short Answer Questions (14 Marks)
Seven 2-mark questions covering fundamental concepts: C program for polynomial addition
Use of asymptotic notations (Big-O, Ω, Θ) C program to evaluate postfix expression
Difference between circular queue vs linear queue Collision resolution techniques in hashing
Concept of complete binary tree
Examples of graphs in social networks (friend network, follower graph, recommendations)
This section tests basic programming and conceptual clarity.
SECTION B – Medium-Length Analytical Questions (21 Marks)
Attempt any three of the following:
a. Row-Major vs Column-Major Order
Explanation of how multidimensional arrays are stored in memory, with discussion of access efficiency.
b. Recursion vs Iteration
Principles of recursion with examples; recursive & iterative implementation of Fibonacci series.
c. Merge Sort Algorithm
Detailed explanation + external sorting usage + C program.
d. Modification in Binary Search Tree
Insert, delete, update operations in BST + C program for modifying a node.
e. Graph Representations
Comparison of adjacency matrix vs adjacency list with space/time complexity.
This section evaluates conceptual reasoning + coding knowledge.
SECTION C – Long Answer / Code-Based Questions (35 Marks Total)
Each question has two options; attempt one from each number.
3. Linked List Implementations (7 Marks)
Option (a)
Array vs Pointer implementation of singly linked list: Memory layout
Dynamic allocation Advantages & limitations of each method
Option (b)
Polynomial multiplication using linked lists for two-variable polynomials + example + C program.
4. Priority Queue / Tail Recursion (7 Marks)
Option (a)
C program for priority queue using array, and explanation of priority handling.
Option (b)
Concept of tail recursion + advantages + C program demonstrating it.
5. Radix Sort / Comparison Sorting (7 Marks)
Option (a)
Explanation of Radix Sort, how it differs from comparison-based sorting + example + C program.
Option (b)
Time complexity of selection sort and bubble sort + C programs for both.
6. Tree Traversal / Binary Tree Comparison (7 Marks)
Option (a)
Tree traversal algorithms (inorder, preorder, postorder) + C programs for each.
Option (b)
Comparison of strictly binary tree vs complete binary tree, structure, and use-cases.
7. Graph Algorithms / DFS (7 Marks)
Option (a)
Role of graphs in routing & shortest path algorithms + example + C implementation of Dijkstra’s Algorithm.
Option (b)
Process of Depth-First Search (DFS) + C program for DFS.
Overall Purpose of the Document
This exam paper evaluates a student's proficiency in:
Core Data Structures
Arrays, queues, stacks, linked lists, trees, graphs.
Algorithm Design & Analysis
Asymptotic notations, recursion, iteration, searching, sorting.
Programming Implementation in C
Writing and understanding C programs for sorting, linked lists, queues, trees, graphs.
Real-World Applications
Graph models for social networks, routing algorithms, external sorting.
Memory, Storage & Complexity
Row vs column major, adjacency structures, complexity comparisons.
The paper covers definitions, coding, analysis, numerical simulation, and algorithm explanation, ensuring comprehensive assessment of Data Structure & Algorithms.
