Dear students get fully solved assignments Send your semester & Specialization name to our mail id : “ help.mbaassignments@gmail.com ” or Call us at : 08263069601

1. Dear students get fully solved assignments
Send your semester & Specialization name to our mail id :
“ help.mbaassignments@gmail.com ”
or
Call us at : 08263069601
ASSIGNMENT
PROGRAM BSc IT
SEMESTER FOURTH
SUBJECT CODE & NAME BT0080,Fundamental of Algorithms
CREDIT 4
BK ID B1092
MAX. MARKS 60
1. Describe insertionsort algorithm withthe helpof an example.
Answer: Itis a simple Sortingalgorithmwhichsortsthe array byshiftingelementsone byone.Following
are some of the important characteristicsof InsertionSort.
1. It has one of the simplestimplementation
2. It isefficientforsmallerdatasets,butveryinefficientforlargerlists.
3. InsertionSortisadaptive,thatmeansit
4.
5.
Q.2 State the concept of divide and conquer strategy withthe helpof an example.
Answer: - Divide and conquer (D&C) is an algorithm design paradigm based on multi-branched
recursion. A divide and conquer algorithm works by recursively breaking down a problem into two or
more sub-problems of the same (or related) type, until these become simple enough to be solved
directly.The solutionstothe sub-problemsare

2. Q.3 Explainknapsack problem.Write algorithmfor it.
Answer: - The knapsack problem or rucksack problem is a problem in combinatorial optimization: Given
a set of items, each with a mass and a value, determine the number of each item to include in a
collection so that the total weight is less than or equal to a given limit and the total value is as large as
possible. It derives its name from the problem faced by someone who is constrained by a fixed-size
knapsackand mustfill itwiththe mostvaluable items.
The problemoftenarisesinresource allocationwherethe
Q.4 Explaintreesand sub graphs with examples.
Answer:-Tree: - A tree is a connected graph without any cycles, or a tree is a connected acyclic graph.
The edges of a tree are called branches. It follows immediately from the definition that a tree has to be a
simple graph (because self-loops and parallel edges both form cycles). Figure 4.1(a) displays all treewith
fewerthansix vertices.
An AVLtree isanotherbalancedbinarysearchtree.
Q5. Define spanningtrees. Explain Kruskal’salgorithm to find out minimal cost spanning trees.
Answer: In the mathematical field of graph theory, a spanning tree T of an undirected graph G is a
subgraph that includes all of the vertices of G that is a tree. In general, a graph may have several
spanning trees, but a graph that is not connected will not contain a spanning tree (but see Spanning
forestsbelow).If all of the edgesof G are alsoedgesof a

3. Q.6 Define and explainHamiltoniancircuit and path.
Answer: - A graph that contains a Hamiltonian cycle is called a Hamiltonian graph. Similar notions may
be defined for directed graphs, where each edge (arc) of a path or cycle can only be traced in a single
direction(i.e.,the verticesare connectedwitharrowsandthe edgestraced"tail-to-head").
Hamiltonian path: - a Hamiltonianpath(or
Dear students get fully solved assignments
Send your semester & Specialization name to our mail id :
“ help.mbaassignments@gmail.com ”
or
Call us at : 08263069601