PCA25C02T · End Semester
Covers all units: Introduction / Stack, Queue and Tree / Categories of Tree / Graph and Sorting / Algorithms
Answer any 5 Questions
Classify and write about the various asymptotic notations.
Define linked list and explain its applications.
Elucidate the applications of stack and queue in real life scenario.
Write about the properties of binary tree.
What is threaded binary tree ? How is it different from a binary tree ?
Discuss various types of searching and its applications.
What are graphs? Write various ways of representing graphs.
Summarize on multistage graphs.
Answer all Questions
What is Data Structure ? Explain various types of data structure with an example.
Explain the application of the following terms with a suitable example
a. Circular linked list (7 Marks)
b. Doubly linked list (8 Marks)
Develop an algorithm to implement stack and its various operations using array.
Explain various operation of queue. How is it different from priority and circular queue?
Implement binary search tree and explain how an AVL can be constructed using suitable example.
Develop an algorithm to implement merge sort. Explain with a suitable example.
What is Hashing ? Discuss the various ways of implementing hash techniques with suitable examples.
Implement Prim's and Kruskal's algorithm and explain its working principles with an example.
Implement a traveling salesman problem with suitable example.
What is greedy algorithm? Develop an algorithm to solve knapsack problem.