MAXIMUM POSSIBLE QUESTIONS--CS2201- DATA STRUCTURES IN “C”

                                      MAXIMUM POSSIBLE QUESTIONS
                             CS2201- DATA STRUCTURES IN “C”

PART—B cum PART—A QUESTIONS:

01.Explain the prim's algorithm and kruskal's algorithm to find the minimum
spanning tree. Elucidate with routines and examples.

02.What is topological sorting? Give a diagram, sort the elements in topological
order. State the routines also.

03.Given a graph, apply the two algorithms to find the minimum cost. Write
their routines.

04.Write a note on
(a) Euler's paths and circuits.
(b)Graph traversals.

05.Explain Articulation points and routines to find them with examples.

06.(a).Write a note on weighted and non-weighted graphs. How will find the shortest path of them?
           Write the routines and explain with examples.
     (b).Given a weighted graph, find the shortest path of it and write the routines.

07.Elucidate with routines and diagrams the operations performed on a doubly
linked list.PART—B cum PART—A QUESTIONS:

08.What are heaps? Explain the properties with routines. How will you perform Heap sort?

09.Elucidate with routines and diagrams the operations performed on a singly linked list.

10.(a).Explain the mechanism of Radix sort and TOH.
     (b).How will you add, subtract and multiply two polynomials? Explain .

11.Elucidate the cursor implementation of linked lists in detail.

12.Describe the applications and operations performed on a stack.

13.With routines, explain the operations performed on a DEQUEUE and a
circular Queue.

14.Explain the (a)dynamic equivalence problem
                        (b)smart union algorithms.
                        (c)path compression.

15.Explain the analysis of insertion and deletion operations on a BST.

16.Elucidate the Tree traversals. Given an expression, form the tree for that
and perform these three traversals.

17.Elucidate the operations performed on a BST and a B-tree.

18.Describe the operations performed on an AVL tree.

19.What is Hashing? Explain open addressing and separate chaining with
the collision resolving techniques.

20.Explain the following:
(a)Extendible hashing (b)Double hashing (c)Rehashing.

ANALYSIS from previous years' question paper...so far the questions are asked
like the following order:
Unit-1:
11.(a) lists,stacks.
11.(b)lists,Queues.

Unit-2:
12.(a)Binary tree and binary search trees.
     (b)B- trees and binary search trees.

Unit-3:
13.(a)AVL trees.
     (b)Heaps.

Unit-4:
14.(a)Hashing.
     (b)Sets.

Unit-5:
15.(a)Shortest path algorithms, topological sort, graph traversals.
(b)Minimum spanning tree, euler's concepts, articulation points.







Prepared by,
RANGARAJAN T.R.