https://cs.indstate.edu/web/index.php?action=history&feed=atom&title=CS_451_Architecture 2026-04-14T21:49:06Z Revision history for this page on the wiki MediaWiki 1.44.0 https://cs.indstate.edu/web/index.php?title=CS_451_Architecture&diff=83&oldid=prev 2025-08-17T13:22:12Z

<p>1 revision imported</p> <table style="background-color: #fff; color: #202122;" data-mw="interface"> <col class="diff-marker" /> <col class="diff-content" /> <col class="diff-marker" /> <col class="diff-content" /> <tr class="diff-title" lang="en"> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">← Older revision</td> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">Revision as of 13:22, 17 August 2025</td> </tr><tr><td colspan="4" class="diff-notice" lang="en"><div class="mw-diff-empty">(No difference)</div> </td></tr> <!-- diff cache key wiki2:diff:1.41:old-82:rev-83 --> </table>

Jkinne https://cs.indstate.edu/web/index.php?title=CS_451_Architecture&diff=82&oldid=prev 2021-05-18T13:06:40Z

<p></p> <p><b>New page</b></p><div>== CS 451 Architecture ==<br /> == Catalog Description ==<br /> <br /> Data representation, number systems and codes, gates and logic, combinational logic, sequential circuits, flip-flops, memory and storage, computer organization, microprogramming, architectures of supercomputers and micros. Prerequisite - C or better in CS 202 and CS 303.<br /> <br /> == Prerequisites ==<br /> Student must have knowledge of Programming and Elementary Data Structures and<br /> Boolean Algebra and Logic.<br /> <br /> == Standard Content ==<br /> ===Course Outline ===<br /> The course begins with a review of Logic Circuit Design: Combinational Circuits and Sequential Circuits. Covered topics include logic gates, decoders , encoders, multiplexers, ROMs, universal gates, adders, flip-flops, latches, Karnaugh Maps, equivalent states, counters, bit pattern detectors, incrementers, multipliers, etc.<br /> This is followed by the discussion of Instruction Set Architectures, and an example architecture: The Relatively Simple Computer. Basic Computer System Organization is considered : CPU, Memory, I/O units, Buses, Linear ad Two dimensional memory organizations.<br /> Hardware description using RTL and methods of implementing RTL code are described.<br /> Next is the coverage of CPU Design: Registers, Instruction Sets, State diagrams, RTL Code, design of<br /> register section, control units, ALUs, and generation of control signals are covered. This is the hardwired control approach.<br /> Also covered are Microprogrammed Control and its variations: Horizontal Microcode, Vertical Microcode, and string control signals in the ROM.<br /> Next comes the coverage of Cache memory organization, and virtual memory. Topics covered are associative memory, and the associative , direct and set associative mappings and LRU and FIFO cache replacement strategies, and a simulation and estimation of hit ratios. Paging is covered in detail for implementing virtual memory, and a brief coverage of segmentation is provided.<br /> Input/output is considered: polling, wait states, interrupt driven I/O, vectored interrupts, and Daisy Chaining, DMA transfers and transfer modes and I/O channels are covered.<br /> CISC and RISC computers and pipelining are covered next.<br /> Finally, an introduction to parallel and alternative computer architectures is given.<br /> <br /> ===Learning Outcomes===<br /> A knowledge of the working of a simple computer.<br /> <br /> <br /> ===Important Assignments and/or Exam Questions===<br /> Assignments include chapter summaries of textbook chapters ; pencil and paper quizzes are given over the course content.<br /> <br /> <br /> === Standard resources ===<br /> Computer Systems Organization and Architecture by John D. Carpinelli (Addison-Wesley, 2000, ISBN-10: 0-201-61253-4)</div>

wiki_previous>Znoble1