You can pay in 6 instalment of
Rs 125-125 if u have any doubt.
computeroperator4@gmail.com
www.smuassignment.in
www.assignmenthelpforall.blogspot.in
SPRING
2014, ASSIGNMENT
PROGRAM
– BCA (REVISED FALL 2012)
SEMESTER
- II
SUBJECT
CODE & NAME - BCA2020/IMC2020-DATA STRUCTURE AND ALGORITHM
BK
ID - B1640, CREDIT – 4, MAXIMUM MARKS - 60
Q1. What do you mean by data structure operation?
Briefly explain some of the operations used frequently. 4+6=10
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.
Q2. Briefly explain Insertion Algorithms. 10
Answer: Insertion Algorithms
We
have algorithms for various situation of inserting an ITEM into linked list.
Q3. What is queue? Briefly explain array
implementation of queue. 5+5=10
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 3.7. The terms “front”
and “rear” are used in describing a linear list only when it is
Q4. Write a short note on: NP-Completeness and
Optimization versus decision problems. 5+5=10
Answer:
NP-Completeness
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 class of algorithms informally indicates that
there is a polynomial time for checking a solution for a problem whose solution
may be difficult to be found out. In studying the theory of NP-
Q5. Write the Algorithm to find the maximum and
minimum items in a set of ‘n’ element. 5+5=10
Answer: The problem is
to find the maximum and minimum items in a set of n elements.
Q6. Briefly explain Greedy Method Strategy. 10
Answer: The greedy
method suggests that one can device an algorithm that works in stages,
considering one input at a time. At each stage, a decision is made regarding
whether a particular input is in an optimal solution. This is done by
considering the inputs in an order determined by
No comments:
Post a Comment