Basics Data Structure Algorithms (BOE406) - AKTU Question Paper 2024-25
B.Tech · Semester 4 · Free PDF Download
This is the official AKTU Basics Data Structure Algorithms Previous Year Question Paper for B.Tech Semester 4, academic session 2024-25. Published by Dr. A.P.J. Abdul Kalam Technical University (AKTU/UPTU), Lucknow. Free PDF download — no login required.
Rate this paper
Questions Asked in 2024-25
Basics Data Structure Algorithms (BOE406) — complete question paper · 70 marks · 3 Hours
- aGive the formula for calculati ng the address of an element in a 2D array stored in Row Major Order
- bList any four built-in data types in C
- cConvert the function f(n) = 5n 2 + 2n + 3 to Big-O notation
- dWhat are the conditions to check if a queue is full or empty u sing an array?
- eDifferentiate between Stack and Queue
- fWhat is the basic difference be tween linear search and binary search?
- gWhat is a complete binary tree? Give an example
- aWhat is algorithm efficiency? Write an algorithm to find the maximum in an array and compute its time complexity
- bDifferentiate between merge s ort and heap sort based on space complexity
- cExplain the quick sort algorithm with its partitioning logic . Sort the array [10, 7, 8, 9, 1, 5] using quick sort and show recursive steps
- dExplain the concept of data structures and describe their im portance in organizing, 5 K2 managing, and storing data efficiently
- eDescribe adjacency matrix and adjacency list representations of graphs. Construct both for the following graph: Vertices: A, B, C, D Edges: A–B, A–C, B–D, C–D Vertices: A, B, C, D Edges: A–B, A–C, B–D, C–D
- aWrite a recursive function to compute the Fibonacci series u p to n terms. Also, implement the same using iteration. Discuss trade-offs
- bExplain different types of binary trees: Strictly binary tree Extended binary tree Include examples and diagrams
- aExplain the concept of Abstract Data Types (ADT) with an exa mple. How do ADTs help in software development?
- bExplain hashing with an example. Suppose a hash table of siz e 10 and the hash function is h(key) = key % 10. Insert the following keys: 21, 3 1, 41, 11. Show how collisions are handled using linear probing
- aConvert the following infix expression to postfix and evalua te it using a stack: Infix: (5 + 6) * (7 - 2) Infix: (5 + 6) * (7 - 2)
- bExplain Priority Queue with real-life examples. How is it di fferent from a standard queue?
- aExplain polynomial representa tion using linked lists. Represent the polynomial 4x³ + 3x + 5 using a linked list and write code for display
- bDescribe the process of inserting nodes into a binary search tree (BST). Insert the following values into a BST and show its structure: Values: 50, 30, 20, 40, 70, 60, 80
- aWhat is a circular linked list? How is it different from a l inear linked list? Write a function to traverse a circular linked list
- bExplain radix sort with a numerical example. Sort the array [170, 45, 75, 90, 802, 24, 2, 66] using radix sort and show digit-wise passes
Question text is extracted from the official AKTU question paper PDF above. Hindi translations are omitted — every question is printed in English in the original paper. Last verified: 2026-08-23.
Repeated Questions — BOE406
Questions that appeared in more than one session, found by comparing 3 years of Basics Data Structure Algorithms papers (2023-24, 2024-25, 2025-26)
Differentiate between Stack and Queue
Appeared in: 2024-25 · 2025-26
What is the basic difference be tween linear search and binary search?
Appeared in: 2024-25 · 2025-26
Basics Data Structure Algorithms — Other Year Papers
AKTU Basics Data Structure Algorithms PYQs from other sessions
More B.Tech Semester 4 (2024-25) Papers
Other subjects from same semester and session
Syllabus & More PYQs
Paper solve karne se pehle unit-wise syllabus dekh lo