132184

D 12005 (Pages : 2) 71877೮1138 ........... casesasses

THIRD SEMESTER (CBCSS-UG) DEGREE EXAMINATION
NOVEMBER 2021

Computer Science
BCS 3B 04—DATA STRUCTURES USING C
(2019—2020 Admissions)
Time : Two Hours Maximum : 60 Marks
Section A

Answer atleast eight questions.
Each question carries 3 marks.
All questions can be attended.
Overall ceiling 24.
What are data structures ? Examples.
Explain the string operation, “Concatenation”.
How to represent a one dimensional array in memory ?
What are the advantages of dynamic memory allocation ?

Specify one of the applications of alinked list.

= ~ ~ ^

What is the significance of the term “top of the stack” ?
7. Explain the procedure to add a new element in to a linear queue.

What are priority queues ?

छ 9

Define a binary tree data structure with example.
10. Explain in-order tree traversal procedure.
11. Whatis directed graph ?

12. Whatis the basic concept of alinear search ?

(8 x 3 = 24 marks)
Section B

Answer atleast five questions.
Each question carries 5 marks.
All questions can be attended.
Overall ceiling 25.
13. What are the features of a good algorithm ? Discuss the complexity measures.
14. What are sparse matrices ? Explain its memory representation and operations.

Turn over

132184