Expertiza_Wiki - User contributions [en]

CSC 216 F09/Survivor: Java

2009-11-17T18:17:53Z

Jpkuell: /* Survivor: Java */

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

==Survivor: Java==

Survivor: Java is a (not so) one of a kind learning exercise. Created by James Kuell and Lu Lan. 
 
http://www.youtube.com/watch?v=Wz7tYNwi5WQ 

===The problem===

This exercise is aimed to review what the students have learned in CSC 116. As such, this learning exercise is used to review many basic and important concepts of Java.

===Participants and props===

This exercise can be played with any number of participants above two. However, this game is recommended to be played with a set of seven groups. Each group should consist of more than two people. There is no need for props, unless the professor wants to give prizes as rewards.

===The Rules===

1. Students will organize themselves into teams of two or more. 
2. Each team picks one individual to represent the entire team. 
3. The representatives will make a line in the front of the room. 
4. Each representative is asked a question and given 25 seconds to answer. 
5. If the representative cannot answer the question correctly, they return back to their seats, and the next person in line is asked the same question. 
6. Each representative is given 2 "Lifelines" in which they can use at any time. 
7. A "Lifeline" allows the representative to ask any member of their team the question they have been presented with. 
8. The last person still standing at the front of the room wins. 
 
Note: In the event that there is more than one person standing and the professor runs out of questions, we suggest the following: 
 
1. Taking turns, each remaining representative's team asks the next representative one question. If the team cannot think of a question, their representative is eliminated. Otherwise, if the next representative answers the question wrong, he/she is eliminated. If he/she answered it correctly, his/her team will ask the next representative a new question. 
 
Note: The team asking the question must know the answer to their question, or else their representative is eliminated. 
 
2. This continues until there is only one person left, the winner!!! 
 
Congratulation, you just finished Survivor: Java.

CSC 216 F09/Survivor: Java

2009-11-17T18:17:42Z

Jpkuell: /* Survivor: Java */

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

==Survivor: Java==

Survivor: Java is a (not so) one of a kind learning exercise. Created by James Kuell and Lu Lan.
 
http://www.youtube.com/watch?v=Wz7tYNwi5WQ 

===The problem===

This exercise is aimed to review what the students have learned in CSC 116. As such, this learning exercise is used to review many basic and important concepts of Java.

===Participants and props===

This exercise can be played with any number of participants above two. However, this game is recommended to be played with a set of seven groups. Each group should consist of more than two people. There is no need for props, unless the professor wants to give prizes as rewards.

===The Rules===

1. Students will organize themselves into teams of two or more. 
2. Each team picks one individual to represent the entire team. 
3. The representatives will make a line in the front of the room. 
4. Each representative is asked a question and given 25 seconds to answer. 
5. If the representative cannot answer the question correctly, they return back to their seats, and the next person in line is asked the same question. 
6. Each representative is given 2 "Lifelines" in which they can use at any time. 
7. A "Lifeline" allows the representative to ask any member of their team the question they have been presented with. 
8. The last person still standing at the front of the room wins. 
 
Note: In the event that there is more than one person standing and the professor runs out of questions, we suggest the following: 
 
1. Taking turns, each remaining representative's team asks the next representative one question. If the team cannot think of a question, their representative is eliminated. Otherwise, if the next representative answers the question wrong, he/she is eliminated. If he/she answered it correctly, his/her team will ask the next representative a new question. 
 
Note: The team asking the question must know the answer to their question, or else their representative is eliminated. 
 
2. This continues until there is only one person left, the winner!!! 
 
Congratulation, you just finished Survivor: Java.

CSC 216 F09/Survivor: Java

2009-11-17T18:17:22Z

Jpkuell: /* The Rules */

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

==Survivor: Java==

Survivor: Java is a (not so) one of a kind learning exercise. Created by James Kuell and Lu Lan.

===The problem===

This exercise is aimed to review what the students have learned in CSC 116. As such, this learning exercise is used to review many basic and important concepts of Java.

===Participants and props===

This exercise can be played with any number of participants above two. However, this game is recommended to be played with a set of seven groups. Each group should consist of more than two people. There is no need for props, unless the professor wants to give prizes as rewards.

