B.TechSemester 32021-22Data StructureKCS-301
View PDFDownload

Data Structure (KCS-301) - AKTU Question Paper 2021-22

B.Tech · Semester 3 · Free PDF Download

This is the official AKTU Data Structure Previous Year Question Paper for B.Tech Semester 3, 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 3
Session:2021-22
University:AKTU / UPTU

Rate this paper

Questions Asked in 2021-22

Data Structure (KCS-301) — complete question paper

Section AAttempt all q u e s t i o n s i n b r i e f . 2 X 1 0 = 2 0
  • a
    Convert the infix expression (A+B) *(C-D) $E*F to postfix. Give the answer without any spaces
  • b
    Rank the following typical bounds in increasing order of gr owth rate: O(log n), O(n 4), O(1), O(n2 log n)
  • c
    Draw the binary search tree that results from inserting the following numbers in
    sequence starting with 11:                  11, 47, 81, 9, 61, 10, 12,
( d )  W h a t  d o e s  t h e  f o l l o w i n g  r e c u r s i v e  f u n c t i o n  d o  f o r  a  g i v e n  Linked List with first
node as head?
void fun1(struct node* head)
{
  if(head == NULL)
    return;
    fun1(head->next);
  printf("%d ", head->data);
}
  • e
    Define a sparse matrix. Suggest a space efficient represent ation for space matrices. 5
  • f
    List the advantages of doubly linked list over single linke d list. 1
  • g
    Give example of one each stable and unstable sorting techni ques. 2
  • h
    Write advantages o f AVL tree over Binary Search Tree (BST) 3 (i) What is tail recursion? Explai n with a suitable example. 4 (j) Write different representatio ns of graphs in the memory. 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
    Write advantages and disadvantages of linked list over arra ys. Write a 'C' function creating new linear linked list by selecting alternate elements of a linear linked list
  • b
    Write algorithms of insertion sort. Implement the same on t he following numbers;
    also calculate its time complexity. 13, 16, 10, 11, 4, 12, 6, 7
  • c
    Differentiate between DFS and BFS. Draw the breadth First Tree for the above graph
  • d
    Differentiate betw een liner and binary search algorithm. Write a recursive function to implement binary search
  • e
    What is the significance of maintaining threads in Binary S earch Tree? Write an algorithm to insert a node in thread binary tree
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
    Suppose a three dimensional array A is declared using A[1:10, -5:5, -10:5) (i) Find the length of each dimension and the number of elements in A (ii) Explain Row major order and Column Major Order in detail w ith explanation formula expression
  • b
    Discuss the representation of polynomial of single variable using linked list. Write 'C' functions to add two such polynomials represented by linked list
  • a
    (i) Use the merge sort algor ithm to sort the following elements in ascending order. What is the time and space complexity of merge sort? (ii) Use quick sort algorithm to sort 15,22,30,10,15,64,1,3,9,2 . Is it a stable sorting algorithm? Justify
  • b
    (i) The keys 12, 17, 13, 2, 5, 43, 5 and 15 are inserted in to an initially empty hash table of length 15 using open addressing with hash function h(k ) = k mod 10 and linear probing. What is the resultant hash table? (ii) Differentiae between linear and quadratic probing techniques
  • a
    Use Dijkstra’s algorithm to f ind the shortest paths from source to all other vertices in the following graph
  • b
    Apply Prim’s algorithm to find a minimum spanning tree in t he following weighted graph as shown below
  • a
    (i) Write an iterative functio n to search a key in Binary Search Tree (BST). (ii) Discuss disadvantages of recursion with some suitable example
  • b
    (i) What is Recursion? (ii)Write a C program to calculate factorial of number using re cursive and non- recursive functions
  • a
    (i) Why does time complexity of search operation in B-Tree is better than Binary Search Tree (BST)? (ii) Insert the following keys into an initially empty B-tree of order 5 (iii) What will be the resultant B-Tree after deleting keys j, t and d in sequence?
  • b
    (i) Design a method for keeping two stacks within a single linear array so that neither stack overflow until all the memory is used. (ii) Write a C program to reverse a string using stack

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 — KCS-301

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

2x

Use Dijkstra’s algorithm to f ind the shortest paths from source to all other vertices in the following graph

Appeared in: 2021-22 · 2022-23

Data Structure — Other Year Papers

AKTU Data Structure PYQs from other sessions

Data Structure2022-23Data Structure2023-24Data Structure2024-25Data Structure2025-26Data Structure2024-25

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

Other subjects from same semester and session

Python Programming2021-22Energy Science And Engineering2021-22Mathemativs Iv2021-22Computer Organization And Architecture2021-22Computer System Security2021-22Thermodynamics2021-22Introduction To Soft Computing2021-22Discrete Structures Theory Of Logic2021-22
View all B.Tech Semester 3 2021-22 papers →

Syllabus & More PYQs

Paper solve karne se pehle unit-wise syllabus dekh lo

📘 Data Structure — Unit-wise SyllabusBCS301AKTU 2nd Year SyllabusAKTU 2nd Year PYQs — All BranchesCSE 2nd Year Syllabus