guys can anyone tell me the link from where i can read about the big o ,big
w and big q ...i read from corma but i didnt get theses from that...thnx in
advance
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email
please go through this blog
http://interviewdestiny.blogspot.in/2011/11/indus-valley-partners-procedure-in-2011.html
it shows the coding problems asked but I don't remember the apti ques.
On Mon, Aug 20, 2012 at 10:53 PM, vipul jain vjvipu...@gmail.com wrote:
yar i forgot those coding question
*Let w(n) and A(n) denote respectively, the worst case and average case
running time of an algorithm executed on an input of size n. which of the
following is ALWAYS TRUE?*
(A) [image: A(n) = \Omega(W(n))]
(B) [image: A(n) = \Theta(W(n))]
(C) [image: A(n) = O(W(n))]
(D) [image: A(n) = o(W(n))]
Because you can always find a positive constant c for which following
inequality hold true.
A(n) = cW(n) i.e. the avg. case time complexity always upper bounded by
worst case time complexity. Which is the definition of Big O.
On Sat, Aug 25, 2012 at 7:11 PM, rahul sharma
You have to discard option d because , according to definition of small o
notation if f(n) =o(g(n)) then for ALL constants c 0 you have f(n)
cg(n). or Lim(n-infinite) f(n)/g(n) = 0.
On Sat, Aug 25, 2012 at 10:24 PM, vishal yadav vishalyada...@gmail.comwrote:
Because you can always find a
How about using rand()%n ??
Like, calculate lucky_pos = rand()%n
Then print word at lucky_pos th position...
Am I missing anything? All words are still equiprobable to get printed
right?
On Aug 20, 2012 11:45 AM, Dave dave_and_da...@juno.com wrote:
@Navin: Okay. Here is a paraphrase. Assume
Q1. Design a data structure for the following operations:
I.Enqueue
II. Dequeue
III. Delete a given number(if it is present in the queue, else
do nothing)
IV. isNumberPresent
All these operations should take O(1) time.
Q2. Check if a
@Kunal: Yes. You are missing that you don't know the number of words in the
file in advance. So, to use your method, you would have to read the file
once to find n, and then read through it again to select the lucky_pos th
word. The method I proposed only requires reading the file once.
