Scribd
Upload
3 views1 page

Data Structures & Algorithms Overview

The document outlines a series of questions related to data structures and algorithms, covering key concepts such as LIFO and FIFO, efficiency classes, Divide and Conquer, and various types of data structures. It also includes inquiries about algorithm design, mathematical analysis, and specific data structures like queues, linked lists, and trees. Additionally, it addresses techniques like backtracking and dynamic programming, along with their applications and examples.

Uploaded by

nutankhavare
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 views1 page

Data Structures & Algorithms Overview

The document outlines a series of questions related to data structures and algorithms, covering key concepts such as LIFO and FIFO, efficiency classes, Divide and Conquer, and various types of data structures. It also includes inquiries about algorithm design, mathematical analysis, and specific data structures like queues, linked lists, and trees. Additionally, it addresses techniques like backtracking and dynamic programming, along with their applications and examples.

Uploaded by

nutankhavare
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 STRUCTURES AND ALGORITHMS - Part A

Questions
1. Explain the concepts LIFO and FIFO with examples.

2. Explain the Basic Efficiency Classes in algorithms.

3. Explain the concept of Divide and Conquer with an an example.

4. Summarize the important problem types that algorithms solve.

5. Explain the steps involved in mathematical analysis of non-recursive algorithms.

6. Explain the steps involved in designing an algorithm.

7. List and explain the types of data structures with examples for each.

8. Define Queue and explain primitive operations on Queue.

9. Define Doubly Linked List and explain two differences between Singly Linked List and Doubly
Linked List.

10. Illustrate all basic efficiency classes with an example of an algorithm for each.

11. Explain any two Asymptotic notations with graph.

12. Explain the Divide and Conquer approach. Mention two algorithms which use Divide and
Conquer technique.

13. Summarize the steps involved in constructing a Huffman Tree and Huffman Code.

14. Explain working of Backtracking.

15. Define Data structures. List and explain types of data structure with its applications.

16. List and explain primitive operations on stack.

17. Explain any three types of trees with an example.

18. List and explain any two asymptotic notations with an example and graph.

19. Explain the working of divide and conquer approach.

20. List the steps involved in doing mathematical analysis of recursive algorithm.

21. Define backtracking. Explain the working of backtracking in general.

22. Define stack. Explain any three applications of stack.

23. List and explain the operations of circular queue.

24. Explain any three types of tree with an example for each.

25. Illustrate divide and conquer approach to solve the given problem.

26. Outline the working of dynamic programming.

27. Define backtracking. Explain its working.

28. List the steps involved in constructing Huffman trees.

You might also like