DESIGN AND ANALYSIS OF ALGORITHMS
This 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.
What people are saying - Write a review
Other editions - View all
ascending order assigned binary tree BNODE bound algorithm branch and bound chromosome ciphertext column combinatorial problem Compute Contd corresponding crossover cumulative probability data structure decryption deﬁned deleting distance matrix distance network due date encryption Example ﬁle ﬁnal ﬁnd ﬁrst Give the steps go to S3 go to step heap heuristic initial Input the following insertion sort iteration lower bound machine scheduling problem makespan maximum Milliseconds minimum spanning tree otherwise go Panneerselvam Peg B Peg plaintext plaintext symbols positional weight precedence matrix processing stage processing steps queue queue data structure random number record root node shortest path shown in Figure shown in Table simulation single machine scheduling sort algorithm sorted array step 11 Step 9 stop FIGURE sub-array subproblem terminal node total number total tardiness Tower of Hanoi travelling salesman problem tree traversal Unassigned cycle unbarred node Update vertex Write the pseudo-code