Search results for "Data Structures and Algorithms in Java"
Items we need to order for you
Data Structures and Algorithms in Java
Learn with confidence with this hands-on undergraduate textbook for CS2 courses. Active-learning and real-world projects underpin each chapter, briefly reviewing programming fundamentals then progressing to core data structures and algorithms topics including recursion, lists, stacks, trees, graphs, sorting, and complexity analysis. Creative projects and applications put theoretical concepts into practice, helping students master the fundamentals. Dedicated project chapters supply further programming practice using real-world, interdisciplinary problems which students can showcase in their own online portfolios. Example Interview Questions sections prepare students for job applications. The pedagogy supports self-directed and skills-based learning with over 250 'Try It Yourself' boxes, many with solutions provided, and over 500 progressively challenging end-of-chapter questions. Written in a clear and engaging style, this textbook is a complete resource for teaching the fundamental skills that today's students need. Instructor resources are available online, including a test bank, solutions manual, and sample code.
R 2,707.00
R 916.00
R 1,527.00
R 1,221.00
R 184.00
R 1,527.00
R 356.01
R 2,211.00
R 1,831.00
R 327.00
R 764.00
R 610.00
R 608.00
Structure and Interpretation of Computer Programs
Structure and Interpretation of Computer Programs has had a dramatic impact on computer science curricula over the past decade. This long-awaited revision contains changes throughout the text. There are new implementations of most of the major programming systems in the book, including the interpreters and compilers, and the authors have incorporated many small changes that reflect their experience teaching the course at MIT since the first edition was published. A new theme has been introduced that emphasizes the central role played by different approaches to dealing with time in computational models: objects with state, concurrent programming, functional programming and lazy evaluation, and nondeterministic programming. There are new example sections on higher-order procedures in graphics and on applications of stream processing in numerical programming, and many new exercises. In addition, all the programs have been reworked to run in any Scheme implementation that adheres to the IEEE standard.
R 2,878.00
R 1,527.00
Algorithms: Design Techniques And Analysis
Problem solving is an essential part of every scientific discipline. It has two components: (1) problem identification and formulation, and (2) solution of the formulated problem. One can solve a problem on its own using ad hoc techniques or follow those techniques that have produced efficient solutions to similar problems. This requires the understanding of various algorithm design techniques, how and when to use them to formulate solutions and the context appropriate for each of them. This book advocates the study of algorithm design techniques by presenting most of the useful algorithm design techniques and illustrating them through numerous examples.
R 5,036.86
R 1,496.00
Language and the Rise of the Algorithm
A wide-ranging history of the algorithm.Bringing together the histories of mathematics, computer science, and linguistic thought, Language and the Rise of the Algorithm reveals how recent developments in artificial intelligence are reopening an issue that troubled mathematicians well before the computer age: How do you draw the line between computational rules and the complexities of making systems comprehensible to people? By attending to this question, we come to see that the modern idea of the algorithm is implicated in a long history of attempts to maintain a disciplinary boundary separating technical knowledge from the languages people speak day to day. Here, Jeffrey M. Binder offers a compelling tour of four visions of universal computation that addressed this issue in very different ways: G. W. Leibniz’s calculus ratiocinator; a universal algebra scheme Nicolas de Condorcet designed during the French Revolution; George Boole’s nineteenth-century logic system; and the early programming language ALGOL, short for algorithmic language. These episodes show that symbolic computation has repeatedly become entangled in debates about the nature of communication. Machine learning, in its increasing dependence on words, erodes the line between technical and everyday language, revealing the urgent stakes underlying this boundary. The idea of the algorithm is a levee holding back the social complexity of language, and it is about to break. This book is about the flood that inspired its construction.
R 1,161.00
Introduction to Genetic Algorithms
Genetic algorithms have been used in science and engineering as adaptive algorithms for solving practical problems and as computational models of natural evolutionary systems. This brief, accessible introduction describes some of the most interesting research in the field and also enables readers to implement and experiment with genetic algorithms on their own. It focuses in depth on a small set of important and interesting topics-particularly in machine learning, scientific modeling, and artificial life-and reviews a broad span of research, including the work of Mitchell and her colleagues. The descriptions of applications and modeling projects stretch beyond the strict boundaries of computer science to include dynamical systems theory, game theory, molecular biology, ecology, evolutionary biology, and population genetics, underscoring the exciting "general purpose" nature of genetic algorithms as search methods that can be employed across disciplines. An Introduction to Genetic Algorithms is accessible to students and researchers in any scientific discipline. It includes many thought and computer exercises that build on and reinforce the reader's understanding of the text. The first chapter introduces genetic algorithms and their terminology and describes two provocative applications in detail. The second and third chapters look at the use of genetic algorithms in machine learning (computer programs, data analysis and prediction, neural networks) and in scientific models (interactions among learning, evolution, and culture; sexual selection; ecosystems; evolutionary activity). Several approaches to the theory of genetic algorithms are discussed in depth in the fourth chapter. The fifth chapter takes up implementation, and the last chapter poses some currently unanswered questions and surveys prospects for the future of evolutionary computation.
R 1,530.08
R 1,527.00
Computational Algorithms for Fingerprint Recognition
Biometrics such as fingerprint, face, gait, iris, voice and signature, recognizes one's identity using his/her physiological or behavioral characteristics. Among these biometric signs, fingerprint has been researched the longest period of time, and shows the most promising future in real-world applications. However, because of the complex distortions among the different impressions of the same finger, fingerprint recognition is still a challenging problem. Computational Algorithms for Fingerprint Recognition presents an entire range of novel computational algorithms for fingerprint recognition. These include feature extraction, indexing, matching, classification, and performance prediction/validation methods, which have been compared with state-of-art algorithms and found to be effective and efficient on real-world data. All the algorithms have been evaluated on NIST-4 database from National Institute of Standards and Technology (NIST). Specific algorithms addressed include:-Learned template based minutiae extraction algorithm, -Triplets of minutiae based fingerprint indexing algorithm, -Genetic algorithm based fingerprint matching algorithm, -Genetic programming based feature learning algorithm for fingerprint classification, -Comparison of classification and indexing based approaches for identification, -Fundamental fingerprint matching performance prediction analysis and its validation.Computational Algorithms for Fingerprint Recognition is designed for a professional audience composed of researchers and practitioners in industry. This book is also suitable as a secondary text for graduate-level students in computer science and engineering.
R 3,024.26
Algorithmic Probability and Friends. Bayesian Prediction and Artificial Intelligence
Algorithmic probability and friends: Proceedings of the Ray Solomonoff 85th memorial conference is a collection of original work and surveys. The Solomonoff 85th memorial conference was held at Monash University's Clayton campus in Melbourne, Australia as a tribute to pioneer, Ray Solomonoff (1926-2009), honouring his various pioneering works - most particularly, his revolutionary insight in the early 1960s that the universality of Universal Turing Machines (UTMs) could be used for universal Bayesian prediction and artificial intelligence (machine learning). This work continues to increasingly influence and under-pin statistics, econometrics, machine learning, data mining, inductive inference, search algorithms, data compression, theories of (general) intelligence and philosophy of science - and applications of these areas. Ray not only envisioned this as the path to genuine artificial intelligence, but also, still in the 1960s, anticipated stages of progress in machine intelligence which would ultimately lead to machines surpassing human intelligence. Ray warned of the need to anticipate and discuss the potential consequences - and dangers - sooner rather than later. Possibly foremostly, Ray Solomonoff was a fine, happy, frugal and adventurous human being of gentle resolve who managed to fund himself while electing to conduct so much of his paradigm-changing research outside of the university system. The volume contains 35 papers pertaining to the abovementioned topics in tribute to Ray Solomonoff and his legacy.
R 2,200.20
R 180.00
Computational Algorithms for Fingerprint Recognition
Biometrics such as fingerprint, face, gait, iris, voice and signature, recognizes one's identity using his/her physiological or behavioral characteristics. Among these biometric signs, fingerprint has been researched the longest period of time, and shows the most promising future in real-world applications. However, because of the complex distortions among the different impressions of the same finger, fingerprint recognition is still a challenging problem. Computational Algorithms for Fingerprint Recognition presents an entire range of novel computational algorithms for fingerprint recognition. These include feature extraction, indexing, matching, classification, and performance prediction/validation methods, which have been compared with state-of-art algorithms and found to be effective and efficient on real-world data. All the algorithms have been evaluated on NIST-4 database from National Institute of Standards and Technology (NIST). Specific algorithms addressed include:-Learned template based minutiae extraction algorithm, -Triplets of minutiae based fingerprint indexing algorithm, -Genetic algorithm based fingerprint matching algorithm, -Genetic programming based feature learning algorithm for fingerprint classification, -Comparison of classification and indexing based approaches for identification, -Fundamental fingerprint matching performance prediction analysis and its validation.Computational Algorithms for Fingerprint Recognition is designed for a professional audience composed of researchers and practitioners in industry. This book is also suitable as a secondary text for graduate-level students in computer science and engineering.
R 3,024.09