===The Rules===

1. Students will organize themselves into teams of two or more. 
2. Each team picks one individual to represent the entire team. 
3. The representatives will make a line in the front of the room. 
4. Each representative is asked a question and given 25 seconds to answer. 
5. If the representative cannot answer the question correctly, they return back to their seats, and the next person in line is asked the same question. 
6. Each representative is given 2 "Lifelines" in which they can use at any time. 
7. A "Lifeline" allows the representative to ask any member of their team the question they have been presented with. 
8. The last person still standing at the front of the room wins. 
 
Note: In the event that there is more than one person standing and the professor runs out of questions, we suggest the following: 
 
1. Taking turns, each remaining representative's team asks the next representative one question. If the team cannot think of a question, their representative is eliminated. Otherwise, if the next representative answers the question wrong, he/she is eliminated. If he/she answered it correctly, his/her team will ask the next representative a new question. 
 
Note: The team asking the question must know the answer to their question, or else their representative is eliminated. 
 
2. This continues until there is only one person left, the winner!!! 
 
Congratulation, you just finished Survivor: Java.

CSC 216 F09/Survivor: Java

2009-11-17T18:16:56Z

Jpkuell: /* The Rules */

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

==Survivor: Java==

Survivor: Java is a (not so) one of a kind learning exercise. Created by James Kuell and Lu Lan.

===The problem===

This exercise is aimed to review what the students have learned in CSC 116. As such, this learning exercise is used to review many basic and important concepts of Java.

===Participants and props===

This exercise can be played with any number of participants above two. However, this game is recommended to be played with a set of seven groups. Each group should consist of more than two people. There is no need for props, unless the professor wants to give prizes as rewards.

===The Rules===

1. Students will organize themselves into teams of two or more. 
2. Each team picks one individual to represent the entire team. 
3. The representatives will make a line in the front of the room. 
4. Each representative is asked a question and given 25 seconds to answer. 
5. If the representative cannot answer the question correctly, they return back to their seats, and the next person in line is asked the same question. 
6. Each representative is given 2 "Lifelines" in which they can use at any time. 
7. A "Lifeline" allows the representative to ask any member of their team the question they have been presented with. 
8. The last person still standing at the front of the room wins. 
 
Note: In the event that there is more than one person standing and the professor runs out of questions, we suggest the following: 
 
1. Taking turns, each remaining representative's team asks the next representative one question. If the team cannot think of a question, their representative is eliminated. Otherwise, if the next representative answers the question wrong, he/she is eliminated. If he/she answered it correctly, his/her team will ask the next representative a new question. 
 
Note: The team asking the question must know the answer to their question, or else their representative is eliminated. 
 
2. This continues until there is only one person left, the winner!!! 
 
Congratulation, you just finished Survivor: Java. 
 
http://www.youtube.com/watch?v=Wz7tYNwi5WQ

CSC 216 F09/Survivor: Java

2009-11-17T18:15:35Z

Jpkuell: /* The Rules */

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

==Survivor: Java==

Survivor: Java is a (not so) one of a kind learning exercise. Created by James Kuell and Lu Lan.

===The problem===

This exercise is aimed to review what the students have learned in CSC 116. As such, this learning exercise is used to review many basic and important concepts of Java.

===Participants and props===

This exercise can be played with any number of participants above two. However, this game is recommended to be played with a set of seven groups. Each group should consist of more than two people. There is no need for props, unless the professor wants to give prizes as rewards.

===The Rules===

1. Students will organize themselves into teams of two or more. 
2. Each team picks one individual to represent the entire team. 
3. The representatives will make a line in the front of the room. 
4. Each representative is asked a question and given 25 seconds to answer. 
5. If the representative cannot answer the question correctly, they return back to their seats, and the next person in line is asked the same question. 
6. Each representative is given 2 "Lifelines" in which they can use at any time. 
7. A "Lifeline" allows the representative to ask any member of their team the question they have been presented with. 
8. The last person still standing at the front of the room wins. 
 
Note: In the event that there is more than one person standing and the professor runs out of questions, we suggest the following: 
 
1. Taking turns, each remaining representative's team asks the next representative one question. If the team cannot think of a question, their representative is eliminated. Otherwise, if the next representative answers the question wrong, he/she is eliminated. If he/she answered it correctly, his/her team will ask the next representative a new question. 
 
Note: The team asking the question must know the answer to their question, or else their representative is eliminated. 
 
2. This continues until there is only one person left, the winner!!! 
 
Congratulation, you just finished Survivor: Java.

CSC 216 F09/Survivor: Java

2009-11-17T18:15:22Z

Jpkuell: /* The Rules */

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

==Survivor: Java==

Survivor: Java is a (not so) one of a kind learning exercise. Created by James Kuell and Lu Lan.

===The problem===

This exercise is aimed to review what the students have learned in CSC 116. As such, this learning exercise is used to review many basic and important concepts of Java.

===Participants and props===

This exercise can be played with any number of participants above two. However, this game is recommended to be played with a set of seven groups. Each group should consist of more than two people. There is no need for props, unless the professor wants to give prizes as rewards.

===The Rules===

1. Students will organize themselves into teams of two or more. 
2. Each team picks one individual to represent the entire team. 
3. The representatives will make a line in the front of the room. 
4. Each representative is asked a question and given 25 seconds to answer. 
5. If the representative cannot answer the question correctly, they return back to their seats, and the next person in line is asked the same question. 
6. Each representative is given 2 "Lifelines" in which they can use at any time. 
7. A "Lifeline" allows the representative to ask any member of their team the question they have been presented with. 
8. The last person still standing at the front of the room wins. 
 
Note: In the event that there is more than one person standing and the professor runs out of questions, we suggest the following: 
 
1. Taking turns, each remaining representative's team asks the next representative one question. If the team cannot think of a question, their representative is eliminated. Otherwise, if the next representative answers the question wrong, he/she is eliminated. If he/she answered it correctly, his/her team will ask the next representative a new question. 
 
Note: The team asking the question must know the answer to their question, or else their representative is eliminated. 
 
2. This continues until there is only one person left, the winner!!! 
 
Congratulation, you just finished Survivor: Java. 
 
<object width="425" height="344"><param name="movie" value="http://www.youtube.com/v/Wz7tYNwi5WQ&hl=en&fs=1"></param><param name="allowFullScreen" value="true"></param><param name="allowscriptaccess" value="always"></param><embed src="http://www.youtube.com/v/Wz7tYNwi5WQ&hl=en&fs=1" type="application/x-shockwave-flash" allowscriptaccess="always" allowfullscreen="true" width="425" height="344"></embed></object>

CSC 216 F09/Survivor: Java

2009-11-17T17:56:17Z

Jpkuell: /* Survivor: Java */

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

==Survivor: Java==

Survivor: Java is a (not so) one of a kind learning exercise. Created by James Kuell and Lu Lan.

===The problem===

This exercise is aimed to review what the students have learned in CSC 116. As such, this learning exercise is used to review many basic and important concepts of Java.

===Participants and props===

This exercise can be played with any number of participants above two. However, this game is recommended to be played with a set of seven groups. Each group should consist of more than two people. There is no need for props, unless the professor wants to give prizes as rewards.

===The Rules===

1. Students will organize themselves into teams of two or more. 
2. Each team picks one individual to represent the entire team. 
3. The representatives will make a line in the front of the room. 
4. Each representative is asked a question and given 25 seconds to answer. 
5. If the representative cannot answer the question correctly, they return back to their seats, and the next person in line is asked the same question. 
6. Each representative is given 2 "Lifelines" in which they can use at any time. 
7. A "Lifeline" allows the representative to ask any member of their team the question they have been presented with. 
8. The last person still standing at the front of the room wins. 
 
Note: In the event that there is more than one person standing and the professor runs out of questions, we suggest the following: 
 
1. Taking turns, each remaining representative's team asks the next representative one question. If the team cannot think of a question, their representative is eliminated. Otherwise, if the next representative answers the question wrong, he/she is eliminated. If he/she answered it correctly, his/her team will ask the next representative a new question. 
 
