|
|
 Up |
|
|
  |
Author: kirkfernandeskirkfernandes Date: Jun 15, 2008 12:01
I was wondering which questions should we be able to answer? Since
some of them seem like we haven't covered the given topic (graph
algorithms), or should we able to answer all of them...
|
| |
|
| | 4 Comments |
|
|
Author: Adam BainsAdam Bains Date: Jun 16, 2008 12:10
Generally, you should be able to answer any questions from the sample exam
that refer to material that you've covered in class. For this sample
midterm in particular, Prof. Chan has said that all questions are possible
sources for exam material, except 1D on DFS.
- Adam Bains
On Sun, 15 Jun 2008, kirkfernandes@ gmail.com wrote:
> I was wondering which questions should we be able to answer? Since
> some of them seem like we haven't covered the given topic (graph
> algorithms), or should we able to answer all of them...
>
|
| |
|
| | no comments |
|
|
Author: Adam BainsAdam Bains Date: Jun 16, 2008 12:21
Sorry, my previous reply should read 1D, E, and F.
- Adam Bains
On Sun, 15 Jun 2008, kirkfernandes@ gmail.com wrote:
> I was wondering which questions should we be able to answer? Since
> some of them seem like we haven't covered the given topic (graph
> algorithms), or should we able to answer all of them...
>
|
| |
| no comments |
|
|
Author: Thomas DimsonThomas Dimson Date: Jun 16, 2008 15:55
Adam Bains wrote:
>
> Generally, you should be able to answer any questions from the sample
> exam that refer to material that you've covered in class. For this
> sample midterm in particular, Prof. Chan has said that all questions are
> possible sources for exam material, except 1D on DFS.
>
> - Adam Bains
>
> On Sun, 15 Jun 2008, kirkfernandes@ gmail.com wrote:
> >> I was wondering which questions should we be able to answer? Since
>> some of them seem like we haven't covered the given topic (graph
>> algorithms), or should we able to answer all of them...
>>
Will there be dynamic programming on the midterm or only coverage up to
greedy? I'm sure that this has been mentioned in class but I have forgotten.
-Thomas Dimson
|
| |
| no comments |
|
|
|
|
|
Author: kirkfernandeskirkfernandes Date: Jun 16, 2008 16:40
On Jun 16, 6:55 pm, Thomas Dimson gmail.com> wrote:> Adam Bains wrote:
>
>> Generally, you should be able to answer any questions from the sample
>> exam that refer to material that you've covered in class. For this
>> sample midterm in particular, Prof. Chan has said that all questions are
>> possible sources for exam material, except 1D on DFS.
>
>> - Adam Bains
>
>> On Sun, 15 Jun 2008, kirkfernan...@ gmail.com wrote: >
>>> I was wondering which questions should we be able to answer? Since
>>> some of them seem like we haven't covered the given topic (graph
>>> algorithms), or should we able to answer all of them...
>
> Will there be dynamic programming on the midterm or only coverage up to
> greedy? I'm sure that this has been mentioned in class but I have forgotten.
>
> -Thomas Dimson ...
|
| Show full article (0.92Kb) |
| no comments |
|
|
