from:"Praveen"

Steps:
1)Reverse the list ...
2)Now do the swap two nodes... consecutively...

PRAVEEN RAJ
DELHI COLLEGE OF ENGINEERING

-- 
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 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: MS Q

Idea:
1)Take count =0;
2) make Outer loop ...and search for 1's .
3) Start ...searching for 1 consecutively...
and make it ..0 untill all consecutive 1's becomes 0..
and then count++
4) go to 1) untill all 1's finished..

  count will give the total number of islands...


PRAVEEN RAJ
DELHI COLLEGE OF ENGINEERING

-- 
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 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] anybody c output?

hello world must be o/p... but don't understand abt the o/p in ideone...

PRAVEEN RAJ
DELHI COLLEGE OF ENGINEERING

-- 
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 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: sort 2D array

This can be done... k way merge...

c- number of columns
r- number of rows

In O(c*r*log(r))

PRAVEEN RAJ
DELHI COLLEGE OF ENGINEERING

-- 
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 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: MS Q

name it.

PRAVEEN RAJ
DELHI COLLEGE OF ENGINEERING



On Wed, Jan 25, 2012 at 12:45 AM, atul anand atul.87fri...@gmail.comwrote:

 @Praveen : i have doubt in your algo...it seem it may fail for some
 cases...

 On Tue, Jan 24, 2012 at 5:59 PM, praveen raj praveen0...@gmail.comwrote:

 Idea:
 1)Take count =0;
 2) make Outer loop ...and search for 1's .
 3) Start ...searching for 1 consecutively...
 and make it ..0 untill all consecutive 1's becomes 0..
 and then count++
 4) go to 1) untill all 1's finished..

   count will give the total number of islands...


 PRAVEEN RAJ
 DELHI COLLEGE OF ENGINEERING

  --
 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
 algogeeks+unsubscr...@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, send email to algogeeks@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.


-- 
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 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: Amazon ques

2012-01-22 Thread praveen raj

Answer is already given in group  search it...

PRAVEEN RAJ
DELHI COLLEGE OF ENGINEERING

-- 
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 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] suggest algo

2012-01-13 Thread praveen raj

Steps:

1) hashmapping and to keep track of value with its count..
2)now put these elements in 2D array...m[r][2].r - number of different
elements...
1st
col...have... the value..

 2nd col...have ..the frequency..
3) Now run the randomized partition...and find (n-k)th smallest according
to frequency.take k elements... below it...have most frequent
elements


PRAVEEN RAJ
DELHI COLLEGE OF ENGINEERING

-- 
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 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: Longest sequence of numbers with atmost diff K

2012-01-02 Thread praveen raj

this is like a DP problem to me

1) build a 2 D array .
2) store If  difference b/w any  two number  is = K then M[i,j]=1
else M[i,j]=0
3) Now find max size square (containing all ones) by using Dynamic
Programming.

PRAVEEN RAJ
DELHI COLLEGE OF ENGINEERING

-- 
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 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: Generate all possible binary trees given in-order traversal

2011-12-30 Thread praveen raj

int countBT(int N)
{
  int count =0;
  int count1;
  if(N==0)
 return 0;
   if(N=1)
 return 1;
 else
   {
   for(int j=1;j=N;j++)
   {
  count1 = countBT(j-1)
  count2 =countBT(N-j);
  count+=(count1*count2);
}
  return (count);
}
}



PRAVEEN RAJ
DELHI COLLEGE OF ENGINEERING

-- 
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 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: Generate all possible binary trees given in-order traversal

2011-12-30 Thread praveen raj

yes... right...
i forget to remove this statement..


PRAVEEN RAJ
DELHI COLLEGE OF ENGINEERING



On Fri, Dec 30, 2011 at 2:17 PM, Lucifer sourabhd2...@gmail.com wrote:

 @praveen

 I think what u are doing above is the following:
 Say, F(n) denotes the no. of binary trees that can be formed using N
 elements given the inorder sequence..

 F(n) = SumOver(i= 1 to N) { F(i-1) * F(N-i) }

 which is nothing but..
 F(N) = (2n C n)/ (n+1) i.e. catalan's no.

 Also, i would like to mention that in ur code probably u need to
 remove the following condition otherwise u result outcome will always
 be zero..

 *
 if(N==0) return 0;


 On 30 Dec, 13:41, praveen raj praveen0...@gmail.com wrote:
  int countBT(int N)
  {
int count =0;
int count1;
if(N==0)
   return 0;
 if(N=1)
   return 1;
   else
 {
 for(int j=1;j=N;j++)
 {
count1 = countBT(j-1)
count2 =countBT(N-j);
count+=(count1*count2);
  }
return (count);
  }
 
  }
 
  PRAVEEN RAJ
  DELHI COLLEGE OF ENGINEERING

 --
 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
 algogeeks+unsubscr...@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, send email to algogeeks@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.

Re: [algogeeks] Re: Find even length palindrome.

2011-12-30 Thread praveen raj

The Question is: whther there exist a even length pallindrome or not

since for even ... the two consecutive character will be equal...

so find two character which are equal.. consecutively..


PRAVEEN RAJ
DELHI COLLEGE OF ENGINEERING

-- 
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 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: amazon ques

2011-12-29 Thread praveen raj

IT will grt help for me... if u all tell me..

mapstring,int m;

m[topcoder]=2



My question is this:

 Is 2 is an key value??or index value of hash table...??...

kindly explain how actual mapping is done... in hash table...plz...


PRAVEEN RAJ
DELHI COLLEGE OF ENGINEERING



On Tue, Dec 27, 2011 at 9:00 PM, Jagannath Prasad Das
jpdasi...@gmail.comwrote:

 @shashank and @samm: Is the deletion and searching is o(1). I doubt

 On Sat, Oct 1, 2011 at 6:30 PM, SAMM somnath.nit...@gmail.com wrote:

 Yaa it will work , but in case of deletion don't u think array will
 not as efficient as linked list becoz  array is Static we need to
 define the memory b4 hand..

 On 10/1/11, WgpShashank shashank7andr...@gmail.com wrote:
  @All Why don't try with combination of* hash-table  Array* , It Will
 Work ,
  try it out :P
 
 
  Thanks
  Shashank Mani
  CSE, BIT Mesra
 
  --
  You received this message because you are subscribed to the Google
 Groups
  Algorithm Geeks group.
  To view this discussion on the web visit
  https://groups.google.com/d/msg/algogeeks/-/v_MplK3KzegJ.
  To post to this group, send email to algogeeks@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.
 
 


 --
 Somnath Singh

 --
 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
 algogeeks+unsubscr...@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, send email to algogeeks@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.


