Binary - Understanding Computational Thinking and Problem Solving

1. Overview of Computational Thinking

 Definition: Computational thinking is the application of principles from computer science to

various problems across different domains such as arts, humanities, sciences, and social
sciences.

 Core Concept: It involves understanding how information is represented and processed to solve
problems effectively.

2. The Problem-Solving Model

 Components:

o Input: The problem that needs solving.

o Output: The solution or result of solving the problem.

o Black Box: The mechanism or process that transforms input into output.

 Example: Taking attendance in class can be represented as a problem where the input is the list
of students, the output is the count of present students, and the black box is the method of
counting.

3. Number Systems and Their Application

 Unary System:

o Description: The simplest counting system using a single symbol repeatedly. For
example, using fingers to count up to 10.

o Technical Term: Known as base-1.

 Binary System:

o Description: Utilized by computers, employing two symbols: 0 and 1.

 o Term Origin: The word "bit" comes from "binary digit."

o Representation: 0 represents an off state, and 1 represents an on state in a binary

system.

 Decimal System:

o Description: The system most commonly used by humans, based on 10 symbols (0-9).

o Base: 10, which means each digit's place represents increasing powers of 10 (1's, 10's,
100's, etc.).

4. Binary Representation in Computers

 Physical Representation:

o Concept: Computers use tiny switches, called transistors, to represent binary digits. Each
transistor can be on (1) or off (0).

o Example: A light bulb analogy where an "on" bulb represents 1 and an "off" bulb
represents 0.

 Counting with Bits:

o Single Bit: Can represent two values (0 and 1).

o Multiple Bits: Can represent more values. For example, with three bits, you can
represent numbers from 0 to 7.

o Pattern Representation: The combination of on and off states of multiple bits allows
computers to represent numbers in binary.

5. Practical Application of Bits and Bytes

 Bits to Bytes:

o Byte Definition: A byte consists of 8 bits.

o Purpose: A more practical unit for representing larger amounts of data.

 Data Measurement:

o Units: Kilobytes (thousands of bytes), megabytes (millions of bytes), gigabytes (billions

of bytes).

o Example: Files like music, photos, and videos are measured in bytes.

6. Binary Counting Example

 With Three Bits:

o Patterns: Different patterns of on/off states represent numbers from 0 to 7.

 o Additional Bit: A fourth bit expands the range, allowing representation of numbers up to
15.

7. Summary

 Digital Representation: Both binary and decimal systems are fundamentally about representing
numbers using patterns. While computers use binary (0s and 1s), humans use decimal (0-9).

 Importance of Understanding Binary: Knowing binary and how computers use it helps in
understanding how information is processed and represented in digital systems.

Representation - How Computers Represent Characters

Introduction to Computer Representation

Computers operate using binary, a system of 0's and 1's, which allows them to represent a wide range of
information, including text and graphics. At a fundamental level, computers use bits (binary digits)
organized into bytes (8 bits) to store and process data.

Representing Characters in Computers

To represent textual characters like letters, computers use a system where each character is assigned a
unique number. For example, the letter 'A' is represented by the number 65 in a commonly used
encoding system.

ASCII (American Standard Code for Information Interchange)

 Basic Concept: ASCII maps numbers to characters. For example, 'A' is 65, 'B' is 66, and so forth.
This allows computers to encode text using numbers.

 Character Encoding: ASCII uses 7 bits to represent each character, allowing for 128 unique
characters, which include uppercase and lowercase letters, numbers, and some symbols.

 Limitations: ASCII primarily supports English characters and lacks representation for many other
languages and symbols.

Expanding Beyond ASCII: Unicode

 Need for Expansion: As the digital world grew, ASCII's limitation in supporting non-English
characters and symbols became apparent.

 Unicode: Introduced as a comprehensive character encoding system, Unicode supports a vast

array of characters from different languages and scripts. It uses more bits (often 16, 24, or 32
bits) to provide a unique number for each character, accommodating many more symbols and
languages.

Unicode Representation of Emoji

 Basic Concept: Unicode not only represents text but also includes emoji. For example, the 'Face
with Tears of Joy' emoji is represented by a specific sequence of bits.
  Skin Tones: To support diverse skin tones, Unicode uses a system where the base emoji is
represented first, followed by additional bits that specify the skin tone. This approach avoids
duplicating the base emoji for each skin tone variant.

 Composition: Unicode allows for combinations of characters and emojis to create complex
symbols, such as combining different emojis to represent couples or various professions.

Pixels and Colors in Digital Images

 Pixel Representation: Digital images are composed of pixels, each representing a color using
RGB (Red, Green, Blue) values. Each color component is assigned a byte, resulting in 24-bit color
representation (8 bits for each color).

 Color Example: A specific pattern of 0's and 1's can represent colors by defining the amount of
