Semester : SEMESTER 3
Subject : Data Structures
Year : 2017
Term : JULY
Branch : COMPUTER SCIENCE AND ENGINEERING
Scheme : 2015 Full Time
Course Code : CS 205
Page:2
14.
15.
16.
17.
18.
19.
20.
B3D042 Pages: 2
b. How are strings represented in a C program?
(4.5)
a. Explain the array implementation of a binary tree? Why it is not a good
representation for Binary Trees in general?
b. Write a function(C / pseudocode) to delete a node from a Binary Search Tree.
PARTE
Answer any four questions.
a. Write 8 program to perform Quick Sort on a set of ൩ values given as input.
b. Explain Best Fit strategy with an example.
a. Write a function(C / pseudocode) to insert an element into a Heap.
b. Derive the worst case and average case complexity of Quick Sort.
a. Explain mid-square method in hashing with an example.
b. Derive the complexity of Heap sort.
a. What is hashing and what is its importance.
b. Write a program to perform insertion sort on a set of 'n' values given as input.
a. Write a function(C / pseudocode) to perform merge sort.
b. Compare selection sort and bubble sort.
a. Write a function(C / pseudocode) to perform binary search.
b. What is garbage collection?
aK
Page 2 of 2
(4.5)
(4.5)
(5)
(5)
(5)
(5)
(5)
(5)
(5)
(5)
(5)
(5)
(5)
(5)