Scribd
Upload
4 views1 page

FRM Course Syllabus IPDownload

The document outlines the course CSE68D: Analysis and Design of Algorithms, detailing its outcomes and content structure. Students will learn to analyze algorithm performance, explore sorting techniques, and apply design principles for various algorithm types including divide and conquer, greedy, and dynamic programming. The course includes a focus on algorithm efficiency, asymptotic notations, and specific algorithms such as Kruskal’s and Prim’s for greedy methods.

Uploaded by

adityajai2104
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
4 views1 page

FRM Course Syllabus IPDownload

The document outlines the course CSE68D: Analysis and Design of Algorithms, detailing its outcomes and content structure. Students will learn to analyze algorithm performance, explore sorting techniques, and apply design principles for various algorithm types including divide and conquer, greedy, and dynamic programming. The course includes a focus on algorithm efficiency, asymptotic notations, and specific algorithms such as Kruskal’s and Prim’s for greedy methods.

Uploaded by

adityajai2104
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/ 1

CSE68D:ANALYSIS AND DESIGN OF ALGORITHM

L:4 T:0 P:0 Credits:4

Course Outcomes: Through this course students should be able to

CO1 :: Identify the basic concepts of algorithms and analyze the performance of algorithms.

CO2 :: Explore the efficiency and asymptotic notations in algorithms and analyze algorithm on
the basis of Best, average and worst case.

CO3 :: Explore various sorting techniques and analyze the time and space complexity of their
algorithms.
CO4 :: Analyze and design various divide and conquer algorithm design techniques for different
problem solution.

CO5 :: Analyze , design and general characterization of various Greedy algorithm design
techniques for different problem solution.
CO6 :: Analyze , design and apply the principle of Optimality in various Greedy algorithm design
techniques for different problem solution.

Unit I
Basics of Algorithms : Definition and characteristic of an algorithm, Rules to write an algorithm,
concepts and analysis of algorithm
Unit II
Analysis of Algorithm : The efficient algorithm, Average and worst case analysis, Asymptotic
Notations, Amortized Analysis
Unit III
Sorting Techniques : Selection Sort, Bubble Sort, Insertion Sort, Heap Sort and Complexity analysis
of each Sorting algorithm.
Unit IV
Divide and Conquer Algorithm : Introduction to Divide and Conquer, Problem Solving using divide
and conquer algorithm-Binary Search Tree, Sorting Techniques: Merge Sort, Quick Sort.
Unit V
Greedy Algorithm : General Characteristics of greedy algorithms, Minimum Spaning trees (Kruskal’s
algorithm, Prim’s algorithm, Single source/Shortest paths, The Knapsack Problem, Job Scheduling
Problem.
Unit VI
Dynamic Programming : Introduction. The Principle of Optimality, BFS(Breadth First Search) and
DFS(Depth First Search), Floyd Warshall Algorithm.

Text Books:
1. DATA STRUCTURES AND ALGORITHM USING C by R. SALARIA, KHANNA PUBLISHERS

References:
1. DESIGN AND ANALYSIS OF ALGORITHMS by DAVE AND DAVE, PEARSON

Session 2024-25 Page:1/1

You might also like