Expertiza_Wiki - User contributions [en]

CSC 216/s08/be gentle

2008-04-21T02:08:48Z

Cbnordan:

==Binary Speed Tree==

===What is a binary search tree?===

A binary search tree is a way data can be arranged so that data can be added and deleted easily. A binary search tree has the following properties:

---each node (item in the tree) has a value

---a total order (linear order) is defined on these values

---the left subtree of a node contains only values less than the node's value

---the right subtree of a node contains only values greater than or equal to the node's value

===The problem===

The concept of binary search trees in Java is one that can be difficult to grasp. The goal of this exercise is to help students visualize how a binary search tree is created. It does this by actively involving them in sorting their own search tree using a deck of cards. By seeing how a random set of numbers are placed into a tree, students will better understand how binary search trees are sorted and be given a visual example of the efficiency of these trees.

===Participants and props===

The only prop required for this exercise will be a single deck of cards. The participants will be four teams of about five students each.

===The script===

1. The deck of cards will be split into the four different suits (hearts, spades, clubs, diamonds) and the face cards, as well as the aces will be removed from the deck. The participants will be divided into four teams, one for each suit.

2. Each member of the group will receive one card from their pile face down, so they cannot see the value of the card.

3. Each team will select a team leader who will show their card. This card will represent the first card in the binary search tree, and the leader will stand at the top of the list.

4.The professor will say "go," and the other members of each group will flip over their card. The group will then decided the best way to organize themselves in a correct binary search tree by standing in the correct corresponding position to the preceding cards.

5. Once they believe they have the tree sorted correctly, the leader yells "finished," and the professor will check to make sure the group has sorted themselves correctly. The first group to finish and be checked for correctness wins the game.

