CS301: CS301: Proctor-Verified Final Exam (Attempts before 2020/07/29) | Saylor Academy

Receive a grade

Closed: Wednesday, 29 July 2020, 5:23 PM

This exam is closed. If you wish to take the most recent Certificate Final Exam, please go to the Certificate Final Exam section of this course.

To attempt this quiz you need to know the quiz password

Time limit: 2 hours

Grading method: Highest grade

Grade to pass: 7.00 out of 10.00

Course Introduction

Course Syllabus

Unit 1: Introduction to Computer Technology

1.1: Introduction to Computer Processors

Computer History

History of Computing Hardware (1960–Present)

1.2: Components of a Computer

Personal Computer Hardware

1.3: The Role of Processor Performance

CPU and Processor Time Counter

Microprocessor Design and Performance

Computing Benchmarks

Amdahl's Law

1.4: The Power Problem

The Need For A Radical New Type Of Computer Architecture

1.5: The Switch to Parallel Processing

Parallel Computing Landscape

1.6: Case Study: A Recent Intel Processor

Data Types, Operators, and Variables

Unit 1 Assessment

Unit 1 Assessment

Unit 2: Instructions: Hardware Language

2.1: Computer Hardware Operations

Introduction to Programming Languages

Machine Code

The Machine Cycle

2.2: Number Representation in Computers

Introduction to Number Systems

More on Number Systems

Floating Points

Practice with Number Systems

Converting Decimal Numbers to Binary

Another Way to Convert from Decimal to Binary

Fractions

2.3: Instruction Representation

MIPS Instructions

2.4: Logical and Arithmetic Instructions

MIPS Arithmetic Instructions

2.5: Control Instructions

MIPS Control Flow Instructions

2.6: Instructions for Memory Operations

MIPS Memory Instructions

2.7: Different Modes for Addressing Memory

Addressing Memory

MIPS Instruction Format

2.8: Case Study: Intel and ARM Instructions

X86 Instructions and ARM Architecture

Unit 2 Assessment

Unit 2 Assessment

Unit 3: Fundamentals of Digital Logic Design

3.1: Beginning Design: Logic Gates, Truth Table, and Logic Equations

Logic Design Principles

Logic Gates

Ladder Logic

Karnaugh Mapping

3.2: Combinational Logic

Combinational Logic Functions

3.3: Flip-Flops, Latches, and Registers

Multivibrators

3.4: Sequential Logic Design

Sequential Circuits

3.5: Case Study: Design of a Finite State Machine (FSM) to Control a Vending Machine

Finite State Automata

Unit 3 Assessment

Unit 3 Assessment

Unit 4: Computer Arithmetic

4.1: Number Representation

Floating Points

Integers and the Representation of Real Numbers

4.2: Addition and Subtraction Hardware

Add and Subtract Blocks

4.3: Multiplication

Binary Multipliers

Arithmetic Circuits

4.4: Floating Point Arithmetic

Floating Point Arithmetic and Error Analysis

4.5: Division

Division

Arithmetic for Computers

4.6: Case Study: Floating Point Arithmetic in an x86 Processor