Ryerson University (RU ) • Computer Science

These notes cover all of chapter 2 on Logic gates, including their types, Boolean algebra, truth tables, Boolean functions, simplifying gate diagrams, canonical and standard form, de Morgan’s law, NAND implementation, K-maps, combination logic, etc. useful for midterm CPS213

These notes contain examples on timing diagrams, sequential circuits, flip flops, state diagrams and tables, binary subtraction, decoders, minterms, MUX.

This part of the nites focuses on MUXes, enable signals, major applications, decoders and encoders with their applications, demux, symbolized edges, level triggered edges. Useful for CPS213 final

These are notes for all design of sequential circuits, state tables and diagrams, flip flops, Kmaps, registers, binary subtractor. These are useful for CPS213 final.

These notes include all chapter 1 info for cps213, including binary, hex and octal conversions, Arithmetic operations, 2’s compliment.

In this note, I have explaining what cache is and how it works and what kind of different mapping we have

In this note , I start from the simple definition of 6809 processor, Addressing modes and all the required information needed for 6809 processor.

In this note I have explained how to assemble and how to disassemble 6809 Motorola. In other words, how to convert machine code to binary code and how to covert binary/hexadecimal number to machine code. With using all the required tables

Python data type