Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
50 views

Algorithms for Efficient Coding Lab Objective

AEC

Uploaded by

smce.ramu
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
50 views

Algorithms for Efficient Coding Lab Objective

AEC

Uploaded by

smce.ramu
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

ALGORITHMS FOR EFFICIENT CODING LAB

Course Objective: To develop efficient coding for the algorithms with various inputs and
algorithms

Course Outcomes: By completing the course the students will be able to: x Analyze the
program execution time

List of Experiments:
1. Develop a program and measure the running time for Binary Search with Divide and Conquer

2. Develop a program and measure the running time for Merge Sort with Divide and Conquer

3. Develop a program and measure the running time for Quick Sort with Divide and Conquer

4. Develop a program and measure the running time for estimating minimum-cost spanning
Trees with Greedy Method

5. Develop a program and measure the running time for estimating Single Source Shortest Paths
with Greedy Method

6. Develop a program and measure the running time for optimal Binary search trees with
Dynamic Programming

7. Develop a program and measure the running time for identifying solution for traveling
salesperson problem with Dynamic Programming

8. Develop a program and measure the running time for identifying solution for 8-Queens
problem with Backtracking

9. Develop a program and measure the running time for Graph Coloring with Backtracking

10. Develop a program and measure the running time to generate solution of Hamiltonian Cycle
problem with Backtracking

11. Develop a program and measure the running time running time to generate solution of
Knapsack problem with Backtracking

You might also like