Search results for "Frequently Asked Coding Interview - Algorithms"
Items in stock - 4 working days delivery time

Algorithms to Live By
A fascinating exploration of how computer algorithms can be applied to our everyday lives. In this dazzlingly interdisciplinary work, acclaimed author Brian Christian and cognitive scientist Tom Griffiths show us how the simple, precise algorithms used by computers can also untangle very human questions. Modern life is constrained by limited space and time, limits that give rise to a particular set of problems. What should we do, or leave undone, in a day or a lifetime? How much messiness should we accept? The authors explain how to have better hunches and when to leave things to chance, how to deal with overwhelming choices and how best to connect with others. From finding a spouse to finding a parking spot, from organizing one's inbox to understanding the workings of human memory, Algorithms To Live By is full of practical takeaways to help you solve common decision-making problems and illuminate the workings of the human mind.
R 360.00
Items we need to order for you

R 764.00

R 1,627.00


R 455.00

R 929.00

R 1,627.00

R 1,527.00


R 763.00

R 367.00

R 525.00

Algorithms and Programming
This text is structured in a problem-solution format that requires the student to think through the programming process. New to the second edition are additional chapters on suffix trees, games and strategies, and Huffman coding as well as an Appendix illustrating the ease of conversion from Pascal to C.
R 2,261.86


Algorithms and Order
This volume contains the texts of the principal survey papers presented at ALGORITHMS -and ORDER, held· at Ottawa, Canada from June 1 to June 12, 1987. The conference was supported by grants from the N.A.T.O. Advanced Study Institute programme, the University of Ottawa, and the Natural Sciences and Engineering Research Council of Canada. We are grateful for this considerable support. Over fifty years ago, the Symposium on Lattice Theory, in Charlottesville, U.S.A., proclaimed the vitality of ordered sets. Only twenty years later the Symposium on Partially Ordered Sets and Lattice Theory, held at Monterey, U.S.A., had solved many of the problems that had been originally posed. In 1981, the Symposium on Ordered Sets held at Banff, Canada, continued this tradition. It was marked by a landmark volume containing twenty-three articles on almost all current topics in the theory of ordered sets and its applications. Three years after, Graphs and Orders, also held at Banff, Canada, aimed to document the role of graphs in the theory of ordered sets and its applications. Because of its special place in the landscape of the mathematical sciences order is especially sensitive to new trends and developments. Today, the most important current in the theory and application of order springs from theoretical computer seience. Two themes of computer science lead the way. The first is data structure. Order is common to data structures.
R 12,231.54


R 367.00

R 5,090.62

R 1,037.62


Algorithms and Data Structures
With numerous practical, real-world algorithms presented in the C programming language, Bowman's Algorithms and Data Structures: An Approach in C is the algorithms text for courses that take a modern approach. For the one- or two-semester undergraduate course in data structures, it instructs students on the science of developing and analysing algorithms. Bowman focuses on both the theoretical and practical aspects of algorithm development. He discusses problem-solving techniques and introduces the concepts of data abstraction and algorithm efficiency. More importantly, the text does not present algorithms in a "shopping-list" format. Rather it provides actual insight into the design process itself
R 6,267.00

R 690.98


WALCOM: Algorithms and Computation
This book constitutes the refereed proceedings of the Third International Workshop on Algorithms and Computation, WALCOM 2009, held in Kolkata, India, in February 2009. The 30 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 102 submissions. The papers feature original research in the areas of design and analysis of algorithms, computational geometry, graph drawing and graph algorithms. The papers are organized in topical sections on computational geometry, graph algorithms, complexity, graph drawing, approximation algorithms, and randomized algorithms.
R 1,576.36

Randomized Algorithms: Approximation, Generation, and Counting
Randomized Algorithms discusses two problems of fine pedigree: counting and generation, both of which are of fundamental importance to discrete mathematics and probability. When asking questions like "How many are there?" and "What does it look like on average?" of families of combinatorial structures, answers are often difficult to find -- we can be blocked by seemingly intractable algorithms. Randomized Algorithms shows how to get around the problem of intractability with the Markov chain Monte Carlo method, as well as highlighting the method's natural limits. It uses the technique of coupling before introducing "path coupling" a new technique which radically simplifies and improves upon previous methods in the area.
R 3,017.77


