Visit - Revision history

Jkinne: /* Handouts */

2026-03-20T11:35:05Z

Handouts

← Older revision		Revision as of 11:35, 20 March 2026
Line 2:		Line 2:

	== Handouts ==		== Handouts ==
	* [https://cs.indstate.edu/files/Visit-Activities-CS-Unplugged.docx Visit Activities CS Unplugged] - from March 20, 2026 West Vigo visit.		* [https://cs.indstate.edu/files/Visit-Activities-CS-Unplugged.docx Visit Activities CS Unplugged] - from March 20, 2026 West Vigo visit.
			* [https://cs.indstate.edu/files/Paper-Airplane-Designs.pdf Paper Airplane Designs]
			* [https://cs.indstate.edu/files/Flextangles-Template-BABBLE-DABBLE-DO.pdf Flextangle template]
			* Bad AI output (from February 2026) - [https://cs.indstate.edu/files/geography-study-guide-AI-BAD.png Geography Quiz Bowl Study Guide (BAD AI output)], [https://cs.indstate.edu/files/map-with-flags-AI-BAD.png Map with Flags (BAD AI output)]

	== Explorations in AI LLMs ==		== Explorations in AI LLMs ==

Jkinne: /* Explorations in AI LLMs */

2026-03-19T23:52:04Z

Explorations in AI LLMs

← Older revision		Revision as of 23:52, 19 March 2026
Line 1:		Line 1:
	This page contains activities for when people (e.g., high school students) come to visit the university.		This page contains activities for when people (e.g., high school students) come to visit the university.

			== Handouts ==
			* [https://cs.indstate.edu/files/Visit-Activities-CS-Unplugged.docx Visit Activities CS Unplugged] - from March 20, 2026 West Vigo visit.

	== Explorations in AI LLMs ==		== Explorations in AI LLMs ==

Jkinne: /* Algorithms */

2026-03-17T02:03:08Z

Algorithms

← Older revision		Revision as of 02:03, 17 March 2026
Line 51:		Line 51:
	Here are some problems that we can look at to see what the best algorithm is.		Here are some problems that we can look at to see what the best algorithm is.
	* Number guessing game: I have a secret number that I have picked that is between 1 and 1,000. You can make guesses, and I will tell you whether you have it right or are too high or too low. Make an algorithm to decide on how you will pick the next number to ask. How many guesses will it take you to get the right answer? What if I have a secret number between 1 and 1,000,000?		* Number guessing game: I have a secret number that I have picked that is between 1 and 1,000. You can make guesses, and I will tell you whether you have it right or are too high or too low. Make an algorithm to decide on how you will pick the next number to ask. How many guesses will it take you to get the right answer? What if I have a secret number between 1 and 1,000,000?
	* Prime testing: I give you a random number between 1 and 200. You want to check if it is prime or not using trial division. What are the possible divisors that you will need to check? What if the random number is between 1 and 1,000,000? (In general, you need to test primes up to the ~~sqrt~~ of the number.) We can also look at the total number of divisions needed to compute all of the primes that are less than 100; method 1 tests each number individually, method 2 uses the ~~sieve~~ of ~~eratosthenes~~.		* Prime testing: I give you a random number between 1 and 200. You want to check if it is prime or not using trial division. What are the possible divisors that you will need to check? What if the random number is between 1 and 1,000,000? (In general, you need to test primes up to the square root of the number, but why?) We can also look at the total number of divisions needed to compute all of the primes that are less than 100; method 1 tests each number individually, method 2 uses the Sieve of Eratosthenes.
	* Searching a sorted list of numbers, what is the best way? Think of a reverse phone number search. Algorithms to try: linear search, binary search.		* Searching a sorted list of numbers, what is the best way? Think of a reverse phone number search. Algorithms to try: linear search, binary search.
	* Take an unsorted list of numbers, and put them into sorted order. Algorithms to try: selection sort, merge sort.		* Take an unsorted list of numbers, and put them into sorted order. Algorithms to try: selection sort, merge sort.

			== Math ==
			There is all kinds of math that gets used in computer science that is interesting and accessible to high school students, and some to middle school students.
			* Add up the numbers 1 + 2 + 3 + 4 + 5. You get ... 15. What if we want to add up the integers from 1 to 100? We don't want to do that by hand. There is a formula (the "arithmetic sum" formula") that we can use (100*101/2). But how do we know the formula works? We can prove it, and the story is that a very young Carl Friedrich Gauss came up with the formula when given this as busy work by a teacher.
			* How many of the integers between 1 and 10 are prime? Four of them, so 4/10 are prime. How many between 1 and 100? 25 of them, so 1/4 are prime. How many between 1 and 200? It is less than 1/4 of them. Prime numbers get more rare as the numbers get larger. Can we give some intuition for why? We can... But also, do the primes every get to be so rare that there aren't any more? We can give a pretty easy argument that in fact there are infinitely many prime numbers, so we will never run out.

	== Paper Folding ==		== Paper Folding ==

Jkinne: /* Paper Folding */

2026-03-17T01:53:42Z

Paper Folding

← Older revision		Revision as of 01:53, 17 March 2026
Line 56:		Line 56:

	== Paper Folding ==		== Paper Folding ==
			These are good for younger visitors. Depending on the age and time, more or less would need to be done ahead of time. Middle schoolers should be able to do everything from a printed template. Pre schoolers would need everything already done, and would be just trying them out (and/or decorating or coloring them). In between ages would be somewhere in between.

	* Paper airplane contest. Could be furthest distance, furthest glide, most accurate, most loops, going around an obstacle, ... Some designs to try: https://www.funpaperairplanes.art/		* Paper airplane contest. Could be furthest distance, furthest glide, most accurate, most loops, going around an obstacle, ... Some designs to try: https://www.funpaperairplanes.art/
	* Flextangle - https://babbledabbledo.com/paper-toys-flextangles/ (template)		* Flextangle - https://babbledabbledo.com/paper-toys-flextangles/ (template)
	* Flexagon - https://www.auntannie.com/Geometric/Flexagon/		* Flexagon - https://www.auntannie.com/Geometric/Flexagon/
	* TetraFlexagon - https://www.auntannie.com/Geometric/TetraFlexagon/		* TetraFlexagon - https://www.auntannie.com/Geometric/TetraFlexagon/

Jkinne: /* Algorithms */

2026-03-17T01:49:08Z

Algorithms

← Older revision		Revision as of 01:49, 17 March 2026
Line 51:		Line 51:
	Here are some problems that we can look at to see what the best algorithm is.		Here are some problems that we can look at to see what the best algorithm is.
	* Number guessing game: I have a secret number that I have picked that is between 1 and 1,000. You can make guesses, and I will tell you whether you have it right or are too high or too low. Make an algorithm to decide on how you will pick the next number to ask. How many guesses will it take you to get the right answer? What if I have a secret number between 1 and 1,000,000?		* Number guessing game: I have a secret number that I have picked that is between 1 and 1,000. You can make guesses, and I will tell you whether you have it right or are too high or too low. Make an algorithm to decide on how you will pick the next number to ask. How many guesses will it take you to get the right answer? What if I have a secret number between 1 and 1,000,000?
	* Prime testing: I give you a random number between 1 and 200. You want to check if it is prime or not using trial division. What are the possible divisors that you will need to check? What if the random number is between 1 and 1,000,000?		* Prime testing: I give you a random number between 1 and 200. You want to check if it is prime or not using trial division. What are the possible divisors that you will need to check? What if the random number is between 1 and 1,000,000? (In general, you need to test primes up to the sqrt of the number.) We can also look at the total number of divisions needed to compute all of the primes that are less than 100; method 1 tests each number individually, method 2 uses the sieve of eratosthenes.
	* Searching a sorted list of numbers, what is the best way? Think of a reverse phone number search. Algorithms to try: linear search, binary search.		* Searching a sorted list of numbers, what is the best way? Think of a reverse phone number search. Algorithms to try: linear search, binary search.
	* Take an unsorted list of numbers, and put them into sorted order. Algorithms to try: selection sort, merge sort.		* Take an unsorted list of numbers, and put them into sorted order. Algorithms to try: selection sort, merge sort.

			== Paper Folding ==
			* Paper airplane contest. Could be furthest distance, furthest glide, most accurate, most loops, going around an obstacle, ... Some designs to try: https://www.funpaperairplanes.art/
			* Flextangle - https://babbledabbledo.com/paper-toys-flextangles/ (template)
			* Flexagon - https://www.auntannie.com/Geometric/Flexagon/
			* TetraFlexagon - https://www.auntannie.com/Geometric/TetraFlexagon/

Jkinne: /* Algorithms */

2026-02-27T15:32:27Z

Algorithms

← Older revision		Revision as of 15:32, 27 February 2026
Line 50:		Line 50:

	Here are some problems that we can look at to see what the best algorithm is.		Here are some problems that we can look at to see what the best algorithm is.
			* Number guessing game: I have a secret number that I have picked that is between 1 and 1,000. You can make guesses, and I will tell you whether you have it right or are too high or too low. Make an algorithm to decide on how you will pick the next number to ask. How many guesses will it take you to get the right answer? What if I have a secret number between 1 and 1,000,000?
			* Prime testing: I give you a random number between 1 and 200. You want to check if it is prime or not using trial division. What are the possible divisors that you will need to check? What if the random number is between 1 and 1,000,000?
	* Searching a sorted list of numbers, what is the best way? Think of a reverse phone number search. Algorithms to try: linear search, binary search.		* Searching a sorted list of numbers, what is the best way? Think of a reverse phone number search. Algorithms to try: linear search, binary search.
	* Take an unsorted list of numbers, and put them into sorted order. Algorithms to try: selection sort, merge sort.		* Take an unsorted list of numbers, and put them into sorted order. Algorithms to try: selection sort, merge sort.
	* I have a secret number that I have picked that is between 1 and 1,000. You can make guesses, and I will tell you whether you have it right or are too high or too low. Make an algorithm to decide on how you will pick the next number to ask. How many guesses will it take you to get the right answer? What if I have a secret number between 1 and 1,000,000?
	* I give you a random number between 1 and 200. You want to check if it is prime or not using trial division. What are the possible divisors that you will need to check? What if the random number is between 1 and 1,000,000?

Jkinne: /* Explorations in AI */

2026-02-27T15:31:30Z

Explorations in AI

← Older revision		Revision as of 15:31, 27 February 2026
Line 1:		Line 1:
	This page contains activities for when people (e.g., high school students) come to visit the university.		This page contains activities for when people (e.g., high school students) come to visit the university.

	== Explorations in AI ==		== Explorations in AI LLMs ==
	We can look at what current AI LLM's are able to do. Here are some tasks that were tested in February 2026 that some AIs (LLMs) did better on than others.		We can look at what current AI LLM's are able to do. Here are some tasks that were tested in February 2026 that some AIs (LLMs) did better on than others.
	* Generate a study guide for a geography quiz bowl on Latin America.		* Generate a study guide for a geography quiz bowl on Latin America.

Jkinne: /* Explorations in AI */

2026-02-27T15:20:52Z

Explorations in AI

@@ Line 2: / Line 2: @@
 == Explorations in AI ==
-We can look at what current AI LLM's are able to do. Some notes and examples of AI output on a few tasks are here:
+We can look at what current AI LLM's are able to do. Here are some tasks that were tested in February 2026 that some AIs (LLMs) did better on than others.
 == Computers in TC CS Classrooms ==

Jkinne: /* Algorithms */

2026-02-27T13:58:56Z

Algorithms

← Older revision		Revision as of 13:58, 27 February 2026
Line 41:		Line 41:
	* Take an unsorted list of numbers, and put them into sorted order. Algorithms to try: selection sort, merge sort.		* Take an unsorted list of numbers, and put them into sorted order. Algorithms to try: selection sort, merge sort.
	* I have a secret number that I have picked that is between 1 and 1,000. You can make guesses, and I will tell you whether you have it right or are too high or too low. Make an algorithm to decide on how you will pick the next number to ask. How many guesses will it take you to get the right answer? What if I have a secret number between 1 and 1,000,000?		* I have a secret number that I have picked that is between 1 and 1,000. You can make guesses, and I will tell you whether you have it right or are too high or too low. Make an algorithm to decide on how you will pick the next number to ask. How many guesses will it take you to get the right answer? What if I have a secret number between 1 and 1,000,000?
			* I give you a random number between 1 and 200. You want to check if it is prime or not using trial division. What are the possible divisors that you will need to check? What if the random number is between 1 and 1,000,000?

Jkinne: /* Algorithms */

2026-02-27T13:57:53Z

Algorithms

← Older revision		Revision as of 13:57, 27 February 2026
Line 40:		Line 40:
	* Searching a sorted list of numbers, what is the best way? Think of a reverse phone number search. Algorithms to try: linear search, binary search.		* Searching a sorted list of numbers, what is the best way? Think of a reverse phone number search. Algorithms to try: linear search, binary search.
	* Take an unsorted list of numbers, and put them into sorted order. Algorithms to try: selection sort, merge sort.		* Take an unsorted list of numbers, and put them into sorted order. Algorithms to try: selection sort, merge sort.
			* I have a secret number that I have picked that is between 1 and 1,000. You can make guesses, and I will tell you whether you have it right or are too high or too low. Make an algorithm to decide on how you will pick the next number to ask. How many guesses will it take you to get the right answer? What if I have a secret number between 1 and 1,000,000?