Computer Science 141: Computing Hardware Course Information Fall 2012

Similar documents
ENEE 302h: Digital Electronics, Fall 2005 Prof. Bruce Jacob

Phys4051: Methods of Experimental Physics I

CS 1103 Computer Science I Honors. Fall Instructor Muller. Syllabus

Computer Organization I (Tietokoneen toiminta)

Designing a Computer to Play Nim: A Mini-Capstone Project in Digital Design I

DIGITAL GAMING & INTERACTIVE MEDIA BACHELOR S DEGREE. Junior Year. Summer (Bridge Quarter) Fall Winter Spring GAME Credits.

Syllabus - ESET 369 Embedded Systems Software, Fall 2016

EECS 571 PRINCIPLES OF REAL-TIME COMPUTING Fall 10. Instructor: Kang G. Shin, 4605 CSE, ;

CS 101 Computer Science I Fall Instructor Muller. Syllabus

CS 100: Principles of Computing

Penn State University - University Park MATH 140 Instructor Syllabus, Calculus with Analytic Geometry I Fall 2010

Multidisciplinary Engineering Systems 2 nd and 3rd Year College-Wide Courses

Computer Science. Embedded systems today. Microcontroller MCR

Graduate Calendar. Graduate Calendar. Fall Semester 2015

WSU Five-Year Program Review Self-Study Cover Page

Computer Architecture CSC

MAE Flight Simulation for Aircraft Safety

Computer Science 1015F ~ 2016 ~ Notes to Students

CS Course Missive

Embedded System Design

Data Structures and Algorithms

CIS Introduction to Digital Forensics 12:30pm--1:50pm, Tuesday/Thursday, SERC 206, Fall 2015

SYLLABUS. or by appointment MGM Theatre Room 216, Rich Bldg.

SAM - Sensors, Actuators and Microcontrollers in Mobile Robots

Course Syllabus for Math

Syllabus: CS 377 Communication and Ethical Issues in Computing 3 Credit Hours Prerequisite: CS 251, Data Structures Fall 2015

Circuit Simulators: A Revolutionary E-Learning Platform


Instructor: Khaled Kassem (Mr. K) Classroom: C Use the message tool within UNM LEARN, or

PH.D. IN COMPUTER SCIENCE PROGRAM (POST M.S.)

GAT General (Analytical Reasoning Section) NOTE: This is GAT-C where: English-40%, Analytical Reasoning-30%, Quantitative-30% GAT

Form no. (12) Course Specification

TEACHING AND EXAMINATION REGULATIONS (TER) (see Article 7.13 of the Higher Education and Research Act) MASTER S PROGRAMME EMBEDDED SYSTEMS

We are strong in research and particularly noted in software engineering, information security and privacy, and humane gaming.

Ryerson University Sociology SOC 483: Advanced Research and Statistics

PHY2048 Syllabus - Physics with Calculus 1 Fall 2014

Academic Catalog Programs & Courses Manchester Community College

Computer Science (CSE)

CS 3516: Computer Networks

Math 181, Calculus I

GRADUATE PROGRAM Department of Materials Science and Engineering, Drexel University Graduate Advisor: Prof. Caroline Schauer, Ph.D.

SYLLABUS. EC 322 Intermediate Macroeconomics Fall 2012

FORENSIC SCIENCE SYLLABUS - AMENDED SPRING SEMESTER 2014

Chemistry Senior Seminar - Spring 2016

BUS Computer Concepts and Applications for Business Fall 2012

General Physics I Class Syllabus

A Hands-on First-year Electrical Engineering Introduction Course

College of Engineering and Applied Science Department of Computer Science

MATH 1A: Calculus I Sec 01 Winter 2017 Room E31 MTWThF 8:30-9:20AM

PSYCHOLOGY 353: SOCIAL AND PERSONALITY DEVELOPMENT IN CHILDREN SPRING 2006

