Fw: Lecture Outline: Time Complexity (For Jan 7th)

[sarthak...@gmail.com]

Sent on my BlackBerry® from Vodafone

---

From: sudha rao <raosu...@gmail.com>

Date: Sun, 25 Dec 2011 21:51:24 +0530

To: <sarthak...@gmail.com>

Cc: Kartik Nayak<karti...@gmail.com>; Amey Bhangale<amu....@gmail.com>; Amit Chavan<cam...@gmail.com>; Keval Vora<keva...@gmail.com>

Subject: Lecture Outline: Time Complexity (For Jan 7th)

Hi Sarthak,

We are planning to start the lecture series from Jan 7th. 

On 7th we are going to start with Time Complexity and below is what Kartik is going to cover:

Introductory Problem
Formal Definition of O, theta, omega
Examples on how to compute complexity for a given algorithm
Recurrences (If time permits)

Please let us know if 7th works for you guys as well. And if it does then please start spreading the word around especially to juniors (1st and 2nd  year). And as Rajiv Sir had suggested please tell them that it is not just for the CS or IT students. Anyone interested can attend these lectures.

Thanks

Sudhar