-- 
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 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Frequency Sort Algo

2011-12-29 Thread praveen raj

steps:

1) use hash mapping to keep track of frequency of each and every element.
2)Then iterate hash table and store in 2D array with 1st column(element
value) and 2nd   column(frequency of element value).
3)sort the row according to second column(i.e frequency).
4)Then Print the element row wise.. .

PRAVEEN RAJ
DELHI COLLEGE OF ENGINEERING

-- 
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 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: Obstacle Avoidance

2011-12-29 Thread praveen raj

Procedure:

1.if out of boundary return 0;
2.If reach final point return 1.
3.if(next point has no obstacle then go for it.. recursively)

PRAVEEN RAJ
DELHI COLLEGE OF ENGINEERING

-- 
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 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: Frequency Sort Algo

2011-12-25 Thread praveen raj

Hashmapping O(n)
On 25-Dec-2011 2:15 AM, sravanreddy001 sravanreddy...@gmail.com wrote:

 any better approach than O(N log N) time?

 maintain a heap of nodes value, count
 for each element, if already present increase the count. Else add the
 elements.

 Max-Heap -- fetch the node, print it count number of times, (time to
 search in heap -- log N)
 doing this for N elements.

  --
 You received this message because you are subscribed to the Google Groups
 Algorithm Geeks group.
 To view this discussion on the web visit
 https://groups.google.com/d/msg/algogeeks/-/rJMBHTFmv8IJ.
 To post to this group, send email to algogeeks@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.


-- 
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 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] NUMBER OF MST ?

2011-12-03 Thread praveen raj

N!/2
On 03-Dec-2011 11:30 PM, Dipit Grover dipitgro...@gmail.com wrote:

 ^ we need to count each permutation and its reverse together as one
possibility since both would result in identical mst.





 --
 Dipit Grover
 B.Tech in Computer Science and Engineering - lllrd year
 IIT Roorkee, India

 --
 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
algogeeks+unsubscr...@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, send email to algogeeks@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.

Re: [algogeeks] Finding Maximum subarray in a circle

2011-11-02 Thread praveen raj

This can be done by kadanes algo..
//suppose n numbers has been stored in array
// i is the intial point
// n is the number of points to be considered  in O(n)
int maxsum(int a[], int N,int i,int n)
{
   int max=0;
int max_end_ here =0;
int max_so_far=0;
 for(int j=i;jN;j++)
  {
  if(j==N)
{   j=0;
N=n-(N-i);
}
   if(maxa[j])
 max=a[j];

  }
if(max0) // // check Is there any positive value or notif not then
return max value..could be least negative number
{
   for(int j=i;jN;j++)  //
{
  if(j==N)
{   j=0;
N=n-(N-i);
}
 max_end_ here= max_end_ here+a[j];
 if(max_end_ here0)
 max_end_ here=0;
 if(max_so_farmax_end_ here)
max_so_far= max_end_ here
 }
  }
else
{  max_so_far=max; // return max value..could be least negative number
  }
  return (max_so_far);
}
With regards,

Praveen Raj
DCE-IT
735993
praveen0...@gmail.com

-- 
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 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: Microsoft Question

Priority Queue:
when popped ... returns the max priority element and if the priorities
of two or more elements are same...then they will popped as they are
inserted ..
when pushed the element : puts the element in the list according to the
priority...

For making priority queue into Queue::
on popping : make priority of every element same... so on popping... the
element...(popped according to which they are inserted)
on pushing : insert the element as same priority as other inserted
elements

For making priority queue into stack..:
make priority of elements in increasing order... .. so on popping the
element... will pop the topmost element(with the highest priority
value)..
on pushing the element... push the element... with the priority value more
than topmost priority value...

With regards,

Praveen Raj
DCE-IT 3rd yr
735993
praveen0...@gmail.com

On Thu, Sep 15, 2011 at 6:37 PM, Yogesh Yadav medu...@gmail.com wrote:

For Stack:

just make a structure:

struct stack_with_priorityqueue
{
int num;
int priority;
struct stack_with_priorityqueue *ptr;
}

now when we add another number just increase the priority... priority++

For Queue:

do same...just decrease priority...priority--

...

On Wed, Sep 14, 2011 at 4:41 PM, bharatkumar bagana
bagana.bharatku...@gmail.com wrote:

The well known examples of priority queue is minheap and maxheap..
i guess the question is how do we implement one of these(at least) using
queue?

On Wed, Sep 14, 2011 at 9:08 AM, Ankuj Gupta ankuj2...@gmail.com wrote:

I guess the functionality of priority should be maintained

On Sep 13, 11:59 pm, Ankur Garg ankurga...@gmail.com wrote:
But dude are u saying stack will be implemented as a map with
value,priority

and then choose element based on priority ?

regards
Ankur

On Tue, Sep 13, 2011 at 10:16 PM, Ankuj Gupta ankuj2...@gmail.com
wrote:

For stack :- Keep incrementing the priority of each pushed element.
So
the last pushed element will have the greatest priority and the
element pushed first will have
lowest priority.
For queue:- keep decrementing the priority of each inserted element.

On Sep 13, 1:45 am, Ankur Garg ankurga...@gmail.com wrote:
How to Implement a Queue with a Priority Queue
Similarly how woud you implement Stack with Priority Queue

--
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
algogeeks+unsubscr...@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, send email to algogeeks@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.

**Please do not print this e-mail until urgent requirement. Go Green!!
Save Papers = Save Trees
*BharatKumar Bagana*
**http://www.google.com/profiles/bagana.bharatkumarhttp://www.google.com/profiles/bagana.bharatkumar
*
Mobile +91 8056127652*
bagana.bharatku...@gmail.com

--
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
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] A logical Question

amount displaced by (boat +man + suitcase) = amount displaced by
(boat+man)  + amount displaced by suitcase

therefore no change of level...

With regards,

Praveen Raj
DCE-IT 3rd yr
735993
praveen0...@gmail.com



On Thu, Sep 15, 2011 at 4:24 PM, hary rathor harry.rat...@gmail.com wrote:

 no increase or no decrease

 --
 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
 algogeeks+unsubscr...@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, send email to algogeeks@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.

Re: [algogeeks] Re: Finding connection b/w 2 profiles

@jitesh rightly said... since there is no limit of depth...

we can go for BFS..

we can reduce space by comparing A's and C's profile...
whatever is common ... we can use it to find connection...  between A and C


With regards,

