July 2016/Teaching Preparation - Revision history

Admin: /* Course Load */

2016-07-27T04:30:01Z

Course Load

← Older revision		Revision as of 04:30, 27 July 2016
Line 8:		Line 8:
	* CSC 143 (5) - Computer Programming II - online		* CSC 143 (5) - Computer Programming II - online

			[[CSC 142 Course Notes]]

			[[CSC 143 Course Notes]]

	=UW Computer Science Course Summary=		=UW Computer Science Course Summary=

2016-07-27T04:17:17Z

← Older revision		Revision as of 04:17, 27 July 2016
Line 1:		Line 1:
			=Course Load=

	Staff classes:		Staff classes:
	* ENGR 116 (5) - Engineering Design and Creativity - vectors and calculus to statics and dynamics, T Th 1-3:20 pm		* ENGR 116 (5) - Engineering Design and Creativity - vectors and calculus to statics and dynamics, T Th 1-3:20 pm
Line 6:		Line 8:
	* CSC 143 (5) - Computer Programming II - online		* CSC 143 (5) - Computer Programming II - online

	=Computer Science=

			=UW Computer Science Course Summary=

	==Syllabus==		==Syllabus==

2016-07-26T11:03:33Z

Engineering Design

← Older revision		Revision as of 11:03, 26 July 2016
Line 6:		Line 6:
	* CSC 143 (5) - Computer Programming II - online		* CSC 143 (5) - Computer Programming II - online

	=~~Engineering Design~~=		=Computer Science=

	==Syllabus==		==Syllabus==

2016-07-26T06:53:47Z

Engineering Design

← Older revision		Revision as of 06:53, 26 July 2016
Line 134:		Line 134:
	Assignment 8 Bonus		Assignment 8 Bonus
	* http://courses.cs.washington.edu/courses/cse143/16sp/homework/8/bonus.pdf		* http://courses.cs.washington.edu/courses/cse143/16sp/homework/8/bonus.pdf

			=Flags=

			[[Category:July 2016]]

2016-07-26T06:49:20Z

← Older revision		Revision as of 06:49, 26 July 2016
Line 6:		Line 6:
	* CSC 143 (5) - Computer Programming II - online		* CSC 143 (5) - Computer Programming II - online

	==Engineering Design==		=Engineering Design=

	~~==CSE 142==~~		==Syllabus==

	~~Link: https://courses.cs.washington.edu/courses/cse142/16sp/index.shtml~~

	===Syllabus===

	Textbook: Building Java Programs, 4th edition, Reges & Stepp, required.		Textbook: Building Java Programs, 4th edition, Reges & Stepp, required.
Line 34:		Line 30:

	The exams will be closed-book and closed-note.		The exams will be closed-book and closed-note.



			==CSE 142==

			Link: https://courses.cs.washington.edu/courses/cse142/16sp/index.shtml

	===Assignments===		===Assignments===
Line 52:		Line 54:

	Assignment 8: Simulation of critters, defining class within framework, object oriented programming https://courses.cs.washington.edu/courses/cse142/16sp/handouts/16.html		Assignment 8: Simulation of critters, defining class within framework, object oriented programming https://courses.cs.washington.edu/courses/cse142/16sp/handouts/16.html



	==CSE 143==		==CSE 143==

2016-07-26T05:07:57Z

Assignments

@@ Line 115: / Line 115: @@
 * Recursive backtracking
 * Use a dictionary to find all anagrams that can be formed from a particular string
 * ...

2016-07-26T04:01:07Z

Assignments

← Older revision		Revision as of 04:01, 26 July 2016
Line 114:		Line 114:
	* http://courses.cs.washington.edu/courses/cse143/16sp/homework/6/spec.pdf		* http://courses.cs.washington.edu/courses/cse143/16sp/homework/6/spec.pdf
	* Recursive backtracking		* Recursive backtracking
			* Use a dictionary to find all anagrams that can be formed from a particular string
			* ...

2016-07-26T03:55:47Z

Assignments

← Older revision		Revision as of 03:55, 26 July 2016
Line 104:		Line 104:
	* Record method is hardest, write last.		* Record method is hardest, write last.
	* Evil because computer is not really picking a word until last minute		* Evil because computer is not really picking a word until last minute

			Assignment 5 Bonus
			* http://courses.cs.washington.edu/courses/cse143/16sp/homework/5/spec2.pdf
			* how to improve the HangmanManger class and how to use inheritance to create variation
			* wins when down to one guess
			* modify methods to protect data

			Assignment 6: Anagrams
			* http://courses.cs.washington.edu/courses/cse143/16sp/homework/6/spec.pdf
			* Recursive backtracking

2016-07-26T03:50:49Z

Assignments

← Older revision		Revision as of 03:50, 26 July 2016
Line 81:		Line 81:
	* Circular chain of targets: kill ring, circular, bottom links back to top		* Circular chain of targets: kill ring, circular, bottom links back to top
	* When you eliminate a person from the kill ring, you take on their target (move up the chain)		* When you eliminate a person from the kill ring, you take on their target (move up the chain)
			* Null reference at end of linked list
			* Utilizing linked list and nodes appropriately
			* Properly documented, return conditions, exceptions, reference solution is 130 lines (70 of those are comments)

			Assignment 4: Grammar Solver
			* http://courses.cs.washington.edu/courses/cse143/16sp/homework/4/spec.pdf
			* Symbols in grammar, grammar describes syntax and symbols of language
			* Backus-Naur Form (BNF) = language grammar representation
			* Required to implement GrammarSolver class with contains(), getSymbols(), and generate() methods
			* Generate method is hardest, store contents of Grammar in map, use string split method

			Assignment 5: Evil hangman
			* http://courses.cs.washington.edu/courses/cse143/16sp/homework/5/spec.pdf
			* Java Collections classes
			* User has N guesses to get the answer, computer keeps track of possible solutions, number of guesses, guessed information
			* HangmanManager
			* Set words()
			* int guessesLeft()
			* charSet guesses()
			* String pattern()
			* int record()
			* Record method is hardest, write last.
			* Evil because computer is not really picking a word until last minute

2016-07-26T03:40:38Z

CSE 143

← Older revision		Revision as of 03:40, 26 July 2016
Line 56:		Line 56:

	Link: http://courses.cs.washington.edu/courses/cse143/16sp/		Link: http://courses.cs.washington.edu/courses/cse143/16sp/

			===Assignments===

			Assignment 1: Letter Inventory
			* http://courses.cs.washington.edu/courses/cse143/16sp/homework/1/spec.pdf
			* arrays and classes
			* alphabet/letters histogram
			* iterative refinement
			* students provided with iterative, step-wise development strategy
			* encapsulation and scope, private, avoiding redundancy, loops, indentation, variable names

			Assignment 2: HTML Validator
			* http://courses.cs.washington.edu/courses/cse143/16sp/homework/2/spec.pdf
			* Stack and Queue collections
			* HTML tags: self-closing tags, properly-ordered nesting of tags
			* Instructor-provided code reads HTML pages from files and breaks them apart into tags for you
			* You see whether tags match correctly, using API: element()=>"p", isOpenTag=>T/F, isSelfClosing=>T/F
			* Getting used to using other people's code
			* Thinking about corner cases

			Assignment 3: Assassin
			* http://courses.cs.washington.edu/courses/cse143/16sp/homework/3/spec.pdf
			* Game played on college campuses: one person targets another, each person has one person they're targeting, don't know who's targeting them
			* Circular chain of targets: kill ring, circular, bottom links back to top
			* When you eliminate a person from the kill ring, you take on their target (move up the chain)