Search results for "python exercises with data structures and algorithms"
Items we need to order for you
Python 3 Using DeepSeek
This book is your definitive guide to mastering DeepSeek, a leading open-source Large Language Model (LLM), and leveraging its power through practical Python programming. It is structured to build your expertise from foundational Python data structures and object-oriented programming to advanced model deployment.The initial chapters establish a strong technical base in Python's core features, including comprehensions, iterators, and the OOP paradigm. The focus then shifts entirely to DeepSeek, detailing its innovative Mixture-of-Experts (MoE) architecture, its superior performance on code-centric benchmarks like HumanEval, and its efficiency advantages. You will gain crucial insight into model management, specifically through the concept of quantization and local deployment with tools like Ollama, which is essential for maximizing performance while minimizing resource usage. The final chapter provides numerous, practical Python mini-projects, allowing you to immediately apply DeepSeek's capabilities to a range of real-world tasks from basic web scraping and data visualization to advanced object-oriented programming and linear regression.Python 3 Using DeepSeek is essential reading for Python developers (intermediate to advanced), machine learning practitioners, and data scientists. It is your guide to integrating high-performing, open-source LLMs into your workflows, particularly for code generation, algorithmic reasoning, and highly efficient local model deployment.
R 2,674.00
Algebraic Graph Algorithms
This textbook discusses the design and implementation of basic algebraic graph algorithms, and algebraic graph algorithms for complex networks, employing matroids whenever possible. The text describes the design of a simple parallel matrix algorithm kernel that can be used for parallel processing of algebraic graph algorithms. Example code is presented in pseudocode, together with case studies in Python and MPI. The text assumes readers have a background in graph theory and/or graph algorithms.
R 1,649.00
R 356.01
R 1,713.92
Space-Efficient Data Structures, Streams, and Algorithms
This Festschrift volume, published in honour of J. Ian Munro, contains contributions written by some of his colleagues, former students, and friends. In celebration of his 66th birthday the colloquium "Conference on Space Efficient Data Structures, Streams and Algorithms" was held in Waterloo, ON, Canada, during August 15-16, 2013. The articles presented herein cover some of the main topics of Ian's research interests. Together they give a good overall perspective of the last 40 years of research in algorithms and data structures.
R 2,188.29
Data Science and Analytics with Python
Since the first edition of “Data Science and Analytics with Python” we have witnessed an unprecedented explosion in the interest and development within the fields of Artificial Intelligence and Machine Learning. This surge has led to the widespread adoption of the book, not just among business practitioners, but also by universities as a key textbook. In response to this growth, this new edition builds upon the success of its predecessor, expanding several sections, updating the code to reflect the latest advancements in Python libraries and modules, and addressing the ever-evolving landscape of generative AI (GenAI).This updated edition ensures that the examples and exercises remain relevant by incorporating the latest features of popular libraries such as Scikit-learn, pandas, and Numpy. Additionally, new sections delve into cutting-edge topics like generative AI, reflecting the advancements and the expanding role these technologies play. This edition also addresses crucial issues of explainability, transparency, and fairness in AI. These topics have rightly gained significant attention in recent years. As AI integrates more deeply into various aspects of our lives, understanding and mitigating biases, ensuring fairness, and maintaining transparency become paramount. This book provides comprehensive coverage of these topics, offering practical insights and guidance for data scientists and analysts.Designed as a practical companion for data analysts and budding data scientists, this book assumes a working knowledge of programming and statistical modelling but aims to guide readers deeper into the wonders of data analytics and machine learning. Maintaining the book's structure, each chapter stands alone as much as possible, allowing readers to use it as a reference as well as a textbook. Whether revisiting fundamental concepts or diving into new, advanced topics, this book offers something valuable for every reader.
R 7,787.80
Construction of Fundamental Data Structures for Strings
This books reviews recent theoretical and practical advances on suffix sorting and introduces algorithmic solutions to problems of wide interest for the construction of fundamental data structures that operate efficiently on strings namely, constructing the suffix array, the longest common prefix (LCP) array, the document array and the Lyndon array. These data structures are the cornerstone of many algorithmic solutions in Bioiformatics, Information Retrieval and Data Compression. This book introduces the relevant problem areas, their importance, the notation and related algorithms and then presents the algorithmic solutions for indexing data structure constructions.This book is intended for graduate students, researchers and practitioners from Computer Science and Bioinformatics with a strong interest in algorithmic aspects.
R 2,198.00
Techniques for Designing and Analyzing Algorithms
Techniques for Designing and Analyzing Algorithms Design and analysis of algorithms can be a difficult subject for students due to its sometimes-abstract nature and its use of a wide variety of mathematical tools. Here the author, an experienced and successful textbook writer, makes the subject as straightforward as possible in an up-to-date textbook incorporating various new developments appropriate for an introductory course.This text presents the main techniques of algorithm design, namely, divide-and-conquer algorithms, greedy algorithms, dynamic programming algorithms, and backtracking. Graph algorithms are studied in detail, and a careful treatment of the theory of NP-completeness is presented. In addition, the text includes useful introductory material on mathematical background including order notation, algorithm analysis and reductions, and basic data structures. This will serve as a useful review and reference for students who have covered this material in a previous course.Features The first three chapters provide a mathematical review, basic algorithm analysis, and data structures Detailed pseudocode descriptions of the algorithms along with illustrative algorithms are included Proofs of correctness of algorithms are included when appropriate The book presents a suitable amount of mathematical rigorAfter reading and understanding the material in this book, students will be able to apply the basic design principles to various real-world problems that they may encounter in their future professional careers.
R 2,931.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
Intro to Python for Computer Science and Data Science
For introductory-level Python programming and/or data-science courses. A groundbreaking, flexible approach to computer science and data science The Deitels’ Introduction to Python for Computer Science and Data Science: Learning to Program with AI, Big Data and the Cloud offers a unique approach to teaching introductory Python programming, appropriate for both computer-science and data-science audiences. Providing the most current coverage of topics and applications, the book is paired with extensive traditional supplements as well as Jupyter Notebooks supplements. Real-world datasets and artificial-intelligence technologies allow students to work on projects making a difference in business, industry, government and academia. Hundreds of examples, exercises, projects (EEPs), and implementation case studies give students an engaging, challenging and entertaining introduction to Python programming and hands-on data science. The book's modular architecture enables instructors to conveniently adapt the text to a wide range of computer-science and data-science courses offered to audiences drawn from many majors. Computer-science instructors can integrate as much or as little data-science and artificial-intelligence topics as they'd like, and data-science instructors can integrate as much or as little Python as they'd like. The book aligns with the latest ACM/IEEE CS-and-related computing curriculum initiatives and with the Data Science Undergraduate Curriculum Proposal sponsored by the National Science Foundation.
R 5,413.00
Programming with Python for Social Scientists
As data become ′big′, fast and complex, the software and computing tools needed to manage and analyse them are rapidly developing. Social scientists need new tools to meet these challenges, tackle big datasets, while also developing a more nuanced understanding of - and control over - how these computing tools and algorithms are implemented. Programming with Python for Social Scientists offers a vital foundation to one of the most popular programming tools in computer science, specifically for social science researchers, assuming no prior coding knowledge. It guides you through the full research process, from question to publication, including:the fundamentals of why and how to do your own programming in social scientific research,questions of ethics and research design,a clear, easy to follow ′how-to′ guide to using Python, with a wide array of applications such as data visualisation, social media data research, social network analysis, and more.Accompanied by numerous code examples, screenshots, sample data sources, this is the textbook for social scientists looking for a complete introduction to programming with Python and incorporating it into their research design and analysis.
R 5,706.92
Data Structures for Computational Statistics
Since the beginning of the seventies computer hardware is available to use programmable computers for various tasks. During the nineties the hardware has developed from the big main frames to personal workstations. Nowadays it is not only the hardware which is much more powerful, but workstations can do much more work than a main frame, compared to the seventies. In parallel we find a specialization in the software. Languages like COBOL for business orientated programming or Fortran for scientific computing only marked the beginning. The introduction of personal computers in the eighties gave new impulses for even further development, already at the beginning of the seven ties some special languages like SAS or SPSS were available for statisticians. Now that personal computers have become very popular the number of pro grams start to explode. Today we will find a wide variety of programs for almost any statistical purpose (Koch & Haag 1995).
R 3,036.28
R 949.54
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
Advanced Data Structures
Advanced data structures is a core course in Computer Science which most graduate program in Computer Science, Computer Science and Engineering, and other allied engineering disciplines, offer during the first year or first semester of the curriculum. The objective of this course is to enable students to have the much-needed foundation for advanced technical skill, leading to better problem-solving in their respective disciplines. Although the course is running in almost all the technical universities for decades, major changes in the syllabus have been observed due to the recent paradigm shift of computation which is more focused on huge data and internet-based technologies. Majority of the institute has been redefined their course content of advanced data structure to fit the current need and course material heavily relies on research papers because of nonavailability of the redefined text book advanced data structure. To the best of our knowledge well-known textbook on advanced data structure provides only partial coverage of the syllabus. The book offers comprehensive coverage of the most essential topics, including: Part I details advancements on basic data structures, viz., cuckoo hashing, skip list, tango tree and Fibonacci heaps and index files. Part II details data structures of different evolving data domains like special data structures, temporal data structures, external memory data structures, distributed and streaming data structures. Part III elucidates the applications of these data structures on different areas of computer science viz, network, www, DBMS, cryptography, graphics to name a few. The concepts and techniques behind each data structure and their applications have been explained. Every chapter includes a variety of Illustrative Problems pertaining to the data structure(s) detailed, a summary of the technical content of the chapter and a list of Review Questions, to reinforce the comprehension of the concepts. The book could be used both as an introductory or an advanced-level textbook for the advanced undergraduate, graduate and research programmes which offer advanced data structures as a core or an elective course. While the book is primarily meant to serve as a course material for use in the classroom, it could be used as a starting point for the beginner researcher of a specific domain.
R 9,313.06
Learning JavaScript Data Structures and Algorithms
If you are a JavaScript developer or someone who has basic knowledge of JavaScript, and want to explore its optimum ability, this fast-paced book is definitely for you. Programming logic is the only thing you need to know to start having fun with algorithms.
R 1,661.00
Techniques for Designing and Analyzing Algorithms
Techniques for Designing and Analyzing Algorithms Design and analysis of algorithms can be a difficult subject for students due to its sometimes-abstract nature and its use of a wide variety of mathematical tools. Here the author, an experienced and successful textbook writer, makes the subject as straightforward as possible in an up-to-date textbook incorporating various new developments appropriate for an introductory course.This text presents the main techniques of algorithm design, namely, divide-and-conquer algorithms, greedy algorithms, dynamic programming algorithms, and backtracking. Graph algorithms are studied in detail, and a careful treatment of the theory of NP-completeness is presented. In addition, the text includes useful introductory material on mathematical background including order notation, algorithm analysis and reductions, and basic data structures. This will serve as a useful review and reference for students who have covered this material in a previous course.Features The first three chapters provide a mathematical review, basic algorithm analysis, and data structures Detailed pseudocode descriptions of the algorithms along with illustrative algorithms are included Proofs of correctness of algorithms are included when appropriate The book presents a suitable amount of mathematical rigorAfter reading and understanding the material in this book, students will be able to apply the basic design principles to various real-world problems that they may encounter in their future professional careers.
R 5,565.78
Guide to Programming and Algorithms Using R
This easy-to-follow textbook provides a student-friendly introduction to programming and algorithms. Emphasis is placed on the threshold concepts that present barriers to learning, including the questions that students are often too embarrassed to ask. The book promotes an active learning style in which a deeper understanding is gained from evaluating, questioning, and discussing the material, and practised in hands-on exercises. Although R is used as the language of choice for all programs, strict assumptions are avoided in the explanations in order for these to remain applicable to other programming languages. Features: provides exercises at the end of each chapter; includes three mini projects in the final chapter; presents a list of titles for further reading at the end of the book; discusses the key aspects of loops, recursions, program and algorithm efficiency and accuracy, sorting, linear systems of equations, and file processing; requires no prior background knowledge in this area.
R 1,539.34
R 592.46
Algorithms and Complexity
The papers in this volume were presented at the 5th Italian Conference on AlgorithmsandComplexity(CIAC2003). Theconferencetookplaceduring May 28-30, 2003, in Rome, Italy, at the Conference Centre of the University of Rome "La Sapienza. " CIAC started in 1990 as a national meeting to be held every three years for Italian researchers in algorithms, data structures, complexity theory, and parallelanddistributedcomputing. Duetoasigni?cantparticipationofforeign researchers, starting from the second edition, CIAC evolved into an international conference. However,alltheeditionsofCIAChavebeenheldinRome. The proceedings of CIAC were published by World Scienti?c for the ?rst edition and by Springer-Verlag in the Lecture Notes in Computer Science series (volumes 778,1203and1767)forthesubsequenteditions. Aselectionofthepapersofthe fourth edition was published in a special issue of Theoretical Computer Science Vol. 285(1),2002. Thisyearweexpecttopublishanextendedversionofselected papers presented at the conference in a special issue of the journal Theory of Computing Systems.In response to the call for papers for CIAC 2003, 57 papers were subm- ted, from which the Program Committee selected 23 papers for presentation at theconferencefrom18countries. Eachpaperwasevaluatedbyatleastthree Program Committee members with the help of 63 external reviewers. In addition to the selected papers, the Organizing Committee invited CharlesE. Leiserson(Cambridge),DavidPeleg(Rehovot),MichaelO. Rabin (CambridgeandJerusalem),JohnE. Savage(Providence),andLucaTrevisan (Berkeley)togiveplenarylecturesattheconference. Moreover,threetutorials byDavidPeleg,JaymeL. Szwarc?ter(RiodeJaneiro)andLucaTrevisanwere o?ered in the days preceding the conference. We wish to express our appreciation to all the authors of the submitted - pers, to the Program Committee members and the referees, to the Organizing Committee, and to the plenary and tutorial lecturers who accepted our in- tation.
R 2,015.00
New Data Structures and Algorithms for Logic Synthesis and Verification
This book introduces new logic primitives for electronic design automation tools. The author approaches fundamental EDA problems from a different, unconventional perspective, in order to demonstrate the key role of rethinking EDA solutions in overcoming technological limitations of present and future technologies. The author discusses techniques that improve the efficiency of logic representation, manipulation and optimization tasks by taking advantage of majority and biconditional logic primitives. Readers will be enabled to accelerate formal methods by studying core properties of logic circuits and developing new frameworks for logic reasoning engines.
R 2,102.27
Genetic Programming and Data Structures
Computers that `program themselves' has long been an aim of computer scientists. Recently genetic programming (GP) has started to show its promise by automatically evolving programs. Indeed in a small number of problems GP has evolved programs whose performance is similar to or even slightly better than that of programs written by people. The main thrust of GP has been to automatically create functions. While these can be of great use they contain no memory and relatively little work has addressed automatic creation of program code including stored data. This issue is the main focus of Genetic Programming, and Data Structures: Genetic Programming + Data Structures = Automatic Programming!. This book is motivated by the observation from software engineering that data abstraction (e.g., via abstract data types) is essential in programs created by human programmers. This book shows that abstract data types can be similarly beneficial to the automatic production of programs using GP. Genetic Programming and Data Structures: Genetic Programming + Data Structures = Automatic Programming! shows how abstract data types (stacks, queues and lists) can be evolved using genetic programming, demonstrates how GP can evolve general programs which solve the nested brackets problem, recognises a Dyck context free language, and implements a simple four function calculator. In these cases, an appropriate data structure is beneficial compared to simple indexed memory. This book also includes a survey of GP, with a critical review of experiments with evolving memory, and reports investigations of real world electrical network maintenance scheduling problems that demonstrate that Genetic Algorithms can find low cost viable solutions to such problems. Genetic Programming and Data Structures: Genetic Programming + Data Structures = Automatic Programming! should be of direct interest to computer scientists doing research on genetic programming, genetic algorithms, data structures, and artificial intelligence. In addition, this book will be of interest to practitioners working in all of these areas and to those interested in automatic programming.
R 4,653.57
R 611.00
Algorithmic Decision Making with Python Resources
This book describes Python3 programming resources for implementing decision aiding algorithms in the context of a bipolar-valued outranking approach. These computing resources, made available under the name Digraph3, are useful in the field of Algorithmic Decision Theory and more specifically in outranking-based Multiple-Criteria Decision Aiding (MCDA).The first part of the book presents a set of tutorials introducing the Digraph3 collection of Python3 modules and its main objects, such as bipolar-valued digraphs and outranking digraphs. In eight methodological chapters, the second part illustrates multiple-criteria evaluation models and decision algorithms. These chapters are largely problem-oriented and demonstrate how to edit a new multiple-criteria performance tableau, how to build a best choice recommendation, how to compute the winner of an election and how to make rankings or ratings using incommensurable criteria. The book’s third part presents three real-world decision case studies, while the fourth part addresses more advanced topics, such as computing ordinal correlations between bipolar-valued outranking digraphs, computing kernels in bipolar-valued digraphs, testing for confidence or stability of outranking statements when facing uncertain or solely ordinal criteria significance weights, and tempering plurality tyranny effects in social choice problems. The fifth and last part is more specifically focused on working with undirected graphs, tree graphs and forests. The closing chapter explores comparability, split, interval and permutation graphs.The book is primarily intended for graduate students in management sciences, computational statistics and operations research. The chapters presenting algorithms for ranking multicriteria performance records will be of computational interest for designers of web recommender systems. Similarly, the relative and absolute quantile-rating algorithms, discussed and illustrated in several chapters, will be of practical interest to public and private performance auditors.
R 3,500.15
Physics with Excel and Python
This book is intended to serve as a basic introduction to scientific computing by treating problems from various areas of physics - mechanics, optics, acoustics, and statistical reasoning in the context of the evaluation of measurements. After working through these examples, students are able to independently work on physical problems that they encounter during their studies. For every exercise, the author introduces the physical problem together with a data structure that serves as an interface to programming in Excel and Python. When a solution is achieved in one application, it can easily be translated into the other one and presumably any other platform for scientific computing. This is possible because the basic techniques of vector and matrix calculation and array broadcasting are also achieved with spreadsheet techniques, and logical queries and for-loops operate on spreadsheets from simple Visual Basic macros. So, starting to learn scientific calculation with Excel, e.g., at High School, is a targeted road to scientific computing. The primary target groups of this book are students with a major or minor subject in physics, who have interest in computational techniques and at the same time want to deepen their knowledge of physics. Math, physics and computer science teachers and Teacher Education students will also find a companion in this book to help them integrate computer techniques into their lessons. Even professional physicists who want to venture into Scientific Computing may appreciate this book.
R 2,587.73
Algorithms and Discrete Applied Mathematics
This book constitutes the proceedings of the 4th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2018, held in Guwahati, India, in February 2018. The 23 papers presented in this volume were carefully reviewed and selected from 68 submissions. They focus on topics related to efficient algorithms and data structures, their analysis (both theoretical and experimental). The mathematical problems arising thereof, and new applications of discrete mathematics, advances in existing applications and development of new tools for discrete mathematics.
R 2,176.81
Practical Computer Architecture with Python and ARM
Learn computer architecture with Python and ARM, simulating assembly program execution and designing a computer simulatorPurchase of the print or Kindle book includes a free PDF eBookKey FeaturesBuild a computer simulator with Python: Learn computer architecture by designing and constructing a simulatorPython for architecture: Use Python to simulate and execute assembly language instructionsARM programming on Raspberry Pi: Explore ARM assembly language and run programs on Raspberry PiBook DescriptionThis comprehensive guide offers a unique and immersive learning experience by combining Python programming with ARM architecture.Starting with an introduction to computer architecture and the flow of data within a computer system, you’ll progress to building your own interpreter using Python. You’ll see how this foundation enables the simulation of computer operations and learn ways to enhance a simulator by adding new instructions and displaying improved results.As you advance, you’ll explore the TC1 Assembler and Simulator Program to gain insights into instruction analysis and explore practical examples of simulators. This will help you build essential skills in understanding complex computer instructions, strengthening your grasp of computer architecture. Moreover, you’ll be introduced to the Raspberry Pi operating system, preparing you to delve into the detailed language of the ARM computer. This includes exploring the ARM instruction set architecture, data-processing instructions, subroutines, and the stack.With clear explanations, practical examples, and coding exercises, this resource will enable you to design and construct your own computer simulator, simulate assembly language programs, and leverage the Raspberry Pi for ARM programming.What you will learnMaster the core principles of computer architectureUnderstand the role of registers, memory, and data flow in computersDiscover how to design and implement a computer simulator using PythonSimulate and execute assembly language programs on the simulatorEnhance the simulator using new instructions for improved outputAnalyze complex computer instructions for deeper architectural understandingExplore the ARM instruction set and data processing on the Raspberry PiDevelop proficiency in writing, assembling, and running ARM code on the Raspberry PiWho this book is forThis book is for university students studying computer science, particularly those enrolled in a computer architecture module. With its practical approach and succinct explanations, it is also suitable for hobbyists, enthusiasts, and self-learners seeking a deeper understanding of computer systems. The book assumes foundational knowledge of number bases, binary arithmetic, and Boolean logic concepts. While it primarily caters to the computer science field, this book is less geared toward electrical or electronics engineering.
R 1,368.00
Supervised Learning with Python
Gain a thorough understanding of supervised learning algorithms by developing use cases with Python. You will study supervised learning concepts, Python code, datasets, best practices, resolution of common issues and pitfalls, and practical knowledge of implementing algorithms for structured as well as text and images datasets.You’ll start with an introduction to machine learning, highlighting the differences between supervised, semi-supervised and unsupervised learning. In the following chapters you’ll study regression and classification problems, mathematics behind them, algorithms like Linear Regression, Logistic Regression, Decision Tree, KNN, Naïve Bayes, and advanced algorithms like Random Forest, SVM, Gradient Boosting and Neural Networks. Python implementation is provided for all the algorithms. You’ll conclude with an end-to-end model development process including deployment and maintenance of the model.After reading Supervised Learning with Python you’ll have a broad understanding of supervised learning and its practical implementation, and be able to run the code and extend it in an innovative manner.What You'll LearnReview the fundamental building blocks and concepts of supervised learning using PythonDevelop supervised learning solutions for structured data as well as text and images Solve issues around overfitting, feature engineering, data cleansing, and cross-validation for building best fit modelsUnderstand the end-to-end model cycle from business problem definition to model deployment and model maintenance Avoid the common pitfalls and adhere to best practices while creating a supervised learning model using PythonWho This Book Is ForData scientists or data analysts interested in best practices and standards for supervised learning, and using classification algorithms and regression techniques to develop predictive models.
R 1,254.00
Fundamental Algorithms for Permutation Groups
This is the first-ever book on computational group theory.It provides extensive and up-to-date coverage of thefundamental algorithms for permutation groups with referenceto aspects of combinatorial group theory, soluble groups,and p-groups where appropriate.The book begins with a constructive introduction to grouptheory and algorithms for computing with small groups,followed by a gradual discussion of the basic ideas of Simsfor computing with very large permutation groups, andconcludes with algorithms that use group homomorphisms, asin the computation of Sylowsubgroups. No background ingroup theory is assumed.The emphasis is on the details of the data structures andimplementation which makes the algorithms effective whenapplied to realistic problems. The algorithms are developedhand-in-hand with the theoretical and practicaljustification.All algorithms are clearly described,examples are given, exercises reinforce understanding, anddetailed bibliographical remarks explain the history andcontext of the work.Much of the later material on homomorphisms, Sylowsubgroups, and soluble permutation groups is new.
R 1,683.72
Exercises in Graph Theory
This book supplements the textbook of the authors" Lectures on Graph The ory" [6] by more than thousand exercises of varying complexity. The books match each other in their contents, notations, and terminology. The authors hope that both students and lecturers will find this book helpful for mastering and verifying the understanding of the peculiarities of graphs. The exercises are grouped into eleven chapters and numerous sections accord ing to the topics of graph theory: paths, cycles, components, subgraphs, re constructibility, operations on graphs, graphs and matrices, trees, independence, matchings, coverings, connectivity, matroids, planarity, Eulerian and Hamiltonian graphs, degree sequences, colorings, digraphs, hypergraphs. Each section starts with main definitions and brief theoretical discussions. They constitute a minimal background, just a reminder, for solving the exercises. the presented facts and a more extended exposition may be found in Proofs of the mentioned textbook of the authors, as well as in many other books in graph theory. Most exercises are supplied with answers and hints. In many cases complete solutions are given. At the end of the book you may find the index of terms and the glossary of notations. The "Bibliography" list refers only to the books used by the authors during the preparation of the exercisebook. Clearly, it mentions only a fraction of available books in graph theory. The invention of the authors was also driven by numerous journal articles, which are impossible to list here.
R 6,819.02
R 916.00
Combinatorial Algorithms
This book constitutes the thoroughly referred post-workshop proceedings of the 23rd International Workshop on Combinatorial Algorithms, IWOCA 2012, held in Krishnankoil, Tamil Nadu, India, in July 2012.The 32 revised full papers presented were carefully reviewed and selected from a total of 88 submissions. The papers are organized in topical sections in algorithms and data Structures, applications (including Bioinformatics, Networking, etc.), combinatorics of words and strings, combinatorial optimization, combinatorial enumeration, decompositions and combinatorial designs, complexity theory (structural and computational), computational biology and graph theory and combinatorics submissions.
R 2,176.09
Foundations for Analytics with Python
If you're like many of Excel's 750 million users, you want to do more with your data-like repeating similar analyses over hundreds of files, or combining data in many files for analysis at one time. This practical guide shows ambitious non-programmers how to automate and scale the processing and analysis of data in different formats-by using Python. After author Clinton Brownley takes you through Python basics, you'll be able to write simple scripts for processing data in spreadsheets as well as databases. You'll also learn how to use several Python modules for parsing files, grouping data, and producing statistics. No programming experience is necessary.Create and run your own Python scripts by learning basic syntax Use Python's csv module to read and parse CSV files Read multiple Excel worksheets and workbooks with the xlrd module Perform database operations in MySQL or with the mysqlclient module Create Python applications to find specific records, group data, and parse text files Build statistical graphs and plots with matplotlib, pandas, ggplot, and seaborn Produce summary statistics, and estimate regression and classification models Schedule your scripts to run automatically in both Windows and Mac environments
R 1,557.00
Practical Python Data Wrangling and Data Quality
The world around us is full of data that holds unique insights and valuable stories, and this book will help you uncover them. Whether you already work with data or want to learn more about its possibilities, the examples and techniques in this practical book will help you more easily clean, evaluate, and analyze data so that you can generate meaningful insights and compelling visualizations.Complementing foundational concepts with expert advice, author Susan E. McGregor provides the resources you need to extract, evaluate, and analyze a wide variety of data sources and formats, along with the tools to communicate your findings effectively. This book delivers a methodical, jargon-free way for data practitioners at any level, from true novices to seasoned professionals, to harness the power of data.Use Python 3.8+ to read, write, and transform data from a variety of sourcesUnderstand and use programming basics in Python to wrangle data at scaleOrganize, document, and structure your code using best practicesCollect data from structured data files, web pages, and APIsPerform basic statistical analyses to make meaning from datasetsVisualize and present data in clear and compelling ways
R 1,824.00
R 1,172.00
Algorithms on Trees and Graphs
Graph algorithms is a well-established subject in mathematics and computer science. Beyond classical application fields, such as approximation, combinatorial optimization, graphics, and operations research, graph algorithms have recently attracted increased attention from computational molecular biology and computational chemistry. Centered around the fundamental issue of graph isomorphism, this text goes beyond classical graph problems of shortest paths, spanning trees, flows in networks, and matchings in bipartite graphs. Advanced algorithmic results and techniques of practical relevance are presented in a coherent and consolidated way. This book introduces graph algorithms on an intuitive basis followed by a detailed exposition in a literate programming style, with correctness proofs as well as worst-case analyses. Furthermore, full C++ implementations of all algorithms presented are given using the LEDA library of efficient data structures and algorithms.
R 3,640.62
Concise Introduction to Machine Learning
A Concise Introduction to Machine Learning uses mathematics as the common language to explain a variety of machine learning concepts from basic principles and illustrates every concept using examples in both Python and MATLAB®, which are available on GitHub and can be run from there in Binder in a web browser. Each chapter concludes with exercises to explore the content.The emphasis of the book is on the question of Why—only if “why” an algorithm is successful is understood, can it be properly applied and the results trusted. Standard techniques are treated rigorously, including an introduction to the necessary probability theory. This book addresses the commonalities of methods, aims to give a thorough and in-depth treatment and develop intuition for the inner workings of algorithms, while remaining concise.This useful reference should be essential on the bookshelf of anyone employing machine learning techniques, since it is born out of strong experience in university teaching and research on algorithms, while remaining approachable and readable.
R 8,335.25
WALCOM: Algorithms and Computation
This book constitutes the refereed proceedings of the Second International Workshop on Algorithms and Computation, WALCOM 2008, held in Dhaka, Bangladesh, in February 2008.The 19 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 57 submissions. The papers feature original research in the areas of algorithms and data structures, combinatorial algorithms, graph drawings and graph algorithms, parallel and distributed algorithms, string algorithms, computational geometry, graphs in bioinformatics and computational biology. The papers are organized in topical sections on bioinformatics algorithms, computational geometry and graph drawing, graph algorithms, and algorithm engineering.
R 1,549.61
Behavioral Data Analysis with R and Python
Harness the full power of the behavioral data in your company by learning tools specifically designed for behavioral data analysis. Common data science algorithms and predictive analytics tools treat customer behavioral data, such as clicks on a website or purchases in a supermarket, the same as any other data. Instead, this practical guide introduces powerful methods specifically tailored for behavioral data analysis.Advanced experimental design helps you get the most out of your A/B tests, while causal diagrams allow you to tease out the causes of behaviors even when you can't run experiments. Written in an accessible style for data scientists, business analysts, and behavioral scientists, this practical book provides complete examples and exercises in R and Python to help you gain more insight from your data--immediately.Understand the specifics of behavioral dataExplore the differences between measurement and predictionLearn how to clean and prepare behavioral dataDesign and analyze experiments to drive optimal business decisionsUse behavioral data to understand and measure cause and effectSegment customers in a transparent and insightful way
R 1,824.00
Algorithmic Decision Making with Python Resources
This book describes Python3 programming resources for implementing decision aiding algorithms in the context of a bipolar-valued outranking approach. These computing resources, made available under the name Digraph3, are useful in the field of Algorithmic Decision Theory and more specifically in outranking-based Multiple-Criteria Decision Aiding (MCDA).The first part of the book presents a set of tutorials introducing the Digraph3 collection of Python3 modules and its main objects, such as bipolar-valued digraphs and outranking digraphs. In eight methodological chapters, the second part illustrates multiple-criteria evaluation models and decision algorithms. These chapters are largely problem-oriented and demonstrate how to edit a new multiple-criteria performance tableau, how to build a best choice recommendation, how to compute the winner of an election and how to make rankings or ratings using incommensurable criteria. The book’s third part presents three real-world decision case studies, while the fourth part addresses more advanced topics, such as computing ordinal correlations between bipolar-valued outranking digraphs, computing kernels in bipolar-valued digraphs, testing for confidence or stability of outranking statements when facing uncertain or solely ordinal criteria significance weights, and tempering plurality tyranny effects in social choice problems. The fifth and last part is more specifically focused on working with undirected graphs, tree graphs and forests. The closing chapter explores comparability, split, interval and permutation graphs.The book is primarily intended for graduate students in management sciences, computational statistics and operations research. The chapters presenting algorithms for ranking multicriteria performance records will be of computational interest for designers of web recommender systems. Similarly, the relative and absolute quantile-rating algorithms, discussed and illustrated in several chapters, will be of practical interest to public and private performance auditors.
R 3,868.93
Scientific Computing with Python
Leverage this example-packed, comprehensive guide for all your Python computational needsKey FeaturesLearn the first steps within Python to highly specialized conceptsExplore examples and code snippets taken from typical programming situations within scientific computing.Delve into essential computer science concepts like iterating, object-oriented programming, testing, and MPI presented in strong connection to applications within scientific computing.Book DescriptionPython has tremendous potential within the scientific computing domain. This updated edition of Scientific Computing with Python features new chapters on graphical user interfaces, efficient data processing, and parallel computing to help you perform mathematical and scientific computing efficiently using Python.This book will help you to explore new Python syntax features and create different models using scientific computing principles. The book presents Python alongside mathematical applications and demonstrates how to apply Python concepts in computing with the help of examples involving Python 3.8. You'll use pandas for basic data analysis to understand the modern needs of scientific computing, and cover data module improvements and built-in features. You'll also explore numerical computation modules such as NumPy and SciPy, which enable fast access to highly efficient numerical algorithms. By learning to use the plotting module Matplotlib, you will be able to represent your computational results in talks and publications. A special chapter is devoted to SymPy, a tool for bridging symbolic and numerical computations.By the end of this Python book, you'll have gained a solid understanding of task automation and how to implement and test mathematical algorithms within the realm of scientific computing.What you will learnUnderstand the building blocks of computational mathematics, linear algebra, and related Python objectsUse Matplotlib to create high-quality figures and graphics to draw and visualize resultsApply object-oriented programming (OOP) to scientific computing in PythonDiscover how to use pandas to enter the world of data processingHandle exceptions for writing reliable and usable codeCover manual and automatic aspects of testing for scientific programmingGet to grips with parallel computing to increase computation speedWho this book is forThis book is for students with a mathematical background, university teachers designing modern courses in programming, data scientists, researchers, developers, and anyone who wants to perform scientific computation in Python.
R 1,498.00
Thermal Physics Tutorials with Python Simulations
This book provides an accessible introduction to thermal physics with computational approaches that complement the traditional mathematical treatments of classical thermodynamics and statistical mechanics. It guides readers through visualizations and simulations in the Python programming language, helping them to develop their own technical computing skills (including numerical and symbolic calculations, optimizations, recursive operations, and visualizations). Python is a highly readable and practical programming language, making this book appropriate for students without extensive programming experience.This book may serve as a thermal physics textbook for a semester-long undergraduate thermal physics course or may be used as a tutorial on scientific computing with focused examples from thermal physics. This book will also appeal to engineering students studying intermediate-level thermodynamics as well as computer science students looking to understand how to apply their computer programming skills to science.Key features Major concepts in thermal physics are introduced cohesively through computational and mathematical treatments. Computational examples in Python programming language guide students on how to simulate and visualize thermodynamic principles and processes for themselves.
R 5,634.95
Hands-On Deep Learning Algorithms with Python
Understand basic to advanced deep learning algorithms, the mathematical principles behind them, and their practical applications.Key FeaturesGet up-to-speed with building your own neural networks from scratch Gain insights into the mathematical principles behind deep learning algorithmsImplement popular deep learning algorithms such as CNNs, RNNs, and more using TensorFlowBook DescriptionDeep learning is one of the most popular domains in the AI space, allowing you to develop multi-layered models of varying complexities. This book introduces you to popular deep learning algorithms—from basic to advanced—and shows you how to implement them from scratch using TensorFlow. Throughout the book, you will gain insights into each algorithm, the mathematical principles behind it, and how to implement it in the best possible manner. The book starts by explaining how you can build your own neural networks, followed by introducing you to TensorFlow, the powerful Python-based library for machine learning and deep learning. Moving on, you will get up to speed with gradient descent variants, such as NAG, AMSGrad, AdaDelta, Adam, and Nadam. The book will then provide you with insights into RNNs and LSTM and how to generate song lyrics with RNN. Next, you will master the math for convolutional and capsule networks, widely used for image recognition tasks. Then you learn how machines understand the semantics of words and documents using CBOW, skip-gram, and PV-DM. Afterward, you will explore various GANs, including InfoGAN and LSGAN, and autoencoders, such as contractive autoencoders and VAE. By the end of this book, you will be equipped with all the skills you need to implement deep learning in your own projects.What you will learnImplement basic-to-advanced deep learning algorithmsMaster the mathematics behind deep learning algorithmsBecome familiar with gradient descent and its variants, such as AMSGrad, AdaDelta, Adam, and NadamImplement recurrent networks, such as RNN, LSTM, GRU, and seq2seq modelsUnderstand how machines interpret images using CNN and capsule networksImplement different types of generative adversarial network, such as CGAN, CycleGAN, and StackGANExplore various types of autoencoder, such as Sparse autoencoders, DAE, CAE, and VAEWho this book is forIf you are a machine learning engineer, data scientist, AI developer, or simply want to focus on neural networks and deep learning, this book is for you. Those who are completely new to deep learning, but have some experience in machine learning and Python programming, will also find the book very helpful.
R 1,335.00
