Data Structures Important Questions – DS Imp Qusts

Data Structures Important Questions Pdf file – DS Imp Qusts

Please find the attached pdf file of Data Structures Important Questions Bank – DS Imp Qusts

Link – DS Question Bank

UNIT – I

1. Define the term algorithm and state the criteria the algorithm should satisfy?
2. Define recursive algorithm?
3. Differentiate between recursive and iterative algorithms?

For more questions please download the above Pdf file

UNIT – II

1. Define Stack?
2. List the applications of stack?
3. Define Queue?

For more questions please download the above Pdf file

UNIT – III

1. Define Tree?
2. List the applications of Trees?
3. Define the terms node, degree, siblings, depth/height, level?

For more questions please download the above Pdf file

UNIT – IV

1. Differentiate Linear search and binary search?
2. Define Hashing?
3. Explain Hash Function?

For more questions please download the above Pdf file

UNIT – V

1. Define balanced search tree?
2. Define binary search tree with example?
3. State the operations on binary search tree?
4. Compare binary tree and binary search tree?

For more questions please download the above Pdf file