Skip to content
ISBN: 1718157428
ISBN13: 9781718157422

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

$12.27List Price: $9.99
ISBN: 1718157428
ISBN13: 9781718157422
Formats

Conditions

A brand-new, unused copy in perfect condition.

Formats

Conditions

A brand-new, unused copy in perfect condition.

See all 1 editionsfrom $12.27

Book 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. This description may be from another edition of this product.
Format:
Paperback
Language:
English
ISBN:
1718157428
ISBN13:
9781718157422
Release Date:
December 2018
Publisher:
Independently Published
Length:
171 Pages
Weight:
0.44 lbs.
Dimensions:
0.4″ × 5.3″ × 8.0″
ComputersComputers & TechnologyEducationEducation & Reference

More by Amrinder Arora

Customer Reviews

0 customer ratings | 0 reviews
Write a Review

There are currently no reviews. Be the first to review this work.