Skip to main content
It looks like you're using Internet Explorer 11 or older. This website works best with modern browsers such as the latest versions of Chrome, Firefox, Safari, and Edge. If you continue with this browser, you may see unexpected results.

Analysis of Algorithms: Course Outline (MAT-631)

Analysis of Algorithms (AofA) is a field at the boundary of computer science and mathematics. The goal is to obtain a precise understanding of the asymptotic, average-case characteristics of algorithms and data structures

Recommended Book

E-Books

Course Outline

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.  

Search the Library Catalog

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

 

Share

E-Books