2CE339 ANALYSIS AND DESIGN OF ALGORITHMS [ 3 0 2 4]

awfulcorrieΤεχνίτη Νοημοσύνη και Ρομποτική

29 Οκτ 2013 (πριν από 3 χρόνια και 11 μήνες)

82 εμφανίσεις

2CE339 ANALYSIS AND DESIGN OF ALGORITHMS



[ 3 0 2 4]


Introduction: Notations for programs

Elementary Algorithmics: Efficiency of Algorithms, Average & worst
-
case analysis, Elementary
operation.

Asymptotic Notation: A notation for “ the

order of”, Other asymptotic notation, Conditional asymptotic
notation.


Analysis of Algorithms: Analyzing control structures: sequencing, “For” loops, Recursive calls, “While”
and “repeat” loops, Using a barometer, Amortized analysis,


Solving Recurrence
s: Intelligent guesswork, Homogeneous recurrences, Inhomogeneous Recurrences,
Change of variable, Range transformations.


Some Data Structures: Arrays, stacks and queues, Records and pointers, lists, graphs,

trees, Associative tables, Heaps, Binomial hea
ps, Disjoint set structures.


Greedy Algorithms: Graphs: Minimum spanning trees
-
Kruskal’s algorithm, Prim’s algorithm, Graphs:
Shortest paths, The


Knapsack problem(1), Scheduling: Minimizing time in the system, Scheduling with deadlines.

Divide
-
and
-
Conqu
er: Multiplying large integers, Binary search, Sorting: sorting by merging, Quick sort,
Finding the median, Matrix multiplication, Exponentiation.


Dynamic Programming: Making Change(2), The principle of optimality, The Knapsack problem(2),
Shortest path,

Chained matrix multiplication, Approaches using recursion, Memory functions.


Backtracking Techniques.


Branch and Bound Techniques.


Laboratory Work:

The practical and term work will be based on the topics covered in the syllabus.

Minimum 12 experiments
should be carried out.


Texts/References:

1.

Fundamentals of Algorithmics By Gilles Brassard & Paul Bratley,PHI

2.

Fundamentals of Computer Algorithms, Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekharan,
Galgotia

____________________________________