Scribd
Upload
85 views2 pages

Algorithms For Efficient Coding Lab

The document outlines the course objectives and outcomes for an Algorithms for Efficient Coding Lab at SRI Mittapalli College of Engineering. It emphasizes developing efficient coding skills, analyzing program execution time, and applying optimization techniques. The lab includes various experiments focused on measuring the running time of different algorithms using methods like Divide and Conquer, Greedy, Dynamic Programming, and Backtracking.

Uploaded by

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

Algorithms For Efficient Coding Lab

The document outlines the course objectives and outcomes for an Algorithms for Efficient Coding Lab at SRI Mittapalli College of Engineering. It emphasizes developing efficient coding skills, analyzing program execution time, and applying optimization techniques. The lab includes various experiments focused on measuring the running time of different algorithms using methods like Divide and Conquer, Greedy, Dynamic Programming, and Backtracking.

Uploaded by

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

SRI MITTAPALLI COLLEGE OF ENGINEERING::CC-U9

(AUTONOMOUS)
NH-16, Tummalapalem, Guntur-522233, AP.

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

Program Outcomes (POs):


PO1: Problem-solving:
Analyze complex computational problems, design algorithms and data structures to
efficiently solve them, and translate solutions into well-structured code.

PO2: Coding Skills:


Implement algorithms and data structures using appropriate programming languages
with attention to code readability, maintainability, and efficiency.

PO3: Optimization Techniques:


Identify performance bottlenecks in code and apply optimization strategies to
improve execution time and memory usage.

PO4: Testing and Debugging:


Thoroughly test code using various methods, identify and debug errors effectively,
and write unit tests to ensure code quality.

PO5: Software Engineering Practices:


Adhere to software development best practices like version control, code reviews,
and documentation to collaborate effectively on projects.
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 Programming8. Develop a program and measure the
running time for identifying solution for 8-Queensproblem 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