Scribd
Upload
40 views2 pages

Index S No Date Name of The Program # Mark S 1

The document provides a list of 12 programming assignments related to algorithms. The assignments involve implementing algorithms to solve problems such as sorting arrays, finding shortest paths in graphs, solving optimization problems like the knapsack and traveling salesperson problems, and more. Students are asked to analyze the runtime of the algorithms, parallelize some solutions, and compare serial and parallel performance.

Uploaded by

Warren Lee
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
40 views2 pages

Index S No Date Name of The Program # Mark S 1

The document provides a list of 12 programming assignments related to algorithms. The assignments involve implementing algorithms to solve problems such as sorting arrays, finding shortest paths in graphs, solving optimization problems like the knapsack and traveling salesperson problems, and more. Students are asked to analyze the runtime of the algorithms, parallelize some solutions, and compare serial and parallel performance.

Uploaded by

Warren Lee
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

INDEX

S
No
Date Name of the program Page
#
Mark
s
1.
Sort a given set of elements using the
Quicksort method and determine the time
required to sort the elements. Repeat the
experiment for different values of n, the
number of elements in the list to be sorted
and plot a graph of the time taken versus n.
The elements can be read from a file or can
be generated using the random number
generator.
2.
Using Open!, implement a paralleli"ed
erge Sort algorithm to sort a given set of
elements and determine the time required to
sort the elements. Repeat the experiment for
different values of n, the number of elements
in the list to be sorted and plot a graph of the
time taken versus n. The elements can be
read from a file or can be generated using
the random number generator.
3.
a. Obtain the Topological ordering of vertices
in a given digraph.
b. #ompute the transitive closure of a given
directed graph using $arshall%s algorithm.
4.
&mplement '() *napsack problem using
+,namic !rogramming.
5.
-rom a given vertex in a .eighted connected
graph, find shortest paths to other vertices
using +i/kstra%s algorithm.
6.
-ind inimum #ost Spanning Tree of a
given undirected graph using *ruskal%s
algorithm.
7.
a. !rint all the nodes reachable from a given
starting node in a digraph using 0-S
method.
b. #heck .hether a given graph is
connected or not using +-S method.
8.
-ind a subset of a given set S 1
2sl,s3,.....,sn4 of n positive integers .hose
sum is equal to a given positive integer d.
-or example, if S1 2), 3, 5, 6, 74 and d 1 8
there are t.o solutions 2),3,64 and 2),74. 9
suitable message is to be displa,ed if the
given problem instance doesn%t have a
solution.
.
&mplement an, scheme to find the optimal
solution for the Traveling Salesperson
problem and then solve the same problem
instance using an, approximation algorithm
and determine the error in the
approximation.
1!.
-ind inimum #ost Spanning Tree of a
given undirected graph using !rim:s
algorithm.
11.
&mplement 9ll;!airs Shortest !aths !roblem
using -lo,d%s algorithm. !aralleli"e this
algorithm, implement it using Open! and
determine the speed;up achieved.
12.
&mplement < Queen%s problem using 0ack
Tracking.

You might also like