CSci 160

(Amalgam of different sections Fall 2000 - Spring 2003, to serve as material collection)
Announcements: Extra Credit!
Project 2
Links:
Textbook: http://www.horstmann.com/
Java Development Kit: http://www.javasoft.com/
Textpad Editor: http://www.textpad.com/
JBuilder: http://www.borland.com/jbuilder/
Applet Demos: http://www.javasoft.com/applets/jdk/1.1/
(If you want to have a look at some of my own Applets check out:
http://www3.ns.sympatico.ca/adenton/
Sorry, the webpage can no longer be updated and might disappear any time. 
I will include replace the link as soon as I have created a new page.)
Class Material:

Syllabus (Fall 2000):

Instructor: Anne M. Denton
E-mail: anne.denton@ndsu.nodak.edu
Course Web Page: http://www.cs.ndsu.nodak.edu/~adenton/CSci160/syllabus.html
Phone: 231-9463 (office)
271-8939 (home)
Office Hours: Office: IACC 258 B2
Mon., Wed., Fri.  9 - 10 or by appointment
Grader: MD. Benzir Ahmed
Lectures: Mon., Wed., Fri. 8 - 8:50
IACC 106
Labs: Tues., Thurs. 8 - 8:50
IACC 128 / IACC 132  (exceptions posted between doors).
  • Lab assignments are generally due Thursdays before the lab (see calendar for due dates).
  • Use lab time to ask me or the grader questions.
  • Discussing problems regarding labs with fellow students is encouraged. 
  • Copying in any form is not accepted. 
Textbook:
(required)		 Horstmann, Cay: Computing Concepts with Java 2 Essentials,
2nd Edition (Wiley, 1999)
Material to be covered in class or in the lab should be read in advance!
Other Materials: Floppy disks (for turning in projects and archiving labs)
Objectives:

On successful completion of the course a student will be familiar with

  • basic computing and problem solving concepts
  • basic data structures 
  • implementation of classes and methods
  • sequence control mechanisms
  • testing and debugging techniques 
  • implementation of all of the above in Java 
  • using a consistent style and providing sufficient documentation

The student will also have become acquainted with

  • recursion
  • elementarty sorting and searching algorithms
  • some of the social and historical context of computing

 
Grading Scheme: Cutoffs for A, B, C, D will not be higher than 90%, 80%, 70%, and 60% respectively.

Points each Points
3 one-hour tests 100  300
3 programming projects 40 120
13 lab assignments 10  130
Final exam 150 150


700

Grades on programming projects and lab work have a component based on style, documentation and design. Follow the examples in the textbook and adhere to the standards in Appendix 1 (Java Language Coding Guidelines).
Note: A program that "works" but does not meet the other criteria may not even earn a passing grade.
Late work: Late work will be docked 10% per school day.
One-hour exams:

Chapters Date
Test 1 1 - 5 Oct 4
Test 2 6 - 10 Nov 8
Test 3 10, 11, 13, 15 Dec 11
Programming projects:

Programming exercise
in Horstmann		 Due date:
Project 1 6.4 Oct 18
Project 2 10.12 Nov 15
Project 3 13.8 (see extra web page) Dec 13
  • Programming projects are to be handed in to me before the lecture on the due date.
  • Use flopply disks to hand in the programs.
  • Programming projects are not intended as group work.
  • See "Grading Scheme" and "Policies" for further information.
Policies:
  • All work in this course must be completed in a manner consistent with NDSU University Senate Policy, Sction 335: Code of Academic Responsibility and Conduct (http://www.ndsu.nodak.edu/policy/335.htm)
  • A major emphasis of this course is problem solving using a computer and the Java programming language. Use the tools and techniques introduced (even if you may be able to find a shorter, simpler solution without them). The goal is to become familiar with those tools and techniques.
  • Any students who need special accommodations for learning or who have special needs are invited to share these concerns or requests with the instructor as soon as possible.