Solutions for End Semester Questions

Total Marks

Reference Books

1. J. Kleinberg and E. Tardos, Algorithm Design, Pearson Education, 2006.
   
   
2. T. Cormen, C. Leiserson, R. Rivest, C. Stein, Introduction to Algorithms, Prentice-Hall India, 2002.
   

Evaluation

• 20-30%-Quizzes. (2 to 4 Quizzes will be conducted).
• 30-20%-Midsem.
• 50%-Endsem.

NO AUDITS WILL BE GIVEN

Tutorial problems.

• Network Flows
  
• Efficient Algorithms for Network Flows
  
• Applications of Network Flows
  
• Reductions to Satisfiability
  
• NP-Completeness
  

Solutions to some problems.

• Tutorials 1 and 2
  
• Class Problems