Welcome to Scribd. Sign in or start your free trial to enjoy unlimited e-books, audiobooks & documents.Find out more
Download
Standard view
Full view
of .
Look up keyword
Like this
16Activity
0 of .
Results for:
No results containing your search query
P. 1
Daa

Daa

Ratings:

4.0

(1)
|Views: 1,726|Likes:
Published by Srinivasa Rao G

More info:

Published by: Srinivasa Rao G on Jan 18, 2008
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as DOC, PDF, TXT or read online from Scribd
See more
See less

11/10/2012

pdf

text

original

 
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY,HYDERABAD
I Year M.Tech (CSE) I Semester
DESIGN AND ANALYSIS OF ALGORITHMS
UNIT-IOverview of OOP Principles:
Encapsulation, Inheritance, and Polymorphism.
Reviewof C++
-Classes and Objects, Class members, Access control, class scope, constructorsand destructors, dynamic memory allocation and deallocation (new and delete),Polymorphism-Function overloading, operator overloading, generic programming-function and class templates, Inheritance, run time polymorphism using virtual functions,abstract classes, File I/O and Exception handling.
UNIT-IIAlgorithm Analysis and Review of Data Structures:
Algorithms
,
Psuedo code for expressing algorithms,
Performance Analysis
-time complexity and space complexity-notation, Omega notation and Theta notation, little o notation, Probabilistic analysis,Amortized analysis,
Review of Data Structures
- The List ADT, Stack ADT, QueueADT, Implementations using template class, Hash Functions, Collision Resolution inhashing,
Priority queues
-Definition, Priority queues-ADT,
Heaps
-Definition, Insertionand Deletion,
Applications
-Heap sort,
Disjoint sets
-Disjoint set ADT, Union and Findalgorithms.
UNIT-IIIDivide and conquer:
General method, applications-Binary search, Quick sort, Mergesort, Strassen’s Matrix Multiplication.
UNIT-IVGreedy method:
General method, applications-Job sequencing with dead lines, 0/1knapsack problem, Minimum cost spanning trees, Single source shortest path problem.
UNIT-VDynamic Programming:
General method, applications-Matrix chain multiplication,Optimal binary search trees, 0/1 knapsack problem, All pairs shortest path problem,Traveling sales person problem, Reliability design.
UNIT-VISearching and Traversal Techniques:
Efficient non-recursive Tree TraversalAlgorithms, DFS, BFS of Graphs, AND/OR graphs, game trees, Bi-Connectedcomponents,
Search Trees-
Balanced search trees-AVL trees, representation, Operations-insertion, deletion and searching, B-Trees-B-Tree of order m, Operations- insertion,deletion and searching.
UNIT-VII

Activity (16)

You've already reviewed this. Edit your review.
1 hundred reads
1 thousand reads
Naveen Shakya liked this
rajesh patel liked this
Shaik Arshiya liked this
meenubala liked this
Bawa Nancy liked this

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->