Note: The team asking the question must know the answer to their question, or else their representative is eliminated. 
 
2. This continues until there is only one person left, the winner!!! 
 
Congratulation, you just finished Survivor: Java.

CSC 216 F09/Survivor: Java

2009-11-17T05:39:12Z

Jpkuell: /* The Rules */

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

==Survivor: Java==

Survivor: Java is a (not so) one of a kind learning exercise.

===The problem===

This exercise is aimed to review what the students have learned in CSC 116. As such, this learning exercise is used to review many basic and important concepts of Java.

===Participants and props===

This exercise can be played with any number of participants above two. However, this game is recommended to be played with a set of seven groups. Each group should consist of more than two people. There is no need for props, unless the professor wants to give prizes as rewards.

===The Rules===

1. Students will organize themselves into teams of two or more. 
2. Each team picks one individual to represent the entire team. 
3. The representatives will make a line in the front of the room. 
4. Each representative is asked a question and given 25 seconds to answer. 
5. If the representative cannot answer the question correctly, they return back to their seats, and the next person in line is asked the same question. 
6. Each representative is given 2 "Lifelines" in which they can use at any time. 
7. A "Lifeline" allows the representative to ask any member of their team the question they have been presented with. 
8. The last person still standing at the front of the room wins. 
 
Note: In the event that there is more than one person standing and the professor runs out of questions, we suggest the following: 
 
1. Taking turns, each remaining representative's team asks the next representative one question. If the team cannot think of a question, their representative is eliminated. Otherwise, if the next representative answers the question wrong, he/she is eliminated. If he/she answered it correctly, his/her team will ask the next representative a new question. 
 
Note: The team asking the question must know the answer to their question, or else their representative is eliminated. 
 
2. This continues until there is only one person left, the winner!!! 
 
Congratulation, you just finished Survivor: Java.

CSC 216 F09/Survivor: Java

2009-11-17T05:30:58Z

Jpkuell: /* The Rules */

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

==Survivor: Java==

Survivor: Java is a (not so) one of a kind learning exercise.

===The problem===

This exercise is aimed to review what the students have learned in CSC 116. As such, this learning exercise is used to review many basic and important concepts of Java.

===Participants and props===

This exercise can be played with any number of participants above two. However, this game is recommended to be played with a set of seven groups. Each group should consist of more than two people. There is no need for props, unless the professor wants to give prizes as rewards.

===The Rules===

1. Students will organize themselves into teams of two or more. 
2. Each team picks one individual to represent the entire team. 
3. The representatives will make a line in the front of the room. 
4. Each representative is asked a question and given 25 seconds to answer. 
5. If the representative cannot answer the question correctly, they return back to their seats, and the next person in line is asked the same question. 
6. Each representative is given 2 "Lifelines" in which they can use at any time. 
7. A "Lifeline" allows the representative to ask any member of their team the question they have been presented with. 
8. The last person still standing at the front of the room wins. 
 
Note: In the event that there is more than one person standing and the professor runs out of questions, we suggest the following: 
 
1. Taking turns, each remaining representative's team ask the next representative one question. If the team cannot think of a question, their representative is eliminated. Otherwise, if the next representative answers the question wrong, he/she is eliminated. If he/she answered it correctly, his/her team will ask the next representative a new question. 
 
Note: The team asking the question must know the answer to their question, or else their representative is eliminated. 
 
2. This continues until there is only one person left, the winner!!! 
 
Congratulation, you just finished Survivor: Java.

CSC 216 F09/Survivor: Java

2009-11-17T05:28:53Z

Jpkuell: /* Participants and props */

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

==Survivor: Java==

Survivor: Java is a (not so) one of a kind learning exercise.

===The problem===

This exercise is aimed to review what the students have learned in CSC 116. As such, this learning exercise is used to review many basic and important concepts of Java.

===Participants and props===

This exercise can be played with any number of participants above two. However, this game is recommended to be played with a set of seven groups. Each group should consist of more than two people. There is no need for props, unless the professor wants to give prizes as rewards.

===The Rules===

