in case, someone wants to discuss anything at this forum,
then mail me at prianceu.pandey@coe.dce.edu , i have completed this course and will love to help anyone as much as i can

hi all,


lets make this forum active again.

some other resources i found helpful

1. Ars Digita University ,aduni.org

2. NPTEL, nptel.iitm.ac.in

3. Prof. Raj Jain on various networking topics
www.cs.wustl.edu/~jain/videos.htm

4. NJIT operating systems http://cpe.njit.edu/dlvideos/CS630/

5 webcasts berkeley webcast.berkeley.edu

thank you ,

if you know more resources please let others know.

Hello friends.. While my journey through this book..I find it difficult to get the difference between the big-O,theta and omega notations.
Please let me know when to go for theta instead of big-O notation? I could get the function but confusion only in selecting the notation.. HELP

I am a third year computer engineering student at delhi college of engineering,delhi,India and I am looking for summer internship.can anybody suggest me where to apply?
thanks in advance.

Hello,
I tried to solve this exercise substituting m with lgn.
So it's sqrt(n) =2^(m/2) and n=2^m.
Then substituting T(2^m) with S(m)
I have S(m)=2S(m/2) +1.
This is O(m).
So I founded that T(n)=T(2^m)=S(m)=O(n)=O(lgn).

Is this correct?
I guess no because in text they say "don't worry if you find not integer value" (I'm italian so I don't know if it's a perfect translation...).

Could you help me please?

ANYBODY PLEASE TELL ME FROM WHERE I CAN GET COMPLETE CILK COMPILOR FOR WINDOWS

hi guys
how we can convert max-heap to min-heap in O(2n) time.
another question:
what are the possible indexes of k-th largest element in maxheap?

Hello everyone.

I'm writing this B-tree database of 1000000 words in C using the algorithms described in the book. what i did was i defined a node structure with

- an array of strings for the "keys"
- an array of pointers to the node's children
- an integer indicating the number keys this node has
- an integer value indicating if this node is a leaf or not.

it's working quite well except there's this one operation in the book which i have no idea how to implement: the Disk-Read and Disk-Write operations. Is there anyone here who has done this bit for the B-tree? any help is most appreciated. thank you.

thnks maurya,
check out this link:

http://webcast.berkeley.edu/course_details.php?seriesid=1906978259
how to download the videos?