PHY-201 calendar

PHY 201: Course Calendar

Aug. 31	Course Syllabus Binary numbers (presentation) Binary numbers (lab) Visual Studio 2005 C/C++ program
Sept. 7	truth tables and Ohm's Law (presentation) truth tables and Ohm's Law (lab)
Sept. 14	Karnaugh maps (presentation) Karnaugh Maps (lab)
Sept. 21	Multiplexing and Demultiplexing (presentation) Multiplexing and Demultiplexing (lab)
Sept. 28	Adders (presentation) Adders (lab)
Oct. 5	TEST 1
Oct. 12	Memory (presentation) Memory (lab) AdderWithRegisters.ms8
Oct. 19	Shift registers, etc. (presentation) Floats and shift registers (lab) Modem.ms8
Oct. 26	Flip-flops and counters, etc. (presentation) Floats, CRC, clocks and counting (lab)
Nov. 2	Microcode (presentation) RAM, ROM and Microcode (lab) ram.ms8
Nov. 9	TEST 2
Nov. 16	Comparators (presentation) Instructions and stacks (presentation) Comparators and Stacks (lab)
Nov. 30	Bus (presentation) We discussed Cache Circuitry (Associative memory) What's kept in cache? memory addresses (tag array) plus memory values (data array). One looks up addresses but eventually wants values What circuitry does this looking up? comparator Where in the cache (what location) does one put the data related to a particular memory location? In the direct mapping approach, data from a particular memory location can go to one and only one cache location, thus there is only one place to look for it and hence only one comparator. In the (fully) associative approach, data from a particular memory location can go to any cache location, thus one must search the entire cache (simultaneously or it would be prohibitively slow) and hence there are many, many comparators. Set Associative cache is a compromise in which the data from a particular memory location can be in a set of cache locations (more than one but not all) so one needs a few comparators. Lab 11 addersubtractorwithbus.ewb
Dec. 7	Using AlphaNumericTester.ms8 and HelpSign.ms8 as a model, make a sign that has at least three different letters.
Dec. 14	TEST 3