DIGITAL GAMING AND SIMULATION Course Syllabus Advanced Game Programming GAME 2374

ECO 2013-Principles of Macroeconomics

EEAS 101 BASIC WIRING AND CIRCUIT DESIGN. Electrical Principles and Practices Text 3 nd Edition, Glen Mazur & Peter Zurlis

ENME 605 Advanced Control Systems, Fall 2015 Department of Mechanical Engineering

A R "! I,,, !~ii ii! A ow ' r.-ii ' i ' JA' V5, 9. MiN, ;

Self Study Report Computer Science

Oregon Institute of Technology Computer Systems Engineering Technology Department Embedded Systems Engineering Technology Program Assessment

Biology 10 - Introduction to the Principles of Biology Spring 2017

A systems engineering laboratory in the context of the Bologna Process

EECS 700: Computer Modeling, Simulation, and Visualization Fall 2014

*In Ancient Greek: *In English: micro = small macro = large economia = management of the household or family

Course Specifications

Radius STEM Readiness TM

State University of New York at Buffalo INTRODUCTION TO STATISTICS PSC 408 Fall 2015 M,W,F 1-1:50 NSC 210

Software Development: Programming Paradigms (SCQF level 8)

Session H1B Teaching Introductory Electrical Engineering: Project-Based Learning Experience

Infrared Paper Dryer Control Scheme

Scottsdale Community College Spring 2016 CIS190 Intro to LANs CIS105 or permission of Instructor

(Sub)Gradient Descent

Registration Fee: $1490/Member, $1865/Non-member Registration Deadline: August 15, 2014 *Please see Tuition Policies on the following page

Physics XL 6B Reg# # Units: 5. Office Hour: Tuesday 5 pm to 7:30 pm; Wednesday 5 pm to 6:15 pm

MASTER OF SCIENCE (M.S.) MAJOR IN COMPUTER SCIENCE

Art 343 ADVANCED TYPOGRAPHY Art Department Student Learning Outcomes Addressed in this Course

Syllabus for CHEM 4660 Introduction to Computational Chemistry Spring 2010

Instructor Dr. Kimberly D. Schurmeier

THE UNIVERSITY OF SYDNEY Semester 2, Information Sheet for MATH2068/2988 Number Theory and Cryptography

Practical Integrated Learning for Machine Element Design

Accounting 312: Fundamentals of Managerial Accounting Syllabus Spring Brown

MTH 215: Introduction to Linear Algebra

University of Groningen. Systemen, planning, netwerken Bosman, Aart

Office Hours: Mon & Fri 10:00-12:00. Course Description

Week 01. MS&E 273: Technology Venture Formation

Required Materials: The Elements of Design, Third Edition; Poppy Evans & Mark A. Thomas; ISBN GB+ flash/jump drive

UNIVERSIDAD DEL ESTE Vicerrectoría Académica Vicerrectoría Asociada de Assessment Escuela de Ciencias y Tecnología

GACE Computer Science Assessment Test at a Glance

Visualizing Architecture

International Business BADM 455, Section 2 Spring 2008

Class Meeting Time and Place: Section 3: MTWF10:00-10:50 TILT 221

Spring 2015 Natural Science I: Quarks to Cosmos CORE-UA 209. SYLLABUS and COURSE INFORMATION.

Strategic Management (MBA 800-AE) Fall 2010

The Policymaking Process Course Syllabus

Instructor Experience and Qualifications Professor of Business at NDNU; Over twenty-five years of experience in teaching undergraduate students.

PHYSICS 40S - COURSE OUTLINE AND REQUIREMENTS Welcome to Physics 40S for !! Mr. Bryan Doiron

A Practical Approach to Embedded Systems Engineering Workforce Development

New Venture Financing

ENGL 213: Creative Writing Introduction to Poetry

MGMT 4750: Strategic Management

QUEEN ELIZABETH S SCHOOL

