×
Stop thinking about WHAT WILL HAPPEN and start thinking about WHAT YOU CAN DO.
--Your friends at LectureNotes
Close

Note for Design And Analysis Of Algorithm - DAA by Shekharesh Barik

  • Design And Analysis Of Algorithm - DAA
  • Note
  • Biju Patnaik University of Technology Rourkela Odisha - BPUT
  • Computer Science Engineering
  • B.Tech
  • 40 Topics
  • 619431 Views
  • 5032 Offline Downloads
  • Uploaded 1 year ago
Touch here to read
Page-1

Note for Design And Analysis Of Algorithm - DAA by Shekharesh Barik

Topic:

/ 83

Shekharesh Barik
Shekharesh Barik
27 Uploads
0 User(s)
Download PDFOrder Printed Copy

Share it with your friends

Topics ( 40 )

Introduction , Definition,Growth of Functions 1 Asymptotic analysis, Amortized analysis, Standard notations and common function 2 Recurrences 4 Master methods 5 Solution of recurrences by substitution 7 Recursion tree 9 Design & Analysis of Divide and conquer algorithms 12 Binary search 13 Merge sort 17 Quick sort 20 Heaps 25 Building a heap 27 Heapsort mechanism 29 Heapsort algorithm 30 Lower bounds for sorting 31 Priority Queue 32 Dynamic programming methodology, Elements of Greedy strategyof dynamic programming Greedy Algorithms, 34 Matrix-chain multiplication 35 Longest common subsequence 40 Assembly-line scheduling 43 Activity selection Problem 45 Fractional knapsack problem 47 Huffman codes 50 Data structure for disjoint sets,Disjoint set operations ,Linked list representation 54 Disjoint set forests 55 Path compression 56 Breadth First Search,Depth First Search 58 Minimum Spanning Trees ,Kruskal algorithm , Prim's algorithms 62 Single-source shortest paths , Dijkstra's algorithms 65 Bellman-ford algorithm 68 All-pairs shortest paths (Floyd-Warshall Algorithm) 71 Back tracking,Traveling Salesman Problem 74 Eight Queen Problem 75 Branch and Bound 76 String matching algorithms,Naive string matching algorithm 77 Rabin-Karp algorithm 78 Knuth-Morris-Pratt algorithm 79 NP–Completeness,Polynomial time verification 81 Reducibility , NP-Complete problems (without Proofs) 82 Approximation algorithms characteristics 83
View All Topic

Leave your Comments

Text from page-1

Scanned by CamScanner

Text from page-2

Scanned by CamScanner

Text from page-3

Scanned by CamScanner

Text from page-4

Scanned by CamScanner

Next Page

Suggested Materials

Suggested Subjects

Database Management System Operating Systems Software Engineering Computer Architecture Organisation Probability And Queueing Theory

Lecture Notes