Search results for "Frequently Asked Coding Interview - Algorithms"
Items we need to order for you


Algorithms in Bioinformatics
This book constitutes the refereed proceedings of the 16th International Workshop on Algorithms in Bioinformatics, WABI 2016, held in Aarhus, Denmark. The 25 full papers together with 2 invited talks presented were carefully reviewed and selected from 54 submissions.The selected papers cover a wide range of topics from networks, tophylogenetic studies, sequence and genome analysis, comparative genomics, and mass spectrometry data analysis.
R 1,562.82

R 580.00


R 1,527.00

Algorithms and Data Structures in VLSI Design
One of the main problems in chip design is the enormous number of possible combinations of individual chip elements within a system, and the problem of their compatibility. The recent application of data structures, efficient algorithms, and ordered binary decision diagrams (OBDDs) has proven vital in designing the computer chips of tomorrow. This book provides an introduction to the foundations of this interdisciplinary research area, emphasizing its applications in computer aided circuit design.
R 2,015.00

R 611.00

Algorithms and Complexity
The two-volume set LNCS 15679 and 15680 constitutes the refereed proceedings of the 14th International Conference on Algorithms and Complexity, CIAC 2025, held in Rome, Italy, during June 10–12, 2025.The 44 full papers included in these proceedings were carefully reviewed and selected from 110 submissions. They focus on all aspects of important venue for researchers working on computational complexity and the design, analysis, experimentation, and application of efficient algorithms and data structures.
R 2,949.67

Data Structures and Algorithms with Scala
This practically-focused textbook presents a concise tutorial on data structures and algorithms using the object-functional language Scala. The material builds upon the foundation established in the title Programming with Scala: Language Exploration by the same author, which can be treated as a companion text for those less familiar with Scala.Topics and features: discusses data structures and algorithms in the form of design patterns; covers key topics on arrays, lists, stacks, queues, hash tables, binary trees, sorting, searching, and graphs; describes examples of complete and running applications for each topic; presents a functional approach to implementations for data structures and algorithms (excepting arrays); provides numerous challenge exercises (with solutions), encouraging the reader to take existing solutions and improve upon them; offers insights from the author’s extensive industrial experience; includes a glossary, and an appendix supplying an overview of discrete mathematics.Highlighting the techniques and skills necessary to quickly derive solutions to applied problems, this accessible text will prove invaluable to time-pressured students and professional software engineers.
R 1,832.87

R 180.00

Introduction to Parallel Algorithms
Parallel algorithms Made Easy The complexity of today's applications coupled with the widespread use of parallel computing has made the design and analysis of parallel algorithms topics of growing interest. This volume fills a need in the field for an introductory treatment of parallel algorithms-appropriate even at the undergraduate level, where no other textbooks on the subject exist. It features a systematic approach to the latest design techniques, providing analysis and implementation details for each parallel algorithm described in the book. Introduction to Parallel Algorithms covers foundations of parallel computing; parallel algorithms for trees and graphs; parallel algorithms for sorting, searching, and merging; and numerical algorithms. This remarkable book: * Presents basic concepts in clear and simple terms * Incorporates numerous examples to enhance students' understanding * Shows how to develop parallel algorithms for all classical problems in computer science, mathematics, and engineering * Employs extensive illustrations of new design techniques * Discusses parallel algorithms in the context of PRAM model * Includes end-of-chapter exercises and detailed references on parallel computing. This book enables universities to offer parallel algorithm courses at the senior undergraduate level in computer science and engineering. It is also an invaluable text/reference for graduate students, scientists, and engineers in computer science, mathematics, and engineering.
R 6,772.00


Algorithms and Complexity
This book constitutes the refereed conference proceedings of the 12th International Conference on Algorithms and Complexity, CIAC 2019, held as a virtual event, in May 2021.The 28 full papers presented together with one invited lecture and 2 two abstracts of invited lectures were carefully reviewed and selected from 78 submissions. The International Conference on Algorithms and Complexity is intended to provide a forum for researchers working in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures. The papers present original research in the theory and applications of algorithms and computational complexity.Due to the Corona pandemic the conference was held virtually.
R 3,338.67

Algorithms and Complexity
The two-volume set LNCS 15679 and 15680 constitutes the refereed proceedings of the 14th International Conference on Algorithms and Complexity, CIAC 2025, held in Rome, Italy, during June 10–12, 2025.The 44 full papers included in these proceedings were carefully reviewed and selected from 110 submissions. They focus on all aspects of important venue for researchers working on computational complexity and the design, analysis, experimentation, and application of efficient algorithms and data structures.
R 3,663.00

