QUESTION GUILD ON DATA STRUCTURE
EXERCISES
1. Define data structure. What is the main advantage of data structure?
2. What are the different types of data structures?
3. Define Abstract Data Type.
4. Define an array. Mention the different kinds of arrays with which you can
manipulate
and represent data.
5. A two dimensional array consisting of 8 rows and 3 columns is stored in a row
major
order. Compute the address of element A(4, 2). Base address is 1000 and word length
is 2. Find the address of the same element in the column major representation.
6. How much memory is required for storing two matrices A(10,15,20) and
B(11,16,21)
where each element requires 16 bit for storage.
7. What are the differences between arrays and structures?
8. Define stack. Give some applications of stack.
9. Write a C/C++ code to check the stack full and stack empty condition
10. Define the terms: Infix, postfx and prefix.
11. What are the advantages in reverse polish (prefix and postfix notation) over polish
(infix) notation?
12. Define queue and give its applications13. What is a circular queue? How do you
check the queue full condition?
14. Write a C/C++ program to count the nodes in a circular queue
15. Define Dequeue.
16. What are the two kinds of dequeue?
17. What is a priority queue?
18. Define Linked list and give its applications.
19. Compare array and linked list.
20. Define Doubly Linked List.
21. What are the advantages of using doubly linked list over singly linked list?
22. List the advantages of linked list
EXERCISES
1. Define data structure. What is the main advantage of data structure?
2. What are the different types of data structures?
3. Define Abstract Data Type.
4. Define an array. Mention the different kinds of arrays with which you can
manipulate
and represent data.
5. A two dimensional array consisting of 8 rows and 3 columns is stored in a row
major
order. Compute the address of element A(4, 2). Base address is 1000 and word length
is 2. Find the address of the same element in the column major representation.
6. How much memory is required for storing two matrices A(10,15,20) and
B(11,16,21)
where each element requires 16 bit for storage.
7. What are the differences between arrays and structures?
8. Define stack. Give some applications of stack.
9. Write a C/C++ code to check the stack full and stack empty condition
10. Define the terms: Infix, postfx and prefix.
11. What are the advantages in reverse polish (prefix and postfix notation) over polish
(infix) notation?
12. Define queue and give its applications13. What is a circular queue? How do you
check the queue full condition?
14. Write a C/C++ program to count the nodes in a circular queue
15. Define Dequeue.
16. What are the two kinds of dequeue?
17. What is a priority queue?
18. Define Linked list and give its applications.
19. Compare array and linked list.
20. Define Doubly Linked List.
21. What are the advantages of using doubly linked list over singly linked list?
22. List the advantages of linked list
