| 101 Algorithms Questions You Must Know: Tricky Questions. Fun Solutions. Contributor(s): Arora, Amrinder (Author) |
|
 |
ISBN: 1718157428 ISBN-13: 9781718157422 Publisher: Independently Published OUR PRICE: $9.49 Product Type: Paperback Published: December 2018 |
| Additional Information |
| BISAC Categories: - Education | Computers & Technology |
| Physical Information: 0.37" H x 5.24" W x 7.99" (0.42 lbs) 160 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: "101 Algorithms Questions You Must Know" presents 101 asymptotic complexity Questions and Answers, organized by Algorithm Design Techniques. Serving as a useful accompaniment to "Analysis and Design of Algorithms" (ISBN 978-1516513086), the questions are distributed as follows: 9 Warm up Questions on Math Basics, 19 Questions on Asymptotic Analysis and Asymptotic Notation, 3 Questions on Data Structures, 17 Questions on Divide and Conquer, 8 Questions on Greedy Algorithms, 18 Questions on Dynamic Programming, 5 Questions on Graph Traversal (BFS/DFS), 4 Questions on Branch and Bound, 9 Questions on NP-Completeness 3 Questions on Lower Bounds, and 6 Questions on Graph Theory.Covering many questions used by major technology companies as their interview questions, this book serves both software professionals as well as graduate students in the field. |