CSCI160 COMPUTER ARCHITECTURE I  HUNTER COLLEGE CITY UNIVERSITY OF NEW YORK Spring 2024     Tuesday and Friday   11:30 PM to 12:45 PM    IN PERSON in the Hunter West 615. However, in order to prepare for potential contigencies, several lectures throughout the semester will take place on BlackBoard Collaborate TBA SYLLABUS                                                                                 
GRADESCOPE [Entry Code: 4GEVV8]

INSTRUCTOR
Genady Maryash   gmaryash@hunter.cuny.edu   office hours TBD and by appointment

TEXTBOOK
Digital Design, 6th (or 5th) 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 older edditions.

OTHER RESOURCES
Circuit Builder Simulator

TUTORS

Tutoring Schedule
Devin calendly.com/dewiin/devin-s-160-tutoring
Judy calendly.com/judy-liu94/tutoring?month=2024-02
Sarah calendly.com/sarahkhaldi-160/10min
Steven calendly.com/steven-palomino/csci160-office-hours
Syeda calendly.com/huntertutoring/160-ta-w-syeda

COURSE OUTLINE

DATE TOPIC READINGS SLIDES ASSIGNMENTS
1/26 Introduction Syllabus   Homework 0 due 1/30
1/30 Binary Numbers 1.2 Binary Numbers Class 1 Homework 1 due 2/2
2/2 Radix Conversions 1.3 Number Base Conversions
1.4 Octal and Hexadecimal Numbers		 Class 2 Binary Multiplication
Div \(_{10}\), Div \(_2\), Div \(_2\) 2
Homework 2 due 2/6
2/6 Complements of Numbers 1.5 Complements of Numbers
1.6 Signed Binary Numbers		 Class 3 Homework 3 due 2/9
2/9 Binary Codes 1.7 Binary Codes
1.9 Binary Logic		 Class 4 Homework 4 due 2/13
2/13 Boolean Algebra 2.2 Basic Definitions Class 5 Homework 5 due 2/16
2/16 Axioms 2.3 Axiomatic Definition Class 6 Homework 6 due 2/20
2/20 Test 1, etc.      
2/23 Functions and Proofs 2.4 Theorems and Properties
2.5 Boolean Functions		 Class 7 Homework 7 due 2/27
2/27 Boolean Algebra
Logic Gates		 2.7 Other Logic Operators
2.8 Digital Logic Gates		 Class 8
Class 9		 Homework 8 due 3/5
Homework 9 due 3/8
3/1 Test 2
Midterm Review		   Midterm Review  
3/5 MIDTERM EXAM    
~~~~ ~~~~~~~~~~~~ ~~~~~~~~~~~~~~~~~~~ ~~~~~ ~~~~~~~~~~~~~~~~
3/8 Canonical vs Standard 2.6 Canonical and Standard Forms Class 10 Homework 10 due 3/12
3/12 Gate Level Minimisation 3.2 The Map Method
TB K-Map Method		 Class 11
K‑Map Torus		 Homework 11 due 3/15
3/15 4-Var K-map
5-Var K-map		 3.3 Four-Variable K-Map
4.3 Combinational Circuit Analysis		 TB KMaps
Class 12		 Homework 12 due 3/19
Homework 13 due 3/19
3/19 7-Segment Display 3.5 Don’t-Care Conditions Class 13 Homework 14 due 3/22
3/22 TEST 3 etc.    
3/26 Tabulation Method Quine-McCluskey
Tabular Method		 Class 14 Homework 15 due 3/29
3/29 Prime Implicant Table Prime Implicant Table Class 15 Homework 16 due 4/5
4/2 Adders
Subtractors		 4.4 Design Procedure
4.5 Binary Adders and Subtractors		 Class 16
Class 17		 Homework 17 due 4/9
Homework 18 due 4/9
4/5 Comparator &
Controlled Input		 4.11 Multiplexers Class 18
FlipFlops		 Homework 19 due 4/9
4/9   5.4 Storage Elements: FlipFlops Class 19 Homework 20 due 5/2
4/12 Test 4
Racing Fix
JK Flip-Flop		 Racing Problem Animation
J K FlipFlop Animation		 Class 20 Outstanding
Home Works
4/16 State Diagrams Four-Variable K-Map  Review Class 21  
4/19 State Equasions,
Finate State Machines		 5.5 Analysis of Clocked Sequential Circuits Sequetial Circuit & Equations
State Table for Circuit
State_Table_and_Diagram
Equasions_and_FSMs
Input_Equasions
States_D_FlipFlop
In_Mealy_FSM_output_is_function_		  
5/7 Test 5
Flip-Flops, States		 Finite State Machines    
5/11 Exam Review 1      
5/14 Exam Review 2      
5/21 Final Exam Wednesday 9:00 AM – 11:00 AM