R 724.43

R 611.00

R 714.00

Elements of Distributed Algorithms
Distributed Computing is rapidly becoming the principal computing paradigm in diverse areas of computing, communication, and control. Processor clusters, local and wide area networks, and the information highway evolved a new kind of problems which can be solved with distributed algorithms.In this textbook a variety of distributed algorithms are presented independently of particular programming languages or hardware, using the graphically suggestive technique of Petri nets which is both easy to comprehend intuitively and formally rigorous. By means of temporal logic the author provides surprisingly simple yet powerful correctness proofs for the algorithms.The scope of the book ranges from distributed control and synchronization of two sites up to algorithms on any kind of networks. Numerous examples show that description and analysis of distributed algorithms in this framework are intuitive and technically transparent.
R 1,649.00

201 Knockout Answers to Tough Interview Questions: The Ultimate Guide to Handling the New Competency-Based Interview Style
Increasingly, employers today are using a tough new kind of interview to evaluate candidates and determine how well they think on their feet. To be successful in these new competency-based interviews, job seekers must be pre pared with situation-specific examples that highlight the accomplishments, knowledge, and abilities they have that employers need. Featuring a plethora of sample questions and winning answers.This indispensable guide features fill-in-the-blank exercises readers can use to prepare themselves to demonstrate sought-after competencies and wow potential employers. It’s a powerful book no job seeker should be without.
R 469.00

Quantum Computing Algorithms
Explore essential quantum computing algorithms and master concepts intuitively with minimal math expertise requiredKey FeaturesLearn the fundamentals with an introduction to matrix arithmeticWrite quantum computing programs in Qiskit—IBM’s publicly available quantum computing websiteEmail your questions directly to the author—no question is too elementaryPurchase of the print or Kindle book includes a free PDF eBookBook DescriptionNavigate the quantum computing spectrum with the book. This book bridges the gap between abstract math-heavy texts and math-avoidant beginner guides. Unlike intermediate-level books that leave gaps in understanding, this comprehensive guide offers the missing link.Balancing intuition and rigor, this book empowers readers to master quantum algorithms. No longer confined to canned examples, you'll gain the tools to craft your own quantum code. Its four sections build your expertise progressively.The first section introduces foundational quantum concepts, ensuring everyone grasps qubits, their representation, and transformations. Moving to quantum algorithms, the second section focuses on pivotal algorithms: quantum key distribution and teleportation.In the third section, witness the transformative power of algorithms that outpace classical computation. The fourth section expands your horizons, delving into alternative quantum computing models.Welcome a future where quantum algorithms cease to be mystifying and become your assets. Whether you're an aspiring coder or math enthusiast, "Quantum Computing Algorithms" prepares you to navigate quantum realms with confidence. Step into a new era of computation where you shape the code of reality.What you will learnDefine quantum circuitsHarness superposition and entanglement for solving classical problemsGain insights into the implementation of quantum teleportationExplore the impact of quantum computing on cryptographyTranslate theoretical knowledge into practical skills by writing and executing code on real quantum hardwareExpand your understanding of this domain by uncovering alternative quantum computing modelsWho this book is forThis book is for individuals familiar with algebra and computer programming, eager to delve into modern physics concepts. Whether you've dabbled in introductory quantum computing material or are seeking deeper insights, this quantum computing book is your gateway to in-depth exploration.
R 1,889.00

Dynamics of Algorithms
The articles collected in this volume represent the contributions presented at the IMA workshop on "Dynamics of Algorithms" which took place in November 1997. The workshop was an integral part of the 1997 -98 IMA program on "Emerging Applications of Dynamical Systems." The interaction between algorithms and dynamical systems is mutually beneficial since dynamical methods can be used to study algorithms that are applied repeatedly. Convergence, asymptotic rates are indeed dynamical properties. On the other hand, the study of dynamical systems benefits enormously from having efficient algorithms to compute dynamical objects.
R 1,533.60


R 762.00

R 611.00

R 1,642.62

R 1,026.00

R 458.00

