(SEM IV) THEORY EXAMINATION 2024-25 BASICS DATA STRUCTURE & ALGORITHMS

This document contains the complete B.Tech (Semester IV) Theory Examination 2024–25 question paper for Basics of Data Structure & Algorithms (BOE406). The exam spans three printed pages, carries 70 marks, and comprehensively evaluates a student’s understanding of data structures, algorithm analysis, searching/sorting techniques, recursion, trees, graphs, linked lists, stacks, queues, hashing, and complexity analysis.
 

Section A – Short Conceptual Questions (14 Marks)

Section A consists of seven 2-mark questions (Page 1) covering essential fundamentals of DSA:

Formula for calculating the address of a 2D array element in row-major order

Built-in data types in C language

Converting polynomial function to Big-O Notation

Conditions to check queue full/empty using an array

Difference between Stack vs Queue

Basic difference between Linear search vs Binary search

Meaning and example of a Complete Binary Tree

These questions check a student’s basic theoretical clarity.

Section B – Analytical & Application Questions (21 Marks)

Students attempt any three of the given five questions (Page 1–2). These require explanation, examples, diagrams, and time–space complexity reasoning:

Algorithm Efficiency

Define efficiency, write an algorithm to find maximum in an array, and compute time complexity.

Merge Sort vs Heap Sort

Based on space complexity comparison.

Quick Sort

Full explanation of partitioning logic + recursive tracing of sorting [10, 7, 8, 9, 1, 5].

Concept of Data Structures

Importance of data structures in storing, organizing, and managing data efficiently.

Graph Representation

Construct adjacency matrix and adjacency list for graph:
Vertices: A, B, C, D;
Edges: A–B, A–C, B–D, C–D.

These questions test understanding of algorithms, graph theory, and structural organization.

Section C – Long, Higher-Order Questions (35 Marks)

Section C contains five questions, each with two alternatives, demanding detailed answers with examples, diagrams, algorithms, and reasoning (Pages 2–3).

Q3 – Recursion vs Iteration / Binary Trees

Recursive & iterative functions for Fibonacci series, including trade-offs
OR

Explanation of Strictly Binary Tree and Extended Binary Tree with diagrams

Q4 – ADT / Hashing with Collision Handling

Concept of Abstract Data Types (ADT) and its role in software development
OR

Hash table of size 10, hash function h(key)=key%10, inserting 21, 31, 41, 11 with Linear Probing

Q5 – Infix to Postfix / Priority Queue

Convert (5 + 6) * (7 - 2) to postfix & evaluate using a stack
OR

Explanation of Priority Queue with real-life examples

Q6 – Polynomial Linked List / BST Insertion

Represent polynomial 4x³ + 3x + 5 using linked list + display code
OR

Insert values 50, 30, 20, 40, 70, 60, 80 into a Binary Search Tree and draw the structure

Q7 – Circular Linked List / Radix Sort

Concept, difference from linear linked list, and function to traverse a Circular Linked List
OR

Perform Radix Sort on [170, 45, 75, 90, 802, 24, 2, 66] with digit-wise passes

These questions evaluate deep conceptual understanding, coding logic, recursion, trees, graphs, and computational thinking.

Summary

The Basics of Data Structure & Algorithms (BOE406) exam paper thoroughly covers:

Arrays, stacks, queues

Linked lists: linear, circular

Trees: binary, BST, strictly & extended

Searching algorithms

Sorting: Quick, Merge, Heap, Radix

Graph representations

ADT concepts

Hashing & collision resolution

Algorithm efficiency & complexity

Recursion & iteration techniques

Polynomial representation in linked lists

This paper serves as a comprehensive academic resource for students learning foundational DSA concepts and algorithmic problem-solving.