Question 1: Define the term data structure. Describe various kinds of data structures with illustrations.
Question 2: What are linear arrays? Illustrate in detail their representation in memory.
Question 3: Define the term stack and state various ways of representing them in computer.
Question 4: What do you mean by binary tree? Describe the pre-order and in-order traversals of it.
Question 5: An array A contains the given elements: 77, 33, 44, 11, 88, 22, 66, 55
Arrange all these elements in sorted order by using selection sort and describe its complexity.
Question 6: Describe various operations on data structures.
Question 7: How do you analyze the complexity of the algorithms?
Question 8: Write a C program to check whether the given string is a palindrome or not.
Question 9: Write the process for bubble sort and describe its complexity.
Question 10: Describe the process for searching a specific item in a linked list when the list is not sorted.
Question 11: Define the term priority queues. Describe.
Question 12: Write the procedure for inserting an element into the heap.