B.TechSemester 42025-26Basics Data Structure AlgorithmsBOE406
View PDFDownload

Basics Data Structure Algorithms (BOE406) - AKTU Question Paper 2025-26

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 2025-26. 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:2025-26
University:AKTU / UPTU

Rate this paper

Questions Asked in 2025-26

Basics Data Structure Algorithms (BOE406) — extracted question text · 70 marks · 3 Hours

Section AAttempt all questions in brief. 02 x 7 = 14
  • a
    List the characteristics of a good algorithm and briefly explain its role in real-life applications
  • b
    What is the difference between array and linked stack?
  • c
    Why is postfix evaluation easier than infix?
  • d
    Differentiate between recursion and iteration
  • e
    Difference between adjacency matrix and list
  • f
    What is minimum spanning tree?
  • g
    How many labeled binary trees can be formed with N=3 nodes?
Section BAttempt any three of the following: 07 x 3 = 21
  • a
    Differentiate among Big-O notation, Big-Theta notation, and Big-Omega notation. Also, define each notation with suitable examples
  • b
    Convert the following infix expression into both prefix and postfix forms. Show all intermediate steps clearly, including the use of stack operations and operator precedence rules at each stage
  • c
    State the conditions for underflow and overflow in a circular queue. Then, for a circular queue of size 5, perform the following operations step by step, showing the position of front and rear after each operation and the final state of the queue: Enqueue(1), Enqueue(2), Enqueue(3), Dequeue(), Enqueue(4), Enqueue(5), Enqueue(6). (SEM. IV) THEORY EXAMINATION 2025-26 BASICS DATA STRUCTURE & ALGORITHMS Enqueue(1), Enqueue(2), Enqueue(3), Dequeue(), Enqueue(4), Enqueue(5), Enqueue(6)
  • d
    Compare Insertion, Selection, and Quick Sort based on time complexity, stability, and adaptability
  • e
    Insert the given elements into a Binary Search Tree (BST) using two different orders: (i) Sorted order: 10, 20, 30, 40, 50 (ii) Random order: 30, 10, 50, 20, 40 Construct the BST for both cases step by step. Then, determine the height of each tree and compare their structures
Section CAttempt any one part of the following: 07 x 1 = 07
  • a
    Derive the general formula to calculate the address of an element A[i][j] in column-major order, and illustrate the process with a suitable example
  • b
    Write algorithms for Depth First Search (DFS), explaining steps, data structures used, and illustrating their working with suitable examples
  • a
    Perform the following operations on a stack of size 5: Push(10), Push(20), Push(30), Pop(), Push(40), Push(50), Push(60). Show stack after each step and identify overflow/underflow
  • b
    Insert keys 19, 29, 39, 49, 59 into hash table (size = 10) using h(k) = k mod 10. Resolve collisions using linear probing. (SEM. IV) THEORY EXAMINATION 2025-26 BASICS DATA STRUCTURE & ALGORITHMS
  • a
    Given a sorted array A = {5, 9, 14, 21, 28, 35, 42, 49, 56}, perform binary search to find the element 35. Show each step of the search process, including the calculation of mid index and comparison at every iteration. Also, analyze the time complexity of the algorithm
  • b
    Explain Prim’s algorithm and Kruskal’s algorithm for finding a minimum spanning tree with suitable real-life examples. Compare their approaches, steps, and efficiency
  • a
    Convert recursive factorial function into iterative version and trace for n
  • b
    Construct a binary tree from: Preorder: A B D H I E C F G Inorder: H D I B E A F C G Preorder: A B D H I E C F G Inorder: H D I B E A F C G
  • a
    Explain how to represent a polynomial using a linked list data structure. Illustrate your answer by representing the polynomial 3x2 + 5x + 2 using
  • a
    linked list, and describe the structure of each node along with a suitable diagram
  • b
    Apply the Quick Sort algorithm to the array [10, 80, 30, 90, 40, 50, 70] by selecting the first element as the pivot, and clearly illustrate the partitioning process at each step

Question text is extracted from the official AKTU question paper PDF above. Check the original PDF for equations, diagrams and complete wording. Extracted: 2026-08-23.

Basics Data Structure Algorithms — Other Year Papers

AKTU Basics Data Structure Algorithms PYQs from other sessions

Basics Data Structure Algorithms2023-24Basics Data Structure Algorithms2024-25Basics Data Structure Algorithms2023-24Basics Data Structure Algorithms2024-25

More B.Tech Semester 4 (2025-26) Papers

Other subjects from same semester and session

Technical Communication2025-26Mathematics Iii2025-26Mathematics Iv2025-26Mathematics V2025-26Cyber Security2025-26Python Programming2025-26Operating System2025-26Theory Of Automata And Formal Languages2025-26
View all B.Tech Semester 4 2025-26 papers →

Syllabus & More PYQs

Paper solve karne se pehle unit-wise syllabus dekh lo

AKTU 2nd Year PYQs — All Branches