1104CIT Programming II

1

• 1104CIT Programming II
• http//www.cit.gu.edu.au/teaching/1104CIT/
• Convenor (Prof.) Rodney Topor, R.Topor_at_griffith.ed
  u.au, TEN 2.20, 3875 5047
• Lecturers Prof. Topor (Nathan), Col Clark
  (Logan), C.Clark_at_griffith.edu.au
• Tutors To be announced.
• Lectures Mondays and Fridays _at_ noon in NT1.
• Laboratory classes See Virgil (throughout week,
  one only, register, start in week 2)
• Drop-in clinics See Virgil (two per week, attend
  either)
• One line summary More problem solving,
  programming and programming in Java
• Text None, but K.A. Lambert M. Osborne, Java A
  Framework for Programming and Problem Solving,
  Second Edition, Brooks/Cole, 2002 may be useful.
• Assessment Individual projects 40, mid-semester
  examination 20, final examination 40

2

• Syllabus
• Programming processes Specification, design
  (classes, methods), implementation, testing,
  documentation, revision.
• Problem solving! Analogy, simplification, divide
  and conquer, search, ...
• Procedural programming Primitive data types,
  expressions, statements, control structures,
  arrays, methods, ...
• Object-oriented programming Classes and objects,
  Java packages and classes, user-defined packages
  and classes, inheritance, polymorphism,
  interfaces, reusability, model/view pattern.
• Java API Selected packages and classes, wrapper
  classes, class Math, input/output classes,
  utility classes, collection classes, GUI classes,
  ...
• Programming with collections and mappings Sets,
  lists, and maps interfaces and implementations.
• AWT and Swing GUIs, event-oriented programming,
  graphics.
• Searching and sorting Linear and binary search,
  insertion sort and quicksort
• Basic recursive programming.
• Basic data structures and algorithms Arrays,
  linked data structures, hash tables, trees.
• Emphasis on simple, generalisable patterns.

3

• Syllabus (cont.)
• Lambert Osborne, second edition
• Much assumed
• Most of rest to be covered
• But in our own way
• (More detail to be provided later.)
• Plus
• Replacement of TerminalIO by Java API
• Replacement of BreezySwing by Java AWT and Swing
• Documentation and programming standards
• Better examples
• Explicit reusable patterns

4

• Assessment
• Similar to but not the same as 1103CIT
  Programming I
• Four individual projects, due tentatively in
  weeks 3, 6, 9, 12.
• Submissions to satisfy specified standards
  layout, designs, documentation, coding, testing,
  ...
• Late penalties
• Submissions over 5 days late will not be accepted
  (without a very good reason)
• (Partial) solutions to be published, and
  discussed in lectures
• Mid-semester examination after week 8.
• Final examination
• Both examinations to be based on programming and
  other questions in projects.
• To obtain a grade of Pass or above, a student
  must achieve over 45 of the total project marks,
  45 of the total exam marks and 50 of the total
  marks for this course.
• Success key Work hard from the beginning, don't
  get behind, seek help early if problems arise. A
  minimum of ten hours per week (including classes)
  is required.

5

• Resources
• Lectures (and lecture notes)
• Lecturer, tutors, demonstrators, fellow students
• Prescribed text
• Other texts
• Online documents
•  The Java Tutorial (Sun)
•  The Java API Documentation (Sun)
•  Other online texts
•  Unix help
•  Many sample programs and applets
• Course Web page
•  Lecture notes, project specifications,
  resources, ...
•  Answers to frequently asked questions (FAQs)
•  Discussion forum
• http//www.cit.gu.edu.au/teaching/1104CIT/