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 and rs 625/semester only.
if urgent then call us on 08791490301, 08273413412
Spring
2015, 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
Qus:1
Briefly explain about memory allocation and garbage collection.
Answer:
Memory
Allocation:
The maintenance of
linked lists in memory assumes the possibility of inserting new nodes into the
lists and hence requires some mechanism which provides unused memory space for
the new nodes. Analogously, some mechanism is required whereby the memory space
of deleted nodes becomes available for
Qus:2
Briefly explain basic concepts of Graphs.
Answer:
Basic
concepts of Graphs:
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
Qus:3
What is queue? Briefly explain 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. The terms “front” and “
Qus:4
Write a short note on: NP-Completeness and Optimization versus decision
problems.
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
Qus:5 Briefly explain the Binary search Method.
Answer:
The Binary search Method:
Let ai, 1 < i < n be a list of
elements that are sorted in non-decreasing order. Consider the problem of
determining whether a given element x is
present in the list. If x is
present we are to determine a value j
Qus:6
Briefly explain Greedy Method Strategy.
Answer:
Greedy
Method Strategy:
The greedy
method suggests that one can device an algorithm that works in stages,
considering one input at a time
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 and rs 625/semester only.
if urgent then call us on 08791490301, 08273413412
No comments:
Post a Comment