CS 151 SQ08 Digital Logic Design

Course Web Page:

http://www.ics.uci.edu/~lbathen/cs151-sq08

Instructor:

Prof. Nikil Dutt
Email:   dutt@uci.edu
Office:   3086 DBH

Instructor Office Hours:

After class and by appointment

Lecture:

Tu Th 11-12:20 ICS 174

Discussion Section:

M W F 9-9:50 ELH 110
Enrollment and attendance in the discussion section is mandatory.
The instructor may sometimes deliver lectures during the discussion hour.
Quizzes will be administered during discussion sections.
Some new material WILL be covered in discussions!

Primary Textbook:

Digital Design, Frank Vahid, Wiley 2007

Prerequisites:

ICS 51, Math 6A, Math 6B

TA:

Luis (Danny) Bathen
Email:    lbathen@uci.edu

TA Office Hours:

After discussion section and TBD

Grader:

Darren Strash
Email:    dstrash@uci.edu

Course Noteboard:

Use My EEE for accessing the CS 151 course noteboard;
Use the noteboard (not email) for all questions regarding the course.

Quizzes (50%):

Seven (almost-weekly) quizzes: see course schedule
(We’ll drop two quizzes with the lowest scores)

Midterm (20%):

Tuesday, 4/29 in ICS 174 (tentative, see course schedule)

Final Exam (30%):

Tuesday, 6/10 in ICS 174

Course Slides:

Ch 1 Slides    Ch 2 slides    Ch 3 Slides    Ch 4 Slides    Ch 5 Slides    Ch 6 slides    

Suggested Homeworks (from Textbook):

Chapter 1: 1.3 1.7 (b,e) 1.10 (a,c) 1.14 (b,d) 1.18 (b,d) 1.21 (a,c) 1.22 (b,d) 1.25(e) 1.26(d) 1.28 1.30 1.31 1.32

Chapter 2: 2.9 2.11 (a,d) 2.13 (b,c) 2.16 (a) 2.18 (c) 2.19 2.21 2.24 (a,b) 2.27 2.29 2.30(c)    2.31   2.34(c)   2.36   2.37   2.44   2.47(a)   2.50 2.54    2.57    2.59 2.64    2.65 2.70    2.72    2.75    2.78    2.80    2.81

Chapter 3: 3.2(b,c)   3.4(a,d) 3.9    3.11    3.13    3.15   3.21 3.23 3.27  3.28   3.29   3.30   3.32 3.39   3.41   3.42   3.45   3.48

Chapter 4:   4.2 4.5   4.8   4.10   4.12   4.13  4.17   4.20   4.26   4.29   4.33    4.35  4.39   4.40   4.43   4.44   4.48(d) 4.51(f) 4.54   4.55   4.56   4.58   4.60

Chapter 5: 5.4   5.6 (Cont.)  5.12 5.14 (Cont.)  5.16 (Cont.)  5.18 (Cont.) 5.22 5.23 5.24 5.25  (Cont 1.) (Cont 2.) 5.28 5.29  (Cont 1.) (Cont 2.) 5.44 5.45 5.54 5.56

Chapter 6: 6.3, 6.4 6.7-6.12, 6.15 6.17, 6.20, 6.23, 6.24 6.26, 6.29-6.31, 6.32, 6.33, 6.34, 6.35 (cont. 1) (cont. 2) (cont. 3), 6.36

For more information regarding Quizzes and Midterms see the Sample Quizzes/Midterms section.

Course Objective : The goal of this course is to learn the basic principles of digital design. The course aims at enabling a student to design small digital systems for different applications starting from abstract specifications or behavioral/structural descriptions.

  1. Course Format:   The course has two major mandatory components: lectures and discussions. Basic concepts and illustrative examples will be introduced in the lectures; sample problems, as well as some supplemental material will be covered in the discussion sections. You are responsible for material covered in the lectures AND the discussions.
    • Lectures
      The lectures will be based mostly on the material covered in the textbook. However, there may be some additional material covered in the discussion sections.
      The lectures will use Powerpoint slides based on figures and examples from the textbook.
      You are responsible for keeping track of any additional material covered on the board and discussed in class.
      It is in the best interest of the student to come to class after reading the relevant chapter(s) of the book.
      The lecture will be fast paced. Thus I strongly recommend that you scan the sections before coming to the class, and also attend the ensuing discussion sections to maximize understanding of the material.

    • Discussion Sections
      You must register in the discussion section. Quizzes may be administered in the discussion section. Each discussion session will be composed of two parts.
      During the first part, the TA will solve sample problems related to concepts covered in the lectures, and may also cover some supplemental material. (You are responsible for any material covered in the discussion sections as well.)
      The second part is structured as an embedded "mini-office-hour", where you can ask questions and get help with concepts or with homework problems.

  2. Course Announcements : All announcements will be made at the beginning of the class, on the CS 151 course web page, and on the CS 151 NoteBoard on EEE.
    Any handouts will be distributed at the beginning of the class, and will be available on the course web site.
    It is your responsibility not to miss any announcements made in the class, the course web site, or on the CS 151 Course NoteBoard.

  3. Drop Policy: Drops will be permitted until the end of the third week of class (Friday, 4/18).
    Use WebSOC to drop the class. No drop cards will be signed, and drops will not be permitted after 4/18. There will be no exceptions to this drop policy.

  4. Homework : Suggested homeworks from the text book are posted as above on the course web page for practice at home.
    These homeworks will not be graded; instead, you will be tested on similar material in the weekly quizzes and exams.
    Discussion sections will demonstrate procedure and results for some of these sample homework problems.

  5. Evaluation Strategy : Your final grade in this course will be based on seven quizzes (50% total), one mid-term exam (20%) and a comprehensive final exam (30%). We'll drop 2 quizzes with the lowest score.
    No alternative test arrangements can be made. Graded quizzes and exams will be returned through the distribution center. Solution and grading keys will be posted on the course web page.

  6. Cheating Policy : If you are not already familiar with the department's cheating and plagiarism policies and procedures, read the Cheating Policy document, available from the ICS Undergraduate Student Affairs Office.

  7. Formula for Success in CS 151 :
    Scan lecture material before class.
    Annotate textbook with notes during discussions.

    Review lecture material after the class.
    Solve suggested homework problems.
    Attend the discussion sessions.
    Meet with TA's to resolve any discrepancies promptly.

  8. Who to see for help:
    Questions pertaining to the lectures: Instructor.

    Questions regarding suggested homework problems : TA.
    Regrade requests: Grader.
    Errors or corrections on posted scores : TA