Algorithms
Algorithms: Technology, Culture, Politics develops a relational, situated approach to algorithms. It takes a middle ground between theories that give the algorithm a singular and stable meaning in using it as a central analytic category for contemporary society and theories that dissolve the term into the details of empirical studies.The book discusses algorithms in relation to hardware and material conditions, code, data, and subjects such as users, programmers, but also “data doubles”. The individual chapters bridge critical discussions on bias, exclusion, or responsibility with the necessary detail on the contemporary state of information technology. The examples include state of the art applications of machine learning, such as self-driving cars and large language models such as GPT.The book will be of interest for everyone engaging critically with algorithms, particularly in the social sciences, media studies, STS, political theory, or philosophy. With its broad scope it can serve as a high-level introduction that picks up and builds on more than two decades of critical research on algorithms.
R 9,302.33

R 1,352.55

Algorithmen, Zufall, Unsicherheit – und Pizza!
Dieses Buch lädt dazu ein, die Welt um uns herum aus einem neuen Blickwinkel zu betrachten und dabei die spannende Verbindung zwischen der Mathematik und unserem täglichen Leben zu entdecken – denn um die Technologien und Entwicklungen unserer modernen Gesellschaft zu verstehen, benötigen wir ein intuitives Verständnis grundlegender mathematischer Ideen. In diesem Buch geht es um diese Grundlagen, vor allem aber um ihre praktische Anwendung im Alltag: Gemeinsam begeben wir uns auf eine unterhaltsame Reise und entdecken dabei, wie Mathematik in vielfältiger Weise allgegenwärtig ist. Anschauliche Beispiele zeigen, wie wir täglich – oft unbewusst – mathematische Ideen nutzen und wie wir mit Hilfe von Mathematik bessere Entscheidungen treffen können.Nach einer Einführung in Algorithmen und Optimierungsprobleme, geht es im weiteren Verlauf um die Modellierung von Zufall und Unsicherheiten. Zum Ende des Buchs werden die Themen zusammengeführt und Algorithmen für Anwendungen besprochen, bei denen der Zufall eine entscheidende Rolle spielt.Sie erfahren unter anderem:Wie Sie systematisch Ordnung in Ihre Plattensammlung bringen könnenWarum ein vermeintliches Optimum nicht immer optimal istWie viele Getränke Sie bei einer Party bereitstellen sollten, damit niemand durstig nach Hause gehtWann Sie besser den nächsten freien Parkplatz nehmen sollten
R 684.00

R 1,527.00

R 1,152.64

Algorithms and Computation
This volume presents the proceedings of the fourth annualInternational Symposium on Algorithms and Computation, heldin Hong Kong in December 1993.Numerous selected paperspresent original research in such areas as design andanalysis of algorithms, computational complexity, and theoryof computation. Topics covered include:- automata, languages, and computability,- combinatorial, graph, geometric, and randomizedalgorithms,- networks and distributed algorithms,- VLSIand parallel algorithms,- theory of learning and robotics,- number theory and robotics.Three invited papers are also included.
R 3,081.39

R 4,367.45

How to Think about Algorithms
Understand algorithms and their design with this revised student-friendly textbook. Unlike other algorithms books, this one is approachable, the methods it explains are straightforward, and the insights it provides are numerous and valuable. Without grinding through lots of formal proof, students will benefit from step-by-step methods for developing algorithms, expert guidance on common pitfalls, and an appreciation of the bigger picture. Revised and updated, this second edition includes a new chapter on machine learning algorithms, and concise key concept summaries at the end of each part for quick reference. Also new to this edition are more than 150 new exercises: selected solutions are included to let students check their progress, while a full solutions manual is available online for instructors. No other text explains complex topics such as loop invariants as clearly, helping students to think abstractly and preparing them for creating their own innovative ways to solve problems.
R 5,932.56

R 336.00


R 551.40


Introduction to Distributed Algorithms
Distributed algorithms have been the subject of intense development over the last twenty years. The second edition of this successful textbook provides an up-to-date introduction both to the topic, and to the theory behind the algorithms. The clear presentation makes the book suitable for advanced undergraduate or graduate courses, whilst the coverage is sufficiently deep to make it useful for practising engineers and researchers. The author concentrates on algorithms for the point-to-point message passing model, and includes algorithms for the implementation of computer communication networks. Other key areas discussed are algorithms for the control of distributed applications (wave, broadcast, election, termination detection, randomized algorithms for anonymous networks, snapshots, deadlock detection, synchronous systems), and fault-tolerance achievable by distributed algorithms. The two new chapters on sense of direction and failure detectors are state-of-the-art and will provide an entry to research in these still-developing topics.
R 4,022.00

