Revision as of 16:07, 23 February 2010

This page contains notes and discussions related to the SCS Curriculum Reinvention Committee.

The content below has gratuitous markup so as to make it obvious how to add more stuff.

To edit this page, you first need to create an account - click the link in the top-right of the page. Then click on the edit tab just about the page headline. Or, you can edit individual sections.

COMP 1405/1406 Redesign

Topic Brainstorming

Add topics here at the end of the section. Please don't remove anything!

WHAT IS COMPUTER SCIENCE
- problem solving
- algorithms
- abstraction and problem decomposition
- efficiency ??
PSEUDO-CODE ??
SEQUENCING INSTRUCTIONS
- top down coding in sequence (e.g., draw a house)
VARIABLES
- declaring vs. assigning
- memory usage ??
- constants
- examples:
  - compute simple math formulas
  - interactive input (e.g., use mouse position)
  - motion (if doing graphics)
CONDITIONALS
- simple IF/ELSE
- nested IF
- booleans(AND/OR)
- examples:
  - make choices based on runtime input
  - basic state machine
  - edge cases / error checking
ITERATION
- repeating X times (REPEAT)
- counting (FOR)
- repeating until condition (WHILE)
- nested loops
- examples
  - sum/avg/max/min
  - counting matches
  - MonteCarlo approximation
  - loop until user input
  - searching (find first match)
ARRAYS (1D and 2D)
- initializing and memory usage
- simple 1D (sum.avg/max/min)
- linear/binary search
- insert/remove
- copy/growing array
- sorting
OBJECTS
- instance variables
- initialization (constructors)
- shared references
- static vs. instance
FUNCTIONS and PROCEDURES
- simple computations and return values
- passing parameters
- passing arrays as parameters
- helper methods
RECURSION (likely 1406 material?)
- direct vs. indirect
- tail recursion
- examples:
  - math problems (factorial/sum/avg)
  - searching mazes
  - iterate a non recursive data structure (array)
  - iterate a recursive data structure (e.g., tree)
PERSISTENCE
- writing files
- reading files
- parsing files

my first wiki entry ever! - djh

Should we copy the MIT 6.00 outline here?

Sub categories?

Yes, we can add sub categories here.

Weekly Outline

We'll put the weekly outline here

@@ Line 11: / Line 11: @@
 Add topics here at the end of the section.  Please ''don't'' '''remove''' anything!
-* problem solving, algorithms, what is computer science
+* WHAT IS COMPUTER SCIENCE
-* pseudo-code ??
+** problem solving
-* sequence of simple instructions
+** algorithms
+** abstraction and problem decomposition
+** efficiency ??
+* PSEUDO-CODE ??
+* SEQUENCING INSTRUCTIONS
 ** top down coding in sequence (e.g., draw a house)
-* variables
+* VARIABLES
 ** declaring vs. assigning
 ** memory usage ??
@@ Line 43: / Line 47: @@
 *** searching (find first match)
 * ARRAYS (1D and 2D)
-* recursion
+** initializing and memory usage
-**likely 1406 material?
+** simple 1D (sum.avg/max/min)
+** linear/binary search
+** insert/remove
+** copy/growing array
+** sorting
+* OBJECTS
+** instance variables
+** initialization (constructors)
+** shared references
+** static vs. instance
+* FUNCTIONS and PROCEDURES
+** simple computations and return values
+** passing parameters
+** passing arrays as parameters
+** helper methods
+* RECURSION (likely 1406 material?)
+** direct vs. indirect
+** tail recursion
+** examples:
+*** math problems (factorial/sum/avg)
+*** searching mazes
+*** iterate a non recursive data structure (array)
+*** iterate a recursive data structure (e.g., tree)
+* PERSISTENCE
+** writing files
+** reading files
+** parsing files
 * my first wiki entry ever!  - djh