0 0200008205092002 ணை
Reg No.: Name:
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
Third semester B.Tech examinations (S) September 2020
Course Code: CS205
Course Name: DATA STRUCTURES (CS,IT)
Max. Marks: 100 Duration: 3 Hours
PARTA
Answer all questions, each carries 3 marks. Marks
1 Differentiate between top down and bottom up approach of problem solving? (3)
2 What is frequency count? With the help of an example, explain how frequency (3)
count is used to calculate the running time of an algorithm?
Compare a Singly linked list and Doubly Linked List. (3)
4 Write an algorithm/pseudocode to delete a given element k from an array A of (3)
n elements? Assume that the element k is always present in A.
PART ‏تا‎
‎Answer any two full questions, each carries 9 marks.
5 ഒ) What do you mean by space complexity and time complexity of an algorithm? (6)
Write an algorithm/pseudo code for linear search and mention the best case and
worst case time complexity of Linear Search algorithm?
b) Explain modular programming with suitable example. (3)
6 9) Write an algorithm/pseudocode to delete a node at the end of a doubly linked (4.5)
list.
b) Define Big-O notation. Derive the Big — O notation for 58 2172-31. (4.5)
7 a) Write an algorithm/pseudocode to count the number of nodes in a Singly Linked (6)
List?
b) How will you represent header node in a Linked List? (3)
PART C
Answer all questions, each carries 3 marks.
8 What is Polish and Reverse polish notation? Give examples for each? (3)
9 How can you represent a Binary Tree in memory using array? (3)
10 Write down the inorder, preorder and postorder traversal of the following (3)

binary tree

Page 1 of 3