Design and analysis of algorithms
By: Mundra, Shweta Bajaj
.
Publisher: New Delhi University Science Press 2013Edition: 1st.Description: 158p. Platform - eVersion |.ISBN: 9789381159583.Subject(s): Computer EngineeringDDC classification: 005.1 Online resources: Read this book on Videeya: eBook Platform Summary: The basic aim of this book is to help the student understand the designing procedure of algorithms, how to analyze algorithms and how to implement the algorithms. This book provides comprehensive and completely up-to-date coverage of ?Design and Analysis of Algorithms?. It meets student?s needs by addressing both the designing principle as well as the critical role of performance in driving the algorithm. This book covers the syllabus of all the universities which offer the B.E./B.Tech (Computer Science & Engg./ Information Technology), B.Sc. (Computer Science/ Information Technology), and M.Sc. (Computer Science/ Information Technology) and it is also useful for MCA students. This has been written in a very simple and lucid language. Salient Features of the Book: Easily understandable, step by step description of each algorithm. Plenty of illustrations supporting the theoretical concepts. Large number of solved problems for real situation applications. A simple formal descriptive language used throughout the book. Step by step description of Red Black Tree (insertion and deletion). Effective description of Sorting (Quick Sort, Heap Sort, Counting Sort etc.) A simple description of Graphs Algorithms. Numerous unsolved problems for practice in each chapter.
| Item type | Current location | Collection | Call number | url | Status | Notes | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|---|---|
eBooks
|
School of Engineering & Technology Online Material | Circulation | 005.1 MUN (Browse shelf) | https://videeya.in/product/design-analysis-algorithms50071856 | Available | Read this book on Videeya: eBook Platform |
The basic aim of this book is to help the student understand the designing procedure of algorithms, how to analyze algorithms and how to implement the algorithms. This book provides comprehensive and completely up-to-date coverage of ?Design and Analysis of Algorithms?. It meets student?s needs by addressing both the designing principle as well as the critical role of performance in driving the algorithm. This book covers the syllabus of all the universities which offer the B.E./B.Tech (Computer Science & Engg./ Information Technology), B.Sc. (Computer Science/ Information Technology), and M.Sc. (Computer Science/ Information Technology) and it is also useful for MCA students. This has been written in a very simple and lucid language. Salient Features of the Book: Easily understandable, step by step description of each algorithm. Plenty of illustrations supporting the theoretical concepts. Large number of solved problems for real situation applications. A simple formal descriptive language used throughout the book. Step by step description of Red Black Tree (insertion and deletion). Effective description of Sorting (Quick Sort, Heap Sort, Counting Sort etc.) A simple description of Graphs Algorithms. Numerous unsolved problems for practice in each chapter.
There are no comments for this item.