Course syllabus · 45 hours

Information Systems and Digital Technologies

A first course in computer literacy: how computers work, how software, networks and security fit together, and how computing shapes study, work and society.

Andijan State Pedagogical Institute · Lecturer: Ismailov Alisher · Telegram: @Urobotuz
45hours in total
2 h1 para = 2 hours
21teaching paras (42 h)
2 hmidterm exam (para 14)
1 hfinal exam
EN · UZall materials in both languages

01Course description

The course introduces students to the computer as a system.

Every para combines short input with bilingual interactive slides.

02Learning outcomes

By the end of the course, students will be able to:

  1. explain the importance of computer literacy and describe the characteristics, history and types of computers;
  2. explain how the CPU, memory and storage work together and how early designs shaped modern computers;
  3. identify input and output devices and choose suitable ones for a task;
  4. explain the memory hierarchy and compare storage technologies, including HDD and SSD;
  5. describe the functions and services of an operating system, dual-mode operation, device drivers and open-source systems;
  6. classify application software, trace algorithms and flowcharts, and compare SDLC models;
  7. apply data-security practices: encryption, strong passwords, backup and physical security;
  8. explain networks, the Internet, TCP/IP, the client–server model, intranets and ISPs;
  9. use digital communication tools effectively, safely and politely;
  10. analyse the impact of computing on society and plan their own lifelong learning.

03Topics and hours at a glance

No.TopicHoursParasContent
1Course Overview and Expectations4Paras 1–2Significance of computer literacy in the digital age; course structure and expectations; fundamental characteristics of computer systems; history, generations and classification of computers.
2Understanding Computer Technology4Paras 3–4CPU, memory and storage; how the parts work together to process and store information; the machine cycle and buses; instruction sets; early computer designs (von Neumann, Harvard) and why they matter today.
3Input & Output Devices4Paras 5–6Keyboard, mouse, joystick, trackball, light pen, image scanner, recognition devices; types of monitors, printers, plotters and projectors.
4Primary Memory4Paras 7–8Purpose of memory; the memory hierarchy; why memory is crucial for software performance; RAM (SRAM, DRAM) and ROM types; memory units.
5Data Storage2Para 9Magnetic, optical, magneto-optical and solid-state storage; the structure of a hard disk and how data is stored; HDD vs SSD.
6Operating System Functions and File Management4Paras 10–11Functions of an operating system; OS services; processes and scheduling; memory, file and device management; dual mode of operation; device drivers; types of OS; open-source operating systems.
7Application Software and Software Development Lifecycle4Paras 12–13Types of software and application software with examples and use cases; development tools; algorithms and flowcharts; the software development life cycle; waterfall vs incremental models.
8Midterm Exam2Para 14Written / computer-based test on Topics 1–7.
9Data Security2Para 15Introduction to data security (CIA); threats; encryption; password security; backup and recovery; physical security.
10Internet and WWW4Paras 16–17Networking and the Internet; network applications; TCP/IP; Internet vs intranet; the client–server model; ISP; the Web, browsers, search engines and DNS.
11Communication Tools and Techniques2Para 18E-mail, instant messaging, video meetings and collaboration platforms; sharing permissions; netiquette; recognising phishing.
12Computing’s Impact on Society2Para 19Local and global impact of computing on individuals and organisations; work, the digital divide, privacy, health, environment, ethics and AI.
13Staying Current in the Digital World2Para 20Tools and techniques for staying updated; judging sources; keeping devices current; lifelong learning and SMART goals.
14Recap and Future Applications2Para 21Review of key concepts; computer literacy in different fields and professions; future applications.
15Revision Sessions2Para 22Structured revision of the whole course; common mistakes; practice final exam.
16Final Exam1after para 22Final exam on the whole course (Topics 1–15).
Total4522 paras + 1 h42 h of lessons (21 paras) · midterm 2 h (1 para) · final exam 1 h

Each square below is one hour; click it to jump to that para’s plan.

Computer basics and hardwareSoftwareSecurity, networks and communicationPeople, society and the futureExams

04Para-by-para plan

Slide numbers refer to the PowerPoint decks; the ▶ buttons open the interactive slides at that point.

1

Course Overview and Expectations

4 hours · Paras 1–2
Para 1hours 1–2

Computer literacy, the course, what a computer is, evolution

Why computer literacy matters; course map, assessment and expectations; definition of a computer, input → processing → output, main components; characteristics and limitations; manual and automated computing devices; the evolution timeline.

