4.10.3 B-Trees and B+ Trees

DAA Important questions for Final Examination

DAA Solved Question paper (Long Questions) - Unit 5

DAA Solved Question paper (Long Questions) - Unit 4

DAA Solved Question paper (Long Questions) - Unit 1

DAA Solved Question paper (Long Questions) - Unit 3

DAA Solved Question paper (Long Questions) - Unit 2

DAA Solved Question Paper (Short Questions)

4.13.1 0/1 Knapsack Problem - Branch and Bound

4.13 Travelling Salesman Problem - Branch and Bound

4.13.2 0/1 Knapsack Problem - Branch and Bound

4.12 Branch and Bound

4.9.1 Disk Structure

4.10.3 B-Trees and B+ Trees

4.10.1 Search Engines

4.10.2 (a,b) Trees

4.9.3 B-Trees-External Searching - Part03

4.9.2 B-Trees - m-way search tree - Part02

4.8.1 Network Flow Algorithm - Part01

4.8.2 Maxflow Network Problem - Part02

4.8.3 Maxflow Network using Ford Fulkerson Algorithm - Part03

5.5 NP - Hard Graph Problems

5.5.2 Proving Graph Problems

5.4 Cook's Theorem

5.8 Example: Parallel Computation