Which edition of barron?
On Wed, Sep 28, 2011 at 6:05 PM, VIHARRI wrote:
> 1. Java uses stack for byte code in JVM - each instruction is of one
> byte, so how many such instructions are possible in an operating
> system.
>
> 2. Three processes p1, p2, p3, p4 - each have sizes 1GB, 1.2GB, 2GB,
>
Sort each of the word and form a trie , if any words comes again you get
one sch case.
On Wed, Jul 18, 2012 at 2:12 PM, vindhya chhabra
wrote:
> yes,sorry count sort will be O(n) so better.thanks
>
> On Wed, Jul 18, 2012 at 1:43 PM, saurabh singh wrote:
>
>> ^sorting a string would be o(n^2logn)
her is 3 2 1 .
>
>
>
> On Wed, Jul 4, 2012 at 5:17 PM, Bhupendra Dubey
> wrote:
>
>> Consider trees:
>>
>> 1 3
>>2 3 2
>>
For question 5.
Even this doesn't seems right
Consider this scenario
Match b/w Winner
a vs b a
a vs c c
b vs c b
What will be order ?? acb or bca
On Wed, Jul 4, 2012 at 5:38 PM, Bhupendra Dubey wrote:
>
nos find maximum value of
next digit say A and so on . Suppose Final no. is CADB
Now next highest permutation will be the no. just greater than this and
made of these digits . This is easy.
On Wed, Jul 4, 2012 at 5:17 PM, Bhupendra Dubey wrote:
> Consider trees:
>
>
Consider trees:
1 3
2 3 2
1
pre order traversal is same still (1 , 2 ,3) even though ist tree doesn't
satisfy the criteria . So I don't think it can be determi
more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
bhupendra dubey
--
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.co
> i dont understan if i look in the pic i attached then the length of
> the first list is 5 and the length of the second list is 6.
> what should i do now?
> if i traverse the long list 5,6 nodes i dont get to the red node.
> what am i missing?
>
> On 1 מאי, 18:04, Bhupendr
.@googlegroups.com.
>> For more options, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, s
roups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
bhupendra dubey
--
You received this message because you are subscribed to the Goo
scribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algoge...@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com
> .
> For more options, visit this group at
> http://g
to this group, send email to algoge...@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
bhupendra dubey
p, send email to
> algogeeks+unsubscr...@googlegroups.com
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
bhupendra dubey
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
T
com
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
bhupendra dubey
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send ema
To post to this group, send email to algoge...@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
bhupendra dubey
--
You recei
;
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algoge...@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.
] or S[j] gives the celebrity in the set;
Complexity:
(max no of times i can be incremented)+(max no of times j can be
decremented)=n
no of questions=n
so O(n)
Bhupendra Dubey
DELHI COLLEGE OF ENGINEERING
On Tue, Dec 21, 2010 at 9:26 AM, sharat wrote:
> It can be thought of as a binary t
geeks+unsubscr...@googlegroups.com
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
bhupendra dubey
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to t
18 matches
Mail list logo
