289099

D 31787 (Pages : 2) पपि या © ०००००००००००००००००००००००००००००००००००००००००

THIRD SEMESTER (CBCSS—UG) DEGREE EXAMINATION
NOVEMBER 2022
Computer Science
BCS 3B 04—DATA STRUCTURES USING C
(2019 Admission onwards)
Time : Two Hours Maximum : 60 Marks
Section A (Short Answer Type Questions)

Answer all questions, each correct answer carries a maximum of 2 marks.
Ceiling 20 marks.

1. What are derived data types ? Example.
2. List out any three string manipulation operations ?
3. How to perform a traversal in an array ?
4. What are the limitations of a linear array representation 7
5. Explain the basic structure of a doubly linked list.
6. What is LIFO terminology ? Example.
7. What are linear queues ?
8. Specify the advantages of a circular queue.
9. Define the tree data structure with example.
10. Explain the pre-order tree traversal procedure.
11. What is undirected graph ?
12. What are hash functions ? Example.
Section B (Short Essay Type Questions)

Answer all questions, each correct answer carries a maximum of 5 marks.
Ceiling 30 marks.

13. Whatis a data structure ? Explain its classification with suitable examples.
14. Explain the procedure to insert an element in a specified position of an array.

Turn over

289099