Dear students get fully solved assignments Send your semester & Specialization name to our mail id : “ help.mbaassignments@gmail.com ” or Call us at : 08263069601

1. Dear students get fully solved assignments
Send your semester & Specialization name to our mail id :
“ help.mbaassignments@gmail.com ”
or
Call us at : 08263069601
(SPRING 2015 ASSIGNMENT)
PROGRAM Master of Science in Information Technology(MSc
IT)Revised Fall 2011
SEMESTER 2
SUBJECT CODE & NAME MIT102- DATA & FILE STRUCTURES
CREDIT 2
BK ID B1476
MAX.MARKS 60
Note: Answer all questions. Kindly note that answers for 10 marks questions should be
approximately of 400 words. Each question is followed by evaluation scheme.
1. Define algorithm and write a note on Complexity and Time- Space Tradeoff with example
Answer : ALGORITHM
"An algorithm is a well defined list of steps to solve a particular problem". "It is an abstract form
of a program." A set of algorithms are always used to perform operations on data structure. Data
may be organizedin many ways and many levels so algorithm has to be designed in such a manner
so that it can perform the desired operation on the stored data.
An algorithmisawell definedlistor sequence of steps to solve a particular problem. There may be
more than one algorithmtosolve a particularproblem.The choice of aparticularalgorithmdepends
on the following considerations:
2. Define Queue and explain how we can implement the Queue.
Answer:In computerscience/datastructures,apriority queue is an abstract data type which is like
a regular queue or stack data structure, but where additionally each element has a "priority"
associatedwithit.Ina priorityqueue,anelementwithhighpriorityisservedbefore anelementwith
lowpriority.If twoelementshave the same priority, they are served according to their order in the
queue.
While priorityqueuesare oftenimplementedwithheaps,theyare conceptuallydistinct from heaps.
A priority queue is an abstract concept like "a list" or "
3. List the Advantages and Disadvantages of Linear and linked representation of tree.
Answer: Advantagesanddisadvantagesof linearrepresentation
Advantages and disadvantagesof linearrepresentation

2. Advantages:
I. Thisrepresentationisveryeasytounderstand.
II.This isthe bestrepresentationforcomplete andfull binarytree representation.
III.Programmingisveryeasy.
IV.It isveryeasyto move froma childtoits parentsandvice versa.
Disadvantages:
I. Lot of memoryarea wasted.
II.Insertionanddeletionof nodesneedslotof datamovement.
III.Executiontime high.
4. List and explain any Five types of graph.
Answer:Variousflavors of graphshave the followingspecializationsandparticulars about how they
are usually drawn.
 Undirected Graphs.
5 Explain
1. Fixed block storage allocation.
Answer:The simplestmemoryallocation is to have several fixed memory partitions and allocate a
processto eachone. Different sized partitions can be allocated to accomodate different processes
memory needs.
Unless the
2. Variable block storage allocation
Answer : A variable with Block type is declared using function pointer style notation
substituting ^ for *. The following are valid
6 What is the use of external Storage Devices? Explain any two external storage devices
Answer : In computing, external storage comprises devices that temporarily store information for
transportingfromcomputertocomputer.Suchdevicesare notpermanentlyfixedinsideacomputer.
Semiconductor memories are not sufficient to provide the whole storage capacity required in
computers. The major limitation in using

3. Dear students get fully solved assignments
Send your semester & Specialization name to our mail id :
“ help.mbaassignments@gmail.com ”
or
Call us at : 08263069601