https://wiki.expertiza.ncsu.edu/api.php?action=feedcontributions&feedformat=atom&user=Jpcarter 2026-05-26T15:58:08Z User contributions MediaWiki 1.41.0 https://wiki.expertiza.ncsu.edu/index.php?title=CSC_216/s08/no_comparison&diff=11366 2008-04-21T02:52:20Z

<p>Jpcarter: </p> <hr /> <div>==Linked Lists in Person==<br /> <br /> This exercise will help students understand the structure of a linked list.<br /> <br /> ===The Problem===<br /> A linked list is a useful data structure but it can be very confusing for students first trying to grasp it. This interactive exercise should help students understand the concept. <br /> <br /> ===Participants and Props===<br /> <br /> To run this exercise, you will need at least 6 students and some paper and writing utensils. <br /> <br /> ===How to Execute===<br /> ====Set-up====<br /> <br /> Each student participating in the exercise has a card with &quot;Data = [name]&quot;, name being the name of the student, written on it. One student is chosen to be the head of the list. Three students are then lined up to the left of the head of the list in alphabetical order. Starting from the head, each student will write &quot;Next = [name of the person to their left]&quot; on their card. The last student in the list should write &quot;Next = null&quot; on their card. This setup represents a basic linked list.<br /> <br /> <br /> [http://pg-server.csc.ncsu.edu/mediawiki/index.php/Image:Java5.jpg Here] is an example card.<br /> <br /> ====Insertion====<br /> Now we will practice inserting a new node. One of the remaining students will write &quot;Data = [name]&quot; on their card, and become the new node. The new node will ask if the first node is alphabetically before itself. If the answer is no, the new node will stand to the right of the first node. The new node will then write &quot;Next = [name of the first node]&quot; on his card. If the answer is yes, the new node will ask the next student in line until they receive a &quot;no&quot; answer or reach the end of the line, in which case they will stand at the end of the line write &quot;Next = null&quot;. After the student has found their place in the line, they will write &quot;Next = [name of the student to their left]&quot;. The student to the right of the new student will write <br /> &quot;Next = [name of new student]&quot; on their card.<br /> <br /> ====Deletion====<br /> Now we will practice deleting a student. The instructor will choose a student to be deleted. Starting at the head of the list, he will ask each student if their &quot;Data = [the chosen value]&quot;. If the answer is yes, the deleted student will pass the value of its &quot;Next&quot; to the student to their right. The student to their right will appropriately change their card, and the chosen student exits the list. Continue these exercises until the concept is understood.<br /> <br /> ====Demonstration====<br /> <br /> [http://courses.ncsu.edu/csc216/lec/002/video/t13/ Here] is a demonstration of the exercise.</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=CSC_216/s08/no_comparison&diff=11348 2008-04-20T19:38:39Z

<p>Jpcarter: </p> <hr /> <div>==Linked Lists in Person==<br /> <br /> This exercise will help students understand the structure of a linked list.<br /> <br /> ===The Problem===<br /> A linked list is a useful data structure but it can be very confusing for students first trying to grasp it. This interactive exercise should help students understand the concept. <br /> <br /> ===Participants and Props===<br /> <br /> To run this exercise, you will need at least 6 students and some paper and writing utensils. <br /> <br /> ===How to Execute===<br /> ====Set-up====<br /> <br /> Each student participating in the exercise has a card with &quot;Data = [name]&quot;, name being the name of the student, written on it. One student is chosen to be the head of the list. Three students are then lined up to the left of the head of the list in alphabetical order. Starting from the head, each student will write &quot;Next = [name of the person to their left]&quot; on their card. The last student in the list should write &quot;Next = null&quot; on their card. This setup represents a basic linked list.<br /> <br /> <br /> [http://pg-server.csc.ncsu.edu/mediawiki/index.php/Image:Java5.jpg Here] is an example card.<br /> <br /> ====Insertion====<br /> Now we will practice inserting a new node. One of the remaining students will write &quot;Data = [name]&quot; on their card, and become the new node. The new node will ask if the first node is alphabetically before itself. If the answer is no, the new node will stand to the right of the first node. The new node will then write &quot;Next = [name of the first node]&quot; on his card. If the answer is yes, the new node will ask the next student in line until they receive a &quot;no&quot; answer or reach the end of the line, in which case they will stand at the end of the line write &quot;Next = null&quot;. After the student has found their place in the line, they will write &quot;Next = [name of the student to their left]&quot;. The student to the right of the new student will write <br /> &quot;Next = [name of new student]&quot; on their card.<br /> <br /> ====Deletion====<br /> Now we will practice deleting a student. The instructor will choose a student to be deleted. Starting at the head of the list, he will ask each student if their &quot;Data = [the chosen value]&quot;. If the answer is yes, the deleted student will pass the value of its &quot;Next&quot; to the student to their right. The student to their right will appropriately change their card, and the chosen student exits the list. Continue these exercises until the concept is understood.</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=CSC_216/s08/no_comparison&diff=11347 2008-04-20T19:37:54Z

<p>Jpcarter: </p> <hr /> <div>==Linked Lists in Person==<br /> <br /> This exercise will help students understand the structure of a linked list.<br /> <br /> ===The Problem===<br /> A linked list is a useful data structure but it can be very confusing for students first trying to grasp it. This interactive exercise should help students understand the concept. <br /> <br /> ===Participants and Props===<br /> <br /> To run this exercise, you will need at least 6 students and some paper and writing utensils. <br /> <br /> ===How to Execute===<br /> ====Set-up====<br /> <br /> Each student participating in the exercise has a card with &quot;Data = [name]&quot;, name being the name of the student, written on it. One student is chosen to be the head of the list. Three students are then lined up to the left of the head of the list in alphabetical order. Starting from the head, each student will write &quot;Next = [name of the person to their left]&quot; on their card. The last student in the list should write &quot;Next = null&quot; on their card. This setup represents a basic linked list.<br /> <br /> <br /> [http://pg-server.csc.ncsu.edu/mediawiki/index.php/Image:Java5.jpg Here] is an example card.<br /> <br /> ====Insertion====<br /> Now we will practice inserting a new node. One of the remaining students will write &quot;Data = [name]&quot; on their card, and become the new node. The new node will ask if the first node is alphabetically before itself. If the answer is no, the new node will stand to the right of the first node. The new node will then write &quot;Next = [name of the first node]&quot; on his card. If the answer is yes, the new node will ask the next student in line until they receive a &quot;no&quot; answer or reach the end of the line, in which case they will stand at the end of the line write &quot;Next = null&quot;. After the student has found their place in the line, they will write &quot;Next = [name of the student to their left]&quot;. The student to the right of the new student will write <br /> &quot;Next = [name of new student]&quot; on their card.<br /> <br /> ====Deletion====<br /> Now we will practice deleting a student. The instructor will choose a student to be deleted. Starting at the head of the list, he will ask each student if their &quot;Data = [the chosen value]&quot;. If the answer is yes, the deleted student will pass the value of its &quot;Next&quot; to the student to their right. The student to their right will appropriately change their card, and the chosen student exits the list. Continue these exercises until the concept is understood.<br /> <br /> [http://pg-server.csc.ncsu.edu/mediawiki/index.php/Image:Java5.jpg Here] is an example card.</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=CSC_216/s08/no_comparison&diff=11346 2008-04-20T19:36:51Z

<p>Jpcarter: </p> <hr /> <div>==Linked Lists in Person==<br /> <br /> This exercise will help students understand the structure of a linked list.<br /> <br /> ===The Problem===<br /> A linked list is a useful data structure but it can be very confusing for students first trying to grasp it. This interactive exercise should help students understand the concept. <br /> <br /> ===Participants and Props===<br /> <br /> To run this exercise, you will need at least 6 students and some paper and writing utensils. <br /> <br /> ===How to Execute===<br /> ====Set-up====<br /> <br /> Each student participating in the exercise has a card with &quot;Data = [name]&quot;, name being the name of the student, written on it. One student is chosen to be the head of the list. Three students are then lined up to the left of the head of the list in alphabetical order. Starting from the head, each student will write &quot;Next = [name of the person to their left]&quot; on their card. The last student in the list should write &quot;Next = null&quot; on their card. This setup represents a basic linked list.<br /> ====Insertion====<br /> Now we will practice inserting a new node. One of the remaining students will write &quot;Data = [name]&quot; on their card, and become the new node. The new node will ask if the first node is alphabetically before itself. If the answer is no, the new node will stand to the right of the first node. The new node will then write &quot;Next = [name of the first node]&quot; on his card. If the answer is yes, the new node will ask the next student in line until they receive a &quot;no&quot; answer or reach the end of the line, in which case they will stand at the end of the line write &quot;Next = null&quot;. After the student has found their place in the line, they will write &quot;Next = [name of the student to their left]&quot;. The student to the right of the new student will write <br /> &quot;Next = [name of new student]&quot; on their card.<br /> <br /> ====Deletion====<br /> Now we will practice deleting a student. The instructor will choose a student to be deleted. Starting at the head of the list, he will ask each student if their &quot;Data = [the chosen value]&quot;. If the answer is yes, the deleted student will pass the value of its &quot;Next&quot; to the student to their right. The student to their right will appropriately change their card, and the chosen student exits the list. Continue these exercises until the concept is understood.<br /> <br /> [[Image:java5.jpg]]<br /> [http://www.example.com link title]</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=File:Java5.jpg&diff=11345 2008-04-20T19:35:53Z

<p>Jpcarter: </p> <hr /> <div></div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=CSC_216/s08/no_comparison&diff=11344 2008-04-20T19:35:27Z

<p>Jpcarter: </p> <hr /> <div>==Linked Lists in Person==<br /> <br /> This exercise will help students understand the structure of a linked list.<br /> <br /> ===The Problem===<br /> A linked list is a useful data structure but it can be very confusing for students first trying to grasp it. This interactive exercise should help students understand the concept. <br /> <br /> ===Participants and Props===<br /> <br /> To run this exercise, you will need at least 6 students and some paper and writing utensils. <br /> <br /> ===How to Execute===<br /> ====Set-up====<br /> <br /> Each student participating in the exercise has a card with &quot;Data = [name]&quot;, name being the name of the student, written on it. One student is chosen to be the head of the list. Three students are then lined up to the left of the head of the list in alphabetical order. Starting from the head, each student will write &quot;Next = [name of the person to their left]&quot; on their card. The last student in the list should write &quot;Next = null&quot; on their card. This setup represents a basic linked list.<br /> ====Insertion====<br /> Now we will practice inserting a new node. One of the remaining students will write &quot;Data = [name]&quot; on their card, and become the new node. The new node will ask if the first node is alphabetically before itself. If the answer is no, the new node will stand to the right of the first node. The new node will then write &quot;Next = [name of the first node]&quot; on his card. If the answer is yes, the new node will ask the next student in line until they receive a &quot;no&quot; answer or reach the end of the line, in which case they will stand at the end of the line write &quot;Next = null&quot;. After the student has found their place in the line, they will write &quot;Next = [name of the student to their left]&quot;. The student to the right of the new student will write <br /> &quot;Next = [name of new student]&quot; on their card.<br /> <br /> ====Deletion====<br /> Now we will practice deleting a student. The instructor will choose a student to be deleted. Starting at the head of the list, he will ask each student if their &quot;Data = [the chosen value]&quot;. If the answer is yes, the deleted student will pass the value of its &quot;Next&quot; to the student to their right. The student to their right will appropriately change their card, and the chosen student exits the list. Continue these exercises until the concept is understood.<br /> <br /> [[Image:java5.jpg]]</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=CSC_216/s08/no_comparison&diff=11343 2008-04-20T19:34:56Z

<p>Jpcarter: </p> <hr /> <div>==Linked Lists in Person==<br /> <br /> This exercise will help students understand the structure of a linked list.<br /> <br /> ===The Problem===<br /> A linked list is a useful data structure but it can be very confusing for students first trying to grasp it. This interactive exercise should help students understand the concept. <br /> <br /> ===Participants and Props===<br /> <br /> To run this exercise, you will need at least 6 students and some paper and writing utensils. <br /> <br /> ===How to Execute===<br /> ====Set-up====<br /> <br /> Each student participating in the exercise has a card with &quot;Data = [name]&quot;, name being the name of the student, written on it. One student is chosen to be the head of the list. Three students are then lined up to the left of the head of the list in alphabetical order. Starting from the head, each student will write &quot;Next = [name of the person to their left]&quot; on their card. The last student in the list should write &quot;Next = null&quot; on their card. This setup represents a basic linked list.<br /> ====Insertion====<br /> Now we will practice inserting a new node. One of the remaining students will write &quot;Data = [name]&quot; on their card, and become the new node. The new node will ask if the first node is alphabetically before itself. If the answer is no, the new node will stand to the right of the first node. The new node will then write &quot;Next = [name of the first node]&quot; on his card. If the answer is yes, the new node will ask the next student in line until they receive a &quot;no&quot; answer or reach the end of the line, in which case they will stand at the end of the line write &quot;Next = null&quot;. After the student has found their place in the line, they will write &quot;Next = [name of the student to their left]&quot;. The student to the right of the new student will write <br /> &quot;Next = [name of new student]&quot; on their card.<br /> <br /> ====Deletion====<br /> Now we will practice deleting a student. The instructor will choose a student to be deleted. Starting at the head of the list, he will ask each student if their &quot;Data = [the chosen value]&quot;. If the answer is yes, the deleted student will pass the value of its &quot;Next&quot; to the student to their right. The student to their right will appropriately change their card, and the chosen student exits the list. Continue these exercises until the concept is understood.<br /> <br /> [[Image:Example.jpg]]</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=CSC_216/s08/no_comparison&diff=11341 2008-04-20T18:57:13Z

<p>Jpcarter: </p> <hr /> <div>==Linked Lists in Person==<br /> <br /> This exercise will help students understand the structure of a linked list.<br /> <br /> ===The Problem===<br /> A linked list is a useful data structure but it can be very confusing for students first trying to grasp it. This interactive exercise should help students understand the concept. <br /> <br /> ===Participants and Props===<br /> <br /> To run this exercise, you will need at least 6 students and some paper and writing utensils. <br /> <br /> ===How to Execute===<br /> ====Set-up====<br /> <br /> Each student participating in the exercise has a card with &quot;Data = [name]&quot;, name being the name of the student, written on it. One student is chosen to be the head of the list. Three students are then lined up to the left of the head of the list in alphabetical order. Starting from the head, each student will write &quot;Next = [name of the person to their left]&quot; on their card. The last student in the list should write &quot;Next = null&quot; on their card. This setup represents a basic linked list.<br /> ====Insertion====<br /> Now we will practice inserting a new node. One of the remaining students will write &quot;Data = [name]&quot; on their card, and become the new node. The new node will ask if the first node is alphabetically before itself. If the answer is no, the new node will stand to the right of the first node. The new node will then write &quot;Next = [name of the first node]&quot; on his card. If the answer is yes, the new node will ask the next student in line until they receive a &quot;no&quot; answer or reach the end of the line, in which case they will stand at the end of the line write &quot;Next = null&quot;. After the student has found their place in the line, they will write &quot;Next = [name of the student to their left]&quot;. The student to the right of the new student will write &quot;Next = [name of new student]&quot; on their card.<br /> ====Deletion====<br /> Now we will practice deleting a student. The instructor will choose a student to be deleted. Starting at the head of the list, he will ask each student if their &quot;Data = [the chosen value]&quot;. If the answer is yes, the deleted student will pass the value of its &quot;Next&quot; to the student to their right. The student to their right will appropriately change their card, and the chosen student exits the list. Continue these exercises until the concept is understood.</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=CSC_216/s08/no_comparison&diff=11340 2008-04-20T18:56:03Z

<p>Jpcarter: </p> <hr /> <div>==Linked Lists in Person==<br /> <br /> This exercise will help students understand the structure of a linked list.<br /> <br /> ===The Problem===<br /> A linked list is a useful data structure but it can be very confusing for students first trying to grasp it. This interactive exercise should help students understand the concept. <br /> <br /> ===Participants and Props===<br /> <br /> To run this exercise, you will need at least 6 students and some paper and writing utensils. <br /> <br /> ===How to Execute===<br /> <br /> <br /> Each student participating in the exercise has a card with &quot;Data = [name]&quot;, name being the name of the student, written on it. One student is chosen to be the head of the list. Three students are then lined up to the left of the head of the list in alphabetical order. Starting from the head, each student will write &quot;Next = [name of the person to their left]&quot; on their card. The last student in the list should write &quot;Next = null&quot; on their card. This setup represents a basic linked list.<br /> ----<br /> Now we will practice inserting a new node. One of the remaining students will write &quot;Data = [name]&quot; on their card, and become the new node. The new node will ask if the first node is alphabetically before itself. If the answer is no, the new node will stand to the right of the first node. The new node will then write &quot;Next = [name of the first node]&quot; on his card. If the answer is yes, the new node will ask the next student in line until they receive a &quot;no&quot; answer or reach the end of the line, in which case they will stand at the end of the line write &quot;Next = null&quot;. After the student has found their place in the line, they will write &quot;Next = [name of the student to their left]&quot;. The student to the right of the new student will write &quot;Next = [name of new student]&quot; on their card.<br /> ----<br /> Now we will practice deleting a student. The instructor will choose a student to be deleted. Starting at the head of the list, he will ask each student if their &quot;Data = [the chosen value]&quot;. If the answer is yes, the deleted student will pass the value of its &quot;Next&quot; to the student to their right. The student to their right will appropriately change their card, and the chosen student exits the list. Continue these exercises until the concept is understood.</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=CSC_216/s08/no_comparison&diff=11339 2008-04-20T18:55:16Z

<p>Jpcarter: </p> <hr /> <div>==Linked Lists in Person==<br /> <br /> This exercise will help students understand the structure of a linked list.<br /> <br /> ===The Problem===<br /> A linked list is a useful data structure but it can be very confusing for students first trying to grasp it. This interactive exercise should help students understand the concept. <br /> <br /> ===Participants and Props===<br /> <br /> To run this exercise, you will need at least 6 students and some paper and writing utensils. <br /> <br /> ===How to Execute===<br /> <br /> <br /> Each student participating in the exercise has a card with &quot;Data = [name]&quot;, name being the name of the student, written on it. One student is chosen to be the head of the list. Three students are then lined up to the left of the head of the list in alphabetical order. Starting from the head, each student will write &quot;Next = [name of the person to their left]&quot; on their card. The last student in the list should write &quot;Next = null&quot; on their card. This setup represents a basic linked list.(----)<br /> Now we will practice inserting a new node. One of the remaining students will write &quot;Data = [name]&quot; on their card, and become the new node. The new node will ask if the first node is alphabetically before itself. If the answer is no, the new node will stand to the right of the first node. The new node will then write &quot;Next = [name of the first node]&quot; on his card. If the answer is yes, the new node will ask the next student in line until they receive a &quot;no&quot; answer or reach the end of the line, in which case they will stand at the end of the line write &quot;Next = null&quot;. After the student has found their place in the line, they will write &quot;Next = [name of the student to their left]&quot;. The student to the right of the new student will write &quot;Next = [name of new student]&quot; on their card. (----)<br /> Now we will practice deleting a student. The instructor will choose a student to be deleted. Starting at the head of the list, he will ask each student if their &quot;Data = [the chosen value]&quot;. If the answer is yes, the deleted student will pass the value of its &quot;Next&quot; to the student to their right. The student to their right will appropriately change their card, and the chosen student exits the list. Continue these exercises until the concept is understood.</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=CSC_216/s08/no_comparison&diff=11338 2008-04-20T18:54:30Z

<p>Jpcarter: </p> <hr /> <div>==Linked Lists in Person==<br /> <br /> This exercise will help students understand the structure of a linked list.<br /> <br /> ===The Problem===<br /> A linked list is a useful data structure but it can be very confusing for students first trying to grasp it. This interactive exercise should help students understand the concept. <br /> <br /> ===Participants and Props===<br /> <br /> To run this exercise, you will need at least 6 students and some paper and writing utensils. <br /> <br /> ===How to Execute===<br /> <br /> <br /> Each student participating in the exercise has a card with &quot;Data = [name]&quot;, name being the name of the student, written on it. One student is chosen to be the head of the list. Three students are then lined up to the left of the head of the list in alphabetical order. Starting from the head, each student will write &quot;Next = [name of the person to their left]&quot; on their card. The last student in the list should write &quot;Next = null&quot; on their card. This setup represents a basic linked list.(-----)<br /> Now we will practice inserting a new node. One of the remaining students will write &quot;Data = [name]&quot; on their card, and become the new node. The new node will ask if the first node is alphabetically before itself. If the answer is no, the new node will stand to the right of the first node. The new node will then write &quot;Next = [name of the first node]&quot; on his card. If the answer is yes, the new node will ask the next student in line until they receive a &quot;no&quot; answer or reach the end of the line, in which case they will stand at the end of the line write &quot;Next = null&quot;. After the student has found their place in the line, they will write &quot;Next = [name of the student to their left]&quot;. The student to the right of the new student will write &quot;Next = [name of new student]&quot; on their card. (-----)<br /> Now we will practice deleting a student. The instructor will choose a student to be deleted. Starting at the head of the list, he will ask each student if their &quot;Data = [the chosen value]&quot;. If the answer is yes, the deleted student will pass the value of its &quot;Next&quot; to the student to their right. The student to their right will appropriately change their card, and the chosen student exits the list. Continue these exercises until the concept is understood.</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=CSC_216/s08/no_comparison&diff=11337 2008-04-20T18:53:39Z

<p>Jpcarter: </p> <hr /> <div>==Linked Lists in Person==<br /> <br /> This exercise will help students understand the structure of a linked list.<br /> <br /> ===The Problem===<br /> A linked list is a useful data structure but it can be very confusing for students first trying to grasp it. This interactive exercise should help students understand the concept. <br /> <br /> ===Participants and Props===<br /> <br /> To run this exercise, you will need at least 6 students and some paper and writing utensils. <br /> <br /> ===How to Execute===<br /> <br /> <br /> &lt;p&gt;Each student participating in the exercise has a card with &quot;Data = [name]&quot;, name being the name of the student, written on it. One student is chosen to be the head of the list. Three students are then lined up to the left of the head of the list in alphabetical order. Starting from the head, each student will write &quot;Next = [name of the person to their left]&quot; on their card. The last student in the list should write &quot;Next = null&quot; on their card. This setup represents a basic linked list. <br /> &lt;p&gt;Now we will practice inserting a new node. One of the remaining students will write &quot;Data = [name]&quot; on their card, and become the new node. The new node will ask if the first node is alphabetically before itself. If the answer is no, the new node will stand to the right of the first node. The new node will then write &quot;Next = [name of the first node]&quot; on his card. If the answer is yes, the new node will ask the next student in line until they receive a &quot;no&quot; answer or reach the end of the line, in which case they will stand at the end of the line write &quot;Next = null&quot;. After the student has found their place in the line, they will write &quot;Next = [name of the student to their left]&quot;. The student to the right of the new student will write &quot;Next = [name of new student]&quot; on their card. <br /> &lt;p&gt;Now we will practice deleting a student. The instructor will choose a student to be deleted. Starting at the head of the list, he will ask each student if their &quot;Data = [the chosen value]&quot;. If the answer is yes, the deleted student will pass the value of its &quot;Next&quot; to the student to their right. The student to their right will appropriately change their card, and the chosen student exits the list. Continue these exercises until the concept is understood.</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=CSC_216/s08/no_comparison&diff=11336 2008-04-20T18:52:55Z

<p>Jpcarter: </p> <hr /> <div>==Linked Lists in Person==<br /> <br /> This exercise will help students understand the structure of a linked list.<br /> <br /> ===The Problem===<br /> A linked list is a useful data structure but it can be very confusing for students first trying to grasp it. This interactive exercise should help students understand the concept. <br /> <br /> ===Participants and Props===<br /> <br /> To run this exercise, you will need at least 6 students and some paper and writing utensils. <br /> <br /> ===How to Execute===<br /> <br /> <br /> Each student participating in the exercise has a card with &quot;Data = [name]&quot;, name being the name of the student, written on it. One student is chosen to be the head of the list. Three students are then lined up to the left of the head of the list in alphabetical order. Starting from the head, each student will write &quot;Next = [name of the person to their left]&quot; on their card. The last student in the list should write &quot;Next = null&quot; on their card. This setup represents a basic linked list. <br /> Now we will practice inserting a new node. One of the remaining students will write &quot;Data = [name]&quot; on their card, and become the new node. The new node will ask if the first node is alphabetically before itself. If the answer is no, the new node will stand to the right of the first node. The new node will then write &quot;Next = [name of the first node]&quot; on his card. If the answer is yes, the new node will ask the next student in line until they receive a &quot;no&quot; answer or reach the end of the line, in which case they will stand at the end of the line write &quot;Next = null&quot;. After the student has found their place in the line, they will write &quot;Next = [name of the student to their left]&quot;. The student to the right of the new student will write &quot;Next = [name of new student]&quot; on their card. <br /> Now we will practice deleting a student. The instructor will choose a student to be deleted. Starting at the head of the list, he will ask each student if their &quot;Data = [the chosen value]&quot;. If the answer is yes, the deleted student will pass the value of its &quot;Next&quot; to the student to their right. The student to their right will appropriately change their card, and the chosen student exits the list. Continue these exercises until the concept is understood.</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=CSC_216/s08/no_comparison&diff=11335 2008-04-20T18:52:39Z

<p>Jpcarter: </p> <hr /> <div>==Linked Lists in Person==<br /> <br /> This exercise will help students understand the structure of a linked list.<br /> <br /> ===The Problem===<br /> A linked list is a useful data structure but it can be very confusing for students first trying to grasp it. This interactive exercise should help students understand the concept. <br /> <br /> ===Participants and Props===<br /> <br /> To run this exercise, you will need at least 6 students and some paper and writing utensils. <br /> <br /> ===How to Execute===<br /> <br /> <br /> Each student participating in the exercise has a card with &quot;Data = [name]&quot;, name being the name of the student, written on it. One student is chosen to be the head of the list. Three students are then lined up to the left of the head of the list in alphabetical order. Starting from the head, each student will write &quot;Next = [name of the person to their left]&quot; on their card. The last student in the list should write &quot;Next = null&quot; on their card. This setup represents a basic linked list. <br /> Now we will practice inserting a new node. One of the remaining students will write &quot;Data = [name]&quot; on their card, and become the new node. The new node will ask if the first node is alphabetically before itself. If the answer is no, the new node will stand to the right of the first node. The new node will then write &quot;Next = [name of the first node]&quot; on his card. If the answer is yes, the new node will ask the next student in line until they receive a &quot;no&quot; answer or reach the end of the line, in which case they will stand at the end of the line write &quot;Next = null&quot;. After the student has found their place in the line, they will write &quot;Next = [name of the student to their left]&quot;. The student to the right of the new student will write &quot;Next = [name of new student]&quot; on their card. <br /> Now we will practice deleting a student. The instructor will choose a student to be deleted. Starting at the head of the list, he will ask each student if their &quot;Data = [the chosen value]&quot;. If the answer is yes, the deleted student will pass the value of its &quot;Next&quot; to the student to their right. The student to their right will appropriately change their card, and the chosen student exits the list. Continue these exercises until the concept is understood.</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=CSC_216/s08/no_comparison&diff=11334 2008-04-20T18:52:17Z

<p>Jpcarter: </p> <hr /> <div>==Linked Lists in Person==<br /> <br /> This exercise will help students understand the structure of a linked list.<br /> <br /> ===The Problem===<br /> A linked list is a useful data structure but it can be very confusing for students first trying to grasp it. This interactive exercise should help students understand the concept. <br /> <br /> ===Participants and Props===<br /> <br /> To run this exercise, you will need at least 6 students and some paper and writing utensils. <br /> <br /> ===How to Execute===<br /> <br /> <br /> Each student participating in the exercise has a card with &quot;Data = [name]&quot;, name being the name of the student, written on it. One student is chosen to be the head of the list. Three students are then lined up to the left of the head of the list in alphabetical order. Starting from the head, each student will write &quot;Next = [name of the person to their left]&quot; on their card. The last student in the list should write &quot;Next = null&quot; on their card. This setup represents a basic linked list. <br /> Now we will practice inserting a new node. One of the remaining students will write &quot;Data = [name]&quot; on their card, and become the new node. The new node will ask if the first node is alphabetically before itself. If the answer is no, the new node will stand to the right of the first node. The new node will then write &quot;Next = [name of the first node]&quot; on his card. If the answer is yes, the new node will ask the next student in line until they receive a &quot;no&quot; answer or reach the end of the line, in which case they will stand at the end of the line write &quot;Next = null&quot;. After the student has found their place in the line, they will write &quot;Next = [name of the student to their left]&quot;. The student to the right of the new student will write &quot;Next = [name of new student]&quot; on their card. <br /> Now we will practice deleting a student. The instructor will choose a student to be deleted. Starting at the head of the list, he will ask each student if their &quot;Data = [the chosen value]&quot;. If the answer is yes, the deleted student will pass the value of its &quot;Next&quot; to the student to their right. The student to their right will appropriately change their card, and the chosen student exits the list. Continue these exercises until the concept is understood.</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=CSC_216/s08/no_comparison&diff=11333 2008-04-20T18:50:52Z

<p>Jpcarter: </p> <hr /> <div>==Linked Lists in Person==<br /> <br /> This exercise will help students understand the structure of a linked list.<br /> <br /> ===The Problem===<br /> A linked list is a useful data structure but it can be very confusing for students first trying to grasp it. This interactive exercise should help students understand the concept. <br /> <br /> ===Participants and Props===<br /> <br /> To run this exercise, you will need at least 6 students and some paper and writing utensils. <br /> <br /> ===How to Execute===<br /> <br /> <br /> Each student participating in the exercise has a card with &quot;Data = [name]&quot;, name being the name of the student, written on it. One student is chosen to be the head of the list. Three students are then lined up to the left of the head of the list in alphabetical order. Starting from the head, each student will write &quot;Next = [name of the person to their left]&quot; on their card. The last student in the list should write &quot;Next = null&quot; on their card. This setup represents a basic linked list. <br /> <br /> Now we will practice inserting a new node. One of the remaining students will write &quot;Data = [name]&quot; on their card, and become the new node. The new node will ask if the first node is alphabetically before itself. If the answer is no, the new node will stand to the right of the first node. The new node will then write &quot;Next = [name of the first node]&quot; on his card. If the answer is yes, the new node will ask the next student in line until they receive a &quot;no&quot; answer or reach the end of the line, in which case they will stand at the end of the line write &quot;Next = null&quot;. After the student has found their place in the line, they will write &quot;Next = [name of the student to their left]&quot;. The student to the right of the new student will write &quot;Next = [name of new student]&quot; on their card. <br /> <br /> Now we will practice deleting a student. The instructor will choose a student to be deleted. Starting at the head of the list, he will ask each student if their &quot;Data = [the chosen value]&quot;. If the answer is yes, the deleted student will pass the value of its &quot;Next&quot; to the student to their right. The student to their right will appropriately change their card, and the chosen student exits the list. Continue these exercises until the concept is understood.</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=CSC_216/s08/no_comparison&diff=11332 2008-04-20T18:50:32Z

<p>Jpcarter: </p> <hr /> <div>==Linked Lists in Person==<br /> <br /> This exercise will help students understand the structure of a linked list.<br /> <br /> ===The Problem===<br /> A linked list is a useful data structure but it can be very confusing for students first trying to grasp it. This interactive exercise should help students understand the concept. <br /> <br /> ===Participants and Props===<br /> <br /> To run this exercise, you will need at least 6 students and some paper and writing utensils. <br /> <br /> ===How to Execute===<br /> <br /> <br /> &lt;indent&gt;Each student participating in the exercise has a card with &quot;Data = [name]&quot;, name being the name of the student, written on it. One student is chosen to be the head of the list. Three students are then lined up to the left of the head of the list in alphabetical order. Starting from the head, each student will write &quot;Next = [name of the person to their left]&quot; on their card. The last student in the list should write &quot;Next = null&quot; on their card. This setup represents a basic linked list. <br /> <br /> &lt;indent&gt;Now we will practice inserting a new node. One of the remaining students will write &quot;Data = [name]&quot; on their card, and become the new node. The new node will ask if the first node is alphabetically before itself. If the answer is no, the new node will stand to the right of the first node. The new node will then write &quot;Next = [name of the first node]&quot; on his card. If the answer is yes, the new node will ask the next student in line until they receive a &quot;no&quot; answer or reach the end of the line, in which case they will stand at the end of the line write &quot;Next = null&quot;. After the student has found their place in the line, they will write &quot;Next = [name of the student to their left]&quot;. The student to the right of the new student will write &quot;Next = [name of new student]&quot; on their card. <br /> <br /> &lt;indent&gt;Now we will practice deleting a student. The instructor will choose a student to be deleted. Starting at the head of the list, he will ask each student if their &quot;Data = [the chosen value]&quot;. If the answer is yes, the deleted student will pass the value of its &quot;Next&quot; to the student to their right. The student to their right will appropriately change their card, and the chosen student exits the list. Continue these exercises until the concept is understood.</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=CSC_216/s08/no_comparison&diff=11331 2008-04-20T18:48:20Z

<p>Jpcarter: </p> <hr /> <div>==Linked Lists in Person==<br /> <br /> This exercise will help students understand the structure of a linked list.<br /> <br /> ===The Problem===<br /> A linked list is a useful data structure but it can be very confusing for students first trying to grasp it. This interactive exercise should help students understand the concept. <br /> <br /> ===Participants and Props===<br /> <br /> To run this exercise, you will need at least 6 students and some paper and writing utensils. <br /> <br /> ===How to Execute===<br /> <br /> <br /> {{I}}Each student participating in the exercise has a card with &quot;Data = [name]&quot;, name being the name of the student, written on it. One student is chosen to be the head of the list. Three students are then lined up to the left of the head of the list in alphabetical order. Starting from the head, each student will write &quot;Next = [name of the person to their left]&quot; on their card. The last student in the list should write &quot;Next = null&quot; on their card. This setup represents a basic linked list. <br /> <br /> {{I}}Now we will practice inserting a new node. One of the remaining students will write &quot;Data = [name]&quot; on their card, and become the new node. The new node will ask if the first node is alphabetically before itself. If the answer is no, the new node will stand to the right of the first node. The new node will then write &quot;Next = [name of the first node]&quot; on his card. If the answer is yes, the new node will ask the next student in line until they receive a &quot;no&quot; answer or reach the end of the line, in which case they will stand at the end of the line write &quot;Next = null&quot;. After the student has found their place in the line, they will write &quot;Next = [name of the student to their left]&quot;. The student to the right of the new student will write &quot;Next = [name of new student]&quot; on their card. <br /> <br /> {{I}}Now we will practice deleting a student. The instructor will choose a student to be deleted. Starting at the head of the list, he will ask each student if their &quot;Data = [the chosen value]&quot;. If the answer is yes, the deleted student will pass the value of its &quot;Next&quot; to the student to their right. The student to their right will appropriately change their card, and the chosen student exits the list. Continue these exercises until the concept is understood.</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=CSC_216/s08/no_comparison&diff=11330 2008-04-20T18:47:52Z

<p>Jpcarter: </p> <hr /> <div>==Linked Lists in Person==<br /> <br /> This exercise will help students understand the structure of a linked list.<br /> <br /> ===The Problem===<br /> A linked list is a useful data structure but it can be very confusing for students first trying to grasp it. This interactive exercise should help students understand the concept. <br /> <br /> ===Participants and Props===<br /> <br /> To run this exercise, you will need at least 6 students and some paper and writing utensils. <br /> <br /> ===How to Execute===<br /> <br /> <br /> {{indent}}Each student participating in the exercise has a card with &quot;Data = [name]&quot;, name being the name of the student, written on it. One student is chosen to be the head of the list. Three students are then lined up to the left of the head of the list in alphabetical order. Starting from the head, each student will write &quot;Next = [name of the person to their left]&quot; on their card. The last student in the list should write &quot;Next = null&quot; on their card. This setup represents a basic linked list. <br /> <br /> {{indent}}Now we will practice inserting a new node. One of the remaining students will write &quot;Data = [name]&quot; on their card, and become the new node. The new node will ask if the first node is alphabetically before itself. If the answer is no, the new node will stand to the right of the first node. The new node will then write &quot;Next = [name of the first node]&quot; on his card. If the answer is yes, the new node will ask the next student in line until they receive a &quot;no&quot; answer or reach the end of the line, in which case they will stand at the end of the line write &quot;Next = null&quot;. After the student has found their place in the line, they will write &quot;Next = [name of the student to their left]&quot;. The student to the right of the new student will write &quot;Next = [name of new student]&quot; on their card. <br /> <br /> {{indent}}Now we will practice deleting a student. The instructor will choose a student to be deleted. Starting at the head of the list, he will ask each student if their &quot;Data = [the chosen value]&quot;. If the answer is yes, the deleted student will pass the value of its &quot;Next&quot; to the student to their right. The student to their right will appropriately change their card, and the chosen student exits the list. Continue these exercises until the concept is understood.</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=CSC_216/s08/no_comparison&diff=11329 2008-04-20T18:44:59Z

<p>Jpcarter: </p> <hr /> <div>==Linked Lists in Person==<br /> <br /> This exercise will help students understand the structure of a linked list.<br /> <br /> ===The Problem===<br /> A linked list is a useful data structure but it can be very confusing for students first trying to grasp it. This interactive exercise should help students understand the concept. <br /> <br /> ===Participants and Props===<br /> <br /> To run this exercise, you will need at least 6 students and some paper and writing utensils. <br /> <br /> ===How to Execute===<br /> <br /> &lt;nowiki&gt; <br /> Each student participating in the exercise has a card with &quot;Data = [name]&quot;, name being the name of the student, written on it. One student is chosen to be the head of the list. Three students are then lined up to the left of the head of the list in alphabetical order. Starting from the head, each student will write &quot;Next = [name of the person to their left]&quot; on their card. The last student in the list should write &quot;Next = null&quot; on their card. This setup represents a basic linked list. <br /> <br /> Now we will practice inserting a new node. One of the remaining students will write &quot;Data = [name]&quot; on their card, and become the new node. The new node will ask if the first node is alphabetically before itself. If the answer is no, the new node will stand to the right of the first node. The new node will then write &quot;Next = [name of the first node]&quot; on his card. If the answer is yes, the new node will ask the next student in line until they receive a &quot;no&quot; answer or reach the end of the line, in which case they will stand at the end of the line write &quot;Next = null&quot;. After the student has found their place in the line, they will write &quot;Next = [name of the student to their left]&quot;. The student to the right of the new student will write &quot;Next = [name of new student]&quot; on their card. <br /> <br /> Now we will practice deleting a student. The instructor will choose a student to be deleted. Starting at the head of the list, he will ask each student if their &quot;Data = [the chosen value]&quot;. If the answer is yes, the deleted student will pass the value of its &quot;Next&quot; to the student to their right. The student to their right will appropriately change their card, and the chosen student exits the list. Continue these exercises until the concept is understood.<br /> &lt;/nowiki&gt;</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=CSC_216/s08/no_comparison&diff=11328 2008-04-20T18:44:25Z

<p>Jpcarter: </p> <hr /> <div>==Linked Lists in Person==<br /> <br /> This exercise will help students understand the structure of a linked list.<br /> <br /> ===The Problem===<br /> A linked list is a useful data structure but it can be very confusing for students first trying to grasp it. This interactive exercise should help students understand the concept. <br /> <br /> ===Participants and Props===<br /> <br /> To run this exercise, you will need at least 6 students and some paper and writing utensils. <br /> <br /> ===How to Execute===<br /> <br /> &lt;pre&gt; <br /> Each student participating in the exercise has a card with &quot;Data = [name]&quot;, name being the name of the student, written on it. One student is chosen to be the head of the list. Three students are then lined up to the left of the head of the list in alphabetical order. Starting from the head, each student will write &quot;Next = [name of the person to their left]&quot; on their card. The last student in the list should write &quot;Next = null&quot; on their card. This setup represents a basic linked list. <br /> <br /> Now we will practice inserting a new node. One of the remaining students will write &quot;Data = [name]&quot; on their card, and become the new node. The new node will ask if the first node is alphabetically before itself. If the answer is no, the new node will stand to the right of the first node. The new node will then write &quot;Next = [name of the first node]&quot; on his card. If the answer is yes, the new node will ask the next student in line until they receive a &quot;no&quot; answer or reach the end of the line, in which case they will stand at the end of the line write &quot;Next = null&quot;. After the student has found their place in the line, they will write &quot;Next = [name of the student to their left]&quot;. The student to the right of the new student will write &quot;Next = [name of new student]&quot; on their card. <br /> <br /> Now we will practice deleting a student. The instructor will choose a student to be deleted. Starting at the head of the list, he will ask each student if their &quot;Data = [the chosen value]&quot;. If the answer is yes, the deleted student will pass the value of its &quot;Next&quot; to the student to their right. The student to their right will appropriately change their card, and the chosen student exits the list. Continue these exercises until the concept is understood.<br /> &lt;/pre&gt;</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=CSC_216/s08/no_comparison&diff=11327 2008-04-20T18:44:01Z

<p>Jpcarter: </p> <hr /> <div>==Linked Lists in Person==<br /> <br /> This exercise will help students understand the structure of a linked list.<br /> <br /> ===The Problem===<br /> A linked list is a useful data structure but it can be very confusing for students first trying to grasp it. This interactive exercise should help students understand the concept. <br /> <br /> ===Participants and Props===<br /> <br /> To run this exercise, you will need at least 6 students and some paper and writing utensils. <br /> <br /> ===How to Execute===<br /> <br /> &lt;pre&gt; Each student participating in the exercise has a card with &quot;Data = [name]&quot;, name being the name of the student, written on it. One student is chosen to be the head of the list. Three students are then lined up to the left of the head of the list in alphabetical order. Starting from the head, each student will write &quot;Next = [name of the person to their left]&quot; on their card. The last student in the list should write &quot;Next = null&quot; on their card. This setup represents a basic linked list. <br /> <br /> Now we will practice inserting a new node. One of the remaining students will write &quot;Data = [name]&quot; on their card, and become the new node. The new node will ask if the first node is alphabetically before itself. If the answer is no, the new node will stand to the right of the first node. The new node will then write &quot;Next = [name of the first node]&quot; on his card. If the answer is yes, the new node will ask the next student in line until they receive a &quot;no&quot; answer or reach the end of the line, in which case they will stand at the end of the line write &quot;Next = null&quot;. After the student has found their place in the line, they will write &quot;Next = [name of the student to their left]&quot;. The student to the right of the new student will write &quot;Next = [name of new student]&quot; on their card. <br /> <br /> Now we will practice deleting a student. The instructor will choose a student to be deleted. Starting at the head of the list, he will ask each student if their &quot;Data = [the chosen value]&quot;. If the answer is yes, the deleted student will pass the value of its &quot;Next&quot; to the student to their right. The student to their right will appropriately change their card, and the chosen student exits the list. Continue these exercises until the concept is understood.<br /> &lt;/pre&gt;</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=CSC_216/s08/no_comparison&diff=11326 2008-04-20T18:42:37Z

<p>Jpcarter: </p> <hr /> <div>==Linked Lists in Person==<br /> <br /> This exercise will help students understand the structure of a linked list.<br /> <br /> ===The Problem===<br /> A linked list is a useful data structure but it can be very confusing for students first trying to grasp it. This interactive exercise should help students understand the concept. <br /> <br /> ===Participants and Props===<br /> <br /> To run this exercise, you will need at least 6 students and some paper and writing utensils. <br /> <br /> ===How to Execute===<br /> <br /> Each student participating in the exercise has a card with &quot;Data = [name]&quot;, name being the name of the student, written on it. One student is chosen to be the head of the list. Three students are then lined up to the left of the head of the list in alphabetical order. Starting from the head, each student will write &quot;Next = [name of the person to their left]&quot; on their card. The last student in the list should write &quot;Next = null&quot; on their card. This setup represents a basic linked list. <br /> <br /> Now we will practice inserting a new node. One of the remaining students will write &quot;Data = [name]&quot; on their card, and become the new node. The new node will ask if the first node is alphabetically before itself. If the answer is no, the new node will stand to the right of the first node. The new node will then write &quot;Next = [name of the first node]&quot; on his card. If the answer is yes, the new node will ask the next student in line until they receive a &quot;no&quot; answer or reach the end of the line, in which case they will stand at the end of the line write &quot;Next = null&quot;. After the student has found their place in the line, they will write &quot;Next = [name of the student to their left]&quot;. The student to the right of the new student will write &quot;Next = [name of new student]&quot; on their card. <br /> <br /> Now we will practice deleting a student. The instructor will choose a student to be deleted. Starting at the head of the list, he will ask each student if their &quot;Data = [the chosen value]&quot;. If the answer is yes, the deleted student will pass the value of its &quot;Next&quot; to the student to their right. The student to their right will appropriately change their card, and the chosen student exits the list. Continue these exercises until the concept is understood.</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=CSC_216/s08/no_comparison&diff=11325 2008-04-20T18:42:17Z

<p>Jpcarter: </p> <hr /> <div>==Linked Lists in Person==<br /> <br /> This exercise will help students understand the structure of a linked list.<br /> <br /> ===The Problem===<br /> A linked list is a useful data structure but it can be very confusing for students first trying to grasp it. This interactive exercise should help students understand the concept. <br /> <br /> ===Participants and Props===<br /> <br /> To run this exercise, you will need at least 6 students and some paper and writing utensils. <br /> <br /> ===How to Execute===<br /> <br /> : Each student participating in the exercise has a card with &quot;Data = [name]&quot;, name being the name of the student, written on it. One student is chosen to be the head of the list. Three students are then lined up to the left of the head of the list in alphabetical order. Starting from the head, each student will write &quot;Next = [name of the person to their left]&quot; on their card. The last student in the list should write &quot;Next = null&quot; on their card. This setup represents a basic linked list. <br /> <br /> : Now we will practice inserting a new node. One of the remaining students will write &quot;Data = [name]&quot; on their card, and become the new node. The new node will ask if the first node is alphabetically before itself. If the answer is no, the new node will stand to the right of the first node. The new node will then write &quot;Next = [name of the first node]&quot; on his card. If the answer is yes, the new node will ask the next student in line until they receive a &quot;no&quot; answer or reach the end of the line, in which case they will stand at the end of the line write &quot;Next = null&quot;. After the student has found their place in the line, they will write &quot;Next = [name of the student to their left]&quot;. The student to the right of the new student will write &quot;Next = [name of new student]&quot; on their card. <br /> <br /> : Now we will practice deleting a student. The instructor will choose a student to be deleted. Starting at the head of the list, he will ask each student if their &quot;Data = [the chosen value]&quot;. If the answer is yes, the deleted student will pass the value of its &quot;Next&quot; to the student to their right. The student to their right will appropriately change their card, and the chosen student exits the list. Continue these exercises until the concept is understood.</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=CSC_216/s08/no_comparison&diff=11324 2008-04-20T18:41:52Z

<p>Jpcarter: </p> <hr /> <div>==Linked Lists in Person==<br /> <br /> This exercise will help students understand the structure of a linked list.<br /> <br /> ===The Problem===<br /> A linked list is a useful data structure but it can be very confusing for students first trying to grasp it. This interactive exercise should help students understand the concept. <br /> <br /> ===Participants and Props===<br /> <br /> To run this exercise, you will need at least 6 students and some paper and writing utensils. <br /> <br /> ===How to Execute===<br /> <br /> Each student participating in the exercise has a card with &quot;Data = [name]&quot;, name being the name of the student, written on it. One student is chosen to be the head of the list. Three students are then lined up to the left of the head of the list in alphabetical order. Starting from the head, each student will write &quot;Next = [name of the person to their left]&quot; on their card. The last student in the list should write &quot;Next = null&quot; on their card. This setup represents a basic linked list. <br /> <br /> Now we will practice inserting a new node. One of the remaining students will write &quot;Data = [name]&quot; on their card, and become the new node. The new node will ask if the first node is alphabetically before itself. If the answer is no, the new node will stand to the right of the first node. The new node will then write &quot;Next = [name of the first node]&quot; on his card. If the answer is yes, the new node will ask the next student in line until they receive a &quot;no&quot; answer or reach the end of the line, in which case they will stand at the end of the line write &quot;Next = null&quot;. After the student has found their place in the line, they will write &quot;Next = [name of the student to their left]&quot;. The student to the right of the new student will write &quot;Next = [name of new student]&quot; on their card. <br /> <br /> Now we will practice deleting a student. The instructor will choose a student to be deleted. Starting at the head of the list, he will ask each student if their &quot;Data = [the chosen value]&quot;. If the answer is yes, the deleted student will pass the value of its &quot;Next&quot; to the student to their right. The student to their right will appropriately change their card, and the chosen student exits the list. Continue these exercises until the concept is understood.</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=CSC_216/s08/no_comparison&diff=11323 2008-04-20T18:41:27Z

<p>Jpcarter: </p> <hr /> <div>==Linked Lists in Person==<br /> <br /> This exercise will help students understand the structure of a linked list.<br /> <br /> ===The Problem===<br /> A linked list is a useful data structure but it can be very confusing for students first trying to grasp it. This interactive exercise should help students understand the concept. <br /> <br /> ===Participants and Props===<br /> <br /> To run this exercise, you will need at least 6 students and some paper and writing utensils. <br /> <br /> ===How to Execute===<br /> <br /> Each student participating in the exercise has a card with &quot;Data = [name]&quot;, name being the name of the student, written on it. One student is chosen to be the head of the list. Three students are then lined up to the left of the head of the list in alphabetical order. Starting from the head, each student will write &quot;Next = [name of the person to their left]&quot; on their card. The last student in the list should write &quot;Next = null&quot; on their card. This setup represents a basic linked list. <br /> <br /> Now we will practice inserting a new node. One of the remaining students will write &quot;Data = [name]&quot; on their card, and become the new node. The new node will ask if the first node is alphabetically before itself. If the answer is no, the new node will stand to the right of the first node. The new node will then write &quot;Next = [name of the first node]&quot; on his card. If the answer is yes, the new node will ask the next student in line until they receive a &quot;no&quot; answer or reach the end of the line, in which case they will stand at the end of the line write &quot;Next = null&quot;. After the student has found their place in the line, they will write &quot;Next = [name of the student to their left]&quot;. The student to the right of the new student will write &quot;Next = [name of new student]&quot; on their card. <br /> <br /> Now we will practice deleting a student. The instructor will choose a student to be deleted. Starting at the head of the list, he will ask each student if their &quot;Data = [the chosen value]&quot;. If the answer is yes, the deleted student will pass the value of its &quot;Next&quot; to the student to their right. The student to their right will appropriately change their card, and the chosen student exits the list. Continue these exercises until the concept is understood.</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=CSC_216/s08/no_comparison&diff=11322 2008-04-20T18:40:17Z

<p>Jpcarter: </p> <hr /> <div>==Linked Lists in Person==<br /> <br /> This exercise will help students understand the structure of a linked list.<br /> <br /> ===The Problem===<br /> A linked list is a useful data structure but it can be very confusing for students first trying to grasp it. This interactive exercise should help students understand the concept. <br /> <br /> ===Participants and Props===<br /> <br /> To run this exercise, you will need at least 6 students and some paper and writing utensils. <br /> <br /> ===How to Execute===<br /> <br /> :Each student participating in the exercise has a card with &quot;Data = [name]&quot;, name being the name of the student, written on it. One student is chosen to be the head of the list. Three students are then lined up to the left of the head of the list in alphabetical order. Starting from the head, each student will write &quot;Next = [name of the person to their left]&quot; on their card. The last student in the list should write &quot;Next = null&quot; on their card. This setup represents a basic linked list. <br /> <br /> :Now we will practice inserting a new node. One of the remaining students will write &quot;Data = [name]&quot; on their card, and become the new node. The new node will ask if the first node is alphabetically before itself. If the answer is no, the new node will stand to the right of the first node. The new node will then write &quot;Next = [name of the first node]&quot; on his card. If the answer is yes, the new node will ask the next student in line until they receive a &quot;no&quot; answer or reach the end of the line, in which case they will stand at the end of the line write &quot;Next = null&quot;. After the student has found their place in the line, they will write &quot;Next = [name of the student to their left]&quot;. The student to the right of the new student will write &quot;Next = [name of new student]&quot; on their card. <br /> <br /> :Now we will practice deleting a student. The instructor will choose a student to be deleted. Starting at the head of the list, he will ask each student if their &quot;Data = [the chosen value]&quot;. If the answer is yes, the deleted student will pass the value of its &quot;Next&quot; to the student to their right. The student to their right will appropriately change their card, and the chosen student exits the list. Continue these exercises until the concept is understood.</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=CSC_216/s08/no_comparison&diff=11321 2008-04-20T18:38:01Z

<p>Jpcarter: </p> <hr /> <div>==Linked Lists in Person==<br /> <br /> This exercise will help students understand the structure of a linked list.<br /> <br /> ===The Problem===<br /> A linked list is a useful data structure but it can be very confusing for students first trying to grasp it. This interactive exercise should help students understand the concept. <br /> <br /> ===Participants and Props===<br /> <br /> To run this exercise, you will need at least 6 students and some paper and writing utensils. <br /> <br /> ===How to Execute===<br /> <br /> Each student participating in the exercise has a card with &quot;Data = [name]&quot;, name being the name of the student, written on it. One student is chosen to be the head of the list. Three students are then lined up to the left of the head of the list in alphabetical order. Starting from the head, each student will write &quot;Next = [name of the person to their left]&quot; on their card. The last student in the list should write &quot;Next = null&quot; on their card. This setup represents a basic linked list. <br /> <br /> Now we will practice inserting a new node. One of the remaining students will write &quot;Data = [name]&quot; on their card, and become the new node. The new node will ask if the first node is alphabetically before itself. If the answer is no, the new node will stand to the right of the first node. The new node will then write &quot;Next = [name of the first node]&quot; on his card. If the answer is yes, the new node will ask the next student in line until they receive a &quot;no&quot; answer or reach the end of the line, in which case they will stand at the end of the line write &quot;Next = null&quot;. After the student has found their place in the line, they will write &quot;Next = [name of the student to their left]&quot;. The student to the right of the new student will write &quot;Next = [name of new student]&quot; on their card. <br /> <br /> Now we will practice deleting a student. The instructor will choose a student to be deleted. Starting at the head of the list, he will ask each student if their &quot;Data = [the chosen value]&quot;. If the answer is yes, the deleted student will pass the value of its &quot;Next&quot; to the student to their right. The student to their right will appropriately change their card, and the chosen student exits the list. Continue these exercises until the concept is understood.</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=CSC_216/s08/no_comparison&diff=11320 2008-04-20T18:37:26Z

<p>Jpcarter: </p> <hr /> <div>==Linked Lists in Person==<br /> <br /> This exercise will help students understand the structure of a linked list.<br /> <br /> ===The Problem===<br /> A linked list is a useful data structure but it can be very confusing for students first trying to grasp it. This interactive exercise should help students understand the concept. <br /> <br /> ===Participants and Props===<br /> <br /> To run this exercise, you will need at least 6 students and some paper and writing utensils. <br /> <br /> ===How to Execute===<br /> <br /> Each student participating in the exercise has a card with &quot;Data = [name]&quot;, name being the name of the student, written on it. One student is chosen to be the head of the list. Three students are then lined up to the left of the head of the list in alphabetical order. Starting from the head, each student will write &quot;Next = [name of the person to their left]&quot; on their card. The last student in the list should write &quot;Next = null&quot; on their card. This setup represents a basic linked list. <br /> Now we will practice inserting a new node. One of the remaining students will write &quot;Data = [name]&quot; on their card, and become the new node. The new node will ask if the first node is alphabetically before itself. If the answer is no, the new node will stand to the right of the first node. The new node will then write &quot;Next = [name of the first node]&quot; on his card. If the answer is yes, the new node will ask the next student in line until they receive a &quot;no&quot; answer or reach the end of the line, in which case they will stand at the end of the line write &quot;Next = null&quot;. After the student has found their place in the line, they will write &quot;Next = [name of the student to their left]&quot;. The student to the right of the new student will write &quot;Next = [name of new student]&quot; on their card. <br /> Now we will practice deleting a student. The instructor will choose a student to be deleted. Starting at the head of the list, he will ask each student if their &quot;Data = [the chosen value]&quot;. If the answer is yes, the deleted student will pass the value of its &quot;Next&quot; to the student to their right. The student to their right will appropriately change their card, and the chosen student exits the list. Continue these exercises until the concept is understood.</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=CSC_216/s08/no_comparison&diff=11193 2008-04-15T20:57:52Z

<p>Jpcarter: </p> <hr /> <div>===Formatting Resources===<br /> [http://meta.wikimedia.org/wiki/Help:Wikitext_examples Formatting Help Guide from MetaWiki]<br /> <br /> ==Linked Lists in Person==<br /> <br /> This exercise will help students understand the structure of a linked list<br /> <br /> ===The problem===<br /> A linked list is a useful data structure but it can be very confusing for students first trying to grasp it. This interactive exercise should help students understand the concept. <br /> <br /> ===Participants and props===<br /> <br /> To run this exercise, you will need a class full of students and some paper and markers. <br /> <br /> ===The script===<br /> The instructor, or person leading the exercise will issue commands to the students. The first of these should be the creation of a node.</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=CSC_216/s08/no_comparison&diff=11182 2008-04-15T19:17:09Z

<p>Jpcarter: </p> <hr /> <div>===Formatting Resources===<br /> [http://meta.wikimedia.org/wiki/Help:Wikitext_examples Formatting Help Guide from MetaWiki]<br /> <br /> ==Linked Lists in Person==<br /> <br /> This exercise will help students understand the structure of a linked list<br /> <br /> ===The problem===<br /> A linked list is a useful data structure but it can be very confusing for students first trying to grasp it. This interactive exercise should help students understand the concept. <br /> <br /> ===Participants and props===<br /> <br /> To run this exercise, you will need a class full of students and some paper and markers. <br /> <br /> ===The script===<br /> First, explain the available commands.</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=CSC_216/s08/no_comparison&diff=11181 2008-04-15T18:57:24Z

<p>Jpcarter: </p> <hr /> <div>===Formatting Resources===<br /> [http://meta.wikimedia.org/wiki/Help:Wikitext_examples Formatting Help Guide from MetaWiki]<br /> <br /> ==Linked Lists in Person==<br /> <br /> This exercise will help students understand the structure of a linked list<br /> <br /> ===The problem===<br /> A linked list is a useful data structure but it can be very confusing for students first trying to grasp it. This interactive exercise should help students understand the concept. <br /> <br /> ===Participants and props===<br /> <br /> To run this exercise, you will need a class full of students and some paper and markers. <br /> <br /> ===The script===<br /> <br /> Describe how to do your exercise.</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=Csc_216/s08/high_virtue&diff=11041 2008-04-03T03:48:01Z

<p>Jpcarter: </p> <hr /> <div>==Interactive Debugging==<br /> <br /> This exercise illustrates stepping through a program line by line to debug it. It should help students understand the usefulness of a line by line approach to debugging like the one found in Eclipse. <br /> <br /> ===The Problem===<br /> <br /> A simple program is given below. Feel free to write your own programs to apply this exercise to as well. <br /> <br /> &lt;pre&gt;<br /> import java.util.Scanner;<br /> public class Debug {<br /> public static void main(String[] args) {<br /> System.out.println(&quot;Enter an integer&quot;);<br /> Scanner s = new Scanner(System.in);<br /> //this line should store the input in the variable x.<br /> int x = s.nextInt();<br /> //this line should add 5 to x.<br /> x = x+5;<br /> //this line should return the additive inverse of x<br /> x = -1*Math.abs(x);<br /> //this line should double the integer<br /> x = Math.round(x/2);<br /> //this line should print -2*(x+5).<br /> System.out.println(x);<br /> }<br /> }<br /> &lt;/pre&gt;<br /> <br /> ===Participants and Props===<br /> <br /> This exercise will require members of the class to act as lines of codes and one to be the programmer/ debugger. Cards with code on one side and comments on the other should be prepared before class. An example of a card for this program is given here: side 1 [http://pg-server.csc.ncsu.edu/mediawiki/index.php/Image:Side1.jpg] and side 2 [http://pg-server.csc.ncsu.edu/mediawiki/index.php/Image:Side2.jpg] . An object, such as a ball, that can be passed between students will be needed to represent a 'flag'. <br /> <br /> <br /> ===How to Play===<br /> <br /> Choose a programmer to run and debug the program. Choose several students to represent the lines of code in the program. Each student is handed a card with code on one side and the comment explaining what that code is supposed to be doing on the other side. The students who represent the lines of code should keep the side of the card with the code on it towards themselves and only show the programmer the side with the comments. The students stand in the order the code is supposed to come in. They then wait for the programmer to run them. The programmer passes a parameter of the correct type to the program. Each line of code then executes on the parameter given. Based upon the comments that the programmer is allowed to see and the parameter that he or she passed, they should be able to deduce what the desired, correct output should be. If the lines of code execute and the end result is different from what the programmer computed then it is necessary for the programmer to debug the program. The programmer will start debug mode and hand a flag, which represents the break point, to the first line of code. The first line of code will execute, and the rest of the program waits. The programmer can then query what the current value of the variable is. If satisfied the programmer will step to the next line of code, modeled by the chosen programmer saying, &quot;Pass the flag down to the next line.&quot; If not satisfied the programmer will ask the student to show him the code side of the card. The programmer will then make the necessary corrections and continue the debugging process.<br /> <br /> Here is a demonstration of the game:[http://courses.ncsu.edu/csc216/lec/002/video/g9/]</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=Csc_216/s08/high_virtue&diff=11038 2008-04-03T03:18:55Z

<p>Jpcarter: </p> <hr /> <div>==Interactive Debugging==<br /> <br /> This exercise illustrates stepping through a program line by line to debug it. It should help students understand the usefulness of a line by line approach to debugging like the one found in Eclipse. <br /> <br /> ===The Problem===<br /> <br /> A simple program is given below. Feel free to write your own programs to apply this exercise to as well. <br /> <br /> &lt;pre&gt;<br /> import java.util.Scanner;<br /> public class Debug {<br /> public static void main(String[] args) {<br /> System.out.println(&quot;Enter an integer&quot;);<br /> Scanner s = new Scanner(System.in);<br /> //this line should store the input in the variable x.<br /> int x = s.nextInt();<br /> //this line should add 5 to x.<br /> x = x+5;<br /> //this line should return the additive inverse of x<br /> x = -1*Math.abs(x);<br /> //this line should double the integer<br /> x = Math.round(x/2);<br /> //this line should print -2*(x+5).<br /> System.out.println(x);<br /> }<br /> }<br /> &lt;/pre&gt;<br /> <br /> ===Participants and Props===<br /> <br /> This exercise will require members of the class to act as lines of codes and one to be the programmer/ debugger. Cards with code on one side and comments on the other should be prepared before class. An example of a card for this program is given here: side 1 [http://pg-server.csc.ncsu.edu/mediawiki/index.php/Image:Side1.jpg] and side 2 [http://pg-server.csc.ncsu.edu/mediawiki/index.php/Image:Side2.jpg] . An object, such as a ball, that can be passed between students will be needed to represent a 'flag'. <br /> <br /> <br /> ===How to Play===<br /> <br /> Choose a programmer to run and debug the program. Choose several students to represent the lines of code in the program. Each student is handed a card with code on one side and the comment explaining what that code is supposed to be doing on the other side. The students who represent the lines of code should keep the side of the card with the code on it towards themselves and only show the programmer the side with the comments. The students stand in the order the code is supposed to come in. They then wait for the programmer to run them. The programmer passes a parameter of the correct type to the program. Each line of code then executes on the parameter given. Based upon the comments that the programmer is allowed to see and the parameter that he or she passed, they should be able to deduce what the desired, correct output should be. If the lines of code execute and the end result is different from what the programmer computed then it is necessary for the programmer to debug the program. The programmer will start debug mode and hand a flag, which represents the break point, to the first line of code. The first line of code will execute, and the rest of the program waits. The programmer can then query what the current value of the variable is. If satisfied the programmer will step to the next line of code, modeled by the chosen programmer saying, &quot;Pass the flag down to the next line.&quot; If not satisfied the programmer will ask the student to show him the code side of the card. The programmer will then make the necessary corrections and continue the debugging process.<br /> <br /> <br /> [[Media:Example.ogg]]</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=Csc_216/s08/high_virtue&diff=11031 2008-04-02T23:24:05Z

<p>Jpcarter: </p> <hr /> <div>==Interactive Debugging==<br /> <br /> This exercise illustrates stepping through a program line by line to debug it. It should help students understand the usefulness of a line by line approach to debugging like the one found in Eclipse. <br /> <br /> ===The Problem===<br /> <br /> A simple program is given below. Feel free to write your own programs to apply this exercise to as well. <br /> <br /> &lt;pre&gt;<br /> import java.util.Scanner;<br /> public class Debug {<br /> public static void main(String[] args) {<br /> System.out.println(&quot;Enter an integer&quot;);<br /> Scanner s = new Scanner(System.in);<br /> //this line should store the input in the variable x.<br /> int x = s.nextInt();<br /> //this line should add 5 to x.<br /> x = x+5;<br /> //this line should return the additive inverse of x<br /> x = -1*Math.abs(x);<br /> //this line should double the integer<br /> x = Math.round(x/2);<br /> //this line should print -2*(x+5).<br /> System.out.println(x);<br /> }<br /> }<br /> &lt;/pre&gt;<br /> <br /> ===Participants and Props===<br /> <br /> This exercise will require members of the class to act as lines of codes and one to be the programmer/ debugger. Cards with code on one side and comments on the other should be prepared before class. An example of a card for this program is given here: side 1 [http://pg-server.csc.ncsu.edu/mediawiki/index.php/Image:Side1.jpg] and side 2 [http://pg-server.csc.ncsu.edu/mediawiki/index.php/Image:Side2.jpg] . An object, such as a ball, that can be passed between students will be needed to represent a 'flag'. <br /> <br /> <br /> ===How to Play===<br /> <br /> Choose a programmer to run and debug the program. Choose several students to represent the lines of code in the program. Each student is handed a card with code on one side and the comment explaining what that code is supposed to be doing on the other side. The students who represent the lines of code should keep the side of the card with the code on it towards themselves and only show the programmer the side with the comments. The students stand in the order the code is supposed to come in. They then wait for the programmer to run them. The programmer passes a parameter of the correct type to the program. Each line of code then executes on the parameter given. Based upon the comments that the programmer is allowed to see and the parameter that he or she passed, they should be able to deduce what the desired, correct output should be. If the lines of code execute and the end result is different from what the programmer computed then it is necessary for the programmer to debug the program. The programmer will start debug mode and hand a flag, which represents the break point, to the first line of code. The first line of code will execute, and the rest of the program waits. The programmer can then query what the current value of the variable is. If satisfied the programmer will step to the next line of code, modeled by the chosen programmer saying, &quot;Pass the flag down to the next line.&quot; If not satisfied the programmer will ask the student to show him the code side of the card. The programmer will then make the necessary corrections and continue the debugging process.</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=Csc_216/s08/high_virtue&diff=11030 2008-04-02T23:22:58Z

<p>Jpcarter: </p> <hr /> <div>==Interactive Debugging==<br /> <br /> This exercise illustrates stepping through a program line by line to debug it. It should help students understand the usefulness of a line by line approach to debugging like the one found in Eclipse. <br /> <br /> ===The Problem===<br /> <br /> A simple program is given below. Feel free to write your own programs to apply this exercise to as well. <br /> <br /> &lt;nowiki&gt;<br /> import java.util.Scanner;<br /> public class Debug {<br /> public static void main(String[] args) {<br /> System.out.println(&quot;Enter an integer&quot;);<br /> Scanner s = new Scanner(System.in);<br /> //this line should store the input in the variable x.<br /> int x = s.nextInt();<br /> //this line should add 5 to x.<br /> x = x+5;<br /> //this line should return the additive inverse of x<br /> x = -1*Math.abs(x);<br /> //this line should double the integer<br /> x = Math.round(x/2);<br /> //this line should print -2*(x+5).<br /> System.out.println(x);<br /> }<br /> }<br /> &lt;/nowiki&gt;<br /> <br /> ===Participants and Props===<br /> <br /> This exercise will require members of the class to act as lines of codes and one to be the programmer/ debugger. Cards with code on one side and comments on the other should be prepared before class. An example of a card for this program is given here: side 1 [http://pg-server.csc.ncsu.edu/mediawiki/index.php/Image:Side1.jpg] and side 2 [http://pg-server.csc.ncsu.edu/mediawiki/index.php/Image:Side2.jpg] . An object, such as a ball, that can be passed between students will be needed to represent a 'flag'. <br /> <br /> <br /> ===How to Play===<br /> <br /> Choose a programmer to run and debug the program. Choose several students to represent the lines of code in the program. Each student is handed a card with code on one side and the comment explaining what that code is supposed to be doing on the other side. The students who represent the lines of code should keep the side of the card with the code on it towards themselves and only show the programmer the side with the comments. The students stand in the order the code is supposed to come in. They then wait for the programmer to run them. The programmer passes a parameter of the correct type to the program. Each line of code then executes on the parameter given. Based upon the comments that the programmer is allowed to see and the parameter that he or she passed, they should be able to deduce what the desired, correct output should be. If the lines of code execute and the end result is different from what the programmer computed then it is necessary for the programmer to debug the program. The programmer will start debug mode and hand a flag, which represents the break point, to the first line of code. The first line of code will execute, and the rest of the program waits. The programmer can then query what the current value of the variable is. If satisfied the programmer will step to the next line of code, modeled by the chosen programmer saying, &quot;Pass the flag down to the next line.&quot; If not satisfied the programmer will ask the student to show him the code side of the card. The programmer will then make the necessary corrections and continue the debugging process.</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=Csc_216/s08/high_virtue&diff=11029 2008-04-02T23:21:23Z

<p>Jpcarter: </p> <hr /> <div>==Interactive Debugging==<br /> <br /> This exercise illustrates stepping through a program line by line to debug it. It should help students understand the usefulness of a line by line approach to debugging like the one found in Eclipse. <br /> <br /> ===The Problem===<br /> <br /> A simple program is given below. Feel free to write your own programs to apply this exercise to as well. <br /> <br /> import java.util.Scanner;<br /> public class Debug {<br /> public static void main(String[] args) {<br /> System.out.println(&quot;Enter an integer&quot;);<br /> Scanner s = new Scanner(System.in);<br /> //this line should store the input in the variable x.<br /> int x = s.nextInt();<br /> //this line should add 5 to x.<br /> x = x+5;<br /> //this line should return the additive inverse of x<br /> x = -1*Math.abs(x);<br /> //this line should double the integer<br /> x = Math.round(x/2);<br /> //this line should print -2*(x+5).<br /> System.out.println(x);<br /> }<br /> }<br /> <br /> ===Participants and Props===<br /> <br /> This exercise will require members of the class to act as lines of codes and one to be the programmer/ debugger. Cards with code on one side and comments on the other should be prepared before class. An example of a card for this program is given here: side 1 [http://pg-server.csc.ncsu.edu/mediawiki/index.php/Image:Side1.jpg] and side 2 [http://pg-server.csc.ncsu.edu/mediawiki/index.php/Image:Side2.jpg] . An object, such as a ball, that can be passed between students will be needed to represent a 'flag'. <br /> <br /> <br /> ===How to Play===<br /> <br /> Choose a programmer to run and debug the program. Choose several students to represent the lines of code in the program. Each student is handed a card with code on one side and the comment explaining what that code is supposed to be doing on the other side. The students who represent the lines of code should keep the side of the card with the code on it towards themselves and only show the programmer the side with the comments. The students stand in the order the code is supposed to come in. They then wait for the programmer to run them. The programmer passes a parameter of the correct type to the program. Each line of code then executes on the parameter given. Based upon the comments that the programmer is allowed to see and the parameter that he or she passed, they should be able to deduce what the desired, correct output should be. If the lines of code execute and the end result is different from what the programmer computed then it is necessary for the programmer to debug the program. The programmer will start debug mode and hand a flag, which represents the break point, to the first line of code. The first line of code will execute, and the rest of the program waits. The programmer can then query what the current value of the variable is. If satisfied the programmer will step to the next line of code, modeled by the chosen programmer saying, &quot;Pass the flag down to the next line.&quot; If not satisfied the programmer will ask the student to show him the code side of the card. The programmer will then make the necessary corrections and continue the debugging process.</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=Csc_216/s08/high_virtue&diff=11028 2008-04-02T23:19:37Z

<p>Jpcarter: </p> <hr /> <div>==Interactive Debugging==<br /> <br /> This exercise illustrates stepping through a program line by line to debug it. It should help students understand the usefulness of a line by line approach to debugging like the one found in Eclipse. <br /> <br /> ===The Problem===<br /> <br /> A simple program is given below. Feel free to write your own programs to apply this exercise to as well. <br /> <br /> import java.util.Scanner;<br /> public class Debug {<br /> public static void main(String[] args) {<br /> System.out.println(&quot;Enter an integer&quot;);<br /> Scanner s = new Scanner(System.in);<br /> //this line should store the input in the variable x.<br /> int x = s.nextInt();<br /> //this line should add 5 to x.<br /> x = x+5;<br /> //this line should return the additive inverse of x<br /> x = -1*Math.abs(x);<br /> //this line should double the integer<br /> x = Math.round(x/2);<br /> //this line should print -2*(x+5).<br /> System.out.println(x);<br /> }<br /> }<br /> <br /> ===Participants and Props===<br /> <br /> This exercise will require members of the class to act as lines of codes and one to be the programmer/ debugger. Cards with code on one side and comments on the other should be prepared before class. An example of a card for this program is given here: side 1 [http://pg-server.csc.ncsu.edu/mediawiki/index.php/Image:Side1.jpg] and side 2 [http://pg-server.csc.ncsu.edu/mediawiki/index.php/Image:Side2.jpg] . An object, such as a ball, that can be passed between students will be needed to represent a 'flag'. <br /> <br /> <br /> ===How to Play===<br /> <br /> Choose a programmer to run and debug the program. Choose several students to represent the lines of code in the program. Each student is handed a card with code on one side and the comment explaining what that code is supposed to be doing on the other side. The students who represent the lines of code should keep the side of the card with the code on it towards themselves and only show the programmer the side with the comments. The students stand in the order the code is supposed to come in. They then wait for the programmer to run them. The programmer passes a parameter of the correct type to the program. Each line of code then executes on the parameter given. Based upon the comments that the programmer is allowed to see and the parameter that he or she passed, they should be able to deduce what the desired, correct output should be. If the lines of code execute and the end result is different from what the programmer computed then it is necessary for the programmer to debug the program. The programmer will start debug mode and hand a flag, which represents the break point, to the first line of code. The first line of code will execute, and the rest of the program waits. The programmer can then query what the current value of the variable is. If satisfied the programmer will step to the next line of code, modeled by the chosen programmer saying, &quot;Pass the flag down to the next line.&quot; If not satisfied the programmer will ask the student to show him the code side of the card. The programmer will then make the necessary corrections and continue the debugging process.</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=Csc_216/s08/high_virtue&diff=11027 2008-04-02T23:13:21Z

<p>Jpcarter: </p> <hr /> <div>==Interactive Debugging==<br /> <br /> This exercise illustrates stepping through a program line by line to debug it.<br /> <br /> ===The Problem===<br /> <br /> The exercise uses a simple program to help students understand the process of debugging. A simple program is given after the description of the exercise. You should also feel free to here[http://pg-server.csc.ncsu.edu/mediawiki/index.php/Image:Side3.jpg] but many more could be designed.<br /> <br /> ===Participants and Props===<br /> <br /> This exercise will require members of the class to act as lines of codes and one to be the programmer/ debugger. Cards with code on one side and comments on the other should be prepared before class. An example of a card for this program is given here: side 1 [http://pg-server.csc.ncsu.edu/mediawiki/index.php/Image:Side1.jpg] and side 2 [http://pg-server.csc.ncsu.edu/mediawiki/index.php/Image:Side2.jpg] . An object, such as a ball, that can be passed between students will be needed to represent a 'flag'. <br /> <br /> <br /> ===How to Play===<br /> <br /> Choose a programmer to run and debug the program. Choose several students to represent the lines of code in the program. Each student is handed a card with code on one side and the comment explaining what that code is supposed to be doing on the other side. The students who represent the lines of code should keep the side of the card with the code on it towards themselves and only show the programmer the side with the comments. The students stand in the order the code is supposed to come in. They then wait for the programmer to run them. The programmer passes a parameter of the correct type to the program. Each line of code then executes on the parameter given. Based upon the comments that the programmer is allowed to see and the parameter that he or she passed, they should be able to deduce what the desired, correct output should be. If the lines of code execute and the end result is different from what the programmer computed then it is necessary for the programmer to debug the program. The programmer will start debug mode and hand a flag, which represents the break point, to the first line of code. The first line of code will execute, and the rest of the program waits. The programmer can the query what the current value of the variable is. If satisfied the programmer will step to the next line of code, modeled by the chosen programmer saying, &quot;Pass the flag down to the next line.&quot; If not satisfied the programmer will ask the student to show him the code side of the card. The programmer will then make the necessary corrections and continue the debugging process.</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=File:Side3.jpg&diff=10997 2008-04-02T15:04:52Z

<p>Jpcarter: </p> <hr /> <div></div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=File:Side3.jpg&diff=10996 2008-04-02T15:03:28Z

<p>Jpcarter: </p> <hr /> <div>import java.util.Scanner;<br /> public class Debug {<br /> <br /> public static void main(String[] args) {<br /> System.out.println(&quot;Enter an integer&quot;);<br /> Scanner s = new Scanner(System.in);<br /> //this line should store the input in the variable x.<br /> int x = s.nextInt();<br /> //this line should add 5 to x.<br /> x = x+5;<br /> //this line should return the additive inverse of x<br /> x = -1*Math.abs(x);<br /> //this line should double the integer<br /> x = Math.round(x/2);<br /> //this line should print -2*(x+5).<br /> System.out.println(x);<br /> }<br /> <br /> }</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=Csc_216/s08/high_virtue&diff=10653 2008-03-25T23:33:59Z

<p>Jpcarter: </p> <hr /> <div>==Interactive Debugging==<br /> <br /> This exercise illustrates stepping through a program line by line to debug it.<br /> <br /> ===The Problem===<br /> <br /> A simple example program is given here[http://pg-server.csc.ncsu.edu/mediawiki/index.php/Image:Side3.jpg] but many more could be designed.<br /> <br /> ===Participants and Props===<br /> <br /> This exercise will require members of the class to act as lines of codes and one to be the programmer/ debugger. Cards with code on one side and comments on the other should be prepared before class. An example of a card for this program is given here: side 1 [http://pg-server.csc.ncsu.edu/mediawiki/index.php/Image:Side1.jpg] and side 2 [http://pg-server.csc.ncsu.edu/mediawiki/index.php/Image:Side2.jpg] . An object, such as a ball, that can be passed between students will be needed to represent a 'flag'. <br /> <br /> <br /> ===How to Play===<br /> <br /> Choose a programmer to run and debug the program. Choose several students to represent the lines of code in the program. Each student is handed a card with code on one side and the comment explaining what that code is supposed to be doing on the other side. The students who represent the lines of code should keep the side of the card with the code on it towards themselves and only show the programmer the side with the comments. The students stand in the order the code is supposed to come in. They then wait for the programmer to run them. The programmer passes a parameter of the correct type to the program. Each line of code then executes on the parameter given. Based upon the comments that the programmer is allowed to see and the parameter that he or she passed, they should be able to deduce what the desired, correct output should be. If the lines of code execute and the end result is different from what the programmer computed then it is necessary for the programmer to debug the program. The programmer will start debug mode and hand a flag, which represents the break point, to the first line of code. The first line of code will execute, and the rest of the program waits. The programmer can the query what the current value of the variable is. If satisfied the programmer will step to the next line of code, modeled by the chosen programmer saying, &quot;Pass the flag down to the next line.&quot; If not satisfied the programmer will ask the student to show him the code side of the card. The programmer will then make the necessary corrections and continue the debugging process.</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=Csc_216/s08/high_virtue&diff=10651 2008-03-25T21:55:36Z

<p>Jpcarter: </p> <hr /> <div>==Interactive Debugging==<br /> <br /> This exercise illustrates stepping through a program line by line to debug it.<br /> <br /> ===The Problem===<br /> <br /> A simple example program is given here[http://pg-server.csc.ncsu.edu/mediawiki/index.php/Image:Side3.jpg] but many more could be designed.<br /> <br /> ===Participants and Props===<br /> <br /> This exercise will require members of the class to act as lines of codes and one to be the programmer/ debugger. Cards with code on one side and comments on the other should be prepared before class. An example of a card for this program is given here: side 1 [http://pg-server.csc.ncsu.edu/mediawiki/index.php/Image:Side1.jpg] and side 2 [http://pg-server.csc.ncsu.edu/mediawiki/index.php/Image:Side2.jpg] .<br /> <br /> <br /> ===The Script===<br /> <br /> Pick one student to be the programmer. Pick other students to represent lines of code, as many students as cards. It would be helpful to display the entire program on a screen for the whole class to see. <br /> <br /> The programmer should place a flag where they think the program's problems start, likely with the first line of code represented by a student. Model this by having the student lines of code pass a ball or flag. <br /> The programmer should be able to read the comments on the card but not the code which is on the back side of the card. The programmer can ask the student line of code for the current value of any variables of interest, in this example, x. If the value is not what is expected, the programmer will know to change this line of code. <br /> When satisfied with one line, the programmer should ask to step to the next line. The student line of code will then pass the ball/ flag to the next student line of code. Again, the programmer can ask for the current value of any variables. Continue stepping through the program and editing lines as you move along until the end is reached.<br /> The programmer will need to try several inputs to ensure all bugs are removed.</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=File:Side3.jpg&diff=10650 2008-03-25T21:54:54Z

<p>Jpcarter: </p> <hr /> <div></div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=Csc_216/s08/high_virtue&diff=10649 2008-03-25T21:53:43Z

<p>Jpcarter: </p> <hr /> <div>==Interactive Debugging==<br /> <br /> This exercise illustrates stepping through a program line by line to debug it.<br /> <br /> ===The Problem===<br /> <br /> A simple example program is given here[[Image:side3.jpg]] but many more could be designed.<br /> <br /> ===Participants and Props===<br /> <br /> This exercise will require members of the class to act as lines of codes and one to be the programmer/ debugger. Cards with code on one side and comments on the other should be prepared before class. An example of a card for this program is given here: side 1 [http://pg-server.csc.ncsu.edu/mediawiki/index.php/Image:Side1.jpg] and side 2 [http://pg-server.csc.ncsu.edu/mediawiki/index.php/Image:Side2.jpg] .<br /> <br /> <br /> ===The Script===<br /> <br /> Pick one student to be the programmer. Pick other students to represent lines of code, as many students as cards. It would be helpful to display the entire program on a screen for the whole class to see. <br /> <br /> The programmer should place a flag where they think the program's problems start, likely with the first line of code represented by a student. Model this by having the student lines of code pass a ball or flag. <br /> The programmer should be able to read the comments on the card but not the code which is on the back side of the card. The programmer can ask the student line of code for the current value of any variables of interest, in this example, x. If the value is not what is expected, the programmer will know to change this line of code. <br /> When satisfied with one line, the programmer should ask to step to the next line. The student line of code will then pass the ball/ flag to the next student line of code. Again, the programmer can ask for the current value of any variables. Continue stepping through the program and editing lines as you move along until the end is reached.<br /> The programmer will need to try several inputs to ensure all bugs are removed.</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=Csc_216/s08/high_virtue&diff=10648 2008-03-25T21:48:40Z

<p>Jpcarter: </p> <hr /> <div>==Interactive Debugging==<br /> <br /> This exercise illustrates stepping through a program line by line to debug it.<br /> <br /> ===The Problem===<br /> <br /> A simple example program is given here but many more could be designed.<br /> <br /> ===Participants and Props===<br /> <br /> This exercise will require members of the class to act as lines of codes and one to be the programmer/ debugger. Cards with code on one side and comments on the other should be prepared before class. An example of a card for this program is given here: side 1 [http://pg-server.csc.ncsu.edu/mediawiki/index.php/Image:Side1.jpg] and side 2 [http://pg-server.csc.ncsu.edu/mediawiki/index.php/Image:Side2.jpg] .<br /> <br /> <br /> ===The Script===<br /> <br /> Pick one student to be the programmer. Pick other students to represent lines of code, as many students as cards. It would be helpful to display the entire program on a screen for the whole class to see. <br /> <br /> The programmer should place a flag where they think the program's problems start, likely with the first line of code represented by a student. Model this by having the student lines of code pass a ball or flag. <br /> The programmer should be able to read the comments on the card but not the code which is on the back side of the card. The programmer can ask the student line of code for the current value of any variables of interest, in this example, x. If the value is not what is expected, the programmer will know to change this line of code. <br /> When satisfied with one line, the programmer should ask to step to the next line. The student line of code will then pass the ball/ flag to the next student line of code. Again, the programmer can ask for the current value of any variables. Continue stepping through the program and editing lines as you move along until the end is reached.<br /> The programmer will need to try several inputs to ensure all bugs are removed.</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=File:Side2.jpg&diff=10647 2008-03-25T21:48:10Z

<p>Jpcarter: </p> <hr /> <div></div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=Csc_216/s08/high_virtue&diff=10646 2008-03-25T21:47:19Z

<p>Jpcarter: </p> <hr /> <div>==Interactive Debugging==<br /> <br /> This exercise illustrates stepping through a program line by line to debug it.<br /> <br /> ===The Problem===<br /> <br /> A simple example program is given here but many more could be designed.<br /> <br /> ===Participants and Props===<br /> <br /> This exercise will require members of the class to act as lines of codes and one to be the programmer/ debugger. Cards with code on one side and comments on the other should be prepared before class. An example of a card for this program is given here: side 1 [http://pg-server.csc.ncsu.edu/mediawiki/index.php/Image:Side1.jpg] and side 2 [[Image:side2.jpg]] .<br /> <br /> <br /> ===The Script===<br /> <br /> Pick one student to be the programmer. Pick other students to represent lines of code, as many students as cards. It would be helpful to display the entire program on a screen for the whole class to see. <br /> <br /> The programmer should place a flag where they think the program's problems start, likely with the first line of code represented by a student. Model this by having the student lines of code pass a ball or flag. <br /> The programmer should be able to read the comments on the card but not the code which is on the back side of the card. The programmer can ask the student line of code for the current value of any variables of interest, in this example, x. If the value is not what is expected, the programmer will know to change this line of code. <br /> When satisfied with one line, the programmer should ask to step to the next line. The student line of code will then pass the ball/ flag to the next student line of code. Again, the programmer can ask for the current value of any variables. Continue stepping through the program and editing lines as you move along until the end is reached.<br /> The programmer will need to try several inputs to ensure all bugs are removed.</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=Csc_216/s08/high_virtue&diff=10645 2008-03-25T21:46:56Z

<p>Jpcarter: </p> <hr /> <div>==Interactive Debugging==<br /> <br /> This exercise illustrates stepping through a program line by line to debug it.<br /> <br /> ===The Problem===<br /> <br /> A simple example program is given here but many more could be designed.<br /> <br /> ===Participants and Props===<br /> <br /> This exercise will require members of the class to act as lines of codes and one to be the programmer/ debugger. Cards with code on one side and comments on the other should be prepared before class. An example of a card for this program is given here: side 1 [http://pg-server.csc.ncsu.edu/mediawiki/index.php/Image:Side1.jpg] and side 2 .<br /> <br /> <br /> ===The Script===<br /> <br /> Pick one student to be the programmer. Pick other students to represent lines of code, as many students as cards. It would be helpful to display the entire program on a screen for the whole class to see. <br /> <br /> The programmer should place a flag where they think the program's problems start, likely with the first line of code represented by a student. Model this by having the student lines of code pass a ball or flag. <br /> The programmer should be able to read the comments on the card but not the code which is on the back side of the card. The programmer can ask the student line of code for the current value of any variables of interest, in this example, x. If the value is not what is expected, the programmer will know to change this line of code. <br /> When satisfied with one line, the programmer should ask to step to the next line. The student line of code will then pass the ball/ flag to the next student line of code. Again, the programmer can ask for the current value of any variables. Continue stepping through the program and editing lines as you move along until the end is reached.<br /> The programmer will need to try several inputs to ensure all bugs are removed.</div>

Jpcarter https://wiki.expertiza.ncsu.edu/index.php?title=Csc_216/s08/high_virtue&diff=10644 2008-03-25T21:46:25Z

<p>Jpcarter: </p> <hr /> <div>==Interactive Debugging==<br /> <br /> This exercise illustrates stepping through a program line by line to debug it.<br /> <br /> ===The Problem===<br /> <br /> A simple example program is given here but many more could be designed.<br /> <br /> ===Participants and Props===<br /> <br /> This exercise will require members of the class to act as lines of codes and one to be the programmer/ debugger. Cards with code on one side and comments on the other should be prepared before class. An example of a card for this program is given here: side 1 [http://pg-server.csc.ncsu.edu/mediawiki/index.php/Image:Side1.jpg] and side 1 .<br /> <br /> <br /> ===The Script===<br /> <br /> Pick one student to be the programmer. Pick other students to represent lines of code, as many students as cards. It would be helpful to display the entire program on a screen for the whole class to see. <br /> <br /> The programmer should place a flag where they think the program's problems start, likely with the first line of code represented by a student. Model this by having the student lines of code pass a ball or flag. <br /> The programmer should be able to read the comments on the card but not the code which is on the back side of the card. The programmer can ask the student line of code for the current value of any variables of interest, in this example, x. If the value is not what is expected, the programmer will know to change this line of code. <br /> When satisfied with one line, the programmer should ask to step to the next line. The student line of code will then pass the ball/ flag to the next student line of code. Again, the programmer can ask for the current value of any variables. Continue stepping through the program and editing lines as you move along until the end is reached.<br /> The programmer will need to try several inputs to ensure all bugs are removed.</div>

Jpcarter