Search results for "Computer Science with C"
Items we need to order for you
Computer Science
Computer Science: The Hardware, Software and Heart of It focuses on the deeper aspects of the two recognized subdivisions of Computer Science, Software and Hardware. These subdivisions are shown to be closely interrelated as a result of the stored-program concept. Computer Science: The Hardware, Software and Heart of It includes certain classical theoretical computer science topics such as Unsolvability (e.g. the halting problem) and Undecidability (e.g. Godel’s incompleteness theorem) that treat problems that exist under the Church-Turing thesis of computation. These problem topics explain inherent limits lying at the heart of software, and in effect define boundaries beyond which computer science professionals cannot go beyond. Newer topics such as Cloud Computing are also covered in this book. After a survey of traditional programming languages (e.g. Fortran and C++), a new kind of computer Programming for parallel/distributed computing is presented using the message-passing paradigm which is at the heart of large clusters of computers. This leads to descriptions of current hardware platforms for large-scale computing, such as clusters of as many as one thousand which are the new generation of supercomputers. This also leads to a consideration of future quantum computers and a possible escape from the Church-Turing thesis to a new computation paradigm. The book’s historical context is especially helpful during this, the centenary of Turing's birth. Alan Turing is widely regarded as the father of Computer Science, since many concepts in both the hardware and software of Computer Science can be traced to his pioneering research. Turing was a multi-faceted mathematician-engineer and was able to work on both concrete and abstract levels. This book shows how these two seemingly disparate aspects of Computer Science are intimately related. Further, the book treats the theoretical side of Computer Science as well, which also derives from Turing's research. Computer Science: The Hardware, Software and Heart of It is designed as a professional book for practitioners and researchers working in the related fields of Quantum Computing, Cloud Computing, Computer Networking, as well as non-scientist readers. Advanced-level and undergraduate students concentrating on computer science, engineering and mathematics will also find this book useful.
R 2,015.00
R 1,704.89
Rigorous Software Development
Software errors can lead to catastrophic consequences, from financial losses to threats to human safety. As a result, rigorous methods for software development and validation have become increasingly critical. Program verification, a key area of formal methods, provides mathematical tools and techniques to ensure that software behaves as intended. This book provides a comprehensive introduction to program verification, combining theoretical foundations with practical applications using real-world tools. It offers a self-contained overview of propositional logic and first-order reasoning with theories, followed by a study of Hoare-style program logic with annotations and the generation of verification conditions. The use of Frama-C’s WP plug-in for verifying C programs annotated with the ACSL specification language, including safety properties, is also covered. This revised and expanded second edition incorporates recent advances in formal methods and program verification, integrating new techniques, tools, and exercises to equip readers with the skills necessary for rigorous software development.Rigorous Software Development is ideal for computer science students, researchers in formal methods, and software engineers seeking a deeper understanding of program verification techniques and tools. It equips readers with the knowledge needed to apply rigorous methods in practice while providing a solid foundation for the evolving landscape of modern software engineering.
R 2,381.00
Extreme-Scale Computing
Scientific computing is essential for tackling complex problems across many domains--but how can scientists develop high-performance and high-quality software that scales efficiently? This book serves as an accessible introduction to extreme-scale computing, specifically designed for domain scientists who may not have formal computer science training but need to harness the power of C++ and parallel computing for large-scale applications. The book begins by covering the fundamentals of scientific computing software management, including essential tools like Linux, Git, and CMake, before diving into a detailed exploration of C++ for extreme-scale computing. Readers familiar with languages like Python will gain the necessary skills to transition to C++ and build scalable, efficient software. Beyond basic programming, this book delves into hardware-aware computing, teaching readers how to optimize software performance by understanding the underlying architecture of modern computational systems. It then introduces parallel computing techniques, covering MPI for distributed memory parallelism, shared memory parallelism, CUDA for GPU programming, and Kokkos for performance portability. Further chapters focus on efficient I/O, debugging, and profiling, which all address aspects of the critical challenge of performance optimization in extreme-scale computing. The book concludes with an overview of popular libraries for extreme-scale computing, equipping readers with the tools they need to solve real-world computational problems. With a balance of theory, practical applications, and illustrative case studies, this book provides domain scientists with a comprehensive roadmap to mastering extreme-scale computing and developing highly parallel and performant software.
R 2,564.00
Advances in Computer Science, Engineering & Applications
The International conference series on Computer Science, Engineering & Applications (ICCSEA) aims to bring together researchers and practitioners from academia and industry to focus on understanding computer science, engineering and applications and to establish new collaborations in these areas. The Second International Conference on Computer Science, Engineering & Applications (ICCSEA-2012), held in Delhi, India, during May 25-27, 2012 attracted many local and international delegates, presenting a balanced mixture of intellect and research both from the East and from the West. Upon a strenuous peer-review process the best submissions were selected leading to an exciting, rich and a high quality technical conference program, which featured high-impact presentations in the latest developments of various areas of computer science, engineering and applications research.
R 12,089.00
R 458.00
Computational Thinking: A Perspective on Computer Science
This textbook is intended as a textbook for one-semester, introductory computer science courses aimed at undergraduate students from all disciplines. Self-contained and with no prerequisites, it focuses on elementary knowledge and thinking models. The content has been tested in university classrooms for over six years, and has been used in summer schools to train university and high-school teachers on teaching introductory computer science courses using computational thinking.This book introduces computer science from a computational thinking perspective. In computer science the way of thinking is characterized by three external and eight internal features, including automatic execution, bit-accuracy and abstraction. The book is divided into chapters on logic thinking, algorithmic thinking, systems thinking, and network thinking. It also covers societal impact and responsible computing material – from ICT industry to digital economy, from the wonder of exponentiation to wonder of cyberspace, and from code of conduct to best practices for independent work.The book’s structure encourages active, hands-on learning using the pedagogic tool Bloom's taxonomy to create computational solutions to over 200 problems of varying difficulty. Students solve problems using a combination of thought experiment, programming, and written methods. Only 300 lines of code in total are required to solve most programming problems in this book.
R 2,564.00
Cambridge International AS and A Level Computer Science Coursebook
This series is for the Cambridge International AS & A Level Computer Science syllabus (9618) for examination from 2021. Developed by an experienced author and examiner team and written for the international learner, this coursebook provides students with a structured and progressive guide to the theoretical and practical skills required by the syllabus. With an emphasis on developing computational skills, this resource helps build students' confidence in using a range of technology and programming languages. Detailed descriptions of concepts are reinforced with exercises, discussion points, and reflection questions with exam-style and past paper questions. Answers are found within the teacher's resource.
R 2,206.00
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
Computational Finance Using C and C#
Computational Finance Using C and C#: Derivatives and Valuation, Second Edition provides derivatives pricing information for equity derivatives, interest rate derivatives, foreign exchange derivatives, and credit derivatives. By providing free access to code from a variety of computer languages, such as Visual Basic/Excel, C++, C, and C#, it gives readers stand-alone examples that they can explore before delving into creating their own applications. It is written for readers with backgrounds in basic calculus, linear algebra, and probability. Strong on mathematical theory, this second edition helps empower readers to solve their own problems. *Features new programming problems, examples, and exercises for each chapter. *Includes freely-accessible source code in languages such as C, C++, VBA, C#, and Excel.. *Includes a new chapter on the history of finance which also covers the 2008 credit crisis and the use of mortgage backed securities, CDSs and CDOs. *Emphasizes mathematical theory.
R 2,972.00
Talking with Computers
In this lively series of essays, Tom Dean explores interesting fundamental topics in computer science with the aim of showing how computers and computer programs work and how the various subfields of computer science are connected. Along the way, he conveys his fascination with computers and enthusiasm for working in a field that has changed almost every aspect of our daily lives. The essays touch on a wide range of topics, from digital logic and machine language to artificial intelligence and searching the World Wide Web, considering such questions as: • How can a computer learn to recognize junk email? • What happens when you click on a link in a browser? • How can you program a robot to do two things at once? • Are there limits on what computers can do? The author invites readers to experiment with short programs written in several languages. Through these interactions he grounds the models and metaphors of computer science and makes the underlying computational ideas more concrete. The accompanying web site http://www.cs.brown.edu/~tld/talk/ provides easy access to code fragments from the book, tips on finding and installing software, links to online resources, exercises and sample lectures.
R 2,205.00
Computational Thinking: A Perspective on Computer Science
This textbook is intended as a textbook for one-semester, introductory computer science courses aimed at undergraduate students from all disciplines. Self-contained and with no prerequisites, it focuses on elementary knowledge and thinking models. The content has been tested in university classrooms for over six years, and has been used in summer schools to train university and high-school teachers on teaching introductory computer science courses using computational thinking.This book introduces computer science from a computational thinking perspective. In computer science the way of thinking is characterized by three external and eight internal features, including automatic execution, bit-accuracy and abstraction. The book is divided into chapters on logic thinking, algorithmic thinking, systems thinking, and network thinking. It also covers societal impact and responsible computing material – from ICT industry to digital economy, from the wonder of exponentiation to wonder of cyberspace, and from code of conduct to best practices for independent work.The book’s structure encourages active, hands-on learning using the pedagogic tool Bloom's taxonomy to create computational solutions to over 200 problems of varying difficulty. Students solve problems using a combination of thought experiment, programming, and written methods. Only 300 lines of code in total are required to solve most programming problems in this book.
R 2,015.00
Probability and Statistics for Computer Science
Comprehensive and thorough development of both probability and statistics for serious computer scientists; goal-oriented: "to present the mathematical analysis underlying probability results" Special emphases on simulation and discrete decision theory Mathematically-rich, but self-contained text, at a gentle pace Review of calculus and linear algebra in an appendix Mathematical interludes (in each chapter) which examine mathematical techniques in the context of probabilistic or statistical importance Numerous section exercises, summaries, historical notes, and Further Readings for reinforcement of content
R 5,111.00
Probabilistic and Statistical Methods in Computer Science
Probabilistic and Statistical Methods in Computer Science
R 3,030.71
Cambridge IGCSE™ and O Level Computer Science Programming Book for Java with Digital Access (2 Years)
This series supports learners through the Cambridge IGCSE™ and O Level Computer Science syllabuses (0478/0984/2210). Develop skills and confidence with our new programming book for Java. Created in response to the addition of Java as a programming language in the Cambridge IGCSE™ and O Level Computer Science syllabuses, this resource provides tailored support for students programming with Java. A three-tiered approach to programming tasks across the book provides scaffolded support for students of all levels of understanding. Answers are accessible in the 'Solutions' chapter in the digital part of the resource, enabling students to practise their programming skills in class or at home.
R 1,054.00
Connecting Discrete Mathematics and Computer Science
Computer science majors taking a non-programming-based course like discrete mathematics might ask 'Why do I need to learn this?' Written with these students in mind, this text introduces the mathematical foundations of computer science by providing a comprehensive treatment of standard technical topics while simultaneously illustrating some of the broad-ranging applications of that material throughout the field. Chapters on core topics from discrete structures – like logic, proofs, number theory, counting, probability, graphs – are augmented with around 60 'computer science connections' pages introducing their applications: for example, game trees (logic), triangulation of scenes in computer graphics (induction), the Enigma machine (counting), algorithmic bias (relations), differential privacy (probability), and paired kidney transplants (graphs). Pedagogical features include 'Why You Might Care' sections, quick-reference chapter guides and key terms and results summaries, problem-solving and writing tips, 'Taking it Further' asides with more technical details, and around 1700 exercises, 435 worked examples, and 480 figures.
R 3,133.00
Mathematical Foundations of Computer Science 2001
This volume contains papers selected for presentation at the 26th International Symposium on Mathematical Foundations of Computer Science - MFCS 2001, held in Mari'ansk'eL'azn?e, Czech Republic, August 27 - 31, 2001. MFCS 2001 was organized by the Mathematical Institute (Academy of S- ences of the Czech Republic), the Institute for Theoretical Computer Science (Charles University, Faculty of Mathematics and Physics), the Institute of C- puter Science (Academy of Sciences of the Czech Republic), and Action M Agency. It was supported by the European Research Consortium for Informatics and Mathematics, the Czech Research Consortium for Informatics and Ma- ematics, and the European Association for Theoretical Computer Science. We gratefully acknowledge the support of all these institutions. The series of MFCS symposia, organized on a rotating basis in Poland, S- vakia, and the Czech Republic, has a well-established tradition. The aim is to encourage high-quality research in all branches of theoretical computer science and bring together specialists who do not usually meet at specialized confer- ? ences.Previous meetings tookplace in Jablonna, 1972; Strbsk'e Pleso, 1973; J- wisin, 1974; Marian ' sk'eL'azn?e, 1975; Gdan 'sk, 1976; Tatransk'a Lomnica, 1977; Za- ? kopane, 1978; Olomouc, 1979; Rydzina, 1980; Strbsk'e Pleso, 1981; Prague, 1984; Bratislava, 1986; Karlovy Vary, 1988; Porabk , a-Kozubnik, 1989; Bansk'aBystrica, 1990; Kazimierz Dolny, 1991; Prague, 1992; Gdan 'sk, 1993; Ko?sice, 1994; Prague, 1995; Krak'ow, 1996; Bratislava, 1997; Brno, 1998; Szklarska Por,eba, 1999; and Bratislava, 2000.
R 3,108.29
Logic in Computer Science
Recent years have seen the development of powerful tools for verifying hardware and software systems, as companies worldwide realise the need for improved means of validating their products. There is increasing demand for training in basic methods in formal reasoning so that students can gain proficiency in logic-based verification methods. The second edition of this successful textbook addresses both those requirements, by continuing to provide a clear introduction to formal reasoning which is both relevant to the needs of modern computer science and rigorous enough for practical application. Improvements to the first edition have been made throughout, with extra and expanded sections on SAT solvers, existential/universal second-order logic, micro-models, programming by contract and total correctness. The coverage of model-checking has been substantially updated. Further exercises have been added. Internet support for the book includes worked solutions for all exercises for teachers, and model solutions to some exercises for students.
R 2,978.00
Theoretical Computer Science
The 9th Italian Conference on Theoretical Computer Science (ICTCS 2005)was held at the Certosa di Pontignano, Siena, Italy, on October 12-14 2005. The Certosa di Pontignano is the conference center of the University of Siena; it is located 8 km away from the town and it is in the Chianti region. The Certosa is a place full of history (founded in the 15th century, it was set on ?re a century later and reconstructed) and of valuable artworks, like frescoes of the Scuola Senese. Previous conferences took place in Pisa (1972), Mantova (1974 and 1989), L'Aquila(1992),Ravello(1995),Prato(1998),Turin(2001)andBertinoro(2003). Theconferenceaimsatbringingtogethercomputerscientists,especiallyyoung researchers, to foster cooperation, exchange of ideas and results. Great e?orts have been made to attract researchers from all over the world. The main t- ics of the conference cover all the ?elds of theoretical computer science and include analysis and design of algorithms, computability, computational c- plexity, cryptography, formal languages and automata, foundations of progr- ming languages and program analysis, foundations of arti?cial intelligence and knowledge representation, foundations of web programming, natural computing paradigms (quantum computing, bioinformatics), parallel and distributed c- putation, program speci?cation and veri?cation, term rewriting, theory of c- currency, theory of data bases, theory of logical design and layout, type theory, security, and symbolic and algebraic computation.
R 1,577.39
R 4,273.00
Mathematical Foundations of Computer Science 2000
This volume contains papers selected for presentation at the Silver Jubilee 25th Symposium on Mathematical Foundations of Computer Science | MFCS 2000, held in Bratislava, Slovakia, August 28 { September 1, 2000. MFCS 2000 was organized under the auspices of the Minister of Education of the Slovak Republic, Milan Ft a cnik, by the Slovak Society for Computer Science, and the Comenius University in Bratislava, in cooperation with other institu- ons in Slovakia. It was supported by the European Association for Theoretical Computer Science, the European Research Consortium for Informatics and - thematics, and the Slovak Research Consortium for Informatics and Mathe- tics. The series of MFCS symposia, organized alternately in the Czech Republic, Poland, and Slovakia since 1972, has a well-established tradition. The MFCS symposia encourage high-quality research in all branches of theoretical computer science. Their broad scope provides an opportunity of bringing together spec- lists who do not usually meet at specialized conferences.The previous meetings took place in Jablonna, 1972; Strbsk e Pleso, 1973; Jadwisin, 1974; Mari ansk e L azn e, 1975; Gdansk, 1976; Tatransk a Lomnica, 1977; Zakopane, 1978; Olomouc, 1979; Rydzina, 1980; Strbsk e Pleso, 1981; Prague, 1984; Bratislava, 1986; C- lsbad, 1988; Porabk a-Kozubnik, 1989; Bansk a Bystrica, 1990; Kazimierz Dolny, 1991; Prague, 1992; Gdansk, 1993, Ko sice, 1994; Prague, 1995; Krak ow, 1996; Bratislava, 1997; Brno, 1998; and Szklarska Poreba, 1999.
R 3,993.00
R 1,527.00
Fundamentals of Stream Processing
Stream processing is a novel distributed computing paradigm that supports the gathering, processing and analysis of high-volume, heterogeneous, continuous data streams, to extract insights and actionable results in real time. This comprehensive, hands-on guide combining the fundamental building blocks and emerging research in stream processing is ideal for application designers, system builders, analytic developers, as well as students and researchers in the field. This book introduces the key components of the stream computing paradigm, including the distributed system infrastructure, the programming model, design patterns and streaming analytics. The explanation of the underlying theoretical principles, illustrative examples and implementations using the IBM InfoSphere Streams SPL language and real-world case studies provide students and practitioners with a comprehensive understanding of such applications and the middleware that supports them.
R 4,683.69
Transactions on Computational Science II
The denotational and expressive needs in cognitive informatics, computational intelligence, software engineering, and knowledge engineering have led to the development of new forms of mathematics collectively known as denotational mathematics. Denotational mathematics is a category of mathematical structures that formalize rigorous expressions and long-chain inferences of system compositions and behaviors with abstract concepts, complex relations, and dynamic processes. Typical paradigms of denotational mathematics are concept algebra, system algebra, Real-Time Process Algebra (RTPA), Visual Semantic Algebra (VSA), fuzzy logic, and rough sets. A wide range of applications of denotational mathematics have been identified in many modern science and engineering disciplines that deal with complex and intricate mathematical entities and structures beyond numbers, Boolean variables, and traditional sets. This issue of Springer’s Transactions on Computational Science on Denotational Mathematics for Computational Intelligence presents a snapshot of current research on denotational mathematics and its engineering applications. The volume includes selected and extended papers from two international conferences, namely IEEE ICCI 2006 (on Cognitive Informatics) and RSKT 2006 (on Rough Sets and Knowledge Technology), as well as new contributions. The following four important areas in denotational mathem- ics and its applications are covered: Foundations and applications of denotational mathematics, focusing on: a) c- temporary denotational mathematics for computational intelligence; b) deno- tional mathematical laws of software; c) a comparative study of STOPA and RTPA; and d) a denotational mathematical model of abstract games.
R 1,550.49
R 1,628.00
Mathematical Foundations of Computer Science 2004
This volume contains the papers presented at the 29th Symposium on Mat- matical Foundations of Computer Science, MFCS 2004, held in Prague, Czech Republic, August 22–27, 2004. The conference was organized by the Institute for Theoretical Computer Science (ITI) and the Department of Theoretical Com- terScienceandMathematicalLogic(KTIML)oftheFacultyofMathematicsand Physics of Charles University in Prague. It was supported in part by the Eu- pean Association for Theoretical Computer Science (EATCS) and the European Research Consortium for Informatics and Mathematics (ERCIM). Traditionally, the MFCS symposia encourage high-quality research in all branches of theoretical computer science. Ranging in scope from automata, f- mal languages, data structures, algorithms and computational geometry to c- plexitytheory,modelsofcomputation,andapplicationsincludingcomputational biology, cryptography, security and arti?cial intelligence, the conference o?ers a unique opportunity to researchers from diverse areas to meet and present their results to a general audience. The scienti?c program of this year’s MFCS took place in the lecture halls of the recently reconstructed building of the Faculty of Mathematics and P- sics in the historical center of Prague, with the famous Prague Castle and other celebratedhistoricalmonumentsinsight.Theviewfromthewindowswasach- lengingcompetitionforthespeakersinthe?ghtfortheattentionoftheaudience. But we did not fear the result: Due to the unusually tough competition for this year’s MFCS, the admitted presentations certainly attracted considerable in- rest. The conference program (and the proceedings) consisted of 60 contributed papers selected by the Program Committee from a total of 167 submissions.
R 3,138.13
Probability and Statistics for Computer Science
This textbook is aimed at computer science undergraduates late in sophomore or early in junior year, supplying a comprehensive background in qualitative and quantitative data analysis, probability, random variables, and statistical methods, including machine learning.With careful treatment of topics that fill the curricular needs for the course, Probability and Statistics for Computer Science features:• A treatment of random variables and expectations dealing primarily with the discrete case.• A practical treatment of simulation, showing how many interesting probabilities and expectations can be extracted, with particular emphasis on Markov chains.• A clear but crisp account of simple point inference strategies (maximum likelihood; Bayesian inference) in simple contexts. This is extended to cover some confidence intervals, samples and populations for random sampling with replacement, and the simplest hypothesis testing.• A chapter dealing with classification, explaining why it’s useful; how to train SVM classifiers with stochastic gradient descent; and how to use implementations of more advanced methods such as random forests and nearest neighbors.• A chapter dealing with regression, explaining how to set up, use and understand linear regression and nearest neighbors regression in practical problems.• A chapter dealing with principal components analysis, developing intuition carefully, and including numerous practical examples. There is a brief description of multivariate scaling via principal coordinate analysis. • A chapter dealing with clustering via agglomerative methods and k-means, showing how to build vector quantized features for complex signals.Illustrated throughout, each main chapter includes many worked examples and other pedagogical elements such as boxed Procedures, Definitions, Useful Facts, and Remember This (short tips). Problems and Programming Exercises are at the end of each chapter, with a summary of what the reader should know. Instructor resources include a full set of model solutions for all problems, and an Instructor's Manual with accompanying presentation slides.
R 2,015.00
Cambridge IGCSE™ and O Level Computer Science Programming Book for Microsoft® Visual Basic with Digital Access (2 Years)
This series supports learners through the Cambridge IGCSE™ and O Level Computer Science syllabuses (0478/0984/2210). Develop skills and confidence with our programming book for Microsoft® Visual Basic. Created to support students undertaking the Cambridge IGCSE™ and O Level Computer Science syllabuses, this resource provides tailored support when programming with Microsoft® Visual Basic. A three-tiered approach to programming tasks across the book provides scaffolded support for students of all levels of understanding. Answers are accessible in the 'Solutions' chapter in the digital part of the resource, enabling students to practise their programming skills in class or at home.
R 1,054.00
Advanced Computing Techniques in Engineering and Technology
This volume constitutes the proceedings of 2nd International Conference on Advanced Computing Techniques in Engineering & Technology, ACTET 2025, in Jaipur, India, during February 12-13, 2025. The 30 full papers presented in this volume were carefully reviewed and selected from 106 submissions. They focus on all aspects of distributed computing, machine learning, optimization algorithms, and interdisciplinary applications of computing technologies.
R 2,567.30
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
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
Graph-Theoretic Concepts in Computer Science
The 28th International Workshop on Graph-Theoretic Concepts in Computer ? Science (WG 2002) was held in Cesky ´ Krumlov, a beautiful small town in the southern part of the Czech Republic on the river Vltava (Moldau), June 13–15, 2002. The workshop was organized by the Department of Applied Mathematics of the Faculty of Mathematics and Physics of Charles University in Prague. Since 1975, WG has taken place in Germany 20 times, twice in Austria and The Netherlands, and once in Italy, Slovakia, and Switzerland. As in previous years, the workshop aimed at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in Computer Science, or by extracting new problems from applications.The workshop was devoted to the theoretical and practical aspects of graph concepts in computer science, and its contributed talks showed how recent research results from algorithmic graph theory can be used in computer science and which graph-theoretic questions arise from new developments in computer science. Altogether 61 research papers were submitted and reviewed by the program committee. The program committee represented the wide scienti?c spectrum, and in a careful reviewing process with four reports per submission it selected 36papersforpresentationattheworkshop.Thereferees’commentsaswellasthe numerous fruitful discussions during the workshop have been taken into account by the authors of these conference proceedings.
R 2,015.00
Advances in Computer Science - ASIAN 2005. Data Management on the Web
The series of annual Asian Computing Science Conferences (ASIAN) was ini- ated in 1995 by AIT, INRIA and UNU/IIST to provide a forum for researchers in computer science from the Asian region and to promote interaction with - searchers from other regions. The ?rst nine conferences were held respectively in Bangkok, Singapore, Katmandu, Manila, Phuket, Penang, Hanoi, Mumbai and Chiang Mai. The 10th ASIAN conference was held in Kunming, China, December 7-9, 2005. Each year, the conference focuses on a di?erent theme at the cutting edge of computer science research. The theme of ASIAN 2005 was data management on the Web. Four distinguished speakers were invited to the conference: M- iano Consens (University of Toronto), Richard Hull (Bell Laboratories, Lucent Technologies),TovaMilo(TelAvivUniversity)andPrabhakarRaghavan(Yahoo Research and Stanford University). This year, 91 papers were submitted from 11 countries. The Program C- mittee selected 17 regular papers and 21 short papers. This volume contains the papers based on the invited talks, the regular papers, and the short papers.We wish to thank the Program Committee and the external referees for their work in selecting the contributed papers.
R 1,558.72
R 2,442.00
Edexcel GCSE (9-1) Computer Science Student Book
The Pearson Edexcel GCSE (9-1) Computer Science Student Book provides detailed coverage of the 2016 specification, enabling you to approach your exams and assessment with confidence. This Student Book offers: a comprehensive understanding of computer science and computational thinking, helping you to access the course content and make progress with your learning. an awareness of the applications of computer science for problem solving in the real world definitions of key words, enabling you to recognise and use appropriate terms and vocabulary regular activities to support progression and encourage further thinking and investigation preparation for the exam section to support revision. Our Student Book will also be available as a Kindle edition.
R 1,444.00
Computer Science Logic
This volume presents the proceedings of the Computer ScienceLogic Workshop CSL '92, held in Pisa, Italy, inSeptember/October 1992. CSL '92 was the sixth of the seriesand the first one held as Annual Conference of the EuropeanAssociation for Computer Science Logic (EACSL). Fullversions of the workshop contributions were collected aftertheir presentation and reviewed. On the basis of 58 reviews,26 papers were selected for publication, and appear here inrevised final form.Topics covered in the volume include: Turing machines,linear logic, logic of proofs, optimization problems, lambdacalculus, fixpoint logic, NP-completeness, resolution,transition system semantics, higher order partial functions,evolving algebras, functional logic programming, inductivedefinability, semantics of C, classes for a functionallanguage, NP-optimization problems, theory of types andnames, sconing and relators, 3-satisfiability, Kleene'sslash, negation-complete logic programs, polynomial-timeoracle machines, and monadic second-order properties.
R 1,582.10
Lectures on Parallel Computing
This textbook is intended for an undergraduate course on the fundamentals of parallel computing or as a background and reference for graduate courses on high-performance computing, shared-memory multiprocessor programming, or parallel algorithms.The author introduces theoretical concepts and tools for expressing, analyzing, and assessing parallel algorithms, and covers in detail the two most widely used concrete frameworks, OpenMP and MPI, plus the threading interface pthreads for writing parallel programs for either shared or distributed memory parallel computers with an emphasis on general concepts and principles. Code examples are given in a C-like style, and the extensive exercises can be used for self-study and as inspiration for small implementation projects in OpenMP and MPI.The book is appropriate for students and professionals engaged in all aspects of parallel computing.
R 2,748.00
