Manjunath C

Find  ADA UNIT-1 Notes in following link: https://drive.google.com/file/d/0Bxt9SSF8X6wuTE5ITVhaR2gxTXM/edit?usp=sharing

Find the ADA LAB MANUAL in following link: https://drive.google.com/file/d/0Bxt9SSF8X6wuZGVFNlBFcEd2eXM/edit?usp=sharing

http://www.microsoft.com/en-in/download/confirmation.aspx?id=23507

https://drive.google.com/file/d/0Bxt9SSF8X6wudDNpT0JVRDZVOTg/edit?usp=sharing

UNIT - 5 DECREASE-AND-CONQUER APPROACHES, SPACE-TIME TRADEOFFS: Decrease-and-Conquer Approaches: Introduction, Insertion Sort, Depth First Search and Breadth First Search, Topological Sorting Space-Time Tradeoffs:  Introduction Enhancement in String Matching(Horspools String matching). UNIT – 6 LIMITATIONS OF ALGORITHMIC POWER AND COPING WITH THEM: Decision Trees, P, NP, and NP-Complete Problems UNIT - 7 COPING WITH LIMITATIONS OF ALGORITHMIC POWER: Backtracking: n - Queens problem Subset –Sum Problem. Approximation algorithms for Traveling Salesman Problem(TSP): i.       Nearest-Neighbor algorithm ii.     Twice-around-the –tree algorithm

5th May  2014 (Monday) B1 Batch 9.30 AM to 12.30 PM B2 Batch 11.00 AM to 2.00 PM B3 Batch 2.00 PM to 5.00 PM

Find ADA LAB PRograms For 2nd test in following link: https://docs.google.com/file/d/0Bxt9SSF8X6wuUDV1c1g0Qm5RMEk/edit