You are here

Computer Science 150

Introduction to Digital and Computer System Design

Credits: 3

Length of Course: 14 weeks

Classroom Hours per Week: 4 hours lecture, 1 hour lab per week

Prerequisites: Strongly recommended: Math 120 and either CSCI 120 or equivalent programming.

Text: Logic and Computer Design Fundamentals, 4th edition, M. Morris Mano, Charles R. Kime, Pearson/Prentice Hall, 2008 (978-0131989269)

LogicWorks 5, Capilano Computing Systems Ltd, Addison-Wesley, Manual & software used for digital hardware simulation.

Digital Computer Electronics, Malvino and Brown (3rd edition), Glencoe-Macmillan/McGraw-Hill , 1993
Introduction to Digital Systems, Milos Ercegovac, Tomas Lang, Jaime H. Moreno, John Wiley, 1999

Course Description:

This course introduces students to the basic concepts of digital logic design, and the function and use of typical digital components belonging primarily to the small and medium scale integration (SSI, MSI) families. The design principles will be used to develop an understanding of how the functional capabilities can be provided by hardware for the operation of a microprocessor. In addition, this course will introduce the student to machine language, its relationship to the design of a computer, and its symbolic representation as assembly language. The assembly language of a particular CPU will be used to illustrate machine language programming concepts. An interactive logic simulation environment for designing and testing logic circuit design will be used for the assignments.


  • Introduction to microprocessors: arithmetic logic unit (ALU), basic CPU architecture, addressing modes and program execution.
  • Assembly language programming: programs for simple tasks; branching, loops, and subroutines; stacks and recursion; the two-pass assembler.
  • Introduction to numbers and codes.
  • Combinational logic design and applications: adders, encoders, decoders, multiplexers, etc.
  • Sequential logic design and applications: flip-flops, registers, counters, and general finite state machines.
  • Memory devices: read-only memory (ROM), random access memory (RAM). Control: data path construction, buses and micro-programmed control.


Final grades for the course will be computed based on the following schedule:

Labs (10) 10%
Assignments 20%
Term Tests 30%
Final Examination 40%


Ken Chan, B.Sc. (Simon Fraser), M.S.E.E. (Wayne)
William Cheng, B.Sc., M.Sc. (Cal. State)

Yvonne Yang, B.Sc. (Hunan), Ph.D. (Paris)

Transferability: see