Last modified: 10 Oct 2025 11:46
Beginning with number systems and Boolean algebra, this course covers the fundamental building blocks for digital logic gates and the design of combinational and sequential circuits. In addition, students get an introduction to assembly, which is the inner language spoken by processors. By the end of the course, students will have a top-to-down understanding of how microprocessors work. The course is taught without prerequisites and students undertake plenty of exercises on a weekly basis.
| Study Type | Undergraduate | Level | 1 |
|---|---|---|---|
| Term | Second Term | Credit Points | 15 credits (7.5 ECTS credits) |
| Campus | Offshore | Sustained Study | No |
| Co-ordinators |
|
||
Information on contact teaching time is available from the course guide.
| Assessment Type | Summative | Weighting | 60 | |
|---|---|---|---|---|
| Assessment Weeks | 47,48 | Feedback Weeks | ||
| Feedback | ||||
| Knowledge Level | Thinking Skill | Outcome |
|---|---|---|
| Procedural | Apply | Translate from binary to decimal and hex numbering systems |
| Procedural | Apply | Apply Boolean algebra |
| Procedural | Create | Design circuit schematics constrained by min and max terms |
| Procedural | Create | Design finite state machines |
| Procedural | Create | Construct assembly language applications |
| Assessment Type | Summative | Weighting | 10 | |
|---|---|---|---|---|
| Assessment Weeks | 36 | Feedback Weeks | 39 | |
| Feedback |
Written feedback |
|||
| Knowledge Level | Thinking Skill | Outcome |
|---|---|---|
| Procedural | Apply | Translate from binary to decimal and hex numbering systems |
| Procedural | Apply | Apply Boolean algebra |
| Procedural | Create | Design finite state machines |
| Procedural | Create | Design circuit schematics constrained by min and max terms |
| Assessment Type | Summative | Weighting | 30 | |
|---|---|---|---|---|
| Assessment Weeks | 43 | Feedback Weeks | 46 | |
| Feedback |
Written feedback with automated components |
|||
| Knowledge Level | Thinking Skill | Outcome |
|---|---|---|
| Procedural | Create | Construct assembly language applications |
There are no assessments for this course.
| Assessment Type | Summative | Weighting | ||
|---|---|---|---|---|
| Assessment Weeks | Feedback Weeks | |||
| Feedback | ||||
| Knowledge Level | Thinking Skill | Outcome |
|---|---|---|
|
|
||
| Knowledge Level | Thinking Skill | Outcome |
|---|---|---|
| Procedural | Create | Design circuit schematics constrained by min and max terms |
| Procedural | Apply | Translate from binary to decimal and hex numbering systems |
| Procedural | Create | Construct assembly language applications |
| Procedural | Create | Design finite state machines |
| Procedural | Apply | Apply Boolean algebra |
We have detected that you are have compatibility mode enabled or are using an old version of Internet Explorer. You either need to switch off compatibility mode for this site or upgrade your browser.