be

ضا

D B3D041 Total Pages:3

Reg. No. Name:
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
THIRD SEMESTER B.TECH DEGREE EXAMINATION, JANUARY 2017
Course Code: CS 205
Course Name: DATA STRUCTURES (CS, IT)

Max, Marks: |) Duration: 3 Hours
PART A
(411110೮1 ALL Questions)
~ Compare and contrast singly linked list and doubly linked list. (3)

What do you understand by complexity of an algorithm? Write worst casc and best case
complexity of linear search. (3)
Let LIST be a singly linked list in memory. Write an algorithm to find number of times a
given data item called 171711 occurs in LIST. (3)
Define the terms

a) Frequency count.

b) Stepwise refinement technique. (3)

PART-B

(Answer Any Two Questions)

Describe the dillerent notations used to describe the asymptotic running time of an
algorithm, (9)
How a linked list can be used to represent a polynomial உட்‌ ഹോം Give an al பரிமா
to perform addition of ‏ممما‎ polynomials using linked list, (9)

Give an algorithm to perlorm following operations in a singly linked list.

(३) Insert a new node after a given node, (3)
(bh) Delete last node. (3)
{८} Count the number of elements in the list. (3)

Page 13