The [course_title] course covers the fundamental concepts of computer architecture covering abstractions, principles, and techniques used in the design of digital and computer systems. If you know electricity and programming, then enrol the course and design a computer system.
Focuses will be given on instruction set architectures and assembly language, stacks and procedures, 32-bit computer architecture, the memory hierarchy, and caches.
Upon completion, you will be able to design a computer system.
Assessment
This course does not involve any written exams. Students need to answer 5 assignment questions to complete the course, the answers will be in the form of written work in pdf or word. Students can write the answers in their own time. Each answer needs to be 200 words (1 Page). Once the answers are submitted, the tutor will check and assess the work.
Certification
Edukite courses are free to study. To successfully complete a course you must submit all the assignment of the course as part of the assessment. Upon successful completion of a course, you can choose to make your achievement formal by obtaining your Certificate at a cost of £49.
Having an Official Edukite Certification is a great way to celebrate and share your success. You can:
- Add the certificate to your CV or resume and brighten up your career
- Show it to prove your success
Course Credit: Massachusetts Institute of Technology
Course Curriculum
Important Course Dates | |||
Jade Documentation | 00:04:00 | ||
Designing an Instruction Set | |||
Datapaths and FSMs | 00:05:00 | ||
Programmable Datapaths | 00:05:00 | ||
The von Neumann Model | 00:10:00 | ||
Storage | 00:07:00 | ||
ALU Instructions | 00:07:00 | ||
Constant Operands | 00:05:00 | ||
Memory Access | 00:03:00 | ||
Branches | 00:06:00 | ||
Jumps | 00:03:00 | ||
Assembly Language, Models of Computation | |||
Intro to Assembly Language | 00:08:00 | ||
Symbols and Labels | 00:04:00 | ||
Instruction Macros | 00:08:00 | ||
Assembly Wrap-up | 00:05:00 | ||
Models of Computation | 00:06:00 | ||
Computability, Universality | 00:06:00 | ||
Uncomputable Functions | 00:03:00 | ||
Compilers | |||
Iterpretation and Compilation | 00:10:00 | ||
Compiling Expressions | 00:09:00 | ||
Compiling Statements | 00:04:00 | ||
Compiler Frontend | 00:04:00 | ||
Optimization and Code Generation | 00:08:00 | ||
Procedures & Stacks | |||
Procedures | 00:10:00 | ||
Activation Records and Stacks | 00:09:00 | ||
Stack Frame Organization | 00:07:00 | ||
Compiling a Procedure | 00:05:00 | ||
Stack Detective | 00:06:00 | ||
Building the Beta | |||
Building Blocks | 00:10:00 | ||
ALU Instructions | 00:07:00 | ||
Load and Store | 00:04:00 | ||
Jumps and Branches | 00:08:00 | ||
Exceptions | 00:06:00 | ||
Summary | 00:04:00 | ||
Caches & The Memory Hierarchy | |||
Memory Technologies | 00:04:00 | ||
SRAM | 00:07:00 | ||
DRAM | 00:05:00 | ||
Non-volatile Storage; Using the Hierarchy | 00:09:00 | ||
The Locality Principle | 00:07:00 | ||
Caches | 00:06:00 | ||
Direct-mapped Caches | 00:07:00 | ||
Block Size; Cache Conflicts | 00:06:00 | ||
Associative Caches | 00:10:00 | ||
Write Strategies | 00:05:00 | ||
Assessment | |||
Submit Your Assignment | 00:00:00 | ||
Certification | 00:00:00 |
Course Reviews
No Reviews found for this course.