Scribd
Upload
16 views3 pages

Data Structure Important

The document contains a series of questions and topics related to data structures and algorithms, covering concepts such as non-linear data structures, linked lists, time complexity, stacks, queues, trees, graphs, and various algorithms like binary search and quicksort. It also addresses the importance of algorithms, their complexities, and specific operations related to data structures. Additionally, it discusses the advantages and disadvantages of different data structures and algorithms.

Uploaded by

akashs123csa01
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
16 views3 pages

Data Structure Important

The document contains a series of questions and topics related to data structures and algorithms, covering concepts such as non-linear data structures, linked lists, time complexity, stacks, queues, trees, graphs, and various algorithms like binary search and quicksort. It also addresses the importance of algorithms, their complexities, and specific operations related to data structures. Additionally, it discusses the advantages and disadvantages of different data structures and algorithms.

Uploaded by

akashs123csa01
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
You are on page 1/ 3

2 marks

1. What do you mean by non-linear data structure? Give example.

2. List the various operations that can be performed on data structure.

3. What is a Linked List?

4. Define Time Complexity. Give example.

5. What are the operations performed by stack?

6. Define a Circular Queue.

7. Write about Trees.

8. What are the functions of primitive data types?

9. State the importance of sparse matrices.

10. Define Enqueue. Give one example.

11. Define Binary Search Tree.

12. State any two characteristics of Circular program.

13. Define an algorithm.

14. What is meant by graphs? Give an example.

15. State the difference between pseudocode and programming code.

16. What is Big O notation in asymptotic analysis?

17. What does the term "asymptotic complexity" mean?

18. Define "minimal spanning tree" in graph theory.

19. Define the binary search algorithm.

20. What is the time complexity of Quick Sort?

21. State the basic principle of the Merge Sort algorithm.

22. What is backtracking?

23. What is the major difference between Binary Search and Linear Search?
24. Define the concept of "feasible solution" in the context of backtracking.

5 MARKS

1. Discuss the advantages and disadvantages of Stacks.

2. Briefly explain circular linked lists.

3. List the pros and cons of linked list

4. Write in detail about PUSH operations.

5. Write about queue operations.

6. Write an example program for a circular queue.

7. Explain about representation of binary trees.

8. Describe the steps involved in the hamiltonian cycle.

9. Explain the concept of a "single source shortest path" in graph algorithms.

10. What is the role of pseudocode in algorithm design? Explain with an example.

11. Describe Depth First Search (DFS) and its application in graph traversal.

12. Describe the binary search algorithm and explain its time complexity.

13. How does Quicksort work? Explain its partitioning technique with an example.

14. Explain the concept of kruskal’s algorithm.

15. Advantages and disadvantage of Backtracting

10 MARKS

1. Describe in detail about time and space complexity.

2. Explain about Doubly linked lists.

3. Briefly explain tree traversal.

4. Explain about AVL trees.

5. Write a program to implement stack using arrays.


6. Discuss the importance and applications of algorithms in problem-solving across various
domains.

7. Explain how asymptotic notations like Big O, Big Omega, and Big Theta are used to
describe the time and space complexities of an algorithm.

8. Explain about graph Coloring.

9. Write a program to illustrate the concept of Breadth first search.

10.Describe the Merge Sort algorithm with example program.

11. Briefly explain about sparse matrix and its representations

12. Describe about array representation

13. Importance of linked list and circular linked list

14. Explain about heaps concept

15. explain about types of graphs

You might also like