Q1) Attempt the following (in short)
1. Define an algorithm.
2. List any two characteristics of a good algorithm.
3. Define Space Complexity.
4. Which searching algorithm works only on sorted arrays?
5. Enlist the operations you can perform on a singly linked list.
6. Which linked list type allows traversal in both forward and backward directions?
7. Define Bubble Sort.
8. Define array in python.
9. Define Quick Sort.
10. Define Insertion Sort
11. Define Selection Sort
12. Define Heap Sort
13. Define Merge Sort
14. What is a linked list?
15. Define a node in the context of a linked list.
16. What is the main difference between an array and a linked list?
17. What is the advantage of a linked list over an array?
18. What is the head of a linked list?
19. Define static memory allocation and dynamic memory allocation
20. Which data structure uses dynamic memory allocation: arrays or linked lists?
21. What is the main disadvantage of static representation?
22. How is the last node connected in a circular singly linked list?
23. What is the head pointer in a circular singly linked list?
24. What does the display operation do in a circular singly linked list?
25. Is it possible to traverse a circular singly linked list indefinitely?
26. How many pointers does each node have in a circular doubly linked list?
27. How is the tail node connected in a circular doubly linked list?
28. What is the difference between a doubly linked list and a circular doubly linked list?
29. Define the display operation in circular doubly linked list.
30. Can circular doubly linked list be traversed starting from any node? Justify.
Q2) Attempt the following (long answers questions)
1. Difference between a singly linked list and a doubly linked list
2. Write an algorithm for linear search with its advantages and disadvantages.
3. Write an algorithm for Quick sort with its advantages and disadvantages
4. Write an algorithm for Insertion Sort with its advantages and disadvantages
5. Write an algorithm for Selection Sort with its advantages and disadvantages
6. Write an algorithm for Heap Sort with its advantages and disadvantages
7. Write an algorithm for linear search with its advantages and disadvantages
8. Write an algorithm for Merge Sort with its advantages and disadvantages
9. Explain the structure and operations of a circular doubly linked list with diagrams.
10. Define Searching. Explain any one technique in detail.
11. Sort the following data using Quick Sort: [10, 7, 8, 9, 1, 5]
12. Sort the following data using Insertion Sort: [12, 11, 13, 5, 6, 7]
13. Sort the following data using Bubble Sort: [34, 7, 23, 32, 5, 62, 19, 90, 12, 45]
14. Sort the following data using Selection Sort: [15, 88, 42, 67, 33, 21, 79, 54, 90, 10]
15. Sort the following data using Heap Sort: [44, 22, 66, 88, 11, 99, 55, 33, 77, 10, 12, 15]
16. Sort the following data using Merge Sort: [18, 9, 45, 32, 20, 15, 10, 50, 25, 40, 5]
17. Sort the following data using Quick Sort: [25, 17, 31, 13, 2, 89, 54, 12, 70, 33, 48]
18. Sort the following data using Insertion Sort: 50, 40, 70, 10, 60, 20, 90, 30, 80]
19. Explain in detail Non-Recursive (Iterative) Binary Search
20. Explain in detail Recursive Binary Search.
21. Explain the structure of a linked list with a diagram.
22. List advantages and disadvantages of linked lists over arrays.
23. Describe how memory allocation differs in arrays and linked lists.
24. Explain the term "dynamic memory allocation" in the context of linked lists.
25. What are the basic operations on linked lists? Explain briefly.
26. Differentiate between static and dynamic memory allocation with examples.
27. Explain how a linked list uses dynamic memory allocation.
28. Describe why dynamic representation is preferred in linked lists.
29. What is the role of pointers in the dynamic representation of linked lists?
30. Discuss the advantages of dynamic memory allocation in linked list implementation.
31. Explain singly linked list with its structure and operations.
32. Describe the doubly linked list and its advantages over singly linked list.
33. What is a circular linked list? Explain its structure and use cases.
34. Compare and contrast singly, doubly, and circular linked lists.
35. Write a real-life scenario where circular linked list would be useful.
36. Write the algorithm to display nodes in a doubly linked list.
37. Discuss the advantages of doubly linked lists over singly linked lists.
38. Write an algorithm to display all elements of a circular singly linked list.
39. Discuss the advantages of circular singly linked lists compared to singly linked lists.
40. Explain the structure of a circular singly linked list with a diagram.
41. Explain the structure of circular doubly linked list with an example.
42. Write an algorithm to display nodes of a circular doubly linked list
