371522

C 41203 (Pages : 2) 71877೮1138 ........... casesasses

Time

10.
11.
12.

13.
14.

FOURTH SEMESTER (CBCSS—UG) DEGREE EXAMINATION
APRIL 2023

Computer Science
CSC 4C 04—DATA STRUCTURE USING C PROGRAMMING
(2019 Admission onwards)

: 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.

What are the various primitive and non-primitive data types ?
Explain user defined data structures with suitable example.
How to measure the space complexity of an algorithm ?
What are the dimensionality concepts of an array ?
What are the steps required to insert an element in a static one dimensional array ?
Explain the basic concept of a linked list.
What are the advantages of doubly linked list over a singly linked list ?
What are the advantages of LIFO architecture ? Example.
Develop the procedure to delete an element from the top of the stack.
What is Deque ? Explain.
What are the complexity measures of algorithms ?
What is the basic concept of a bubble sort ?
Section B (Short Essay Type Questions)

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

What is an Algorithm ? Explain the characteristics of a good algorithm.
Explain the representation of a three dimensional array in memory.

Turn over

371522