http:^^www.cs.cornell.edu^info^courses^spring-95^cs314^toc.html

This data set contains WWW-pages collected from computer science departments of various universities

    <li> <!WA65><!WA65><!WA65><!WA65><!WA65><!WA65><!WA65><!WA65><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec4/prob1.html"> Problems with Recursion </a>
    <li> <!WA66><!WA66><!WA66><!WA66><!WA66><!WA66><!WA66><!WA66><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec4/stack1.html"> Introduction to Stacks </a>
    <li> <!WA67><!WA67><!WA67><!WA67><!WA67><!WA67><!WA67><!WA67><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec4/soln3.html"> Solution 3: Use Stack for Return Address </a>
    <li> <!WA68><!WA68><!WA68><!WA68><!WA68><!WA68><!WA68><!WA68><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec4/jsr.html"> The JSR and RET Instructions </a>
    <li> <!WA69><!WA69><!WA69><!WA69><!WA69><!WA69><!WA69><!WA69><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec4/prolog1.html"> Saving State: Function Prologs and Epilogs </a>
    <li> <!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec4/prolog2.html"> Prologs: Another Example </a>
    <li> <!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec4/stack2.html"> Stack Frames </a>
    <li> <!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec4/soln4a.html"> Using the Stack Frame to Pass Parameters </a>
    <li> <!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec4/soln4b.html"> Using the Stack Frame for Local Variables </a>
    <li> <!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec4/order.html"> Parameter Order: an Important Detail </a>
    <li> <!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec4/frame1.html"> Accesing Parameters: A Problem </a>
    <li> <!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec4/frame2.html"> Its Solution: Frame Pointers </a>
    <li> <!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec4/frame3.html"> Frame Pointers: A Detailed Example </a>
    <li> <!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec4/frame4.html"> 68000 Subroutine Linkage Instructions </a>
    <li> <!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec4/ref.html"> Passing Arguments by Reference </a>
    <li> <!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec4/mem1.html"> Case Study: Memory Management on the Mac </a>
    <li> <!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec4/mem2.html"> Virtual Memory </a>
    <li> <!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec4/mem3.html"> Page Tables </a>
    <li> <!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec4/summary.html"> Summary </a>
</ul>

<h2> <A NAME="Topic5"> Topic 5: Assemblers, Linkers and Loaders </A></h2>
<ul>
    <li> <!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec5/readings.html"> Readings for this topic </a>
    <li> <!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec5/prepare.html"> Preparing an Assembly Program for Execution </a>
    <li> <!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec5/mach-code.html"> Machine Code </a>
    <li> <!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec5/clr.html"> Example: The CLR Instruction </a>
    <li> <!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec5/add.html"> Example: The ADD Instruction </a>
    <li> <!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec5/move.html"> Example: The MOVE Instruction </a>
    <li> <!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec5/assem.html"> The Assembler </a>
    <li> <!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec5/pass1.html"> Pass 1: Build the Symbol Table </a>
    <li> <!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec5/pass2.html"> Pass 2: Generate Code and Build RLD </a>
    <li> <!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec5/obj.html"> Structure of Object Module </a>
    <li> <!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec5/link1.html"> Linking programs </a>
    <li> <!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec5/link2.html"> The Linker </a>
    <li> <!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec5/load.html"> The Loader </a>
    <li> <!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec5/summary.html"> Summary </a>
</ul>

<h2> <A NAME="Topic6"> Topic 6: Interrupts and I/O </A></h2>
<ul>
    <li> <!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec6/readings.html"> Readings for this topic </a>
    <li> <!WA99><!WA99><!WA99><!WA99><!WA99><!WA99><!WA99><!WA99><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec6/motiv.html"> What happens when you do something wrong? </a>
    <li> <!WA100><!WA100><!WA100><!WA100><!WA100><!WA100><!WA100><!WA100><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec6/fetch.html"> Fetch/decode/execute </a>
    <li> <!WA101><!WA101><!WA101><!WA101><!WA101><!WA101><!WA101><!WA101><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec6/call.html"> How does processor call the service routine? </a>
    <li> <!WA102><!WA102><!WA102><!WA102><!WA102><!WA102><!WA102><!WA102><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec6/supe.html"> Supervisor versus user mode. </a>
    <li> <!WA103><!WA103><!WA103><!WA103><!WA103><!WA103><!WA103><!WA103><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec6/except.html"> How exception is processed on 68k </a>
    <li> <!WA104><!WA104><!WA104><!WA104><!WA104><!WA104><!WA104><!WA104><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec6/write.html"> Writing exception handlers </a>
    <li> <!WA105><!WA105><!WA105><!WA105><!WA105><!WA105><!WA105><!WA105><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec6/trace.html"> Tracing </a>
    <li> <!WA106><!WA106><!WA106><!WA106><!WA106><!WA106><!WA106><!WA106><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec6/break.html"> Breakpoints </a>
    <li> <!WA107><!WA107><!WA107><!WA107><!WA107><!WA107><!WA107><!WA107><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec6/system-call.html"> Operating System Calls </a>
    <li> <!WA108><!WA108><!WA108><!WA108><!WA108><!WA108><!WA108><!WA108><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec6/reset.html"> Reset </a>
    <li> <!WA109><!WA109><!WA109><!WA109><!WA109><!WA109><!WA109><!WA109><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec6/io.html"> Input/Output </a>
    <li> <!WA110><!WA110><!WA110><!WA110><!WA110><!WA110><!WA110><!WA110><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec6/intr1.html"> Interrupts on the 68000 </a>
    <li> <!WA111><!WA111><!WA111><!WA111><!WA111><!WA111><!WA111><!WA111><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec6/intr2.html"> More properties of Peripheral Interrupts </a>
    <li> <!WA112><!WA112><!WA112><!WA112><!WA112><!WA112><!WA112><!WA112><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec6/summary.html"> Summary </a>