WALCOM: Algorithms and Computation
This book constitutes the refereed proceedings of the 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, held in Kanazawa, Japan, during March 18–20, 2024. The 28 full papers presented in this book, together with two extended abstracts of invited talks, were carefully reviewed and selected from 80 submissions. They cover diverse areas of algorithms and computation, that is, approximation algorithms, algorithmic graph theory and combinatorics, combinatorial algorithms, combinatorial optimization, computational biology, combinatorial reconfiguration, computational complexity, computational geometry, discrete geometry, data structures, experimental algorithm methodologies, graph algorithms, graph drawing, parallel and distributed algorithms, parameterized algorithms, parameterized complexity, network optimization, online algorithms, randomized algorithms, and string algorithms.
R 3,152.68

R 4,192.07

R 611.00



Combinatorial Algorithms
This book constitutes the proceedings of 37th International Workshop on Combinatorial Algorithms, IWOCA 2026, held in Clermont-Ferrand, France, during June 8–11, 2026.The 37 full papers presented in this book were carefully reviewed and selected from 110 submissions. They deal with design algorithms for the myriad combinatorial problems that underlie computer applications in science, engineering and business.
R 3,553.74

Coding Theory
One of the most important key technologies for digital communication systems as well as storage media is coding theory. It provides a means to transmit information across time and space over noisy and unreliable communication channels. Coding Theory: Algorithms, Architectures and Applications provides a concise overview of channel coding theory and practice, as well as the accompanying signal processing architectures. The book is unique in presenting algorithms, architectures, and applications of coding theory in a unified framework. It covers the basics of coding theory before moving on to discuss algebraic linear block and cyclic codes, turbo codes and low density parity check codes and space-time codes. Coding Theory provides algorithms and architectures used for implementing coding and decoding strategies as well as coding schemes used in practice especially in communication systems. Feature of the book include: Unique presentation-like style for summarising main aspectsPractical issues for implementation of coding techniquesSound theoretical approach to practical, relevant coding methodologiesCovers standard coding schemes such as block and convolutional codes, coding schemes such as Turbo and LDPC codes, and space time codes currently in research, all covered in a common framework with respect to their applications. This book is ideal for postgraduate and undergraduate students of communication and information engineering, as well as computer science students. It will also be of use to engineers working in the industry who want to know more about the theoretical basics of coding theory and their application in currently relevant communication systems
R 4,557.00


Parallel Algorithms for Irregularly Structured Problems
This book presents the proceedings of the Second International Workshop on Parallel Algorithms for Irregularly Structured Problems, IRREGULAR '95, held in Lyon, France in September 1995. This workshop series addresses issues related to deriving efficient parallel solutions to irregularly structured problems and aims at fostering cooperation between practitioners and theoreticians in the field.Besides three invited papers, 20 full papers and eight short contributions are presented, all selected during a highly competitive refereeing process; the volume is organized in sections on programming methods and compiling techniques, mapping and scheduling, applications, and optimization.
R 1,577.39



Algorithms – ESA 2013
This book constitutes the refereed proceedings of the 21st Annual European Symposium on Algorithms, ESA 2013, held in Sophia Antipolis, France, in September 2013 in the context of the combined conference ALGO 2013. The 69 revised full papers presented were carefully reviewed and selected from 303 initial submissions: 53 out of 229 in track "Design and Analysis" and 16 out of 74 in track "Engineering and Applications". The papers in this book present original research in all areas of algorithmic research, including but not limited to: algorithm engineering; algorithmic aspects of networks; algorithmic game theory; approximation algorithms; computational biology; computational finance; computational geometry; combinatorial optimization; data compression; data structures; databases and information retrieval; distributed and parallel computing; graph algorithms; hierarchical memories; heuristics and meta-heuristics; mathematical programming; mobile computing; on-line algorithms; parameterized complexity; pattern matching; quantum computing; randomized algorithms; scheduling and resource allocation problems; streaming algorithms.
R 2,262.34

R 1,496.00

Algorithms for Image Processing and Computer Vision
A cookbook of algorithms for common image processing applications Thanks to advances in computer hardware and software, algorithms have been developed that support sophisticated image processing without requiring an extensive background in mathematics. This bestselling book has been fully updated with the newest of these, including 2D vision methods in content-based searches and the use of graphics cards as image processing computational aids. It’s an ideal reference for software engineers and developers, advanced programmers, graphics programmers, scientists, and other specialists who require highly specialized image processing. Algorithms now exist for a wide variety of sophisticated image processing applications required by software engineers and developers, advanced programmers, graphics programmers, scientists, and related specialistsThis bestselling book has been completely updated to include the latest algorithms, including 2D vision methods in content-based searches, details on modern classifier methods, and graphics cards used as image processing computational aidsSaves hours of mathematical calculating by using distributed processing and GPU programming, and gives non-mathematicians the shortcuts needed to program relatively sophisticated applications. Algorithms for Image Processing and Computer Vision, 2nd Edition provides the tools to speed development of image processing applications.
R 3,257.00

