Data Structures Analysis Of Algorithms (KCA-205) - AKTU Question Paper 2021-22
MCA · Semester 2 · Free PDF Download
This is the official AKTU Data Structures Analysis Of Algorithms Previous Year Question Paper for MCA Semester 2, academic session 2021-22. Published by Dr. A.P.J. Abdul Kalam Technical University (AKTU/UPTU), Lucknow. Free PDF download — no login required.
Rate this paper
Questions Asked in 2021-22
Data Structures Analysis Of Algorithms (KCA-205) — complete question paper
- aDiscuss the limitation of arrays. 1
- bGive applications of linked list. 1
- cConvert following infix expr ession into postfix expression: implemented?
- eCan we apply binary s earch on unsorted array? 3
- fGive an example to demons trate insertion sort. 3
- gDraw the expression tree/2- Tree of following arithmetic expression
- hWhat are threaded binary tree? 4 (i) How the graph can be travers ed using Breadth First Search (BFS)? 5 (j) Discuss Strassen’s algorithm for matrix multiplication. 5
- aWhat is doubly linked list? Write a function to traverse a doubly linked list in reverse order
- bWrite a function or algorithm to implement enqueue and dequ e operations on circular queue
- cUse heap sort algorithm to sort the following sequence: {8, 5, 45, 24, 36, 11, 43, 21}. What is the time complexity of the algorithm?
- dDraw B-Tree of order 3 by i nserting following keys in empty tree
- eDiscuss Longest Common Subsequence (LCS) problem solution b y using dynamic programming. Give example
- aWrite a function or algorithm to add two Polynomials using linked list. 1
- bDefine header linked list. Write a function to perform inse rtion at end in a singly linked list
- aWhat is Tower of Hanoi problem? Explain the solutions of To wer of Hanoi problem using recursion where number of disks n= 3 and towers are A, B and C
- bWhat do you understand by hashing? Consider Inserting the k eys {76, 26, 37, 59, 21, 65, 88} into a Hash table of size m =11. U sing linear Probing, consider the primary hash function is h’(k) = k mod m
- aPerform Quick sort on the fo llowing data items stored in si ngle dimensional array: {6, 9, 5, 8, 7, 4,3, 1, 2, 0}. Also discuss its time complexity
- bDiscuss the function to implement merge sort. What is the t ime and space complexity of the algorithm?
- aHow BST is different from sorted array? Discuss the process to find an element in BST?
- bInsert the following element in empty AVL tree
- aWhat is minimum spanning tree (MST)? Draw MST of the follow ing graph by applying Kruskal’s algorithm
- bFor the given graph (weight ed, directed) apply Floyd-Warsha ll algorithm for constructing shortest path
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 — KCA-205
Questions that appeared in more than one session, found by comparing 4 years of Data Structures Analysis Of Algorithms papers (2021-22, 2022-23, 2023-24, 2024-25)
Define header linked list. Write a function to perform inse rtion at end in a singly linked list
Appeared in: 2021-22 · 2023-24
Data Structures Analysis Of Algorithms — Other Year Papers
AKTU Data Structures Analysis Of Algorithms PYQs from other sessions
More MCA Semester 2 (2021-22) Papers
Other subjects from same semester and session