InterviewSolution
Saved Bookmarks
InterviewSolution
This section includes InterviewSolutions, each offering curated multiple-choice questions to sharpen your knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
What is the prefix and post fix notation of (a + b) * (c + d) ? |
| Answer» | |
| 2. |
What is interpolation search technique? |
| Answer» | |
| 3. |
What is hashing? |
| Answer» | |
| 4. |
What is fibonacci series? |
| Answer» | |
| 5. |
What is tower of hanoi? |
| Answer» | |
| 6. |
What is a recursive function? |
| Answer» | |
| 7. |
What is a heap in data structure? |
| Answer» | |
| 8. |
What is a minimum spanning tree (MST)? |
| Answer» | |
| 9. |
How Prim's algorithm finds spanning tree? |
| Answer» | |
| 10. |
How Kruskal's algorithm works? |
| Answer» | |
| 11. |
How many spanning trees can a graph has? |
| Answer» | |
| 12. |
What is a spanning tree? |
| Answer» | |
| 13. |
What is an AVL Tree? |
| Answer» | |
| 14. |
See the below image of a binary search tree, and traverse it using all available methods − |
| Answer» | |
| 15. |
What is tree traversal? |
| Answer» | |
| 16. |
What is a binary search tree? |
| Answer» | |
| 17. |
What is a binary tree? |
| Answer» | |
| 18. |
What is a tree? |
| Answer» | |
| 19. |
How breadth first traversal works? |
| Answer» | |
| 20. |
How depth first traversal works? |
| Answer» | |
| 21. |
What is a graph? |
| Answer» | |
| 22. |
How quick sort works? |
| Answer» | |
| 23. |
What is shell sort? |
| Answer» | |
| 24. |
What is merge sort and how it works? |
| Answer» | |
| 25. |
How insertion sort and selection sorts are different? |
| Answer» | |
| 26. |
What is selection sort? |
| Answer» | |
| 27. |
Tell me something about 'insertion sort'? |
| Answer» | |
| 28. |
What is bubble sort and how bubble sort works? |
| Answer» | |
| 29. |
What is linear searching? |
| Answer» | |
| 30. |
What operations can be performed on Queues? |
| Answer» | |
| 31. |
Why do we use queues? |
| Answer» | |
| 32. |
What is a queue in data-structure? |
| Answer» | |
| 33. |
What operations can be performed on stacks? |
| Answer» | |
| 34. |
Why do we use stacks? |
| Answer» | |
| 35. |
What is stack? |
| Answer» | |
| 36. |
What is a linked-list? |
| Answer» | |
| 37. |
What are some examples of dynamic programming algorithms? |
| Answer» | |
| 38. |
What are some examples of divide and conquer algorithms? |
| Answer» | |
| 39. |
Give some examples greedy algorithms. |
| Answer» | |
| 40. |
Briefly explain the approaches to develop algorithms. |
| Answer» | |
| 41. |
What are common operations that can be performed on a data-structure? |
| Answer» | |
| 42. |
What is linear data structure? |
| Answer» | |
| 43. |
What are asymptotic notations? |
| Answer» | |
| 44. |
What is asymptotic analysis of an algorithm? |
| Answer» | |
| 45. |
What are the criteria of algorithm analysis? |
| Answer» | |
| 46. |
Why we need to do algorithm analysis? |
| Answer» | |
| 47. |
What is algorithm? |
| Answer» | |
| 48. |
What are various data-structures available? |
| Answer» | |
| 49. |
What is data-structure? |
| Answer» | |