Scribd
Upload
3 views2 pages

Data Structures and Algorithms Q&A Guide

The document contains a list of subjective questions related to data structures and algorithms, covering fundamental concepts such as definitions, types, and operations of data structures, as well as various algorithm analysis techniques. It includes inquiries about specific algorithms like greedy, divide and conquer, and dynamic programming, along with sorting and searching methods. Additionally, it addresses tree structures, graph theory, and concepts like minimum spanning trees and hashing.

Uploaded by

ademfaxuma8
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views2 pages

Data Structures and Algorithms Q&A Guide

The document contains a list of subjective questions related to data structures and algorithms, covering fundamental concepts such as definitions, types, and operations of data structures, as well as various algorithm analysis techniques. It includes inquiries about specific algorithms like greedy, divide and conquer, and dynamic programming, along with sorting and searching methods. Additionally, it addresses tree structures, graph theory, and concepts like minimum spanning trees and hashing.

Uploaded by

ademfaxuma8
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Data structure and algorithm analysis subjective questions

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

You might also like