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 and rs 500/semester only.
if urgent
then call us on 08791490301, 08273413412
PROGRAM-Master
of Science in Information Technology (MSc IT) SEMESTER-1
SUBJECT
CODE & NAME-MIT102- DATA & FILE STRUCTURES
CREDIT-4
BK
ID-B1476
MAX.
MARKS-60
Q1.
Define Modularity and explain its need in computer programs. 10
Answer:
Modularity is dividing the larger problems to sub problems.
To
simplify the task of writing the large programs, the concept of modularity was
introduced.
So, a
complex program is divided into number of sub modules and the solution obtained
by solving the sub modules are combined to get the actual solution of that
problem. The modularity of most systems can be represented by hierarchical
structure as shown in
Q2.
Define Queue and explain how we can implementation the Queue. [2+4+4]
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 as
referred in the figure. The terms “front” and “rear” are used in describing a linear
list only when it is implemented as a queue.
Following
Q3. List
the Advantages and Disadvantages of Linear and linked representation of tree.
[5+5] = 10
Answer:
Advantages of linear representation of binary tree
1)
Node can be accessed directly with the help of the index through
which we can improve the efficiency o
2)
Q4. List and explain
any Five types of graph. [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.
Edges in the Undirected graph only connect to each other. In an undirected
graph, edge (v1,v2) is equivalent to edge (v2,v1) since they are unassigned.
2)
Q5.
Explain
1. Fixed
block storage allocation.
2.
Variable block storage allocation [5+5]
Answer:
1.
Fixed block storage allocation:
First block storage allocation is
the simplest case of dynamic storage allocation. This is the straight forward
method in which, all the blocks are of identical in size. The user can decide
the size of the block. The operating system keeps
Q6. What
is the use of external Storage Devices? Explain any two external storage
devices [4+3+3]
Answer:
Use
of external Storage Devices:
An external storage device may be
defined as device other than the main memory on which information or data can
be stored and from which the information retrieved for processing. External
storage devices are having larger capacities and
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 and rs 500/semester only.
if urgent
then call us on 08791490301, 08273413412
No comments:
Post a Comment