- Department of Computer Science
- Vision, Mission, & Values
- Degrees & Programs
- Courses
- First Year Transfer Students
- Current Students
- Prospective Students
- Faculty & Staff
- Professors Emeritus
- Industrial Advisory Board
- Financial Assistance
- Employment Opportunities
- Donate
- Graduate Capstone
- Careers for Majors
- Resources
- Contact Us
- Help for Students
CS 3430 Computer Architecture and Algorithms (4) 2005
Catalog Description
Logical design of digital computers. Boolean algebra, combinatorial and sequential circuits, computer arithmetic, memories, integrated circuits, control processors, input/output. Prerequisites: MATH 2150, CS 2430 (No electronics experience needed)
Course Outline
- Combinatorial circuits: logic gates, Boolean algebra, Karnaugh map simplification, addres, substractors.
- Sequential circuits: latches, flip-flops, edge-triggering, counters
- Registers, decoders, multiplexers, tri-state buffers, integrated circuits, RAM, ROM
- Arithmetic-logic Unit
- Computer Organization
- Data and instruction formats
- Fetch-execute cycle
- internal and external buses
- Input/output
- Interrupts
- Microprogramming
- Design of simple machine, including execution of machine language programs
Suggested texts:
- Mano, Computer System Architecture, Prentice-Hall
- Mano, Digital Logic and Computer Design, Prentice-hall
- Heuning and Jordan, Computer System Design and Architecture, Addison-Wesley
- Capilano computing, LogicWorks 5, Prentice Hall
- Britton, MIPS Assembly Language Programming, 2004, Prentice Hall