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
PROGRAM-
BCA (REVISED FALL 2012)
SEMESTER-
2
SUBJECT
CODE & NAME- BCA2020 -DATA STRUCTURE AND ALGORITHM
Qus:1
What do you mean by data structure operation? Briefly explain some of the
operations used frequently.
Answer:
Data
structure operation:
Operations are
used to process the data appearing in the data structure. In fact, the data structure
is chosen based on the frequency with which specific operations are performed.
Qus:2
How do you implement a stack? Briefly explain.
Answer:
Implement
a stack:
Implementation of stack
can be done either using array or one way list which are as follows:
Array implementation of
stack:
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 maintains a array STACK, a pointer variable TOP
which contains the location of top
Qus:3
Briefly explain tree and its Concepts.
Answer:
Explain
tree:
A tree is a
non-linear data structure that consists of a root node and potentially many
levels of additional nodes that form a hierarchy. A tree can be empty with no
nodes called the null or empty tree or a tree is a structure consisting of one
node called the root and one or more subtrees as referred in the figure below:
Qus:4
What is Minimum Spanning Tree? Explain Prim's Minimum Spanning Tree Algorithm.
Answer:
Minimum
Spanning Tree:
The spanning tree T is
defined as an undirected tree of a connected graph G which is composed of all
the vertices and the edges necessary to connect all the nodes of graph G.
Spanning tree has all the vertex that lies in the tree, but without any loop. Hence
only one path exits between two nodes. This redundancy may be desirable because
in some cases we may need to offer alternative routes to overcome breakdown or
overloading of an edge (e.g. road, connection, phone line) in a network. But
having redundancies, we always want the cheapest subnetwork that connects the
Qus:5
Write the difference between Classes P and NP.
Answer:
The
difference between Classes P and NP:
An algorithm is said to
be polynomially bounded if its worst-case complexity is bounded by a polynomial
function of the input size. A problem is said to be polynomially bounded if
there is a polynomially bounded algorithm for it. P is the class of all
decision problems that are polynomially bounded. The implication is that a
decision problem X Є P can be solved in
Qus:6
Explain the Algorithm of Quick sort.
Answer:
The
Algorithm of Quick sort:
In merge sort,
the file a[1:n] was divided at
its midpoint into subarrays which were independently sorted and later merged. In
quick sort, the division into two subarrays is made so that the sorted
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