BCA2020 -DATA STRUCTURE AND ALGORITHM

Dear students get fully solved assignments

Send your semester & Specialization name to our mail id :

  “ help.mbaassignments@gmail.com ”

or

Call us at : 08263069601

(FALL 2014) ASSIGNMENT

PROGRAM	BCA (Revised Fall 2012)
SEMESTER	2
SUBJECT CODE & NAME	BCA2020 -DATA STRUCTURE AND ALGORITHM
CREDIT	2
BK ID	B1640
MAX.MARKS	60

Note: Answer all questions. Kindly note that answers for 10 marks questions should be approximately of 400 words. Each question is followed by evaluation scheme.

1. What do you mean by data structure operation? Briefly explain some of the operations used frequently.

Answer : Data Structure Operations

Data are processed by means of certain operations which appearing in the data structure. Data has situation on depends largely on the frequency with which specific operations are performed. This section introduces the reader to some of the most frequently used of these operations.

(1) Traversing: Accessing each records exactly once so that certain items in the record may be processed.

(2) Searching: Finding the location of a

2 .How do you implement a stack? Briefly explain.

Answer :

Following example shows how to implement stack by creating user defined push() method for entering elements and pop() method for retriving elements from the stack.

3 .Briefly explain tree and its Concepts.

Answer : The Concept of The Tree

It implies that we organize the data so that items of information are related by the branches.

Definition: A tree is a finite set of one or more nodes such that:

There is a specially designated node called the root.

The remaining nodes are partitioned into n ³ 0 disjoint sets T1,…, Tn, where each of these sets is a tree.  We call T1,…, Tn the subtrees of the root.

4 . What is Minimum Spanning Tree? Explain Prim's Minimum Spanning Tree Algorithm.

Answer : A spanning tree of a graph is just a subgraph that contains all the vertices and is a tree. A graph may have many spanning trees; for instance the complete graph on four vertices.

o---o

    |\ /|

    | X |

    |/ \|

    o---o

has sixteen spanning trees:

    o---o    o---o    o   o    o---o

    |   |    |        |   |        |

5. Write the difference between Classes P and NP.

Answer : 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 $ \in$ P can be solved in polynomial time on a deterministic computation model (such as a deterministic Turing machine).

NP represents the class of decision

6. Explain the Algorithm of Quick sort.

Answer : Quicksort is a very efficient sorting algorithm invented by C.A.R. Hoare. It has two phases:

·         the partition phase and

·         the sort phase.

As we will see, most of the work is done in the partition phase - it works out where to divide the work. The sort phase simply sorts the two smaller problems that are generated in the partition phase.

This makes Quicksort a good example of the

Dear students get fully solved assignments

Send your semester & Specialization name to our mail id :

  “ help.mbaassignments@gmail.com ”

or

Call us at : 08263069601