D 91686

Time

ಲಾ > ಬು (७

ಠಾ

10.

11;

12.
13.

(Pages : 2) ಕ ಯ 1111 வனை

ಗಂಟು. 140... கக ன்னைக

THIRD SEMESTER (CUCBCSS—UG) DEGREE EXAMINATION

NOVEMBER 2020

Computer Science

BCS 3B 04—DATA STRUCTURES USING C

(2017 Admissions)
: Three Hours
Part A

Answer all questions.
Each question carries 1 mark

Define Data structure.

What are substrings and pattern matching ?
Define linear array.

What are linked list ?

What are polish and Reverse polish notations ?
How a queue is represented in a computer ?
Define a complete Binary tree.

What are binary search tree ?

Define DFS and BPS traversal of graph.

Name two sorting algorithms.

Part B

Answer all questions.
Each question carries 3 marks.

Briefly explain the data structure operations.

Write the linear search algorithm.

Write an algorithm to insert a node at the beginning of a linked list.

Maximum : 80 Marks

(10 x 1 = 10 marks

Turn ove: