Expertiza_Wiki - User contributions [en]

CSC 216/s08/no comparison

2008-04-21T03:14:32Z

Jleray:

==Linked Lists in Person==

This exercise will help students understand the structure of a linked list.

===The Problem===
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.

===Participants and Props===

To run this exercise, you will need at least 6 students and some paper and writing utensils.

===How to Execute===
====Set-up====

Each student participating in the exercise has a card with "Data = [name]", 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 "Next = [name of the person to their left]" on their card. The last student in the list should write "Next = null" on their card. This setup represents a basic linked list.

[http://pg-server.csc.ncsu.edu/mediawiki/index.php/Image:Java5.jpg Here] is an example card.

====Insertion====
Now we will practice inserting a new node. One of the remaining students will write "Data = [name]" 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 "Next = [name of the first node]" on his card. If the answer is yes, the new node will ask the next student in line until they receive a "no" answer or reach the end of the line, in which case they will stand at the end of the line write "Next = null". After the student has found their place in the line, they will write "Next = [name of the student to their left]". The student to the right of the new student will write
"Next = [name of new student]" on their card.

====Deletion====
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 "Data = [the chosen value]". If the answer is yes, the deleted student will pass the value of its "Next" 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.

====Demonstration====

[http://courses.ncsu.edu/csc216/lec/002/video/t13/ Here] is a demonstration of the exercise.

CSC 216/s08/no comparison

2008-04-20T18:58:04Z

Jleray: /* Insertion */

==Linked Lists in Person==

This exercise will help students understand the structure of a linked list.

===The Problem===
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.

===Participants and Props===

To run this exercise, you will need at least 6 students and some paper and writing utensils.

===How to Execute===
====Set-up====

Each student participating in the exercise has a card with "Data = [name]", 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 "Next = [name of the person to their left]" on their card. The last student in the list should write "Next = null" on their card. This setup represents a basic linked list.
====Insertion====
Now we will practice inserting a new node. One of the remaining students will write "Data = [name]" 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 "Next = [name of the first node]" on his card. If the answer is yes, the new node will ask the next student in line until they receive a "no" answer or reach the end of the line, in which case they will stand at the end of the line write "Next = null". After the student has found their place in the line, they will write "Next = [name of the student to their left]". The student to the right of the new student will write
"Next = [name of new student]" on their card.

====Deletion====
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 "Data = [the chosen value]". If the answer is yes, the deleted student will pass the value of its "Next" 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.

CSC 216/s08/no comparison

2008-04-16T01:51:04Z

Jleray:

==Linked Lists in Person==

This exercise will help students understand the structure of a linked list.

===The Problem===
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.

===Participants and Props===

To run this exercise, you will need at least 6 students and some paper and writing utensils.

===How to Execute===

Each student participating in the exercise has a card with "Data = [name]", 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 "Next = [name of the person to their left]" on their card. The last student in the list should write "Next = null" on their card. This setup represents a basic linked list. Now we will practice inserting a new node. One of the remaining students will write "Data = [name]" 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 "Next = [name of the first node]" on his card. If the answer is yes, the new node will ask the next student in line until they receive a "no" answer or reach the end of the line, in which case they will stand at the end of the line write "Next = null". After the student has found their place in the line, they will write "Next = [name of the student to their left]". The student to the right of the new student will write "Next = [name of new student]" on their card. 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 "Data = [the chosen value]". If the answer is yes, the deleted student will pass the value of its "Next" 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.

CSC 216/s08/no comparison

2008-04-16T01:50:48Z

Jleray:

==Linked Lists in Person==

This exercise will help students understand the structure of a linked list

===The problem===
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.

===Participants and props===

To run this exercise, you will need at least 6 students and some paper and writing utensils.

===How to Execute===

Each student participating in the exercise has a card with "Data = [name]", 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 "Next = [name of the person to their left]" on their card. The last student in the list should write "Next = null" on their card. This setup represents a basic linked list. Now we will practice inserting a new node. One of the remaining students will write "Data = [name]" 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 "Next = [name of the first node]" on his card. If the answer is yes, the new node will ask the next student in line until they receive a "no" answer or reach the end of the line, in which case they will stand at the end of the line write "Next = null". After the student has found their place in the line, they will write "Next = [name of the student to their left]". The student to the right of the new student will write "Next = [name of new student]" on their card. 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 "Data = [the chosen value]". If the answer is yes, the deleted student will pass the value of its "Next" 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.

CSC 216/s08/no comparison

2008-04-16T01:50:16Z

Jleray:

===Formatting Resources===
[http://meta.wikimedia.org/wiki/Help:Wikitext_examples Formatting Help Guide from MetaWiki]

==Linked Lists in Person==

This exercise will help students understand the structure of a linked list

===The problem===
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.

===Participants and props===

To run this exercise, you will need at least 6 students and some paper and writing utensils.

===How to Employ the Exercise===

Each student participating in the exercise has a card with "Data = [name]", 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 "Next = [name of the person to their left]" on their card. The last student in the list should write "Next = null" on their card. This setup represents a basic linked list. Now we will practice inserting a new node. One of the remaining students will write "Data = [name]" 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 "Next = [name of the first node]" on his card. If the answer is yes, the new node will ask the next student in line until they receive a "no" answer or reach the end of the line, in which case they will stand at the end of the line write "Next = null". After the student has found their place in the line, they will write "Next = [name of the student to their left]". The student to the right of the new student will write "Next = [name of new student]" on their card. 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 "Data = [the chosen value]". If the answer is yes, the deleted student will pass the value of its "Next" 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.

CSC 216/s08/no comparison

2008-04-16T01:50:08Z

Jleray:

CSC 216/s08/no comparison

2008-04-16T01:45:39Z

Jleray:

===Formatting Resources===
[http://meta.wikimedia.org/wiki/Help:Wikitext_examples Formatting Help Guide from MetaWiki]

==Linked Lists in Person==

This exercise will help students understand the structure of a linked list

===The problem===
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.

===Participants and props===

To run this exercise, you will need at least 6 students and some paper and writing utensils.

===How to Employ the Exercise===

Each student participating in the exercise has a card with "Data = [name]", 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 person will write "Next = [name of the person to their left]" on their card. This setup represents a basic linked list. Now we will practice inserting a new node. One of the remaining students will write "Data = [name]" 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 "Next = [name of the first node]" on his card. If the answer is yes, the new node will ask the next student in line until they receive a "no" answer or reach the end of the line. After the student has found their place in the line, they will write "Next = [name of the student to their left]". The student to the right of the new student will write "Next = [name of new student]" on their card. 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 "Data = [the chosen value]". If the answer is yes, the deleted student will pass the value of its "Next" to the student to their right. The student to their right will appropriately change their card, and the chosen student exits the list.

Csc 216/s08/high virtue

2008-04-04T03:15:51Z

Jleray:

==Interactive Debugging==

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.

===The Problem===

A simple program is given below. Feel free to write your own programs to apply this exercise to as well.

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

===Participants and Props===

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: [http://pg-server.csc.ncsu.edu/mediawiki/index.php/Image:Side1.jpg Side 1] and [http://pg-server.csc.ncsu.edu/mediawiki/index.php/Image:Side2.jpg Side 2]. An object, such as a ball, that can be passed between students will be needed to represent a 'flag'.

===How to Play===

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, "Pass the flag down to the next line." 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.

Here is a demonstration of the game: [http://courses.ncsu.edu/csc216/lec/002/video/g9/ Debugging Demonstration]

Csc 216/s08/high virtue

2008-04-04T03:14:11Z

Jleray:

==Interactive Debugging==

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.

===The Problem===

A simple program is given below. Feel free to write your own programs to apply this exercise to as well.

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

===Participants and Props===

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'.

===How to Play===

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, "Pass the flag down to the next line." 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.

Here is a demonstration of the game: [http://courses.ncsu.edu/csc216/lec/002/video/g9/ Debugging Demonstration]

Csc 216/s08/high virtue

2008-04-04T03:13:49Z

Jleray:

==Interactive Debugging==

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.

===The Problem===

A simple program is given below. Feel free to write your own programs to apply this exercise to as well.

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

===Participants and Props===

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'.

===How to Play===

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, "Pass the flag down to the next line." 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.

Here is a demonstration of the game:[http://courses.ncsu.edu/csc216/lec/002/video/g9/ Debugging Demonstration]

Csc 216/s08/high virtue

2008-03-25T23:24:07Z

Jleray:

==Interactive Debugging==

This exercise illustrates stepping through a program line by line to debug it.

===The Problem===

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.

===Participants and Props===

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] .

===How to Play===

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, "Pass the flag down to the next line." 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.