▶ Interactive in the slides
  • Computer-literacy self-rating
  • Input / processing / storage / output sort
  • Computing-history timeline
Exercises (class / homework)
  1. 1Computer Components
  2. 2Evolution of Computers Timeline
  3. 3Computer Literacy and the Course
  4. 4Knowledge Challenge
Para 2hours 3–4

Generations, classification and the computer system

The five generations of computers; classification by operating principle, application and size; inside a microcomputer; hardware, software, data and people; applications of computers; review.

▶ Interactive in the slides
  • Which generation? sort
  • Analog, digital or hybrid? sort
Exercises (class / homework)
  1. 1Five Generations of Computers
  2. 2Classify the Computer
  3. 3Computer Components
  4. 4Knowledge Challenge
2

Understanding Computer Technology

4 hours · Paras 3–4
Para 3hours 5–6

The CPU, the memory subsystem and internal communication

Architecture vs organisation; the block diagram and CPU cycle; arithmetic, logic and control units; main memory, cache and the six registers; processor–memory communication (MAR, MDR, read and write); processor–I/O communication.

▶ Interactive in the slides
  • Which CPU unit? sort
  • Register, cache or main memory? sort
  • I/O-write ordering
Exercises (class / homework)
  1. 1CPU Components
  2. 2Memory and I/O Sequencer
  3. 3CPU Registers
  4. 4Identify the Component
  5. 5Knowledge Challenge
Para 4hours 7–8

The machine cycle, buses, instruction sets and early designs

Fetch, decode, execute, store; data, address and control buses; CISC vs RISC; CPU, memory and storage working together; von Neumann vs Harvard architecture; how early designs shaped today’s computers; review.

▶ Interactive in the slides
  • CPU machine-cycle simulator
  • Which bus? sort
  • CISC or RISC? sort
  • Von Neumann or Harvard? sort
Exercises (class / homework)
  1. 1Machine Cycle Sequencer
  2. 2Identify the Component
  3. 3Knowledge Challenge
  4. 4Early Designs Detective
3

Input & Output Devices

4 hours · Paras 5–6
Para 5hours 9–10

Input devices

The keyboard and its key groups; mouse, trackball, light pen, joystick and touchscreen; image scanners and optical resolution; OCR, OMR, MICR and bar-code readers; digital cameras, voice recognition and sensors; recap of input devices.

▶ Interactive in the slides
  • Keyboard explorer with “find the key” game
  • Scanner resolution (dpi) demo
  • Recognition-device scenarios
  • Device-family sort
Exercises (class / homework)
  1. ★Input Devices — Interactive Review
Para 6hours 11–12

Output devices

What an output device is; hard copy and soft copy; types of monitors: CRT, LCD, TFT and today’s LED/OLED displays; monitor specifications; impact and non-impact printers; plotters; voice output systems; projectors (LCD, DLP, laser); terminals; review.

▶ Interactive in the slides
  • RGB pixel colour mixer
  • Resolution and PPI calculator
  • Choose the output device
Exercises (class / homework)
  1. 1Output Device Functions
  2. 2How It Works Sequencer
  3. 3Printer Specs
  4. 4Which Device?
  5. 5Final Knowledge Challenge
  6. 6Monitors and Projectors
4

Primary Memory

4 hours · Paras 7–8
Para 7hours 13–14

Purpose of memory, the hierarchy and capacity

Why a computer needs memory; three categories of memory; the memory hierarchy (speed, size, cost); why memory matters for software performance; bits, bytes, words and addresses; capacity units (× 1 024).

▶ Interactive in the slides
  • Memory-speed explorer
  • RAM-full slowdown demo
  • KB / MB / GB converter with practice
Exercises (class / homework)
  1. 1Memory Match
  2. 2Put It In Order
  3. 3Memory Hierarchy Detective
  4. 4Memory Knowledge Challenge
5

Data Storage

2 hours · Para 9
Para 9hours 17–18

Storage devices, the hard disk, HDD vs SSD

Magnetic tape and magnetic disk; inside a hard disk (platters, heads, actuator, tracks, sectors, cylinders) and how data is stored; optical and magneto-optical storage; SSDs; HDD vs SSD; choosing a storage device. If time is short, optical/MO slides 16–23 are self-study.

▶ Interactive in the slides
  • Spinning hard-disk simulator
  • HDD read ordering
  • HDD or SSD? scenarios
  • Storage-family sort
