Chapter 1.1: Basic Concepts

Computer Fundamentals and Introduction to Programming
How a computer worksThe binary system Data representationTypes of computersInformation technology
Sercan KÜLCÜ · Giresun University

Introduction

Learning Outcomes

How a computer works

Explain the input, processing, output and storage stages.

Digital representation

Interpret the role of bits, bytes, the binary number system and logical operations.

Types of computers

Compare computers by purpose and capacity.

Information technology

Explain how data becomes information and what IT does in everyday life.

How a Computer Works

What Is a Computer?

A computer is an electronic system that processes data according to the instructions in a program.

  • Data: raw values before processing. Information: a result you can interpret.
  • It takes in data from users or other systems.
  • It processes the data and produces a meaningful result.
  • It presents the result or stores it for later use.
Data (input)12 and 8Computerexecutes instructions12 + 8 = 20Program“add”Information (output)Sum: 20

How a Computer Works · Step by step

The Basic Cycle

InputProcessOutputStoragewriteread

Every task goes through the same four stages. Example: computing a grade in a student information system.

Inputmidterm = 70, final = 90ProcessOutputStoragewriteread

Input: The instructor types midterm = 70 and final = 90 into a form. The keyboard sends these values to the computer.

Inputmidterm = 70, final = 90Process0.4·70 + 0.6·90 = 82OutputStoragewriteread

Process: The CPU applies the formula: 0.4 × 70 + 0.6 × 90 = 82. This is an arithmetic operation.

Inputmidterm = 70, final = 90Process0.4·70 + 0.6·90 = 82OutputAverage: 82Storagewriteread

Output: The screen shows "Average: 82". The monitor is an output device.

Inputmidterm = 70, final = 90Process0.4·70 + 0.6·90 = 82OutputAverage: 82Storagerecord → databasewriteread

Storage: The grade record is written to a database, where it can be read and processed again later (two-way arrow).

How a Computer Works

Input

Input is how a computer receives data from a user, a sensor or another system.

A
Keyboard

Characters and commands

↖
Mouse

Position and clicks

◎
Microphone

Sound waves

▣
Sensor

Physical measurements

Key pressed“A”Keyboard controllersends a scan codeCharacter code65Bits in memory01000001

Every input device turns a physical event into numbers (bits).

How a Computer Works

Processing

  • The central processing unit (CPU) executes program instructions in order; the control unit manages that sequence.
  • The ALU (arithmetic logic unit) does the calculations: 12 + 8 = 20.
  • Logical operations make comparisons and decisions possible.
  • Both data and instructions are represented in binary.
CPUControl unitnext instruction: ADDRegistersR1 = 12R2 = 8R3 = 20ALU12 + 8 = 2020 > 15 ?→ true (1)

How a Computer Works

Output and Storage

RAM (temporary)SSD (permanent)essay.docxbrowserphoto.jpgPower: on

Open documents and running programs live in RAM: fast access.

RAM (temporary)SSD (permanent)essay.docxbrowseressay.docxphoto.jpgsavePower: on

Save copies the document from RAM to the SSD.

RAM (temporary)SSD (permanent)emptyessay.docxphoto.jpgPower: OFF

When the power goes off, RAM is wiped; files on the SSD are kept.

Output

Processed information is presented on a monitor, printer or speaker.

result → screen
Temporary storage (RAM)

Fast, but loses its contents when the power goes off.

Permanent storage

SSD, hard disk, USB drive: keeps data without power.

Digital Representation

Everything Becomes a Number

Text

Characters are stored as numeric codes.

A → 65 → 01000001
Mouse movement

A position on screen becomes a pair of coordinates.

(x, y) → (420, 180)
Images

Each pixel is made of color components.

RGB(255, 0, 0)
Sound

A sound wave is sampled at regular intervals.

amplitude → list of numbers
Letter “A”65Mouse position(420, 180)Red pixel(255, 0, 0)Sound waves0, 5, 7, 4, …In memory, all are bit strings: 65 → 01000001

Digital Representation · Step by step

Bits and Binary: From Binary to Decimal

A bit (binary digit) takes only the values 0 and 1. 8 bits = 1 byte.

