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, 08273413412
Summer 2017
ASSIGNMENT
PROGRAM - MCA (REVISED
FALL 2012)
SEMESTER - II
SUBJECT CODE
& NAME – Bit203- DATA File STRUCTURE
CREDIT – 4, BK ID - B1476, MAX. MARKS 60
Q1. What do you mean by complexity of
algorithm? Explain asymptotic notations.
Answer:
Complexity
of Algorithm
To
compare the efficiency of the algorithms we need some criteria to measure the
efficiency. Time and space are two main measures for the efficiency of an
algorithm.
Time
is the number of time the basic operation is executed. For example in sorting
and searching the basic operation is
Q2. What is Queue? Describe the two ways of
implementing the Queue.
Answer:
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
Q3. List the benefits and drawbacks of
Linear and linked representation of tree.
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 of execution time of an algorithm.
2)
Data are stored without
Set 2
Q1. Describe 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
Q2. Describe the following storage
allocation:
1. Fixed block
2. Variable block
Answer:
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
3. Define sorting. Explain merge sort with
suitable example.
Answer:
Sorting
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 records will be ordered
according to
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, 08273413412
No comments:
Post a Comment