Toggle navigation
BrainKart.com
HOME
Anna University
Anna University
EEE
ECE
Civil
MECH
CSE
IT
GATE Exam
TANCET Anna Univ
AnnaUniv
JEE IEEE
Medical
MBBS
Nursing
BPharm
Medical
MD
Medical
MGR University
NEET
AIIMS
Engineering
Engineering
Electrical
Electronics
Civil
Mechanical
Computer Science
Information Technology
GATE Exam
TANCET Anna Univ
Anna University
JEE IEEE
MBA
MBA
AnnaUniv MBA
CAT
TN School
TamilNadu School
TN 12th Std
TN 11th Std
TN 10th Std
TN 9th Std
TN 1 mark Test
JEE IEEE
NEET
AIIMS
Entrance Exam
All Exams
UPSC Civil services
GATE Exam
JEE IEEE
NEET
AIIMS
CAT
CLAT
Banking
UGC NET
TANCET Anna Univ
More
Basic Science
BioTech
Botany
Aqua
BDS
Install App
Contact
Policy
|
Anna University
| |
Anna University CSE
| |
Anna University IT
| |
Engineering
| |
Computer Science Engineering
|
Design and Analysis of Algorithms - CS8451, CS6402
Online Study Material, Lecturing Notes, Assignment, Reference, Wiki and important questions and answers
|
Anna University
| |
Anna University CSE
| |
Anna University IT
| |
Engineering
| |
Computer Science Engineering
|
INTRODUCTION
BRUTE FORCE AND DIVIDE
DYNAMIC PROGRAMMING AND GREEDY TECHNIQUE
ITERATIVE IMPROVEMENT
COPING WITH THE LIMITATIONS OF ALGORITHM POWER
Introduction to The Design and Analysis of Algorithms by Anany Levitin
Chapter 1 : Introduction
=>
Introduction to the Design and Analysis of Algorithms
=>
What Is an Algorithm?
=>
Fundamentals of Algorithmic Problem Solving
=>
Ascertaining the Capabilities of the Computational Device
=>
Algorithm Design Techniques
=>
Designing an Algorithm and Data Structures
=>
Methods of Specifying an Algorithm
=>
Proving an Algorithm’s Correctness
=>
Analyzing an Algorithm
=>
Coding an Algorithm
=>
Important Problem Types in Algorithms Analysis
=>
Fundamental Data Structures
Chapter 2 : Fundamentals of the Analysis of Algorithm Eficiency
=>
The Analysis Framework
=>
Asymptotic Notations and Basic Efficiency Classes
=>
Mathematical Analysis of Non recursive Algorithms
=>
Mathematical Analysis of Recursive Algorithms
=>
Example: Computing the nth Fibonacci Number
=>
Empirical Analysis of Algorithms
=>
Algorithm Visualization
Chapter 3 : Brute Force and Exhaustive Search
=>
Brute Force and Exhaustive Search
=>
Selection Sort and Bubble Sort
=>
Sequential Search and Brute-Force String Matching
=>
Closest-Pair and Convex-Hull Problems by Brute Force
=>
Exhaustive Search
=>
Depth-First Search and Breadth-First Search
Chapter 4 : Decrease and Conquer
=>
Decrease and Conquer
=>
Insertion Sort
=>
Topological Sorting
=>
Algorithms for Generating Combinatorial Objects
=>
Decrease by a Constant Factor Algorithms
=>
Variable Size Decrease Algorithms
Chapter 5 : Divide and Conquer
=>
Divide and Conquer
=>
Mergesort
=>
Quicksort
=>
Binary Tree Traversals and Related Properties
=>
Multiplication of Large Integers
=>
Strassen’s Matrix Multiplication
=>
The Closest Pair Problem by Divide and Conquer
=>
Convex Hull Problems by Divide and Conquer
Chapter 6 : Transform and Conquer
=>
Transform and Conquer
=>
Presorting
=>
Gaussian Elimination
=>
Balanced Search Trees: AVL Trees and 2-3 Trees
=>
Heaps and Heapsort
=>
Horner’s Rule and Binary Exponentiation
=>
Problem Reduction
Chapter 7 : Space and Time Trade Offs
=>
Space and Time Trade-Offs
=>
Sorting by Counting
=>
Input Enhancement in String Matching: Horspool’s and Boyer-Moore Algorithm
=>
Open and Closed Hashing
=>
B-Trees Algorithms
Chapter 8 : Dynamic Programming
=>
Dynamic Programming
=>
Dynamic Programming: Three Basic Examples
=>
The Knapsack Problem and Memory Functions
=>
Optimal Binary Search Trees
=>
Warshall’s and Floyd’s Algorithms
Chapter 9 : Greedy Technique
=>
Greedy Technique
=>
Prim’s Algorithm
=>
Kruskal’s Algorithm
=>
Dijkstra’s Algorithm
=>
Huffman Trees and Codes
Chapter 10 : Iterative Improvement
=>
Iterative Improvement
=>
The Simplex Method
=>
The Iterative Maximum-Flow Problem
=>
Maximum Matching in Bipartite Graphs
=>
The Stable Marriage Problem
Chapter 11 : Limitations of Algorithm Power
=>
Limitations of Algorithm Power
=>
Lower-Bound Arguments
=>
Decision Trees algorithms
=>
P , NP , and NP-Complete Problems
=>
Challenges of Numerical Algorithms
Chapter 12 : Coping with the Limitations of Algorithm Power
=>
Coping with the Limitations of Algorithm Power
=>
Backtracking
=>
Branch-and-Bound
=>
Approximation Algorithms for NP -Hard Problems
=>
Approximation Algorithms for the Traveling Salesman Problem
=>
Approximation Algorithms for the Knapsack Problem
=>
Algorithms for Solving Nonlinear Equations
CS6402 Design and Analysis of Algorithms - Anna University 2013 Regulation Syllabus - Download Pdf
CS8451 Design and Analysis of Algorithms - Anna University 2017 Regulation Syllabus - Download Pdf
Design and Analysis of Algorithms - Question Bank 1 - Download Pdf
Design and Analysis of Algorithms - Question Bank 2 - Download Pdf
Design and Analysis of Algorithms - Question Bank - Download Pdf
Design and Analysis of Algorithms - Important Questions - Download Pdf
Design and Analysis of Algorithms - Notes 1 - Download Pdf
Design and Analysis of Algorithms - Notes - Download Pdf
Design and Analysis of Algorithms - CS6402 May June 2015 Question Paper
Design and Analysis of Algorithms - CS6402 May June 2016 Question Paper
Design and Analysis of Algorithms - CS6402 May June 2017 Question Paper
Design and Analysis of Algorithms - CS6402 May June 2018 Question Paper
Design and Analysis of Algorithms - CS6402 Nov Dec 2015 Question Paper
Design and Analysis of Algorithms - CS6402 Nov Dec 2016 Question Paper
Design and Analysis of Algorithms - CS6402 Nov Dec 2017 Question Paper
Download Anna University Notes Android App
Design and Analysis of Algorithms - Start Reading Online
Engineering
Electrical Engineering
Electronics Engineering
Civil Engineering
Mechanical Engineering
Computer Science Engineering
Information Technology
Medical
MBBS
Nursing
BPharm
MD
MBA
AnnaUniv MBA
TN School 11th 12th
Anna University
EEE - Anna University
ECE - Anna University
Civil - Anna University
MECH - Anna University
CSE - Anna University
IT - Anna University
Online Student Guide
UPSC Civil services Entrance exams
GATE Exam
GATE Exam EE Electrical
GATE Exam EC Electronics
GATE Exam CS Computer Science
GATE Exam CE Civil
GATE Exam ME Mechanical
IIT JEE IEEE Entrance Exam
NEET Entrance Exam
AIIMS Entrance Exams
Problem Solving and Reasoning
Verbal, Reading Comprehension
Data Interpretation
Logical Reasoning
Mathematics or Quantitative
CAT Entrance Exams
CLAT LAW Entrance exams
Banking Entrance exams
TANCET Anna University
TN State Board one mark
TN 11th Standard one mark
Copyright © 2018-2021 BrainKart.com; All Rights Reserved. (BS) Developed by Therithal info, Chennai.