CSC 142/Chapter 7 - Revision history

Admin: /* Puzzle 7 */

2017-09-07T12:24:54Z

Puzzle 7

← Older revision		Revision as of 12:24, 7 September 2017
Line 677:		Line 677:
	===Puzzle 7===		===Puzzle 7===

	OTP - modular arithmetic, chunks of data, first line of novels as OTP keys.		OTP - modular arithmetic, chunks of data, first line of novels as OTP keys.

	~~[[Puzzles/Crypto Level 1/Puzzle 7]]~~

	=Flags=		=Flags=

	{{CSC142Flag}}		{{CSC142Flag}}

Admin: /* Worksheet Code */

2016-10-16T08:22:38Z

Worksheet Code

← Older revision		Revision as of 08:22, 16 October 2016
Line 644:		Line 644:

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

			Arrays worksheet: ???

			Challenge problem:

	Assume you have a method isSubstring which checks if one word is a substring of another.		Assume you have a method isSubstring which checks if one word is a substring of another.

Admin: /* Worksheet Code */

2016-09-30T01:17:55Z

Worksheet Code

← Older revision		Revision as of 01:17, 30 September 2016
Line 645:		Line 645:
	===Worksheet Code===		===Worksheet Code===

	~~Write an algorithm such that~~ if ~~an element in an M x N matrix~~ is 0, ~~its entire row~~ and ~~column are set~~ to 0.		Assume you have a method isSubstring which checks if one word is a substring of another.

			Given two strings, s1 and s2, write code to check if s2 is a rotation of s1 using only ONE call to isSubstring.

			Example: "waterbottle" is a rotation of "erbottlewat"

	==Chapter 7 Homework==		==Chapter 7 Homework==

Admin: /* Worksheet Code */

2016-09-30T01:16:48Z

Worksheet Code

← Older revision		Revision as of 01:16, 30 September 2016
Line 644:		Line 644:

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

			Write an algorithm such that if an element in an M x N matrix is 0, its entire row and column are set to 0.

	==Chapter 7 Homework==		==Chapter 7 Homework==

Admin: /* Puzzle 7 */

2016-09-15T19:22:46Z

Puzzle 7

← Older revision		Revision as of 19:22, 15 September 2016
Line 667:		Line 667:
	===Puzzle 7===		===Puzzle 7===

	~~Affine cipher? Modular~~ arithmetic?		OTP - modular arithmetic, chunks of data, first line of novels as OTP keys.

			[[Puzzles/Crypto Level 1/Puzzle 7]]

	=Flags=		=Flags=

	{{CSC142Flag}}		{{CSC142Flag}}

Admin at 02:08, 14 September 2016

2016-09-14T02:08:05Z

← Older revision		Revision as of 02:08, 14 September 2016
Line 25:		Line 25:
	==Section 7.1: Array Basics==		==Section 7.1: Array Basics==

	===Definitions===		===7.1 Definitions===

	Definitions:		Definitions:
Line 36:		Line 36:
	* Random access		* Random access

	===Material===		===7.1 Material===

	Constructing arrays:		Constructing arrays:
Line 179:		Line 179:
	==Section 7.2: Array Traversal Algorithms==		==Section 7.2: Array Traversal Algorithms==

	===Material===		===7.2 Material===

	Two standard array manipulation patterns:		Two standard array manipulation patterns:
Line 294:		Line 294:
	==Section 7.3: Reference Semantics==		==Section 7.3: Reference Semantics==

	===Definitions===		===7.3 Definitions===

	Definitions:		Definitions:
Line 300:		Line 300:
	* Reference types		* Reference types

	===Material===		===7.3 Material===

	Have covered concept of values vs. reference		Have covered concept of values vs. reference
Line 373:		Line 373:
	==Section 7.4: Advanced Array Techniques==		==Section 7.4: Advanced Array Techniques==

	===Material===		===7.4 Material===

	Beyond simple traversal algorithms		Beyond simple traversal algorithms
Line 474:		Line 474:

	==Section 7.5: Multidimensional Arrays==		==Section 7.5: Multidimensional Arrays==

			===7.5 Material===

	Prior section only looking at 1D arrays		Prior section only looking at 1D arrays

	2D arrays ~~usefl~~: rows/columns, spreadsheets ~~and~~ Java bridge		2D arrays useful: rows/columns, spreadsheets-Java bridge, matrices, multi-dimensional data

	<pre>		<pre>
Line 548:		Line 550:
	==Section 7.6: Benford's Law==		==Section 7.6: Benford's Law==

	===Material===		===7.6 Material===

	Background:		Background:

Admin: /* Homework Code */

2016-09-14T02:06:35Z

Homework Code

← Older revision		Revision as of 02:06, 14 September 2016
Line 642:		Line 642:

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

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

	~~(Exercises?)~~

	==Chapter 7 Homework==		==Chapter 7 Homework==

Admin: /* Chapter 7 Code */

2016-09-14T01:18:28Z

Chapter 7 Code

← Older revision		Revision as of 01:18, 14 September 2016
Line 628:		Line 628:
	Case study: Bedford's Law, examining entropy in 1st digit in a file of integers		Case study: Bedford's Law, examining entropy in 1st digit in a file of integers

	=Chapter 7 Code=		==Chapter 7 Code==

	==Lecture Code==		===Lecture Code===

	Rectangular arrays:		Rectangular arrays:
Line 641:		Line 641:
	* Use gcd as starting point, work your way down		* Use gcd as starting point, work your way down

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

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

	(Exercises?)		(Exercises?)

			==Chapter 7 Homework==

			===HW Questions===

			(Recommended) Self-check problems:

			(Required) Exercises:

			(Required) Projects:

			===HW Details===

			Self-check:

			Exercises:

			Projects:

	==Chapter 7 Goodies==		==Chapter 7 Goodies==

Admin: /* Chapter 7 Summary */

2016-09-14T01:17:31Z

Chapter 7 Summary

← Older revision		Revision as of 01:17, 14 September 2016
Line 581:		Line 581:
	Only tallying first digits of numbers		Only tallying first digits of numbers

	=Chapter 7 Summary=		==Chapter 7 Summary==

	==Deliverables==		===Deliverables===

	Array basics:		Array basics:
Line 590:		Line 590:
	* Accessing arrays and index algebra - how to reference middle element? second-to-last element?		* Accessing arrays and index algebra - how to reference middle element? second-to-last element?
	* Random access (arrays) vs sequential access (files)		* Random access (arrays) vs sequential access (files)
	* Arrays as method arguments, modification of memory ~~direcftly~~		* Arrays as method arguments, modification of memory drectly
	* References (with object concept) - bank analogy (~~debig~~ card versus actual numbers)		* References (with object concept) - bank analogy (debit card versus actual numbers)

	Traversal algorithms:		Traversal algorithms:

Admin: /* Lecture Code */

2016-09-13T09:15:18Z

Lecture Code

← Older revision		Revision as of 09:15, 13 September 2016
Line 631:		Line 631:

	==Lecture Code==		==Lecture Code==

			Rectangular arrays:
			* Find gcd of random integers, 1 < x <= 100
			* Generate 5 pairs of integers, using Random(1,100)
			* Find the gcd of the two numbers, store in third column

			Jagged arrays
			* Finding all common factors
			* Use gcd as starting point, work your way down

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