CSC 142/Chapter 4 - Revision history

Admin: /* Lecture Code */

2016-10-03T05:52:20Z

Lecture Code

← Older revision		Revision as of 05:52, 3 October 2016
Line 426:		Line 426:

	Hailstone sequence		Hailstone sequence
	* odd/even ~~Integer~~ sequence		* odd/even integer sequence
	* map for loop (1 to N) onto hailstone sequence using formula		* map for loop (1 to N) onto hailstone sequence using formula
	* if/else to check for odd/even		* if/else to check for odd/even
	* uses printf
	* uses static methods		* uses static methods

			Coin paradox
			* sequences and subsequences

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

2016-10-03T05:30:50Z

Worksheet Code

← Older revision		Revision as of 05:30, 3 October 2016
Line 442:		Line 442:
	* We are going to calculate letter frequencies in the ciphertext, and keep track of which letter is most frequent		* We are going to calculate letter frequencies in the ciphertext, and keep track of which letter is most frequent
	* Use this to suggest/pick a "most likely" substitution and see if it works		* Use this to suggest/pick a "most likely" substitution and see if it works
			* Looping through string once for each letter.

	==Chapter 4 Homework==		==Chapter 4 Homework==

2016-10-03T05:29:53Z

Puzzle 4

← Older revision		Revision as of 05:29, 3 October 2016
Line 475:		Line 475:
	===Puzzle 4===		===Puzzle 4===

	[[Puzzles/~~Crypto Level 1~~/Puzzle 4]]		[[Puzzles/Fall 2016/Puzzle 4]]: (Affine cipher, modular arithmetic, gcd, Euclid's algorithm)

	~~Blocks of 8 integers~~, ~~numbers -> letters -> message directly~~, ~~filled in with DDDs~~

	===Laws and Razors===		===Laws and Razors===

2016-09-15T19:21:09Z

Puzzle 4

← Older revision		Revision as of 19:21, 15 September 2016
Line 475:		Line 475:
	===Puzzle 4===		===Puzzle 4===

	~~Block cryptogram:~~		[[Puzzles/Crypto Level 1/Puzzle 4]]

	~~<pre~~>		Blocks of 8 integers, numbers -> letters -> message directly, filled in with DDDs
	~~MVBY ZJVY LHUK ZLCL UFLH YZHN VVBY MVYL MHAO LYZZ LAMV~~
	~~YAOV UAOP ZSHU KHUL DUHA PVUJ VUJL PCLK PUSP ILYA FHUK~~
	~~KLKP JHAL KAVA OLWY VWVZ PAPV UAOH AHSS TLUH YLJY LHAL~~
	~~KLXB HS~~
	~~</pre~~>

	~~To help them out~~, ~~start it~~ with ~~the word "THE".~~

	~~Challenge cryptogram: (+8)~~

	~~<pre>~~
	Iuwvo(w\|pmz(x}jtqk(j}qtlqvo{(qv(i(kmz\|iqv(\|wv4(pqkp(nwz(uiv(zmi{wv{(q\|(qtt(jm(xz}lmv\|(\|w(zmnziqv(nzwu(umv\|qwvqvo4(ivl(\|w(pqkp(Q(qtt(i{{qov(vw(nqk\|q\|qw}{(vium4(\|pmzm(q{(wvm(ivkqmv\|t(kwuuwv(\|w(uw{\|(\|wv{4(ozmi\|(wz({uittB(\|w(q\|4(i(wzspw}{mC(ivl(qv(\|pq{(wzspw}{m(i{(jwzvC(wv(i(li(ivl(li\|m(pqkp(Q(vmml(vw\|(\|zw}jtm(u{mtn(\|w(zmxmi\|4(qvi{u}kp(i{(q\|(kiv(jm(wn(vw(xw{{qjtm(kwv{my}mvkm(\|w(\|pm(zmilmz4(qv(\|pq{({\|iom(wn(\|pm(j}{qvm{{(i\|(itt(m~mv\|{C(\|pm(q\|mu(wn(uwz\|itq\|(pw{m(vium(q{(xzmnqml(\|w(\|pm(pmil(wn(\|pq{(kpix\|mz6
	~~</pre>~~

	===Laws and Razors===		===Laws and Razors===

2016-09-14T19:20:41Z

Homework Code

← Older revision		Revision as of 19:20, 14 September 2016
Line 442:		Line 442:
	* We are going to calculate letter frequencies in the ciphertext, and keep track of which letter is most frequent		* We are going to calculate letter frequencies in the ciphertext, and keep track of which letter is most frequent
	* Use this to suggest/pick a "most likely" substitution and see if it works		* Use this to suggest/pick a "most likely" substitution and see if it works

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

	~~(Homework problems?)~~

	==Chapter 4 Homework==		==Chapter 4 Homework==

2016-09-13T21:10:39Z

Chapter 4 Code

← Older revision		Revision as of 21:10, 13 September 2016
Line 446:		Line 446:

	(Homework problems?)		(Homework problems?)

			==Chapter 4 Homework==

			===HW Summary===

			(Recommended) Self-check problems: #1, #5, #6, #12, #19, #21, #28

			(Required) Exercises: #1, #5, #9,

			(Required) Projects: #6 (poss. modification to CC numbers)

			===HW Details===

			Self-check:
			* 1 - translating english into boolean expressions
			* 5, 6 - if/else mystery
			* 12 - improving poorly structured code to avoid redundancy
			* 19 - comparing floats
			* 21 - check if string starts with capital
			* 28 - add exceptions to quadratic equation code

			Exercises:
			* 1 - fractionSum() method
			* 5 - custom pow() method
			* 9 - prompt for integers, sum even no.s, largest even no. typed

			Projects:
			* 6 - check digit (7th digit is checksum of first 6)

	==Chapter 4 Goodies==		==Chapter 4 Goodies==

2016-09-13T08:44:44Z

Material

← Older revision		Revision as of 08:44, 13 September 2016
Line 20:		Line 20:

	===Material===		===Material===

			Topics:
			* Logic statements for if/else
			* Operators and operator precedence
			* Equality stuff - objects and == and equals()
			* Refactoring methods with logic
			* and/or operators


	Conditional logic		Conditional logic
Line 109:		Line 117:
	* AND operator (if a number is between A and B, that can be expressed as the combination of 2 conditions: number > A, number < B)		* AND operator (if a number is between A and B, that can be expressed as the combination of 2 conditions: number > A, number < B)
	* OR operator (A, or B, or both)		* OR operator (A, or B, or both)


	===Life Skills===		===Life Skills===

2016-09-10T22:00:02Z

Lecture Code

← Older revision		Revision as of 22:00, 10 September 2016
Line 418:		Line 418:
	===Lecture Code===		===Lecture Code===

	~~If/else:~~		Hailstone sequence
	* ~~Nested if~~/~~else examples, and following conditional logic flow~~		* odd/even Integer sequence
	* ~~Cumulative algorithms~~ (hailstone sequence~~), or computing a series of sine/cosine/etc~~		* map for loop (1 to N) onto hailstone sequence using formula
	* ~~Roundoff error and approximate equality~~		* if/else to check for odd/even
	* Run through sequence of steps, if to check for ~~conditional, if equal~~		* uses printf
	* ~~Also~~ uses printf		* uses static methods
	* ~~Also~~ uses static methods
	* Preconditions for sine and cosine functions? (Preconditions for factorial function)

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

2016-09-10T14:56:11Z

Worksheet Code

← Older revision		Revision as of 14:56, 10 September 2016
Line 430:		Line 430:

	Section 4.3: Using (and Cracking) the Caesar Cipher		Section 4.3: Using (and Cracking) the Caesar Cipher
	* ~~USING: We can automate using~~ the Caesar cipher		* Automate cracking the Caesar cipher
	* ~~Task~~: ~~print out all the letters of the alphabet~~		* Last time: learned how to manipulate chars using integers
	* ~~Hint~~: ~~for(char c = 'a'; ...~~		* This time: we want to automate cracking the Caesar cipher
	* Use this to apply a shift to the ~~letters of the alphabet (one trick required, dealing with >26 or <1)~~		* Strategies? Can look at letter frequencies
	* ~~CRACKING:~~ letter frequencies		* Table of letter frequenceis in English language
	* ~~Count~~ letter frequencies, ~~helps you~~ to pick ~~substitutions~~ and ~~possible routes~~		* We are going to calculate letter frequencies in the ciphertext, and keep track of which letter is most frequent
			* Use this to suggest/pick a "most likely" substitution and see if it works

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

2016-09-10T14:54:06Z

Handout: Caesar Cipher

← Older revision		Revision as of 14:54, 10 September 2016
Line 203:		Line 203:
	%-9s		%-9s
	</pre>		</pre>

	~~===Handout: Caesar Cipher===~~

	~~Cracking the Caesar cipher: letter frequencies, and also brute-forcing~~

	==Section 4.4: Conditional Execution with Methods==		==Section 4.4: Conditional Execution with Methods==