THIRD SEMESTER B.A./B.Sc. DEGREE EXAMINATION, NOVEMBER 2019
(CUCBCSS—UG)
Computer Science

BCS 3B 04—DATA STRUCTURES USING C
(2017 Admissions)

Maximum : 80 Mark:

Time : Three Hours
Section A

Answer all the questions.
Each question carries 1 mark.

Define primary data structures
In what areas do data structures are applied ?

What is mean by subscripted variable in linear array ?

Define linked list ?

What is priority queue ?

Write down the steps in preorder traversal.

What is level number ? How it is represented in a tree.

بر مم ‎४ ८७‏ یج © تح 5

Write the following prefix notation to expression tree in step by step.

+, *,2,6,/, 3, 8.
Explain when a directed graph is said to be unilaterally connected ? Explain.

10. What is the complexity of selection sort ? Explain.
1 (10 x 1 = 10 marks)

Section B
Answer all the questions (Paragraph Type questions).

Each question carries 3 marks.

Let H be the string “ WXYZ”.

11.
(a) Find the length of H and List all substrings of H.

(b) List all the initial substrings of H.