R 611.00

R 814.00

Algorithms and Order
This volume contains the texts of the principal survey papers presented at ALGORITHMS -and ORDER, held· at Ottawa, Canada from June 1 to June 12, 1987. The conference was supported by grants from the N.A.T.O. Advanced Study Institute programme, the University of Ottawa, and the Natural Sciences and Engineering Research Council of Canada. We are grateful for this considerable support. Over fifty years ago, the Symposium on Lattice Theory, in Charlottesville, U.S.A., proclaimed the vitality of ordered sets. Only twenty years later the Symposium on Partially Ordered Sets and Lattice Theory, held at Monterey, U.S.A., had solved many of the problems that had been originally posed. In 1981, the Symposium on Ordered Sets held at Banff, Canada, continued this tradition. It was marked by a landmark volume containing twenty-three articles on almost all current topics in the theory of ordered sets and its applications. Three years after, Graphs and Orders, also held at Banff, Canada, aimed to document the role of graphs in the theory of ordered sets and its applications. Because of its special place in the landscape of the mathematical sciences order is especially sensitive to new trends and developments. Today, the most important current in the theory and application of order springs from theoretical computer seience. Two themes of computer science lead the way. The first is data structure. Order is common to data structures.
R 12,230.64

Algorithm
From a former President of Tesla comes The Algorithm—the first book written by any of Elon Musk’s direct reports—a transformative guide for leaders, entrepreneurs, and innovators who want to emulate the paradigm-shattering approach Musk used to launch Tesla and SpaceX to meteoric success.Jonathan McNeill had already founded and sold six startups when Sheryl Sandberg introduced him to Elon Musk, who was looking for help at Tesla. McNeill was steeped in the lean principles that had made Toyota a global powerhouse—principles focused on achieving efficiency and optimization by incrementally improving existing systems and processes. What he learned from Elon at Tesla was its antithesis, an approach that required radical rethinking to explode the status quo, attack complexity, and set seemingly unrealistic goals.Elon called this five-step framework “The Algorithm.”1. Question every requirement.2. Delete every possible step in the process.3. Simplify and optimize.4. Accelerate cycle time.5. Automate.In this book, McNeill details this tremendously powerful set of tools, which brought Tesla from a production crisis that threatened to derail it to a period of hypergrowth. During his tenure, revenue boomed from $2B to $20B in just 30 months. Since his departure from Tesla, McNeill has used The Algorithm in every enterprise he has worked with to supercharge speed, efficiency, innovation, and growth. Featuring case studies from Tesla and SpaceX, as well as from Lululemon, GM, and companies of various sizes across industries, he reveals how any business can do the same and achieve the unimaginable.
R 691.00

R 703.00

Hands-On Data Structures and Algorithms with Python
Understand how implementing different data structures and algorithms intelligently can make your Python code and applications more maintainable and efficientKey FeaturesExplore functional and reactive implementations of traditional and advanced data structuresApply a diverse range of algorithms in your Python codeImplement the skills you have learned to maximize the performance of your applicationsBook DescriptionChoosing the right data structure is pivotal to optimizing the performance and scalability of applications. This new edition of Hands-On Data Structures and Algorithms with Python will expand your understanding of key structures, including stacks, queues, and lists, and also show you how to apply priority queues and heaps in applications. You'll learn how to analyze and compare Python algorithms, and understand which algorithms should be used for a problem based on running time and computational complexity. You will also become confident organizing your code in a manageable, consistent, and scalable way, which will boost your productivity as a Python developer.By the end of this Python book, you'll be able to manipulate the most important data structures and algorithms to more efficiently store, organize, and access data in your applications.What you will learnUnderstand common data structures and algorithms using examples, diagrams, and exercisesExplore how more complex structures, such as priority queues and heaps, can benefit your codeImplement searching, sorting, and selection algorithms on number and string sequencesBecome confident with key string-matching algorithmsUnderstand algorithmic paradigms and apply dynamic programming techniquesUse asymptotic notation to analyze algorithm performance with regard to time and space complexitiesWrite powerful, robust code using the latest features of PythonWho this book is forThis book is for developers and programmers who are interested in learning about data structures and algorithms in Python to write complex, flexible programs. Basic Python programming knowledge is expected.
R 1,628.00















































