\documentstyle{article}

\begin{document}

\begin{verbatim}
Classes CS181 1994-1995 first term

sep. 27 What CS181 is all about, schedule, accounts.
sep. 29 Boolean Algebra, CMOS logic.

oct. 04 Tau model, fabrication process, plugs
oct. 06 Clocks, precharge logic, registers, charge sharing

oct. 11 Finite state machines, transition graphs, PLA's
oct. 13 Boolean minimization, minimization of finite state machines

oct. 18 Homework solutions. Example project.
oct. 20 Complete the example.

oct. 25 A class to get them started on individual projects.
oct. 27 Data paths.

nov. 01 Adders, multipliers.
nov. 03 Transistor equations.

nov. 08 Scaling.
nov. 10 Why CV2 design is wasteful, Hot-Clock NMOS.

nov. 15 The future of CMOS (this one needs work!)
nov. 17 Case studies?

nov. 22 A class to decide  about what to do term 2 and 3.
nov. 24 Thanksgiving holiday (no class)

nov. 29 Intro asynchronous design I.
dec. 01 Intro asynchronous design II.

Homeworks CS181 1994-1995 first term (due dates)

-       familiarize yourself with UNIX and MAGIC
oct. 13 Logic homework (MAGIC,COSMOS)
oct. 20 Random number generator
oct. 27 Finite state machine homework
nov. 03 Project proposals
nov. 10 Design competition
nov. 17 Project simulation programs
nov. 24 Complete cell designs
nov. 01 All cell layouts (plus simulations)
dec. 10 Completed design (plus simulations), counts double

\end{verbatim}

\end{document}