Scribd
Upload
37 views

Cst201 Data Structures, December 2021

This document contains a summary of a course on data structures. It includes 20 multiple choice and short answer questions across 5 modules. The questions cover topics like algorithms, data structures, sorting, trees, graphs and hashing. Memory allocation strategies and time complexities of algorithms like binary search are also assessed. Students are required to answer 10 questions in Part A and choose one question from each module in Part B to answer in more depth.

Uploaded by

Arathy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
37 views

Cst201 Data Structures, December 2021

This document contains a summary of a course on data structures. It includes 20 multiple choice and short answer questions across 5 modules. The questions cover topics like algorithms, data structures, sorting, trees, graphs and hashing. Memory allocation strategies and time complexities of algorithms like binary search are also assessed. Students are required to answer 10 questions in Part A and choose one question from each module in Part B to answer in more depth.

Uploaded by

Arathy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

0800csT201122004 Pages: 2

Reg No.:

Course Code: CST201


Course Name: DATA STRUCTURES
Max. Marks: 100 Duration: 3 Hours
PART A
Answer all questions. Each question carries 3 marks Marks
(1 What are the different criterions that an algorithm should satisff ? (3)
2 The time complexity of binary search algorithm is O(log n) justify the statement. (3)

3 Find the postfix expressions of the following infix expression (3)

a) (A+B) *K+D/(E+F*G)+H

b) (A/D+B)*(K"Y)
Given a matrix having l0 rows and l0 columns and 12 nonzero elements. How (3)

much space can be saved by representing the matrix in sparse (tuple) form?
) Write procedures to push and pop elements from a Linked List Stack (3)

6 Memory blocks of size 202,302 and 101 are allocated for programs of size (3)

150,100, 125, 100 and 100. Which allocation method is better in this case and
why?
r7 Create a Binary Search Tree for the following values 62, 14,96, 12, 105,3,75, (3)
22,87 ,32,20, 13, 102, 69, r25
8 Explain an application of a graph with an example (3)

9 Write an algorithm to sort a set of numbers using insertion sort (3)


l0 Explain the following terms (3)

a) Overflow

b) Collision

PART B
Answer any onefall questionfrom each module. Each question cawies 74 marks
Module I
l1 a) Write an algorithm to find the number of occurrence of each element in an (l 0)
array and calculate the frequency count of the algorithm
b) Compare Top-Down approach with Bottom-Up approach (4) -

Page 1 of2
Downloaded from Ktunotes.in
0800csT20t122004

12 a) Write an algorithni ior Insertion Sort and calculate the frequency count. (10)
b) What is the significancq,of Verification in System Life Cycle (4)

Module 2 r

13 a) Discuss an algorithm to convert an infix expression to a postfixexpression (8)


b) Write an algorithm to find the transpose of a matrix represented in tuple form (6)
t4 a) Write algorithms to insert and delete elements from a circular Queue (6)
b) Write an algorithm to add two polynomials represented using arrays (S)

Module 3
15 a) Explain memory allocation for fixed sized blocks with the help of an (e)
algorithm (s)
b) Explain Worst-fit allocation with an example
I6 a) Write algorithms to multiply two polynomials represented using linked list (8)
b) Write algorithms to insert elements and delete elements from the beginning of (6)
a Circular Double Linked List

Module 4
l7 a) How can we find the depth of a tree. Write an algorithm to find depth of a tree
(6)
(8)
b) Write an algorithm to delete a node from a Binary Search Tree
18 a) Write algorithms for Depth First Search and Breadth First Search of a Graph (10)
b) Explain the term Complete Graph with an example (4)

Module 5
t9 a) Explain the algorithm for Merge Sort with an example (10)
b) Why is Merge Sort.preferred for Linked List (4)
20 (e)
a) Explain with examples the different techniques for open addressing
(s)
b) How Folding method can be used-for F{ashing
*****

Page2 of2
Downloaded from Ktunotes.in

You might also like