Scribd
Upload
132 views1 page

Algorithms Programming Assignment

The document lists 12 algorithms and data structures problems to implement in C/C++ including: 1) sorting algorithms and runtime analysis, 2) search algorithms, 3) knapsack problem, 4) binary search trees, 5) matrix multiplication, 6) graph traversal algorithms, 7) traveling salesman problem, 8) all pairs shortest path, 9) minimum spanning trees, 10) Bellman-Ford algorithm, 11) Dijkstra's algorithm, and 12) Huffman coding. The student is asked to write code for each problem and include screenshots of outputs in a file.

Uploaded by

vatsal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
132 views1 page

Algorithms Programming Assignment

The document lists 12 algorithms and data structures problems to implement in C/C++ including: 1) sorting algorithms and runtime analysis, 2) search algorithms, 3) knapsack problem, 4) binary search trees, 5) matrix multiplication, 6) graph traversal algorithms, 7) traveling salesman problem, 8) all pairs shortest path, 9) minimum spanning trees, 10) Bellman-Ford algorithm, 11) Dijkstra's algorithm, and 12) Huffman coding. The student is asked to write code for each problem and include screenshots of outputs in a file.

Uploaded by

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

CEC 05 : DESIGN AND ANALYSIS OF ALGORITHMS

Write the following programs using C / C++. Prepare a file containing codes/ programs of
this list with proper outputs i.e screen shots.

1. Sort the set of elements using insertion, selection, merge, quick, heap, radix, shell sort
methods and determine the time required to sort these elements. Repeat the
experiment for different values of n, the number of elements in the list and plot a
graph of time taken versus n. The elements should be generated using the random
number generator.
2. Search any element in the list using linear, binary and interpolation search methods.
3. Implement 0/1 knapsack problem using greedy approach and dynamic programming.
4. Generate optimal binary search tree and perform all the operations on binary search
trees.
5. Perform matrix multiplication using strassen’s matrix multiplication method.
6. Print all the nodes reachable from a given starting node in a digraph using BFS
method. Also check whether the graph is connected or not using DFS method.
7. Implement any scheme to find the optimal solution for travelling salesman problem
and then solve the same problem using any approximation algorithm and determine
the error in the approximation.
8. Implement all pair shortest path problem using Floyd’s algorithm.
9. Find the minimum cost spanning tree of a given undirected graph using Prim’s and
Kruskal’s algorithm.
10. Implement Bellman ford algorithm.
11. Generate the shortest path using Dijktra’s algorithm.
12. Generate a program to generate Huffman code.

Mrs. Veenu
COE department

You might also like