Buy Books Online > Examinations & assessment > MCS031 Design And Analysis Of Algorithm (IGNOU Help book for MCS-031 in English Medium)

MCS031 Design And Analysis Of Algorithm (IGNOU Help book for MCS-031 in English Medium)
Product Details: Share this by email:
ISBN: 9788189086725 Publisher: Gullybaba
Year of publishing: 2015 Format: Paperback
No of Pages: 320
MCS-31 Design and Analysis of Algorithm
CONTENTS COVERED
Chapter-1 Elementary knowledge of Algorithm
Chapter-2 Preliminary and Asymptotic Bounds
Chapter-3 Fundamentals of Analysis
Chapter-4 Methods...Read more
CONTENTS COVERED
Chapter-1 Elementary knowledge of Algorithm
Chapter-2 Preliminary and Asymptotic Bounds
Chapter-3 Fundamentals of Analysis
Chapter-4 Methods...Read more
MCS-31 Design and Analysis of Algorithm
CONTENTS COVERED
Chapter-1 Elementary knowledge of Algorithm
Chapter-2 Preliminary and Asymptotic Bounds
Chapter-3 Fundamentals of Analysis
Chapter-4 Methods for Solution: Divide and Conquer Technique, Sorting-etc.
Chapter-5 Graphical Algorithm, Searching like B.F.S. and D.F.S.
Chapter-6 Dynamic Programming and Greedy Technique
Chapter-7 Models for executing Algorithm - 1 Finite Automata
(F.A.) and Algorithm Push Down Finite Automata
(P.D.F.A.) and Context Free Grammar (C.F.G.)
Chapter-8 The Models for Executing Algorithm - III, Turing Machine (T.M.)
Chapter-9 Algorithmically Unsolvable Problem
Chapter-10 Complexity of Algorithms.
QUESTION PAPERS
1. Solution Paper - June 2006
2. Solution Paper - Dec 2006
3. Solution Paper - June 2007
4. Solution Paper - Dec 2007
5. Solution Paper - June 2008
6. Solution Paper - Dec 2008
7. Solution Paper - June 2009
8. Solution Paper - Dec 2009
9. Solution Paper - June 2010
10. Solution Paper - Dec 2010
11. Solution Paper - June 2011
12. Solution Paper - Dec 2011
13. Solution Paper - June 2012
14. Solution Paper - Dec 2012
15. Question Paper - June 2013
16. Question Paper - Dec 2013
"
17. Question Paper - June 2014"
Read less
CONTENTS COVERED
Chapter-1 Elementary knowledge of Algorithm
Chapter-2 Preliminary and Asymptotic Bounds
Chapter-3 Fundamentals of Analysis
Chapter-4 Methods for Solution: Divide and Conquer Technique, Sorting-etc.
Chapter-5 Graphical Algorithm, Searching like B.F.S. and D.F.S.
Chapter-6 Dynamic Programming and Greedy Technique
Chapter-7 Models for executing Algorithm - 1 Finite Automata
(F.A.) and Algorithm Push Down Finite Automata
(P.D.F.A.) and Context Free Grammar (C.F.G.)
Chapter-8 The Models for Executing Algorithm - III, Turing Machine (T.M.)
Chapter-9 Algorithmically Unsolvable Problem
Chapter-10 Complexity of Algorithms.
QUESTION PAPERS
1. Solution Paper - June 2006
2. Solution Paper - Dec 2006
3. Solution Paper - June 2007
4. Solution Paper - Dec 2007
5. Solution Paper - June 2008
6. Solution Paper - Dec 2008
7. Solution Paper - June 2009
8. Solution Paper - Dec 2009
9. Solution Paper - June 2010
10. Solution Paper - Dec 2010
11. Solution Paper - June 2011
12. Solution Paper - Dec 2011
13. Solution Paper - June 2012
14. Solution Paper - Dec 2012
15. Question Paper - June 2013
16. Question Paper - Dec 2013
"
17. Question Paper - June 2014"
Read less
Other books by Vimal Kumar Sharma
Recommended Books for you - See all
Price: Rs. 160 Rs.125
You save: Rs.35
Vendor : GullyBaba Publishing House (P) Ltd., Delhi
Free Shipping on all orders of Rs.500 and above. Add Rs.30 otherwise. | Delivered in 5 working days
(Cash on delivery available)
Be assured. 7 days Return & Refund Policy.
Click here