Page 1 of 116
WGU D684 Introduction to Computer Science OA &
PA Exam QUESTIONS AND VERIFIED ANSWERS
WITH RATIONALES JUST RELEASED
WGU D684 Introduction to Computer Science OA & PA Exam — Summarized Coverage
The WGU D684 Introduction to Computer Science course is an entry-level computer science course
focused on foundational computing concepts, computational thinking, programming logic, operating
systems, algorithms, networking, and software development principles. The course primarily uses an
Objective Assessment (OA), and students commonly use the Pre-Assessment (PA) as preparation
because the PA and OA closely align in topic coverage.
1. Computational thinking and problem-solving principles
2. Decomposition, abstraction, pattern recognition, and algorithmic thinking
3. Basic computer architecture (CPU, RAM, storage, input/output devices)
4. Von Neumann architecture concepts
5. Control Unit, ALU, memory unit, and processor functions
6. Fetch-decode-execute cycle fundamentals
7. Instruction Register vs Program Counter functions
8. Multi-core processor concepts and parallel processing basics
9. Volatile vs non-volatile memory
10. Data representation and binary concepts
11. Variables, constants, and identifiers
12. Primitive data types (integer, float, Boolean, char, string)
13. Type conversion and casting concepts
14. Arithmetic, relational, and logical operators
15. Control structures (if, if-else, switch statements)
16. Iteration structures (for loops, while loops, event loops)
17. Functions, procedures, parameters, and arguments
18. Pseudocode interpretation and logic tracing
19. Flowcharts and algorithm design basics
20. Searching algorithms (linear search, binary search)
21. Sorting algorithms (bubble sort, insertion sort, selection sort)
22. Algorithm efficiency and basic complexity awareness
23. Abstract data types (ADT) concepts
24. Data structures: arrays, stacks, queues, linked lists
25. File systems and directory structures
26. Absolute path vs relative path concepts
27. Root directories and file management basics
28. Operating system responsibilities and resource management
29. Process management and process states
30. Ready, running, waiting, and terminated process states
31. Process Control Block (PCB) fundamentals
32. Memory management techniques (paging, partitioning, virtual memory basics)
, Page 2 of 116
33. Software Development Life Cycle (SDLC) phases
34. Requirements gathering, design, coding, testing, maintenance
35. Computer problem-solving process steps
36. Programming paradigms (procedural, object-oriented, declarative, logic)
37. High-level vs low-level programming concepts
38. Networking fundamentals (LAN, WAN, MAN)
39. Network topologies (bus, ring, star)
40. DNS, IP addressing, and Internet communication basics
41. Network devices (routers, switches, servers)
42. High-level vs low-level protocols
43. Internet of Things (IoT) concepts and applications
44. Cloud computing and distributed systems basics
45. Cybersecurity and information assurance fundamentals
46. Ethical computing and professional responsibility
47. IEEE and ACM Code of Ethics principles
48. Social impact of computing technologies
49. Data privacy and responsible technology use
50. Scenario-based problem-solving involving algorithms, pseudocode, SDLC phases, networking
decisions, operating system functions, and ethics-related computing situations
WGU D684 Introduction to Computer Science OA & PA — Practice MCQs (Batch 1: Questions 1–50)
Q1. Which computational thinking principle involves breaking a large complex problem into smaller
manageable parts?
A. Pattern recognition
B. Abstraction
C. Decomposition
, Page 3 of 116
D. Automation
Answer: C
Rationale: Decomposition divides complicated problems into smaller sections that are easier to analyze
and solve.
Q2. What is the primary purpose of abstraction in computer science problem-solving?
A. Increase processor speed
B. Focus on important details while ignoring unnecessary complexity
C. Eliminate algorithms entirely
D. Replace memory management
Answer: B
Rationale: Abstraction simplifies problems by emphasizing essential information and hiding unnecessary
details.
Q3. Which computer component performs arithmetic and logical operations?
, Page 4 of 116
A. RAM
B. ALU
C. SSD
D. Motherboard
Answer: B
Rationale: The Arithmetic Logic Unit handles calculations and logical decision-making operations inside
the CPU.
Q4. In Von Neumann architecture, which component controls instruction execution sequencing?
A. GPU
B. Control Unit
C. Hard drive
D. Cache memory
Answer: B
Rationale: The Control Unit directs operations during the fetch-decode-execute cycle.
WGU D684 Introduction to Computer Science OA &
PA Exam QUESTIONS AND VERIFIED ANSWERS
WITH RATIONALES JUST RELEASED
WGU D684 Introduction to Computer Science OA & PA Exam — Summarized Coverage
The WGU D684 Introduction to Computer Science course is an entry-level computer science course
focused on foundational computing concepts, computational thinking, programming logic, operating
systems, algorithms, networking, and software development principles. The course primarily uses an
Objective Assessment (OA), and students commonly use the Pre-Assessment (PA) as preparation
because the PA and OA closely align in topic coverage.
1. Computational thinking and problem-solving principles
2. Decomposition, abstraction, pattern recognition, and algorithmic thinking
3. Basic computer architecture (CPU, RAM, storage, input/output devices)
4. Von Neumann architecture concepts
5. Control Unit, ALU, memory unit, and processor functions
6. Fetch-decode-execute cycle fundamentals
7. Instruction Register vs Program Counter functions
8. Multi-core processor concepts and parallel processing basics
9. Volatile vs non-volatile memory
10. Data representation and binary concepts
11. Variables, constants, and identifiers
12. Primitive data types (integer, float, Boolean, char, string)
13. Type conversion and casting concepts
14. Arithmetic, relational, and logical operators
15. Control structures (if, if-else, switch statements)
16. Iteration structures (for loops, while loops, event loops)
17. Functions, procedures, parameters, and arguments
18. Pseudocode interpretation and logic tracing
19. Flowcharts and algorithm design basics
20. Searching algorithms (linear search, binary search)
21. Sorting algorithms (bubble sort, insertion sort, selection sort)
22. Algorithm efficiency and basic complexity awareness
23. Abstract data types (ADT) concepts
24. Data structures: arrays, stacks, queues, linked lists
25. File systems and directory structures
26. Absolute path vs relative path concepts
27. Root directories and file management basics
28. Operating system responsibilities and resource management
29. Process management and process states
30. Ready, running, waiting, and terminated process states
31. Process Control Block (PCB) fundamentals
32. Memory management techniques (paging, partitioning, virtual memory basics)
, Page 2 of 116
33. Software Development Life Cycle (SDLC) phases
34. Requirements gathering, design, coding, testing, maintenance
35. Computer problem-solving process steps
36. Programming paradigms (procedural, object-oriented, declarative, logic)
37. High-level vs low-level programming concepts
38. Networking fundamentals (LAN, WAN, MAN)
39. Network topologies (bus, ring, star)
40. DNS, IP addressing, and Internet communication basics
41. Network devices (routers, switches, servers)
42. High-level vs low-level protocols
43. Internet of Things (IoT) concepts and applications
44. Cloud computing and distributed systems basics
45. Cybersecurity and information assurance fundamentals
46. Ethical computing and professional responsibility
47. IEEE and ACM Code of Ethics principles
48. Social impact of computing technologies
49. Data privacy and responsible technology use
50. Scenario-based problem-solving involving algorithms, pseudocode, SDLC phases, networking
decisions, operating system functions, and ethics-related computing situations
WGU D684 Introduction to Computer Science OA & PA — Practice MCQs (Batch 1: Questions 1–50)
Q1. Which computational thinking principle involves breaking a large complex problem into smaller
manageable parts?
A. Pattern recognition
B. Abstraction
C. Decomposition
, Page 3 of 116
D. Automation
Answer: C
Rationale: Decomposition divides complicated problems into smaller sections that are easier to analyze
and solve.
Q2. What is the primary purpose of abstraction in computer science problem-solving?
A. Increase processor speed
B. Focus on important details while ignoring unnecessary complexity
C. Eliminate algorithms entirely
D. Replace memory management
Answer: B
Rationale: Abstraction simplifies problems by emphasizing essential information and hiding unnecessary
details.
Q3. Which computer component performs arithmetic and logical operations?
, Page 4 of 116
A. RAM
B. ALU
C. SSD
D. Motherboard
Answer: B
Rationale: The Arithmetic Logic Unit handles calculations and logical decision-making operations inside
the CPU.
Q4. In Von Neumann architecture, which component controls instruction execution sequencing?
A. GPU
B. Control Unit
C. Hard drive
D. Cache memory
Answer: B
Rationale: The Control Unit directs operations during the fetch-decode-execute cycle.