012816403201608040211Place values (powers of 2):

An 8-bit string: from right to left, each position's value doubles: 1, 2, 4, … 128.

012816403201608040211Place values (powers of 2):sum = 64 = 64

The bit in position 6 is 1 → its value 64 is added to the sum. Zero bits contribute nothing.

012816403201608040211Place values (powers of 2):sum = 64 + 1 = 65

The bit in position 0 is 1 → its value 1 is added to the sum. Zero bits contribute nothing.

012816403201608040211Place values (powers of 2):sum = 64 + 1 = 65ASCII 65 → “A”

01000001₂ = 65₁₀. In the ASCII table, 65 is the letter A.

Digital Representation

What Binary Digits Are Worth

BitsCombinationsUnsigned range
1 bit21 = 20–1
2 bits22 = 40–3
8 bits28 = 2560–255
10 bits210 = 1,0240–1,023
32 bits2320–4,294,967,295

Each extra bit doubles the number of distinct values: n bits → 2n values.

01000110110000010100111001011101111 bit22 bits43 bits8value:

Digital Representation · Step by step

How Many Bits? 58 Letters

2n=14n=28n=316n=432n=564n=6N = 58 letters

The Turkish alphabet has 29 letters; coding upper and lower case separately needs N = 58 distinct values. How many bits, at minimum?

2n=14n=28n=316n=432n=564n=6N = 58 letters1 bit → 2 codes2 < 58 → not enough

One bit gives only 2 codes (0 and 1). Since 2 < 58, the loop continues.

2n=14n=28n=316n=432n=564n=6N = 58 letters2 bits → 4 codes4 < 58 → not enough

One more bit doubles the codes: 4. Still fewer than 58.

2n=14n=28n=316n=432n=564n=6N = 58 letters3 bits → 8 codes8 < 58 → not enough

One more bit doubles the codes: 8. Still fewer than 58.

2n=14n=28n=316n=432n=564n=6N = 58 letters4 bits → 16 codes16 < 58 → not enough

One more bit doubles the codes: 16. Still fewer than 58.

2n=14n=28n=316n=432n=564n=6N = 58 letters5 bits → 32 codes32 < 58 → not enough

One more bit doubles the codes: 32. Still fewer than 58.

2n=14n=28n=316n=432n=564n=6N = 58 letters6 bits → 64 codes64 ≥ 58 → enough

6 bits → 64 codes. 64 ≥ 58: the condition fails and the loop stops.

2n=14n=28n=316n=432n=564n=6N = 58 letters6 bits → 64 codes64 ≥ 58 → enough6 codes left unused

Answer: 6 bits; 64 − 58 = 6 codes go unused. ASCII, designed for English, needs more than 64 codes for 52 letters, 10 digits, punctuation and control characters: 7 bits (128). Turkish letters (ç, ğ, ı, İ, ö, ş, ü) are not in ASCII; they need Unicode (UTF-8).

N = 58   (29 upper + 29 lower case)
n = 1; capacity = 2
while capacity < N: n = n + 1; capacity = capacity × 2
capacity ≥ N → n bits suffice

Digital Representation · Step by step

Decimal to Binary: 45

Divide by 2, note the remainderRead remainders bottom-up32?16?8?4?2?1?

Let's convert 45 to binary. Method: divide by 2 until the quotient is 0, noting the remainder (0 or 1) at each step.

Divide by 2, note the remainder45 ÷ 2 = 22rem 1Read remainders bottom-up32?16?8?4?2?11

45 ÷ 2 = 22, rem 1 (odd → remainder 1). The first remainder is the rightmost (ones) digit.

Divide by 2, note the remainder45 ÷ 2 = 22rem 122 ÷ 2 = 11rem 0Read remainders bottom-up32?16?8?4?2011

22 ÷ 2 = 11, rem 0 (even → remainder 0). This remainder goes one place to the left.

Divide by 2, note the remainder45 ÷ 2 = 22rem 122 ÷ 2 = 11rem 011 ÷ 2 = 5rem 1Read remainders bottom-up32?16?8?412011

