What Is Computer Science?
Springer International Publishing (Verlag)
978-3-319-04041-7 (ISBN)
This engaging and accessible text addresses the fundamental question: What Is Computer Science? The book showcases a set of representative concepts broadly connected by the theme of information security, for which the presentation of each topic can be treated as a "mini" lecture course, demonstrating how it allows us to solve real problems, as well as how it relates to other subjects. The discussions are further supported by numerous examples and practical hands-on exercises. Features: presents a concise introduction to the study of algorithms and describes how computers work; introduces the concepts of data compression, and error detection and correction; highlights the role of data structures; explores the topic of web-search; reviews both historic and modern cryptographic schemes, examines how a physical system can leak information and discusses the idea of randomness; investigates the science of steganography; provides additional supplementary material at an associated website.
Dr. Daniel Page and Prof. Nigel Smart are lecturers in the Department of Computer Science at the University of Bristol, UK, affiliated to the Cryptography and Information Security Group. Daniel Page is also the author of the Springer textbook A Practical Introduction to Computer Architecture.
Part I: Foundations of Computer Science.- Compressing and Correcting Digital Media.- Writing and Comparing Algorithms.- Playing Hide-and-Seek with Virus Scanners.- How Long is a Piece of String?.- Demystifying Web-Search: The Mathematics of PageRank.- Part II: Examples from Information Security.- Using Short Programs to Make and Break Historical Ciphers.- Generation and Testing of Random Numbers.- Safety in Numbers: Modern Cryptography from Ancient Arithmetic.- Hiding a Needle in a Haystack: Concealed Messages.- Picking Digital Pockets.
From the reviews:
"The main audience of this textbook is students (either currently studying subjects related to CS or thinking about enrolling in that area of study) as well as teachers (who might use the book when preparing and developing courses and teaching materials). ... The book can facilitate independent learning. ... the book walks its readers through relevant and reasonably detailed examples, providing relatable ideas that will help them grasp these concepts." (Budi Arief, Computing Reviews, May, 2014)| Erscheint lt. Verlag | 15.1.2014 |
|---|---|
| Reihe/Serie | Undergraduate Topics in Computer Science |
| Zusatzinfo | XVIII, 232 p. 84 illus. |
| Verlagsort | Cham |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 388 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Theorie / Studium |
| Schlagworte | Algorithm analysis and problem complexity • algorithms • Computer / Computing • Cryptology • Informatik; Einführung • Introduction |
| ISBN-10 | 3-319-04041-3 / 3319040413 |
| ISBN-13 | 978-3-319-04041-7 / 9783319040417 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