TEACHING AND EXAMINATION REGULATIONS (TER) (see Article 7.13 of the Higher Education and Research Act) MASTER S PROGRAMME EMBEDDED SYSTEMS

CTE Teacher Preparation Class Schedule Career and Technical Education Business and Industry Route Teacher Preparation Program

Transcription:

Computer Science 141: Computing Hardware Course Information Fall 2012 September 4, 2012 1 Outline The main emphasis of this course is on the basic concepts of digital computing hardware and fundamental digital design principles and practices for computer systems. This course will cover topics ranging from logic design to machine organization and will address the impact of hardware design on applications and system software. An integral component of this course will be a sequence of hands-on hardware laboratory assignments where you will build digital circuits using simple logic gates and make use of some common software packages for Computer-Aided Design (CAD) and FPGA-based prototyping. Through these laboratory assignments, you will learn how to design, test, and construct complex hardware systems that interact with the real world. There is overlap between CS 141 and Physics 123. One would not normally take both CS141 and Physics 123. If you have questions about which course you should take, please feel free to see Professor Brooks. CS 141 is more focused on computer architecture and machine organization while Physics 123 (and ES 154 ) is broader and addresses the design of practical analog and digital circuits. CS 141 is good preparation for students interested in computer architecture (CS 146/246 ) and VLSI (CS 148/248 ). 2 Administrative Information Lectures: Laboratory: Instructor: Course Admin: Monday, Wednesday 1 2:30pm in Maxwell Dworkin G125 2-3 hours on Thursday or Friday in Maxwell Dworkin B127 Professor David Brooks (dbrooks@eecs.harvard.edu) 141 Maxwell Dworkin, 495-3989 Carol Harlow (harlow@seas.harvard.edu) 343 Maxwell Dworkin, 496-1440 Preceptor: Avinash Uttamchandani (avinash@seas.harvard.edu) 1

TFs: Kevin Brownell (brownell@eecs.harvard.edu) Tao Tong (taotong@seas.harvard.edu) Amanda Tseng (cntseng@eecs.harvard.edu) Regular office hours and lab-specific office hours will be posted on the course website. 3 Course Prerequisites CS 50 is the formal prerequisite for this course. CS61 is helpful preparation but not required. An understanding of binary numbers and some knowledge of basic electronics are helpful but not necessary. If you have any questions about your preparation, please contact Prof. Brooks directly. 4 Course Requirements Lectures While attendance at lecture is not required, it is strongly encouraged. In addition, while some lecture note handouts will be provided, they are not complete nor guaranteed to be correct nor a substitute for attending lecture. Sections We will arrange non-weekly sections that will be lead by one of the TFs. The section will discuss additional material and examples that cannot be covered during the lecture. Again, attendance is not required, but is strongly encouraged, as the material will be helpful for weekly assignments and exams. Regular Assignments Assignments consisting of a Problem Set and associated Hardware Lab will be assigned most weeks of the class. Problem Sets Problem sets are due at the beginning of your weekly lab section unless otherwise specified. Problem sets should be done individually. Please see the Policy on Late Problem Sets and Missed Labs below. 2

