ASSIGNMENT

DRIVE SPRING 2018

PROGRAM Bachelor of Science in Information Technology
SEMESTER II
SUBJECT CODE & NAME BIT203 – Data and File Structure
BK ID B1476
NUMBER OF ASSIGNMENTS, CREDITS & 2, 4 Credits, 30 marks each
MARKS

Note –The Assignment is divided into 2 sets. You have to answer all questions in both sets and submit as
one document. Average of both assignments marks scored by you will be considered as your IA marks.
Kindly note that answers for 10 marks questions should be approximately of 400 words. Each question is
followed by evaluation scheme.

Assignment Set -1 Total

Q.No
Questions Marks
1 Describe any five types of graphs. 5*2
2 Describe the following storage allocation: 5+5
 Fixed block
 Variable block

3 Define sorting. Explain merge sort with suitable example. 2+4+4

Assignment Set -2 Total

Q.No
Questions Marks
1 What do you mean by complexity of algorithm? Explain asymptotic notations. 2+8

2 What is Queue? Describe the two ways of implementing the Queue. 2+4+4
3 List the benefits and drawbacks of Linear and linked representation of tree. 10