1) Heaps: what they are, complexity of operations, heap property,
insertion/deletion
2) Red-black tree: what, complexity of operations, insertion/deletion
[note: no "rotations" -- unlikely to be on the exam]
3) Special heaps: binomial, fibonacci -- same subtopics as (1)
4) Recurrences: solving reasonably simple ones
5) Complexity: relation between complexity classes, common NP-complete
problems
6) Complexity: formal languages, decidability
6) OS: process scheduling, virtual memory, security (access control
lists and such)
Also, we really should decide when we want to meet. I'm fine with
anytime except 2-3:30pm on Tue / Th, and before noon in general
(although I'm willing to compromise on that one).
--
What is freedom of expression? Without the freedom to offend, it ceases to exist. - Salman Rushdie
As of now, it looks like a NO-GO --- correct me if I'm wrong.
Text/call me at (312) 330 - 6043.
On Mar 23, 1:31 pm, "Ishaan Joshi" <ishaanjo...@gmail.com> wrote:
> So, is anyone coming for this ?
> I don't see any emails from Anushka/Joel.
>
> Do let me know, I don't want to travel all the way from the west campus and
> find nobody.
>
> cheerio,
>
> ..i[j]
>
> On 21/03/07, habiba <habi...@gmail.com> wrote:
>
>
>
>
>
> > I'll take 1st & 2nd.
>