CSCI 2150
Test 1 -- Study Guide

The table below lists the assigned reading and some additional resources you might find helpful to study for Test 1.  The best place to look for sample problems is the archive of old tests. They are the most accurate representation of what you might see on your test. You can also find problems at the end of each chapter of the assigned reading.

As for the outside resources, the Johns Hopkins University Circuit Builder is a Java simulator that allows you to build a digital circuit and calculate the truth table. It begins by asking for the number of inputs and the number of outputs. The inputs corresponds to the number of inputs on the left side of a truth table. (In our case, it has been A, B, C, etc.) The number of outputs corresponds to our X. I'd just put 1 for the number of outputs. You can drag-n-drop gates and wire them just like they appear in your hand-drawn circuits. Once you've completed a circuit, press "compute" and it will give you a truth table.

As for the test itself, it is important to note that:

• I will make the rules of boolean algebra along with DeMorgan's Theorem available to you during the test. You can find of sample of what will be available to you on the cover pages of old copies of Test 1.
• Note that I did not begin including the rules of XOR gates until Spring of 2007.
• Note that I did not begin including Gray codes until Fall of 2007.
• You will not be able to use a calculator.
• You may notice that some of the previous tests had questions on Karnaugh Maps. Due to a rearrangement of the course schedule, YOU WILL NOT BE RESPONSIBLE FOR THE KARNAUGH MAP MATERIAL ON TEST 1. The most recent test of the old tests is going to be the best representation of this semester's test.

As for the reading identified in the table below, it refers to the chapters you can download from the notes page.

Prepared by David L. Tarnoff for the sections of CSCI 2150 at ETSU