11 ÷ 2 = 5, rem 1 (odd → remainder 1). This remainder goes one place to the left.

Divide by 2, note the remainder45 ÷ 2 = 22rem 122 ÷ 2 = 11rem 011 ÷ 2 = 5rem 15 ÷ 2 = 2rem 1Read remainders bottom-up32?16?81412011

5 ÷ 2 = 2, rem 1 (odd → remainder 1). This remainder goes one place to the left.

Divide by 2, note the remainder45 ÷ 2 = 22rem 122 ÷ 2 = 11rem 011 ÷ 2 = 5rem 15 ÷ 2 = 2rem 12 ÷ 2 = 1rem 0Read remainders bottom-up32?16081412011

2 ÷ 2 = 1, rem 0 (even → remainder 0). This remainder goes one place to the left.

Divide by 2, note the remainder45 ÷ 2 = 22rem 122 ÷ 2 = 11rem 011 ÷ 2 = 5rem 15 ÷ 2 = 2rem 12 ÷ 2 = 1rem 01 ÷ 2 = 0rem 1Read remainders bottom-up32116081412011

1 ÷ 2 = 0, rem 1 (odd → remainder 1). This remainder goes one place to the left. The quotient is 0, so we stop.

Divide by 2, note the remainder45 ÷ 2 = 22rem 122 ÷ 2 = 11rem 011 ÷ 2 = 5rem 15 ÷ 2 = 2rem 12 ÷ 2 = 1rem 01 ÷ 2 = 0rem 1Read remainders bottom-up32116081412011101101₂check: 32 + 8 + 4 + 1 = 45

Reading the remainders from the last division to the first gives 45₁₀ = 101101₂. Check: add up the place values.

Digital Representation

Transistors

  • A processor is built from a huge number of transistors.
  • A transistor works like a tiny switch that controls electric current.
  • The gate voltage turns the transistor on (current flows) or off (no current); these two states are read as 1 and 0.
  • Billions of switches working together make complex operations possible.
Off+5 Vgate0 Vbit 0On+5 Vgate5 Vcurrentbit 1

Data Representation

Text and Numbers

Numbers

Integers and floating-point numbers are stored with specific binary encoding rules.

13 → 00001101
Characters

ASCII and Unicode map characters to numeric codes.

A → U+0041
Encoding

The encoding standard decides what a given bit string means.

Unicode

Provides a large character set covering many alphabets and symbols.

Ğ · 中 · €
01000001same 8 bitsread as an integer → 65as ASCII text → “A”

Data Representation

Images

  • A digital image is made of small colored cells called pixels.
  • Resolution is the number of pixels horizontally and vertically.
  • In the RGB model, a color is defined by red, green and blue components.
  • Each component is a number from 0 to 255 (1 byte). RGB(255, 255, 255) is white, RGB(0, 0, 0) is black.
8 × 6 =48 pixelsR59 = 00111011G130 = 10000010B246 = 111101101 pixel = 3 bytes → 48 × 3 = 144 bytes

Data Representation

Color Depth and Image Size

Bits / pixelColorsTypical use
121 = 2Line art, fax, scanned documents
828 = 256Grayscale or palette images (GIF)
24224 = 16,777,216Photos: 8 bits each for R, G, B
3216.7 million + transparencyUI graphics, PNG (alpha channel)
Size formula

Uncompressed image = width × height × bit depth ÷ 8 bytes.

Example: 800 × 600

24 bits: 800 × 600 × 3 = 1,440,000 bytes ≈ 1.44 MB (1.37 MiB). The same image at 1 bit: 60,000 bytes ≈ 60 KB (58.6 KiB).

More color depth gives smoother gradients but larger files; with an 8-bit palette, a sky gradient looks banded.

Data Representation

Audio and Video

Audio

The analog wave is measured at equal intervals (sampling); each measurement is rounded to a number.

457775420002amplitudetime

Samples: 4, 5, 7, 7, 7, 5, 4, 2, 0, 0, 0, 2

Video

Showing frames in quick succession creates the illusion of motion. Audio is usually stored in a separate track.

frame 1frame 2frame 3frame 4
30 fps: 30 frames per second

Data Representation · Step by step

