B 0800csr20ll22r0r

RegNo.: Name:

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

Third Semester B.Tech Degree Regular and Supplementary Examination December

Course Code: CST201

Course Name: DATA STRUCTURES
Max. Marks: 100 Duration:3 Hours
PART A
Answer all questions. Each question carries 3 marks Marks

I Compute the time complexity of linear search algorithm using frequency count (3)
rnethod
2 Explain space complexity (3)

3 Represent the polynomial P(X,Y) : I0X7Y7+5X6Y5+4X4Y2+8X2+25 using (3)

array of structures.
Convertthe expression A+ B * C- D / E* H to postfixform. Showeach step inthe (3)
conversion including the stack contents

Explain self-referential structure with an example. Give any one use of self- (3)

referential structure.
Write an algorithm /pseudocode to count the number of nodes in a singly (3)

linked list
Explain BST and its properties. Give an example (3)
r7
8 Express the adjacency matric and the adjacency list representation ofthe graph (3)

9 Writi the insertion sort algorithm (3)

l0 Explain any two commonly used hash functions (3)

Page lof3

Downloaded from Ktunotes.in

 0800csT20tt22t0l

PART B
Answer any onefull qrestionfrom each module. Eoch question carries 14 marks
Module I
I I a Explain various asymptotic notations used in analysis of algorithm (9)
b Calculate the frequency count of the statement x = x+1; in the following code (5)
segment

for (i = 0; i< n; i++)

for ('1 = 0; j< n; j++)

x=x+1;.
12 a Explain System life cycle in detail (g)
b What do you mean by Time complexity of an algorithm? Derive the Big O (6)
notation for the function f(n) = n2+3n+2

Module 2
13 a Write the binary search algorithms and demonstrate it with an example. (S)
b Explain the data Structure Stack in detail. Display the status of a stack with (6)
maximum capacity 5.on the following operations (in order ) on it.
Pop( ), Push(5), push(4), Pop( ), Push(9)
14 a Write the algorithm to evaluate Postfix expression and show each steps in the (S)
evaluation ofthe expression: 2 3 + g - 5 r'

b What do you mean by circular queue? Write algorithms to insert and delete (6)
elements on circular queue.

Module 3
15 a What are the advantages of linked list over arrays? Write algorithms to (8)
: implemefrt Queue using linked list
b Given five memory partitions of 300Kb, 700Kb, 400Kb, 500Kb, g00Kb (in (6)
order), how would the first-fit,r$est-fit, and worst-fit algorithms place
processes of 4l2Kb,617 Kb, I 12 Kb, and 626Kb (in order)?
16 a Write polynomial addition algorithm using linked list and illustrate with an (10)
example
b Compare singly linked list and doubly linked list (4)
" Module 4
17 Write Breadth First Search algorithm and illustrate it on the below graph . (8)

Page 2of3

Downloaded from Ktunotes.in

 08fi)csT20rt22l0r

How to represent a binary tree using Arrays ? construct a binary tree from the
following elements arranged in an array A[l:15] as: (6)

I 2 3 4 5 6 7 8 9 l0 n t2 l3 t4 15

A B c D E F G H

18a what do you mean by a BST?. write an algorithm to remove an element from (10)
a Binary Search Tree. Demonstrate each case with an example
b Compare complete binary tree and full binary tree (4)
Module 5
19 a Write Merge Sort algorithm and demonstrate it to sort the list {12, 65,34, g, (10)
56, 43, I 0)-in ascending order.

b Explain MAX HEAP with an example (4)

20 a Explain various collision resolution techniques in Hashing (8)
b Hash tfie following keys using open chaining method and closed linear probing (6)
:
:

rnethod. Size of table is 7 and the Hash function H(K) K mod Z.

Ke.ys :{ 16, 21, 23, 50, lg, 26l
*****

Page 3of3

Downloaded from Ktunotes.in