Basics Data Structure Algorithms (BOE406) - AKTU Question Paper 2023-24
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 2023-24. Published by Dr. A.P.J. Abdul Kalam Technical University (AKTU/UPTU), Lucknow. Free PDF download — no login required.
Course:B.Tech
Semester:Semester 4
Session:2023-24
University:AKTU / UPTU
Rate this paper
Questions Asked in 2023-24
Basics Data Structure Algorithms (BOE406) — complete question paper · 70 marks · 3 Hours
Section AAttempt all questions in brief. 2 x 7 = 14
- aWrite a C program to perform addition of two polynomials
- bExplain how asymptotic notations are used to describe the efficiency of algorithms
- cWrite a C program to evaluate a given postfix expression
- dHow are circular queues different from regular queues?
- eExplain the concept of different collision resolution techniques
- fDescribe the concept of complete binary
- gProvide examples of how graphs are used to model social networks
Section BAttempt any three of the following: 7 x 3 = 21
- aDescribe the Row Major Order and Column Major Order for representing multidimensional arrays. How do these representations impact the efficiency of accessing array elements?
- bExplain the principles of recursion and compare it with iteration. Provide examples of recursive and iterative solutions for calculating Fibonacci numbers
- cDiscuss the merge sort algorithm and its application in external sorting. Provide an example and a C program for merge sort
- dDescribe the modification of data in a binary search tree. Provide a C program to modify data in a BST
- eDiscuss the adjacency matrix and adjacency list representations of graphs. Compare their space and time complexities
Section CAttempt any one part of the following: 7 x 1 = 7
- aExplain the Array Implementation and Pointer Implementation of Singly Linked Lists. What are the advantages and disadvantages of each method?
- bIllustrate the process of polynomial multiplication using linked lists for polynomials with two variables. Provide an example and C code for the same
- aWrite a C program to implement a priority queue using an array. Explain how the priority is managed in this implementation
- bDiscuss the concept of tail recursion and its advantages. Provide a C program that demonstrates tail recursion
- aDescribe radix sort and how it differs from other comparison -based sorting algorithms. Provide an example and a C program for radix sort
- bDiscuss the time complexity of selection sort and bubble sort. Write a C program to implement each sorting algorithm
- aDescribe the tree traversal algorithms . Write C programs to perform each traversal on a given binary tree
- bCompare and contrast strictly binary trees and complete binary trees. Discuss their structures and use cases
- aDiscuss the role of graphs in network routing and shortest path algorithms. Provide an example and a C implementation of Dijkstra's algorithm
- bDescribe the process of graph traversal using depth -first search. Provide a C program to perform DFS on a given graph
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.
Basics Data Structure Algorithms — Other Year Papers
AKTU Basics Data Structure Algorithms PYQs from other sessions
More B.Tech Semester 4 (2023-24) Papers
Other subjects from same semester and session
Analog Circuits2023-24Applied Thermodynamics2023-24Analog Electronics Circuits2023-24Universal Human Values Professional Ethics2023-24Basics Of Database Management Systems2023-24Theory Of Automata And Formal Languages2023-24Digital Electronics2023-24Electrical Machines I2023-24
View all B.Tech Semester 4 2023-24 papers →Syllabus & More PYQs
Paper solve karne se pehle unit-wise syllabus dekh lo