Digitizing Sound: Sample, Quantize, Encode

time →Analog signalmicrophone voltagevaries continuously in timea value at every instant:infinitely many pointsa computer can't store that

A microphone turns sound into a continuously varying voltage. This analog signal has a value at every instant, and infinitely many values cannot be stored.

time →4.766.556.554.762.240.450.452.24Sampling8 measurements, equally spacedchanges in between are lostsampling rate: measurementsper second (Hz)CD: 44,100 Hz

Sampling: the signal is measured at equal intervals. The measurements are decimals (4.76, 6.55, …); whatever happens between two samples is not recorded.

time →0123456757752002Quantization3 bits → 2³ = 8 levels (0…7)each sample is roundedto nearest level: 4.76 → 5max error: 0.45 levels16 bits → 65,536 levels

Quantization: 3 bits allow only 8 levels, so each sample is rounded to the nearest one. The difference (at most 0.45) is the quantization error.

time →01234567577520023-bit codes1011111111010100000000108 samples × 3 bits = 24 bits

Encoding: each level is written as a 3-bit binary number; 5 → 101, 7 → 111. Eight samples take 24 bits.

time →0123456757752002CD quality, 1 minute44,100/s × 16 bits × 2 channels= 1,411,200 bit/s× 60 s = 84,672,000 bits÷ 8 = 10,584,000 bytes≈ 10.6 MB (10.1 MiB)

Real audio takes thousands of samples per second. CD quality: 44,100 Hz, 16 bits, 2 channels → one minute ≈ 10.6 MB (10.1 MiB).

time →01234567577520021 minute of musicUncompressed (WAV)≈ 10.6 MB (10.1 MiB)MP3, 128 kbit/s960,000 bytes ≈ 0.96 MB

Lossy formats such as MP3 drop details the ear barely notices: at 128 kbit/s one minute is 960,000 bytes, about 11 times smaller.

analog signal: continuous wave
sample: measure at equal intervals
quantize: round to nearest level (3 bits → 0…7)
encode: write each level in 3 bits
size = sample rate × bit depth × channels × time
lossy compression (MP3)

Data Representation

Lossless and Lossy Compression

LosslessLossy
After decompressionThe original data comes back bit for bitYou get a close approximation of the original
MethodShortens repetitions (RLE, ZIP)Drops detail the eye and ear barely notice
Example formatsZIP, PNG, FLACJPEG, MP3, MP4 (H.264)
Typical reductionUsually 2–3×10× or more
Suitable dataText, programs, spreadsheets, medical imagesPhotos, music, video
A lossy file degrades a little more with every edit-and-save; discarded detail never comes back. Changing even one bit of a program or text can ruin it, so those are only ever compressed losslessly.

Data Representation · Step by step

Run-Length Encoding (RLE)

Image row (16 pixels, 1 byte per pixel)B0B1B2B3B4B5W6W7W8W9B10B11B12W13W14W15count = 1Output:

The row has two colors: B (blue) and W (white). At the first pixel, count is 1 and the current color is B.

Image row (16 pixels, 1 byte per pixel)B0B1B2B3B4B5W6W7W8W9B10B11B12W13W14W15count = 6Output:

Pixels 1–5 are also B: count goes up by one at each. At pixel 5, count = 6.

Image row (16 pixels, 1 byte per pixel)B0B1B2B3B4B5W6W7W8W9B10B11B12W13W14W15count = 1Output:(6, B)

Pixel 6 is W: the color changed. The finished run is written as (6, B); count resets to 1 and the new color is W.

Image row (16 pixels, 1 byte per pixel)B0B1B2B3B4B5W6W7W8W9B10B11B12W13W14W15count = 1Output:(6, B)(4, W)(3, B)

The same rule fires twice more: four W → (4, W), three B → (3, B). A new W run starts at pixel 13.

Image row (16 pixels, 1 byte per pixel)B0B1B2B3B4B5W6W7W8W9B10B11B12W13W14W15count = 3Output:(6, B)(4, W)(3, B)(3, W)

End of row: the last open run (3, W) is written too. The output has 4 pairs.

