Cs 240-241 Assessment Meeting s1

Cs 240-241 Assessment Meeting s1

CS 210 ASSESSMENT COORDINATION MEETING

2012 October 15

MINUTES

Present: Salloum, Davarpanah, Young (by email)

Moderator: Soroka

The last CS 210 assessment meeting was in 2007.

MATERIALS

Materials collected for this course are quite adequate for assessment purposes.

BOOK

Each instructor gets to select a text of his/her own choosing. The default book seems to be

Charles H Roth Jr & Larry L Kinney,
Fundamentals of Digital Logic.
Sixth Edition.
Cengage Learning, 2010.

Mr Davarpanah says that both he and the students find this book unclear, and he recommends

M Morris Mano & Michael D Ciletti,
Digital Design.

which is available in a variety of editions.

COURSE OUTCOMES

Outcome 9 has been changed. The new Course Outcomes are these:

  1. Competence in number systems and in converting from one number system to another.
  2. Understanding of integer representation formats, the range for each format, and basic arithmetic operations using the formats.
  3. Understanding of Boolean algebra (manipulation) theorems and the use of K-maps to simplify Boolean functions.
  4. Ability to build an odd function, parity bit generator and error detector with Exclusive-OR gate and combination circuit with only NAND gates or NOR gates.
  5. Ability to analyze a combinational circuit.
  6. Understanding of the concept of Decoder, Encoder, Multiplexer, Demultiplexer and their use for implementing Boolean functions.
  7. Competence in structure and functioning of various adders, registers and counters.
  8. Understanding of the characteristics of latches and Flip-Flops.
  9. Design of sequential circuits using state tables (diagrams) and transition tables.
  10. Understanding of organization and operation of RAM, ROM and properties of various DROMs.

COURSE DESCRIPTION

The course description is fine:

Boolean algebra with applications to computers and logic design. The Arithmetic Logical Unit, logical properties of flip-flops and sequential machines. Applied projects. 4 lectures/problem-solving. Prerequisite: CS 130 with a grade of C or better, or consent of instructor.

PROGRAM OUTCOMES

CS 210 supports the following program outcomes:

(a) An ability to apply knowledge of computing and mathematics appropriate to the discipline.

(i) An ability to use current techniques, skills, and tools necessary for computing practice.

(j) An ability to apply mathematical foundations, algorithmic principles, and computer science theory in the modeling and design of computer-based systems in a way that demonstrates comprehension of the tradeoffs involved in design choices.

(k) An ability to apply design and development principles in the construction of software systems of varying complexity.

IN SUMMARY

This course is now set for another assessment meeting in two years’ time.

C:\1\cf\assessment\www\minutes\minutes_210_121015.doc 1 / 2

Top View