Exercises (class / homework)
  1. 1Storage Match
  2. 2Put It In Order
  3. 3Storage Family Sort
  4. 4Choose the Storage
  5. 5Storage Knowledge Challenge
  6. 6HDD vs SSD Detective
6

Operating System Functions and File Management

4 hours · Paras 10–11
Para 10hours 19–20

OS functions, services, processes and scheduling

The OS as resource manager; history; five functions; OS services and system calls; process states and the PCB; FCFS, SJF, priority and round robin scheduling; synchronisation, interprocess communication and deadlock.

▶ Interactive in the slides
  • CPU-scheduling simulator (Gantt chart)
Exercises (class / homework)
  1. 1OS Match
  2. 2Put It In Order
  3. 3OS Detective
  4. 4Operating Systems Knowledge Challenge
Para 11hours 21–22

File and device management, dual mode, open source

Memory, file, device and security management; device drivers; user mode vs kernel mode; six types of OS; GUI and CLI; MS-DOS, Windows and UNIX; open-source vs proprietary operating systems; review.

▶ Interactive in the slides
  • System-call journey (user ↔ kernel mode)
  • Which type of OS? scenarios
Exercises (class / homework)
  1. 1OS Match
  2. 2Put It In Order
  3. 3OS Types Sort
  4. 4OS Detective
  5. 5Operating Systems Knowledge Challenge
  6. 6OS Services and Modes
7

Application Software and Software Development Lifecycle

4 hours · Paras 12–13
Para 12hours 23–24

Types of software and application software

System vs application software; four families of software; OS, utilities and drivers; translators, linkers, debuggers and editors; standard and unique applications; types of application software with examples and use cases; desktop, web and mobile apps.

▶ Interactive in the slides
  • Software-family sort
Exercises (class / homework)
  1. 1Software Match
  2. 2Put It In Order
  3. 3Software Sort
  4. 4Software Knowledge Challenge
Para 13hours 25–26

Algorithms, flowcharts and the SDLC

Algorithms, pseudocode and flowchart symbols; sequence, selection and repetition; the software life cycle; waterfall vs incremental models; review. Homework: midterm preparation with 8-dars.

▶ Interactive in the slides
  • Step-by-step flowchart tracer
  • SDLC ordering
  • Waterfall or incremental? scenarios
Exercises (class / homework)
  1. 1Put It In Order
  2. 2Flowchart Symbols
  3. 3Logic Detective
  4. 4Software Knowledge Challenge
  5. 5SDLC Detective
8

Midterm Exam

2 hours · Para 14
9

Data Security

2 hours · Para 15
Para 15hours 29–30

Data security

The CIA triad; threats and malware; encryption (symmetric, public-key, HTTPS); strong passwords, 2FA and password managers; full, incremental and differential backups, the 3-2-1 rule and data recovery; physical security; everyday habits.

▶ Interactive in the slides
  • Name-that-threat scenarios
  • Caesar cipher with code-breaking game
  • Password-strength meter
  • Backup-restore puzzle
Exercises (class / homework)
  1. 1Security Match
  2. 2Put It In Order
  3. 3Threats and Protections Sort
  4. 4Security Detective
  5. 5Data Security Knowledge Challenge
10

Internet and WWW

4 hours · Paras 16–17
Para 16hours 31–32

Data communication and computer networks

Elements of data communication; the modem; LAN, MAN and WAN; the Internet and the intranet; client–server vs peer-to-peer; topologies (bus, star, ring, mesh, tree, hybrid); network media; protocols and packets; network applications.

▶ Interactive in the slides
  • Message journey through a network
  • LAN, MAN or WAN? sort
  • “Break the network” topology simulator
Exercises (class / homework)
  1. 1Network Match
  2. 2Put It In Order
  3. 3Topology Sort
  4. 4Network Detective
  5. 5Networks Knowledge Challenge
Para 17hours 33–34

The Internet and the World Wide Web

Internet vs Web; history from ARPAnet; packet switching and TCP/IP; Internet applications; web pages, servers and URLs; browsers and search engines; e-mail; IP addresses, DNS and ISPs; the TCP/IP and OSI models; what happens when you open a website.

▶ Interactive in the slides
  • Internet-history timeline
  • URL dissector
  • Search-operator lab
  • “Open a website” journey
Exercises (class / homework)
  1. 1Internet Terms Match
  2. 2Put It In Order
  3. 3E-business and OSI Sort
  4. 4Internet Detective
  5. 5Internet Knowledge Challenge
11

Communication Tools and Techniques

2 hours · Para 18
Para 18hours 35–36

