Analysis of Algorithms: Course Outline (MAT-631)

Polynomial time algorithms and intractable problems; relationship between the classes P, NP, and NP-complete; Cook's theorem and the basic NP-complete problems. Techniques for proving NP-completeness; NP-hardness. Hierarchy of complexity classes.  

Welcome to the Online Public Access Catalog (OPAC). This catalog provides you bibliographic information of print books available in all campus libraries of the University and provides you the facility of 2 types of searches; basic search and advance search to find the exact book or list of books you required.

Important Features for Patrons

1. Easy access to information due to effective searching.
2. Alert messages for patron i.e. overdue items or arrival of new items.
3. Patron can suggest books for purchase through this system.
4. Patrons can check his circulation history and hold on desired books.
5. OPAC brings together library users and staff, as both can see various aspects of the system.

Search Your Required Book