Tentative Course Schedule for CS 151 SQ 08 (Dutt)

Class meets:

Ø TuTh 11-12:20 in ICS 174 for lectures
Ø MWF 9-9:50 in ELH 110 for discussions

NOTE:

  1. Due to my travel schedule, I may deliver some lectures during discussion sections
  2. Discussion sections are *mandatory*: we will cover some new material and solve problems to enhance understanding of concepts introduced in the lectures
  3. Quizzes are often scheduled during discussions section meetings

 

Date Topics Readings
Review & Combinational Logic Design  
3/31 Mon   Intro, Boolean Algebra, Comb Logic Design Vahid 1.1-1.3, 2.1-2.5,
Apendix A and B
4/1 Tu Intro, Boolean Algebra, Comb Logic Design Vahid 1.1-1.3, 2.1-2.5,
Apendix A and B
4/2 Wed   Combinational Logic Design Vahid, 2.5-2.13, 3.1-3.2
**4/3  Th Discussion meeting  
 

 
Sequential Logic Design    
4/7 Mon  Quiz 1  (Covers Chapters 1 and 2.1-2.7)   Solution      
**4/8 Tu Flip Flops and FSMs  Vahid  3.3-3.4 
**4/10 Controllers and Sequential Design     Vahid  3.5, 3.8
 

 
 
Datapath Components    
4/14 Mon Quiz 2 (covers Chapters 2.8-2.13 and Chapter 3.1-3.4)   Solution  
4/15 Registers, Adders, Shifters, Comparators, Counters   Vahid 4.1-4.6
4/17 Multipliers, Subtractors , ALUs, Registers  Vahid 4.7-4.13
Fri 4/18 LAST DATE TO DROP CLASS  
 

 
RTL Design    
4/21 Mon Quiz 3 (covers Ch 3.5, 3.8, 4.1-4.6)    Solution  
4/22 RTL Design : Method, Examples Vahid  5.1-5.3
4/23 Wed  RTL Design : Method, Examples Vahid  5.3 
**4/24 Discussion meeting  
 

 
 
4/28 Mon  RTL Design : Clock Frequency, C-to-Gates Vahid 5.4-5.5
4/29  MIDTERM  (Covers Chapters 1-5.3)    Solution  
5/1  Memory Components    Vahid 5.6-5.8
 

 
 
Optimizations & Tradeoffs    
5/6 Comb. Logic Optimization & Tradeoffs Vahid 6.1-6.2 
5/8 Seq. Logic Optimization & Tradeoffs Vahid 6.3
5/9 Fri  Quiz 4 (Covers  Chapters 5.4-5.8)    Solution   
 

 
 
5/13 Seq. Logic Optimization & Tradeoffs Vahid 6.3
5/15 Datapath Component Tradeoffs Vahid 6.4
5/16 Fri  Quiz 5 (Covers Chapters 6.1-6.2)    Solution  
 

 
 
5/20  RTL Design and Optimization Vahid 6.5
5/22 Th  Quiz 6 (Covers Chapter 6.3)    Solution  
 

 
 
5/26 Mon UCI Memorial Day Holiday  
5/27 RTL Design and Optimization Vahid 6.5 
5/30 Fri  Quiz 7 (Covers Chapter 6.4-6.5)    Solution  
 

 
6/3 RTL Design, Optimizations, Tradeoffs Vahid 6.6-6.7
6/5 Course review  
 

 
6/10 Tue Comprehensive Final Examination, 10:30-12:30,  ICS 174    Solution  

KEY: **Date == I’m out of town

Sample Quizzes/Midterms

Quarter/Year List of Exams

Spring 2007 Quiz 1    Quiz 2    Quiz 3    Quiz 4    Quiz 5    Quiz 6    Quiz 7    Midterm    Final   
Solutions:    Quiz 1    Quiz 2    Quiz 3    Quiz 4    Quiz 5    Quiz 6    Quiz 7    Midterm   

Winter 2007 Quiz 1    Quiz 2    Quiz 3    Quiz 4    Quiz 5    Midterm    Final   
Solutions:    Quiz 1    Quiz 2    Quiz 3    Quiz 4    Quiz 5    Midterm    Final   

Fall 2006 Quiz 1    Quiz 2    Quiz 3    Quiz 4    Quiz 5    Quiz 6    Quiz 7    Midterm    Final   
Solutions:    Quiz 1    Quiz 2    Quiz 3    Quiz 4    Quiz 5    Quiz 6    Quiz 7    Midterm    Final   

Spring 2006 Quiz 1    Quiz 2    Quiz 3    Quiz 4    Midterm    Final   
Solutions:    Quiz 1    Quiz 2    Quiz 3    Quiz 4    Midterm    Final   

Winter 2006 Midterm    Final   

Fall 2005 Midterm    Final