Communication tools and techniques

Synchronous vs asynchronous communication; e-mail parts, writing and To/Cc/Bcc; instant messaging; video conferencing; collaboration platforms and sharing permissions; choosing the right tool; netiquette; spotting phishing.

▶ Interactive in the slides
  • Live or later? sort
  • To / Cc / Bcc: who sees what
  • Viewer / commenter / editor scenarios
  • Spot-the-phishing e-mail
Exercises (class / homework)
  1. 1Communication Match
  2. 2Put It In Order
  3. 3Communication Tools Sort
  4. 4Communication Detective
  5. 5Communication Knowledge Challenge
12

Computing’s Impact on Society

2 hours · Para 19
Para 19hours 37–38

Computing’s impact on society

Local and global impact on individuals and organisations; computing in Uzbekistan; benefits and challenges; work and jobs; the digital divide; privacy; health; environment; ethics and AI; digital citizenship.

▶ Interactive in the slides
  • Benefit or challenge? sort
  • Screen-time calculator
  • AI dilemmas class vote
Exercises (class / homework)
  1. 1Society Match
  2. 2Put It In Order
  3. 3Impact Sort
  4. 4Impact Detective
  5. 5Computing and Society Knowledge Challenge
13

Staying Current in the Digital World

2 hours · Para 20
Para 20hours 39–40

Staying current in the digital world

Why technology changes (Moore’s law); trends; tools for staying updated; judging sources (CRAAP); keeping devices current; learning new technology; free learning platforms and portfolios; AI as a learning partner; lifelong learning and SMART goals.

▶ Interactive in the slides
  • Moore’s-law chart
  • Source-reliability checker
  • SMART-goal builder
Exercises (class / homework)
  1. 1Staying Current Match
  2. 2Put It In Order
  3. 3Tools and Sources Sort
  4. 4Learning Detective
  5. 5Staying Current Knowledge Challenge
14

Recap and Future Applications

2 hours · Para 21
Para 21hours 41–42

Recap and future applications

The course in four parts; key concepts of hardware, software, networks and security; big ideas; computer literacy in different fields and professions; IT careers; future applications.

▶ Interactive in the slides
  • Whole-course flashcards
  • Recap quiz: Topics 9–13
  • Career matcher
Exercises (class / homework)
  1. 1Course Terms Match
  2. 2Put It In Order
  3. 3Course Map Sort
  4. 4Careers Detective
  5. 5Course Recap Knowledge Challenge
15

Revision Sessions

2 hours · Para 22
Para 22hours 43–44

Revision sessions

Final-exam map; the active revision method and a personal revision plan; review of Topics 1–7 (8-dars review slides) and 9–14; common mix-ups; connecting topics; mixed practice and the practice final exam.

▶ Interactive in the slides
  • Traffic-light revision planner
  • Whole-course flashcards
  • Mixed practice: random questions
Exercises (class / homework)
  1. 1Final Terms Match
  2. 2Put It In Order
  3. 3Revision Sort
  4. 4Revision Detective
  5. 5Practice Final Exam
16

Final Exam

1 hour · after para 22
Finalhour 45

Final exam (Topics 1–15)

Test on the whole course: multiple choice, true/false, matching and short answer.

05Assessment

Throughout the course

Current assessment

Checks for understanding and exit tickets in every para.

Para 14 · 2 hours

Midterm exam

Topics 1–7.

After para 22 · 1 hour

Final exam

All topics (1–15).

The points for each part follow the institute’s assessment regulations and are announced in the first para.

06How each para works

Warm-up

A question that connects the topic to students’ lives.

Input with interactive slides

Short explanations, revealed step by step.

Hands-on practice

Simulations inside the slides.

Exercises

Online exercises in class or at home.

Exit ticket

Three questions at the end.

07Course policies

Attendance

Come to every para on time. Each topic builds on the previous one; if you miss a para, study its interactive slides and exercises before the next one.

Preparation and practice

After each para, complete the listed exercises. The final knowledge challenge (exercise 5) of every topic is the best self-test.

Academic honesty and AI

Do your own work. Copying, or submitting AI-generated answers as your own, is not allowed. You may use AI to understand an idea if you say so and check the answer yourself.

Devices

Phones and laptops are used for the interactive activities. During exams, phones must be switched off and put away.

Missed exams

A missed midterm or final exam can be retaken only according to the institute’s regulations.

Language

All slides and exercises are available in English and Uzbek; you can switch language on every page.

08Materials