CS302 Course Calendar

Course Calendar
Topic	Lecture	Resource	Page
An overview and number system	1	Handouts	1-13
Number system	2,3	Handouts	14-30
Number system & codes	4	Handouts	31-39
Logic gates	5	Handouts	40-49
Logic gates and operational characteristics	6	Handouts	50-60
Digital circuits and operational characteristics	7	Handouts	61-70
Boolean algebra and logic simplification	8	Handouts	71-78
Assignment # 01
SOP and POS form	9	Handouts	79-88
Karnaugh map and Boolean expression simplification	10,11	Handouts	89-108
Comparator	12	Handouts	109-117
Quiz # 01
Odd-Prime number Detector	13	Handouts	118-130
Implementation of an odd-parity generator circuit	14	Handouts	131-140
BCD adder	15	Handouts	141-149
16-Bit ALU	16	Handouts	150-159
Assignment # 02
The 74xx138 3-to-8 Decoder	17	Handouts	160-168
2-input 4-bit multiplexer	18	Handouts	169-177
Demultiplexer	19	Handouts	178-189
Implementing constant 0s and 1s	20	Handouts	190-199
The GAL16v8	21	Handouts	200-208
ABEL input file of a quad 1-of-4 MUX	22	Handouts	209-216
Mid Term Exams
Application of S-R latch	23	Handouts	217-236
Applications of edge-triggered D flip-flop	24	Handouts	237-247
Asynchronous preset and clear inputs	25	Handouts	248-257
Assignment # 03
The 555 timer	26	Handouts	258-269
Down counters	27	Handouts	270-276
Timing diagram of a synchronous decade counter	28	Handouts	277-285
Up/Down counter	29	Handouts	286-304
Digital Clock	30	Handouts	305-313
GDB
S-R flip-flop based implementation	31	Handouts	314-319
D flip-flop based implementation	32	Handouts	320-327
State assignment	33	Handouts	328-338
Shift registers	34	Handouts	339-348
Applications of shift registers	35,36	Handouts	349-369
Reduced number of input latches	37	Handouts	370-377
Assignment # 4
Skip lists insertion and deletion	40	Handouts	441-448
Table ADT implementation using Hashing	41	Handouts	449-458
Collision resolution in Hashing	42	Handouts	459-467
Quiz # 02
Other uses of Hashing, sorting	43	Handouts	468-473
Selection sort, insertion sort, bubble sort algorithms	44	Handouts	474-484
Divide and conquer strategy: merge sort, quick sort.	45	Handouts	485-504
Final Term