Image row (16 pixels, 1 byte per pixel)B0B1B2B3B4B5W6W7W8W9B10B11B12W13W14W15Output:(6, B)(4, W)(3, B)(3, W)Decoding: (6, B) → BBBBBB, (4, W) → WWWW … the row comes back exactly: lossless.

Each pair is 2 bytes: 4 × 2 = 8 bytes, half of the original 16. Decoding restores the row exactly; nothing is lost.

Image row (16 pixels, 1 byte per pixel)B0W1B2W3B4W5B6W7B8W9B10W11B12W13B14W15Output:16 pairs × 2 B = 32 bytes: bigger than the original!

Worst case: if the color changes at every pixel, every run has length 1; 16 pairs = 32 bytes. RLE only pays off with long runs (line art, icons, scans).

count = 1; color = first pixel
if next pixel has same color: count = count + 1
on color change: write (count, color); count = 1
at end of row: write last pair
size: 16 bytes → 4 pairs × 2 bytes
worst case: B W B W …

Data Representation

Units of Memory

Decimal (SI)ValueBinary (IEC)Value
bit0 or 1 (binary digit)
byte (B)8 bits
KB1,000 BKiB1,024 B
MB1,000 KBMiB1,024 KiB
GB1,000 MBGiB1,024 MiB
TB1,000 GBTiB1,024 GiB
PB1,000 TBPiB1,024 TiB
One 1 TB disk, two countsManufacturer (decimal units)10¹² = 1,000,000,000,000 bytes÷ 2³⁰ (1 GiB = 1,073,741,824 bytes)Operating system (binary)≈ 931 GiBBars drawn to the same scale: 931 / 1000Nothing is lost; only the unit differs.

Disk makers use SI units (1 TB = 1012 bytes). The operating system often computes the binary value but still labels it “GB”: a 1 TB disk ≈ 931 GiB, shown as “931 GB”.

Data Representation · Step by step

The Scale of Units

bit0 / 1

bit: the smallest unit, 0 or 1. Example: a single switch.

bit0 / 1Byte8 bits×8

1 byte = 8 bits. A byte can take 28 = 256 values; example: one character, “A”.

bit0 / 1Byte8 bits×8KiB1,024 B×1024

1 KiB = 1,024 B (210×; in SI, 1 KB = 1,000 B). Example: half a page of plain text ≈ 2 KB.

bit0 / 1Byte8 bits×8KiB1,024 B×1024MiB1,024 KiB×1024

1 MiB = 1,024 KiB (210×). Example: a phone photo ≈ 3 MB.

bit0 / 1Byte8 bits×8KiB1,024 B×1024MiB1,024 KiB×1024GiB1,024 MiB×1024

1 GiB = 1,024 MiB (210×). Example: an HD movie ≈ 4 GB.

bit0 / 1Byte8 bits×8KiB1,024 B×1024MiB1,024 KiB×1024GiB1,024 MiB×1024TiB1,024 GiB×1024

1 TiB = 1,024 GiB (210×). Example: a laptop drive ≈ 1 TB.

Bar heights are not to scale; each step is roughly a thousand times larger.

Data Representation

Bits or Bytes? Speed and Size

Lowercase b, uppercase B

b is a bit, B is a byte: 100 Mb and 100 MB differ by a factor of 8.

Speed is measured in bits

Network speed is bits per second: 100 Mbps = 100,000,000 bit/s (M = 106).

Size is measured in bytes

File and disk sizes are in bytes: MB, GB.

011010018 bits (b) = 1 byte (B)
Example: a 3 GB file over a 100 Mbps linkResult
Speed in bytes: 100,000,000 ÷ 812,500,000 bytes/s = 12.5 MB/s
File in bits: 3 × 109 bytes × 824 × 109 bits
Time: 24 × 109 ÷ 108240 s = 4 minutes (best case)

In practice it takes longer because of protocol overhead and other devices sharing the network.

Processing Data

Arithmetic and Logical Operations

Arithmetic

Calculates with numeric values.

+ − × ÷ %
Comparison

Tests how two values relate.

> < ≥ ≤ == !=
Logical

Combines or negates conditions.

AND OR NOT
Decision

