We're so confident of our products that we provide no hassle product exchange.
WGU Foundations-of-Computer-Science Exam Overview:
| Certification Vendor: | WGU |
|---|---|
| Exam Name: | Foundations of Computer Science |
| Exam Number: | D792 / Foundations-of-Computer-Science |
| Exam Format: | Scenario-based questions, Multiple choice |
| Available Languages: | English |
| Real Exam Qty: | 50 |
| Exam Price: | Included in tuition fees |
| Related Certifications: | Bachelor of Science in Computer Science Bachelor of Science in Software Development |
| Certificate Validity Period: | N/A |
| Passing Score: | Competency-based assessment |
| Exam Duration: | 120 minutes |
| Recommended Training: | WGU Course Materials |
| Exam Registration: | WGU Student Portal |
| Sample Questions: | WGU Foundations-of-Computer-Science 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 - Instruction sets and execution cycles - Memory hierarchy and performance - CPU, memory, I/O systems |
| Software Engineering & Programming Basics | 15% | - Basic syntax and control structures - Programming paradigms - Testing and debugging fundamentals - Software development lifecycle |
| Algorithms & Complexity | 25% | - Recursion and iterative structures - Algorithm design and analysis - Sorting and searching algorithms - Big O notation, time and space complexity |
| Data Structures | 20% | - Trees, graphs, hash tables - Data storage and retrieval principles - Primitive and composite data types - Arrays, linked lists, stacks, queues |
| Discrete Mathematics & Logic | 25% | - Propositional and predicate logic - Proof techniques and mathematical induction - Boolean algebra and digital logic - Set theory, relations, functions |
WGU Foundations of Computer Science Sample Questions:
What is the purpose of the pointer element of each node in a linked list?
- A. To indicate the next node
- B. To keep track of the list size
- C. To indicate the current position
- D. To store the data value
Correct Answer: A 🗳️
Explanation: Only visible for TopExamCollection members. You can sign-up / login (it's free).
What is the time complexity of a quicksort algorithm?
- A. O(n log n)
- B. O(n)
- C. O(1)
- D. O(log n)
Correct Answer: A 🗳️
Explanation: Only visible for TopExamCollection 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. invert()
- C. sortDescending()
- D. reverse()
Correct Answer: D 🗳️
Explanation: Only visible for TopExamCollection members. You can sign-up / login (it's free).
Which type of files are meant to be inaccessible to standard users, but can be critical in terms of functionality?
- A. Backup files
- B. System files
- C. Log files
- D. Extension files
Correct Answer: B 🗳️
Explanation: Only visible for TopExamCollection members. You can sign-up / login (it's free).
Which Python function would be used to check the data type of a variable bmi?
- A. datatype(bmi)
- B. type(bmi)
- C. check(bmi)
- D. typeof(bmi)
Correct Answer: B 🗳️
Explanation: Only visible for TopExamCollection members. You can sign-up / login (it's free).
Viewing page 1 out of 15 pages.
Viewing questions 1-5 out of 72 questions.
By Victoria