Praveen Raj
DCE-IT 3rd yr
735993
praveen0...@gmail.com



On Wed, Sep 14, 2011 at 4:31 PM, JITESH KUMAR jkhas...@gmail.com wrote:

 Using DFS we can stuck in the blind ally as there is not limit of depth..


 On Wed, Sep 14, 2011 at 4:16 PM, tech coder techcoderonw...@gmail.comwrote:

 we can also use dfs and find if there exist  path  between given two
 nodes(profiles here).
 if yea , there is a connection b/w two profiles.


 On Wed, Sep 14, 2011 at 1:58 PM, Azhar Hussain azhar...@gmail.comwrote:

 Union Find Algorithm would do

 -
 Azhar.


 On Wed, Sep 14, 2011 at 1:42 PM, JITESH KUMAR jkhas...@gmail.comwrote:

 Neither depth is known nor we have to find the shortest path. We just
 have to find the path.


 --
 *Regards
 Jitesh Kumar
 *

 --
 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
 algogeeks+unsubscr...@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, send email to algogeeks@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.


  --
 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
 algogeeks+unsubscr...@googlegroups.com.
 For more options, visit this group at
 http://groups.google.com/group/algogeeks?hl=en.




 --
 *Regards
 Jitesh Kumar

 There is only one 'YOU' in this world. You are Unique and Special.
 *
 *Don't Ever Forget it.*

  --
 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
 algogeeks+unsubscr...@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, send email to algogeeks@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.

Re: [algogeeks] pgm2

if length is even : then every element must occurs even times
if length is odd : then every element must occurs even times except one
element occurs odd...

With regards,

Praveen Raj
DCE-IT
735993
praveen0...@gmail.com

-- 
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 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] explain the output..!!

grt :)

With regards,

Praveen Raj
DCE-IT 3rd yr
735993
praveen0...@gmail.com

-- 
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 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: Exchanging bit values in a number

int func(int x)
{
int  y=(1i)+(1j);
 int z=xy;// if after bitwise and  ..we get power of 2 then ...
we have to flip the bits..
if((z(z-1))==0)
   return(x^y);
else
  return x;
}

With regards,

Praveen Raj
DCE-IT
735993
praveen0...@gmail.com




-- 
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 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: Modified binary search

2011-10-28 Thread praveen raj

+1 Gene

With regards,

Praveen Raj
DCE-IT 3rd yr
735993
praveen0...@gmail.com



On Wed, Sep 28, 2011 at 1:36 AM, Gene gene.ress...@gmail.com wrote:

 Indeed you must be given that all the array elements are unique or at
 least that there are no more than floor(n/2) repeats). Otherwise this
 is impossible.  The simplest way to think about it is first to search
 for i such that a[i]  a[i+1].  At that point you know there are two
 sorted ranges a[0]..a[i] and a[i+1] to a[n-1], so you can use regular
 binary search on each of these pieces.

 So how to find i?  This is itself a binary search. At each stage,
 check whether a[0]  a[mid] and a[mid]  a[n-1].  The half that passes
 this test contains i.  So throw away the other.

 On Sep 27, 10:01 am, Decipher ankurseth...@gmail.com wrote:
  A given sorted array is rotated unknown number of times , write a C/C++
 code
  to find an element in the sorted array in O(log n) time .
 
  I know the solution to this problem is through binary search , but don't
  know the exact solution . Please help !!

 --
 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
 algogeeks+unsubscr...@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, send email to algogeeks@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.

Re: [algogeeks] Re: FACEBOOK ONLINE CODING ROUND

2011-10-27 Thread praveen raj

logic:

N=3.. k=5th(position).length...

no. of setbit :0...

000  k =5

no. of setbit :1.. on every loop get next number of same number of bits and
decrement k by 1.
001k = 4
010k=3
100k= 2

no. of setbit: 2
011 k=1..
101
110

Therefore answer is 011

complexity : O(n)...


With regards,

Praveen Raj
DCE-IT
735993
praveen0...@gmail.com

-- 
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 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: FACEBOOK ONLINE CODING ROUND

2011-10-26 Thread praveen raj

code::

#include stdio.h
#includeconio.h

void check(int count, int k,int max)
{
 int right,leftmost,rightmost;

   if(k==1)
  return;

right=count(-count);
leftmost=count+right;
rightmost=count^leftmost;
rightmost=rightmost/right;
rightmost=rightmost2;
count=leftmost|rightmost;
 if(count=max)
   return;
  k=k-1;

check(count,k,max);
}

void func(int n,int k)
{
int count =1,j,max;
if(k==1)
 printf(%d\n,0);
else
{
   k=k-1;
   for(int i=1;i=n;i++)
   {
 count=1;
 j=1;
 max=1n;
 while(j!=i)
 {count=(count1)+1;
 j++;
 }
 check(count,k,max);
 if(k==1)
 { printf(%d\n,count);
break;
 }
else
 k=k-1;
 }
 }

}

int main()
{
func(7,127);//left for N0 and and right for K..chech for any other
values
  getch();
  return 0;
 }


Tell me .. if u find any  test cases failed...Thankx...


With regards,

Praveen Raj
DCE-IT 3rd yr
735993
praveen0...@gmail.com



