This engaging and accessible book presents a set of representative concepts connected by the theme of information security, demonstrating how each allows us to solve real problems. The discussions are supported by many examples and practical exercises.

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.

Explains the fundamental topics in computer science using a set of easily identifiable examples and applications Provides a unified approach, offering exercises that can be reproduced by the reader without the need for any prior programming experience Presents each topic in the form of a "mini" lecture course, demonstrating how it allows us to solve real problems Includes supplementary material: sn.pub/extras

Autorentext

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 .

Klappentext

The remarkable diversity of ideas within the subject of computer science makes it highly rewarding and exciting to study, yet also difficult to describe in essence.

This engaging and accessible text addresses the fundamental question: What Is Computer Science? Rather than supplying a brief overview of every relevant topic, the book showcases a set of representative concepts broadly connected by the theme of information security. 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, which together will be sure to whet your appetite for the many fascinating aspects of computer science.

Topics and features:

• Presents a concise introduction to the study of algorithms, and describes how computers work using the example of computer viruses
• Introduces the concepts of data compression, and error detection and correction
• Highlights the role of data structures, and how their design can have a profound influence on algorithms that operate on them
• Explores the topic of web-search, with a specific focus on examples drawn from cryptography and information security
• 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, the hiding of secret data within non-secret data

• Provides additional supplementary material at an associated websiteThis easy-to-read textbook is an ideal introduction to the study of computer science for students beginning on, or contemplating taking, an undergraduate degree. Teachers wishing to offer a primer on the field will also find the book an excellent educational resource.

  Inhalt

  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.