WGU D684 INTRODUCTION TO COMPUTER
SCIENCE Actual Exam 2026/2027 Complete
Questions and Verified Answers Already Graded
A+ Pass Guaranteed - A+ Graded
SECTION 1: COMPUTATIONAL THINKING & PROBLEM SOLVING (12 Questions)
Q1: A software development team is tasked with creating a mobile banking application. The
project manager breaks down the project into smaller modules: user authentication, account
management, transaction processing, and reporting. Which computational thinking technique is
being demonstrated?
A. Abstraction
B. Decomposition
C. Pattern Recognition
D. Algorithm Design
Correct Answer: B
Rationale: Decomposition is the process of breaking down a complex problem into smaller,
more manageable sub-problems or modules. In this scenario, the banking app is divided into
distinct functional components (authentication, accounts, transactions, reporting), which is
classic decomposition. Abstraction (A) involves hiding complex details and focusing on
essential characteristics, which isn't the primary technique here. Pattern Recognition (C)
involves identifying similarities or trends across problems, not breaking them apart. Algorithm
Design (D) is the step-by-step solution creation, which comes after decomposition. The key
indicator is the explicit "breaking down" language in the stem.
Q2: Which of the following best describes abstraction in computational thinking?
A. Repeating a process until a condition is met
B. Identifying similarities between different problems
C. Focusing on essential features while hiding unnecessary details
D. Breaking a complex problem into smaller parts
,2
Correct Answer: C
Rationale: Abstraction is the principle of simplifying complex systems by modeling only the
relevant aspects and hiding implementation details. For example, when using a function like
print(), you don't need to know how the operating system renders text to the screen—you only
need to know what inputs it requires. Option A describes iteration/looping. Option B describes
pattern recognition. Option D describes decomposition. Abstraction allows programmers to
manage complexity by creating "black boxes" where internal workings are concealed, and only
interfaces are exposed.
Q3: [SATA - Select All That Apply] Which of the following activities demonstrate pattern
recognition in computational thinking? (Select all that apply)
A. Noticing that multiple e-commerce websites use similar shopping cart implementations
B. Realizing that calculating the average of test scores follows the same steps regardless of class
size
C. Creating a function to handle user input validation that can be reused across different forms
D. Dividing a video game project into graphics, physics, and sound components
E. Identifying that login systems across different applications share common security
requirements
Correct Answers: A, B, E
Rationale: Pattern recognition involves identifying similarities, trends, or regularities in data or
problems. A is correct because it identifies a recurring implementation pattern across different
websites. B is correct because it recognizes that the averaging algorithm is invariant to input
size—a computational pattern. E is correct because it identifies common requirements across
different application domains. C demonstrates abstraction and generalization (creating reusable
code), not pattern recognition specifically. D demonstrates decomposition. The key distinction is
that pattern recognition is about identifying similarities, while abstraction is about exploiting
those similarities through generalization.
Q4: A student is designing an algorithm to find the highest score in a list of test results. The
student decides to ignore the students' names and only focus on the numerical scores. Which
computational thinking technique is primarily being used?
A. Decomposition
B. Pattern Recognition
C. Abstraction
D. Algorithm Design
,3
Correct Answer: C
Rationale: This is abstraction because the student is filtering out irrelevant information (student
names) and focusing only on the essential data needed for the task (numerical scores).
Abstraction in data contexts often involves selecting relevant attributes while disregarding
others. While algorithm design (D) is occurring, the specific act of ignoring names to focus on
scores is the abstraction step that precedes or accompanies algorithm creation. Decomposition
(A) would involve breaking the grade analysis into sub-tasks, and pattern recognition (B) would
involve noticing similarities in how maximum-finding works across different contexts.
Q5: In the context of computational thinking, which scenario best represents algorithm design?
A. A developer notices that sorting problems appear in both inventory management and contact
lists
B. A team breaks a website project into frontend, backend, and database components
C. A programmer writes step-by-step instructions to calculate compound interest: initialize
variables, apply formula, output result
D. A data scientist hides complex database connection details behind a simple query interface
Correct Answer: C
Rationale: Algorithm design is the process of creating a step-by-step procedure to solve a
problem. Option C explicitly describes creating a finite sequence of instructions (initialize →
apply formula → output) to solve a specific computational problem (compound interest
calculation). Option A is pattern recognition. Option B is decomposition. Option D is
abstraction. An algorithm must be precise, finite, and unambiguous—characteristics clearly
present in the compound interest procedure described.
Q6: Which of the following is the correct order of the computational thinking process when
approaching a new problem?
A. Pattern Recognition → Decomposition → Abstraction → Algorithm Design
B. Decomposition → Pattern Recognition → Abstraction → Algorithm Design
C. Abstraction → Decomposition → Pattern Recognition → Algorithm Design
D. Algorithm Design → Decomposition → Pattern Recognition → Abstraction
Correct Answer: B
Rationale: The standard computational thinking workflow begins with Decomposition
(breaking the problem into parts), followed by Pattern Recognition (identifying similarities
with previously solved problems or within the current problem), then Abstraction (focusing on
essential details and filtering noise), and finally Algorithm Design (creating the step-by-step
solution). You cannot recognize patterns until you see the components, and you cannot abstract
, 4
effectively until you understand the patterns. Algorithm design comes last because it requires the
insights gained from the previous three stages.
Q7: A weather prediction model uses complex atmospheric physics equations but presents users
with a simple "70% chance of rain" output. This is an example of:
A. Decomposition
B. Pattern Recognition
C. Abstraction
D. Debugging
Correct Answer: C
Rationale: This is a clear example of abstraction—hiding complex underlying processes
(atmospheric physics calculations) behind a simplified interface (percentage output). The user
interacts with an abstracted representation that conveys essential information without requiring
understanding of the implementation details. This is particularly important in computational
modeling where internal complexity is high but user interaction must remain accessible.
Decomposition (A) would involve breaking weather prediction into sub-tasks (temperature
modeling, pressure analysis, etc.). Pattern recognition (B) would involve identifying weather
trends. Debugging (D) is the process of finding and fixing errors.
Q8: [FILL-IN-THE-BLANK STYLE] How many distinct computational thinking techniques
(decomposition, pattern recognition, abstraction, algorithm design) are demonstrated in the
following scenario?
"A software engineer is building a recommendation system. She breaks the project into data
collection, model training, and user interface components. She notices that recommendation
algorithms are similar across movie and product domains. She creates a generic 'recommendation
engine' class that hides implementation details. She writes specific steps for the collaborative
filtering calculation."
A. 1
B. 2
C. 3
D. 4
Correct Answer: D
Rationale: All four computational thinking techniques are present: (1) Decomposition: breaking
into data collection, model training, and UI components; (2) Pattern Recognition: noticing
similarity between movie and product recommendation algorithms; (3) Abstraction: creating a
generic class that hides implementation details; (4) Algorithm Design: writing specific steps for