C201/I210 Syllabus

Modified

 

Class Schedule
Jan

Reading and Notes

Test Homework Exercise SI Worksheets
12 Getting Started - Installing computer software.
Chapter 1 - Objects and Classes.
       
14       0 Answers  
17     1    
19 Martin Luther King Holiday        
21 Chapter 2 - Understanding class definitions.       1
24 Match your photo   2    
26          
28 CLASS CANCELED        
Feb          
2 Chapter 3 - Object Interaction     1a Answers 2
4       1b Answers  
7     3    
9 Chapter 4 - Grouping objects       3
11 Review - Bring a pair of ear phones or buds        
14     4    
16          
18 Test 1 - Chapters 1-3 and Notes 1      
23       2 Answers  
25     Last chance for
HW 1-3
  4
28     5    
Mar          
2          
4 Chapter 5 - More sophisticated behavior     3a Answers
3b Answers
 
7     6    
9 Array and ArrayList Practice     4 Answers  
11       5 Answers 5 Answers
13 Computer Science Candidate Presentation 10-11A in LF-111        
14     7    
16 Computer Science Candidate Presentation 10-11A in LF-111        
18 Review Array and ArrayList     6 Answers  
21 Computer Science Cool Again   8    
23 Spring Break        
30 Computer Science Candidate Presentation 2-3P in LF-111
Test 2 - Chapters 4-5 and Notes - No Sorting
2      
Apr          
1 Chapter 6 - Well-behaved objects        
4     9    
6 Chapter 7 - Designing classes        
8 Chapter 8 - Improving structure with inheritance     7 Answers  
11 Zuul   10 Extra Credit
Last Chance
HW 4-9
   
13 Chapter 9 - More about inheritance        
15 Array Practice
Chapter 12 - Handling Errors
    8 Answers  
17 3:30 p.m., CV105, talk by Dr. Kelly Jordan, NSA        
18     11    
20 Chapter 11 - Graphical User Interfaces        
22 Computer Science Candidate Presentation 10:30-11:30A in LF-111
Chapter 13 - Designing Applications - Review
    9 Answers  
27
5:30P
Test 3 Chapters 6-9 and Sorting 3 Last Chance
HW 10-11
   
 

 

Instructor:
Name:  Raymond F. Wisman
Office:   LF122
 MW 3:30-5:30P
 and by appointment
Phone:  941-2465
Email:
Web:  www.ius.edu/rwisman
Class:
Meetings:  LF105 MW 5:30P-7:20P
Prerequisites:  M117
Text:  Objects First with JAVA 4e Barnes & Kölling. 
 Prentice Hall ISBN 0-13-606086-2
Software:  JAVA and BLUEJ (both freely available)
Course Goals:  See C201 Course Goals
   
Supplementary
Instruction
 
Instructor:  William Apple (wapple@indiana.edu)
   M 4-5P, 9-10P LF246
 T 4-5P LF264
Laboratory

 
Consultants: 
Schedule:
 William Shato/Julia Wilcher
 M 12-3:30P LF119, 5-7:30P LF115, T 12-4P LF119,
 W 12-4P LF119, 5-7:30P LF115, R 12-3:30P LF119
Evaluation
Grade Scale:  
Grade Book:
A+ 97% - 100%    A  93% - 96%        A-  90% - 92%
B+ 87% -  89%     B  83% - 86%        B-  80% - 82%
C+ 77% -  79%     C  73% - 76%        C-  70% - 72%
D+ 67% -  69%     D  63% - 66%        D-  60% - 62%
F      0% -  59%
Course Evaluation: Tests 50%
Homework Assignments 40%
Exercises and Quizzes 10%     No late credit
Homework: Home works are due by Saturday midnight . Recognizing that work, computers, etc. occasionally take control, no penalty occurs for two class meetings late in total. Subsequent late homework will not be accepted.
Exercises: Generally completed in class but occasionally completed outside and demonstrated at next class.
Academic Ethics: All work is subject to the Indiana University Code of Student Ethics.

Learning requires a partnership between the instructor, authors, researchers and students; therefore students are encouraged to use any and all resources available to solve homework problems and complete programming assignments. However, students must:

  1. clearly cite any contributing source; a text, another student, the Internet, etc.
  2. create their own solutions

For example, students may work in groups to solve homework problems provided each student creates their own (not copies) solutions  and clearly lists all group members or other sources such as authors of texts or on the Internet. Likewise, software that performs assigned functionality may not be directly used but the source code may be consulted provided it is subsequently cited. Changing the spelling of algorithm identifiers does not constitute creating an original solution. It is absolutely essential to note that failure to cite any contributing source will be considered cheating regardless of the reason for the omission. Likewise, verbatim duplication of any source, whether from another student, a text, etc. will always be considered plagiarism.

Violation of any aspect of this policy will result in a failing grade for the course.

FAQ