product iamge

101 Algorithms Questions You Must Know: Tricky Questions. Fun Solutions.

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Download
Search on Amazon

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

“101 Algorithms Questions You Must Know” presents 101 asymptotic complexity Questions and Answers, Organized by Algorithm Design Techniques. The book is designed as an accompaniment to “Analysis and Design of Algorithms” 3rd Edition (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

Author(s): Arora, Amrinder
Series: 1718157428
Year: 2018

Language: English
Commentary: eCore v0.9.12.751 [ http://www.epubor.com/ecore.html ]
Pages: 162