• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
101 Algorithms Questions You Must Know: Tricky Questions. Fun Solutions.

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

Paperback

General ComputersGeneral Education

ISBN10: 1718157428
ISBN13: 9781718157422
Publisher: Independently Published
Published: Dec 29 2018
Pages: 172
Weight: 0.44
Height: 0.40 Width: 5.25 Depth: 8.00
Language: English
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.

Also in

General Education