Home
HOD's Desk
Faculty
Syllabus
Academic Calendar
Learning Process
Time Table
Subject Information
Lab Manuals
Events & Seminars
Achievers
Results
Higher Studies
Placements
Glimpse of Department
Paper Presentation
Paper Publication
PEOs and POs
Photo Gallery
   
Search
www
college site
  Home   Subject Information

Subject Information
 

V Sem
 
Design and Analysis of Algorithm
 
 
UNIT 1
 
 
View the PDF file Introduction Proofs by Asymptotic Notation
PDF : 863 KB
 
View the PDF file Asymptotic Performance
PDF : 307 KB
 
 
View the PDF file Merge Sort Solving Recurrences The Master Theorem
PDF : 161 KB
 
View the PDF file Solving Recurrences Continued
PDF : 279 KB
 
 
View the PDF file Introduction to heapsort
PDF : 161 KB
 
View the PDF file Heapsort Priority Queues Quicksort
PDF : 279 KB
 
 
View the PDF file Quicksort
PDF : 161 KB
 
View the PDF file Review: Analyzing Quicksort
PDF : 279 KB
 
 
View the PDF file Linear-Time Sorting Algorithms
PDF : 161 KB
 
View the PDF file Linear-Time Sorting Continued
PDF : 279 KB
 
 
 
UNIT 2
 
 
View the PDF file Medians and Order Statistics Structures for Dynamic Sets
PDF : 863 KB
 
View the PDF file Administrative
PDF : 307 KB
 
 
View the PDF file Binary Search Trees
PDF : 863 KB
 
View the PDF file Red-Black Trees
PDF : 307 KB
 
 
View the PDF file Red-Black Trees (2)
PDF : 863 KB
 
View the PDF file Skip Lists
PDF : 307 KB
 
 
View the PDF file Introduction to Hashing
PDF : 863 KB
 
View the PDF file Hash Tables
PDF : 307 KB
 
 
View the PDF file Universal Hashing
PDF : 863 KB
 
View the PDF file Dynamic Order Statistics
PDF : 307 KB
 
 
 
UNIT 3
 
 
View the PDF file Augmenting Data Structures: Interval Trees
PDF : 863 KB
 
View the PDF file Graph Algorithms (1)
PDF : 307 KB
 
 
View the PDF file Graph Algorithms (2)
PDF : 279 KB
 
View the PDF file Graph Algorithms (3)
PDF : 279 KB
 
 
View the PDF file Topological Sort Minimum Spanning Trees
PDF : 279 KB
 
View the PDF file Single-Source Shortest Path
PDF : 279 KB
 
 
View the PDF file S-S Shortest Path: Dijkstra’s Algorithm
PDF : 279 KB
 
View the PDF file Dijkstra’s Algorithm, Disjoint-Set Union
PDF : 279 KB
 
 
View the PDF file Review of MST Algorithms Disjoint-Set Union Amortized Analysis
PDF : 279 KB
 
View the PDF file Amortized Analysis
PDF : 279 KB
 
 
 
UNIT 4
 
 
View the PDF file Dynamic Programming
PDF : 863 KB
 
View the PDF file Dynamic programming Longest Common Subsequence
PDF : 863 KB
 
 
View the PDF file Dynamic programming 0-1 Knapsack problem
PDF : 863 KB
 
View the PDF file Greedy Algorithms
PDF : 863 KB
 
 
 
UNIT 5
 
 
View the PDF file NP Completeness
PDF : 863 KB
 
View the PDF file NP Completeness Continued
PDF : 307 KB
 
 
View the PDF file NP Completeness Continued: Reductions
PDF : 279 KB
 
View the PDF file NP Completeness Continued: Reductions (2)
PDF : 279 KB
 
 
View the PDF file Review for Final
PDF : 279 KB
 
   
 
 
 
 
 
 
 
 
 
   
   
   
   
   
   
   
   
     
   
   
Click to view top of the page
 
XQT Logo site designed and developed by
Xentaqsys Technologies
Website optimised for Internet Explorer 5.0 above and 1024 *768 monitor resolution
© 2006-09 Dronacharya College of Engineering, All rights reserved