If you think with a pen, study with one. The printable WGU Foundations of Computer Science PDF from LatestCram lets you mark key points on paper across all 72 practice questions.
WGU Foundations-of-Computer-Science Exam Overview:
| Certification Vendor: | WGU |
|---|---|
| Exam Name: | Foundations of Computer Science |
| Exam Number: | D792 / Foundations-of-Computer-Science |
| Passing Score: | Competency-based assessment |
| Real Exam Qty: | 50 |
| Exam Format: | Scenario-based questions, Multiple choice |
| Available Languages: | English |
| Exam Price: | Included in tuition fees |
| Exam Duration: | 120 minutes |
| Certificate Validity Period: | N/A |
| Related Certifications: | Bachelor of Science in Software Development Bachelor of Science in Computer Science |
| Recommended Training: | WGU Course Materials |
| Exam Registration: | WGU Student Portal |
| Sample Questions: | ![]() |
| Exam Way: | Online proctored, remote delivery |
| Pre Condition: | None; open to all students enrolled in relevant WGU programs |
| Official Syllabus URL: | https://www.wgu.edu/online-it-degrees/computer-science-bachelor-degree.html |
WGU Foundations-of-Computer-Science Exam Syllabus Topics:
| Section | Weight | Objectives |
|---|---|---|
| Computer Architecture & Organization | 15% | - Von Neumann architecture - CPU, memory, I/O systems - Memory hierarchy and performance - Instruction sets and execution cycles |
| Algorithms & Complexity | 25% | - Big O notation, time and space complexity - Recursion and iterative structures - Sorting and searching algorithms - Algorithm design and analysis |
| Data Structures | 20% | - Data storage and retrieval principles - Trees, graphs, hash tables - Primitive and composite data types - Arrays, linked lists, stacks, queues |
| Software Engineering & Programming Basics | 15% | - Testing and debugging fundamentals - Basic syntax and control structures - Software development lifecycle - Programming paradigms |
| Discrete Mathematics & Logic | 25% | - Set theory, relations, functions - Propositional and predicate logic - Proof techniques and mathematical induction - Boolean algebra and digital logic |
The WGU Foundations-of-Computer-Science Exam: What to Know
Yes:
Build your knowledge base with official training, then go over the 72 practice questions for the WGU Foundations of Computer Science — that combination is the actual plan.
None; open to all students enrolled in relevant WGU programs Rules on eligibility change occasionally, so confirm the current requirements on the official page (official Foundations-of-Computer-Science exam page) before you pay the fee.
120 minutes for 50 questions. Adapt to the clock now: the LatestCram SOFT and APP versions let you control test time and track scores, so the real Foundations-of-Computer-Science exam feels like a rehearsal you've already done.
Delivery: payment triggers an automatic email within a minute — download immediately, install without limits, and if nothing arrives within 2 hours our round-the-clock support helps (check spam first). Refund: unlike vendors with slow, cumbersome processes, we keep it clear — take the corresponding Foundations-of-Computer-Science exam within 60 days of purchase, and if you fail, send a scanned enrollment slip plus the official Score Report PDF within 2 days of the exam; the full refund is processed within 7 days. Excluded: exams within 3 days of purchase, candidate names that don't match the payer, and free or expired products. Or exchange for two equal-value products free.
Yes — three different free WGU Foundations of Computer Science demos are available to download. Do the demo test first to inspect the value, then decide. Purchases include 365 days of free updates, renewable at 50% off.
The WGU Foundations of Computer Science blueprint covers 5 domains — including Software Engineering & Programming Basics (15%), Algorithms & Complexity (25%), Discrete Mathematics & Logic (25%). Weightings point you to the heavy hitters; schedule your review accordingly. The complete outline above lists every subtopic.
Registration goes through the vendor's official channels:
The WGU Foundations of Computer Science is delivered Online proctored, remote delivery — select whichever suits you when booking.
Included in tuition fees per attempt, with Competency-based assessment as the passing score. Since a failed attempt bills again, rehearse with the 72 practice questions from LatestCram until your tracked scores clear the mark consistently.
The WGU Foundations of Computer Science is WGU's official exam for the Computer Science Core Curriculum credential (Undergraduate / Core level). Before anything else, verify the exam code and name match what you need — then build a plan around the official objectives. Related credentials include Bachelor of Science in Computer Science, Bachelor of Science in Software Development.
WGU Foundations of Computer Science Sample Questions:
What is the first step in the selection sort algorithm?
- A. Find the highest value and the lowest value in the list.
- B. Sort the list in descending order.
- C. Determine the lowest value starting from the first position.
- D. Swap the first and last elements.
Correct Answer: C 🗳️
Explanation: Only visible for LatestCram members. You can sign-up / login (it's free).
Which method converts the default smallest-to-largest index order of a list to instead be the opposite?
- A. flip()
- B. reverse()
- C. sortDescending()
- D. invert()
Correct Answer: B 🗳️
Explanation: Only visible for LatestCram members. You can sign-up / login (it's free).
What is traversal in the context of trees and graphs?
- A. The process of visiting all nodes
- B. The process of removing all nodes
- C. The process of connecting all nodes
- D. The process of changing the value of nodes
Correct Answer: A 🗳️
Explanation: Only visible for LatestCram members. You can sign-up / login (it's free).
What will be the result of performing the slice fam[:3]?
- A. A list with the first three elements of fam
- B. A list with the last three elements of fam
- C. A list with the first two elements of fam
- D. A list with the first four elements of fam
Correct Answer: A 🗳️
Explanation: Only visible for LatestCram members. You can sign-up / login (it's free).
What happens if one element of a NumPy array is changed to a string?
- A. All elements in the array are coerced to strings.
- B. All elements in the array are coerced to integers.
- C. The array becomes a list of the original integers.
- D. The operation is not allowed and raises an error.
Correct Answer: D 🗳️
Explanation: Only visible for LatestCram members. You can sign-up / login (it's free).
Viewing page 1 out of 15 pages.
Viewing questions 1-5 out of 72 questions.








