[Instructions] [Search] [Current] [Syllabus] [Links] [Handouts] [Outlines] [Labs] [More Labs] [Assignments] [Quizzes] [Exams] [Examples] [Book] [Tutorial] [API]
Back to Analyzing Recursive Algorithms. On to Binary Search.
Held Monday, October 4, 1999
Overview
Today, we will continue to consider our project by reflecting on the initial designs of each group. Most of our work will have to do with narratives about what happens when users try to do certain things.
Notes
Contents
Handouts
Summary
We'll start with a few general questions that came up while I was reading your proposals. You can find the questions at the top of my notes on the first set of proposals.
We'll then continue with some narratives of what happens behind the scenes. This will be a dialog between groups. For example, an interface may say ``I need to look up from this object'' and that group will say how one does that. I will do my best to record the steps so that we'll have them available for future consideration. Expect to see those in this outline later today.
Oh, boy, I'd like to use the brand new, text-based,
email package that CS152 created.
I type
% gmail
I see
* A query for the user name
I enter rebelsky
I see
* A prompt for the password
I enter hahahahhah
I wait
Behind the scences ....
Create input and output objects
Call constructor for Login(username,password)
Create a Socket object for pioneerserver, port ???
If failed to create a Socket, throw ConnectionException
so.send(IMAP Login command)
so.receive() to get the response
If the reponse is "A OK", we're done
Otherwise throw LoginException
If we catch an exception
output.println("Login failed")
Give more information
If the exception was a ConnectionException,
output.println("Bye");
Otherwise
query again
Otherwise (we successfully connected)
Create a new MailBox object, fred,
with the Login as a parameter
// Desire ... display the inbox
fred.setFolder("Inbox");
MessageInfo[] messages = fred.getMessages();
Options currentOptions = new Options(userName);
Ruleset sortBy = currentOptions.defaultOrganization();
SortFilter sorter = new SortFilter(sortBy);
messages = sorter.sort(messages);
for (int i = 0; i < messages.length)
out.println(i + ": " + messages[i].toString());
Tuesday, 10 August 1999
Friday, 1 October 1999
Monday, 4 October 1999
Tuesday, 5 October 1999
Back to Analyzing Recursive Algorithms. On to Binary Search.
[Instructions] [Search] [Current] [Syllabus] [Links] [Handouts] [Outlines] [Labs] [More Labs] [Assignments] [Quizzes] [Exams] [Examples] [Book] [Tutorial] [API]
Disclaimer Often, these pages were created "on the fly" with little, if any, proofreading. Any or all of the information on the pages may be incorrect. Please contact me if you notice errors.
This page may be found at http://www.math.grin.edu/~rebelsky/Courses/CS152/99F/Outlines/outline.23.html
Source text last modified Tue Oct 5 11:57:54 1999.
This page generated on Tue Oct 5 11:58:24 1999 by Siteweaver. Validate this page's HTML.
Contact our webmaster at rebelsky@grinnell.edu