Recent Tutoring Session Reviews
"The student and I went over her review guide for her upcoming final exam. We also briefly looked over a final assignment and discussed the best way of implementing it. She seems to be ready for the final exam, and is not very concerned about it, which is great!"
"The student is working on a graph coloring program in Java. He is having trouble determining programmatically whether a graph is bipartite, so we spent the entire session working together debugging his program."
"We specifically covered deriving the lower bound on the number of comparisons to sort a collection of numbers, and obtain the minimum and maximum of those numbers. Then we wrote the code to obtain the minimum and maximum, based on the minimum number of comparisons we obtained from the previous theoretical part. We will continue working on this set of problems tomorrow. She'll be looking at more of the assignment in the meantime and we'll see if she has any questions/ areas to focus on for tomorrow."
"We both struggled with some in/pre/postfix problems but it wasn't too long before we figured them out. This entire session was spent going over practice exams to prepare the student for his final next week!"
"In our first session, we primarily discussed the concept of recursive programming, and how it's different from the iterative approach. We went over several examples of solving problems with recursion, and the two major parts of the recursive approach - the bootstrap / base case and the recursive call. Looking at the tree data structure, we discussed the recursive approach to searching data stored in a tree, and compared it to the linear approach for its computational efficiency. We also demonstrated the formula for storing a tree in an array and how to compute the location of a node's child nodes. We scheduled our next session for tomorrow to continue the discussion and go over topics from other class assignments."
"We worked on the application that the student is working on for class. We created a document detailing the three stages of work she will go through. Versions 1, 2, and 3 will gradually increase in complexity and difficulty."