D

Reg No.:

Max. Marks: 100

10
11

a)
b)
a)
b)

a)

b)

08000CS205122003 Pages: 3

Name:

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

Third Semester B.Tech Degree (S,FE) Examination January 2022 (2015 Scheme)

Course Code: CS205
Course Name: DATA STUCTURES

PARTA
Answer all questions, each carries 3 marks.

What is a recursive function? Write a recursive function to find factorial of a
number.
What is frequency count? Compute the frequency count of the following code
fragment.
int a=0;
100150 : 1> N ; i++)

for(j=N ; | > 1; j--)

2= 9 +1+ |;

Write down the advantages and disadvantages of Singly Linked List.

Write an algorithm to delete last node from a circular singly linked list.
PART छ
Answer any two full questions, each carries 9 marks.

What is rate of growth of a function? Explain Big O notation with an example.

What is stepwise refinement technique?
What is abstract data structures?
Represent the following polynomial and its resultant polynomial using linked
list.

‎எட்ட‏ 4571 + تياو

‎6 4 3 2

‎8X +4X 32% + 26 +
Write an algorithm to add two polynomials.
What is time complexity and space complexity? Derive the Big O notation for
त) = 31 + 2n +7.
Write an algorithm for insertion of a node in the middle of doubly linked list.

‎PART C
Answer all questions, each carries 3 marks.

‎Convert the given infix expression to prefix expression
(A + 8) * C-(D-E) * (+ ©)
What are the differences between queue and circular queue?

‎Write an algorithm to concatenate two strings without using string functions.

‎What is binary tree? How a binary tree is represented using an array?

‎Page 1 of 3

‎Duration: 3 Hours

‎Marks
‎(3)
‎(3)

‎(3)
‎(3)

‎(5)
‎(4)
‎(2)
‎(7)

‎(4.5)

‎(4.5)

‎(3)

‎(3)
‎(3)
‎(3)