Tuesday, August 18, 2009

PART - A Questions

DATA STRUCTURES

PART - A Questions

Previous Next

1. Define “Data Structures”.


2.Differentiate linear and nonlinear data structure?


3.What is an Array?What are row major order and column major ordering in an array?


4.Differentiate between static and dynamic data structures?


5.Define stack and various operations performed in it?


6.What is stack overflow and underflow?


7.Explain the array representation of stack?


8.What are the basic properties of Arrays?


9.Define a queue?


10.Mention any two similarities and dissimilarities between stack and queues.


11.What is Deque?


12.What is a priority queue?


13.Discuss “Circular queues” with an example.


14.Define Lists?


15.what is Linked list? List out the different types of linked lists bringing out the differences between each.


16.What are the applications of stack?


17.What are the applications of queue?


18.What are the advantages of using Doubley linked list over singly linked list?


19.Write an algorithm to count the number of nodes in a singly linked list?


20.List the disadvantages of array?

21. What are trees?


22. What is a binary tree and list out the its properties?


23. How are Binary trees represented ?


24. Define a Binary Search Tree.


25. Write algorithm for post order traversal of a Binary tree?



26. Represent the following algebraic expression into binary tree form:
A + (B-C)*(E+F)/G.


27. How to represent a binary tree in memory using an array? Mention the disadvantages of using an array to represent a binary tree.


28. What is meant by sorting?


29. How do you compute the time complexity for sorting algorithm?


30. What is meant by Internal Sorting?


31. Sort the following numbers using Merge sort 15,5,30,6,3,95.


32. What is the time complexity of Tree sorting and Merge sorting?


33. How to represent a binary tree in memory using an array?Mention the disadvantages of using an array to represent a binary tree.


34. Sort the following numbers using Radix sort:
17,220,8,45,1875.


35. What are the major differences between linear search and binary search procedures? Write their time complexity.


36. What do you mean by Hash function? Give an example.

Previous Next





No comments:

Post a Comment