Erik Madrid
Marcus Valenzuela
Xomary Rodarte
Miguel Cuellar
2401 PLTL SESSION PLAN, March 26-30.
Overview
For this week's session plan, we have decided that we should conduct a review session for the
next upcoming exam this Thursday and Friday. In order to achieve a good learning session, we
agreed on addressing certain questions students may have from previous session, and then
providing with our own set of review problems to the class (all problems may be answered in a
cooperative learning manner as always). The main topics to review are queues, stacks, and link
lists. Since recursion also plays an important part in some operation for this data structures, we
will also apply them as a previous review for the class. At the end of the session, students should
be ready for the upcoming exam.
Lesson Plan:
Activity Time(mins)
Questions. Anyone? 5 Break
group into groups of 2 or 3 2
Go over basic structure of Link List 5
Review stack characteristics 5
Definition and implementation of queues and circular queue 8
Do exercises 15
Go over exercises as a group 10
Total Time = 50 minutes.
Note. -This plan can vary depending on the participation of the group and the number of students
in the session.
Before starting with the exercises, we believe it is convenient to review all data structure first
and then let them work on the exercises as a group and answering the questions as a class. The
exercises will be the following:
Link List
//Gives the sum of a list recursively
public static int sum (LN l)
{
if (l == null)
return 0;
