IGNOU MCS-31 - Design and Analysis of Algorithms, Latest Help Book Edition
#1 Best Selling IGNOU Help Book in All Study Guides
Chapter-wise Reference Book with Previous Year Solved Question Papers of MCS-31 Design and Analysis of Algorithms for IGNOU MCA Computer Application.
- Helps save time and effort-really well
- Promises Good Marks in Lesser Time
- A fast-acting - result oriented book
- Free Famous Book "How to Pass IGNOU Exam" (SoftCopy) with Every Combo Order
BUY MCS-31 COMBO and Save upto 40%
Customize
Product Details
About MCS-31 Help Book Latest Edition
MCS-31 English Topics Covered
Block 1 - Introduction to Algorithmics
- Unit 1 - Elememtary Algorithmics
- Unit 2 - Some Pre-Requisites and Asymptotic Bounds
- Unit 3 - Basics of Analysis
Block 2 - Design Techniques-I
- Unit 1 - Divide-and-Conquer
- Unit 2 - Graph Algorithms
Block 3 - Design Techniques-II
- Unit 1 - Dynamic Programming
- Unit 2 - Greedy Techniques
- Unit 3 - Models for Executing Algorithms-I: FA
- Unit 4 - Models for Executing Algorithms-II: PDFA & CFG
Block 4 - Complexity & Completeness
- Unit 1 - Models for Executing Algorithms III: TM
- Unit 2 - Algorithmically Unsolvable Problems
- Unit 3 - Complexity of Algorithms
Previous Year Solved Question Papers Included
MCS-31 English (Total-33, Solved-21, Unsolved-12)
- June (2006-2022)
- December (2006-2021)
MCS-31 Help Book Details
- UniversityIGNOU (Indira Gandhi National Open University)
- TitleDesign and Analysis of Algorithms
- Language(s)English
- CodeMCS-31
- SubjectComputer Application
- Degree(s)MCA
- CourseCore Courses (CC)
- ISBN978-81-89086-72-5 (English)
- Pages376 (English)
- Weight301gms (English)
- Dimensions(L) 21cm, (W) 15cm, (H) 1cm
- AuthorGullybaba.com Panel
- PublisherGullybaba Publishing House Pvt. Ltd.
Items have been added to cart.
One or more items could not be added to cart due to certain restrictions.
- Can't add this product to the cart now. Please try again later.
- An error occurred. Please try again later.
- Can't delete this product from the cart at the moment. Please try again later.
