Government Arts College,Udumalpet Government Arts College,Udumalpet
PG & Research Department of Computer Science PG & Research Department of Computer Science
Model Exam Oct 2024 Model Exam Oct 2024
Class : II B.Sc CS Sub : Data Structures Max Marks : 75 Class : II B.Sc CS Sub : Data Structures Max Marks : 75
Section A (10 x1 =10 Marks) Section A (10 x1 =10 Marks)
1. What is data structure? 11. What is data structure?
2. Define Array? 12. Define Array?
3. Sequential Mapping used for? 13. Sequential Mapping used for?
4. Give the Meaning of Generalized List? 14. Give the Meaning of Generalized List?
5. Give the example of Binary Tree? 15. Give the example of Binary Tree?
6. What do you mean by Graph? 16. What do you mean by Graph?
7. What is Symbol table? 17. What is Symbol table?
8. What are the type’s external devices? 18. What are the type’s external devices?
9. What do you mean by Sorting? 19. What do you mean by Sorting?
10. Define Cellular Partitions? 20. Define Cellular Partitions?
Section B (5x 5 =25 Marks) Section B (5x 5 =25 Marks)
11 .(a) Writes notes on Algorithm. (Or) 11 .(a) Writes notes on Algorithm. (Or)
(b) Explain about Sparse matrices. (b) Explain about Sparse matrices.
12.(a) Discuss Circular queue? (Or) 12.(a) Discuss Circular queue? (Or)
(b) What are the Working definitions of Stack? (b) What are the Working definitions of Stack?
13.(a) Brief notes of Singly linked list. (Or) 13.(a) Brief notes of Singly linked list. (Or)
(b) Define Threaded Binary Tree. (b) Define Threaded Binary Tree.
14. (a) Detail about K-Way Merge give eg. (Or) 14. (a) Detail about K-Way Merge give eg. (Or)
(b) Discuss Hashing Functions. (b) Discuss Hashing Functions.
15. (a) Short notes on Quick short. (Or) 15. (a) Short notes on Quick short. (Or)
(b) Explain about Inverted files. (b) Explain about Inverted files.
Section C (5 x 8 =40 Marks) Section C (5 x 8 =40 Marks)
16.(a) How to create and analyze programs? (Or) 16.(a) How to create and analyze programs? (Or)
(b) Explain about Multi dimension array with an example? (b) Explain about Multi dimension array with an example?
17. (a) Explain in detail about Doubly Linked Lists? (or) 17. (a) Explain in detail about Doubly Linked Lists? (or)
(b) Briefly explain Linked Stacks and queue? (b) Briefly explain Linked Stacks and queue?
18. (a) Explain in detail about binary tree search algorithms? 18. (a) Explain in detail about binary tree search algorithms?
(Or) (b)Short notes on graph and its types? (Or) (b)Short notes on graph and its types?
19.(a) Give the details of External Sorting with Disks? (Or) 19.(a) Give the details of External Sorting with Disks? (Or)
(b) Write notes on Static Tree tables and Dynamic Tree tables. (b) Write notes on Static Tree tables and Dynamic Tree tables.
20.(a) Detail about Two Way Merge Sort, Heap Sort with ex 20.(a) Detail about Two Way Merge Sort, Heap Sort with ex
(Or) (b) Explain detail about Index techniques and types? (Or) (b) Explain detail about Index techniques and types?
Government Arts College,Udumalpet Government Arts College,Udumalpet
PG & Research Department of Computer Science PG & Research Department of Computer Science
Model Exam Oct 2024 Model Exam Oct 2024
Class : II B.Sc CS Sub : Data Structures Max Marks : 75 Class : II B.Sc CS Sub : Data Structures Max Marks : 75
Section A (10 x1 =10 Marks) Section A (10 x1 =10 Marks)
1. What is data structure? 11. What is data structure?
2. Define Array? 12. Define Array?
3. Sequential Mapping used for? 13. Sequential Mapping used for?
4. Give the Meaning of Generalized List? 14. Give the Meaning of Generalized List?
5. Give the example of Binary Tree? 15. Give the example of Binary Tree?
6. What do you mean by Graph? 16. What do you mean by Graph?
7. What is Symbol table? 17. What is Symbol table?
8. What are the type’s external devices? 18. What are the type’s external devices?
9. What do you mean by Sorting? 19. What do you mean by Sorting?
10. Define Cellular Partitions? 20. Define Cellular Partitions?
Section B (5x 5 =25 Marks) Section B (5x 5 =25 Marks)
11 .(a) Writes notes on Algorithm. (Or) 11 .(a) Writes notes on Algorithm. (Or)
(b) Explain about Sparse matrices. (b) Explain about Sparse matrices.
12.(a) Discuss Circular queue? (Or) 12.(a) Discuss Circular queue? (Or)
(b) What are the Working definitions of Stack? (b) What are the Working definitions of Stack?
13.(a) Brief notes of Singly linked list. (Or) 13.(a) Brief notes of Singly linked list. (Or)
(b) Define Threaded Binary Tree. (b) Define Threaded Binary Tree.
14. (a) Detail about K-Way Merge give eg. (Or) 14. (a) Detail about K-Way Merge give eg. (Or)
(b) Discuss Hashing Functions. (b) Discuss Hashing Functions.
15. (a) Short notes on Quick short. (Or) 15. (a) Short notes on Quick short. (Or)
(b) Explain about Inverted files. (b) Explain about Inverted files.
Section C (5 x 8 =40 Marks) Section C (5 x 8 =40 Marks)
16.(a) How to create and analyze programs? (Or) 16.(a) How to create and analyze programs? (Or)
(b) Explain about Multi dimension array with an example? (b) Explain about Multi dimension array with an example?
17. (a) Explain in detail about Doubly Linked Lists? (or) 17. (a) Explain in detail about Doubly Linked Lists? (or)
(b) Briefly explain Linked Stacks and queue? (b) Briefly explain Linked Stacks and queue?
18. (a) Explain in detail about binary tree search algorithms? 18. (a) Explain in detail about binary tree search algorithms?
(Or) (b)Short notes on graph and its types? (Or) (b)Short notes on graph and its types?
19.(a) Give the details of External Sorting with Disks? (Or) 19.(a) Give the details of External Sorting with Disks? (Or)
(b) Write notes on Static Tree tables and Dynamic Tree tables. (b) Write notes on Static Tree tables and Dynamic Tree tables.
20.(a) Detail about Two Way Merge Sort, Heap Sort with ex 20.(a) Detail about Two Way Merge Sort, Heap Sort with ex
(Or) (b) Explain detail about Index techniques and types? (Or) (b) Explain detail about Index techniques and types?
