D684 is the first course in the Bachelor of Science in Computer Science at Western Governors University.
WGU describes it as an introduction to the field's essential concepts: programming basics through language-agnostic pseudocode, computational thinking and problem-solving, algorithms, hardware, and social and ethical considerations. It has no prerequisites.
Because it is designed for beginners, the work is conceptual rather than code-heavy. The common difficulty is breadth: you move quickly from variables and algorithms to operating systems and architecture, and must keep terminology straight while explaining ideas in your own words.
Course at a Glance
| Item | Details |
|---|---|
| University | Western Governors University (WGU) |
| Course | D684, Introduction to Computer Science |
| Level | Undergraduate, introductory |
| Program | B.S. Computer Science (4 CUs, term 1 in the 2024 guide) |
| Prerequisite | None |
| Typical work | Explaining and applying pseudocode, algorithms and computing concepts |
What D684 Covers
| Competency (summarized) | What it means in practice |
|---|---|
| Identify common programming constructs | Variables, data types, functions and operators |
| Apply computer science principles to real-world scenarios | Use scientific inquiry and critical thinking to solve problems |
| Explain pseudocode and the maths of simple algorithms | Understand the computational processes involved |
| Identify components of operating systems | Know what an OS does and its parts |
| Identify computer architectures and components | Recognize hardware across devices beyond traditional PCs |
Key Concepts Explained
Pseudocode
Pseudocode describes the steps of an algorithm in plain, structured language, independent of any programming language. Clear step order, conditions and loops matter more than exact syntax.
Example: Find the largest of three numbers. Set max to the first number. If the second is greater than max, set max to the second. If the third is greater than max, set max to the third. Output max. Tracing with 4, 9, 6 shows max changing from 4 to 9, ending at 9.
Computational Thinking
This means breaking problems into parts, spotting patterns, ignoring unneeded detail and designing step-by-step solutions.
Hardware and Operating Systems
Know the roles of the CPU, memory and storage, and what an operating system manages: processes, memory, files and devices. Be ready to compare device types.
Terms to Keep in Your Notes
Introductory courses move quickly through vocabulary. A short glossary, written in your own words, is one of the most useful study aids.
| Term | Plain meaning |
|---|---|
| Algorithm | A finite set of steps to solve a problem |
| Variable | A named place to store a value that can change |
| Data type | The kind of value stored, such as integer or text |
| Function | A reusable block that performs a task |
| Operator | A symbol that acts on values, such as + or < |
| CPU | The part that executes instructions |
| Operating system | Software that manages hardware and programs |
Practice tracing small algorithms by hand. Draw a table with one column per variable and one row per step, and update the values as you go. This habit catches logic errors and prepares you for more advanced programming courses.
For the ethics component, prepare two or three examples, such as privacy, bias in automated decisions and access to technology, and be ready to describe both benefits and risks.
Typical Work and How to Approach It
| Type of work | What it tests | How to approach it |
|---|---|---|
| Pseudocode and algorithms | Logical steps | Trace your algorithm with a small example |
| Concept explanations | Terminology | Define, then give an everyday analogy |
| Hardware and OS comparison | Component knowledge | Use a table to compare roles |
| Ethics and society | Reasoned discussion | Present more than one viewpoint |
Where Students Get Stuck
- Treating pseudocode like code. Focus on logic and clarity.
- Skipping tracing. Walk through an example by hand to find mistakes.
- Terminology overload. Keep a glossary and review it often.
- Shallow ethics answers. Give examples and consider both benefits and harms.
Study Tips for D684
- Practice writing small algorithms: sum a list, find a maximum, count items.
- Make flashcards for hardware and OS terms.
- Explain each topic aloud as if to a friend.
- Match your notes to the five competencies.
Final Checklist Before You Submit
- Pseudocode steps are in order and use clear conditions and loops.
- You have traced each algorithm with a small example.
- Terms are defined in your own words.
- Hardware and operating system comparisons are accurate.
- Ethics answers give examples and more than one viewpoint.
- Each answer maps to a competency.
If you get stuck, simplify the problem to three inputs and solve that first. The general solution usually follows.
How We Help with D684
Send your task instructions, rubric and the topics you find hardest. A tutor can explain concepts with examples, check your pseudocode logic, or show a custom answer. We do not complete or submit your assessments, and we do not take exams.
GradeEssays is independent and not affiliated with WGU. This is a study and reference aid; submit only your own work under WGU's academic integrity policy. We do not access course portals. Free revisions; full refund if late.
Make D684 Concepts Click
Share your topic and what confuses you. We explain it step by step with examples you can practice.
Start My D684 HelpFree revisions · Full refund if late · Written from scratch for your order
Frequently Asked Questions
Yes. WGU describes it as designed for beginners and lists no prerequisites.
The 2024 B.S. Computer Science guide lists 4 CUs, in term 1.
The description emphasizes language-agnostic pseudocode, so the focus is logic.
A plain-language, structured description of an algorithm that is not tied to a language.
Computational thinking, hardware, operating systems and ethical considerations.
No. We tutor and explain; any work you submit must be yours.