DATA STRUCTURES ( CODE:BTCS 304) IMPORTANT & EXPECTED QUESTIONS- NOTES 2

DATA STRUCTURES ( CODE:BTCS 304)  

(IMPORTANT & EXPECTED QUESTIONS-IMPORTANT FOR PTU EXAMS)

Q31. What is Sparse Matrix?

Q32. What is AVL Tree?

Q33. What is Dynamic Memory Allocation?

Q34. Give the classification of Data types.

Q35. Explain the terms Front and Rear for Queue.

Q36. State different ways of Traversing Binary Tree.

Q37. Explain Complete Binary Tree.

Q38. What is the Principle of Stack with its 2 applications.

Q39. What do you mean by Abstract Data Type?

Q40. What is the usage of Stack in Recursive Algorithm Implementation?

Q41. Evaluate: (a)  + 1243+*41-

                         (b) 257*14-6+

Q42. Define Radix Sort.

Q43. What do you mean by Dangling Pointers?

Q44. What is a TOP Pointer of a Stack?

Q45. Define Degree of a Graph.

Q46. How a Heap is created?

Q47. How a Binary tree can be represented as an Array structure?

Q48. What is need for Garbage Collection?

Q49. What is the best and average case of Binary search?

Q50. Define Bubble Sort.