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
Spring
2016
Bca2020
1 How is stack
represented by an array? Also explain PUSH and POP operation in brief.
Answer: Array
implementation of stack
Implementation of stack can be done either using
array or one way list. The main disadvantage of array implementation of stack
is that the size of the array has to be declared a head. So, the stack size is
fixed and dynamically you cannot change the size of stack.
Each stack
2 Briefly
explain basic concepts of Graphs.
Answer: In a graph
data structure there are certain terms and terminologies that you should know
about. A graph data structure consists mainly of
a) A set of entities called nodes (or vertices or
points).
b) A set of edges (or arcs or links) connecting the
vertices.
A graph structure G is defined as G = (V, E) where
V is a set of vertices, E is a set of edges, and each edge is
3 What is queue?
Briefly explain an array implementation of 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 below. The terms “front” and “rear” are used in
describing a linear list only when it is implemented as a queue. Following are
the two methods offered by queue for adding and deleting
4 Write a short
note on: NP-Completeness and Optimization versus decision problems.
Answer: The ‘NP’ stands for
‘nondeterministic polynomial time’, which says about the fact that a solution
for certain type of a problem can be checked (but may not be found) in polynomial
time. This
5 Write an
Algorithm to find the maximum and minimum items in a set of ‘n’ element.
Answer: Algorithm
1. procedure SMAXMIN(max, min)
2. integer i, max, min;
3. max min A(1);
4. for I 2 to n do
5. if A
6 Write a short
note on:
·
Optimal Merge Pattern
·
Single Source Shortlist Paths
Answer: Optimal Merge
Pattern
When more than two sorted files are to be merged
together, the merge can be accomplished by repeatedly merging sorted files in
pairs. Thus, if files x1, x2, x3, and
x4 are to be merged, we could
first merge x1 and x2 to get a file yi. then we could merge yi and x3 to get y2.
Finally, we could merge y2 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
if urgent then call us on 08791490301, 08273413412
No comments:
Post a Comment