CSC 142/Chapter 5 - Revision history

Admin: /* Chapter 5 Puzzle */

2016-09-15T19:21:49Z

Chapter 5 Puzzle

← Older revision		Revision as of 19:21, 15 September 2016
Line 406:		Line 406:
	==Chapter 5 Goodies==		==Chapter 5 Goodies==

	===~~Chapter~~ 5 ~~Puzzle~~===		===Puzzle 5===

	~~Will require some searching.~~		Blocks of 8 integers, numbers -> letters -> ROT 13 encoded message, filled with DDDs again

	~~Block cryptograms~~		[[Puzzles/Crypto Level 1/Puzzle 5]]

	~~INSTRUCTIONS: These sentences are first sentences of famous books. Find the titles of the books, and write them on the exam.~~

	~~Oliver Twist~~

	~~Call Me Ishmael~~

	~~Cold bright morning striking thirteen~~

	===Quotes===		===Quotes===

2016-09-14T19:19:04Z

Homework Code

← Older revision		Revision as of 19:19, 14 September 2016
Line 374:		Line 374:
	* Why prime numbers are important		* Why prime numbers are important
	* Why GCD is important - how it relates to prime numbers		* Why GCD is important - how it relates to prime numbers

	~~===Homework Code===~~

	~~(Homework problems?)~~

	==Chapter 5 Homework==		==Chapter 5 Homework==

2016-09-14T01:02:28Z

HW Details

← Older revision		Revision as of 01:02, 14 September 2016
Line 404:		Line 404:
	* 11 - random coin flips until 3 heads in a row		* 11 - random coin flips until 3 heads in a row
	* 18 - sum of digits (bonus: sum of squares, repeatedly applied, is either 89 or 1)		* 18 - sum of digits (bonus: sum of squares, repeatedly applied, is either 89 or 1)

			Projects:
			* 5 - rock paper scissors, 3 items, games can tie

	==Chapter 5 Goodies==		==Chapter 5 Goodies==

2016-09-14T00:56:27Z

Chapter 5 Goodies

← Older revision		Revision as of 00:56, 14 September 2016
Line 378:		Line 378:

	(Homework problems?)		(Homework problems?)

			==Chapter 5 Homework==

			===HW Questions===

			(Recommended) Self-check problems: #1, #5, #12, #14, #21, #27, #28

			(Required) Exercises: #1, #4, #11, #18

			(Required) Projects: #5

			===HW Details===

			Self-check:
			* 1 - how many times will the while loop run
			* 5 - Random code
			* 12 - fencepost algorithm
			* 14 - boolean expressions
			* 21 - zune music lpayer, while loops
			* 27, 28 - assertions and program logic

			Exercises:
			* 1 - show factors of 2
			* 4 - random number of x's
			* 11 - random coin flips until 3 heads in a row
			* 18 - sum of digits (bonus: sum of squares, repeatedly applied, is either 89 or 1)

	==Chapter 5 Goodies==		==Chapter 5 Goodies==

2016-09-04T20:32:12Z

Quotes

← Older revision		Revision as of 20:32, 4 September 2016
Line 408:		Line 408:


	Elephant in Cairo (sentinel values):		Elephant in Cairo (sentinel values) [https://en.wikipedia.org/wiki/Elephant_in_Cairo]

	{{Scrollbox\|		{{Scrollbox\|

2016-09-04T20:31:30Z

Quotes

← Older revision		Revision as of 20:31, 4 September 2016
Line 422:		Line 422:
	Computer scientists hunt elephants using algorithm A:		Computer scientists hunt elephants using algorithm A:

			<pre>
	1. Go to Africa		1. Go to Africa
	2. Start at the Cape of Good Hope		2. Start at the Cape of Good Hope
Line 429:		Line 430:
	b. Compare each animal caught to a known elephant		b. Compare each animal caught to a known elephant
	c. Stop when a match is detected.		c. Stop when a match is detected.
			</pre>

	Experienced computer programmers modify Algorithm A by		Experienced computer programmers modify Algorithm A by
	placing a known elephant in Cairo to ensure that the		placing a known elephant in Cairo to ensure that the
	algorithm will terminate.		algorithm will terminate:

			<pre>
			1. Go to Africa.
			2. Put an elephant in Cairo.
			3. Start at the Cape of Good Hope.
			4. Work northward in an orderly manner, traversing the continent alternately east and west,
			5. During each traverse pass:
			a. Catch each animal seen.
			b. Compare each animal caught to a known elephant.
			c. Stop when a match is detected.
			6. If you are in Cairo, then there are no elephants in Africa (other than the one you placed there).
			</pre>

	Engineers hunt elephants by going to Africa, catching gray		Engineers hunt elephants by going to Africa, catching gray

2016-09-04T20:29:16Z

Quotes

@@ Line 405: / Line 405: @@
 - @bramcohen 3/26/2011
 =Flags=
 {{CSC142Flag}}

2016-09-02T01:03:48Z

Chapter 5 Code

← Older revision		Revision as of 01:03, 2 September 2016
Line 358:		Line 358:
	===Lecture Code===		===Lecture Code===

	While loops ~~and fencepost~~ algorithm		Topics?
	* ~~Walk through constructing a fencepost algorithm program~~		* While loops
	* ~~Sentinel~~ program		* Fencepost/sentinel algorithm
			* Assertions
			* Complex program logic

	~~Assertions and program logic~~:		isPrime function:
	* ~~Use an example requiring~~ more complex logic		* Checking for prime numbers
	* Use a debugger to explore the program during lecture		* Walk through construction process for dealing with more complex logic

	===Worksheet Code===		===Worksheet Code===

	~~Checking~~ for ~~prime numbers: isPrime~~		Euler's algorithm for GCD:

	~~Sieve of Arasnosthenes~~:
	* Background		* Background
	* Why ~~are~~ prime numbers important?		* Why prime numbers are important
	* ~~Describe the concept behind the algorithm.~~		* Why GCD is important - how it relates to prime numbers
	* Finding prime numbers ~~and factoring numbers - one of the most important uses of computers today - cryptography~~


	===Homework Code===		===Homework Code===

2016-09-01T18:49:19Z

Chapter 5 Puzzle

← Older revision		Revision as of 18:49, 1 September 2016
Line 385:		Line 385:
	===Chapter 5 Puzzle===		===Chapter 5 Puzzle===

	~~Modular arithmetic~~		Will require some searching.

			Block cryptograms

			INSTRUCTIONS: These sentences are first sentences of famous books. Find the titles of the books, and write them on the exam.

			Oliver Twist

			Call Me Ishmael

			Cold bright morning striking thirteen

	===Quotes===		===Quotes===

2016-09-01T10:14:04Z

Chapter 5 Goodies