Lecture Schedule (Tentative)

#

DAY

DATE

TOPIC

CHAP

NOTE

1

M

2/1

 Introduction

2

W

2/3

 Machine Architecture

3

M

2/8

 Operating Systems I

4

W

2/10

 Operating Systems II

M

2/15

 UNIX

5

W

2/17

 Binary/Hex

6

M

2/22

 Stored Programs

7

W

2/24

 Algorithms I Introduction

8

M

3/1

 Algorithms II S/W Development

9

W

3/3

 Algorithms III Pseudo-code

10

M

3/8

Algorithms IV Top-Down Design

MT

W

3/10

 MIDTERM

11

M

3/15

Introduction to C

1

12

W

3/17

Variables in C 

 2

SB

M

3/22

 Spring Break

SB

W

3/24

 Spring Break

13

M

3/29

 Arithmetic Operations

 2

14

W

3/31

  Relational Operations

 2, 3

15

M

4/5

 While Loops

 3

16

W

4/7

 Assignment Operators, Debugging

 3

17

M

4/12

 More Loops

 4

18

W

4/14

 Switch/getchar()

 4

M

4/19

 Program Examples

 5

19

W

4/21

 Functions I

 5

20

M

4/26

 Functions II

 5

W

4/28

 Functions III Examples

 6

21

M

5/3

 Arrays I

 6

22

M

5/5

 Arrays II

 6

23

W

5/10

 Searching & Sorting I

 6

24

M

5/12

 Searching & Sorting II

 6

FE

Tues

5/17-5/21

FINAL EXAM

All Course material

TBA PM