Picks the path the program follows based on the result.

score ≥ 60 → pass
Arithmetic(60 + 80) / 2 = 70Comparison70 ≥ 60 → trueLogicaltrue AND true → trueDecision→ “pass”Example: midterm 60, final 80, attended = true

Processing Data · Step by step

Catching Errors with a Parity Bit

Sender1bit 10bit 21bit 31bit 40bit 50bit 61bit 7 paritynumber of 1s: 4 → evenEven parity rulethe number of 1s in 8 bitsmust always be evenodd → erroreven → no error (?)

The data to send is 1011001 (“Y” in ASCII, 89). The seven data bits contain four 1s.

Sender1bit 10bit 21bit 31bit 40bit 50bit 61bit 70paritynumber of 1s: 4 → evenEven parity rulethe number of 1s in 8 bitsmust always be evenodd → erroreven → no error (?)

Even parity: the count of 1s is already even, so the parity bit is 0. The 8 bits sent: 10110010.

Receiver1bit 10bit 20bit 31bit 40bit 50bit 61bit 70parityEven parity rulethe number of 1s in 8 bitsmust always be evenodd → erroreven → no error (?)

Noise during transmission flips bit 3 from 1 to 0. The receiver gets 10010010.

Receiver1bit 10bit 20bit 31bit 40bit 50bit 61bit 70paritynumber of 1s: 3 → odd✗ Odd: error detected → resendEven parity rulethe number of 1s in 8 bitsmust always be evenodd → erroreven → no error (?)

The receiver counts the 1s: 3, which is odd. The rule is broken, so the error is detected; which bit flipped is unknown, so the data is requested again.

Receiver1bit 10bit 20bit 30bit 40bit 50bit 61bit 70paritynumber of 1s: 2 → even✓ Even: no error seen (but the data is corrupt!)Even parity rulethe number of 1s in 8 bitsmust always be evenodd → erroreven → no error (?)

If two bits flip, the count of 1s stays even and the receiver accepts bad data. Parity only catches an odd number of bit errors.

data = 1011001; count the 1s
even parity: parity = 0 → send 10110010
bit 3 flipped in transit
receiver counts 1s: odd means error
two bits flipped: even → error missed

Types of Computers

By Capacity and Purpose

SupercomputerHeavy scientific computing
MainframeHuge volumes of reliable transactions
ServerServices over a network
Personal computerIndividual use
Embedded systemA specific function inside a device
Thin clientAccess to a central system
Mobile devicePortable use
Quantum computerSpecial classes of problems
The categories have no hard boundaries. The same device can fit more than one category depending on how it is used.

Types of Computers

Supercomputers and Mainframes

Supercomputer

Used for scientific problems that need enormous computing power.

Examples: climate modeling, physics simulations, training AI models.

Mainframe

Built to run many concurrent transactions reliably and without interruption.

Examples: banking, insurance, large government systems.

1 largeproblemnode 1node 2node 3node 4node 5node 6resultATMcardtransferinsurancee-govMainframemany transactions, 24/7parallel computing → speedmany small transactions → availability
PrioritySupercomputerMainframe
Main goalComputing speedTransaction volume and availability
Typical workloadLarge scientific computationsMany business transactions

Types of Computers · Step by step

Servers and Thin Clients

Thin client 1screen + keyboardThin client 2screen + keyboardThin client 3screen + keyboardNetworkServerapplication + datadatabase

Many clients connect to the same server over the network.

Thin client 1screen + keyboardThin client 2screen + keyboardThin client 3screen + keyboardNetworkServerapplication + datadatabaserequest: “grade list”

Request: Client 1 asks for the grade list; the request travels over the network to the server.

Thin client 1screen + keyboardThin client 2screen + keyboardThin client 3screen + keyboardNetworkServerapplication + datadatabasequery + compute

Processing: The real work happens on the server: it queries the database and computes the result.

Thin client 1screen + keyboardThin client 2screen + keyboardThin client 3screen + keyboardNetworkServerapplication + datadatabaseresponse: ready screen / result

Response: The result goes back to the client. The thin client only displays it and takes input.

Server

