|
HD17CSE:
DESIGN & ANALYSIS OF ALGORITHM
1.
INTRODUCTION
2.
THE BASIC STEPS IN THE DEVELOPMENT OF AN ALGORITHM
The Problem-Solving Aspect, Implementation Of
Algorithms, Program Verification, The Efficiency Of
Algorithms,
The Order Notation
3.
SOME DATA STRUCTURE
Stacks and
queues, trees, binary trees, heaps and heapsort, graphs,
hashing.
4.
ELEMENTARY NOTIONS FROM
PROBABILITY AND STATISTICS
Probability,
Axioms Of Probability, Discrete Probability Distributions,
Bayes's Theorem, District Random Variables,
Statistics,Linearity, Arithmetic Series
5.
HEURISTICS: TRAVELING SALESPERSON PROBLEM
Traveling Saleperson Problem,
Efficiency Considerations
6. BRANCH
AND BOUND PROBLEM
The Method, Lc-Search,
Control Abstractions For Lc-Search, Properties Of Lc-Search,
Bounding, Lc Branch-And-Bound
7.
RECURSION AND BACKTRACK PROGRAMMING
Introduction,
When Not To Use Recursion, Two Examples Of Recursive
Programs, Backtrack Programming, The Eight Queens
Problem, The Stable Marriage Problem, The Optimal
Selection Problem
8. SHORTEST
PATHS PROBLEM
Unweighted
Shortest Paths, Dijkstra’s Algorithm, Acyclic Graphs, Prim’s
Algorithm, Kruskal’s Algorithm
9. SORTING
General
Background, Efficiency Consideration, Efficiency Of Sorting,
Exchange Sorts, Quicksort, Efficiency Of Quick Sort, Binary
Tree Sorts, Heapsort, Insertion Sorts, Shell Sort
10.
SEARCHING
Basic Search
Techniques, Algorithmic Notation, Sequential Searching,
Efficiency Of Sequential Searching, Reordering A List For
Maximum Search Efficiency, Indexed Sequential Search, Binary
Search, Interpolation Search
11.
ARITHMETIC AND LOGICAL EXPRESSIONS
The
General Method, Evaluation And Interpolation, Interpolation
12. SETS
AND SOME BASIC SET ALGORITHMS
Sets,
Relations, Functions, Sets And Disjoint Set Union |
