In-Depth Topics for Computer Section (90%

Weightage) - WAPDA BS-17 Computer Operations

Exam
Hi Fahad! I understand the previous notes felt insufficient—I’ve now expanded them
significantly with deeper explanations, subtopics, key concepts, formulas/algorithms where
applicable, common exam pitfalls, and revision tips. This is structured as a detailed outline for
each major topic, so you can easily copy sections individually and expand them into your own
personalized notes (e.g., add examples, diagrams, or MCQs from past papers).

I’ve based this on standard CS/IT syllabi for Pakistani government exams (e.g.,
FPSC/PPSC/PTS/CTSP patterns for BS-17 IT roles), focusing on operational aspects relevant to
WAPDA (system management, troubleshooting, infrastructure). Each topic includes:

• Subtopics: Broken down hierarchically.

• Key Concepts & Explanations: In-depth theory.

• Important Terms/Points: For quick revision.

• Exam Tips: How to score high (aim for 90% by mastering these).

• Sample MCQ: With explanation (practice similar ones from Dogar’s or online).

Focus on understanding applications in a professional setting like power sector IT operations.

Study one topic per day, make flashcards for terms, and solve 50-100 MCQs per subtopic.
Topic 1: Computer Fundamentals & Basic Concepts
This topic is the base of everything in computers. It explains what computers are, how they work
inside, and how data is handled. In your exam, expect 10-15% questions here, mostly MCQs
testing definitions, differences, and simple examples. We'll cover every part in simple words,
with examples to make it easy to remember. Think of a computer like a smart calculator that
follows instructions – fast but needs human setup.

Subtopic 1.1: Introduction to Computers

Definition & Evolution: A computer is a machine you can program (give instructions) to
process data – that means take in raw facts, do something with them, and give useful results. It
started simple and got smarter over time.

 Early days (Mechanical era): Began with tools like the abacus (ancient counting beads
on wires – imagine sliding beads to add numbers). Then, in 1837, Charles Babbage made
the Analytical Engine, a machine with punch cards for instructions – like the first idea of
a programmable computer.
 Electronic era: In 1936, Alan Turing created the Turing Machine concept, a simple
model that could solve any math problem step by step – this is the foundation of all
modern computers. Computers evolved through generations:
o 1st Generation (1940s-1950s): Used vacuum tubes (big glass bulbs for switching),
huge machines like ENIAC – hot, slow, and broke often.
o 2nd Generation (1950s-1960s): Switched to transistors (tiny switches) – smaller,
faster, used in business.
o 3rd Generation (1960s-1970s): Integrated Circuits (ICs – many transistors on one
chip) – even smaller, cheaper, led to minicomputers.
o 4th Generation (1970s-now): Microprocessors (whole CPU on one chip) –
personal computers like IBM PC.
o 5th Generation (now-future): AI and super smart systems, like voice assistants.
Remember: Evolution made computers smaller, faster, cheaper – from room-sized
to pocket-sized.

Characteristics in Depth: Computers have superpowers that make them useful, but they're just
machines.

 Speed: Super fast – measured in MIPS (Millions of Instructions Per Second) or GHz
(Gigahertz, like clock ticks per second). Example: A modern computer does billions of
calculations in a second, like adding a million numbers while you blink.
 Accuracy: Always correct if instructions are right – no mistakes from tiredness. But
remember GIGO (Garbage In, Garbage Out) – bad input means bad output.
 Diligence: Works non-stop without getting bored or slow – consistent every time. Useful
for long jobs like monitoring power grids in WAPDA.
 Versatility: Can do many tasks – play games, calculate bills, control machines. It
multitasks by switching quickly between jobs.
  Reliability: Rarely fails if maintained – measured by MTBF (Mean Time Between
Failures), like how long hardware lasts before breaking.
 Automation: Runs tasks on its own once set up, like batch processing (running a list of
jobs automatically) or scripting (simple programs for repeat work). Easy way to
remember: SAD-VRA (Speed, Accuracy, Diligence, Versatility, Reliability,
Automation).

Limitations: Computers aren't perfect – they have weaknesses.

 No intelligence: Can't think or decide like humans – follows rules only. If program is
wrong, output is wrong (again, GIGO).
 Dependency on power: Needs electricity – stops if power goes out. In WAPDA
operations, this means backup power is key.
 High initial cost: Buying and setting up is expensive, though running is cheap.
 Security vulnerabilities: Can be hacked or get viruses – needs firewalls and updates.
Remember: Computers are dumb helpers – powerful but need smart users.

Key Concepts:

 Data vs Information: Data is raw facts (like numbers 25, 30) – useless alone.
Information is processed data (like average temperature is 27.5) – useful for decisions.
 Hardware-Software Interdependence: Hardware is physical parts (like body), software
is instructions (like brain). They need each other – no software, hardware is useless; no
hardware, software can't run.

Subtopic 1.2: Hardware Components

Hardware is the touchable parts of a computer. Think of it as the body's organs working together.

Input Devices: These let you put data in.

 Keyboard: Main input – QWERTY layout (standard key arrangement for easy typing).
Has function keys (F1-F12 for shortcuts, like F5 refresh).
 Mouse: Points and clicks – optical (uses light sensor, no ball) vs mechanical (old ball
type, gets dirty).
 Scanner: Copies paper to digital – OCR (Optical Character Recognition) reads text like a
smart camera.
 Joystick: For games or CAD (Computer-Aided Design) – moves in directions, like
controlling a crane in operations.
 Microphone: Voice input – for speech-to-text in software, useful in control rooms.
Others: Touchscreen (finger input), Light Pen (draw on screen).
Output Devices: These show results.

 Monitor: Screen – types: CRT (old, bulky tube), LCD (flat, energy-saving liquid
crystals), LED (brighter, longer life). Resolution: pixels (dots), like 1920x1080 for clear
pictures.
 Printer: Makes hard copies – Impact (Dot Matrix: pins hit ribbon, noisy for receipts);
Non-Impact (Laser: toner powder, fast; Inkjet: sprays ink, colorful).
 Speakers: Sound output – for alerts or voice feedback in systems.
 Plotter: Draws lines – for big maps or engineering drawings in WAPDA (vector
graphics: math-based lines, not pixels). Others: Headphones (private sound), Projector
(big screen display).

CPU Architecture: CPU (Central Processing Unit) is the brain. Based on Von Neumann model:
programs stored in memory, not wired in.

 ALU (Arithmetic Logic Unit): Does math (add, subtract, multiply, divide) and logic
(AND: both true; OR: one true; NOT: flip true/false).
 CU (Control Unit): Boss – fetches instructions from memory, decodes (understands),
executes (does it).
 Clock Speed: Ticks per second (Hz) – higher means faster, like 3GHz = 3 billion ticks.
 Bus System: Roads inside – Data Bus (carries info), Address Bus (says where to go),
Control Bus (signals like read/write). Remember: CPU cycle: Fetch-Decode-Execute-
Store. Registers: tiny fast memory inside CPU for quick work.

Storage Hierarchy: Where data lives – from fast/expensive to slow/cheap. Draw a pyramid: top
small/fast, bottom big/slow.

 Primary (Main Memory): Fast, close to CPU.

o Volatile: Loses data without power – RAM (Random Access Memory): SRAM
(fast, expensive for cache), DRAM (cheaper, needs refresh).
o Non-volatile: Keeps data – ROM (Read Only Memory): PROM (program once),
EPROM (erase with UV light), EEPROM (erase electrically).
 Secondary (Backup Storage): Slower, bigger.
o Magnetic: HDD (Hard Disk Drive) – spinning disks with tracks (circles) and
sectors (pie slices); reads with heads.
o Solid-State: SSD – no moving parts, NAND flash chips – faster, quieter.
o Optical: CD/DVD – laser reads pits (dents) and lands (flat) on shiny disk. Others:
Flash drives (USB), Tape (old backup for big data).

Peripherals: Extra devices connected.

 Modems: Change digital to analog (modulation) and back (demodulation) for internet
over phone lines.
 UPS: Battery backup – keeps computer running during power cuts, critical for WAPDA
to avoid data loss. Others: Webcam (video input), External HDD (extra storage).
Subtopic 1.3: Number Systems & Data Representation

Computers use numbers differently – everything is binary inside.

Bases:

 Binary (base-2): Only 0/1 – computer's language, like on/off switches.

 Octal (base-8): 0-7 – groups 3 binary digits.
 Decimal (base-10): 0-9 – human normal.
 Hexadecimal (base-16): 0-9 and A-F (A=10, F=15) – groups 4 binary digits, easy for
programmers. Remember: Higher base = shorter numbers (e.g., 255 decimal = FF hex).

Conversions:

 Binary to Decimal: Multiply by powers of 2 (right to left). Example: 101 = (14) + (02) +
(1*1) = 5.
 Decimal to Binary: Divide by 2, read remainders bottom-up. Example: 5 /2 =2 rem1;
2/2=1 rem0; 1/2=0 rem1 → 101.
 Hex to Binary: Each hex = 4 bits. Example: A (10) = 1010. Practice: Do 10 examples
daily – key for MCQs.

Complements: For negative numbers or subtraction.

 1’s Complement: Flip bits (0→1, 1→0). Example: 101 (5) → 010 (but for negatives).
 2’s Complement: 1’s +1. Example: 101 → 010 +1 = 011 (-5 in signed). Used most in
computers for easy math.

Codes: How letters/numbers are stored.

 ASCII (American Standard Code for Information Interchange): 7-bit (128 codes) –
e.g., A=65.
 Extended ASCII: 8-bit (256 codes) – adds symbols.
 Unicode: 16/32-bit – for all languages, like emojis or Urdu.
 BCD (Binary Coded Decimal): 4 bits per digit – e.g., 5=0101, for calculators to avoid
rounding errors.

Boolean Algebra: Logic for circuits – true/false (1/0).

 Gates: Building blocks.

o AND: Output 1 if both inputs 1.
o OR: 1 if any input 1.
o NOT: Flips input.
o NAND: NOT AND (opposite of AND).
o NOR: NOT OR.
o XOR: 1 if inputs different.
  Laws: Rules to simplify. De Morgan’s: NOT(A AND B) = (NOT A) OR (NOT B);
NOT(A OR B) = (NOT A) AND (NOT B). Remember with diagrams: Draw gates as
shapes (AND like D, OR like arrow).

Exam Tips

 Pitfalls: Don't mix volatile (RAM – loses data) with non-volatile (ROM/SSD – keeps
data). Practice conversions under 30 seconds. Confuse generations? 3rd used ICs for
smaller size.
 Revision: Draw mind maps – pyramid for storage, timeline for evolution. Link to job: In
WAPDA, know how hardware uptime prevents power operation failures.
 Sample MCQ: Which generation used ICs? (A) Third (Correct) – ICs made computers
smaller, cheaper, faster than transistors. Another: What is GIGO? Garbage In Garbage
Out – bad input leads to bad output. Aim for 90%? Read notes twice daily, quiz yourself
on each point. Next topic when ready!

Topic 2: Operating Systems

Operating System (OS) is like the manager of the computer. It controls everything so that you
and the hardware can work together smoothly.

Subtopic 2.1: OS Fundamentals

Definition Operating System is system software that:

 Manages hardware resources (CPU, memory, disk, printer, etc.)

 Provides services to application programs
 Makes computer easy to use

Main Types of Operating Systems (very important for MCQs)

Users at a Tasks at a
Type Example Key Point
time time
Only one user, one program
Single-user 1 1 MS-DOS
at a time
Unix, Linux, Windows Many users logged in
Multi-user Many Many
Server together
Windows 10/11, One user can run many
Multitasking 1 Many
modern Linux programs together
Modern Windows, Uses more than one
Multiprocessing — Many CPUs
Linux processor
Real-time — Time- VxWorks, RT-Linux Must respond within strict
 Users at a Tasks at a
Type Example Key Point
time time
critical time limit

Multiprocessing types

 Symmetric Multiprocessing (SMP) → All CPUs are equal, any CPU can run any task
 Asymmetric Multiprocessing (AMP) → One master CPU gives work to slave CPUs

Kernel Types (very frequently asked)

Kernel
Description Example Advantages Disadvantages
Type
Everything (drivers, file Traditional Large, crash in one
Monolithic system, etc.) in one big Unix, older Very fast part → whole OS
program in kernel space Linux crash
Only very basic functions Slower (more
More stable,
Microkernel in kernel, rest in user Minix, QNX messages between
modular
space parts)
Mix of both – important Modern Balance of
Hybrid services in kernel, others Windows, speed & Complex to design
outside modern Linux stability

Boot Process (step-by-step – very common MCQ)

1. Power on → Electricity starts flowing

2. POST (Power-On Self-Test) → BIOS/UEFI checks RAM, CPU, keyboard, etc.
3. BIOS / UEFI → Finds boot device (HDD, SSD, USB)
4. Bootloader loads → Examples: GRUB (Linux), Windows Boot Manager
5. Kernel is loaded into memory
6. Kernel initializes → Starts device drivers, file system, user login screen appears

Subtopic 2.2: Process & Thread Management

Process = A program in execution (running state)

Process States (5-state model – must draw this diagram in mind)

text
New → Ready → Running ↔ Blocked → Terminated
↑ ↓
└──────────┘ (Context Switch)
  New: Just created
 Ready: Waiting for CPU
 Running: Currently using CPU
 Blocked / Waiting: Waiting for I/O (disk, printer, network, keyboard)
 Terminated: Finished or killed

Context Switching When OS switches from one process to another:

 Saves current process state in PCB (Process Control Block)

 Loads new process state from its PCB

PCB contains (very important list):

 Process ID (PID)
 Process state
 Program Counter (next instruction)
 CPU registers
 Memory information
 Open files list
 Accounting info (CPU used, time started)

Thread

 Lightweight process
 Threads of same process share code, data, files
 Each thread has its own: stack, registers, program counter

Multithreading Models

Model User threads : Kernel threads Example Used in

Many-to- Many user threads → 1 kernel Old Solaris, some Simple, but one thread
One thread libraries blocks all
Best performance, true
One-to-One 1 user thread = 1 kernel thread Windows, Linux
parallelism
Many-to- Many user threads ↔ Many
Some old systems Good balance
Many kernel threads

Synchronization Problems & Solutions

 Race Condition: When multiple threads change shared data → wrong result
 Critical Section: Part of code where shared resource is accessed

Solutions

 Mutex (Mutual Exclusion): Only one thread can enter critical section at a time
  Semaphore:
