hey yar whch book are you doing for OS mcq ??
On Aug 15, 6:07 pm, Kamakshii Aggarwal kamakshi...@gmail.com wrote:
I am confused about the race around..according to me it should be included
with other options,but in the book which i am referring its not included..
On Mon, Aug 15, 2011 at
hi,
can someone pls provide good source from where i can prac mcq on OS .
thx
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
c round-
output que
given an expression - take it any ( 5+((4^5)+(6/7))+(4/8) )- aim was
to ensure that brackets are correctly placed
ds/algo-
1)java virtual machine has 8 byte instruction..calc its instruction
code size
2)there was a code given using lock ,wait and thread..had to tell abt
hi,
can anyone pls tell whats the format of coding section in amazon
online test.
is it something like codechef ? is the format of test cases given ?
Also, usually we write some part of code/function and test it if its
running fine on local system , when it is then we submit at codechef.
If it
not like cc format. first they'll ask ur logic and then they see ur
code. (no submission process)
On Sat, Aug 6, 2011 at 5:45 PM, nivedita arora
vivaciousnived...@gmail.comwrote:
hi,
can anyone pls tell whats the format of coding section in amazon
online test.
is it something like
no online test is happening on campus for us
On Aug 6, 7:17 pm, Nitish Garg nitishgarg1...@gmail.com wrote:
Can anyone shed some light on Amazon Off campus procedure? This online test
is for off campus aspirants right? Also does this online test happen after
the phonic interview?
--
You
, 2011 at 9:14 PM, nivedita arora
vivaciousnived...@gmail.com wrote:
no online test is happening on campus for us
On Aug 6, 7:17 pm, Nitish Garg nitishgarg1...@gmail.com wrote:
Can anyone shed some light on Amazon Off campus procedure? This online
test
is for off campus aspirants right
how does one perform *,%,/ operation on numbers of 100's of digits .
addition i have seen using Link list .but i dont know rest .
can anyone pls give source code
thx!
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send
given an array containing +ve n -ve numbers , can someone give
efficient algo to find the max cont subarray product.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To
i think solution of ankit is right !
sorry even i forgot tht que ws not divisibility test ..but to get
quotient :-|
On Jul 30, 10:03 pm, Ankur Khurana ankur.kkhur...@gmail.com wrote:
@roopam : i got the question all wrong. . .
On Sat, Jul 30, 2011 at 10:01 PM, Roopam Poddar
take a BST whose node has an element of frequency .and another array
which will store order of elements.
for each array element search BST if node already exists increase the
freq count ..other wise add that element in the order array we took
and insert new node in BST.
now , scan the order
this in o(n) time , i suppose your algorithm takes
0(nlogn) time
On Sun, Jul 31, 2011 at 1:14 AM, nivedita arora vivaciousnived...@gmail.com
wrote:
@rahul- balanced BST can be maintained.to remove worst case !
@sukhmeet- i did not gt your method completely ..u are trying to
maintain
that is why i gave BST algo first :)
but rahul wanted me to give O(n) algo
On Jul 31, 1:15 am, Kamakshii Aggarwal kamakshi...@gmail.com wrote:
@nivedita :hashing will not work if the range of nos is high
On Sun, Jul 31, 2011 at 1:40 AM, nivedita arora vivaciousnived...@gmail.com
just to add more on quad trees , quad trees are used for collision
detection http://www.kyleschouviller.com/wsuxna/quadtree-source-included/
even i am not fully clear on quad trees (or m way trees ) , good
que !
On Jul 31, 1:17 am, aditi garg aditi.garg.6...@gmail.com wrote:
How to find min and
Without using /,% and * operators. write a function to divide a number
by 3. itoa() function is available.
all i cn thnk of is to use shift operator and addition , x/3=e^(logx-
log3) or repetitive subtraction
but none of them uses itoa() ..ne idea how its done?
thnks !
--
You received this
30, 2011 at 1:01 AM, sukhmeet singh
sukhmeet2...@gmail.comwrote:
repeated subtraction !!
On Sat, Jul 30, 2011 at 12:52 AM, nivedita arora
vivaciousnived...@gmail.com wrote:
Without using /,% and * operators. write a function to divide a number
by 3. itoa() function is available
at 12:52 AM, nivedita arora
vivaciousnived...@gmail.com wrote:
Without using /,% and * operators. write a function to divide a number
by 3. itoa() function is available.
all i cn thnk of is to use shift operator and addition , x/3=e^(logx-
log3) or repetitive subtraction
17 matches
Mail list logo
