Prog2 - Programming Assignment #2 CS 163: Data Structures...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Programming Assignment #2 CS 163: Data Structures Spring 2010 Problem Statement: There are many applications that have come available for our smart phones. One in particular that I find helpful is one that keeps track of your calls, texts, and emails for a given calendar day. So, I can click on a day and it will give me my entire compiled history, if so desired. So, I knew that someone called at 12:15 on Wednesday but I hadnt saved it in my contacts and 1000s of texts/calls/emails had been sent/received since then. I can select Wednesday and immedially look at Noon and find what was happening at that time. Ok, so now for the point of the assignment! Here is your idea. You have been thinking about both stacks. A stack could be used for each day of the week to keep track of what transpired during that day. The stack would maintain the order, giving me the most recent transaction first and the oldest transaction last. A transaction would include this information (not all of it would be filled out for each transaction you will need to deal with this): Transaction type...
View Full Document

This note was uploaded on 10/16/2011 for the course CS 163 taught by Professor Fant during the Spring '09 term at Portland State.

Page1 / 2

Prog2 - Programming Assignment #2 CS 163: Data Structures...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online