D C1142 Pages 3

Reg No.:_. Name:
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
THIRD SEMESTER B.TECH DEGREE EXAMINATION(S), MAY 2019

Course Code: CS205
Course Name: DATA STRUCTURES (CS,IT)

Max. Marks: 100 Duration: 3 Hours
PARTA
Answer all questions, each carries3 marks. Marks
1 Define Big Oh, Big Omega and Big Theta Notations. (3)
2 Compare structured approach and object oriented approach of programming. (3)
3 Represent the following matrix using row major order and column major order. (3)

10 20 -32 44
3 99 12 0
21 -4 33 89

4 Write an algorithm to count the number of nodes in a singly linked list. (3)

PART 0
Answer any two full questions, each carries9 marks.
5 >) _ Define recursive function. What are the essential conditions to be satisfied by (4)
recursive function?

b) Write a recursive function to find the factorial of a given number. Write its time (5)

complexity.

6 Write algorithms to perform the following operations on a doubly linked list.
(i) Insert a node with data ரூ? after a node whose data is ‘x’. (3)
(11) Delete a node whose data is ‘s’ . (3)
(iii) Insert a node with data ‘a’ as the 1* node of the list. (3)

7 2) Explain structured approach to problem solving.
(3)
b) Write an algorithm to add 2 polynomials (single variable polynomials) (6)

represented using singly linked list.

PART C
Answer all questions, each carries3 marks.
8 Write an algorithm to reverse a string using stack. (3)
9 What are the disadvantages of representing a linear queue using array? How are (3)
they overcome?
10 Define (i) Tree (ii) Binary Tree (3)

Page 1 of 3