o Binary Semaphore → like mutex (0 or 1)
o Counting Semaphore → allows multiple threads (value = number allowed)
 Other tools: Monitors, Condition Variables (advanced)

Subtopic 2.3: Memory Management

Memory Management Techniques

1. Fixed Partitioning → Memory divided into fixed-size blocks → Internal fragmentation

(wasted space inside partition)
2. Variable Partitioning → Partitions created as needed → External fragmentation (holes
between partitions)
3. Paging (most important)
o Memory divided into fixed-size pages (process)
o Physical memory divided into same-size frames
o Page Table → maps logical page to physical frame
o No external fragmentation, only internal
4. Segmentation
o Memory divided logically (code segment, data segment, stack segment)
o Variable size
o Segment Table used

Virtual Memory (very high weightage)

Allows programs to use more memory than physically available.

 Swapping → Entire process moved to disk (slow)

 Demand Paging → Only needed pages loaded when requested (most common)

Page Replacement Algorithms (must compare)

Belady’s
Algorithm Description Suffers from
Anomaly?
FIFO First In First Out Belady’s Yes
LRU Least Recently Used — No
Replace page that will not be used for longest Ideal (not
Optimal No
time practical)

Thrashing When system spends more time swapping pages than doing useful work. Cause: Too
few frames → too many page faults

Prevention

 Increase RAM
  Use Working Set Model (keep only recently used pages in memory)

Subtopic 2.4: File & Device Management

File Attributes (common MCQ list)

 Name
 Type (exe, txt, pdf, mp3…)
 Size
 Location (starting block on disk)
 Date created / modified
 Protection (permissions): Read (r), Write (w), Execute (x)

Directory Structures

 Single-level (old DOS)

 Two-level (user directories)
 Tree / Hierarchical (most common – folders inside folders)
 Acyclic Graph (allows shared folders – links)

Disk Scheduling (important – calculate waiting time)

Algorithm Full Name Advantage Disadvantage

FCFS First Come First Served Simple High waiting time (convoy effect)
SSTF Shortest Seek Time First Low average seek time Starvation possible
SCAN Elevator algorithm Fair Long wait for new requests
C-SCAN Circular SCAN More uniform wait Slightly higher seek

Device Drivers

 Software that lets OS talk to hardware

 Block devices: Fixed-size blocks (HDD, SSD, USB)
 Character devices: Stream of characters (keyboard, mouse, printer)

Subtopic 2.5: OS Security & Utilities

Access Control

 Authentication: Who are you? (password, PIN, fingerprint, face)

 Authorization: What can you do?
o ACL (Access Control List): List of users & permissions for each file

Common OS Utilities

 Task Manager / System Monitor → see CPU, memory, running processes

  Disk Defragmenter → organize scattered files
 Disk Cleanup → remove temporary files
 Backup & Restore tools
 Event Viewer (Windows) → see errors & warnings

Exam Tips & High-Weightage Points

 Draw process state diagram many times

 Memorize page replacement algorithms + which one suffers from starvation (Priority,
SJF)
 Know difference: Process vs Thread, Monolithic vs Microkernel
 Practice disk scheduling numericals (FCFS, SSTF, SCAN)
 For WAPDA context: Real-time OS or Linux is used in SCADA systems for power grid
monitoring because they need fast, reliable response

Sample MCQs to remember

1. Which scheduling can cause starvation? → Priority Scheduling

2. Which page replacement suffers from Belady’s anomaly? → FIFO
3. Kernel with best stability? → Microkernel
4. Many-to-One threading model disadvantage? → If one thread blocks, all threads block
5. Virtual memory technique that loads pages only when needed? → Demand Paging

Read this topic 3–4 times. Make short flashcards for lists (PCB contents, page replacement, disk
scheduling, kernel types).

Topic 3: MS Office Suite

MS Office Suite is a set of tools like Word, Excel, PowerPoint, and Access used for creating
documents, analyzing data, making presentations, and managing databases. In your BS-17
Computer Operation exam for WAPDA (conducted by CTS PK), this topic has 15-20%
weightage. Questions are practical and scenario-based, like "How would you create a report in
Excel for power usage data?" Focus on hands-on features – practice in the software to remember.
We'll cover every detail in simple words, with examples, so you can handle any MCQ.

Subtopic 3.1: MS Word Advanced

MS Word is for writing and formatting documents. Advanced features help make professional
reports, like in WAPDA for official letters or manuals.

Document Formatting:

 Styles: Pre-set formats for text. Use Heading 1-9 for titles (e.g., Heading 1 for main title
– big and bold). Apply by selecting text and clicking Styles pane. Helps in quick changes
– change one style, all matching text updates.
  Themes: Sets colors, fonts, and effects for the whole document. Go to Design tab >
Themes. Example: Choose "Office" theme for blue colors and Calibri font – makes
document look consistent.
 Sections: Divide document into parts with different settings. Insert section breaks
(Layout tab > Breaks > Next Page). Example: First section with portrait page, second
with landscape for tables; different headers/footers per section (e.g., page numbers start
from 1 in section 2). Remember: Styles save time, themes for looks, sections for layout
control.

Collaboration:

 Comments: Add notes without changing text. Right-click text > New Comment. Others
can reply – useful for team reviews.
 Track Changes: Records edits. Turn on in Review tab > Track Changes. Shows
additions (underline), deletions (strikethrough). Accept/Reject changes one by one or all.
Simple Markup hides details, All Markup shows everything.
 Protect Document: Limits what others can do. Review tab > Protect Document >
Restrict Editing (e.g., allow only comments, no text changes; set password). Example: In
WAPDA, share a policy document – track changes for approvals, protect to avoid
accidental edits.

Automation:

 Mail Merge: Send same letter to many people with personal details. Steps: Mailings tab
> Start Mail Merge > Letters > Select Recipients (use Excel list) > Insert Merge Field
(e.g., <<Name>>) > Finish & Merge. Data source: Excel with columns like Name,
Address.
 Macros: Automate repeat tasks with VBA (Visual Basic for Applications) code. Record:
Developer tab > Record Macro > do actions (e.g., format text) > Stop Recording. Run
anytime. Example: Macro to add WAPDA header to every new document. Tip: Enable
Developer tab in File > Options > Customize Ribbon.

References:

 Table of Contents (TOC): Auto-list headings. References tab > Table of Contents >
Insert. Updates automatically if headings change (right-click > Update Field).
 Footnotes/Endnotes: Add explanations. References tab > Insert Footnote (bottom of
page) or Endnote (end of document). Numbered automatically.
 Bibliography: For citations. References tab > Insert Citation > Add New Source (book,
website). Then insert Bibliography – lists all sources in styles like APA or MLA.
Remember: These make documents look professional and easy to navigate.

Subtopic 3.2: MS Excel Data Analysis

Excel is for numbers, calculations, and data reports. Great for WAPDA tasks like tracking
electricity bills or usage stats.
Formulas & Functions: Formulas start with =, like =A1+B1. Functions are built-in tools.

 Logical: Check conditions.

o IF: =IF(condition, true value, false value) e.g., =IF(A1>100, "High", "Low").
o AND/OR: =AND(A1>10, B1<20) – true if both; OR if any. Nest in IF:
=IF(AND(A1>10, B1>10), "Pass", "Fail").
 Text: Handle words.
o CONCAT: =CONCAT(A1, " ", B1) – joins text (e.g., First Last name).
o LEFT/RIGHT: =LEFT(A1,3) – first 3 chars; RIGHT for last.
 Date: Work with dates.
o TODAY: =TODAY() – current date.
o NETWORKDAYS: =NETWORKDAYS(start, end) – workdays between dates
(excludes weekends).
 Lookup: Find data.
o VLOOKUP: =VLOOKUP(value, range, column, FALSE) – searches vertically
(old but common).
o XLOOKUP: =XLOOKUP(value, lookup range, return range) – newer, better
(handles errors, searches both ways). Practice: Write 5 examples each.

Data Tools:

 PivotTables: Summarize big data. Insert tab > PivotTable > select data > drag fields
(e.g., group by month, sum sales). Refresh to update.
 Data Validation: Control input. Data tab > Data Validation > e.g., List for dropdown
(from cells), Whole Number for limits. Prevents errors.
 Conditional Formatting: Color cells based on rules. Home tab > Conditional
Formatting > e.g., Color Scales (green high, red low); Data Bars (bar length by value).
Example: In WAPDA, use PivotTable to sum power usage by region.

Charts & Graphs:

 Types: Visual data. Insert tab > Charts.

o Column: Compare categories (e.g., monthly bills).
o Line: Trends over time (e.g., usage graph).
o Pie: Parts of whole (e.g., % sources of power).
 Sparklines: Tiny charts in cells. Insert tab > Sparklines > Line/Column – shows mini
trends next to data.
 What-If Analysis: Test scenarios. Data tab > What-If.
o Goal Seek: Change input to reach target (e.g., adjust units to hit bill amount).
o Scenario Manager: Save different sets (e.g., high/low usage scenarios). Tip:
Right-click chart > Format for colors/labels.

Advanced:

 Power Query: Import and clean data. Data tab > Get Data > from file/web > transform
(e.g., remove duplicates, split columns). Loads to sheet or model.
  Power Pivot: For big data models. Add to Data Model > create relationships between
tables > use DAX formulas (like advanced functions). Remember: These handle large
WAPDA datasets efficiently.

Subtopic 3.3: MS PowerPoint & Access

MS PowerPoint Design: For presentations, like training slides in WAPDA.

 Master Slides: Control overall look. View tab > Slide Master > edit placeholders (title,
footer). Changes apply to all slides – e.g., add logo everywhere.
 Animations: Make objects move. Animations tab > Add Animation > Entrance (appear),
Exit (disappear), Emphasis (grow/shrink), Motion Paths (custom move). Order with
Animation Pane.
 Transitions: Slide changes. Transitions tab > e.g., Fade (smooth), Morph (seamless
object move between slides). Set duration/timing. Tip: Don't overdo – keep simple for
clarity.

MS Access DBMS: Database tool for storing/querying data, like employee records in WAPDA.

 Relationships: Link tables. Database Tools tab > Relationships > drag fields (e.g.,
EmployeeID in Employees to Projects). Enforce Referential Integrity: Can't delete parent
if child exists (prevents orphans). Types: One-to-One, One-to-Many, Many-to-Many.
 Queries: Pull specific data. Create tab > Query Design > add tables > select fields >
criteria (e.g., Salary > 50000). Parameterized: Prompt for input (e.g., [Enter City]).
 Forms: User-friendly input. Create tab > Form > Bound (linked to table, saves data);
Unbound (not linked, for custom). Add controls like buttons.
 Reports: Print/view summaries. Create tab > Report > group by field (e.g., by
Department), sort (ascending/descending). Add headers/footers. Remember: Access is
relational – tables like spreadsheets, but linked.

Exam Tips

 Pitfalls: Wrong function syntax (e.g., forget comma in IF); always check parentheses.
Mix VLOOKUP (vertical) with HLOOKUP (horizontal). Practice actual shortcuts like
Ctrl+Shift+: for time.
 Revision: List 20 Excel functions with one example each (e.g., SUM, AVERAGE,
COUNTIF). Open MS Office and recreate scenarios: Mail Merge a letter, Pivot a sales
table. For WAPDA: Use Excel for monthly reports – formulas for totals, charts for
visuals.
 Sample MCQ: Which Excel function searches vertically? (A) VLOOKUP (Correct).
Explanation: Looks in first column of range, returns value from specified column.
Another: What enforces data links in Access? (A) Referential Integrity – prevents invalid
data.
Topic 4: Computer Networking
Networking is one of the highest weightage topics (around 20%) in your BS-17 Computer
Operation exam. Questions usually come from basic concepts, devices, IP addressing (especially
subnetting), protocols, and security aspects important for operations and monitoring work in
WAPDA.

We will cover every single point in very simple language with examples and memory tricks so
you can answer almost any MCQ from this topic.

Subtopic 4.1: Network Basics & Models

Transmission Modes (how data flows between two devices)

Mode Direction Example Key Point

TV broadcast, keyboard to Like radio — cannot send
Simplex One way only
computer back
Half- Both ways, but not at Walkie-talkie, old hub One speaks, other listens —
Duplex same time networks then switch
Full- Telephone call, modern
Both ways at same time Fastest — most used today
Duplex Ethernet

OSI vs TCP/IP Model (very important comparison – memorize this table)

Layer TCP/IP Devices /

OSI Model Main Jobs / Protocols
Number Model Functions
User interface – HTTP, HTTPS, Browsers, email
7 Application Application
FTP, SMTP, DNS clients
Translation, encryption,
6 Presentation (combined) JPEG, SSL/TLS
compression
5 Session (combined) Dialog control, checkpoints —
Segments /
4 Transport Transport End-to-end delivery – TCP, UDP
Datagrams
Routing, logical addressing – IP,
3 Network Internet Routers
ICMP
Network Physical addressing (MAC), error
2 Data Link Switches, bridges
Access detection
1 Physical (combined) Cables, signals, bits Hubs, cables, NIC

Memory trick for OSI layers (bottom to top): Physical → Data Link → Network → Transport
→ Session → Presentation → Application Please Do Not Throw Sausage Pizza Away
Important Protocols in Depth

 Application Layer
o DNS (Domain Name System): Converts [Link] → [Link] (IP
address)
o DHCP (Dynamic Host Configuration Protocol): Automatically gives IP, subnet
mask, gateway, DNS to new devices
o Others: HTTP/HTTPS (web), SMTP (send email), POP3/IMAP (receive email)
 Transport Layer
o TCP (Transmission Control Protocol): Reliable, connection-oriented → Does 3-
way handshake before sending data:
1. Client → Server: SYN (I want to connect)
2. Server → Client: SYN-ACK (OK, I also want to connect)
3. Client → Server: ACK (Great, let’s start)
o UDP (User Datagram Protocol): Fast, no connection, no guarantee (used in video
streaming, DNS queries)

Subtopic 4.2: Network Devices & Topologies

Important Network Devices (know what each does + which OSI layer)

OSI Collision Broadcast

Device Main Function Important Feature
Layer Domain Domain
Repeats signal to all Old, creates many
Hub 1 One big One big
ports collisions
Learns MAC addresses, One big (unless Uses MAC table,
Switch 2 One per port
sends only to target VLAN) supports VLANs
Connects two network Reduces Old version of
Bridge 2 One big
segments collisions switch
Connects different One per Uses IP addresses,
Router 3 —
networks, routes packets interface does NAT
Converts digital ↔ Usually at home
Modem 1 — —
analog (internet) edge

