Choosing Best Algorithm Design Strategies For a Particular Problem
| dc.contributor.author | Nigam, Shailendra Kumar | |
| dc.contributor.supervisor | Garg, Deepak | |
| dc.contributor.supervisor | Kumar, Ravinder | |
| dc.date.accessioned | 2009-07-24T11:03:42Z | |
| dc.date.available | 2009-07-24T11:03:42Z | |
| dc.date.issued | 2009-07-24T11:03:42Z | |
| dc.description | M.E.(Software Engineering) | en |
| dc.description.abstract | Algorithms have come to be recognized as the cornerstone of computing. Algorithm design strategies are typically organized either by application area or by design technique. This report describes different designing algorithms such as Brute force, Greedy, Divide and Conquer, Dynamic programming, Backtracking, Branch and Bound and many more. It describes how a particular algorithm is used for a specific problem. This report also proposes how to choose the best algorithm design strategy for a particular problem to facilitate the development of best algorithms based upon algorithm design strategy techniques. It also describes how a particular algorithm is used for a specific problem. Taking various parameters does a comparison of various algorithms. This report advocates a wider use of different problems in teaching the best algorithm design strategies. | en |
| dc.description.sponsorship | Department of Computer Science and Engineering | en |
| dc.format.extent | 4125757 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/10266/805 | |
| dc.language.iso | en | en |
| dc.subject | Choosing Best Algorithm Design Strageies | en |
| dc.title | Choosing Best Algorithm Design Strategies For a Particular Problem | en |
| dc.type | Thesis | en |