Provides web, email, file, database or application services over a network.

Thin client

Leaves most of the work to the server, so it needs less local hardware and administration.

Types of Computers

Personal and Mobile Devices

▰
Desktop

Stationary, expandable hardware

▱
Laptop

Portable, battery-powered

▯
Tablet

Touchscreen, light use

▯
Phone

Mobile connectivity, sensors, apps

When choosing a device, portability, power use, screen size and purpose matter as much as performance.

Types of Computers · Step by step

Embedded Computers

An embedded computer performs a specific task inside a larger device.

SensortemperatureMicrocontrollerdecisionActuatorcompressorRoomenvironmenttarget temperature: 24 °C

The embedded computer in an air conditioner runs a continuous measure → decide → act loop.

SensortemperatureMicrocontrollerdecisionActuatorcompressorRoomenvironment28 °C28 > 24 ? → yesONtarget temperature: 24 °C

The sensor reads 28 °C. 28 > 24 → compressor on; the room cools.

SensortemperatureMicrocontrollerdecisionActuatorcompressorRoomenvironment26 °C26 > 24 ? → yesONtarget temperature: 24 °C

The sensor reads 26 °C. 26 > 24 → compressor on; the room cools.

SensortemperatureMicrocontrollerdecisionActuatorcompressorRoomenvironment24 °C24 > 24 ? → noOFFtarget temperature: 24 °C

The sensor reads 24 °C. 24 > 24 is false → compressor turns off. The loop keeps measuring.

  • Examples: engine control units, washing machines, air conditioners, medical monitors.
  • Usually low-power, running on limited resources.
  • Reliability and real-time response matter.
  • Users may not even realize there is a computer inside.

Types of Computers

Quantum Computers

Quantum computers process information with quantum bits, called qubits.

  • They offer different ways of computing for certain problems.
  • Studied for cryptography, optimization, chemistry and materials research.
  • They have not replaced classical computers for everyday general-purpose use.
Classical bit01always either 0 or 1Qubit|0⟩|1⟩before measuring: a mix of both states01measured: 0 or 1 (with a probability)

Information Technology

Information Technology (IT)

Information technology is the set of systems used to collect, process, store and transmit data.

HardwarePhysical devices
SoftwarePrograms and operating systems
DataRaw values being processed
CommunicationNetworks and data transfer
people · processes · security policiesIT systemHardwaredevicesSoftwareprogramsDataraw valuesCommunicationnetworks
An IT system is more than computers. People, processes and security policies also shape how it works.

Information Technology · Step by step

Data vs. Information

Raw data38, 41, 39meaning unclearContextProcessInformation

38, 41, 39: just numbers. Without knowing what was measured, they mean nothing.

Raw data38, 41, 39meaning unclearContextpatient's temperature, °C3 readingsProcessInformation

Add context: these are three temperature readings from one patient (°C).

Raw data38, 41, 39meaning unclearContextpatient's temperature, °C3 readingsProcess(38 + 41 + 39) / 3= 39.3Information

Process: average = (38 + 41 + 39) / 3 = 39.3.

Raw data38, 41, 39meaning unclearContextpatient's temperature, °C3 readingsProcess(38 + 41 + 39) / 3= 39.3Informationaverage 39.3 °Chigh fever

Information: "Average temperature 39.3 °C, high fever." Now a decision can be made.

Data

Raw measurements, numbers, text or records. Without context, their meaning may be unclear.

Information

The meaningful result of organizing and interpreting data.

Information Technology

IT in Everyday Life

Education

Online courses, digital resources and learning platforms.

Health

Electronic records, imaging systems and patient monitoring.

Finance

Banking, payment systems and transaction security.

Business and entertainment

Corporate communication, automation, games and media services.

Information Technology · Step by step

The Data Life Cycle

1. Collect2. Process3. Store4. Present

Example: data from a weather station goes through four stages, and then the cycle starts again.

1. Collectsensor: 21.4 · −99 · 22.1 · 232. Process3. Store4. Present

Collect: Data comes from people, machines or sensors. The sensor sent 4 readings.

