Search results for "Computer Science Academy"
Items we need to order for you
Logic And Language Models For Computer Science (Third Edition)
This text presents the formal concepts underlying Computer Science.It starts with a wide introduction to Logic with an emphasis on reasoning and proof, with chapters on Program Verification and Prolog.The treatment of computability with Automata and Formal Languages stands out in several ways:The style is appropriate for both undergraduate and graduate classes.
R 2,048.70
R 458.00
Computer Science – CACIC 2020
This book constitutes revised selected papers from the 26th Argentine Congress on Computer Science, CACIC 2020, held in San Justo, Buenos Aires, Argentina in October 2020. Due to the COVID-19 pandemic the conference was held in a virtual mode. The 21 full papers and 3 short papers presented in this volume were carefully reviewed and selected from a total of 118 submissions. They were organized in topical sections named: intelligent agents and systems; distributed and parallel processing; computer technology applied to education; graphic computation, images and visualization; software engineering; databases and data mining; hardware architectures, networks, and operating systems; innovation in software systems; signal processing and real-time systems; innovation in computer science education; computer security; and digital governance and smart cities.
R 1,569.31
R 2,137.00
Problems With A Point: Exploring Math And Computer Science
'Points, questions, stories, and occasional rants introduce the 24 chapters of this engaging volume. With a focus on mathematics and peppered with a scattering of computer science settings, the entries range from lightly humorous to curiously thought-provoking. Each chapter includes sections and sub-sections that illustrate and supplement the point at hand. Most topics are self-contained within each chapter, and a solid high school mathematics background is all that is needed to enjoy the discussions. There certainly is much to enjoy here.'CHOICEEver notice how people sometimes use math words inaccurately? Or how sometimes you instinctively know a math statement is false (or not known)?Each chapter of this book makes a point like those above and then illustrates the point by doing some real mathematics through step-by-step mathematical techniques.This book gives readers valuable information about how mathematics and theoretical computer science work, while teaching them some actual mathematics and computer science through examples and exercises. Much of the mathematics could be understood by a bright high school student. The points made can be understood by anyone with an interest in math, from the bright high school student to a Field's medal winner.
R 1,408.40
R 771.47
R 455.00
Computer Science – Theory and Applications
This book constitutes the proceedings of the 13th International Computer Science Symposium in Russia, CSR 2018, held in Moscow, Russia, in May 2018.The 24 full papers presented together with 7 invited lectures were carefully reviewed and selected from 42 submissions. The papers cover a wide range of topics such as algorithms and data structures; combinatorial optimization; constraint solving; computational complexity; cryptography; combinatorics in computer science; formal languages and automata; algorithms for concurrent and distributed systems; networks; and proof theory and applications of logic to computer science.
R 4,283.82
Discrete Mathematics for Computer Science
Discrete Mathematics for Computer Science: An Example-Based Introduction is intended for a first- or second-year discrete mathematics course for computer science majors. It covers many important mathematical topics essential for future computer science majors, such as algorithms, number representations, logic, set theory, Boolean algebra, functions, combinatorics, algorithmic complexity, graphs, and trees. Features Designed to be especially useful for courses at the community-college level Ideal as a first- or second-year textbook for computer science majors, or as a general introduction to discrete mathematics Written to be accessible to those with a limited mathematics background, and to aid with the transition to abstract thinking Filled with over 200 worked examples, boxed for easy reference, and over 200 practice problems with answers Contains approximately 40 simple algorithms to aid students in becoming proficient with algorithm control structures and pseudocode Includes an appendix on basic circuit design which provides a real-world motivational example for computer science majors by drawing on multiple topics covered in the book to design a circuit that adds two eight-digit binary numbersJon Pierre Fortney graduated from the University of Pennsylvania in 1996 with a BA in Mathematics and Actuarial Science and a BSE in Chemical Engineering. Prior to returning to graduate school, he worked as both an environmental engineer and as an actuarial analyst. He graduated from Arizona State University in 2008 with a PhD in Mathematics, specializing in Geometric Mechanics. Since 2012, he has worked at Zayed University in Dubai. This is his second mathematics textbook.
R 9,979.81
Computational Science/Intelligence and Applied Informatics
This book gathers the outcomes of the 6th ACIS International Conference on Computational Science/Intelligence & Applied Informatics (CSII 2019), which was held on May 29–31, 2019 in Honolulu, Hawaii. The aim of the conference was to bring together researchers and scientists, businesspeople and entrepreneurs, teachers, engineers, computer users, and students to discuss the various fields of computer science and to share their experiences and exchange new ideas and information in a meaningful way. Further, they presented research results on all aspects (theory, applications and tools) of computer and information science, and discussed the practical challenges encountered in their work and the solutions they adopted to overcome them. The book highlights the best papers from those accepted for presentation at the conference. They were chosen based on review scores submitted by members of the program committee and underwent further rigorous rounds of review. From this second round, 15 of the conference’s most promising papers were selected for this Springer (SCI) book and not the conference proceedings. We eagerly await the important contributions that we know these authors will make to the field of computer and information science.
R 4,262.03
R 782.00
Foundations of Software Technology and Theoretical Computer Science
This volume gives the proceedings of the Tenth Conference on Foundations of Software Technology and Theoretical Computer Science. These conferences are organized and run by the computer science research community in India, and their purpose is to provide a forum for professional interaction between members of this research community and their counterparts in different parts of the world. The volume includes four invited papers on: - reasoning about linear constraints using parametric queries, - the parallel evaluation of classes of circuits, - a theory of commonsense visual reasoning, - natural language processing, complexity theory and logic. The 26 submitted papers are organized into sections on logic, automata and formal languages, theory of programming, parallel algorithms, geometric algorithms, concurrency, distributed computing, and semantics.
R 1,594.28
R 1,628.00
R 1,073.00
Computer Science Education
Drawing together the most up-to-date research from experts all across the world, the second edition of Computer Science Education offers the most up-to-date coverage available on this developing subject, ideal for building confidence of new pre-service and in-service educators teaching a new discipline. It provides an international overview of key concepts, pedagogical approaches and assessment practices. Highlights of the second edition include:- New sections on machine learning and data-driven (epistemic) programming- A new focus on equity and inclusion in computer science education- Chapters updated throughout, including a revised chapter on relating ethical and societal aspects to knowledge-rich aspects of computer science education- A new set of chapters on the learning of programming, including design, pedagogy and misconceptions- A chapter on the way we use language in the computer science classroom. The book is structured to support the reader with chapter outlines, synopses and key points. Explanations of key concepts, real-life examples and reflective points keep the theory grounded in classroom practice. The book is accompanied by a companion website, including online summaries for each chapter, 3-minute video summaries by each author and an archived chapter on taxonomies and competencies from the first edition.
R 3,384.00
R 550.00
Maths Skills for GCSE Computer Science
The maths needed to succeed in GCSE Computer Science is harder now than ever before. Suitable for all awarding bodies, this practical handbook addresses all of the maths skills needed for GCSE Computer Science specifications. Worked examples, practice questions, 'remember points' and 'stretch yourself' questions give students the key knowledge and then the opportunity to practise and build confidence.
R 609.00
First Course In Probability For Computer And Data Science, A
In this undergraduate text, the author has distilled the core of probabilistic ideas and methods for computer and data science. The book emphasizes probabilistic and computational thinking rather than theorems and proofs. It provides insights and motivates the students by telling them why probability works and how to apply it.The unique features of the book are as follows:This book contains many worked examples. Numerous instructive problems scattered throughout the text are given along with problem-solving strategies. Several of the problems extend previously covered material. Answers to all problems and worked-out solutions to selected problems are also provided.Henk Tijms is the author of several textbooks in the area of applied probability and stochastic optimization. In 2008, he received the prestigious INFORMS Expository Writing Award for his work. He also contributed engaging probability puzzles to The New York Times' former Numberplay column.
R 3,226.06
GCSE Computer Science OCR Complete Revision & Practice
This CGP Complete Revision & Practice book is an excellent all-in-one guide to Grade 9-1 GCSE OCR Computer Science. Everything's explained in CGP's clear, friendly style, and there are plenty of warm-up questions and exam-style questions (with answers) to test students' understanding of each topic. What's more the book is rounded off with a set of practice papers - perfect preparation for the real thing. And finally, we've included a free Online Edition of the whole book - just use the code printed inside the cover to access it on a PC, Mac or tablet. Don't miss our fantastic OCR GCSE Computer Science Revision Question Cards (9781789085600) for even more practice!
R 536.00
Modern Trends and Techniques in Computer Science
This book is based on the research papers presented in the 3rd Computer Science On-line Conference 2014 (CSOC 2014). The conference is intended to provide an international forum for discussions on the latest high-quality research results in all areas related to Computer Science. The topics addressed are the theoretical aspects and applications of Artificial Intelligences, Computer Science, Informatics and Software Engineering. The authors provide new approaches and methods to real-world problems, and in particular, exploratory research that describes novel approaches in their field. Particular emphasis is laid on modern trends in selected fields of interest. New algorithms or methods in a variety of fields are also presented. This book is divided into three sections and covers topics including Artificial Intelligence, Computer Science and Software Engineering. Each section consists of new theoretical contributions and applications which can be used for the further development of knowledge of everybody who is looking for new knowledge or new inspiration for further research.
R 6,056.99
Foundations of Software Technology and Theoretical Computer Science
This volume gives the proceedings of the Tenth Conference on Foundations of Software Technology and Theoretical Computer Science. These conferences are organized and run by the computer science research community in India, and their purpose is to provide a forum for professional interaction between members of this research community and their counterparts in different parts of the world. The volume includes four invited papers on: - reasoning about linear constraints using parametric queries, - the parallel evaluation of classes of circuits, - a theory of commonsense visual reasoning, - natural language processing, complexity theory and logic. The 26 submitted papers are organized into sections on logic, automata and formal languages, theory of programming, parallel algorithms, geometric algorithms, concurrency, distributed computing, and semantics.
R 1,578.11
Computer Science and Education
This three-volume set constitues selected papers presented during the 17th International Conference on Computer Science and Education, ICCSE 2022, held in Ningbo, China, in August 2022.The 168 full papers and 43 short papers presented were thoroughly reviewed and selected from the 510 submissions. They focus on a wide range of computer science topics, especially AI, data science, and engineering, and technology-based education, by addressing frontier technical and business issues essential to the applications of data science in both higher education and advancing e-Society.
R 5,109.55
Computer Science Reconsidered
The Invocation Model of Process Expression argues that mathematics does not provide the most appropriate conceptual foundations for computer science, but, rather, that these foundations are a primary source of unnecessary complexity and confusion. It supports that there is a more appropriate conceptual model that unifies forms of expression considered quite disparate and simplifies issues considered complex and intractable. This book presents that this model of process expression is alternative theory of computer science that is both valid and practical.
R 4,688.00
Mathematical Foundations of Computer Science 2014
This two volume set LNCS 8634 and LNCS 8635 constitutes the refereed conference proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science, MFCS 2014, held in Budapest, Hungary, in August 2014. The 95 revised full papers presented together with 6 invited talks were carefully selected from 270 submissions. The focus of the conference was on following topics: Logic, Semantics, Automata, Theory of Programming, Algorithms, Complexity, Parallel and Distributed Computing, Quantum Computing, Automata, Grammars and Formal Languages, Combinatorics on Words, Trees and Games.
R 2,220.34
Computer science to the Point
This textbook is aimed at students of non-specialist courses with computer science components. Special emphasis is placed on the so-called life sciences, such as medical technology, rescue engineering, biotechnology, environmental engineering or process engineering. The textbook is suitable for readers in study and practice who want to get an introduction to computer science. The special feature of this book is the problem-based approach, as well as the exercises designed according to different taxonomy levels.
R 3,443.07
R 4,360.00
Computer Science and Education
This three-volume set constitues selected papers presented during the 17th International Conference on Computer Science and Education, ICCSE 2022, held in Ningbo, China, in August 2022.The 168 full papers and 43 short papers presented were thoroughly reviewed and selected from the 510 submissions. They focus on a wide range of computer science topics, especially AI, data science, and engineering, and technology-based education, by addressing frontier technical and business issues essential to the applications of data science in both higher education and advancing e-Society.
R 4,323.66
R 2,605.00
R 6,736.80
Computer Science – CACIC 2019
This book constitutes revised selected papers from the 25th Argentine Congress on Computer Science, CACIC 2019, held in Río Cuarto, Argentina, in October 2019.The 27 full papers presented in this volume were carefully reviewed and selected from a total of 185 submissions. They were organized in topical sections named: intelligent agents and systems; distributed and parallel processing; computer technology applied to education; graphic computation, images and visualization; software engineering; databases and data mining; hardware architectures, networks, and operating systems; innovation in software systems; signal processing and real-time systems; computer security; innovation in computer science education; and digital governance and smart cities.
R 1,580.46
OCR A Level Computer Science
Exam Board: OCRLevel: A-levelSubject: Computer ScienceFirst Teaching: September 2015First Exam: June 2016Develop confident students with our expert authors: their insight and guidance will ensure a thorough understanding of OCR A Level computer science, with challenging tasks and activities to test essential analytical and problem-solving skills. - Endorsed by OCR for use with the OCR AS and A Level Computer Science specification and written by a trusted and experienced author team, OCR Computer Science for A Level:- Builds students' understanding of the core topics and computing skills required by the course units - Computing Systems, Algorithms and Problem Solving, and Programming Project - with detailed topic coverage, case studies and regular questions to measure understanding - Develops a problem-solving approach based on computational thinking required at both AS and A Level - thought-provoking practice questions at the end of each chapter gives opportunities to probe more deeply into key topics- Incorporates full coverage of the skills and knowledge demanded by the examined units, with exercises to help students understand the assessment objectives and advice and examples to support them through the practical element of the course.
R 2,275.00
Mathematics of Discrete Structures for Computer Science
Mathematics plays a key role in computer science, some researchers would consider computers as nothing but the physical embodiment of mathematical systems. And whether you are designing a digital circuit, a computer program or a new programming language, you need mathematics to be able to reason about the design -- its correctness, robustness and dependability. This book covers the foundational mathematics necessary for courses in computer science.The common approach to presenting mathematical concepts and operators is to define them in terms of properties they satisfy, and then based on these definitions develop ways of computing the result of applying the operators and prove them correct. This book is mainly written for computer science students, so here the author takes a different approach: he starts by defining ways of calculating the results of applying the operators and then proves that they satisfy various properties. After justifying his underlying approach the author offers detailed chapters covering propositional logic, predicate calculus, sets, relations, discrete structures, structured types, numbers, and reasoning about programs.The book contains chapter and section summaries, detailed proofs and many end-of-section exercises -- key to the learning process. The book is suitable for undergraduate and graduate students, and although the treatment focuses on areas with frequent applications in computer science, the book is also suitable for students of mathematics and engineering.
R 2,365.27
Computer Science in Perspective
By presenting state-of-the-art aspects of theoretical computer science and practical applications in various fields, this book commemorates the 60th birthday of Thomas Ottmann. The 26 research papers presented span the whole range of Thomas Ottmann's scientific career, from formal languages to algorithms and data structures, from topics in practical computer science like software engineering or database systems to applications of Web technology, groupware, and e-learning.
R 2,015.00
Handbook of Research on Equity in Computer Science in P-16 Education
The growing trend for high-quality computer science in school curricula has drawn recent attention in classrooms. With an increasingly information-based and global society, computer science education coupled with computational thinking has become an integral part of an experience for all students, given that these foundational concepts and skills intersect cross-disciplinarily with a set of mental competencies that are relevant in their daily lives and work. While many agree that these concepts should be taught in schools, there are systematic inequities that exist to prevent students from accessing related computer science skills. The Handbook of Research on Equity in Computer Science in P-16 Education is a comprehensive reference book that highlights relevant issues, perspectives, and challenges in P-16 environments that relate to the inequities that students face in accessing computer science or computational thinking and examines methods for challenging these inequities in hopes of allowing all students equal opportunities for learning these skills. Additionally, it explores the challenges and policies that are created to limit access and thus reinforce systems of power and privilege. The chapters highlight issues, perspectives, and challenges faced in P-16 environments that include gender and racial imbalances, population of growing computer science teachers who are predominantly white and male, teacher preparation or lack of faculty expertise, professional development programs, and more. It is intended for teacher educators, K-12 teachers, high school counselors, college faculty in the computer science department, school administrators, curriculum and instructional designers, directors of teaching and learning centers, policymakers, researchers, and students.
R 10,434.96
Mathematics of Discrete Structures for Computer Science
Mathematics plays a key role in computer science, some researchers would consider computers as nothing but the physical embodiment of mathematical systems. And whether you are designing a digital circuit, a computer program or a new programming language, you need mathematics to be able to reason about the design -- its correctness, robustness and dependability. This book covers the foundational mathematics necessary for courses in computer science.The common approach to presenting mathematical concepts and operators is to define them in terms of properties they satisfy, and then based on these definitions develop ways of computing the result of applying the operators and prove them correct. This book is mainly written for computer science students, so here the author takes a different approach: he starts by defining ways of calculating the results of applying the operators and then proves that they satisfy various properties. After justifying his underlying approach the author offers detailed chapters covering propositional logic, predicate calculus, sets, relations, discrete structures, structured types, numbers, and reasoning about programs.The book contains chapter and section summaries, detailed proofs and many end-of-section exercises -- key to the learning process. The book is suitable for undergraduate and graduate students, and although the treatment focuses on areas with frequent applications in computer science, the book is also suitable for students of mathematics and engineering.
R 1,557.97
SOFSEM 2025: Theory and Practice of Computer Science
This book constitutes the proceedings of the 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, held in Bratislava, Slovak Republic, during January 20-23, 2025. The 48 full papers presented in this book were carefully reviewed and selected from 109 submissions. They include original research from all areas of foundations of computer science and artificial intelligence focusing on AI-based algorithms and techniques, nature-inspired computing, machine learning theory, multi-agent algorithms and games, neural network theory, parallel and distributed computing, quantum computing, computability, decidability, classical and non-classical models of computation, computational complexity, computational learning, cryptographic techniques and security, data compression, data and pattern mining methods, discrete combinatorial optimization, automata, languages, machine models, rewriting systems, efficient data structures, graph structure and algorithms, logics of computation, robotics, and other relevant theory topics in computing and AI.
R 2,951.58
Lectures On Discrete Mathematics For Computer Science
This textbook presents fundamental topics in discrete mathematics introduced from the perspectives of a pure mathematician and an applied computer scientist. The synergy between the two complementary perspectives is seen throughout the book; key concepts are motivated and explained through real-world examples, and yet are still formalized with mathematical rigor. The book is an excellent introduction to discrete mathematics for computer science, software engineering, and mathematics students.The first author is a leading mathematician in the area of logic, computability, and theoretical computer science, with more than 25 years of teaching and research experience. The second author is a computer science PhD student at the University of Washington specializing in database systems. The father-and-daughter team merges two different views to create a unified book for students interested in learning discrete mathematics, the connections between discrete mathematics and computer science, and the mathematical foundations of computer science.Readers will learn how to formally define abstract concepts, reason about objects (such as programs, graphs and numbers), investigate properties of algorithms, and prove their correctness. The textbook studies several well-known algorithmic problems including the path problem for graphs and finding the greatest common divisor, inductive definitions, proofs of correctness of algorithms via loop invariants and induction, the basics of formal methods such as propositional logic, finite state machines, counting, probability, as well as the foundations of databases such as relational calculus.
R 2,259.91
