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

by Arora, Amrinder
ISBN: 9781718157422
Availability:
$9.99

Available Offers

Pickup at {0} Out of stock at {0} Check other stores
FREE
Ship to Me
$3.99

Overview

"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.
  • Format: Trade Paperback
  • Author: Arora, Amrinder
  • ISBN: 9781718157422
  • Condition: New
  • Dimensions: 7.99 x 0.37
  • Number Of Pages: 160
  • Publication Year: 2018
Language: English