Gate 2017: Computer Science and IT - Algorithms

Material type: TextTextSeries: GATE Computer Science and IT Made Easy Postal Study CoursePublication details: New Delhi Made Easy Publications 2016Edition: 2nd edDescription: 112pSubject(s): DDC classification:
  • 004.076 GAT
List(s) this item appears in: Competitive Exam Corner - ITNU
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Item location Collection Call number Status Date due Barcode Item holds
Reference Book Reference Book NIMA Knowledge Centre Competitive Exam Corner 5th Floor Silence Zone Reference 004.076 GAT (Browse shelf(Opens below)) Not For Loan T0047364
Total holds: 0

Asymptotic Analysis of Algorithms
Recurrence Relations
Divide and Conquer
Greedy Techniques
Graph Based Algorithms
Dynamic Programming

There are no comments on this title.

to post a comment.
© 2025 by NIMA Knowledge Centre, Ahmedabad.
Koha version 24.05