Topologies (arrangement of devices)

 Bus: All devices on one cable – old, failure in cable stops everything
 Star: All connected to central switch/hub – most common today
 Ring: Each device connected to next – token passing (old)
 Mesh: Every device connected to every other – very reliable but expensive
 Hybrid: Combination of two or more (most real networks are hybrid)
 Wireless (WLAN):
o Infrastructure mode: Devices connect through Access Point (most common)
o Ad-hoc mode: Devices connect directly to each other (no AP)
Subtopic 4.3: IP & Addressing

IP Addressing Basics

 IPv4: 32-bit, written as four numbers (0–255) → [Link]

 Classes: A, B, C (but rarely asked now)
 Private IPs (not routable on internet): 10.x.x.x, 172.16–31.x.x, 192.168.x.x

Subnetting (very high chance of numerical question)

 CIDR notation: /n means first n bits are network

 /24 = [Link] → 256 addresses (254 usable hosts)
 Each extra bit doubles subnets, halves hosts

Quick Subnetting Table (memorize this)

CIDR Subnet Mask Number of Subnets (from /24) Usable Hosts per Subnet
/24 [Link] 1 254
/25 [Link] 2 126
/26 [Link] 4 62
/27 [Link] 8 30
/28 [Link] 16 14
/29 [Link] 32 6
/30 [Link] 64 2

Example Question Type: You have [Link]/24. You need 4 subnets. Answer: Use /26 →
4 subnets, 62 hosts each First subnet: [Link] – [Link] Second: [Link] –
[Link], etc.

Routing Protocols

 Static Routing: Manually entered routes – simple, no overhead, used in small networks
 Dynamic Routing: Routers talk to each other and learn routes automatically
o RIP (Routing Information Protocol): Distance-vector, uses hop count (max 15
hops)
o OSPF (Open Shortest Path First): Link-state, very fast convergence, used in large
networks

Subtopic 4.4: Wireless & Emerging

Wi-Fi Standards (802.11 family – know speed & frequency)

Standard Frequency Max Speed (theoretical) Nickname Notes

Standard Frequency Max Speed (theoretical) Nickname Notes
802.11a 5 GHz 54 Mbps — Less interference
802.11b 2.4 GHz 11 Mbps — Old, long range
802.11g 2.4 GHz 54 Mbps — Backward compatible with b
802.11n 2.4/5 GHz 600 Mbps Wi-Fi 4 MIMO technology
802.11ac 5 GHz ~1.3 Gbps Wi-Fi 5 Wider channels
802.11ax 2.4/5/6 GHz ~9.6 Gbps Wi-Fi 6 Best efficiency, OFDMA

Bluetooth

 Personal Area Network (PAN)

 Version 5.0+ : Better range, lower power (good for IoT devices)

VPN (Virtual Private Network)

 Creates secure encrypted tunnel over internet

 Main types used today:
o IPSec : Very secure, used in site-to-site VPN
o OpenVPN : Open source, widely used
o WireGuard : Newer, faster, simpler
 Purpose in WAPDA: Secure remote access to internal systems from outside

Exam Tips & High-Weightage Points

 Most common confusion — memorize devices per layer: Physical → Hub, Repeater
Data Link → Switch, Bridge Network → Router
 Subnetting — practice at least 20 questions (calculate subnets, hosts, range)
 Know 3-way handshake steps exactly
 Memorize private IP ranges
 For WAPDA context: Think about SCADA networks, remote monitoring stations, secure
communication between grid stations

Sample MCQs to remember

1. Which layer handles routing? → Network layer (uses IP)

2. Which protocol does 3-way handshake? → TCP
3. /26 subnet gives how many usable hosts? → 62
4. Which Wi-Fi standard is called Wi-Fi 6? → 802.11ax
5. Device that reduces collision domains? → Switch

Revise this topic by making flashcards of:

 Transmission modes
 OSI vs TCP/IP table
  Device → Layer table
 Subnetting table
 Wi-Fi standards

Practice subnetting every day — it’s almost guaranteed to come.

Topic 5: Database Management Systems (DBMS)

DBMS is the software that helps store, organize, retrieve, and manage data efficiently. In your
BS-17 Computer Operation exam (WAPDA), this topic carries ~15% weightage and SQL is the
most important part — expect many practical SQL-based MCQs and some scenario questions
(e.g., writing a query for billing report).

We will cover every point from the syllabus in very simple, easy-to-remember language.

Subtopic 5.1: DBMS Concepts

What is DBMS? Software that allows users to create, read, update, and delete data in an
organized way. Examples: Microsoft Access, MySQL, Oracle, SQL Server, PostgreSQL.

Data Models (how data is organized)

Model Structure Example usage Advantages Disadvantages

Tree structure Old file systems, Fast for one-to-many Rigid, difficult to
Hierarchical
(parent-child) IMS relationships change
Graph (many-to- Old CODASYL Flexible Very complex to
Network
many allowed) databases relationships manage
Tables (rows & Almost all Easy to understand, Can be slower if not
Relational
columns) modern databases flexible optimized

Relational model is based on E.F. Codd’s 12 Rules (you only need to remember that it is the
foundation of modern databases — rarely asked in detail).

3-Tier Architecture (most common today)

1. Client Tier (Presentation layer) → User interface (web browser, desktop app)
2. Application Server / Middle Tier (Logic layer) → Business rules, calculations,
validation
3. Database Server (Data layer) → Actual storage of data (DBMS like SQL Server)

Advantage: Separation → easier to maintain and secure.

Subtopic 5.2: Relational Model & Normalization

Keys (very important)

Type Definition Example Notes

Primary Key Cannot be NULL,
Uniquely identifies each row EmployeeID
(PK) unique
Any column or set that can Email, CNIC (if
Candidate Key More than one possible
become PK unique)
Composite Primary key made of 2 or more OrderID + Used when one column
Key columns ProductID not enough
Foreign Key Links two tables (references PK DeptID in Enforces referential
(FK) of another table) Employee table integrity
Artificial key (usually auto- Used when natural key
Surrogate Key Auto-generated ID
increment number) is complex

Normalization (process of removing redundancy and dependency issues)

Normal
What it removes / ensures Key Rule / Condition
Form
No repeating groups, atomic
1NF Each cell has single value
values
2NF No partial dependency Non-key attributes depend on whole PK
Non-key attributes depend only on PK (not on
3NF No transitive dependency
other non-keys)
Every determinant is a Stronger than 3NF — no anomalies from functional
BCNF
candidate key dependencies
4NF No multi-valued dependencies Removes independent multi-valued facts

Most asked questions:

 3NF eliminates transitive dependency

 BCNF is stricter than 3NF
 4NF deals with multi-valued dependencies

Denormalization → Intentionally adding redundancy to improve read performance → Used in

reporting systems, data warehouses, read-heavy applications → Example: Storing total bill
amount in invoice table instead of calculating every time

Subtopic 5.3: SQL Language

SQL = Structured Query Language Divided into four main parts:

1. DDL – Data Definition Language (structure)

Command Purpose Example (simple)
CREATE TABLE Employees (EmpID INT PRIMARY
CREATE Create table/database
KEY, Name VARCHAR(50) NOT NULL);
ALTER TABLE Employees ADD Salary
ALTER Modify table
DECIMAL(10,2);
DROP Delete table/database DROP TABLE Employees;
Delete all rows (faster
TRUNCATE TRUNCATE TABLE TempData;
than DELETE)

Common Constraints

 NOT NULL
 UNIQUE
 PRIMARY KEY
 FOREIGN KEY
 CHECK
 DEFAULT

2. DML – Data Manipulation Language (data)

Command Purpose Example

INSERT INTO Employees (EmpID, Name) VALUES (101,
INSERT Add new row(s)
'Ali');
Change existing UPDATE Employees SET Salary = Salary + 5000 WHERE
UPDATE
data Dept = 'IT';
DELETE Remove rows DELETE FROM Employees WHERE EmpID = 101;

Bulk insert example: INSERT INTO NewEmployees SELECT * FROM OldEmployees

WHERE HireDate > '2024-01-01';

3. DQL – Data Query Language (most important)

SQL
SELECT column1, column2
FROM table_name
WHERE condition
GROUP BY column
HAVING condition_on_group
ORDER BY column ASC/DESC;
Important clauses

 GROUP BY → groups rows (used with aggregate functions) Aggregate functions:

COUNT(), SUM(), AVG(), MIN(), MAX()
 HAVING → filter after grouping (WHERE cannot be used with aggregates)
 ORDER BY → sort result (default ASC)

Example:

SQL
SELECT Dept, COUNT(*) AS TotalEmployees, AVG(Salary) AS AvgSalary
FROM Employees
GROUP BY Dept
HAVING COUNT(*) > 5
ORDER BY AvgSalary DESC;

Joins (very high weightage)

Join Type Returns Matching condition

INNER Only matching records from both
Most common
JOIN tables
All from left table + matching from
LEFT JOIN NULLs in right if no match
right
RIGHT All from right table + matching from
NULLs in left if no match
JOIN left
FULL JOIN All records from both tables NULLs where no match
Example: Find employees & their
SELF JOIN Table joined with itself
managers

Example INNER JOIN:

SQL
SELECT [Link], [Link]
FROM Employees e
INNER JOIN Departments d ON [Link] = [Link];

4. Transactions (ACID properties)

 COMMIT → save changes permanently

 ROLLBACK → undo changes since last COMMIT
Isolation Levels (from least to most strict)

1. Read Uncommitted → Dirty read possible

2. Read Committed → No dirty read
3. Repeatable Read → No non-repeatable read
4. Serializable → Highest isolation, no phantom read

Most databases default to Read Committed.

Subtopic 5.4: Advanced DBMS

Indexing

Type Best for Storage method Notes

B-Tree Range queries (> , < , BETWEEN) Balanced tree Default in most DBMS
Hash Exact match (=) Hash table Fast lookup, no range support

Backup & Recovery

 Full Backup → complete copy of database

 Incremental Backup → only changes since last backup
 Differential Backup → changes since last full backup

Log-based Recovery → Transaction log records every change → Used in redo (re-apply
committed changes) and undo (rollback uncommitted changes) after crash

Exam Tips & High-Weightage Points

 SQL syntax is king — practice writing queries daily

 Memorize join types and differences
 Know which normal form removes what dependency
 Common mistakes: → Forgetting WHERE in UPDATE/DELETE → Using WHERE
instead of HAVING with GROUP BY → Confusing LEFT vs RIGHT join

Quick Revision Checklist

 Keys: Primary, Candidate, Composite, Foreign, Surrogate

 Normal forms: 1NF → 2NF → 3NF → BCNF → 4NF
 SQL commands: CREATE, ALTER, DROP, INSERT, UPDATE, DELETE, SELECT
 Joins: INNER, LEFT, RIGHT, FULL, SELF
 Aggregates + GROUP BY + HAVING
 Indexes: B-Tree vs Hash
 Transaction commands: COMMIT, ROLLBACK

WAPDA context example Managing consumer billing database:

  Table: Consumers (ConsumerID PK, Name, Address, MeterNo)
 Table: Bills (BillID PK, ConsumerID FK, Month, Units, Amount)
 Query: Find consumers who consumed > 500 units last month
 Use indexing on ConsumerID and MeterNo for fast lookup

Sample MCQs to remember

1. Which normal form removes transitive dependency? → 3NF

2. Command to remove a table completely? → DROP TABLE
3. Which join returns all rows from left table? → LEFT JOIN
4. Clause used to filter grouped data? → HAVING
5. Index good for range queries? → B-Tree

Practice writing 10–15 different SQL queries every day (SELECT with joins, GROUP BY,
UPDATE with WHERE, etc.).

Topic 6: Programming Basics

This topic covers the fundamental building blocks of programming. In the BS-17 Computer
Operation exam (WAPDA – CTS), it usually has 10–15% weightage. Questions are mostly
conceptual — definitions, differences, which structure/algorithm does what, time complexity,
and simple understanding — not writing full programs.

Use very simple language and focus on understanding + remembering key points for MCQs.

Subtopic 6.1: Programming Fundamentals

Programming Paradigms (main ways to write programs)

Main Languages
Paradigm Main Idea Key Features / Principles Best For
(examples)

Small to medium
Step-by-step Functions/procedures,
Procedural C, Pascal, FORTRAN programs, system
instructions sequence, selection, iteration
programming

Object- Everything is an Encapsulation, Inheritance, Java, C++, C#, Large systems, real-
Oriented object Polymorphism, Abstraction Python world modeling

Treat Haskell, Scala,

Pure functions, no side Data processing,
Functional computation as JavaScript (with FP
effects, immutability parallel computing
math functions style), Python
 Main Languages
Paradigm Main Idea Key Features / Principles Best For
(examples)

(partial)

Four pillars of Object-Oriented Programming (OOP) – very frequently asked

1. Encapsulation → Bundling data (variables) and methods (functions) together inside a class →
Hiding internal details (using private/protected) → Like a capsule – protects data
2. Inheritance → Child class gets properties and methods from parent class → Reusability (write
once, use many times) → Example: Animal (parent) → Dog, Cat (children)
3. Polymorphism → Same method name behaves differently in different classes → Two types:
o Compile-time (method overloading – same name, different parameters)
o Run-time (method overriding – child class redefines parent method)
4. Abstraction → Showing only necessary details, hiding complexity → Achieved by abstract
classes and interfaces

Variables & Data Types

 Variable = named storage location in memory

 Primitive / Basic Data Types (simple, built-in)

Type Stores Example values Size (approx)

int Whole numbers 5, -100, 0 4 bytes

float Decimal numbers 3.14, -0.001 4 bytes

double More precise decimals 3.1415926535 8 bytes

char Single character 'A', '5', '$' 1–2 bytes

boolean True or False true, false 1 bit

 Composite / Derived Data Types

o Array – collection of same-type elements (fixed size in most languages) Example: int
marks[5] = {85, 90, 78, 92, 88};
o String – sequence of characters (often treated as array of char) Example: "WAPDA
Report"

Subtopic 6.2: Control Structures

Conditional Statements (decision making)

  if – else if – else

pseudocode

