Fall2014 ASSIGNMENT
PROGRAM - MCA (REVISED FALL 2012)
SEMESTER - II
SUBJECT CODE & NAME - MCA2020-
ADVANCED DATA STRUCTURE
CREDIT – 4, BK ID - B1476,
MAX. MARKS 60
Get
fully solved assignment, plz drop a mail with your sub code
computeroperator4@gmail.com
Charges
for mba rs 125/subject and
rs 700/semester only.
For
other rs 125/subject only
if
urgent then call us on 08791490301, 08273413412
Q1. No.1 Define data
structure? Explain different types of data structures. (2+8) 10 marks.
Answer:
Data structure
A data structure is a particular way of
storing and organizing data in a computer so that it can be used efficiently.
Different kinds of data structures are suited to
different kinds of applications, and some are highly specialized to specific
tasks. For example, B-trees are particularly well-suited
Q2 Explain the different types of binary
tree with suitable diagrams. 1+3*3
Answer.
Types of binary
tree
There are three types of binary tree:
1) Skewed binary tree
2) Full binary tree
3) Complete binary tree
Skewed binary tree
A binary tree which has only left subtree is called left
skewed tree and has only right subtree is called right skewed tree as shown in
the figure 2.a. Skewed trees are not
Q3 Explain in detail about Adjacency matrix
10
Answer.
Adjacency matrix
It is a two-dimensional Boolean matrix to store the
information about the graph nodes. Here the rows and columns represent source
and destination vertices and entries in the matrix indicate whether an edge
exists between the vertices associated with that row and column. The values of
matrix are either 0 or 1.
Q4 Explain in detail about topological
sorting 3+7
Answer.
Topological sorting
Topological sort is a process of assigning a linear
ordering to the vertices of a directed acyclic graph (DAG) so that if there is
an arc from vertex u to vertex v then u appears
before v in the linear ordering. Topological sorting cannot be applied
for linear ordering in the graph with cycles.
Let us look at an example of the results of a topological
sort given in figure 4.a and 4.b
Q5. Explain
1. Fixed block storage allocation.
2. Variable block storage allocation [5+5] = 10
Answer:
- Fixed block storage allocation
Fixed 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 a pointer called AVAIL. This pointer points to memory as
shown in figure.
Q6. What is the use of external Storage Devices? Explain any two external
storage devices [4+3+3]=10
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 fewer expenses to store
compared to main memory.
Primary uses of
Get
fully solved assignment, plz drop a mail with your sub code
computeroperator4@gmail.com
Charges
for mba rs 125/subject and
rs 700/semester only.
For
other rs 125/subject only
if
urgent then call us on 08791490301, 08273413412
No comments:
Post a Comment