Please enable JavaScript.
Coggle requires JavaScript to display documents.
DAA Syllabus JNTUK - R16 - CSE - 3-2, Prepared by: Srinivas Adapa,CSE Dept…
DAA Syllabus
JNTUK - R16 - CSE - 3-2
Unit-1
- Introduction
What is an Algorithm
Algorithm Specification
Pseudocode Conventions
Recursive Algorithm
Performance Analysis
Space Complexity
Time Complexity
Amortized Complexity
Asymptotic Notation
Practical Complexities
Performance
Measurement.
Unit-2
- Divide and Conquer
General Method
Defective Chessboard
Binary Search
Finding the
Maximum and Minimum
Merge Sort
Quick Sort
Performance Measurement
Randomized
Sorting Algorithms
Unit-3
The Greedy Method
The General Method
Knapsack Problem
Job Sequencing with Deadlines
Minimum-cost Spanning Trees
Prim’s Algorithm
Kruskal’s Algorithms
An Optimal
Randomized Algorithm
Optimal Merge Patterns
Single Source Shortest Paths
Unit-4
- Dynamic Programming
All - Pairs Shortest Paths
Single – Source Shortest paths General
Weights
String Edition
0/1 Knapsack
Reliability Design
Unit-5
- Backtracking
The General Method
The 8-Queens Problem
Sum of Subsets
Graph Coloring
Hamiltonian Cycles
Unit-6
- Branch and Bound
The Method
Least cost (LC) Search
The 15-Puzzle: an Example
Control Abstraction for LC-Search
Bounding
FIFO Branch-and-Bound
LC Branch and Bound
0/1 Knapsack Problem
LC Branch-and Bound Solution
FIFO Branch-and-Bound Solution
Traveling Salesperson
Prepared by: Srinivas Adapa,CSE Dept., VIEW