Algorithms and OOD (CSC 207 2014S) : EBoards

# CSC207.01 2014S, Class 53: Building Your First App (3)

Overview

• Preliminaries.
• Questions.
• Lists.
• Lab.
• Debrief.

## Preliminaries

• Distributed: Sample problems for in-class final
• Earnest will go over sample problems at Tuesday night's mentor session.
• Tomorrow we'll step back and look at the big patterns we've seen over the semester.
• I may also distribute the take-home exam.
• Wednesday will be a chance to debrief on and evaluate the class.
• Thursday will be a chance for you to ask questions about the final.
• Friday will also be a chance for you to ask questions about the final.

### Upcoming Work

• Continue to work on the exam.
• Today's writeup: No writeup.

### Extra Credit

• CS table Friday: Casual conversation.
• Conference track meet Friday and Saturday.
• Listen to Evan's radio show on KDIC Friday at 5pm.
• Listen to Daniel guest start on some radio show Friday at 11pm. Sam should not listen.

### Questions

What is the relationship of problem 1 to merge sort?

Merge sort says: 1. Split into two subarrays. 2. Sort the subarrays. 3. Merge the sorted subarrays together. You are thinking about step 3 only.

How do I turn in an exam at 10 a.m. on Thursday?

Slide it under my door.

## Lab

• Try to get lists working using a simplified version of the process in the reading. (Don't worry about creating the info object; just create the array and adapter.)
• See if you can find a way to update lists (e.g., count button clicks somewhere and show those).

## Debrief

• Was it worth a week of your time to play with Android?
• Nice to have a cool topic that doesn't count at the end of the semester.
• Should we do Android at the beginning of the semester and have each assignment tie in an Android activity (e.g., come up with reasons you want to use certain data structures with the list)?
• No.
• Should we just do GUI programming on the computer instead?
• Maybe.

Copyright (c) 2013-14 Samuel A. Rebelsky.