Data Structures Analysis Of Algorithms (KCA205) - AKTU Question Paper 2023-24
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 2023-24. Published by Dr. A.P.J. Abdul Kalam Technical University (AKTU/UPTU), Lucknow. Free PDF download — no login required.
Course:MCA
Semester:Semester 2
Session:2023-24
University:AKTU / UPTU
Rate this paper
Questions Asked in 2023-24
Data Structures Analysis Of Algorithms (KCA205) — extracted question text · 100 marks · 3 Hours
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
- aDefine algorithm. Give its characteristics. 02 1
- bWhat is header linked list? 02 1
- cDefine recursion. 02 2
- dWhat is priority queue? 02 2
- eTraverse a given tree in Pre-order traversal. 02 3
- fDefine Threaded binary tree. 02 3
- gDefine fully connected graph. 02 4
- hWhat is weighted graph? 02 4 i. Apply Quick sort algorithm on the string : D, E, L, H, I 02 5 j. What is minimum spanning tree (MST)? 02 5
Section BAttempt any three o f t h e f o l l o w i n g : 3 x 1 0 = 3 0
- aHow polynomials can be repres ented using linked list? Write a function/algorithm to add two polynomials
- bWhat is hashing? How can we define hash function? 10 2
- cDefine binary search tree. Create a binary search tree by in serting following keys: 9, 2, 3, 4, 5, 6, 8, 1, 7, 0
- dWhat is the divide and conque r problem solving strategy? How binary search algorithm follows this approach?
- eGiven two strings, find the Longest Common Subsequence (LCS) , present in both of the strings. String-1=ASDFGHJK Strin g-2=SHJLU
Section CAttempt any one p a r t o f t h e f o l l o w i n g : 1 x 1 0 = 1 0
- aDefine linked list. Write a f unction in C to create a singly linked list. 10 1
- bWhat is sparse matrix? How it can be represented using heade r linked list
- aGive applications of stack. Write an algorithm to evaluate p ostfix expression
- bDefine linear queue. Write a program or algorithm to implement linear queue
- aDefine AVL tree. Demonstrate LL, RR, LR, RL rotations of AVL tree with suitable examples
- bWrite the properties of B-Tr ee. Insert the following keys in a B-Tree of order 3: 98, 76, 54, 32, 12, 34, 56, 78, 95, 48
- aWhat is breadth first search (BFS) algorithm for traversing a graph? Apply BFS in the given graph, assuming vertex A as starting vertex
- bDifferentiate between Graph and Tree. Give adjacency matrix representation of the following graph
- aWrite a program in C to implement merge sort. Give its time and space complexity
- bFind the shortest paths from the source to all the other ver tices in the given graph using Dijkstra’s algorithm. Assume source vertex as S
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.
Data Structures Analysis Of Algorithms — Other Year Papers
AKTU Data Structures Analysis Of Algorithms PYQs from other sessions
More MCA Semester 2 (2023-24) Papers
Other subjects from same semester and session
Operating Systems2023-24Database Management Systems2023-24Theory Of Automata Formal Languages2023-24Cyber Security2023-24Object Oriented Programming2023-24
View all MCA Semester 2 2023-24 papers →