DESIGN AND ANALYSIS OF ALGORITHMSThis highly structured text provides comprehensive coverage of design techniques of algorithms. It traces the complete development of various algorithms in a stepwise approach followed by their pseudo-codes to build an understanding of their application in practice. With clear explanations, the book analyzes different kinds of algorithms such as distance-based network algorithms, search algorithms, sorting algorithms, probabilistic algorithms, and single as well as parallel processor scheduling algorithms. Besides, it discusses the importance of heuristics, benchmarking of algorithms, cryptography, and dynamic programming. Key Features : Offers in-depth treatment of basic and advanced topics. Includes numerous worked examples covering varied real-world situations to help students grasp the concepts easily. Provides chapter-end exercises to enable students to check their mastery of content. This text is especially designed for students of B.Tech and M.Tech (Computer Science and Engineering and Information Technology), MCA, and M.Sc. (Computer Science and Information Technology). It would also be useful to undergraduate students of electrical and electronics and other engineering disciplines where a course in algorithms is prescribed. |
Contents
chapter1pdf | 1 |
chapter2pdf | 23 |
chapter3pdf | 54 |
chapter4pdf | 78 |
chapter5pdf | 118 |
chapter6pdf | 185 |
chapter7pdf | 223 |
chapter8pdf | 242 |
chapter10pdf | 275 |
chapter11pdf | 296 |
chapter12pdf | 314 |
chapter13pdf | 328 |
chapter14pdf | 381 |
417 | |
421 | |
chapter9pdf | 256 |
Common terms and phrases
active algorithm applied array assigned assumed binary calculations Check ciphertext column complete Compute Consider corresponding created data structure deleting Determination distance distance matrix distribution entries equal Example file Find first function given go to step heap Hence heuristic immediate increment initial Input iteration least lower bound matrix maximum means method minimize moving node obtained optimal otherwise go partial performance plaintext position precedence presented probability processing steps processor pseudo-code queue range record represents respect root search algorithm selected sequence shortest path shown in Figure shown in Table simulation single machine scheduling solution sort square stage step 11 Step 9 Stop Store sub-array subproblem total tardiness tour tree Update variable vertex weight