Scribd
Upload
24 views3 pages

Title: Sub. Name Sub. Code: Dept

The document outlines a course on Design & Analysis of Algorithms, detailing various programming assignments categorized by algorithmic concepts such as recursion, divide and conquer, greedy methods, dynamic programming, graph traversal, and backtracking. Each assignment requires a clear problem statement, algorithm introduction, pseudocode, C code with comments, sample input/output, and complexity analysis. The assignments include tasks like implementing sorting algorithms, searching algorithms, and solving problems like the knapsack problem and the Traveling Salesman Problem.

Uploaded by

it10800223115
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
24 views3 pages

Title: Sub. Name Sub. Code: Dept

The document outlines a course on Design & Analysis of Algorithms, detailing various programming assignments categorized by algorithmic concepts such as recursion, divide and conquer, greedy methods, dynamic programming, graph traversal, and backtracking. Each assignment requires a clear problem statement, algorithm introduction, pseudocode, C code with comments, sample input/output, and complexity analysis. The assignments include tasks like implementing sorting algorithms, searching algorithms, and solving problems like the knapsack problem and the Traveling Salesman Problem.

Uploaded by

it10800223115
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
You are on page 1/ 3

Sub. Name Design & Analysis of Algorithms Sub.

Code: PCC-CS494 Dept- IT

General Instructions:
1. Include the problem statement for each experiment clearly.
2. Provide a brief introduction to the algorithm being implemented (e.g., its purpose, time
complexity, and approach).
3. Include the pseudocode or algorithm steps before the actual C code.
4. Add comments in your C code for better understanding.
5. Show sample input and output for each program.
6. Include the time and space complexity analysis for each algorithm.
CHAP TITLE
TER
Programs Concept:
A: Basic Recursion

1. Write a program to add three numbers using recursion.

2. Write a program to find the sum of natural numbers up to a given number


using recursion.

3. Write a program to get the largest element of an array using recursion.

4. Write a program to find GCD of two numbers using recursion.

1. Write a program to implement Linear Search.


B: Concept of Divide and
Conquer Approach:

2. Write a program to implement Binary Search using Divide and Conquer


approach.

3. Write a program to implement Merge Sort using Divide and Conquer approach.
:

4. Write a program to implement Quick Sort using Divide and Conquer approach.

5. Write a program to perform Insertion sort for any given list of numbers.

6. Write a program to find the MAX and MIN element from a array of integer.

1/3 Design & Analysis of Algorithms. @ SM Dept of Information Technology, AEC


1. Write a program to find solution/implement for knapsack problem using greedy
method.

C: Concept of Greedy Method approach:


2. Write a program to find minimum cost spanning tree using Kruskal’s Algorithm.

3. Write a program to find minimum cost spanning tree using Prim’s Algorithm.

4. Write a program to find solution for job sequencing with deadlines problem.

5. Write a program to find the Single source shortest path using Dijkstra’s
Algorithm.

6. Write a program to find the Single Source Shortest Path BELLMAN-FORD


Algorithm.

1. Write a program to implement 0/1 Knapsack problem using Dynamic


Programming Approach:

Programming.
D: Concept of Dynamic

2. Write a program to implement Matrix Chain Multiplication using Dynamic


Programming.

3. Write a program to implement Traveling Salesman Problem.

4. Write a program to implement all pair of Shortest path problem for a graph using
Floyed- Warshall Algorithm.

2/3 Design & Analysis of Algorithms. @ SM Dept of Information Technology, AEC


Traversal Algorithm:
E: Concept of Graph
1. Write a program to implement Breadth First Search
(BFS).

2. Write a program to implement Depth First Search (DFS).


F: Concept of Backtracking &

1. Write a program to implement 8 Queen Problem using Backtracking.


Brunch and Bound:

2. Write a program to implement N Queen Problem using Backtracking.

3. Write a program to implement Graph Coloring Problem using Backtracking


:

4. Write a program to implement 15 Puzzle Problem

3/3 Design & Analysis of Algorithms. @ SM Dept of Information Technology, AEC

You might also like