Get fully solved assignment. Buy
online from website
online store
or
plz drop a mail with your sub
code
we will revert you within 2-3
hour or immediate
Charges rs
125/subject
If urgent
then call us on 08791490301
STUDENT
NAME:-
ROLL
NO:-
ASSIGNMENT
DRIVE - SPRING 2017
PROGRAM
Master of Science in Information Technology (MSc IT)
SEMESTER
-1
SUBJECT
CODE & NAME - MIT107- DATA & FILE STRUCTURES
BK ID B1476 NUMBER OF
ASSIGNMENTS, CREDITS & MARKS 2, 4 Credits, 30 marks each
Assignment
Set- 1 Questions
Q1 What do you mean by
complexity of algorithm? Explain asymptotic notations. 2+8 10
Answer:-
Complexity of algorithm:-
The
complexity of the algorithm is given by a function C(n) which gives the running
time and space requirement of the algorithm in terms of the size n of the input
data. Frequently, the storage space requirement is the
Q2 What is Queue? Describe
the two ways of implementing the Queue. 2+4+4 10
Answer:-
Queue:-
A
queue is a linear list of elements in which deletions can take place only at
one end, called the front and insertions can take place only at the other end,
called the rear. The terms “front” and “rear” are used in describing a linear
list only
Q3 List the benefits and
drawbacks of Linear and linked representation of tree. 5+5 10
Answer:-
Benefits of linear
representation of binary tree
1)
Node can be accessed
of binary tree
1) Memory is wasted here
Assignment
Set- 2 Questions
Q1 Describe any five types
of graphs. 5*2 10
Answer:-
Types of Graphs:
Depending
upon the vertices and edges and the weight associated to it, graphs can be
classified as:
1) Undirected graph:
In
Undirected Graph, the directions of edges are not assigned. In an undirected
graph, edge (v1,v2) is equivalent to edge (v2
Q2 Describe the following
storage allocation:
(a) Fixed block
(b) Variable block 5+5 10
Answer:-
(a) Fixed block
First
block storage allocation is the simplest case of dynamic storage allocation.
This is the straight forward method in which, all the
Q3 Define sorting. Explain
merge sort with suitable example. 2+4+4 10
Answer:-
Sorting is the process of arranging a collection
of items in some specified order. The
items/records in a file or data structures in memory, consist of one or more
fields or members. One of these fields is designated as the "sort
key" which means the
Get fully solved assignment. Buy
online from website
online store
or
plz drop a mail with your sub
code
we will revert you within 2-3
hour or immediate
Charges rs
125/subject
If urgent
then call us on 08791490301
No comments:
Post a Comment