B.TechSemester 42021-22Basic Data Structure And AlgorithmsKOE045
View PDFDownload

Basic Data Structure And Algorithms (KOE045) - AKTU Question Paper 2021-22

B.Tech · Semester 4 · Free PDF Download

This is the official AKTU Basic Data Structure And Algorithms Previous Year Question Paper for B.Tech Semester 4, academic session 2021-22. 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:2021-22
University:AKTU / UPTU

Rate this paper

Questions Asked in 2021-22

Basic Data Structure And Algorithms (KOE045) — complete question paper

Section AAttempt all q u e s t i o n s i n b r i e f . 2x10 = 20
  • a
    Determine the worst-case time complexity of inserting n ele ments into an empty linked list, if the linked list needs to be maintained in sorted order?
  • b
    What do you understand by time complexity of algorithm? Exp lain BIG Oh notation with bubble sort example
  • c
    Find out number of items in following cases. i. top=5, size=10 (Stack) ii. rear=5, front=2, size=10 (Queue) iii. rear=2, front=5, size=10 (Circular Queue)
  • d
    Compute the result evaluating the postfix expression 15 5 + 12 5 / * 5
  • e
    Illustrate when a sorting technique is called stable? 3
  • f
    Consider the array A = <14, 1 1, 13, 12, 6, 9, 10, 12, 8, 7> . After building heap from the array A, determine the depth of the heap and the right child of max-heap. (Root is at level 0)
  • g
    The post order traversal of a binary tree is 8,9,6,7,4,5,2, 3,1. The in order traversal of the same tree is 8,6,9,4,7,2,5,1,3. The height of a tree is the length of the longest path from the root to any leaf. Predict the height of the binary tree is_________
  • h
    The following numbers are inserted into an empty binary sea rch tree in the given order: 11, 6, 3, 5, 15, 12, 16. Calculate the height of the binary search tree (the height is the maximum distance of a leaf node from the root)? (i) Differentiate between Graph and tree. 5 (j) Describe multigraph and Digraph. 5
Section BAttempt any three o f t h e f o l l o w i n g : 1 0 x 3 = 3 0
  • a
    What do you mean by linked list? Discuss structure of all p ossible types of linked list
  • b
    Describe tail recursion and non-tail recursion with suitabl e example. Also discuss the solution for Tower of Hanoi problem for 4 discs
  • c
    What are the possible traversals of a tree? Write their rec ursive algorithms with suitable example
  • d
    Use Heap sort algorithm to s ort the given array and write all the steps: 82
  • e
    Demonstrate Breadth First Search (BFS) algorithm to travers e a graph. 4
Section CAttempt any one p a r t o f t h e f o l l o w i n g : 1 0 x 1 = 1 0
  • a
    Write structure of linked list that can be used to represen t a polynomial of the following type 4x 4 y4-9x3 y2+6x2-y+8. Write an algorithm to find addition of two polynomials
  • b
    What is Sparse matrix? Explai n how a Sparse matrix can be implemented by using the linked list?
  • a
    State the algorithm to evaluate the postfix expression. And apply it on following expression
  • b
    Two matrices M1 and M2 are t o be stored in arrays A and B respectively. Each array can be stored either in row-major or column-major order in contiguous memory locations. The time complexity of an algorithm to compute M1× M2 also writes a program to complete above said function
  • a
    Do the following operations for constructing a BST i) 45, 37, 98, 76, 13, 39,105, 80, 5 insert element as per their occurrence. ii) Delete 39 and 45 respectively Now Traverse final BST in In order, Preorder and post order
  • b
    What is Thread binary tree? Explain the significance of thr eaded binary tree? 3
  • a
    Apply Kruskal’s and Prism’s algorithm to find the minimum s panning tree in the following given graph
  • b
    Write an algorithm for topological sort. Give an example 4
  • a
    Write quick sort algorithm and its analysis. Use Quick sort algorithm to sort 9, 11, 10, 1, 60, 10, 6, 25, 40, and 30. Is it a stable sorting algorithm? Justify
  • b
    Write merge sort algorithm and its analysis. Use merge sort algorithm to sort 9, 11, 10, 1, 60, 10, 6, 25, 40, and 30. Is it a stable sorting algorithm? Justify

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.

Basic Data Structure And Algorithms — Other Year Papers

AKTU Basic Data Structure And Algorithms PYQs from other sessions

Basic Data Structure And Algorithms2021-22

More B.Tech Semester 4 (2021-22) Papers

Other subjects from same semester and session

Communication Engineering2021-22Manufacturing Processes2021-22Networks Analysis Synthesis2021-22Operating Systems2021-22Technical Communication2021-22Material Science2021-22Maths Iv2021-22Theory Of Automata And Formal Languages2021-22
View all B.Tech Semester 4 2021-22 papers →

Syllabus & More PYQs

Paper solve karne se pehle unit-wise syllabus dekh lo

AKTU 2nd Year PYQs — All Branches