1. Collectsensor: 21.4 · −99 · 22.1 · 232. Process−99 invalid → dropped; avg 22.2 °C3. Store4. Present

Process: Errors are removed and calculations done. −99 (a faulty reading) is dropped; the average is 22.2 °C.

1. Collectsensor: 21.4 · −99 · 22.1 · 232. Process−99 invalid → dropped; avg 22.2 °C3. Storesaved to database4. Present

Store: Data is kept in files, databases or the cloud.

1. Collectsensor: 21.4 · −99 · 22.1 · 232. Process−99 invalid → dropped; avg 22.2 °C3. Storesaved to database4. Presentdaily temperature chart

Present: The result is shared as a report, table, chart or app screen; new decisions trigger new data collection.

Information Technology

Benefits and Responsibilities

Speed and automation

Data is processed quickly and repetitive tasks are automated.

Access and communication

Information is easier to reach and share from anywhere.

Privacy and security

Personal data must be protected from unauthorized access and loss.

Accuracy and ethics

Bad data and biased systems can produce wrong results.

Convenience does not remove the duty to use data accurately, securely and responsibly.

Information Technology

The Future of IT

Artificial intelligence

Systems that learn patterns from data to support decisions and generate content.

Internet of Things

Devices with sensors sharing data over a network.

Cloud computing

Computing and storage resources delivered over a network.

Big data analytics

Extracting meaningful results from large, varied datasets.

Internet of Thingssoil moisture: 18%Cloud computingreadings storedBig datathousands of fields comparedAIdecision: “water now”action: valve opens, new readings arriveExample: smart irrigation

Alongside new technology, energy use, accessibility, security and ethics matter more and more.

Summary

Chapter Summary

  • Computers process data in a cycle of input, processing, output and storage.
  • All kinds of data are represented as bit strings.
  • Each extra bit doubles the number of representable values; binary–decimal conversion uses place values.
  • AND, OR and NOT combine conditions; addition and comparison happen in the ALU.
  • Sound becomes numbers through sampling, quantization and encoding; compression is lossless (ZIP, PNG) or lossy (JPEG, MP3).
  • A parity bit catches single-bit transmission errors; network speed is measured in bit/s, file size in bytes.
  • Computer types differ in purpose, capacity and operating environment.
  • Information technology consists of hardware, software, data, communication, people and processes.
A computer processes data. People add context and turn it into information.

Summary

Review Questions

  1. What are the input, processing, output and storage steps in an ATM transaction?
  2. Why can 8 bits represent 256 different values?
  3. What is the key difference between RAM and an SSD?
  4. How does a server differ from a mainframe?
  5. What context does a temperature reading need to become information?
  6. Why is security in IT not just a technical issue?

Summary

Exercises

  1. Convert 37 to binary (by repeated division by 2).
  2. What is 101011₂ in decimal?
  3. What is the minimum number of bits needed to encode only the 29 uppercase letters of the Turkish alphabet? How many codes are left unused?
  4. Write the word “Hi” as ASCII codes and as 8-bit bytes (H = 72, i = 105).
  5. How many bytes does an uncompressed 1920×1080 image take at 3 bytes per pixel? Roughly how many MB is that?
  6. How many frames are in a 10-second video at 30 fps?
Show answers
  1. 37 = 100101₂ (32 + 4 + 1).
  2. 101011₂ = 32 + 8 + 2 + 1 = 43.
  3. 5 bits: 24 = 16 is not enough, 25 = 32 ≥ 29; 32 − 29 = 3 codes unused.
  4. H = 72 = 01001000, i = 105 = 01101001 → 2 bytes.
  5. 1920 × 1080 × 3 = 6,220,800 bytes ≈ 6.2 MB (5.9 MiB).
  6. 30 × 10 = 300 frames.

Summary

References

  • Brookshear and Brylow, Computer Science: An Overview, Pearson.
  • Stallings, Computer Organization and Architecture, Pearson.
  • Unicode Consortium, The Unicode Standard.
  • NIST, Glossary of Key Information Security Terms.

The End

Chapter 1.1: Basic Concepts
Next: Chapter 1.2: Computer Hardware
1 / 1 Sercan KÜLCÜ. All rights reserved.