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



R 751.78




R 610.00

R 764.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 1,572.42


R 916.00



R 1,238.00



R 1,285.35


R 611.00




R 458.00

R 374.00


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 1,038.00

R 455.00

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

Algorithmics
Computer science is the science of the future, and already underlies every facet of business and technology, and much of our everyday lives. In addition, it will play a crucial role in the science the 21st century, which will be dominated by biology and biochemistry, similar to the role of mathematics in the physical sciences of the 20th century. In this award-winning best-seller, the author and his co-author focus on the fundamentals of computer science, which revolve around the notion of the algorithm. They discuss the design of algorithms, and their efficiency and correctness, the inherent limitations of algorithms and computation, quantum algorithms, concurrency, large systems and artificial intelligence. Throughout, the authors, in their own words, stress the ‘fundamental and robust nature of the science in a form that is virtually independent of the details of specific computers, languages and formalisms'. This version of the book is published to celebrate 25 years since its first edition, and in honor of the Alan M. Turing Centennial year. Turing was a true pioneer of computer science, whose work forms the underlying basis of much of this book.
R 1,603.98

R 611.00

R 735.00

R 367.00

R 764.00



Graph Algorithms
Learn how graph algorithms can help you leverage relationships within your data to develop intelligent solutions and enhance your machine learning models. With this practical guide, developers and data scientists will discover how graph analytics deliver value, whether they’re used for building dynamic network models or forecasting real-world behavior. Mark Needham and Amy Hodler from Neo4j explain how graph algorithms describe complex structures and reveal difficult-to-find patterns—from finding vulnerabilities and bottlenecks to detecting communities and improving machine learning predictions. You’ll walk through hands-on examples that show you how to use graph algorithms in Apache Spark and Neo4j, two of the most common choices for graph analytics. Learn how graph analytics reveal more predictive elements in today’s data Understand how popular graph algorithms work and how they’re applied Use sample code and tips from more than 20 graph algorithm examples Learn which algorithms to use for different types of questions Explore examples with working code and sample datasets for Spark and Neo4j Create an ML workflow for link prediction by combining Neo4j and Spark
R 1,824.00

R 945.95


Algorithms and Data Structures
This is a central topic in any computer science curriculum. To distinguish this textbook from others, the author considers probabilistic methods as being fundamental for the construction of simple and efficient algorithms, and in each chapter at least one problem is solved using a randomized algorithm. Data structures are discussed to the extent needed for the implementation of the algorithms. The specific algorithms examined were chosen because of their wide field of application.This book originates from lectures for undergraduate and graduate students. The text assumes experience in programming algorithms, especially with elementary data structures such as chained lists, queues, and stacks. It also assumes familiarity with mathematical methods, although the author summarizes some basic notations and results from probability theory and related mathematical terminology in the appendices. He includes many examples to explain the individual steps of the algorithms, and he concludes each chapter with numerous exercises.
R 2,373.96




R 1,527.00

R 1,527.00
















































