Skip to content
Welcome To Our Store.
100,000+ Products for Home, Medical, Office & Classroom Needs
Search
Skip to product information
1 of 1

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

$13.48
$13.48
Sale Sold out
Shipping calculated at checkout.
In stock (100 units), ready to be shipped

Available Offers

Fastest Delivery Tomorrow With Vip DealOrder within 1 hr 8 mins.

Instant 10% Discount On HDFC Banks Credit/Debit Cards EMI and CreditCard

Secure checkout with
  • American Express
  • Apple Pay
  • Diners Club
  • Discover
  • Google Pay
  • Mastercard
  • PayPal
  • Shop Pay
  • Visa

Flight Range: Up to 1,000 meters (3,280 feet)

Maximum Speed: 45 kilometers per hour (28 miles per hour)

For all orders exceeding a value of 100USD shipping is offered for free.

Returns will be accepted for up to 10 days of Customer’s receipt or tracking number on unworn items. You, as a Customer, are obliged to inform us via email before you return the item.

Otherwise, standard shipping charges apply. Check out our delivery Terms & Conditions for more details.

View Product Details
Shopping cart
Product Product subtotal Quantity Price Product subtotal
101 Algorithms Questions You Must Know: Tricky Questions. Fun Solutions. - Paperback
101 Algorithms Questions You Must Know: Tricky Questions. Fun Solutions. - Paperback
101 Algorithms Questions You Must Know: Tricky Questions. Fun Solutions. - Paperback
$13.48/ea
$0.00
$13.48/ea $0.00

Product Description

by Amrinder Arora (Author)

"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.

Number of Pages: 160
Dimensions: 0.37 x 7.99 x 5.24 IN
Publication Date: December 29, 2018
you might like