</ul>

<h2> <A NAME="Topic7"> Topic 7: Introduction to Logic Design </h2>
<ul>
    <li> <!WA113><!WA113><!WA113><!WA113><!WA113><!WA113><!WA113><!WA113><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec7/readings.html"> Readings </a>
    <li> <!WA114><!WA114><!WA114><!WA114><!WA114><!WA114><!WA114><!WA114><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec7/intro.html"> Digital systems </a>
    <li> <!WA115><!WA115><!WA115><!WA115><!WA115><!WA115><!WA115><!WA115><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec7/intro-gates.html"> Gates </a>
    <li> <!WA116><!WA116><!WA116><!WA116><!WA116><!WA116><!WA116><!WA116><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec7/intro-tt.html"> Truth Tables </a>
    <li> <!WA117><!WA117><!WA117><!WA117><!WA117><!WA117><!WA117><!WA117><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec7/intro-bool.html"> Boolean Algebra </a>
    <li> <!WA118><!WA118><!WA118><!WA118><!WA118><!WA118><!WA118><!WA118><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec7/intro-combo.html"> Combinatorial and Sequential Circuits </a>
    <li> <!WA119><!WA119><!WA119><!WA119><!WA119><!WA119><!WA119><!WA119><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec7/intro-seq.html"> Sequential Circuits </a>
    <li> <!WA120><!WA120><!WA120><!WA120><!WA120><!WA120><!WA120><!WA120><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec7/physic.html"> Physical Level </a>
    <li> <!WA121><!WA121><!WA121><!WA121><!WA121><!WA121><!WA121><!WA121><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec7/tech.html"> Choosing a technology </a>
    <li> <!WA122><!WA122><!WA122><!WA122><!WA122><!WA122><!WA122><!WA122><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec7/ttl-1.html"> Making Gates (TTL) </a>
    <li> <!WA123><!WA123><!WA123><!WA123><!WA123><!WA123><!WA123><!WA123><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec7/ttl-2.html"> Making Gates (TTL -- cont) </a>
    <li> <!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec7/ttl-3.html"> Making Gates (TTL -- cont) </a>
    <li> <!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec7/ttl-4.html"> Other Gates (TTL) </a>
    <li> <!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec7/packages.html"> Packages </a>
    <li> <!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec7/fan.html"> Fan In/ Fan Out </a>
    <li> <!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec7/logical.html"> Physical to Logical Level </a>
    <li> <!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec7/bool-1.html"> Boolean Algebra </a>
    <li> <!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec7/bool-2.html"> Some Theorems of Boolean Algebra </a>
    <li> <!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec7/bool-3.html"> Proving Boolean Equations </a>
    <li> <!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec7/bool-4.html"> Generating Boolean Equations from Truth Tables </a>
    <li> <!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec7/canon-1.html"> Canonical Form </a>
    <li> <!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec7/canon-2.html"> Canonical Form is not minimal form </a>
    <li> <!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec7/kmap.html"> Karnaugh Maps </a>
    <li> <!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec7/min.html"> Rules of thumb for finding minimal expressions </a>
    <li> <!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec7/prob.html"> Mapping real problems to boolean equations </a>
    <li> <!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec7/nand.html"> Implementing SOP using only NAND gates </a>
    <li> <!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec7/nor.html"> Implementing SOP using only NOR gates </a>
    <li> <!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec7/multi.hmtl"> Multiplexers </a>
    <li> <!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec7/pga.html"> Another Silver Bullet: the Programmed Logic Array (PLA) </a>
    <li> <!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec7/prom.html"> The Programable Read-Only Memory (PROM) </a>
    <li> <!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/lec7/summary.html"> Summary </a>
</ul>

<p>
<!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><a href="http://www.cs.cornell.edu/Info/Courses/Spring-95/CS314/home.html"> Back to the CS 314 home page </a>

</body>
</html>