CS101 Syllabus
[Syllabus] [Announcements] [Lab Assignments] [Class Notes] [Tools]

CS101 - Fundamentals of Computer Programming
Lab TA: Jenny Chang & Kale Harbick
Class: W 3:30-5:20pm (Rm. SAL 126)
W 5:00-6:50pm (Rm. SAL 127)
Th 8-9:50am (Rm. SAL 127)
Office hours: W 12:50-1:50pm, Th 2:00-3:00 (Rm. SAL 235) -Jenny
T 3:30-4:00pm, W 2:00-3:00pm (Rm. SAL ?) -Kale
Additional office hours, click here.
Email Preferred: changjen[at]usc.edu / harbick[at]usc.edu (subject: cs101)
Syllabus Online: http://www-scf.usc.edu/~csci101/docs/syllabus.pdf
Course Objective: Provide hands-on programming experience in C.
Prerequisites: Computer Literacy
Requirement: Email Address
Grading: Each week the lab will have an in-class exercise and/or quiz. We will be using this for attendance.
Class Policy:

Academic dishonesty includes (but not limited to) the following:

  1. Giving or receiving information during an exam.
  2. Unauthorized or malicious use of computing facilities.
  3. Deception or misrepresentation in a student's dealing with the instructor, teaching assistant, or grader.
  4. Inappropriate collaboration on or coping of homework assignments. Students are encouraged to discuss the readings with one another, even when the discussion relates to assignments. As log as the purpose of discussion is to help the student's understanding of the material, and not to reduce or share the work, such discussion will not be deemed inappropriate.
  5. Plagiarism, the submission of material authored by another person but represented as the students own work. It does not matter whether the original work author gave permission.
  6. Any violation of academic integrity standards described in the student conduct code. Students are expected to be familiar with these standards.

The instructor, teaching assistant, and grader will make every attempt to detect cases of academic dishonesty.

Book: Required Text: Computer Science: A Structured Programming Approach Using C
Author: Behrouz A. Forouzan / Richard F. Gilberg
Publisher: Brooks / Cole Thomas Learning


Course Overview:
Course Contents:

 

Weeks Topics Readings
1 & 2 Intro to Computers, Algorithms & UNIX Systems
I/O Commands : printf, scanf		 Ch. 1,2
3 & 4 Functions Ch. 2,3,4
5 & 6 If & Switch Statements
Debugging Techniques & Software		 Ch. 5
 

Test 1=> Section 1: Sep. 28 Section 2: Sep. 29 Section 3: Sep. 28 **

 
7 Loops Ch. 6
8 Design for Large Amounts of Data Ch. 7,8
9 1D & Multidimensional Arrays Ch. 8
  Test 2=> Section 1:Oct. 26 Section 2: Oct. 27 Section 3: Oct. 26 **  
10 Pointers & Memory Addresses Ch. 9
11 Arrays & Strings Ch. 10
12 & 13 Structures Ch. 11,12
 

Test 3=> Section 1: Nov. 21 Section 2: Nov. 22 Section 3: Nov 21 **

  
14 Binary Files Ch. 13

** The lab exercises/quizzes will cover materials from lectures covered in the current or previous weeks.
Examination: Midterms: Week 6, 9, 13
Final:

Section 1 ( 2:00-03:15 MW) : Friday, Dec. 9, 2:00-4:00 p.m.

Section 2 ( 2:00 - 3:15 T Th) : Monday, Dec. 12, 2:00-4:00 p.m.

Section 3 ( 3:30-04:50 M W) : Thursday, Dec. 8, 2:00-4:00 p.m.