CSCI160 COMPUTER ARCHITECTURE I  HUNTER COLLEGE CITY UNIVERSITY OF NEW YORK Fall 2021     Monday and Thursday   2:45 PM to 4:00 PM    in person in Hunter West 615. However, in order to prepare for potential contigencies, several lectures throughout the semester will take place on BlackBoard Collaborate - the first one on Thursady September 9. SYLLABUS                                                                                  GRADESCOPE [entry code ERX32V]

INSTRUCTOR
Genady Maryash   gmaryash@hunter.cuny.edu   office hours Monday and Thursday   4:15 PM to 5:15 PM to on BlackBoard Collaborate.

TUTORS
Shafali calendly.com/shafali-gupta21/csci-160-office-hours-shafali
Andy calendly.com/andy-mina30/office-hours/
Daniel calendly.com/daniel-elkik26/160-office-hours
Jack calendly.com/james-cruse/csci-160-tutoring

TEXTBOOK
Digital Design, 6th Edition eText, Mano, Ciletti ISBN-9780134529561. It can be purchased at a discounted price ($54.99) direct from the publisher through Vitalsource.com in order for the chapter links to work. Do not buy any other electronic version of this edition of the book. Of course, you may be able to find prior editions of this book for less – you will simply have to match the reading assignments to those older edditions.

OTHER RESOURCES
Circuit Builder Simulator{target:=”_blank”}

COURSE OUTLINE

DATE TOPIC READINGS SLIDES ASSIGNMENTS
8/26 Introduction Syllabus   Homework 0 due 8/30
8/30 Binary Numbers 1.2 Binary Numbers Class 1 Homework 1 due 9/2
9/2 Radix Conversions 1.3 Number Base Conversions
1.4 Octal and Hexadecimal Numbers
Class 2 Binary Multiplication
Binary Division
Homework 2 due 9/9
9/9 CLASS ONLINE TEST #1 ON BLACKBOARD AND GRADESCOPE  
9/13 Complements of Numbers 1.5 Complements of Numbers
1.6 Signed Binary Numbers
Class 3 Homework 3 due 9/16
9/20 IN-PERSON Binary Codes 1.7 Binary Codes
1.9 Binary Logic
Class 4 Homework 4 due 9/23
9/27 Boolean Algebra 2.2 Basic Definitions Class 5 Homework 5 due 9/30
9/30 Axioms 2.3 Axiomatic Definition Class 6 Homework 6 due 10/4
10/4 Functions and Proofs 2.4 Theorems and Properties
2.5 Boolean Functions
Class 7 Homework 7 due 10/7
11/7 More Boolean Algebra Test 3 Class 8  
10/11 Compound Operators 2.7 Other Logic Operations   Homework 8 due 10/14
10/14 Logic Gates 2.8 Digital Logic Gates Class 9 Mano
10/18 Midterm Exam      
10/21 Canonical vs Standard 2.6 Canonical and Standard Forms Class 10 Homework 10 due 10/25
10/25 Gate Level Minimisation 3.2 The Map Method
3.3 Four-Variable K-Map
Class 11 Homework 11 due 10/28
10/28 5-Var K-map 4.3 Analysis of Combinational Circuits Class 12 Homework 12 due 11/1
11/1 7-Segment Display 3.5 Don’t-Care Conditions Class 13 Homework 13 due 11/4
11/4 Tabulation Method Quine-McCluskey
Tabular Method
Class 14 Homework 14 due 11/8
11/8 Tabular Method of Minimisation Prime Implicant Table Class 15 Homework 15 due 11/11
11/11 Adders 4.4 Design Procedure Class 16 Homework 16 due 11/15
11/15 Subtractors 4.5 Binary Adders and Subtractors Class 17 Homework 17 due 11/18
11/18 Controlled Input 4.11 Multiplexers Class 18
FlipFlops
Homework 18 due 11/22
11/22 Flip-Flops, Clock 5.4 Storage Elements: FlipFlops Class 19 Homework 19 due 11/29
11/29 Racing Fix
JK Flip-Flop
RP Lecture Animation
J K Lecture Animation
Class 20
Class 21
 
12/2 State Diagrams 5.5 Analysis of Clocked Sequential Circuits State Tables
and Diagrams
 
12/6 State Equasions,
Finate State Machines
K-Map Method from the Book
Four-Variable K-Map
Textbook KMaps  
12/9 Review 1 Review 1
Review 2
   
12/13 Review 2 !!! ON BLACKBOARD COLLABORATE !!! !!! ONLINE !!!  
12/20 FINAL EXAM MONDAY 12/20 1:45 – 3:45 HW615  


Instructor Evaluations:

Computer: www.hunter.cuny.edu/te
Smartphone: www.hunter.cuny.edu/mobilete