1. Students will organize themselves into teams of two or more. 
2. Each teams picks one individual to represent their entire team. 
3. The representatives will make a line in the front of the room. 
4. Each representative is asked a question and given 25 seconds to answer. 
5. If the representative cannot answer the question, they return back to their seats, and the next person in line is asked the same question. 
6. Each representative is given 2 "Lifelines" in which they can use at any time. 
7. A "Lifeline" allows the representative to ask any member of their team the question. 
8. The last person still standing wins. 
 
Note: In the event that there are more than one person standing while the prof. runs out of questions, we suggest the following: 
 
1. Taking turns, each remaining representative's team ask the next representative one question. If the team cannot think of a question, their representative is eliminated. Otherwise, if the next representative answered the question wrong, he/she is eliminated. If he/she answered it correctly, his/her team will ask the next representative a new question. 
 
Note: The team asking the question must know the answer to their question, or else their representative is eliminated. 
 
2. This continues until there is only one person left, the winner!!! 
 
Congratulation, you just finished Survivor: Java.

CSC 216 F09/Survivor: Java

2009-11-17T05:27:51Z

Jpkuell: /* The problem */

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

==Survivor: Java==

Survivor: Java is a (not so) one of a kind learning exercise.

===The problem===

This exercise is aimed to review what the students have learned in CSC 116. As such, this learning exercise is used to review many basic and important concepts of Java.

===Participants and props===

This exercise can be played with any number of participant above two. However, it is recommended to be played with a set of seven group, each consisting of more than two people. There will be no need for props, unless the prof. wants to give prizes for rewards.

===The Rules===

1. Students will organize themselves into teams of two or more. 
2. Each teams picks one individual to represent their entire team. 
3. The representatives will make a line in the front of the room. 
4. Each representative is asked a question and given 25 seconds to answer. 
5. If the representative cannot answer the question, they return back to their seats, and the next person in line is asked the same question. 
6. Each representative is given 2 "Lifelines" in which they can use at any time. 
7. A "Lifeline" allows the representative to ask any member of their team the question. 
8. The last person still standing wins. 
 
Note: In the event that there are more than one person standing while the prof. runs out of questions, we suggest the following: 
 
1. Taking turns, each remaining representative's team ask the next representative one question. If the team cannot think of a question, their representative is eliminated. Otherwise, if the next representative answered the question wrong, he/she is eliminated. If he/she answered it correctly, his/her team will ask the next representative a new question. 
 
Note: The team asking the question must know the answer to their question, or else their representative is eliminated. 
 
2. This continues until there is only one person left, the winner!!! 
 
Congratulation, you just finished Survivor: Java.

CSC 216 F09/Survivor: Java

2009-11-17T01:38:24Z

Jpkuell: /* The Rules */

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

==Survivor: Java==

Survivor: Java is a (not so) one of a kind learning exercise.

===The problem===

This exercise is aimed to review what the students learned in CSC 116. As such, this learning exercise is used to review many basic and important concept of Java.

===Participants and props===

This exercise can be played with any number of participant above two. However, it is recommended to be played with a set of seven group, each consisting of more than two people. There will be no need for props, unless the prof. wants to give prizes for rewards.

===The Rules===

1. Students will organize themselves into teams of two or more. 
2. Each teams picks one individual to represent their entire team. 
3. The representatives will make a line in the front of the room. 
4. Each representative is asked a question and given 25 seconds to answer. 
5. If the representative cannot answer the question, they return back to their seats, and the next person in line is asked the same question. 
6. Each representative is given 2 "Lifelines" in which they can use at any time. 
7. A "Lifeline" allows the representative to ask any member of their team the question. 
8. The last person still standing wins. 
 
Note: In the event that there are more than one person standing while the prof. runs out of questions, we suggest the following: 
 
1. Taking turns, each remaining representative's team ask the next representative one question. If the team cannot think of a question, their representative is eliminated. Otherwise, if the next representative answered the question wrong, he/she is eliminated. If he/she answered it correctly, his/her team will ask the next representative a new question. 
 
Note: The team asking the question must know the answer to their question, or else their representative is eliminated. 
 
2. This continues until there is only one person left, the winner!!! 
 
Congratulation, you just finished Survivor: Java.