On Wed, Oct 26, 2011 at 1:56 PM, praveen raj praveen0...@gmail.com wrote:

 made it.. :)

 With regards,

 Praveen Raj
 DCE-IT 3rd yr
 735993
 praveen0...@gmail.com




 On Tue, Oct 25, 2011 at 11:13 AM, raju nikutel...@gmail.com wrote:

 @icy
 It's still there except that you'll get a different question.
 That page promises you a telephone interview if you solve the challenge
 but I don't know how true that is for non-US guys ..
 i solved one question two weeks back  .. and no one contacted me till now
 ..

 ~raju


 On Tue, Oct 25, 2011 at 3:27 AM, icy` vipe...@gmail.com wrote:

 is this contest still going? if so, where ?  i have a solution that
 does
 (100, 1267650600228229401496703205376 )(just one hundred 1's)
 in 0.03 seconds in an older ruby on an older pc

 I'd like to submit ;P


 On Oct 21, 10:48 pm, sunny agrawal sunny816.i...@gmail.com wrote:
  yea i know 1st Approach is much better and is Only O(N^2) for
  precomputing all the values for nck and then O(k) for finding no of
  bits set in The Kth number and another loop of O(k) to find the
  required number
 
  i posted 2nd approach in the context to vandana's tree approach of
  sorting 2^N numbers, rather simply sort the numbers in the array...
  and this approach is O(N*2^N)
 
  On 10/21/11, sravanreddy001 sravanreddy...@gmail.com wrote:
 
 
 
 
 
 
 
 
 
   @Sunny.. why do we need an O(2^N) complexity?
 
   for a value of N=40-50, the solution is not useful..
 
   but, your 1st approach is lot better and i have got it too..
 
   1. O(N) complexity to search the k. (k bits in the numbers)  x-
 (sigma 1-k
   (n C i))
   2. again, keep substracting (k-i) for i= 0-k-1  so.. O(k) here
   and recursively performing step 2. (worst case complexity is O(T))
   where T = nCk
 
   O(N) + O(T) == O(T) as it dominates the given number. unless it
 doesn't
   fall in the range.. or   equivalently --  max( O(T), O(N) )
 
   --
   You received this message because you are subscribed to the Google
 Groups
   Algorithm Geeks group.
   To view this discussion on the web visit
  https://groups.google.com/d/msg/algogeeks/-/NJR9l-UB7c8J.
   To post to this group, send email to algogeeks@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.
 
  --
  Sunny Aggrawal
  B.Tech. V year,CSI
  Indian Institute Of Technology,Roorkee

 --
 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
 algogeeks+unsubscr...@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, send email to algogeeks@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.




-- 
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 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: Amazon OS question

2011-10-26 Thread praveen raj

good question..

With regards,

Praveen Raj
DCE-IT 3rd yr
735993
praveen0...@gmail.com



On Tue, Sep 27, 2011 at 6:40 AM, Kunal Patil kp101...@gmail.com wrote:

 Nice question  nice answer... :)


 On Tue, Sep 27, 2011 at 6:25 AM, UTKARSH SRIVASTAV 
 usrivastav...@gmail.com wrote:

 what's the algo of this question


 On Mon, Sep 26, 2011 at 2:38 PM, vikas vikas.rastogi2...@gmail.comwrote:

 simple graph question,
 graph is given as list , just check the dependancy

 On Sep 25, 6:25 pm, siva viknesh sivavikne...@gmail.com wrote:
  thanks a lot yogesh...
 
  On Sep 25, 2:23 pm, Yogesh Yadav medu...@gmail.com wrote:
 
   T1-T2-T3-T6
   T1-T2-T4-T7
   T1-T2-T5-T8
 
   2 Processor:
   (T1-T2) ..2 TS
   (T3T4)...1 TS
   (T6T5)...1 TS
   (T7T8)...1 TS
 
   4 Processor
   (T1-T2) ..2 TS
   (T3T4T5)...1 TS
   (T6T7T8)...1 TS
 
   .
   On Sun, Sep 25, 2011 at 2:33 PM, siva viknesh 
 sivavikne...@gmail.comwrote:
 
plz give detailed explanation
 
On Sep 25, 1:58 pm, siva viknesh sivavikne...@gmail.com wrote:
 can u plz giv the sequence
 
 On Sep 25, 11:36 am, Sanjay Rajpal srn...@gmail.com wrote:
 
  yah rite answer would be 5 and 4 resp.
  Sanju
  :)
 
  On Sat, Sep 24, 2011 at 10:04 PM, Dheeraj Sharma 
 
  dheerajsharma1...@gmail.com wrote:
   5  4?
 
   On Sun, Sep 25, 2011 at 9:33 AM, sivaviknesh s 
sivavikne...@gmail.comwrote:
 
   A parallel program consists of 8 tasks – T1 through T8. Each
 task
requires
   one time step to be executed on a single processor. Let X -
 Y
denote the
   fact that task X must be executed before task Y is executed.
 Suppose
only
   the tasks X, Y are to be executed. On any multiprocessor
 machine it
would
   require at least 2 time steps since in the first step X
 could be
executed,
   and Y could be executed in the next time step (since it
 requires X
to
   complete first). Now, suppose the following dependencies
 exist
between the
   tasks T1 – T8:
 
   T1 - T2
 
   T2 - T3
 
   T3 - T6
 
   T2 - T4
 
   T4 - T7
 
   T2 - T5
 
   T5 - T8
 
   What is the minimum number of time steps required to execute
 these 8
tasks
   on a 2 processor machine and a 4 processor machine?
 
   a)4  2
 
   b)5  2
 
   c)5  4
 
   d)6  2
 
   --
   Regards,
   $iva
 
   --
   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
   algogeeks+unsubscr...@googlegroups.com.
   For more options, visit this group at
  http://groups.google.com/group/algogeeks?hl=en.
 
   --
   *Dheeraj Sharma*
   Comp Engg.
   NIT Kurukshetra
 
   --
   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
   algogeeks+unsubscr...@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, send email to algogeeks@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.

 --
 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
 algogeeks+unsubscr...@googlegroups.com.
 For more options, visit this group at
 http://groups.google.com/group/algogeeks?hl=en.




 --
 *UTKARSH SRIVASTAV
 CSE-3
 B-Tech 3rd Year
 @MNNIT ALLAHABAD*


  --
 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
 algogeeks+unsubscr...@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, send email to algogeeks@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.


-- 
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

Re: [algogeeks] adobe question help

2011-10-25 Thread praveen raj

N=(N(  (~0j) | (~(1i))) | (Mi)

With regards,

Praveen Raj
DCE-IT
735993
praveen0...@gmail.com



On Tue, Oct 25, 2011 at 11:46 AM, Bittu Sarkar bittu...@gmail.com wrote:

 N = (N | ((1(j-i+1)-1)i)  (Mi);


 On 12 October 2011 01:22, prasad jondhale jondhale.pra...@gmail.comwrote:

 grt

  --
 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
 algogeeks+unsubscr...@googlegroups.com.
 For more options, visit this group at
 http://groups.google.com/group/algogeeks?hl=en.




 --
 Bittu Sarkar
 5th Year Dual Degree Student
 Department of Computer Science  Engineering
 Indian Institute of Technology Kharagpur

  --
 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
 algogeeks+unsubscr...@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, send email to algogeeks@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.

Re: [algogeeks] Questions on Hashing ...Share ur ideas...

2011-10-25 Thread praveen raj

problem 4.. good question...

With regards,

Praveen Raj
DCE-IT 3rd yr
735993
praveen0...@gmail.com



On Tue, Oct 25, 2011 at 5:57 PM, kumar raja rajkumar.cs...@gmail.comwrote:

 Problem 1: Remove duplicate elements from an unsorted array of size N
 Problem 2: Find intersection of K unsorted array of N elements each.
 Intersection consists of elements that appear in all the K arrays.
 Problem 3: How to make a linked list support operations in O(1) time. The
 operations on linked list can be insertion after any arbitrary valued node,
 deletion of any arbitrary valued node
 Problem 4: Find all unique pairs of element in an array that sum to S. For
 ex. If array = {2,4,6,4,6} and S = 8 then answer is {2,6, 4,4}
 Problem 5: Consider an array containing unique elements. Find a triplet of
 elements in the array that sum to S (extension of problem 4). Can hashtables
 improve the running time of your algorithm.
 Problem 6: Consider two strings of size M, N. Perform string matching in
 size O(M+N).
 Problem 7: Find top K most frequent elements in an array of size N.
 Problem 8: Given a file with N integers. Find top K most frequent
 integers. Assume N to be very large such that all the N numbers cannot fit
 into memory. Design for the worst case.



 --
 Regards
 Kumar Raja
 M.Tech(SIT)
 IIT Kharagpur,
 10it60...@iitkgp.ac.in


  --
 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
 algogeeks+unsubscr...@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, send email to algogeeks@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.

Re: [algogeeks] Amazon Onsite

2011-10-24 Thread praveen raj

I will choose the point where amount of fuel is maximum choose the
shortest path from two direction (clockwise or anticlockwise)..

With regards,

Praveen Raj
DCE-IT 3rd yr
735993
praveen0...@gmail.com



On Mon, Oct 24, 2011 at 4:36 PM, Aniket aniket...@gmail.com wrote:

 Suppose there is a circle. You have five points on that circle. Each
 point corresponds to a petrol pump. You are given two sets of data.

 1. The amount of petrol that petrol pump will give.
 2. Distance from that petrol pump tp the next petrol pump.

 (Assume for 1 lit Petrol the truck will go 1 km)

 Now calculate the first point from where a truck will be able to
 complete the circle.
 (The truck will stop at each petrol pump and it has infinite
 capacity).
 Give o(n) solution. You may use o(n) extra space.

 --
 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
 algogeeks+unsubscr...@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, send email to algogeeks@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.

Re: [algogeeks] K-best assignment problem

2011-10-24 Thread praveen raj

Its like a queen problem ...with row and column are not same..

With regards,

Praveen Raj
DCE-IT 3rd yr
735993
praveen0...@gmail.com



On Tue, Oct 18, 2011 at 12:06 AM, Don dondod...@gmail.com wrote:

 Given a cost matrix with N columns and M rows such that M=N, find the
 K lowest total cost ways to select one item from each column, with the
 restriction that only one item may be selected from any row.

 Don

 --
 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
 algogeeks+unsubscr...@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, send email to algogeeks@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.

Re: [algogeeks] choosing numbers

2011-10-24 Thread praveen raj

for 3 set .. set value stored in array a[3] and p is the sum

for( i=0;i=a[0];i++)
{
   for(j=0;j=a[1];j++)
 {
  for(k=a[2];k=0;k--)
{
  if((i+j+k)p)  // improve running time
break;

if((i+j+k)==p)
 coutijk;
}
 }
}

With regards,

Praveen Raj
DCE-IT 3rd yr
735993
praveen0...@gmail.com



On Mon, Oct 24, 2011 at 3:00 AM, Piyush Kapoor pkjee2...@gmail.com wrote:

 Suppose u choose ith element from the Kth set,then
 dp[K][Sum]=sum(from i=0 to number of elements in the Kth set)
 dp[K-1][Sum-(ith element of Kth set)]

 On Sun, Oct 23, 2011 at 3:31 PM, cegprakash cegprak...@gmail.com wrote:

 hi i recently came across this problem..

 there are K sets
 each sets can contain n numbers from 0 to n
 we've to choose exactly one number from each set
 the sum of all the elements that we chose should be equal to P.
 we have to find how many such possibilities are there to choose so..

 for example

 assume there are 3 sets containing 1,2,3 elements in them
 so the first set contains 0 and 1
 second set contains 0,1 and 2
 third set contains 0,1,2 and 3

 assume P=2

 in this case there are 5 possibilities

 (0,0,2), (0,1,1), (0,2,0), (1,0,1), (1,1,0)

 i'm struggling for a DP solution!! help me out

 --
 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
 algogeeks+unsubscr...@googlegroups.com.
 For more options, visit this group at
 http://groups.google.com/group/algogeeks?hl=en.




 --
 *Regards,*
 *Piyush Kapoor,*
 *2nd year,CSE
 IT-BHU*

  --
 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
 algogeeks+unsubscr...@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, send email to algogeeks@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.

Re: [algogeeks] Amazon Question - Find Pythagorean triplet in an unsorted array

2011-10-13 Thread praveen raj

N2 would me minimum
On 13-Oct-2011 11:08 PM, ravindra patel ravindra.it...@gmail.com wrote:

 Hi,
 Another question I faced in Amazon F2F.

 Given an unsorted array of integers, find all triplets that satisfy x^2 +
 y^2 = z^2.

 For example if given array is -  1, 3, 7, 5, 4, 12, 13
 The answer should be -
 5, 12, 13 and
 3, 4, 5

 I suggested below algo with complexity O(n^2) -

 - Sort the array in descending order. - O(nlogn)
 - square each element. - O(n)

 Now it reduces to the problem of  finding all triplets(a,b,c) in a
 sorted array such that a = b+c.

 The interviewer was insisting on a solution better than O(n^2) which I dont
 think is feasible, but I couldn't prove that. Anyone has any idea.



 Thanks,
 - Ravindra

 --
 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
 algogeeks+unsubscr...@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, send email to algogeeks@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.

Re: [algogeeks] citrix question

2011-10-08 Thread praveen raj

Kernel.
On 08-Oct-2011 11:33 AM, raj kumar megamonste...@gmail.com wrote:


 * Which of the following restricts a process to the memory allocated to it
 *
 *
 *a. stack pointers
 b. memory allocation hardware
 c. kernel
 d. none of these

 what's the answer of this question

 --
 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
 algogeeks+unsubscr...@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, send email to algogeeks@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.

Re: [algogeeks] citrix question

2011-10-08 Thread praveen raj

Plz put more question that has beem asked in citrix.
On 08-Oct-2011 11:33 AM, raj kumar megamonste...@gmail.com wrote:


 * Which of the following restricts a process to the memory allocated to it
 *
 *
 *a. stack pointers
 b. memory allocation hardware
 c. kernel
 d. none of these

 what's the answer of this question

 --
 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
 algogeeks+unsubscr...@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, send email to algogeeks@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.

[algogeeks] Help sourcebit !!!

2011-10-05 Thread praveen raj

Plz put the technical written paper pattern ...of sourcebit... and some
sample papers...of what type of questions(level) would be asked...

-- 
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 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: Number of Multiplications

Make two conditions for even and odd power. and use it to make solve
higher power
That could be solved in log b time
.
On 30-Sep-2011 4:12 AM, Dave dave_and_da...@juno.com wrote:

 @Don, Ankuj. I believe that Don's algorithm uses precisely
 floor{log_2(b)) + (the number of one bits in b) - 1.

 Dave

 On Sep 29, 1:38 pm, Don dondod...@gmail.com wrote:
  Because a^b = (a*a)^(b/2), so each multiplication reduces the exponent
  by half. Therefore the number of multiplications is (roughly) log2 b.
 
  int pow(int a, int b)
  {
int result = a;
while(b  1)
{
  result *= (b1) ? a*result : result;
  b = 1;
}
return result;
 
  }
 
  You can see that a^16 will require 4 multiplications, which is
  log2(16), but a^15 will require 6 multiplications (an alternative
  algorithm could do it in 4 multiplications and a division).
 
  Also note that the function above is only correct for b  0.
 
  Don
 
  On Sep 29, 12:54 pm, Ankuj Gupta ankuj2...@gmail.com wrote:
 
 
 
   How do you deduce number of multiplication  that when we perform a^b
   function using dividing the exponent by 2 at each stage to be log b?-
Hide quoted text -
 
  - Show quoted text -

 --
 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
algogeeks+unsubscr...@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, send email to algogeeks@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.

Re: [algogeeks] Amazon - array problem

Take two array... one will take care of left products... and othr will take
care of right product.. at any index left[i]=A[i-1]*left[i-1]  starting
from left and right[i]= A[i+1]*right[i+1] starting frm right……

-- 
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 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: Infinite Array

@don we dnt hve ny info about arrangement...

-- 
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 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Explain output

Ptr cannot be used to allocate block of memory
.. void pointer use only to store address...

-- 
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 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: Directi Questions - needed answers

@nitin Plz explain how u have reached answer of question no. 4 and 6
On 19-Sep-2011 12:26 AM, Nitin Garg nitin.garg.i...@gmail.com wrote:

 Answer  3 - 100
 Answer 6 - 103
 Answer 4 - 194 total processes including the parent
 Answer 7 - 12 km south, 12 km east


 On Sun, Sep 18, 2011 at 11:53 PM, Ashima . ashima.b...@gmail.com wrote:

 @malay: how cm n+logn-2?
 cn u explain the logic ?

 Ashima
 M.Sc.(Tech)Information Systems
 4th year
 BITS Pilani
 Rajasthan




 On Sun, Sep 18, 2011 at 11:07 AM, Ashima . ashima.b...@gmail.com wrote:

 rite! 62.5%

 Ashima
 M.Sc.(Tech)Information Systems
 4th year
 BITS Pilani
 Rajasthan




 On Sat, Sep 17, 2011 at 9:04 PM, malay chakrabarti m1234...@gmail.com
wrote:

 create a tournament tree.in each round one value is eliminated to
obtain in the process the winner or the highest value in n-1 comparisons.
Then check the queue of the winner which contains log(n) entries of the
values beaten by the winner which implicitly will contain the runners
up.Then log(n)-1 comparisons to find the highest among all the losers whom
the winner had beaten. So all over complexity will be n-1 +log(n) -1 =
n+log(n)-2. Hp that answers ur query. nice question btw :)


 On Sun, Sep 18, 2011 at 8:02 AM, VIHARRI viharri@gmail.com wrote:

 hey i'm also thinking n + logn -2.. but couldnt able to figure out
 how??? can you please explain the logic

 --
 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
algogeeks+unsubscr...@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, send email to algogeeks@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.



 --
 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
algogeeks+unsubscr...@googlegroups.com.
 For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.




 --
 Nitin Garg

 Personality can open doors... but only Character can keep them open

 --
 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
algogeeks+unsubscr...@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, send email to algogeeks@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.

Re: [algogeeks] Re: Directi Questions - needed answers

For question 2 see ashima link.
On 19-Sep-2011 1:43 PM, Nitin Garg nitin.garg.i...@gmail.com wrote:

 Can someone tell answers to question 2 and 5 with explanation??




 On Mon, Sep 19, 2011 at 1:40 PM, Nitin Garg nitin.garg.i...@gmail.com
wrote:

 In Question 4 i just kept counting new processes that are being added in
every iteration.
 No. of new processes being created is equal to the already running no. of
even pid processes.

 Time - PId
 0  - 0  1
 1 - 0,12
 2, - 0,1,23
 3, - 0,1,2,3,4  5
 4 - 0,1,2,3,4,5,6,7   8
 .
 .
 .



 1,2,3,5,8,11,17,25,38,57,86,129,194

 I kept counting, got 194.
 Don't know of any shortcut.





 On Mon, Sep 19, 2011 at 1:35 PM, Nitin Garg nitin.garg.i...@gmail.com
wrote:

 Question 6 -
 Intuitively you can see that the greater the sum is, the greater the
favorable events in sample space.

 e.g. - sum = 1 .. cases {(1)}   Pr = 1/6
 sum = 2 cases {(2),(1,1)}   Pr = 1/6 + 1/36
 sum = 3cases {(3),(2,1)(1,2)(1,1,1)}  Pr = 1/6 + 1/36 +1/36
+ 1/216


 for a more formal proof, look at the recursion -


 P(k) = (P(k-6) + P(k-5) + P(k-4)... P(k-1)))/6

 where P(0) = 1, P(i) = 0  for i0

 Base case -
 P(2)  P(1)

 Hypothesis -

 P(i)  P(i-1) for  all i = k

 To prove
 P(k+1)   P(k)

 Proof
 P(k+1) - P(k) = (P(k) - P(k-6))/6  0








 On Mon, Sep 19, 2011 at 1:04 PM, Nitin Garg nitin.garg.i...@gmail.com
wrote:

 Question 3 -
 To eliminate one player, you need to host atleast 2 matches and make
him loose in both 2. These 2 matches can not contribute to elimination of
any other player.
 So, min 2 matches for every player who is to be eliminated, hence 100.


 On Mon, Sep 19, 2011 at 11:54 AM, Bhanu Chowdary 
bhanuchowd...@gmail.com wrote:

 @Nitin: Answer to question 3 is 50.


 On Mon, Sep 19, 2011 at 11:44 AM, praveen raj praveen0...@gmail.com
wrote:

 @nitin Plz explain how u have reached answer of question no. 4 and 6


 On 19-Sep-2011 12:26 AM, Nitin Garg nitin.garg.i...@gmail.com
wrote:
 
  Answer  3 - 100
  Answer 6 - 103
  Answer 4 - 194 total processes including the parent
  Answer 7 - 12 km south, 12 km east
 
 
  On Sun, Sep 18, 2011 at 11:53 PM, Ashima . ashima.b...@gmail.com
wrote:
 
  @malay: how cm n+logn-2?
  cn u explain the logic ?
 
  Ashima
  M.Sc.(Tech)Information Systems
  4th year
  BITS Pilani
  Rajasthan
 
 
 
 
  On Sun, Sep 18, 2011 at 11:07 AM, Ashima . ashima.b...@gmail.com
wrote:
 
  rite! 62.5%
 
  Ashima
  M.Sc.(Tech)Information Systems
  4th year
  BITS Pilani
  Rajasthan
 
 
 
 
  On Sat, Sep 17, 2011 at 9:04 PM, malay chakrabarti 
m1234...@gmail.com wrote:
 
  create a tournament tree.in each round one value is eliminated
to obtain in the process the winner or the highest value in n-1 comparisons.
Then check the queue of the winner which contains log(n) entries of the
values beaten by the winner which implicitly will contain the runners
up.Then log(n)-1 comparisons to find the highest among all the losers whom
the winner had beaten. So all over complexity will be n-1 +log(n) -1 =
n+log(n)-2. Hp that answers ur query. nice question btw :)
 
 
  On Sun, Sep 18, 2011 at 8:02 AM, VIHARRI viharri@gmail.com
wrote:
 
  hey i'm also thinking n + logn -2.. but couldnt able to figure
out
  how??? can you please explain the logic
 
  --
  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
algogeeks+unsubscr...@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, send email to algogeeks@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.
 
 
 
  --
  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
algogeeks+unsubscr...@googlegroups.com.
  For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
 
 
 
 
  --
  Nitin Garg
 
  Personality can open doors... but only Character can keep them
open
 
  --
  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
algogeeks+unsubscr...@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, send email to algogeeks

Re: [algogeeks] Re: Directi Questions - needed answers

Given in the question
.
 On 19-Sep-2011 2:57 PM, Bhanu Chowdary bhanuchowd...@gmail.com wrote:
 @Nithin: Sorry I did not understand your logic!! If a person looses a
match
 he should be knocked out of the tournament. Could you please explain why 2
 matches to knock out a person??

 On Mon, Sep 19, 2011 at 2:47 PM, praveen raj praveen0...@gmail.com
wrote:

 For question 2 see ashima link.

 On 19-Sep-2011 1:43 PM, Nitin Garg nitin.garg.i...@gmail.com wrote:
 
  Can someone tell answers to question 2 and 5 with explanation??
 
 
 
 
  On Mon, Sep 19, 2011 at 1:40 PM, Nitin Garg nitin.garg.i...@gmail.com
 wrote:
 
  In Question 4 i just kept counting new processes that are being added
in
 every iteration.
  No. of new processes being created is equal to the already running no.
 of even pid processes.
 
  Time - PId
  0 - 0 1
  1 - 0,1 2
  2, - 0,1,2 3
  3, - 0,1,2,3,4 5
  4 - 0,1,2,3,4,5,6,7 8
  .
  .
  .
 
 
 
  1,2,3,5,8,11,17,25,38,57,86,129,194
 
  I kept counting, got 194.
  Don't know of any shortcut.
 
 
 
 
 
  On Mon, Sep 19, 2011 at 1:35 PM, Nitin Garg nitin.garg.i...@gmail.com

 wrote:
 
  Question 6 -
  Intuitively you can see that the greater the sum is, the greater the
 favorable events in sample space.
 
  e.g. - sum = 1 .. cases {(1)} Pr = 1/6
  sum = 2 cases {(2),(1,1)} Pr = 1/6 + 1/36
  sum = 3 cases {(3),(2,1)(1,2)(1,1,1)} Pr = 1/6 + 1/36 +1/36
 + 1/216
 
 
  for a more formal proof, look at the recursion -
 
 
  P(k) = (P(k-6) + P(k-5) + P(k-4)... P(k-1)))/6
 
  where P(0) = 1, P(i) = 0 for i0
 
  Base case -
  P(2)  P(1)
 
  Hypothesis -
 
  P(i)  P(i-1) for all i = k
 
  To prove
  P(k+1)  P(k)
 
  Proof
  P(k+1) - P(k) = (P(k) - P(k-6))/6  0
 
 
 
 
 
 
 
 
  On Mon, Sep 19, 2011 at 1:04 PM, Nitin Garg 
nitin.garg.i...@gmail.com
 wrote:
 
  Question 3 -
  To eliminate one player, you need to host atleast 2 matches and make
 him loose in both 2. These 2 matches can not contribute to elimination of
 any other player.
  So, min 2 matches for every player who is to be eliminated, hence
100.
 
 
  On Mon, Sep 19, 2011 at 11:54 AM, Bhanu Chowdary 
 bhanuchowd...@gmail.com wrote:
 
  @Nitin: Answer to question 3 is 50.
 
 
  On Mon, Sep 19, 2011 at 11:44 AM, praveen raj 
praveen0...@gmail.com
 wrote:
 
  @nitin Plz explain how u have reached answer of question no. 4 and
6
 
 
  On 19-Sep-2011 12:26 AM, Nitin Garg nitin.garg.i...@gmail.com
 wrote:
  
   Answer 3 - 100
   Answer 6 - 103
   Answer 4 - 194 total processes including the parent
   Answer 7 - 12 km south, 12 km east
  
  
   On Sun, Sep 18, 2011 at 11:53 PM, Ashima . 
ashima.b...@gmail.com
 wrote:
  
   @malay: how cm n+logn-2?
   cn u explain the logic ?
  
   Ashima
   M.Sc.(Tech)Information Systems
   4th year
   BITS Pilani
   Rajasthan
  
  
  
  
   On Sun, Sep 18, 2011 at 11:07 AM, Ashima . 
 ashima.b...@gmail.com wrote:
  
   rite! 62.5%
  
   Ashima
   M.Sc.(Tech)Information Systems
   4th year
   BITS Pilani
   Rajasthan
  
  
  
  
   On Sat, Sep 17, 2011 at 9:04 PM, malay chakrabarti 
 m1234...@gmail.com wrote:
  
   create a tournament tree.in each round one value is
eliminated
 to obtain in the process the winner or the highest value in n-1
comparisons.
 Then check the queue of the winner which contains log(n) entries of the
 values beaten by the winner which implicitly will contain the runners
 up.Then log(n)-1 comparisons to find the highest among all the losers
whom
 the winner had beaten. So all over complexity will be n-1 +log(n) -1 =
 n+log(n)-2. Hp that answers ur query. nice question btw :)
  
  
   On Sun, Sep 18, 2011 at 8:02 AM, VIHARRI 
 viharri@gmail.com wrote:
  
   hey i'm also thinking n + logn -2.. but couldnt able to
figure
 out
   how??? can you please explain the logic
  
   --
   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
 algogeeks+unsubscr...@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, send email to
 algogeeks@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.
  
  
  
   --
   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
 algogeeks+unsubscr...@googlegroups.com.
   For more options, visit this group at
 http://groups.google.com/group/algogeeks?hl=en.
  
  
  
  
   --
   Nitin Garg
  
   Personality can open doors... but only Character can keep them
 open
  
   --
   You received this message because you

Re: [algogeeks] Re: Directi Questions - needed answers

For question 5  reentrant

On 19-Sep-2011 1:43 PM, Nitin Garg nitin.garg.i...@gmail.com wrote:
 Can someone tell answers to question 2 and 5 with explanation??




 On Mon, Sep 19, 2011 at 1:40 PM, Nitin Garg nitin.garg.i...@gmail.com
wrote:

 In Question 4 i just kept counting new processes that are being added in
 every iteration.
 No. of new processes being created is equal to the already running no. of
 even pid processes.

 Time - PId
 0 - 0 1
 1 - 0,1 2
 2, - 0,1,2 3
 3, - 0,1,2,3,4 5
 4 - 0,1,2,3,4,5,6,7 8
 .
 .
 .



 1,2,3,5,8,11,17,25,38,57,86,129,194

 I kept counting, got 194.
 Don't know of any shortcut.





 On Mon, Sep 19, 2011 at 1:35 PM, Nitin Garg nitin.garg.i...@gmail.com
wrote:

 Question 6 -
 Intuitively you can see that the greater the sum is, the greater the
 favorable events in sample space.

 e.g. - sum = 1 .. cases {(1)} Pr = 1/6
 sum = 2 cases {(2),(1,1)} Pr = 1/6 + 1/36
 sum = 3 cases {(3),(2,1)(1,2)(1,1,1)} Pr = 1/6 + 1/36 +1/36 +
 1/216


 for a more formal proof, look at the recursion -


 P(k) = (P(k-6) + P(k-5) + P(k-4)... P(k-1)))/6

 where P(0) = 1, P(i) = 0 for i0

 Base case -
 P(2)  P(1)

 Hypothesis -

 P(i)  P(i-1) for all i = k

 To prove
 P(k+1)  P(k)

 Proof
 P(k+1) - P(k) = (P(k) - P(k-6))/6  0








 On Mon, Sep 19, 2011 at 1:04 PM, Nitin Garg nitin.garg.i...@gmail.com
wrote:

 Question 3 -
 To eliminate one player, you need to host atleast 2 matches and make
him
 loose in both 2. These 2 matches can not contribute to elimination of
any
 other player.
 So, min 2 matches for every player who is to be eliminated, hence 100.


 On Mon, Sep 19, 2011 at 11:54 AM, Bhanu Chowdary 
 bhanuchowd...@gmail.com wrote:

 @Nitin: Answer to question 3 is 50.


 On Mon, Sep 19, 2011 at 11:44 AM, praveen raj praveen0...@gmail.com
wrote:

 @nitin Plz explain how u have reached answer of question no. 4 and 6

 On 19-Sep-2011 12:26 AM, Nitin Garg nitin.garg.i...@gmail.com
 wrote:
 
  Answer 3 - 100
  Answer 6 - 103
  Answer 4 - 194 total processes including the parent
  Answer 7 - 12 km south, 12 km east
 
 
  On Sun, Sep 18, 2011 at 11:53 PM, Ashima . ashima.b...@gmail.com
 wrote:
 
  @malay: how cm n+logn-2?
  cn u explain the logic ?
 
  Ashima
  M.Sc.(Tech)Information Systems
  4th year
  BITS Pilani
  Rajasthan
 
 
 
 
  On Sun, Sep 18, 2011 at 11:07 AM, Ashima . ashima.b...@gmail.com
 wrote:
 
  rite! 62.5%
 
  Ashima
  M.Sc.(Tech)Information Systems
  4th year
  BITS Pilani
  Rajasthan
 
 
 
 
  On Sat, Sep 17, 2011 at 9:04 PM, malay chakrabarti 
 m1234...@gmail.com wrote:
 
  create a tournament tree.in each round one value is eliminated
to
 obtain in the process the winner or the highest value in n-1
comparisons.
 Then check the queue of the winner which contains log(n) entries of
the
 values beaten by the winner which implicitly will contain the runners
 up.Then log(n)-1 comparisons to find the highest among all the losers
whom
 the winner had beaten. So all over complexity will be n-1 +log(n) -1
=
 n+log(n)-2. Hp that answers ur query. nice question btw :)
 
 
  On Sun, Sep 18, 2011 at 8:02 AM, VIHARRI viharri@gmail.com
 wrote:
 
  hey i'm also thinking n + logn -2.. but couldnt able to figure
 out
  how??? can you please explain the logic
 
  --
  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
 algogeeks+unsubscr...@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, send email to algogeeks@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.
 
 
 
  --
  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
 algogeeks+unsubscr...@googlegroups.com.
  For more options, visit this group at
 http://groups.google.com/group/algogeeks?hl=en.
 
 
 
 
  --
  Nitin Garg
 
  Personality can open doors... but only Character can keep them
open
 
  --
  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
 algogeeks+unsubscr...@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, send email to algogeeks@googlegroups.com.
 To unsubscribe from this group, send email to
 algogeeks+unsubscr

Re: [algogeeks] C++ Query

Yes u r saying correct .
On 19-Sep-2011 6:39 PM, teja bala pawanjalsa.t...@gmail.com wrote:
 Why do we pass a reference for copy constructors?
 If it does shallow copy for pass by value (user defined object), how
 will it do the deep copy?


 Ans:- if we don't pass the reference, every time a new object copy
 like

 A a=b;

 constructor will be called twice ,,

 correct me if i'm wrong...

 help me regarding about shallow copy and deep copy in copy
 constructor.

 --
 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
algogeeks+unsubscr...@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, send email to algogeeks@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.

Re: [algogeeks] All valid dictionary words must be found and printed.