Evolutionary Algorithms
The IMA Workshop on Evolutionary Algorithms brought together many of the top researchers in the area of Evolutionary Computation for a week of intensive interaction. The field of Evolutionary Computation has developed significantly over the past 30 years and today consists of a variety of subfields such as genetic algorithms, evolution strategies, evolutionary programming, and genetic programming, each with its own algorithmic perspectives and goals. The workshop did a great deal to clarify the current state of the theory of Evolutionary Algorithms. The existing theory might be characterized as deriving from two principal approaches. There is a high level macro-theory that looks at the processing of "building blocks" and "schemata" that are shared by many good solutions when searching a problem space. There is also a low level micro-theory that builds exact Markov models of the search process. It is sometimes hard for researchers working at such different levels of abstraction to interact. The IMA workshop allowed researchers working at these different levels to present their points of view and to move toward common ground.There was real progress in communication between theorists and practitioners in the evolutionary computation field. Speakers presented applications across a wide range of problem areas. In some of those cases, theoretically motivated methods work quite well. In other cases, practitioners used domain-based methods to obtain better performance than could be achieved by using a "pure" evolutionary algorithm. Individuals on both sides went away with a better appreciation of the successes and failures of current theory.
R 2,743.63

Combinatorial Algorithms
This book constitutes the thoroughly refereed post-workshop proceedings of the 25th International Workshop on Combinatorial Algorithms, IWOCA 2014, held in Duluth, MN, USA, in October 2014. The 32 revised full papers presented were carefully reviewed and selected from a total of 69 submissions. The papers focus on topics such as Algorithms and Data Structures, Combinatorial Enumeration, Combinatorial Optimization, Complexity Theory (Structural and Computational), Computational Biology, Databases (Security, Compression and Information Retrieval), Decompositions and Combinatorial Designs, Discrete and Computational Geometry, as well as Graph Drawing and Graph Theory. IWOCA is a yearly forum for researchers in designing algorithms field to advance creativeness of intersection between mathematics and computer science. This is the first time this conference is being held in U.S.
R 2,188.29

Nature-Inspired Algorithms and Applied Optimization
This book reviews the state-of-the-art developments in nature-inspired algorithms and their applications in various disciplines, ranging from feature selection and engineering design optimization to scheduling and vehicle routing. It introduces each algorithm and its implementation with case studies as well as extensive literature reviews, and also includes self-contained chapters featuring theoretical analyses, such as convergence analysis and no-free-lunch theorems so as to provide insights into the current nature-inspired optimization algorithms. Topics include ant colony optimization, the bat algorithm, B-spline curve fitting, cuckoo search, feature selection, economic load dispatch, the firefly algorithm, the flower pollination algorithm, knapsack problem, octonian and quaternion representations, particle swarm optimization, scheduling, wireless networks, vehicle routing with time windows, and maximally different alternatives. This timely book serves as a practical guide and reference resource for students, researchers and professionals.
R 6,197.74


101 Job Interview Questions You'll Never Fear Again
"An insider's guide to the perfect interview." -Daily Express What are job interviewers actually looking for in a candidate? What questions will they ask? What does each question really mean? What are the answers that will secure you the job? James Reed, chairman of one of the world's largest recruiting agencies, takes you into the minds of top interviewers and reveals the answers that will land your dream job. 101 Job Interview Questions You'll Never Fear Again provides the best strategies for dealing with everything from classic questions like "Tell me about yourself" and "What are your greatest weaknesses?" to puzzlers like "Sell me this pen" and "How many traffic lights are there in New York?" You'll learn: * The "Fateful 15" questions that form the basis of nearly every question you'll be asked. * The 101 most common questions and what the interviewer is really asking. * Top line tactics for formulating winning answers about your career goals, character, competency, and creativity. * How to identify the types of interviewers and adapt accordingly. * How to adopt the right mindset, dress code, and approach to stand out from the pack. "Gives you the answers they really want. Great as interview preparation." -The Sun "Takes much of the fear out of preparing for a job interview." -Sunday Post "Well-written and well-organized. Strongly recommended for anyone preparing for a job interview." -Library Journal
R 704.00
















































