Re: Finals Format


[ Follow Ups ] [ Post Followup ] [ WWWBoard for 308-203A ] [ FAQ ]

Posted by Will Renner on December 13, 19100 at 14:29:50:

In Reply to: Finals Format posted by Waqas Afzal on December 12, 19100 at 04:40:03:

: Hi Will,
: In assignment 4 and 5 you gave us questions about Binary Trees, Heaps, Hashtables, Graphs, Searching on Graphs and Dijkstra's Algorithm. Can you post some more questions to Practice. Secondly we have'nt came across any questions on Threads and Concurrency Issues. What exactly do we need to know from last two lectures.
: And last but not least that how long will the final be and how many questions will be there. Will the format be like the last years finals???

As I said in class, concurrency is not covered at all on the final and there are
9 questions plus one extra credit.

I'm afraid I really don't have time as of today to prepare and post more sample
questions, however the questions on the final are very much like the homework
questions so all you really need to do to practice is pick some different random
data to work with and ask the same questions. If you want me to double check
what you're doing, stop by tomorrow (Thursday) sometime.
(see next posting)



Follow Ups:



Post a Followup

Name:
E-Mail:

Subject:

Comments:

Optional Link URL:
Link Title:
Optional Image URL:


[ Follow Ups ] [ Post Followup ] [ WWWBoard for 308-203A ] [ FAQ ]