Also provided is a [http://www.youtube.com/watch?v=BBcN6DkKd40 video] that demonstrates the format of this exercise.

CSC 216/s08/be gentle

2008-04-21T02:08:32Z

Cbnordan: /* What is a binary search tree? */

CSC 216/s08/be gentle

2008-04-21T02:07:06Z

Cbnordan:

==Binary Speed Tree==

===What is a binary search tree?===

A binary search tree is a way data can be arranged so that it can added and deleted easily. A binary search tree has the following properties:

---each node (item in the tree) has a value

---a total order (linear order) is defined on these values

---the left subtree of a node contains only values less than the node's value

---the right subtree of a node contains only values greater than or equal to the node's value

===The problem===

The concept of binary search trees in Java is one that can be difficult to grasp. The goal of this exercise is to help students visualize how a binary search tree is created. It does this by actively involving them in sorting their own search tree using a deck of cards. By seeing how a random set of numbers are placed into a tree, students will better understand how binary search trees are sorted and be given a visual example of the efficiency of these trees.

===Participants and props===

The only prop required for this exercise will be a single deck of cards. The participants will be four teams of about five students each.

===The script===

1. The deck of cards will be split into the four different suits (hearts, spades, clubs, diamonds) and the face cards, as well as the aces will be removed from the deck. The participants will be divided into four teams, one for each suit.

2. Each member of the group will receive one card from their pile face down, so they cannot see the value of the card.

3. Each team will select a team leader who will show their card. This card will represent the first card in the binary search tree, and the leader will stand at the top of the list.

4.The professor will say "go," and the other members of each group will flip over their card. The group will then decided the best way to organize themselves in a correct binary search tree by standing in the correct corresponding position to the preceding cards.

5. Once they believe they have the tree sorted correctly, the leader yells "finished," and the professor will check to make sure the group has sorted themselves correctly. The first group to finish and be checked for correctness wins the game.

Also provided is a [http://www.youtube.com/watch?v=BBcN6DkKd40 video] that demonstrates the format of this exercise.

CSC 216/s08/be gentle

2008-04-21T02:06:34Z

Cbnordan:

==Binary Speed Tree==

===What is a binary search tree?===

A binary search tree is a way data can be arranged so that it can added and deleted easily. A binary search tree has the following properties:

--each node (item in the tree) has a value

--a total order (linear order) is defined on these values

--the left subtree of a node contains only values less than the node's value

--the right subtree of a node contains only values greater than or equal to the node's value

===The problem===

The concept of binary search trees in Java is one that can be difficult to grasp. The goal of this exercise is to help students visualize how a binary search tree is created. It does this by actively involving them in sorting their own search tree using a deck of cards. By seeing how a random set of numbers are placed into a tree, students will better understand how binary search trees are sorted and be given a visual example of the efficiency of these trees.

===Participants and props===

The only prop required for this exercise will be a single deck of cards. The participants will be four teams of about five students each.

===The script===

1. The deck of cards will be split into the four different suits (hearts, spades, clubs, diamonds) and the face cards, as well as the aces will be removed from the deck. The participants will be divided into four teams, one for each suit.

2. Each member of the group will receive one card from their pile face down, so they cannot see the value of the card.

3. Each team will select a team leader who will show their card. This card will represent the first card in the binary search tree, and the leader will stand at the top of the list.

4.The professor will say "go," and the other members of each group will flip over their card. The group will then decided the best way to organize themselves in a correct binary search tree by standing in the correct corresponding position to the preceding cards.

5. Once they believe they have the tree sorted correctly, the leader yells "finished," and the professor will check to make sure the group has sorted themselves correctly. The first group to finish and be checked for correctness wins the game.

Also provided is a [http://www.youtube.com/watch?v=BBcN6DkKd40 video] that demonstrates the format of this exercise.

CSC 216/s08/be gentle

2008-04-21T02:06:02Z

Cbnordan: /* What is a binary search tree? */

==Binary Speed Tree==

===What is a binary search tree?===

A binary search tree is a way data can be arranged so that it can added and deleted easily. A binary search tree has the following properties:
--each node (item in the tree) has a value
--a total order (linear order) is defined on these values
--the left subtree of a node contains only values less than the node's value
--the right subtree of a node contains only values greater than or equal to the node's value

===The problem===

The concept of binary search trees in Java is one that can be difficult to grasp. The goal of this exercise is to help students visualize how a binary search tree is created. It does this by actively involving them in sorting their own search tree using a deck of cards. By seeing how a random set of numbers are placed into a tree, students will better understand how binary search trees are sorted and be given a visual example of the efficiency of these trees.

===Participants and props===

The only prop required for this exercise will be a single deck of cards. The participants will be four teams of about five students each.

===The script===

1. The deck of cards will be split into the four different suits (hearts, spades, clubs, diamonds) and the face cards, as well as the aces will be removed from the deck. The participants will be divided into four teams, one for each suit.

2. Each member of the group will receive one card from their pile face down, so they cannot see the value of the card.

3. Each team will select a team leader who will show their card. This card will represent the first card in the binary search tree, and the leader will stand at the top of the list.

4.The professor will say "go," and the other members of each group will flip over their card. The group will then decided the best way to organize themselves in a correct binary search tree by standing in the correct corresponding position to the preceding cards.

5. Once they believe they have the tree sorted correctly, the leader yells "finished," and the professor will check to make sure the group has sorted themselves correctly. The first group to finish and be checked for correctness wins the game.

Also provided is a [http://www.youtube.com/watch?v=BBcN6DkKd40 video] that demonstrates the format of this exercise.

CSC 216/s08/be gentle

2008-04-21T02:05:26Z

Cbnordan: /* What is a binary search tree? */

==Binary Speed Tree==

===What is a binary search tree?===

A binary search tree is a way data can be arranged so that it can added and deleted easily. A binary search tree has the following properties:
each node (item in the tree) has a value;
a total order (linear order) is defined on these values;
the left subtree of a node contains only values less than the node's value;
the right subtree of a node contains only values greater than or equal to the node's value.

===The problem===

The concept of binary search trees in Java is one that can be difficult to grasp. The goal of this exercise is to help students visualize how a binary search tree is created. It does this by actively involving them in sorting their own search tree using a deck of cards. By seeing how a random set of numbers are placed into a tree, students will better understand how binary search trees are sorted and be given a visual example of the efficiency of these trees.

===Participants and props===

The only prop required for this exercise will be a single deck of cards. The participants will be four teams of about five students each.

===The script===

1. The deck of cards will be split into the four different suits (hearts, spades, clubs, diamonds) and the face cards, as well as the aces will be removed from the deck. The participants will be divided into four teams, one for each suit.

2. Each member of the group will receive one card from their pile face down, so they cannot see the value of the card.

3. Each team will select a team leader who will show their card. This card will represent the first card in the binary search tree, and the leader will stand at the top of the list.

4.The professor will say "go," and the other members of each group will flip over their card. The group will then decided the best way to organize themselves in a correct binary search tree by standing in the correct corresponding position to the preceding cards.

5. Once they believe they have the tree sorted correctly, the leader yells "finished," and the professor will check to make sure the group has sorted themselves correctly. The first group to finish and be checked for correctness wins the game.

Also provided is a [http://www.youtube.com/watch?v=BBcN6DkKd40 video] that demonstrates the format of this exercise.

CSC 216/s08/be gentle

2008-04-21T01:56:35Z

Cbnordan:

==Binary Speed Tree==

===What is a binary search tree?===

A binary search tree is a way data can be arranged so that it can added and deleted easily. In a binary search tree, there is a number at the top of the tree. Every number after that is arranged by either going on the left if it is smaller, or on the right if it is larger.

===The problem===

The concept of binary search trees in Java is one that can be difficult to grasp. The goal of this exercise is to help students visualize how a binary search tree is created. It does this by actively involving them in sorting their own search tree using a deck of cards. By seeing how a random set of numbers are placed into a tree, students will better understand how binary search trees are sorted and be given a visual example of the efficiency of these trees.

===Participants and props===

The only prop required for this exercise will be a single deck of cards. The participants will be four teams of about five students each.

===The script===

1. The deck of cards will be split into the four different suits (hearts, spades, clubs, diamonds) and the face cards, as well as the aces will be removed from the deck. The participants will be divided into four teams, one for each suit.

2. Each member of the group will receive one card from their pile face down, so they cannot see the value of the card.

3. Each team will select a team leader who will show their card. This card will represent the first card in the binary search tree, and the leader will stand at the top of the list.

4.The professor will say "go," and the other members of each group will flip over their card. The group will then decided the best way to organize themselves in a correct binary search tree by standing in the correct corresponding position to the preceding cards.

5. Once they believe they have the tree sorted correctly, the leader yells "finished," and the professor will check to make sure the group has sorted themselves correctly. The first group to finish and be checked for correctness wins the game.

Also provided is a [http://www.youtube.com/watch?v=BBcN6DkKd40 video] that demonstrates the format of this exercise.

CSC 216/s08/be gentle

2008-04-21T01:55:36Z

Cbnordan:

CSC 216/s08/be gentle

2008-04-21T01:55:19Z

Cbnordan:

==Binary Speed Tree==

===What is a binary search tree===

A binary search tree is a way data can be arranged so that it can added and deleted easily. In a binary search tree, there is a number at the top of the tree. Every number after that is arranged by either going on the left if it is smaller, or on the right if it is larger.

===The problem===

The concept of binary search trees in Java is one that can be difficult to grasp. The goal of this exercise is to help students visualize how a binary search tree is created. It does this by actively involving them in sorting their own search tree using a deck of cards. By seeing how a random set of numbers are placed into a tree, students will better understand how binary search trees are sorted and be given a visual example of the efficiency of these trees.

===Participants and props===

The only prop required for this exercise will be a single deck of cards. The participants will be four teams of about five students each.

===The script===

1. The deck of cards will be split into the four different suits (hearts, spades, clubs, diamonds) and the face cards, as well as the aces will be removed from the deck. The participants will be divided into four teams, one for each suit.

2. Each member of the group will receive one card from their pile face down, so they cannot see the value of the card.

3. Each team will select a team leader who will show their card. This card will represent the first card in the binary search tree, and the leader will stand at the top of the list.

4.The professor will say "go," and the other members of each group will flip over their card. The group will then decided the best way to organize themselves in a correct binary search tree by standing in the correct corresponding position to the preceding cards.

5. Once they believe they have the tree sorted correctly, the leader yells "finished," and the professor will check to make sure the group has sorted themselves correctly. The first group to finish and be checked for correctness wins the game.

Also provided is a [http://www.youtube.com/watch?v=BBcN6DkKd40 video] that demonstrates the format of this exercise.

CSC 216/s08/be gentle

2008-04-17T19:01:52Z

Cbnordan:

==Binary Speed Tree==

===The problem===

The concept of binary search trees in Java is one that can be difficult to grasp. The goal of this exercise is to help students visualize how a binary search tree is created. It does this by actively involving them in sorting their own search tree using a deck of cards. By seeing how a random set of numbers are placed into a tree, students will better understand how binary search trees are sorted and be given a visual example of the efficiency of these trees.

===Participants and props===

The only prop required for this exercise will be a single deck of cards. The participants will be four teams of about five students each.

===The script===

1. The deck of cards will be split into the four different suits (hearts, spades, clubs, diamonds) and the face cards, as well as the aces will be removed from the deck. The participants will be divided into four teams, one for each suit.

2. Each member of the group will receive one card from their pile face down, so they cannot see the value of the card.

3. Each team will select a team leader who will show their card. This card will represent the first card in the binary search tree, and the leader will stand at the top of the list.

4.The professor will say "go," and the other members of each group will flip over their card. The group will then decided the best way to organize themselves in a correct binary search tree by standing in the correct corresponding position to the preceding cards.

5. Once they believe they have the tree sorted correctly, the leader yells "finished," and the professor will check to make sure the group has sorted themselves correctly. The first group to finish and be checked for correctness wins the game.

Also provided is a [http://www.youtube.com/watch?v=BBcN6DkKd40 video] that demonstrates the format of this exercise.

CSC 216/s08/be gentle

2008-04-17T19:00:27Z

Cbnordan:

==Binary Speed Tree==

===The problem===

The concept of binary search trees in Java is one that can be difficult to grasp. The goal of this exercise is to help students visualize how a binary search tree is created. It does this by actively involving them in sorting their own search tree using a deck of cards. By seeing how a random set of numbers are placed into a tree, students will better understand how binary search trees are sorted and be given a visual example of the efficiency of these trees.

===Participants and props===

The only prop required for this exercise will be a single deck of cards. The participants will be four teams of about five students each.

===The script===

1. The deck of cards will be split into the four different suits (hearts, spades, clubs, diamonds) and the face cards, as well as the aces will be removed from the deck. The participants will be divided into four teams, one for each suit.

2. Each member of the group will receive one card from their pile face down, so they cannot see the value of the card.

3. Each team will select a team leader who will show their card. This card will represent the first card in the binary search tree, and the leader will stand at the top of the list.

4.The professor will say "go," and the other members of each group will flip over their card. The group will then decided the best way to organize themselves in a correct binary search tree by standing in the correct corresponding position to the preceding cards.

5. Once they believe they have the tree sorted correctly, the leader yells "finished," and the professor will check to make sure the group has sorted themselves correctly. The first group to finish and be checked for correctness wins the game.

AAlso provided is a [http://www.youtube.com/watch?v=BBcN6DkKd40] that demonstrates the format of this exercise.

CSC 216/s08/be gentle

2008-04-17T18:18:11Z

Cbnordan:

==Binary Speed Tree==

===The problem===

The concept of binary search trees in Java is one that can be difficult to grasp. The goal of this exercise is to help students visualize how a binary search tree is created. It does this by actively involving them in sorting their own search tree using a deck of cards. By seeing how a random set of numbers are placed into a tree, students will better understand how binary search trees are sorted and be given a visual example of the efficiency of these trees.

===Participants and props===

The only prop required for this exercise will be a single deck of cards. The participants will be four teams of about five students each.

===The script===

1. The deck of cards will be split into the four different suits (hearts, spades, clubs, diamonds) and the face cards, as well as the aces will be removed from the deck. The participants will be divided into four teams, one for each suit.

2. Each member of the group will receive one card from their pile face down, so they cannot see the value of the card.

3. Each team will select a team leader who will show their card. This card will represent the first card in the binary search tree, and the leader will stand at the top of the list.

4.The professor will say "go," and the other members of each group will flip over their card. The group will then decided the best way to organize themselves in a correct binary search tree by standing in the correct corresponding position to the preceding cards.

5. Once they believe they have the tree sorted correctly, the leader yells "finished," and the professor will check to make sure the group has sorted themselves correctly. The first group to finish and be checked for correctness wins the game.

A video of how the game is played can be viewed here.

CSC 216/s08/true heroism

2008-04-03T17:02:32Z

Cbnordan: /* The Script */

== Are You Smarter Than a Computer Science Major? ==

===The Problem===

This exercise will use the setting of a game show to help teach students multiple concepts by involving them in group-oriented question answering.

Several students will participate in answering questions related to different Java-related topics that have been covered previously in class. All students will be encouraged to answer the questions. The goal is that each individual's knowledge of these selected topics in Java will expand as the questions are answered.

In addition to the review aspect, this exercise will also illustrate the concept of Java exceptions by allowing the students to help each other answer questions. This will be explained in the script.

===Participants and Props===

All students in the class will actively participate in the game and be encouraged to answer the questions. The exercise will use a PowerPoint slide show to display the topics and questions. To answer the questions, each student will also need pencil and paper to write down their answer. In addition, a tennis ball (or other soft ball) will be needed for the "exception" part of the exercise.

===The Script===

1. This game will mimic the TV Game Show "Are You Smarter Than a Fifth Grader." One student in the class will be chosen as the "contestant" and be asked to come forward. The rest of the class will be the "computer science majors."

2. The contestant will then choose one of their classmates to be their helper. After this is completed, the contestant will receive a series of questions which he/she must answer in order to progress in the game. A total of 10 questions will be asked, two questions out of five selected topics. If time constraints are necessary, only five questions may be asked, allowing the exercise to be completed in a feasible amount of time.

3. The contestant will be allowed to choose which topic he/she desires to answer from. Once each question is asked, all of the "computer science majors" including the helper will also answer the question. Once the contestant locks in their answer, it will be shown on the PowerPoint slide. At this point, the rest of the students will show their answers so everyone will be able to compare the contestants answer with the computer science majors' answer, and see if the contestant is smarter than a computer science major.

4. In addition, the contestant will have a cheat to help him/her with difficult questions. This is the part of the exercise that demonstrates exception handling. If the contestant does not know the answer to a question, he/she can "throw" the ball to his/her helper, who is the "exception handler." The handler then "catches" the ball and has the opportunity to answer the question for the contestant. If the handler answers the question correctly, the contestant continues in the game. This can be done three times.

5. If the contestant is correct, he/she progresses to the next question until all questions have been answered. At each increasing level, the contestant will receive some type of reward based on their performance. If the contestant misses a question and cannot be saved, they lose the game, and will receive the reward corresponding to the questions they have successfully answered. The game ends when either all questions have been answered, or a contestant misses a question.

Provided are links to PowerPoint presentations which provide sample questions and show how the game flows. Each presentation has a different set of 10 questions.

[http://www4.ncsu.edu/~dwwright/216presentation1.ppt PowerPoint Questions 1]

[http://www4.ncsu.edu/~dwwright/216presentation2.ppt Power Point Questions 2]

(Note: on the slides that show the answers, click the "topic" button in the bottom right corner to return back to the topic menu)

Also provided is a [http://www.youtube.com/watch?v=DTUiDSFKyxQ video] that demonstrates the format of this exercise.

CSC 216/s08/true heroism

2008-04-03T17:01:47Z

Cbnordan: /* The Script */