Computer Science II - 72525 - CS 211 - 002 – Fall 2007 – STI 122

 

Instructor

Name: Cliff Clausen, Ph.D.

Email: cclausen@gmu.edu

Office Hours: By appointment (Tue-Wed between 7:30 -10:00 pm. is best)

Office: I am an adjunct professor and do not have an office. For make-up exams and appointments, we will normally meet in the Johnson Center.

 

Our TA

Name: Jyosthna Srigiriraju

Email: jsrigiri@gmu.edu

Office Hours:

           Tuesday : 3:00 pm to 5:00 pm
           Thursday : 2:00 pm to 4:00 pm

Other Section TA

Name:   Doug Corner

Email: dcorner@gmu.edu

Office Hours:

         Monday 3:30 - 5:30
           Wednesday 12:30 - 2:30

UTA

Name:

Email:

 

 

 

Course Description

211 Computer Science II (3:3:0) Prerequisite: grade of C or better in CS 112. Continuation of CS 112. Topics include abstract data types and data structures (sets, files, strings, linked lists, stacks, queues, trees, graphs) and examples of applications. Emphasis on program development reinforced through several larger programming projects. Additional programming language instruction supplements major topics.

 

Text

Carrano, Data Abstraction and Problem Solving with Java, 2nd Edition

 

Honor Code Statement

As with all GMU courses, this course is governed by the GMU Honor Code. In this course, all assignments, exams, and project submissions carry with them an implicit statement that it is the sole work of the author, unless joint work is explicitly authorized. Help may be obtained from the instructor or other students to understand the description of the problem and any technology, but the solution, particularly the design portion, must be the student's own work. If joint work is authorized, all contributing students must be listed on the submission. Any deviation from this is considered an Honor Code violation, and as a minimum, will result in failure of the submission and as a maximum, failure of the class.

Links

Academic Calendars

Exam Schedule

Honor Code

WebCT

NetBeans

Java

Java API

Computer Accounts

GMU Downloads

Prof Fleck’s Page

Exams

Quiz and exam dates in the schedule below most likely will not be changed. If you know in advance that you will miss a midterm exam, please let me know ahead of time so that I may schedule one make-up exam date for all. If an emergency occurs and you miss an exam without prior arrangements, I will expect some proof of the emergency. The make-up exam more than likely will not be the same as the scheduled exam. There will be no make-ups for quizzes. However, you do not need to take all quizzes; see my grading policy below.

Grading

  1. Quizzes and labs count 15% of your grade. Each lab and quiz will have equal weight, even if the number of points assigned are different. A zero will be assigned to any lab or quiz that you do not take. Your average will be calculated from at most the top 75% of your lab and quiz grades.
  2. Midterms count 25% of your grade. The first midterm will count 10% and the second 15%.
  3. Projects count 40 % of your grade. I expect that there will be four projects.
  4. The final exam counts 20% or your grade. You must take the final exam to pass the course.
  5. Quiz and exam number grades may be adjusted upward at my discretion. I’ll let you know what the adjustments are when I return each quiz or exam.
  6. Your final course grade will be no worse than the higher of the grade determined from your percentage grade and your class percentile as determined by the table below. If I adjust the grading policy, it will be in your favor and will apply to the class as a whole.

Percent

Percentile

Grade

98+

97+

A+

93+

90+

A

90+

85+

A-

87+

80+

B+

83+

70+

B

80+

50+

B-

77+

40+

C+

70+

20+

C

60+

10+

D

else

else

F

 

Late Policy:
There are always problems that occur when programming, so start early and plan to turn the assignments in at least a few hours before the final due date. Internet problems, WebCT problems, and many other things can occur. The late policy for all assignments will be:

< 3 hours late

- 3%

< 24 hours late

- 5%

< 48 hours late

- 20%

< 7 days late

- 50%

> 7 days late (don't turn it in)

- 100% 



Grade Appeal Policy:
If you feel you deserve a better grade on an assignment, you can appeal your grade in writing. Written grade appeals will only be accepted within 7 days of you receiving the grade. The appeal should clearly explain why you feel you deserve a higher grade. I will never lower your grade due to an appeal, but I may or may not raise your grade depending on your justification.

Schedule

The following class schedule will be augmented as the semester progresses. Additionally, time will be spent in class covering some aspects of projects as they become available in WebCT.

 

You are expected to do the homework assignments; however, I will not be collecting them since I have provided the answers with the questions. We will spend time in class going over the homework. The homework is important for learning and because the homework questions will be similar to what you will see on exams. I expect you to be responsible adults and do the homework!

 

Start studying for exams at least two weeks in advance.

 

Lesson

Date

Topic

Assignment

Lesson Links

1

8/27

Schedule

Honor Code

Linux commands

Java  Review

Project 1 Description

Ch 1

HW 1

Unix Commands

Basic Java Code

Basic Linux

grep

Project1

Lab 01

 

9/3

NO CLASS

 

 

2

9/10

Java Review  (continued)

Quiz (Ch 1)

Netbeans

Software Engineering

Ch 2

HW 2

Quiz1

Java Platform

Netbeans Tutorial 1

Software Engineering

3

9/17

Big O

ADT

Interfaces (Comparable)

Arrays

Arrays that grow

Array List
Sorted List

Ch 10.1

Ch 4

HW 3

Project 1 Due

List Examples

Comparable

Big O

ADT

Arrays

Book List

4

9/24

Recursion

Linked Lists

Ch 3,  5

HW 4

Factorial

Fibonacci

Tic Tac Toe

Hanoi

List Examples

5

10/1

Quiz (Lessons 1-4)

Linked Lists

Midterm I Review

Ch 5

Midterm 1 Review

Quiz 2

 

6

10/9

TUE

Midterm I (Lesson 1-5)

Stacks

Ch  7

HW 5

Midterm 1

Array Stack 

7

10/15

Midterm I Post Mortem

Stacks

Queues

Ch 7, 8

HW 6

Project 2 Due

Stacks

Queues

8

10/22

Inheritance

Dynamic binding

Sorted List

Generics

Iterators

Ch 9

HW 7

Inheritance 

Iterable

List Examples

9

10/29

Quiz (Lessons 6-8)

Sorting

  • Bubble
  • Selection
  • Insertion

Midterm II Review

Ch 10
HW 8
Midterm 2 Review

Quiz 3

 Sorting

10

11/5

Midterm II (Lessons 6-9)

Executable jar files

Ch 10

Executable Jar
Tutorial

11

11/12

Midterm 2

Sorting

  • Merge Sort
  • Quick Sort
  • Radix Sort

HW 9

Midterm 2

Ch 10

Project 3 Due

 Sorting

12

11/19

Hash Tables

HW 10

Ch 13.2

 

13

11/26

Quiz

Tools (Debuggers, Profilers, Version Control)

Quiz 4 (last semester)

 

14

12/3

Final Exam Review

 Final Review

 

 

12/7

 

Project 4 Due

 

 

12/10

READING DAY

 

 

15

12/17

***FINAL EXAM***

Time: 7:30 – 10:15 pm

S&TI 122