B.TechSemester 32022-23Basic Data Structure AlgorithmsKOE-035
View PDFDownload

Basic Data Structure Algorithms (KOE-035) - AKTU Question Paper 2022-23

B.Tech · Semester 3 · Free PDF Download

This is the official AKTU Basic Data Structure Algorithms Previous Year Question Paper for B.Tech Semester 3, academic session 2022-23. Published by Dr. A.P.J. Abdul Kalam Technical University (AKTU/UPTU), Lucknow. Free PDF download — no login required.

Course:B.Tech
Semester:Semester 3
Session:2022-23
University:AKTU / UPTU

Rate this paper

Questions Asked in 2022-23

Basic Data Structure Algorithms (KOE-035) — complete question paper

Section AAttempt all questions in brief. 2x10=20
  • a
    Define algorithm and its characteristics
  • b
    List the various asymptotic notat ions? Explain Big Oh notation s along with suitable diagram
  • c
    In the reference of Tower of Hanoi problem if there are7 disks . Solve the number of years will it need to move from one tower to another, assume th at one move takes 1 second
  • d
    Explain circular queue. What i s the condition if circular queue is full?
  • e
    Differentiate strict and Complete Binary Tree
  • g
    Explain Transitive closure of a Graph
  • h
    List the different types of representation of graphs (i) Differentiate Internal and External Sorting. (j) State the number of swaps perform by bubble sort to sort the f ollowing array of integer9,2,3,5,4,1,10,8,7
Section BAttempt any three of the following:
  • a
    Consider a multi-dimensional Array in C language ARR [20] [30] [40] and address of ARR [2][3][4] is 1000. Calculate the address of ARR [6] [7] [ 8 ] i n r o w m a j o r order and column major order. Assume the first element is store d at ARR [1][2][3] and each element take 2 bytes
  • b
    Write a C program to delete a node from Kth position in singly linked list
  • c
    Construct an expression tree for the following algebraic expression
  • d
    Find the single source shortest path for following graph using Dijkstra algorithm
  • e
    Compare B tree and B+ tree with suitable example
Section CAttempt any one part of the following: 10x1=10
  • a
    Consider a 2-dimension array LTM [10…100] [10…80] in lower tria ngular matrix (LTM) representation. The size of each element in array is 2 by tes. If the array is implemented in the memory in the form of row major order and base address of array is 1000, then write the address of LTM [30][40]
  • b
    Write a complete C program to add to polynomial using singly linked list
  • a
    Implement C language to print Fi bonacci series using recursive and non-recursive function
  • b
    Write an algorithm to evaluate postfix expression also find the value of
  • a
    For a binary tree T, the preorder and in-order traversal sequences are as follows : In order: B C A E G D H F I J Preorder: A B C D E G F H I J (i) Construct a binary Tree. (ii) What is its post-order traversal sequence?
  • b
    A networking company uses a com pression technique to encode the message before transmitting over the network. Suppose the piece of message (ea ch character occupies 7 bits) written in italic letter. when you are on the left you are on the right . when you are on the right, you are on the wrong. Suggest the answer to following question based on above problem. (i) Construct Huffman tree. (ii) Decode the message following message 10111101010111111111100. (iii) Calculate the percentage of spa ce saved in the message after compression?
  • a
    Write sort notes on following. (i) Topological Sort (ii) Activity Network
  • b
    Differentiate between Breadth F i r s t S e a r c h ( B F S ) a n d D e p t h F i r st Search (DFS) with suitable example
  • a
    Write an algorithm for Merge Sort. Explains with the help of suitable example
  • b
    Construct a B-Tree of order 5 with the following sequence of integer

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 — KOE-035

Questions that appeared in more than one session, found by comparing 2 years of Basic Data Structure Algorithms papers (2021-22, 2022-23)

2x

Explain circular queue. What i s the condition if circular queue is full?

Appeared in: 2021-22 · 2022-23

2x

Write an algorithm to evaluate postfix expression also find the value of

Appeared in: 2021-22 · 2022-23

Basic Data Structure Algorithms — Other Year Papers

AKTU Basic Data Structure Algorithms PYQs from other sessions

Basic Data Structure Algorithms2022-23

More B.Tech Semester 3 (2022-23) Papers

Other subjects from same semester and session

Computer Organization And Architecture2022-23Fluid Mechanics And Fluid Machines2022-23Energy Science And Engineering2022-23Fluid Mechanics2022-23Electronic Devices2022-23Mathematics Iv2022-23Computer System Security2022-23Engineering Mechanics2022-23
View all B.Tech Semester 3 2022-23 papers →

Syllabus & More PYQs

Paper solve karne se pehle unit-wise syllabus dekh lo

AKTU 2nd Year PYQs — All Branches