CS256 Tentative Schedule

 

We will try to cover the material according to the following schedule.  The readings listed in the right column of a row are the readings that prepare you for that day’s lecture.  Reading the text sections before we cover them in class will help you better understand the lecture. The numbers shown in the Reading Assignments column are chapter.section.subsection numbers in the respective textbooks.  

 

Date

Topic

Reading

W   e   e   k      1

Mtg1 1

Overview, Syllabus, JGrasp, Compiler errors

Eck 1.1 – 1.4

L&L 1.1 – 1.5

Mtg1 2

Method call, String Literals, Outputting a value,

Introduce lab 1

L&L 2.1

Mtg2 1

Variables, Primitive types and literals, Assignment statement, Inputting a value, Expressions

Eck 2.1, 2.2

Eck 2.3.1: both ‘subroutines’ and ‘functions’ are called ‘methods’

·       a ‘subroutine’ is a method that does not return a value

·       a ‘function’ is a method that does return a value

Eck 2.4.1:

·       We will use the TextIO class to input values from the user.

L&L 2.2-2.4, 2.6

Mtg2 2

Expression evaluation,

Get familiar with submitting a lab. 
Lab 1 help.

W   e   e   k      2

Mtg1 2

MLK holiday

 

Mtg1 2

MLK holiday

Mtg2 1

if statements, compound statements,

the debugger

Eck 3.1, 3.2

L&L pp. 201 – mid 217

Mtg2 2

Nested ifs,
Introduce lab 2

Eck 3.5

L&L pp mid 218 – mid 220

W   e   e   k      3

Mtg1 1

while loops:
loops with counters,

indefinite loops,

infinite loops

Eck 3.3 – note 3.3.3 talks about break and continue, which are non-structured control flow statements.

L&L pp. 227 – 233

Mtg1 2

loops with multiple exit conditions,

Nested loops

Eck 3.4 – note this chapter introduces ‘for’ loops, but is the only place Eck talks about nested loops

L&L pp. 201 – 206 (repeat of some of last week’s reading)

L&L pp. 234 – mid 237

Mtg2 1

method declarations

Eck 4.1, 4.2

L&L pp. 166 – 167

Mtg2 2

Introduce lab 3

 

W   e   e   k      4

Mtg1 1

method return values

method parameters

method calls

Eck 4.4, 4.3.1 – 4.3.3

L&L pp. 167 – 170

 

 

Mtg1 2

Introduce lab 4

 

Mtg2 1

Exam 1

notes/Exam1StudyGuide.htm

Mtg2 2

Exam 1

 

W   e   e   k      5

 

Local data

Variable scope

Eck 4.3.4, 4.3.6, 4.7.1, 4.7.3

L&L p. 170

 

Math class

primitive types

API

Eck 4.5.1-3 (4.5.4 is cool, but won’t be covered)

L&L pp. bot 73 – bot 75, 3.3, 3.5

Mtg2 1

automatic promotion of integers

floating point equality

L&L 2.5, 220-221

http://cs.sou.edu/~nordquip/cs256/notes/Week05_Notes02.htm

Mtg2 2

Lab 5

W   e   e   k      6

Mtg1 1

boolean variables

logical operators operator precedence

L&L bot 78 – 82 (operator precedence)

 

 

Mtg1 2

Characters

Eck 2.2.2

L&L pp. bot. 75 – 77

Mtg2 2

Exam 2

notes/Exam2StudyGuide.htm

Mtg2 2

Lab 6

W   e   e   k      7

Mtg1 1

 

 

Mtg1  2

Strings,

character escape sequences,

Concatenation,

conversion of values of primitive types to Strings

L&L 2.1, 3.2

 

 

 

 

 

 

Mtg2 1

Defining your own class
Creating instances of a class

calling instance methods

Eck 5.1.1, 5.1.3

L&L 3.1, 4.1, 4.2

 

 

 

 

Mtg2 2

Lab 7

W   e   e   k      8

Mtg1 1

Creating objects with java code
Constructors

Eck 5.1.2 , 5.2

L&L 4.4, 3.1 (pointers) 

Mtg1 2

More Practice creating objects and using constructors

 

 

Mtg2 1

Exam 3

notes/Exam3StudyGuide.htm

Mtg2 1

Practice calling methods that objects provide.

String methods

Random

Eck 5.3

L&L pp. mid 245 – mid 249, 83 – top 84, section 5.4

Mtg2 2

W   e   e   k      9

Mtg1 1

Arrays

Eck 7.1

L&L 7.1, 7.2 (through mid 380)

Mtg1 2

Walking / Searching arrays

Mtg2 1

Arrays of Objects

 

Mtg2 2

 

W   e   e   k      1   0

Mtg1 1

Sorting

Eck 7.1

L&L 7.1, 7.2 (through mid 380)

Mtg1 2

TBD

Mtg2 1

Exam 4

notes/Exam4StudyGuide.htm

Mtg2 2

 

Last moment to turn in projects is Friday, March 23 at 11:59 PM.