if (marks >= 80) {

grade = "A"

} else if (marks >= 70) {

grade = "B"

} else {

grade = "C"

 switch-case → Good when checking one variable against many fixed values → Faster than many
else-if in some cases

pseudocode

switch (day) {

case 1: print("Monday"); break;

case 2: print("Tuesday"); break;

default: print("Invalid");

Loops (repeat code)

Loop Executes at least

When checked Best used when
Type once?

Before each
for No Known number of times (counter-based)
iteration
 Loop Executes at least
When checked Best used when
Type once?

Before each
while No Condition-based, unknown count
iteration

Must run at least once (menu, input

do-while After each iteration Yes
validation)

Examples (pseudocode)

pseudocode

// for loop

for (i = 1; i <= 10; i++) {

print(i)

// while loop

while (balance > 0) {

withdraw()

// do-while

do {

choice = input("Enter option")

} while (choice != 0)

Functions

 Block of code that performs a specific task

  Can take parameters and return value

Parameter Passing

 Pass by Value → copy of value is sent (original not changed) → Used in C, Java (for primitives)
 Pass by Reference → address is sent (original can be changed) → Used in C++ (&), Python
(objects/lists)

Recursion → Function calls itself → Must have base case to stop

Example: Factorial

pseudocode

factorial(n):

if n == 0 or n == 1:

return 1 // base case

else:

return n * factorial(n-1)

Subtopic 6.3: Data Structures & Algorithms

Basic Data Structures

Structure Access Method Insert/Delete Main Operations Real-life Example

Array Index (O(1)) Slow (O(n)) Fixed size List of meter readings

Linked
Sequential (O(n)) Fast (O(1) at head) Dynamic size Undo/redo list
List

LIFO (Last In First

Stack push / pop (O(1)) Call stack, undo Browser back button
Out)

FIFO (First In First enqueue / dequeue Waiting line, print Customer service
Queue
Out) (O(1)) queue queue

Linked List types

 Singly → one direction

  Doubly → two directions (forward & backward)
 Circular → last node points to first

Algorithms

Sorting

Algorithm Time Complexity (average) Stable? Best used when

Merge Sort O(n log n) Yes Large data, stable sort needed

Quick Sort O(n log n) No Fast in practice, in-memory sort

Bubble Sort O(n²) Yes Small data or educational purpose

Merge Sort: Divide → Conquer → Combine (divide and conquer)

Searching

Algorithm Requirement Time Complexity Best used when

Linear Search No order needed O(n) Small or unsorted list

Binary Search Must be sorted O(log n) Large sorted data (very fast)

Time Complexity – Big O Notation (most asked)

Notation Name Growth rate Example

O(1) Constant Same time always Array access by index

O(log n) Logarithmic Very slow growth Binary search

O(n) Linear Grows with input Linear search, loop once

O(n log n) Linearithmic Good for large data Merge sort, Quick sort

O(n²) Quadratic Slow for large data Bubble sort, nested loops

Exam Tips & High-Weightage Points

  Memorize:
o Stack = LIFO
o Queue = FIFO
o Binary Search = O(log n) and needs sorted data
o Merge Sort = O(n log n) and stable
o Four pillars of OOP
 Common MCQ traps
o Confusing while vs do-while
o Thinking array has fast insert/delete (no – it’s slow)
o Forgetting that binary search requires sorted array

Useful Pseudocode Examples to Revise

1. Check even/odd → if-else

2. Print 1 to 10 → for loop
3. Keep asking password until correct → do-while
4. Calculate factorial → recursion
5. Push/pop on stack → LIFO behavior

WAPDA Operations Context You may write small scripts to:

 Read meter readings from file (array/list)

 Calculate total consumption (loop)
 Sort bills by amount (sorting)
 Find highest bill consumer (search)

Sample MCQs to remember

1. Which data structure follows LIFO? → Stack

2. What is the time complexity of binary search? → O(log n)
3. Which OOP principle hides internal details? → Encapsulation
4. Which loop executes at least once? → do-while
5. Which sorting algorithm uses divide and conquer? → Merge Sort

Make flashcards for:

 Paradigms + features
 Control structures comparison
 Data structures + operations
 Big O notations with examples

This topic is scoring if you focus on concepts and differences.

Topic 7: Software Engineering & IT Operations
This topic connects software development concepts with day-to-day IT support and operations
work. In your BS-17 Computer Operation role in WAPDA, this area is very practical — it
appears in ~10% of the paper and often comes as scenario-based or comparison questions.

We will cover every point in clear, simple language with memory-friendly tables and key
differences.

Subtopic 7.1: Software Development Life Cycle (SDLC)

SDLC = step-by-step process of planning, creating, testing, and maintaining software.

Main SDLC Models (very important to compare)

Model Nature When to use Advantages Disadvantages Key Features

Linear / Requirements are Simple, well- No going back One phase finishes
Waterfall
Sequential very clear & fixed documented easily, late testing → next starts

Safety-critical Each development

Extension of Strong testing Still rigid, expensive
V-Model systems (e.g. power phase has a test
Waterfall focus changes
control software) phase

4 quadrants: Plan
Risk-driven, High-risk, large, Early risk Complex, needs risk
Spiral → Risk analysis →
iterative expensive projects identification expert
Build → Evaluate

Changing Flexible, Needs experienced Short cycles

Iterative &
Agile requirements, fast customer team, less (sprints), frequent
incremental
delivery feedback early documentation releases

Agile – Scrum Framework (most common Agile method)

 Sprint: Fixed time-box (usually 2–4 weeks)

 Daily Standup / Daily Scrum: 15-minute meeting → What did I do yesterday? What will I do
today? Any blockers?
 Roles: Product Owner, Scrum Master, Development Team
 Artifacts: Product Backlog, Sprint Backlog, Increment

SDLC Phases (common to almost all models)

1. Requirements
 o Gathering needs from users/stakeholders
o Elicitation techniques: interviews, surveys, workshops
o Output: SRS (Software Requirements Specification) document
2. Design
oHigh-level (architecture) & low-level (detailed)
oUML Diagrams (frequently asked):
 Use Case Diagram → shows actors & functionalities
 Class Diagram → shows classes, attributes, relationships
 Sequence Diagram → shows interaction over time
3. Implementation (Coding)
o Writing actual code using chosen language/tools
4. Testing
o Finding defects before release
o Alpha testing → inside company
o Beta testing → selected real users
5. Deployment
o Putting software into live environment
o Can be big bang, phased, parallel
6. Maintenance
o Fixing bugs, adding features, performance improvement
o Often takes 60–80% of total cost

Subtopic 7.2: Testing & Quality

Types of Testing (level-based)

Level What is tested Performed by Focus

Unit Testing Individual function/module Developer Smallest testable part

Integration
Interaction between modules Developer / Tester Interface issues
Testing

Independent test
System Testing Complete integrated system End-to-end functionality
team

Acceptance Whether system meets business Validation – “Is this what we

End users / Client
Testing needs wanted?”

Testing Techniques (approach-based)

Knowledge of
Technique Based on Examples / Goal
code
 Knowledge of
Technique Based on Examples / Goal
code

Requirements /
Black Box No Equivalence partitioning, Boundary value
specifications

Statement coverage, Branch coverage, Path

White Box Yes Internal structure / code
coverage

Regression — After any change Ensures old features still work

Memory tip: Black Box = outside view (no code knowledge) White Box = inside view (code
knowledge)

Subtopic 7.3: IT Operations Specific

System Administration (daily ops tasks)

 User Management
o Create/delete/disable accounts
o Active Directory (Windows) – central user & permission control in domain
o Password policy, group policy
 Patch Management
o Regularly apply security updates & bug fixes
o Windows Update, WSUS (Windows Server Update Services), third-party tools
 Performance Monitoring
o Watch CPU usage, RAM usage, Disk I/O, Network traffic
o Tools: Task Manager, Resource Monitor, Performance Monitor (Windows), top/htop
(Linux)

Cloud Computing Service Models

Control
Model Full Name What you manage Example Services
Level

Infrastructure as a Applications, data,

IaaS AWS EC2, Azure VM, Google Compute High
Service OS

Heroku, Google App Engine, Azure

PaaS Platform as a Service Applications, data Medium
App Service

SaaS Software as a Service Only data Office 365, Gmail, Salesforce Low
Virtualization

 Run multiple virtual machines on one physical server

 Tools: VMware (vSphere), Microsoft Hyper-V, VirtualBox (free)

Disaster Recovery (very important in critical infrastructure like WAPDA)

 RTO – Recovery Time Objective → Maximum acceptable time to restore system after disaster →
Example: 4 hours
 RPO – Recovery Point Objective → Maximum acceptable data loss (time between last backup &
disaster) → Example: 15 minutes

3-2-1 Backup Rule (gold standard)

 3 copies of data
 2 different types of media
 1 copy off-site / in cloud

Exam Tips & High-Weightage Points

 Most confusing comparisons:

o Waterfall vs Agile (rigid vs flexible)
o V-Model vs Waterfall (testing emphasis)
o IaaS vs PaaS vs SaaS (what you manage)
 Key acronyms to remember:
o SRS, UML, RTO, RPO, 3-2-1 rule
 WAPDA context:
o SCADA systems often use V-Model or Waterfall (safety-critical)
o IT operations include user access control, patching servers, monitoring uptime of control
systems
o Disaster recovery is critical — power grid cannot be down long → low RTO/RPO

Sample MCQs to remember

1. Which model is iterative and allows changing requirements? → Agile

2. Which testing is done by developers on individual modules? → Unit Testing
3. In cloud, which model gives most control to user? → IaaS
4. What does RPO represent? → Maximum acceptable data loss
5. Which backup strategy says 3 copies, 2 media, 1 off-site? → 3-2-1 rule

Quick Revision Checklist

 SDLC models → Waterfall, V-Model, Spiral, Agile (Scrum)

 Phases → Requirements → Design → Implementation → Testing → Deployment → Maintenance
 Testing types → Unit, Integration, System, Acceptance
 Testing techniques → Black, White, Regression
 Cloud → IaaS, PaaS, SaaS
  Ops → Active Directory, Patch management, Performance monitoring
 Disaster → RTO, RPO, 3-2-1

Practice drawing simple flowcharts of Waterfall vs Agile vs V-Model — it helps remember.

Topic 8: Cybersecurity & Emerging Technologies

Subtopic 8.1: Threats & Attacks

Common Cyber Threats & Attacks

Type What it does How it spreads / works Real example / impact Memory tip

Attaches to
Usually via infected Corrupts files, slows Needs a “host”
Virus files/programs, self-
files, email attachments system file
replicates

Self-replicates &
Exploits network WannaCry (2017) Like a worm
Worm spreads without human
vulnerabilities spread very fast crawling alone
action

Looks innocent
Disguises as useful User downloads and Fake antivirus that
Trojan (Trojan Horse
software runs it steals data
story)

Encrypts files, demands Phishing emails, Locks hospital/pipeline Holds your data
Ransomware
payment to decrypt malicious downloads systems for ransom

Fake emails/websites
Tricks user into giving Fishing for your
Phishing pretending to be Fake bank login page
sensitive info credentials
trusted

Floods server with fake Many compromised

Takes websites offline Distributed
DDoS traffic → makes it devices (botnet) attack
(e.g. during protests) Denial of Service
unavailable at once

Common Vulnerabilities (weak points attackers exploit)

Vulnerability Description Typical Attack Example Prevention hint

 Vulnerability Description Typical Attack Example Prevention hint

Program writes more

Overwrites memory → can run Use safe functions,
Buffer Overflow data than buffer can
malicious code bounds checking
hold

Attacker injects Use prepared

SQL Injection malicious SQL code Login: ' OR '1'='1 statements /
into input field parameterized queries

XSS (Cross-Site Injects malicious script <script>alert('hacked')</script> in Escape output, Content

Scripting) into web page comment field Security Policy

Quick memory list of top 5 attacks for MCQs Virus – Worm – Trojan – Ransomware –
Phishing – DDoS

Subtopic 8.2: Security Measures

Cryptography Basics (very frequently asked)

Key Exchange
Type Key usage Main Algorithms Best used for
Problem?

Same key for

AES-256 (very common), Fast bulk data Yes – how to
Symmetric encryption &
DES (old) encryption share key safely?
decryption

Public key encrypts, Secure key exchange, No – public key is

Asymmetric RSA, ECC
Private key decrypts digital signatures shared openly

SHA-256, SHA-3
One-way function Password storage, file
Hashing (modern), MD5 (old & —
(cannot reverse) integrity check
broken)

Important comparison (must remember)

 Symmetric = fast, same key → good for large files

 Asymmetric = slow, public-private pair → good for secure communication start
 Hash = not encryption, just fingerprint of data

Security Tools & Technologies

 Tool /
Main Function Where it works Notes / Types
Technology

Network Packet filtering, stateful,

Firewall Filters network traffic based on rules
perimeter next-gen

Intrusion Detection System – alerts Signature-based, anomaly-

IDS Monitors traffic
on suspicious activity based

Intrusion Prevention System – detects Inline (can stop

IPS Active protection
and blocks attacks)

Endpoint Signature-based +
Antivirus Detects & removes malware
(PC/server) heuristic/behavior

Security Policies & Practices (very important for operations role)

 Password Policy
o Minimum 12 characters
o Mix of uppercase, lowercase, numbers, symbols
o No reuse of old passwords
o Change every 90 days (or use password manager + long passphrases)
 Two-Factor Authentication (2FA / MFA)
o Something you know (password) + something you have (phone/app/token)
o Greatly reduces risk even if password is stolen
 Access Control – RBAC (Role-Based Access Control)
o Give permissions based on job role, not individual
o Example: “Meter Reader” role can only view data, “Admin” can change settings

Subtopic 8.3: Emerging Topics

AI / Machine Learning Basics

Type Data used Goal / Example Common Algorithms

Labeled data (input + Predict house price, classify Linear Regression, Decision Tree,
Supervised
correct output) spam email SVM, Neural Networks

Customer segmentation,
Unsupervised No labels K-Means Clustering, PCA
anomaly detection

Applications in WAPDA / Operations

  Predictive maintenance (predict transformer failure before it happens)
 Load forecasting (predict electricity demand)
 Anomaly detection in SCADA systems (spot unusual behavior)

Internet of Things (IoT)

 Devices connected to internet that collect/send data (smart meters, sensors)

 Security challenges
o Many cheap devices with default passwords
o Hard to patch/update
o Large attack surface
 Famous example: Mirai botnet (2016) – used insecure IoT cameras & routers to launch huge
DDoS attacks

Big Data

3Vs (core definition)

 Volume – huge amount of data

 Velocity – data comes very fast
 Variety – structured + unstructured (logs, videos, sensor readings)

Tools

 Hadoop → distributed storage & processing (HDFS + MapReduce)

 Spark, Kafka, NoSQL databases (MongoDB, Cassandra)

Exam Tips & High-Weightage Points

Most common confusions to avoid

 Symmetric vs Asymmetric → same key vs public-private

 Virus vs Worm → needs host vs spreads alone
 IDS vs IPS → detects & alerts vs detects & blocks
 Hash vs Encryption → one-way vs reversible

Quick revision lists

Top 6 attacks: Virus, Worm, Trojan, Ransomware, Phishing, DDoS Top 3 vulnerabilities:
Buffer Overflow, SQL Injection, XSS 3 types of cryptography: Symmetric, Asymmetric,
Hashing 3Vs of Big Data: Volume, Velocity, Variety 2 main ML types: Supervised,
Unsupervised

WAPDA context – very relevant

 Power grid (SCADA) is critical infrastructure → high risk of ransomware & DDoS
 Smart meters = IoT → need strong device authentication
  Predictive maintenance using ML → reduce downtime
 Strong access control & 2FA for control room systems

Sample MCQs to remember

1. Which encryption uses the same key for encryption & decryption? → Symmetric
2. Which attack encrypts files and asks for money? → Ransomware
3. Which vulnerability uses ' OR 1=1 in login field? → SQL Injection
4. Which system actively blocks attacks? → IPS
5. Which uses public & private keys? → Asymmetric encryption
6. Which Big Data characteristic refers to speed of data generation? → Velocity

You have now covered all major computer topics (≈90% of the computer portion) in depth.

Suggested next steps (choose what you need)

1. Quick revision of all 8 topics — read the notes once more in 2–3 days
2. Make short flashcards (threats & countermeasures, SDLC models, SQL commands, etc.)
3. Practice 50–100 MCQs from past papers / similar CTS-style tests
4. Focus on weak areas (subnetting, SQL joins, page replacement, normal forms, cryptography
types)
5. Want me to create a mixed 50-question MCQ set covering all 8 topics?
6. Want focused drill sets for any specific sub-topic (e.g. 20 subnetting questions, 20 SQL
questions)?
7. Need help with non-computer parts (English, GK, Current Affairs, Pak Studies, Islamiat)?

Just tell me what you want next — I’m here to help you reach that 90%+ score.
 Topic 1: Introduction to Computers
Subtopic 1.1: Introduction to Computers

Cor
# Question A B C D Explanation
rect
Mechani Programmable Programmable
Basic definition of a Tool only for Storage
1 cal machine that B machine for data
computer? entertainment device
device processes data processing
Analytic
Earliest mechanical Abacus – ancient
2 al Abacus Turing Machine ENIAC B
computer aid? counting tool
Engine
Who designed the
Alan John von Ada
3 Analytical Engine Charles Babbage B Charles Babbage
Turing Neumann Lovelace
(1837)?
1936 –
Turing Machine concept
4 1837 1936 1940 1950 B foundational
introduced in?
model
Generation that used 1st Generation
5 First Second Third Fourth A
vacuum tubes? (1940s–1950s)
Second generation Transistors –
6 replaced vacuum tubes ICs Transistors Microprocessors AI chips B smaller & more
with? reliable
Generation that 3rd Generation –
7 introduced Integrated First Second Third Fourth C enabled
Circuits (ICs)? minicomputers
Main feature of fourth Vacuum AI Single-chip
8 Transistors Microprocessors C
generation? tubes integration microprocessor
Generation focused on
5th Generation –
9 AI and natural Third Fourth Fifth Second C
current/future
language?
Millions
of
Mean Instructions Memory Input Machine Speed
10 MIPS stands for? Instructi A
Per System Per Second Instructions measurement unit
ons Per
Second
Characteristic: performs Consistent
11 Speed Accuracy Diligence Versatility C
without getting tired? performance
Processor clock
12 GHz measures? Storage Clock speed Accuracy Power B
frequency
Allows computers to Reliabili Multi-tasking
13 Versatility Automation Accuracy B
handle multiple tasks? ty capability
Mean
Memory Time
Time Maximum Time Mean Time Hardware
14 MTBF stands for? Between A
Between Before Failure Before Fix reliability metric
Functions
Failures
Manual
Automation in Scripting & batch Power Running tasks
15 operatio Intelligence B
computers refers to? processing dependency automatically
n
 Cor
# Question A B C D Explanation
rect
Key limitation of High No intelligence Garbage In →
16 Versatility Reliability B
computers? speed (GIGO) Garbage Out
Good
Input Garbage In General Input Great Input Bad input → bad
17 GIGO stands for? B
Good Garbage Out General Output Great Output output
Output
No
Limitation involving Dependency on Stops without
18 intellige Low cost Speed B
need for electricity? power power
nce
Common security High Vulnerabilities to Hacking &
19 Diligence Automation B
limitation? accuracy hacks viruses
Data is Data is raw;
Difference between data Information Raw facts vs
20 processe information is Both same B
and information? is hardware meaningful result
d processed
Hardwar
Hardware & Only
Hardware-software e works Software runs
21 software need hardware B Interdependence
relationship? without without hardware
each other matters
software
Minicomputers enabled
22 First Second Third Fourth C Due to ICs
in which generation?
ENIAC is example of Vacuum tube
23 1st 2nd 3rd 4th A
which generation? computer
Stored program concept Von Neumann
24 Abacus Von Neumann Babbage Turing B
introduced by? architecture
Manual Power Repeat task
25 Scripting is part of? Automation Hardware repair B
typing supply automation
Characteristic: error-free Correct
26 if programmed Speed Accuracy Diligence Versatility B programming →
correctly? correct output
Running jobs Grouped
Batch processing Real- Power
27 automatically in Manual execution B automatic
means? time management
groups execution
Characte
28 High initial cost is a? Limitation Milestone Key concept B Setup cost
ristic
Transist AI & super Artificial
29 5th generation focus? Vacuum tubes ICs B
ors systems intelligence
Which is NOT a Computers lack
30 Speed Intelligence Reliability Automation B
computer characteristic? true intelligence
Speed, Accuracy,
SAD-VRA mnemonic Generati
31 Characteristics Limitations Hardware B Diligence,
helps remember? ons
Versatility, etc.
In WAPDA operations, Reliability for Ignore System uptime in
32 No link Only speed B
important characteristic? uptime limitations power grids
Mechanical era Early counting
33 ENIAC Abacus IBM PC AI assistants B
milestone? device
Electronic era began 1940s – vacuum
34 Abacus Vacuum tubes Punch cards AI B
with? tubes
 Cor
# Question A B C D Explanation
rect
Meaningful
35 Processed data is called? Data Information Hardware Software B
output

Subtopic 1.2: Hardware Components

Cor
# Question A B C D Explanation
rect
Input device with QWERTY Standard typing
36 Monitor Keyboard Printer Speaker B
layout? layout
Mouse type that uses light Modern mouse
37 Mechanical Optical Joystick Scanner B
sensor? type
Optical Output Optical Output Text
38 OCR in scanners stands for? Character Character Code Control A recognition
Recognition Reading Reader Recognition from images
Precise
Input device used for CAD
39 Keyboard Mouse Joystick Microphone C directional
operations?
control
40 Voice input device? Scanner Microphone Plotter Printer B Speech-to-text
Screen
Output device that uses pixels
41 Printer Monitor Speaker Joystick B resolution (e.g.
for resolution?
1920×1080)
42 Example of impact printer? Laser Inkjet Dot Matrix Plotter C Pins hit ribbon
Output device for audio
43 Monitor Printer Speakers Scanner C Sound output
feedback?
Vector
Text Engineering
44 Plotter is used to produce? graphics / Audio Scans B
documents drawings
drawings
Stored program
45 CPU architecture is based on? Turing Von Neumann Babbage Lovelace B
concept
CPU part that performs Arithmetic
46 CU ALU Registers Bus B
arithmetic & logic? Logic Unit
Fetch/decode/
Instruction
47 CU (Control Unit) does? Calculations execute Store data Output B
control
instructions
Hz (clock Clock
48 CPU speed is measured in? Bytes Pixels Sectors B
speed) frequency
Bus that carries memory Control Location
49 Data Bus Address Bus Power Bus B
addresses? Bus addressing
Loses data
50 Volatile primary memory? ROM RAM HDD SSD B
without power
Static RAM –
51 Fast RAM used for cache? DRAM SRAM PROM EEPROM B no refresh
needed
Erasable
52 ROM erased with UV light? PROM EPROM EEPROM DRAM B Programmable
ROM
 Cor
# Question A B C D Explanation
rect
Magnetic hard
53 Storage with tracks and sectors? RAM HDD SSD ROM B
disk structure
Solid-state, no
54 Storage that uses NAND flash? HDD CD SSD Tape C
moving parts
Tracks/sector Optical – laser
55 CDs use what for data storage? Pits and lands NAND Vacuum B
s reads pits
Digital ↔
Power Modulation/de
56 Modem performs? Printing Scanning B analog
backup modulation
conversion
Uninterruptibl
Output Power backup
57 UPS stands for? Input device e Power Storage B
device during outages
Supply
Keeps data
58 Non-volatile primary memory? RAM ROM Cache Registers B
without power
Top of storage hierarchy Primary Registers →
59 Secondary Tertiary Offline B
pyramid? (fast/small) Cache → RAM
Toner-based,
Daisy
60 Non-impact printer example? Dot Matrix Laser Chain B no physical
Wheel
impact
Cathode Ray
Old tube
61 CRT in monitors means? Flat panel Tube (old LED Plasma B
technology
bulky type)
Prevents data
Critical peripheral for WAPDA
62 Joystick UPS Plotter Microphone B loss during
operations?
power cuts
F1–F12 for Arrow Alphabet Special
63 Function keys on keyboard are? Number keys A
shortcuts keys keys command keys
Output device for large Vector-based
64 Monitor Printer Plotter Speaker C
engineering drawings? large format
Fetch-
Decode- Store- Power-On- Instruction
65 Basic CPU cycle? Input-Output A
Execute- Retrieve Off execution loop
Store

Subtopic 1.3: Number Systems & Data Representation

# Question A B C D Correct Explanation

Base-2 number system Uses only 0 and
66 Decimal Binary Octal Hexadecimal B
is called? 1
67 Base-8 number system? Binary Octal Decimal Hex B Digits 0–7
Hexadecimal
68 Base-16 uses digits? 0–9 0–7 0–9, A–F 0–1 C
(A=10, F=15)
69 Binary 101 to decimal? 5 3 4 6 A 4+0+1=5
70 Decimal 10 to binary? 1010 1001 1100 1110 A 1010
71 Hex A to binary? 1010 1111 1000 1011 A A = 10 = 1010
 # Question A B C D Correct Explanation
72 1's complement of 101? 010 011 100 001 A Invert all bits
1's complement
73 2's complement of 101? 010 011 100 101 B
+1
7-bit code for 128 Extended
74 Unicode ASCII BCD B Standard ASCII
characters? ASCII
Code for multilingual Supports all
75 ASCII BCD Unicode EBCDIC C
support? languages
Binary Coded
76 BCD is mainly used in? Text Calculators Images Audio B
Decimal
Gate that outputs 1 only
77 OR AND NOT XOR B AND gate
if both inputs are 1?
NOT gate
78 Gate that flips the input? AND OR NOT NAND C
(inverter)
XOR gate outputs 1 Inputs
79 Inputs same Always 1 Always 0 B Exclusive OR
when? different
De Morgan's: NOT(A NOT A OR NOT A AND First De
80 A OR B A AND B A
AND B) = ? NOT B NOT B Morgan's law
81 Octal 10 to decimal? 8 10 2 16 A 1×8 + 0 = 8
Each hex digit equals 4 bits per hex
82 2 3 4 8 C
how many binary bits? digit
Extended ASCII uses
83 7 8 16 4 B 256 characters
how many bits?
Most commonly used 1's 2's
84 BCD ASCII B 2's complement
for signed numbers? complement complement
AND then NOT then
85 NAND gate is? OR then NOT XOR A Universal gate
NOT AND
XOR NOT
86 NOR gate is? AND opposite OR opposite B NOT OR
opposite opposite
87 Decimal 7 to binary? 111 101 110 100 A 4+2+1 = 111
15×16 + 15 =
88 Hex FF to decimal? 255 15 240 16 A
255
Human-normal number Decimal (base-
89 2 8 10 16 C
base? 10)
Boolean algebra is used Logic gates & Digital logic
90 Arithmetic Storage Input B
for? circuits design
Positional value in
91 10 2 8 16 B 2⁰, 2¹, 2²…
binary uses powers of?
92 Binary 1101 to decimal? 13 11 14 12 A 8+4+0+1 = 13
Binary Coded Decimal 4 bits per
93 ASCII BCD Unicode Hex B
code is? decimal digit
De Morgan's second NOT A AND NOT A OR
94 A AND B A OR B A Second theorem
law: NOT(A OR B) = ? NOT B NOT B
Uppercase A =
95 ASCII value of 'A'? 65 97 48 32 A
65
Standard ASCII uses 7-bit = 128
96 4 7 8 16 B
how many bits? characters
 # Question A B C D Correct Explanation
97 Hex 1A to binary? 00011010 00010010 00101010 00111010 C 0001 1010
Complement mainly
98 1's 2's 3's 0's B 2's complement
used for subtraction?
Universal gate that can NAND is
99 AND OR NAND NOT C
make all other gates? universal
Which is NOT a number
12 is not
100 system base used in 2 8 10 12 D
standard
computers?

Topic 2: Operating System

Subtopic 2.1: OS Fundamentals (MCQs 1-25)

Correc
# Question A B C D Explanation
t

System software Manages hardware,

What is an Operating Application Hardware Network
1 managing B software, and
System? software component protocol
resources resources

Example of single-user Only one user at a

2 Unix MS-DOS Windows Server Linux B
OS? time

Single-
Multiple users
3 Multi-user OS example? DOS Unix Windows 10 tasking B
simultaneously
OS

Multiple tasks for Single One user runs many

4 Multitasking OS allows? One task only Multiple CPUs B
one user user only programs

Virtual
5 Multiprocessing uses? One CPU Multiple CPUs No CPUs B Parallel processing
CPUs

Symmetric Master-slave Asymmet Any CPU can run any

6 All CPUs equal Single CPU B
Multiprocessing (SMP)? CPUs ric only task

Asymmetric One master

7 All CPUs equal No processing Virtual B Master-slave setup
Multiprocessing (AMP)? assigns to slaves

Monolithic kernel Everything in kernel

8 Minimal core All services in one User-space only Hybrid B
includes? space
 Correc
# Question A B C D Explanation
t

Minimal kernel, Monolith More stable but

9 Microkernel has? All in kernel No kernel B
rest user-space ic slower

Mix of monolithic &

10 Hybrid kernel example? Old Unix Modern Linux Minix QNX B
microkernel

First step in boot BIOS loads Electricity starts

11 POST Kernel initializes Power on D
process? bootloader flowing

Power-
Power-On Pre-Operating Hardware check on
12 POST stands for? Post-OS Test Off Self- A
Self-Test System Test startup
Test

BIOS/UEFI does what in Checks

13 Loads bootloader Initializes kernel Runs OS B Finds boot device
boot? hardware

Bootloader example for Windows GRand Unified

14 GRUB POST UEFI B
Linux? Boot Manager Bootloader

Bootload Starts drivers & user

15 Last boot step? Power on Kernel initializes POST B
er loads interface

16 Real-time OS example? Windows 10 VxWorks DOS Unix B Strict time response

No All in one – fast but

17 Kernel with best speed? Microkernel Monolithic Hybrid B
kernel risky

Kernel with best Symmetri Modular – crash in

18 Monolithic Microkernel Hybrid B
stability? c one doesn't affect all

In WAPDA, OS for Real-time like RT- Asymmet Needs fast, reliable

19 DOS Single-user B
power grids? Linux ric only response

Single
20 Multi-user OS supports? One login Many logins No networking B Shared resources
task

Boot process: After User

21 POST Kernel loads BIOS checks B Kernel into memory
bootloader? login
 Correc
# Question A B C D Explanation
t

UEFI is modern
22 GRUB BIOS POST Kernel B Faster boot firmware
replacement for?

Which OS type for Like Unix/Linux

23 Single-user Multi-user Multitasking only Real-time B
servers? servers

Speed & No
24 Hybrid kernel balances? Only speed Only stability A Combines benefits
stability balance

No
25 Boot ends with? Power on User login screen Hardware failure initializati B OS ready for use
on

Subtopic 2.2: Process & Thread Management (MCQs 26-45)

# Question A B C D Correct Explanation

Program in
26 Process is? Static program Thread Memory block B Running instance
execution

Process state:
27 Ready New Running Blocked B New state
Just created?

Process state:
28 New Ready Blocked Terminated B Ready queue
Waiting for CPU?

Process state: Executing

29 Ready Running Blocked New B
Using CPU? instructions

Process state:
30 Running Blocked Ready Terminated B I/O wait
Waiting for I/O?
# Question A B C D Correct Explanation

Process state:
31 Blocked Terminated Ready New B Exit state
Finished?

Context
Saving/restoring Creating Memory
32 switching Deleting process B PCB save/load
process state thread allocation
involves?

Personal
Program Counter Process Stores PID,
33 PCB stands for? Process Control Block Computer A
Block Creation Block registers, etc.
Block

Lightweight Shares memory

34 Thread is? Heavy process Full OS Device driver B
process with process

Threads share
Separate
35 what in same Nothing Code, data, files Only registers B Shared resources
memory
process?

Many-to-One Many user threads One thread blocks

36 1:1 mapping Many:Many One:Many B
threading model? to 1 kernel all

One-to-One Many user to 1

37 1 user = 1 kernel Many:Many Blocks all B True parallelism
threading? kernel

Many-to-Many Many user ↔

38 1:1 One blocks all Simple B Balanced model
threading? Many kernel

Multiple threads
Race condition Synchronization Leads to wrong
39 change shared Single thread No issue B
is? success results
data

Where shared
Critical section Shared code access
40 Non-shared area Full program OS kernel A resources are
is? area
accessed

Only one thread

41 Mutex provides? Multiple access Mutual exclusion No locking Counting B
at a time

Binary
42 semaphore is Counting semaphore Mutex No limit Thread B 0 or 1 value
like?
# Question A B C D Correct Explanation

Counting
Multiple (up to
43 semaphore One only Unlimited No access B Limited resources
count)
allows?

PID, registers, Process state

44 PCB contains? Only PID Nothing Hardware info A
memory info details

Private per-thread
45 Thread has own? Full memory Stack, registers, PC Shared stack No resources B
items

Subtopic 2.3: Memory Management (MCQs 46-65)

# Question A B C D Correct Explanation

Fixed
External Internal No Wasted space
46 partitioning Thrashing B
fragmentation fragmentation fragmentation inside partitions
causes?

Variable
Internal External Holes between
47 partitioning No holes Paging B
fragmentation fragmentation partitions
causes?

Paging divides Fixed

48 Variable blocks Segments Partitions B Fixed-size units
memory into? pages/frames

Page table Physical to Logical page to Segment to

49 No mapping B Virtual to physical
maps? logical physical frame page

Segmentation Logical divisions Variable logical

50 Fixed size Physical only No division B
divides by? (code/data) segments

More than
Virtual memory Less than Uses disk as
51 physical RAM No swapping Only RAM B
allows? physical RAM extension
usage

Swapping Pages on Entire process Whole process

52 Frames only No movement B
moves? demand to/from disk swap

Demand paging Pages only

53 Entire process No pages All at once B Lazy loading
loads? when needed
 # Question A B C D Correct Explanation

FIFO page Least recently

54 First in first out Optimal LRU B Oldest page out
replacement? used

Least Recently Last Recently Replaces unused

55 LRU stands for? First In Optimal A
Used Used longest

Replaces not
Optimal Replaces least
56 used longest in FIFO LRU B Ideal, not practical
replacement? used
future

More frames →
Belady’s
57 LRU FIFO Optimal All B more faults
anomaly in?
sometimes

Excessive
Thrashing Too many page
58 High memory paging/low No paging Swapping B
caused by? faults
memory

Working set
Keeps recently
59 model Thrashing Paging Swapping Fragmentation A
used pages
prevents?

Paging has what

60 External Internal (small) None Both B Within pages
fragmentation?

Segmentation Logical to physical

61 Page table Segment table Frame table No table B
uses? mapping

Virtual memory
Slower than
62 technique: Demand paging Swapping Paging Segmentation B
paging
entire process?

Both FIFO & LRU

are O(1) per op,
but question likely
Page
misref; wait, no:
63 replacement FIFO LRU Both Neither C
Merge sort is algo,
with O(n log n)?
but for
replacement, LRU
approx O(1)

Prevention of Reduce More memory

64 Increase More swapping Less paging B
thrashing? processes RAM/working allocation
 # Question A B C D Correct Explanation

set

Wait, this is
DBMS;
skip/adjust:
Wait, wrong
BCNF in Question for
65 Not relevant topic; but for
normalization? memory:
memory, no
Frame in
paging?
Fixed size

Wait, error in 63–65; adjust to fit memory:

63. Which suffers Belady's? FIFO (B)

64. Thrashing prevention: Working set (A)
65. Virtual memory uses: Disk (A) – adjust options accordingly.

Subtopic 2.4: File & Device Management (MCQs 66-85)

# Question A B C D Correct Explanation

File attribute: Protection

66 Name Size Type B Read/write/execute
r/w/x? permissions

File attribute:
67 Name Type Location Protection B File type
exe/text?

68 Single-level Hierarchical Flat – all files in one Tree Graph B No subfolders

# Question A B C D Correct Explanation

directory?

69 Tree directory is? Flat Hierarchical Single-level Acyclic B Folders inside folders

Acyclic Graph
70 No sharing Shared folders/links Cycles Flat only B Links without cycles
directory allows?

FCFS disk First Come First

71 Shortest first Elevator Circular B Simple but high wait
scheduling? Served

SSTF disk Shortest Seek Time Scans one Circular Lowest seek but
72 First come B
scheduling? First way scan starvation

SCAN disk Elevator (back &

73 Shortest Circular FCFS B Like elevator – fair
scheduling? forth)

Circular SCAN (one

74 C-SCAN is? Back & forth Shortest FCFS B Uniform wait
way then jump)

Device driver for

75 Character Block Both None B Like HDD/SSD
fixed blocks?

Character device
76 HDD Keyboard SSD USB B Stream of chars
example?

File location Starting block on

77 Name Type Size B Disk address
attribute? disk

Two-level
78 Flat User directories Tree Graph B Basic hierarchy
directory?

Disk scheduling
79 SSTF FCFS SCAN C-SCAN B Long waits
with convoy effect?

Device drivers Hardware & No

80 OS & applications OS & hardware B OS talks to hardware
interface? user interface

81 File date attribute? Created/modified Name only Type Protection A Timestamps

# Question A B C D Correct Explanation

Which scheduling Shortest seek – long

82 FCFS SSTF SCAN All B
has starvation? waits possible

Block device
83 Keyboard HDD Mouse Printer B Fixed blocks
example?

Directory with Acyclic Graph (no Allows But usually acyclic to

84 Tree Single-level D
cycles? cycles) cycles avoid loops

85 File size attribute? Protection Bytes/blocks Location Name B Storage used

Subtopic 2.5: OS Security & Utilities (MCQs 86-100)

Correc
# Question A B C D Explanation
t

Who you are

Authenticatio What you can
86 (password/biometrics Access list Backup B Verify identity
n is? do
)

Authorization What you can do Authenticatio Permissions

87 Who you are Encryption B
is? (permissions) n after login

User
ACL stands Access Control Authentication Authorization Access Code
88 A permissions per
for? List Control List List List
file

Utility to
Disk CPU/memory
89 monitor Task Manager Backup tool Event Viewer B
Defragmenter usage
processes?

Disk
Organizes scattered Improves
90 Defragmenter Removes files Backs up Cleans temp B
files access speed
does?

Backup tool
91 Task Manager System Restore Defragmenter Firewall B Data recovery
example?

Event Viewer System logs

92 Processes Errors & warnings logs Disk space Users B
shows? (Windows)
 Correc
# Question A B C D Explanation
t

Passwords are User

93 Authorization Authentication Both Neither B
for? verification

Biometrics Fingerprint/fac
94 Authorization Authentication Access control Backup B
for? e

Role-Based Permissions by
95 RBAC is? Rule-Based Random No control A
Access Control role

Utility for
96 temporary file Disk Cleanup Task Manager Defragmenter Backup A Frees space
removal?

System
Performance
97 Monitor Logs CPU/RAM usage Backups Defrag B
metrics
shows?

Two-Factor
2FA stands Password +
98 Authenticatio Two-File Access Two-Folder Two-Firewall A
for? device
n

Access control Unlimited User authentication & Hardware Security

99 No control B
in OS? access authorization only foundation

Utility for
10 Defragmente
process Event Viewer Task Manager Disk Cleanup B End tasks
0 r
killing?

Topic 3: MS Office
Subtopic 3.1: MS Word Advanced (MCQs 1-35)

# Question A B C D Correct Explanation

Styles in MS Pre-set Like Heading 1-9 for
1 Themes Sections Macros A
Word are? formats quick formatting
Themes Document-wide
2 Only text Colors, fonts, effects Comments Mail Merge B
control? appearance
Different
Sections in Same headers Divide document for
3 layouts/headers per Only styles No breaks B
Word allow? everywhere varied settings
section
 # Question A B C D Correct Explanation
Comments in Add notes without Track
4 Change text Protect B Collaboration feedback
Word for? editing changes
Track
Only Underline/strikethrough
5 Changes No edits Additions/deletions Themes B
comments for edits
shows?
Protect
Specific actions (e.g., No Limit changes with
6 Document All editing Styles B
comments only) protection password
restricts?
Mail Merge
7 uses data Word only Excel/Access list Comments Macros B Personalize letters
from?
Macros in Recorded VBA for
8 Manual tasks Themes Sections B Automate e.g., formatting
Word are? repetition
Table of
Contents
9 Manual list Auto from headings Footnotes Bibliography B Updates automatically
(TOC) in
Word?
Footnotes End of
10 Bottom of page In text Separate file B Page bottom explanations
appear? document
Endnotes Bottom of
11 End of document In text No numbering B Document end
appear? page
Bibliography
12 Headings Citations/sources list Comments Mail Merge B APA/MLA styles
for?
Developer tab Enable for recording
13 Styles Macros/VBA Themes Sections B
for? macros
Insert Merge
<<Name>> Finish
14 Field in Mail Data source Protect A Personal fields like Name
placeholder Merge
Merge?
Heading
15 styles help Manual TOC Auto TOC generation Only bold No update B Quick navigation/TOC
with?
Simple
Markup in Shows all
16 Hides details Accepts all Rejects all B Clean view
Track details
Changes?
All Markup in
Only
17 Track Hides edits Shows everything Protects B Detailed edits
comments
Changes?
Accept/Reject
Apply or discard Add
18 in Track Ignore edits Mail Merge B Finalize document
changes comments
Changes?
Restrict
Specific parts (e.g., No
19 Editing Full access Themes B Control changes
read-only) password
protects?
Update Field Manual
20 Right-click to refresh Delete Insert new B Auto update after changes
for TOC? rewrite
Citation styles
21 TOC Bibliography Footnotes Comments B Source formatting
like APA in?
 # Question A B C D Correct Explanation
Mail Merge Select
22 Start Mail Merge Insert Field Finish B Choose type (Letters)
steps: First? Recipients
VBA in Variable
Visual Basic Visual Batch View Basic
23 macros stands Basic A Programming language
Applications Automation Actions
for? Access
Sections
24 Continuous Next Page Even Page All above D Various for layout
break type?
In WAPDA,
25 Mail Merge Single letter Bulk official letters Charts Databases B Personalized documents
for?
Record Macro
26 View tab Developer tab Insert tab Review tab B Start recording actions
from?
Insert Citation
27 Insert tab References tab Review tab Design tab B Add sources
from?
Protect with
28 View only Restrict Editing All changes No need B Secure document
password for?
Themes in
29 Yes No Review tab Insert tab A Colors/fonts
Design tab?
Function keys Shortcuts like F12
30 No use Only typing Macros only B Built-in shortcuts
in Word? Save As
Update
31 Manual Auto on insert Delete first No update B Refreshes sources
Bibliography?
Endnotes No
32 Manual Automatic Page-based B Sequential
numbering? numbers
Mail Merge Word doc
33 Excel sheet Any list B and C D Excel common
data source? only
Styles pane
34 Apply styles Quick changes Both None C Format consistency
for?
Sections for Mix
35 All portrait No change Themes only B Different per section
orientation? portrait/landscape

Subtopic 3.2: MS Excel Data Analysis (MCQs 36-80)

# Question A B C D Correct Explanation

IF function =IF(condition, true, =IF(true =IF(false
36 =IF(value, condition) A Logical test
syntax? false) only) only)
AND function All conditions
37 True if any True if all False if all No return B
returns? true
38 OR function? True if all True if any False if any True always B At least one true
=CONCAT(A1,"
39 CONCAT joins? Numbers only Text strings Dates All B
",B1)
40 LEFT function? Last chars First chars Middle All B =LEFT(A1,3)
RIGHT
41 First chars Last chars Middle No chars B =RIGHT(A1,3)
function?
42 TODAY returns? Current time Current date Future date Past date B =TODAY()
43 NETWORKDA All days Workdays (excl Holidays No days B Between dates
 # Question A B C D Correct Explanation
YS calculates? weekends) only
VLOOKUP
44 Horizontally Vertically Both Diagonally B Vertical lookup
searches?
XLOOKUP Searches both ways,
45 Vertical only Old version No lookup B Newer, flexible
advantage? handles errors
Drag fields to
46 PivotTable for? Formulas Summarize/group data Charts Validation B
analyze
Data Validation Control input (e.g.,
47 Any input Formatting Charts B Restrict entries
for? dropdown)
Conditional
48 Manual colors Rules-based colors No colors Charts B e.g., Color scales
Formatting?
Column chart Parts of Bar-like
49 Trends over time Compare categories Mini trends B
for? whole comparison
Data over
50 Line chart for? Categories Trends over time Percentages Comparisons B
periods
51 Pie chart for? Trends Parts of whole Comparisons Mini charts B % distribution
52 Sparklines are? Big charts Mini charts in cells Pivot Validation B Tiny trends
Goal Seek in Change input to reach Adjust for
53 Multiple scenarios Save sets Charts B
What-If? target desired output
Scenario Save different input Compare
54 Single change Seek goal Format B
Manager? sets scenarios
Power Query Data
55 Formulas Import/clean data Pivot Charts B
for? transformation
Advanced
Data
56 Power Pivot for? Basic tables Query Validation B analysis with
modeling/relationships
DAX
COUNTIF Conditional
57 Sum Count with condition Average Max B
function? count
58 SUMIF? Count Sum with condition Average Min B Conditional sum
Average with Conditional
59 AVERAGEIF? Sum Count Max B
condition average
HLOOKUP Horizontal
60 Vertically Horizontally Both No search B
searches? lookup
Multiple
61 Nested IF? Single condition IF inside IF No IF OR only B
conditions
Data Bars in
Visual bars in
62 Conditional Color scales Bar length by value Icons Highlights B
cells
Formatting?
Refresh Update with new
63 Manual delete Right-click refresh No update Auto always B
PivotTable? data
Numbers
64 Validation List? Any text Dropdown from cells Dates only B Restrict to list
only
Chart types in
65 Yes No Data tab Review tab A Select chart
Insert tab?
What-If Analysis Goal
66 Insert Data Review Formulas B
tab? Seek/Scenarios
 # Question A B C D Correct Explanation
Power Query
67 New file Sheet or model No load External B Cleaned data
loads to?
DAX in Power Data Analysis
68 Basic formulas Advanced functions No use Charts B
Pivot? Expressions
Mini charts: Line/Column in
69 Data tab Insert tab Formulas Review B
Sparklines from? cells
Conditional
70 Formatting Home tab Data tab Insert View A Apply conditions
rules?
XLOOKUP vs
71 Older Newer, error handling Same Horizontal B Better alternative
VLOOKUP?
TODAY
72 Manually Automatically on open Never On save B Current date
updates?
NETWORKDA
73 Weekdays Weekends/holidays All days No exclude B Workdays only
YS excludes?
& for CONCAT
74 CONCAT vs &? Different Both join text B Similar function
numbers for dates
PivotTable Drag to
75 Manual type No drag Fixed A Summarize setup
fields? rows/columns/values
Data Validation
76 List only Whole number limits Text only No limits B Restrict range
for numbers?
Icon Sets in
77 Colors Icons based on values Bars Scales B Visual indicators
Formatting?
Wait, wrong;
adjust: For
Morph transition Excel, no – but
78 Word PowerPoint Excel Access B
in? question for
charts: Format
for colors? (C)
In WAPDA,
79 Letters Data reporting/bills Presentations Databases B Usage tracking
Excel for?
Get Data in
80 From file/web Yes No Only Excel A Import sources
Power Query?

Subtopic 3.3: MS PowerPoint & Access (MCQs 81-100)

# Question A B C D Correct Explanation

Master Slides in Edit
81 Per slide edit Consistent layout for all Animations Transitions B
PowerPoint? placeholders/logo
Animations:
82 Disappear Appear Grow Move path B Object enters
Entrance?
83 Exit animation? Appear Disappear Emphasize Path B Object leaves
Standard
84 Motion Paths? Custom movement Fade Morph B Draw path for object
enter/exit
Transitions: Morph
85 Sudden change Smooth fade No effect B Slide change effect
Fade? objects
 # Question A B C D Correct Explanation
Morph Seamless object move
86 Basic fade Enter only Exit only B Advanced smooth
transition? between slides
Word
87 Access is? Spreadsheet Database tool Presentation B Relational DBMS
processor
Relationships in Link tables (e.g., one-
88 No links Queries only Forms B Enforce integrity
Access? to-many)
Referential Prevent invalid data (no No
89 Allow orphans All delete B No orphan records
Integrity? delete if linked) enforcement

90 Query in Access? Store data Pull specific data Forms Reports B SELECT-like

Parameterized Dynamic [Enter

91 Fixed criteria Prompts for input No criteria Grouped B
query? Value]

Forms in Access: Linked to table (saves

92 Not linked Unbound Reports B Data entry
Bound? data)

93 Unbound form? Linked to table Not linked (custom) Saves data No controls B For special use

Reports in Summaries/prints
94 Data entry Queries Relationships B Output views
Access? (grouped/sorted)
One-to-Many One record Many to Common e.g., Dept-
95 Many to one only One to one A
relationship? links many many Employees
Many-to-Many
96 Direct link Junction table No link One table B Intermediate table
needs?
Query Design Add
97 Create Forms Reports B Build queries
tab? tables/fields/criteria
Animation Pane Order
98 Yes Transitions Master A Timing/sequence
for? animations
In WAPDA, Employee/billing
99 Spreadsheets Slides Letters B Data management
Access for? databases
Slide Master
100 One slide All slides No apply Only text B Global consistency
edits apply to?

Topic 4: Computer Networking

Subtopic 4.1: Network Basics & Models (MCQs 1–30)

# Question A B C D Correct Explanation

Simplex One direction
Two-way Two-way
1 transmission One-way only No direction B only (e.g., TV
simultaneous alternate
mode is? broadcast)
Half-duplex Simultaneous Alternate both No Walkie-talkie
2 One way only B
allows? both ways ways communication style
Full-duplex Simultaneous Telephone call /
3 One way Alternate No data C
allows? both ways modern Ethernet
 # Question A B C D Correct Explanation
OSI model
4 has how many 4 5 7 6 C 7 layers
layers?
TCP/IP model
Practical 4-layer
5 has how many 7 5 4 6 C
model
layers?
Application
layer in OSI Application +
Application Layers 5–7
6 corresponds Presentation + Transport Internet A
only combined
to which in Session
TCP/IP?
Transport
7 layer in Layer 3 Layer 4 Layer 2 Layer 1 B TCP & UDP
TCP/IP is?
Which
protocol
Domain Name
8 resolves HTTP DNS FTP SMTP B
System
domain name
to IP?
DHCP is used Dynamic IP Automatic IP
9 Static IP Routing Encryption B
for? assignment configuration
TCP
connection 2-way 3-way 4-way SYN → SYN-
10 No handshake B
establishment handshake handshake handshake ACK → ACK
uses?
First step in
Client sends
11 TCP 3-way SYN-ACK SYN ACK FIN B
SYN
handshake?
Second step in
Server replies
12 TCP SYN SYN-ACK ACK PSH B
SYN-ACK
handshake?
Client sends
13 Third step? SYN SYN-ACK ACK RST C
ACK
Connection- Handshake Fast, no
14 UDP is? Connectionless Reliable B
oriented required guarantee
Which is TCP –
15 reliable UDP TCP IP ICMP B retransmission,
protocol? ordering
Presentation
Translation &
16 layer in OSI Routing Error detection Physical signals B JPEG, SSL/TLS
encryption
does?
Physical layer Cables,
17 IP addresses Bits & signals Packets Frames B
deals with? connectors
Data Link Physical
18 IP addresses MAC addresses Port numbers URLs B
layer uses? addressing
Logical
Network layer
19 MAC IP addresses Port Frames B addressing &
uses?
routing
 # Question A B C D Correct Explanation
Session layer Physical Checkpoints &
20 Dialog control Data encryption Routing A
manages? connection synchronization
Which layer is
responsible
21 Network Transport Data Link Physical B TCP/UDP
for end-to-end
delivery?
Simple Mail
SMTP is used Receiving
22 Sending email Web browsing File transfer B Transfer
for? email
Protocol
HTTP/HTTPS
23 operates at Transport Application Network Data Link B Web protocols
which layer?
ICMP is used Error reporting
24 Data transfer File sharing Email B Ping, traceroute
for? & diagnostics
Which is not a
IP is network
25 transport layer TCP UDP IP SCTP C
layer
protocol?
FTP stands File Transfer Fast Transfer File
26 Folder Transfer A File transfer
for? Protocol Protocol Transmission
POP3 and
27 IMAP are Sending email Receiving email Web pages Routing B Email retrieval
used for?
Which
transmission Both directions
28 Simplex Half-duplex Full-duplex None C
mode is at once
fastest?
Ordered, error-
29 TCP is? Unreliable Reliable Connectionless Fast only B
checked delivery
DNS port Standard DNS
30 80 53 25 443 B
number? port

Subtopic 4.2: Network Devices & Topologies (MCQs 31–55)

# Question A B C D Correct Explanation

Hub operates at Physical layer –
31 Layer 3 Layer 1 Layer 2 Layer 4 B
which OSI layer? repeats signal
MAC address
32 Switch operates at? Layer 1 Layer 2 Layer 3 Layer 4 B
learning
33 Router operates at? Layer 2 Layer 3 Layer 1 Layer 4 B IP routing
Connects network
34 Bridge operates at? Layer 1 Layer 2 Layer 3 Layer 4 B
segments
Hub creates how
One big collision No Broadcasts to all
35 many collision One per port Multiple B
domain collisions ports
domains?
Switch creates how
Separate collision
36 many collision One big One per port None Two B
per port
domains?
# Question A B C D Correct Explanation
Which device uses
37 Hub Switch Router Bridge C Path determination
routing table?
NAT is performed Network Address
38 Switch Router Hub Modem B
by? Translation
Most common
39 network topology Bus Star Ring Mesh B Central switch/hub
today?
Single Every device
Highly reliable No
40 Mesh topology is? Cheap point B connected to every
but expensive redundancy
failure other
Infrastructure mode Through Access Most common Wi-
41 No AP Ad-hoc Peer-to-peer B
in wireless? Point Fi setup
Ad-hoc mode in Direct device-to- Needs Needs No central access
42 Uses AP B
wireless? device router switch point
Combination of Real-world
43 Hybrid topology is? Single type Only star Only bus B
two or more networks
Which device
Learns MAC
44 reduces collision Hub Switch Repeater Modem B
addresses
domains?
Digital to Analog to No For internet over
45 Modem converts? Digital ↔ analog B
digital analog conversion phone line
VLANs are Virtual LAN
46 Hub Switch Router only Bridge B
supported by? segmentation
47 Ring topology uses? Token passing Broadcast Star hub Mesh links A Token ring (old)
Cable failure
Bus topology Easy to add
48 High reliability stops whole Low cost B Single point failure
disadvantage? devices
network
Easy to
Star topology Single failure Low Central point
49 troubleshoot & High cost B
advantage? stops all reliability management
add devices
Which device
50 connects different Switch Router Hub Repeater B Different subnets
networks?
Repeater operates
51 Layer 2 Layer 1 Layer 3 Layer 4 B Signal regeneration
at?
Wireless topology Peer-to-peer
52 Infrastructure Ad-hoc Star Bus B
without AP? wireless
Which device
53 Switch Hub Router Bridge B No intelligence
broadcasts all data?
Router uses what to IP-based
54 MAC table Routing table ARP table CAM table B
forward packets? forwarding
Broadcast Collision domain
55 Bridge reduces? Routing IP addresses B Segment isolation
domain within segments

Subtopic 4.3: IP & Addressing (MCQs 56–85)

 Correc
# Question A B C D Explanation
t
5 /24 CIDR means [Link] 256 addresses
[Link] [Link] [Link] B
6 subnet mask? 5 (254 hosts)
/26 gives how
5
many subnets 2 4 8 16 B 4 subnets
7
from /24?
/26 gives how
5 many usable 64 – 2 = 62
126 62 30 14 B
8 hosts per hosts
subnet?
Private IP range [Link] –
5
starting with Class A Class B Class C private Public C [Link]
9
192.168? 5
6
[Link] is? Public Private Class A Private Class B Public Class C B Private range
0
Which routing
6 Hop count
protocol is OSPF RIP BGP IS-IS B
1 metric
distance-vector?
6 Link-state
OSPF is? Distance-vector Link-state Path-vector Hybrid B
2 protocol
6 RIP maximum
10 15 255 Unlimited B 15 hops max
3 hop count?
6 Manually Admin enters
Static routing is? Automatic Dynamic Distance-vector B
4 configured routes
/27 =
6 [Link]/27 [Link] [Link] [Link] [Link]
B [Link]
5 subnet mask? 2 4 0 8
4
6 /30 subnet
2 4 6 14 A 4 – 2 = 2 hosts
6 usable hosts?
First usable IP in Network .0,
6
[Link]/26 [Link] [Link] [Link] [Link] A broadcast .63,
7
? usable .1–.62
6 Dynamic routing Automatic route Adapts to
Manual update No overhead Fixed paths B
8 advantage? learning changes
Which protocol
6 OSPF – fast
is used in large RIP OSPF Static EIGRP only B
9 convergence
networks?
7 Class C private
[Link] [Link] [Link] [Link] C 192.168.x.x
0 range?
/28 gives how
7
many hosts 14 30 62 126 A 16 – 2 = 14
1
usable?
Subnet mask /30 =
7
[Link] /28 /29 /30 /31 C [Link]
2
is? 2
Which is not a
7 [Link] is public
private IP [Link] [Link] [Link] [Link] D
3 (Google DNS)
range?
 Correc
# Question A B C D Explanation
t
7 RIP uses what
Bandwidth Hop count Delay Cost B Number of hops
4 metric?
7 OSPF uses what Shortest path
Bellman-Ford Dijkstra Distance vector Path vector B
5 algorithm? first
7 /25 subnet [Link]
[Link] [Link] [Link] A 128 in last octet
6 mask? 8
Broadcast
7 Last address in
address in [Link] [Link] [Link] [Link] A
7 range
[Link]/26?
Which protocol
7 OSPF (with OSPF better
avoids routing RIP Both Neither C
8 areas) with areas
loops?
/27 gives how
7
many subnets 4 8 16 32 B 8 subnets
9
from /24?
Router IP for
8 Default gateway Exit point from
Local IP external DNS server DHCP server B
0 is? LAN
networks
[Link] is
8 Private Class B
which private A B C D B
1 range
class?
8 Subnetting Hosts per Number of
IP addresses Broadcasts B More subnets
2 increases? network networks
8 Which is link-
RIP OSPF BGP EIGRP B OSPF
3 state protocol?
8 RIP updates sent 30-second
30 seconds 60 seconds 90 seconds 120 seconds A
4 every? updates
8 CIDR notation
[Link] [Link] [Link] [Link] B 20 network bits
5 /20 means?

Subtopic 4.4: Wireless & Emerging (MCQs 86–100)

# Question A B C D Correct Explanation

802.11n is also 802.11n = Wi-Fi
86 Wi-Fi 4 Wi-Fi 5 Wi-Fi 6 Wi-Fi 3 A
called? 4
87 Wi-Fi 6 standard is? 802.11ac 802.11ax 802.11n 802.11ad B 802.11ax
Which Wi-Fi uses 6 802.11ax (Wi-Fi Wi-Fi 6E
88 802.11ac 802.11n 802.11g B
GHz band? 6E) extension
Bluetooth is used PAN (Personal Short-range
89 LAN WAN MAN B
for? Area Network) personal
Bluetooth version Low energy & BLE – Bluetooth
90 High speed No security High power B
5.0+ focus? longer range Low Energy
Virtual Virtual
Visible Public Very Private Secure tunnel
91 VPN stands for? Private Public A
Network Network over internet
Network Network
92 Common VPN PPTP IPSec L2TP OpenVPN B IPSec
 # Question A B C D Correct Explanation
protocol for site-to-
site?
Only No Widely used
93 OpenVPN is? Proprietary Open source B
Windows encryption open source
Mirai botnet Insecure IoT IoT cameras &
94 Servers PCs only Routers only B
targeted? devices routers
Which Wi-Fi
95 standard uses only 5 802.11b 802.11a 802.11g 802.11n B 802.11a
GHz?
96 802.11ac is? Wi-Fi 4 Wi-Fi 5 Wi-Fi 6 Wi-Fi 7 B Wi-Fi 5
Encryption &
No
97 VPN provides? Speed only secure remote Public access B Secure tunnel
encryption
access
Default
IoT security Large Many vulnerable
98 High security passwords & No internet B
challenge? bandwidth devices
hard to patch
Which is fastest Wi-
Wi-Fi 6 – up to
99 Fi standard 802.11n 802.11ac 802.11ax 802.11g C
9.6 Gbps
(theoretical)?
Secure remote
Purpose of VPN in Faster Protect sensitive
100 access to grid Public Wi-Fi No security B
WAPDA context? internet control systems
systems

Subtopic 5.1: DBMS Concepts (MCQs 1-20)

# Question A B C D Correct Explanation

DBMS is Store, retrieve,
1 Hardware control Managing data Networking OS only B
software for? update data
Hierarchical
Tree (parent- Tree-like, one-
2 data model Graph Tables Flat B
child) to-many
structure?
Network data
No Graph
3 model One-to-many only Many-to-many Tree only B
relationships structure
allows?
Relational Tables with Based on
4 Trees Graphs Hierarchies B
model uses? rows/columns Codd's rules
Codd's rules 12 rules for
5 Hierarchical Relational model Network All models B
are for? RDBMS
3-Tier
Presentation
6 architecture: Data storage User interface Logic Server B
layer
Client tier?
7 Application UI Business logic Database Client B Middle tier
 # Question A B C D Correct Explanation
Server tier?
Database Backend
8 Logic Data storage UI Network B
Server tier? storage
Example of
Oracle/SQL
9 relational IMS CODASYL Minix B Table-based
Server
DBMS?
Hierarchical
10 model Oracle IMS MySQL PostgreSQL B Old IBM IMS
example?
Network
High due to many- Flexible but
11 model Simple Low None B
to-many complex
complexity?
Relational Easy to
12 model Complex understand & Rigid No queries B SQL-based
advantage? flexible
Easier
3-Tier Layered
13 No separation maintenance & Slow Single tier B
advantage? separation
security
SRS in Software
System Requirements
14 requirements Requirements Database only No document B
Requirements Spec document
? Specification
Elicitation
15 Interviews/surveys Yes Coding Testing A Gather needs
techniques?
Which model
Dominant
16 is most Hierarchical Network Relational Flat file C
today
modern?
In WAPDA, Billing/employee Data
17 Word docs Presentations Networking B
DBMS for? databases management
3-Tier:
Database
18 Which is data Client Application All C Storage tier
Server
layer?
Codd's 12 Data integrity & RDBMS
19 Inconsistency No rules Hardware B
rules ensure? consistency standards
Network
model Complex to No Pointer-based
20 Easy Tree only B
disadvantage manage relationships complexity
?

Subtopic 5.2: Relational Model & Normalization (MCQs 21-45)

# Question A B C D Correct Explanation

Primary Key Can be Duplicate No NULL,
21 Unique identifier per row No index B
(PK) is? NULL allowed unique
22 Candidate Key? Actual PK Potential PK Foreign key Composite B Could be PK
Composite Single Multi-
23 Multiple columns as PK Artificial Candidate B
Key? column column PK
24 Foreign Key Unique in References PK in another Artificial No link B Links tables
 # Question A B C D Correct Explanation
(FK)? table table
25 Surrogate Key? Natural data Artificial (auto-increment) Composite Foreign B Generated ID
Repeating Partial Single value
26 1NF requires? Atomic values, no repeats Transitive B
groups dependency per cell
2NF Transitive No Full key
27 Partial dependency Multi-valued B
eliminates? dependency dependency dependency
Non-key
3NF Partial Boyce-
28 Transitive dependency Multi-valued B depends only
eliminates? dependency Codd
on PK
No
BCNF is anomalies
29 1NF 2NF 3NF 4NF C
stronger than? from
determinants
Independent
4NF Multi-valued
30 Partial Transitive All C multi-valued
eliminates? dependencies
facts
Denormalizatio Increase Strict Faster
31 Performance in reads No change B
n is for? redundancy normalization queries
Which normal 3NF –
32 form for no 1NF 2NF 3NF BCNF C depends only
transitive? on PK
Every
Boyce-Codd
BCNF determinant Multi-
33 Partial OK Transitive OK A Normal
requires? candidate valued OK
Form
key
Denormalizatio Data Better Trade-off for
34 Faster reads No risk B
n risk? inconsistency/redundancy integrity speed
Candidate key Potential
35 EmployeeID Email (if unique) Both None C
example? uniques
Foreign key
36 Uniqueness Referential integrity Nulls Duplicates B Valid links
enforces?
Single
Composite key Combined
37 column Need multiple for unique Always Never B
needed when? uniqueness
unique
Surrogate key Simple, no business Auto-
38 Natural data Complex Duplicates B
advantage? meaning generated
Atomic Multi-values
39 1NF violation? Repeating groups No keys Transitive B
values in cell
Non-keys
Composite Eliminate partial
40 2NF for? Both None C depend on
PK tables dependency
whole PK
Non-key
Transitive
41 2NF 3NF violation BCNF 4NF B depends on
dependency in?
non-key
Multi-valued Independent
42 3NF 4NF BCNF 1NF B
dependency? facts
43 Denormalizatio Write-heavy Read-heavy systems All None B For
 # Question A B C D Correct Explanation
n in? performance
Which form
44 2NF BCNF 1NF 5NF B Boyce-Codd
after 3NF?
Normalization Minimizes
45 Consistency Redundancy & anomalies Speed Data size B
reduces? duplicates

Subtopic 5.3: SQL Language (MCQs 46-85)

# Question A B C D Correct Explanation

DDL
CREATE
46 command: UPDATE SELECT INSERT B Structure creation
TABLE
Create table?
ALTER in Add/drop
47 Yes Data insert Delete rows A Modify structure
DDL? columns
48 DROP does? Modify Delete table Insert Update B Remove object
NOT NULL No NULL
49 Allow NULL Unique Primary B Mandatory value
constraint? allowed
UNIQUE Allow
50 No duplicates NULL OK B&C D Distinct values
constraint? duplicates
INSERT in
51 Add rows Yes Structure Select A Add data
DML?
UPDATE
UPDATE No
52 SET Yes DELETE A Change data with condition
syntax? WHERE
WHERE
DELETE
53 Tables Rows Columns Database B Data rows
removes?
Bulk
VALUES SELECT from
54 INSERT No bulk UPDATE B INSERT INTO SELECT
only another table
with?
SELECT
No Groups rows
55 with GROUP Order only Where only B e.g., COUNT per group
aggregates for aggregates
BY?
HAVING Filter before Filter after
56 Order No filter B On aggregated results
clause? group group
57 ORDER BY? Group Sort results Filter Aggregate B ASC/DESC
Aggregate: Number of
58 Sum Average Max B Row count
COUNT? rows
MAX Maximum
59 Minimum Average Sum B Highest value
aggregate? value
Inner Join Matching rows All from All from
60 All from left B Common records
returns? only right both
Matching All left +
61 Left Join? All right No NULLs B Left table full
only matching right
All right + Matching
62 Right Join? All left Full B Right table full
matching left only
63 Full Outer Matching All from both Left only Right only B Union of left & right
 # Question A B C D Correct Explanation
Join?
Same table
Different
64 Self-Join? joined with No join Outer only B e.g., Employee-manager
tables
itself
COMMIT in Undo
65 Save changes Rollback Isolate B Permanent save
transactions? changes
ROLLBACK Undo to last
66 Save Commit No effect B Revert changes
? COMMIT
Isolation
level: Read Allows dirty
67 No dirty read Repeatable Serializable B Lowest isolation
Uncommitted read
?
Read Dirty read No Phantom
68 No dirty read B Default in most
Committed? OK repeatable OK
No non-
Repeatable Phantom
69 Dirty OK repeatable Highest B Consistent reads
Read? OK
read
Highest Dirty No
70 Serializable? Lowest B No phantom reads
isolation allowed phantoms
TRUNCATE Delete rows Fast delete all
71 Drop table Alter B Faster than DELETE
? with log rows, no log
Value limits
CHECK
72 Any value (e.g., age > Unique NULL B Custom rules
constraint?
18)
DEFAULT Set default
73 No default Unique Primary B Auto-fill if NULL
constraint? value
Cascading Delete linked Update
74 Ignore FK No delete B On FK delete
DELETE? rows only
Aggregates
GROUP BY No HAVING
75 like B&C D Grouping + functions
with? aggregates optional
SUM/COUNT
WHERE
WHERE vs No
76 After group before, Same B HAVING for aggregates
HAVING? difference
HAVING after
ORDER BY
77 DESC ASC No sort Random B Ascending
default?
ACID: Prevents
78 Atomicity Consistency Durability B Transaction isolation
Isolation? interference
COMMIT ROLLBACK Changes
79 No Undo B Save point
after? possible permanent
Dirty read Read
80 Serializable Repeatable All B Uncommitted data visible
in? Uncommitted
New rows
Phantom Non-
81 Dirty appear in No issue B In lower isolation
read? repeatable
repeat read
Non- Same row
82 Yes New rows Dirty A Inconsistent in transaction
repeatable changes
 # Question A B C D Correct Explanation
read?
SQL for
83 DML DDL DQL TCL B Data Definition Language
structure?
Data
84 DML for? Structure Query Transaction B INSERT/UPDATE/DELETE
manipulation
SELECT
85 DQL is? DDL DML All B Data Query Language
queries

Subtopic 5.4: Advanced DBMS (MCQs 86-100)

# Question A B C D Correct Explanation

Balanced tree for
86 B-Tree index for? Exact matches Range queries (> , <) Hash only No queries B
ranges
Fast equality
87 Hash index for? Range queries Exact matches (=) Balanced All B
lookups
Complete database
88 Full backup? Changes only Logs Incremental B Entire data
copy
Incremental Changes since last
89 Full every time Since full No backup B Only deltas
backup? backup
Differential Since last Cumulative
90 Since last full Full Logs only B
backup? incremental since full
Log-based Full backups Transaction logs for Recover after
91 No logs Incremental B
recovery uses? only redo/undo crash
Redo in Re-apply committed Forward
92 Undo committed Ignore logs Delete logs B
recovery? changes recovery
Undo in Re-apply Rollback Reverse
93 Commit all No action B
recovery? uncommitted uncommitted uncommitted
Indexing speeds
94 Inserts Queries/searches Deletes All equally B Faster retrieval
up?
B-Tree Balanced for
95 Unbalanced Exact only Slow B Good for ranges
advantage? efficiency
Hash
96 Good for ranges No range support Balanced Slow exact B Equality only
disadvantage?
3-2-1 backup 3 copies, 2 1 copy, 2 media, 3 Standard
97 No rule Full only A
rule? media, 1 off-site off-site strategy
Objective Recovery Point
98 RPO in recovery? Time to recover Max data loss time No loss B
time Objective
Backup Recovery Time
99 RTO? Max data loss Max recovery time No time B
time Objective
In WAPDA, Efficient data
100 Slow queries Fast billing lookups No use Manual B
indexing for? access