From charlesreid1

Revision as of 04:04, 9 September 2016 by Admin (talk | contribs) (→‎Lecture notes)

Syllabus

Steps to completion:

  • Fill in basic class information (sched/dates/times)
  • Fill in book information
  • Academic integrity
  • Devices
  • Course content (chapter by chapter breakdown)
  • Course grade
  • Homework
  • Quizzes
  • Exams
  • Prereqs

Syllabus lecture:

  • Syllabus lecture slides skeleton
  • Syllabus lecture slides fill in

PDF

  • Create pdf for syllabus lecture notes

Calendar

Create calendar:

  • Topics calendar
  • HW calendar
  • Quiz calendar
  • Exam calendar
  • Final project calendar

Content Outline

Chapter by chapter outline

Section by section outline

Lecture notes

Notes on format:

  • Keynote slides - 1 slide deck per chapter - pdf format - provided to students
  • Partial examples/syntax - in Keynote
  • Complete examples - develop in Github repo
  • Slides contain various break-points for code examples, worksheets

Checklist: Chapter N slide deck:

  • Skeleton: Section-by-section with key topics in each section
  • Skeleton: Reference to each lecture/worksheet example on Github
  • Skeleton: Stub of code on Github
  • Github code finished
  • References to Github on slide finished
  • Remaining sections filled in with whatevers (small examples from book)

Lecture 0

  • Skeleton
  • Slides filled in

Lecture 1: Review of object oriented programming

  • Skeleton
  • Lecture code in slides and on Github
  • Slides filled in

Lecture 2: Inheritance and Interfaces

  • Skeleton
  • Lecture code in slides and on Github
  • Slides filled in

Lecture 3: ArrayList

  • Skeleton
  • Lecture code in slides and on Github
  • Slides filled in

Lecture 4: Java Collections Framework

  • Skeleton
  • Lecture code in slides and on Github
  • Slides filled in

Lecture 5: Recursion

  • Skeleton
  • Lecture code in slides and on Github
  • Slides filled in

Lecture 6: Searching and Sorting

  • Skeleton
  • Lecture code in slides and on Github
  • Slides filled in

Lecture 7: Stacks and Queues

  • Skeleton
  • Lecture code in slides and on Github
  • Slides filled in

Lecture 8: Implementing a Collection Class

  • Skeleton
  • Lecture code in slides and on Github
  • Slides filled in

Lecture 9: Linked Lists

  • Skeleton
  • Lecture code in slides and on Github
  • Slides filled in

Homework

Notes on procedure:

  • Review questions at end of chapter, and review questions at end of chapter in other Java books
  • Based on questions, build a rubric of what kinds of questions test what kind of skills
  • Write some of your own questions
  • Divide the questions based on the kinds of skills they teach (simpler, more complex)
  • Create two question pools: quiz question pool, exam question pool

Question types

  • Homeworks are rote written questions taking the same form always
  • Exams and quizzes can be matching, more interesting

Inheritance and Interfaces

  • Homework?

ArrayList

  • Homework?

Java Collections Framework

  • Homework?

Recursion

  • Homework?

Searching and Sorting

  • Homework?

Stacks and Queues

  • Homework?

Implementing a Collection Class

  • Homework?

Linked Lists

  • Homework?

Quizzes

Procedure:

  • Review problems in quiz question pool
  • Quizzes have easier problems, more syntax, less abstraction, more mechanical, less wordy
  • Create quizzes

Quiz 1

Quiz 2

Quiz 3

Quiz 4

Exams

Procedure:

  • Review problems in exam question pool
  • Exams have more abstract, more complex, more involved problems, less rote, more critical thinking
  • Create exams

Exam A

  • Create exam pool of questions
  • Exam A draft 1
  • Exam A draft 2

Exam B

  • Create exam pool of questions
  • Exam B draft 1
  • Exam B draft 2

Flags