Hardware Labs Associated with each weekly assignment there will also be a hardware lab that you will work on with an assigned lab partner. Pre-lab assigments are considered part of your normal weekly assignments and need to be completed before you attend the lab sessions. Please make sure that you are fully prepared when you come to lab. You and your partner will have only 2 hours (or less) in lab to complete and demonstrate your work to the TF. Do not let the first few labs lull you into a false sense of security; you will not be able to complete the later labs if you have not done the pre-lab work and fully prepared for lab. Note that your TF will check to make sure that you have completed the pre-lab work before lab. You must complete all of the lab assignments (please see the Policy on Late Problem Sets and Missed Labs below). Examinations There will be a takehome midterm examination the week of October 15, 2012. A regular three-hour, Final Examination will be given during exam period and will cover all of the material in the class. Please bring a calculator to the final exam. Final Project In the final project you will work in teams of three to four to apply your digital design skills toward a real world problem of your choosing. Once you have formed your team, you will work together to create a project proposal so that we can make sure your idea is both challenging and feasible. Once your proposal is approved, you will have approximately three weeks to design, simulate, and implement your design. You will have to turn in a final report and give a live demonstration of your system to the teaching staff during the finals period. Your project does not need to be innovative or ground breaking, but it is critical that it contains a significant digital hardware design component. A good project can definitely include other systems (sensors, actuators, mechanical assemblies, etc.), but you will only be assessed on the rigor, complexity, and performance of the digital hardware part of your project. Some examples from last year: Wireless Pong Computer Text Terminal Pipelining and Branch Prediction exploration on FPGA Inverted Pendulum + Cart (Segway) 3

Policy on Late Problem Sets and Missed Labs You are expected to attend your assigned lab section and to work with your assigned lab partner. If you must miss your lab section on a particular week, we will attempt to accommodate you in another lab section during that same week. Please contact your TF and your lab partner in advance of your absence! In those rare instances where you have a valid reason for missing an entire week, you will be allowed to make up the lab in the following week (realize that this means you will have to do two labs in one week). Any missed lab past this one week grace period will be recorded as a zero. The Late Problem Set policy is that each student has 3 late days which can be used at any time throughout the semester. These days can be used in any combination (e.g. 1 day for 3 assignments, or 3 days for 1 assignment). A late day is defined as 24 hours from the original deadline. However, solutions will be made available three days after the deadline and problem sets will not be accepted after solutions are posted. Policy on Cooperation Please feel free to talk with other class members and the teaching staff about the problems sets and hardware laboratory assignments, but always turn in only your own work. It is in your best interest to understand the problem sets and the laboratories for the midterm and final exams. 5 Grading Your final grade will be based roughly on the following weighting of your course work: 15% Midterm Exam 25% Final Exam 20% Problem Sets 25% Hardware Lab Work 15% Final Lab Project 6 Reading Required Text David M. Harris and Sarah L. Harris. Digital Design and Computer Architecture. Morgan Kaufmann, 2007 (1st edition). Recommended Texts John F. Wakerly. Digital Design Principles and Practices. Prentice Hall, 2005 (4th edition). 4

David A. Patterson and John L. Hennessy. Computer Organization & Design: The Hardware/Software Interface. Morgan Kauffman, 2008 (4th edition). Randy Katz. Contemporary Logic Design. Benjamin/Cummings, 2004 (2nd edition). Educational Software Software will be provided to compile designs onto the FPGA prototype boards. 5

7 Tentative Course Schedule Week Lecture Topics Hardware Lab 9/3 Intro, passive elements, transistors, gates No Lab Assign Lab Times 9/10 Boolean algebra and combinational logic Lab #1 Lab Intro 9/17 Logic minimization Lab #2, Part 1 Combinatorial Circuits 9/24 Arithmetic Lab #2, Part 2 Verilog Adder 10/1 Sequential logic design Lab #2, Part 3 Complete ALU 10/8 Design of Finite State Machines (FSMs) Lab #3, Part 1 FSM 10/15 Memory and bussing Lab #3, Part 2 Memory 10/22 Instruction Set Architecture (ISA) Lab #3, Part 3 FSM Design Demo 10/29 Datapath Design Lab #4, Part 1 MIPS Datapath 11/5 Datapath Design and Pipelining Lab #4, Part 2 MIPS Datapath 11/12 Datapath Design and Pipelining Lab #4, Part 3 MIPS Datapath 11/19 Memory Systems Thanksgiving, No Lab, Project Proposals due 11/26 Machine Performance Final Project Project Checkpoint 1 12/3 Advanced Topics Final Project Project Checkpoint 2 12/10 Reading Week Lab Project Demos 6