Search results for "frequently asked coding interview - algorithms"
Items we need to order for you

R 489.00

Algorithm and Design Complexity
Computational complexity is critical in analysis of algorithms and is important to be able to select algorithms for efficiency and solvability. Algorithm and Design Complexity initiates with discussion of algorithm analysis, time-space trade-off, symptotic notations, and so forth. It further includes algorithms that are definite and effective, known as computational procedures. Further topics explored include divide-and-conquer, dynamic programming, and backtracking.Features: Includes complete coverage of basics and design of algorithms Discusses algorithm analysis techniques like divide-and-conquer, dynamic programming, and greedy heuristics Provides time and space complexity tutorials Reviews combinatorial optimization of Knapsack problem Simplifies recurrence relation for time complexityThis book is aimed at graduate students and researchers in computers science, information technology, and electrical engineering.
R 7,564.55




R 916.00


R 588.35

R 764.00


R 611.00



R 703.94

R 1,954.00


R 916.00


Computer Always Wins
An engaging and approachable resource for beginning-to-intermediate coders eager to learn advanced ideas in computer programming. Too often, the magic of computer science is locked behind an intimidating wall of syntax and mathematics. Students of all ages are drawn to the idea of using computers to ask questions and solve problems, but the standard computer science curriculum demands that they first slog through a seemingly endless run of dull, technical muck. They want to tinker; they are told to trudge. In The Computer Always Wins, Elliot Joseph Lichtman strips away these conventional barriers, using familiar puzzles and strategy games to explore some of computer science s most inspiring ideas. The Computer Always Wins is designed for readers who know the bare-bones basics of computer programming and are ready to truly love it. The book introduces some of the field s most powerful concepts but does so accessibly by framing them in the context of word games, board games, and strategy games that readers already know. Tic-Tac-Toe helps a student understand recursion. Wordle teaches how to efficiently parse an enormous list. Rock-paper-scissors becomes an intuitive gateway to machine learning. By the end of the book, readers come away with not only a better understanding of these foundational strategies, but also a joyful appreciation for the amazing and exciting feats that can be accomplished using simple, readable code.
R 524.00

R 305.00

R 1,527.00

R 1,060.00


R 794.00




Concurrent Programming: Algorithms, Principles, and Foundations
This book is devoted to the most difficult part of concurrent programming, namely synchronization concepts, techniques and principles when the cooperating entities are asynchronous, communicate through a shared memory, and may experience failures. Synchronization is no longer a set of tricks but, due to research results in recent decades, it relies today on sane scientific foundations as explained in this book.In this book the author explains synchronization and the implementation of concurrent objects, presenting in a uniform and comprehensive way the major theoretical and practical results of the past 30 years. Among the key features of the book are a new look at lock-based synchronization (mutual exclusion, semaphores, monitors, path expressions); an introduction to the atomicity consistency criterion and its properties and a specific chapter on transactional memory; an introduction to mutex-freedom and associated progress conditions such as obstruction-freedom and wait-freedom; a presentation of Lamport's hierarchy of safe, regular and atomic registers and associated wait-free constructions; a description of numerous wait-free constructions of concurrent objects (queues, stacks, weak counters, snapshot objects, renaming objects, etc.); a presentation of the computability power of concurrent objects including the notions of universal construction, consensus number and the associated Herlihy's hierarchy; and a survey of failure detector-based constructions of consensus objects. The book is suitable for advanced undergraduate students and graduate students in computer science or computer engineering, graduate students in mathematics interested in the foundations of process synchronization, and practitioners and engineers who need to produce correct concurrent software. The reader should have a basic knowledge of algorithms and operating systems.
R 3,784.27

R 1,237.00





R 318.00


R 1,374.00


R 1,038.00


R 885.00

R 330.41



R 1,068.00




















