red, green, and blue in each pixel.

 Image Size: The resolution and size of an image depend on the number of pixels and the color
depth. More pixels and higher color depth increase the image file size.

Video Representation

 Concept: Videos are essentially sequences of images (frames) displayed in quick succession. Each
frame is an individual image, and the rapid display creates the illusion of motion.

 Frame Rate: Standard frame rates include 24 frames per second (fps) for movies and 30 fps for
TV. Higher frame rates result in smoother motion but larger file sizes.

 Video Compression: Techniques are used to reduce the size of video files by compressing image
and sound data, making it more efficient for storage and transmission.

Sound Representation in Computers

 Basic Concept: Sound can be digitized by converting analog audio signals into digital data. This
involves recording frequencies and amplitudes of sound waves.

 MIDI and Audio Formats: MIDI (Musical Instrument Digital Interface) represents musical notes
and their attributes (e.g., pitch, duration). Audio file formats like mp3 and AAC encode sound
data for playback on digital devices.

Context and Interpretation

 Data Context: How data is interpreted depends on its context. For example, the same binary
pattern can represent different types of data (text, numbers, colors) depending on how it is
processed.

 Data Types: Programming languages use data types to specify how binary data should be
interpreted, such as integers, characters, or colors. Modern languages often handle data type
interpretation automatically.
Algorithms & Abstraction - Understanding Abstraction in Problem Solving

1. Concept of Abstraction

 Abstraction is a fundamental concept in computer science and problem-solving. It involves

simplifying complex systems by focusing on high-level goals or processes, rather than the
intricate details of implementation. For example, when driving a car, most people don’t concern
themselves with how the engine works; they just focus on getting from one place to another.
This high-level perspective allows for more efficient problem-solving by ignoring unnecessary
details.

2. The Role of Algorithms in Abstraction

 In the context of computer science, the "black box" of abstraction often contains an algorithm,
which is a set of step-by-step instructions designed to solve a particular problem. Understanding
and applying these algorithms is central to solving problems efficiently without needing to delve
into lower-level details every time.

Searching Algorithms Explained Through a Phonebook Example

3. Linear Search: The Basics

 Imagine searching for a name like "John Harvard" in a physical phonebook. A simple approach is
to start at page 1 and continue flipping through each page until you find the name. This method,
known as a linear search, is straightforward but can be very slow, especially with large data sets.

4. Improving Efficiency with Skipping

 To speed up the search, you might consider flipping two pages at a time. While this method is
faster, it introduces the risk of skipping over the name you’re looking for if it’s on a skipped page.
This method, although quicker, is not always reliable.

5. The Power of Binary Search

 A much more efficient approach is to use binary search. Here, you open the phonebook roughly
in the middle, check if the desired name is before or after the current page, and then discard the
half that doesn’t contain the name. By repeatedly halving the search area, you quickly narrow
down the location of the name, significantly speeding up the search process.

6. Understanding the Impact on Performance

 When visualizing these algorithms on a graph where the x-axis represents the size of the
problem and the y-axis represents the time taken to solve it:

o The linear search algorithm results in a straight line, indicating a direct correlation
between the size of the data set and the time required.

o The two-page skip method is also a straight line but with a shallower slope, indicating
faster performance than the linear search.
 o Binary search creates a logarithmic curve, which increases much more slowly, indicating
that even if the data set doubles in size, the time taken to search only increases slightly.

Introducing Pseudocode: Translating Concepts into Code

7. Pseudocode as a Tool

 Pseudocode is a way to translate your problem-solving process into an outline that closely
resembles code but is written in plain language. It’s a preliminary step before actual coding,
helping to clarify the logical steps needed to solve a problem.

8. Breaking Down the Phonebook Example in Pseudocode

 Step 1: Pick up the phonebook.

 Step 2: Open to the middle.

 Step 3: Look at the page to determine if the name is there.

 Step 4: If the name is on the page, call the person.

 Step 5: If the name is earlier in the book, search the left half.

 Step 6: If the name is later in the book, search the right half.

 Step 7: If the name is not found after searching, quit the program.

9. Key Programming Concepts Highlighted

 Functions: Actions like picking up the phonebook or flipping pages are analogous to functions in
programming, which are specific actions or verbs that the program executes.

 Conditionals: Decisions, such as determining whether to search the left or right half of the book,
are managed by conditionals, which direct the program’s flow based on Boolean expressions
(true/false decisions).

 Loops: The repeated action of halving the search area is a loop, which continues until the
problem is solved or the search is exhausted.
Final Thoughts on Learning to Code

10. Applying Real-Life Logic to Programming

 The process of learning to code often involves recognizing that many of the logical steps you
already use in daily problem-solving can be directly applied to programming. The challenge lies
in translating familiar ideas into unfamiliar syntax, but the underlying concepts remain the same.