Computer Awareness
5 chapters · 100 practice questions with full solutions — all free.
Reviewed by Kaustav Basak (19 years teaching)Written with AI help
Full Computer Awareness section test
40 questions across the whole section · 40 min · one timed test
Computer Fundamentals
20 questionsPractice testMemory and Storage
20 questionsPractice testOperating Systems and Software
20 questionsPractice testMS Office (Word, Excel, PowerPoint)
20 questionsPractice testInternet, Networking and Security
20 questionsPractice test
Computer Awareness: solved examples
A taste of each chapter's practice set — try it, then open the answer and solution.
- Computer Fundamentals
Transistors replaced vacuum tubes in which generation of computers?
- AFirst generation
- BThird generation
- CFourth generation
- DSecond generation
Show answer & solution
Correct answer: (D) Second generation
Second-generation computers (about 1956 to 1963) used transistors. Transistors were smaller, faster, cheaper and more reliable than vacuum tubes, and they produced less heat. First generation used vacuum tubes, third used ICs and fourth used microprocessors. Answer: Second generation.
- Memory and Storage
A disk's file system stores data in clusters (allocation units) of 4 KB, and a file always occupies whole clusters. How much disk space does a 10 KB file occupy?
- A8 KB
- B14 KB
- C10 KB
- D12 KB
Show answer & solution
Correct answer: (D) 12 KB
A file cannot share part of a cluster, so the number of clusters is rounded UP. 10 KB ÷ 4 KB = 2.5, so the file needs 3 clusters. Space used = 3 × 4 KB = 12 KB. The unused 2 KB in the last cluster is called slack space. 8 KB (2 clusters) is too small to hold 10 KB. Answer: 12 KB.
- Operating Systems and Software
Two processes are stuck forever because each holds one resource and waits for the resource held by the other. This situation is called:
- APaging
- BThrashing
- CDeadlock
- DSpooling
Show answer & solution
Correct answer: (C) Deadlock
Deadlock: process P1 holds resource A and waits for B, while P2 holds B and waits for A. Neither can move, so both wait forever. Thrashing is when the system spends most of its time swapping pages in and out of memory, spooling is queuing jobs (such as print jobs) in a buffer, and paging is a memory management method. Answer: Deadlock.