@neha:can u pls explain ur method?
On Sun, Sep 11, 2011 at 9:09 PM, sukran dhawan sukrandha...@gmail.comwrote:
ya +1 to neha use bitset concept in c++
On Sun, Sep 11, 2011 at 8:24 PM, Neha Singh neha.ndelhi.1...@gmail.comwrote:
for ques 1 use bit manipulation
its more efficient
--
You
dr's get shortlisted and den direct interview..no written test
On Fri, Sep 9, 2011 at 10:27 PM, Dheeraj Sharma dheerajsharma1...@gmail.com
wrote:
can anyone tell me the procedure for IOCL?
paper nd all
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
+91 8950264227
--
You received
@mohit:answer is 19.one is the parent process originally.and 19 more
processes have been created.
On Wed, Sep 7, 2011 at 11:21 PM, Mohit Goel mohitgoel291...@gmail.comwrote:
20 is not in option ..so whats the answer??
--
You received this message because you are subscribed to the Google
what are activation records??
On Fri, Sep 2, 2011 at 9:00 PM, sukran dhawan sukrandha...@gmail.comwrote:
true
On Fri, Sep 2, 2011 at 7:44 PM, priya ramesh
love.for.programm...@gmail.com wrote:
Allocation and deallocation of activation records is always done using a
stack
(LIFO)
develop an algorithm to find duplicates in a list of numbers without using a
binary tree..if there are n distinct numbers in the list ,how many times
must two numbers be compared for equality in your algorithm?what if all
numbers are equal?
--
Regards,
Kamakshi
kamakshi...@gmail.com
--
You
@prateek:can u pls explain y the o/p will be 8??according to me also o/p
should be 4.
On Tue, Aug 30, 2011 at 11:42 PM, PRATEEK VERMA prateek...@gmail.comwrote:
@kartik it's wrong output...output will be 8 bytes.I asked this question
just to give more clear picture of bit field
--
You
On Aug 30, 1:34 pm, Kamakshii Aggarwal kamakshi...@gmail.com wrote:
develop an algorithm to find duplicates in a list of numbers without
using a
binary tree..if there are n distinct numbers in the list ,how many times
must two numbers be compared for equality in your algorithm?what if all
http://ideone.com/o4r4o
but it is calling red and green just two times each..
On Mon, Aug 29, 2011 at 11:06 PM, rajeev bharshetty rajeevr...@gmail.comwrote:
@Anup : I think you should also try to compile and check the answer...
May be I am wrong But compiler won't
On Mon, Aug 29, 2011
let arr[] stores the value of max amount upto each shop that they can rob.
arr[1]=x[1];
arr[2]=x[2];
for(i=3;i=n;i++)
{
arr[i]=max{(arr[i-2]+x[i]),arr[i-1]};
}
arr[n] gives the max amount that can be robbed...
correct me if i am wrong.
@prag:has tejas networks visited ur campus?
On Sun, Aug
what is the initial value of length that u r passing??
On Sun, Aug 28, 2011 at 6:47 PM, prashant thorat
prashantnit...@gmail.comwrote:
Hi, you can do this by recursion ,
printPath (int length)
{
if(lenght == N) return;
else
{
if(lenght+1 = N) { Printf ( --one step --) call printPath
;
}
On Sun, Aug 28, 2011 at 6:54 PM, Kamakshii Aggarwal kamakshi...@gmail.com
wrote:
what is the initial value of length that u r passing??
On Sun, Aug 28, 2011 at 6:47 PM, prashant thorat
prashantnit...@gmail.com wrote:
Hi, you can do this by recursion ,
printPath (int length
@rohit:i got my mistake..insteat of arr[2]=x[2];
it should be arr[2]=max{x[1],x[2]}
so now my code goes lyk this
let arr[] stores the value of max amount upto each shop that they can rob.
arr[1]=x[1];
arr[2]=max{x[1],x[2]};
for(i=3;i=n;i++)
{
arr[i]=max{(arr[i-2]+x[i]),arr[i-1]};
}
arr[n]
can anyone tell about tejas networks recruitment procedure?
and also what topics are being asked?
--
Regards,
Kamakshi
kamakshi...@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
-papers.html
coz i thnk..u r frnd of one of mah close frnd ;)
On Sat, Aug 27, 2011 at 11:45 PM, Kamakshii Aggarwal
kamakshi...@gmail.com wrote:
can anyone tell about tejas networks recruitment procedure?
and also what topics are being asked?
--
Regards,
Kamakshi
kamakshi...@gmail.com
But on dev c it is showing o/p as 2 2 ..
I too have a doubt,a similar question was asked in atrenta's written paper.
On Sun, Aug 21, 2011 at 8:14 PM, Ankur Khurana ankur.kkhur...@gmail.comwrote:
can somebody please explain this ?
On Sun, Aug 21, 2011 at 8:08 PM, Nikhil Gupta
which college?
On Sun, Aug 21, 2011 at 8:56 PM, rashmi i rash...@gmail.com wrote:
Hey, SAP is visiting our college. Any idea about the pattern of the campus
selection process? As in type of questions asked? Thanks
--
R@$!-!
DoN'T LimIt Ur cHaLlEngeS, ChAlLenGe uR LImItS.
--
You
@aditi: ab c-dot ka kya karna hai tujhe?:P
On Fri, Aug 19, 2011 at 7:26 PM, aditi garg aditi.garg.6...@gmail.comwrote:
Do u knw wat type of ques asked in interviews?
Plz post a few as example if u knw...please...
On Fri, Aug 19, 2011 at 7:25 PM, aditi garg aditi.garg.6...@gmail.comwrote:
k
the one which rajeev posted..
On Tue, Aug 16, 2011 at 8:00 PM, nivedita arora vivaciousnived...@gmail.com
wrote:
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
semaphores are used to solve the problem of?
1.process synchronization
2.race around
3.mutual exclusion.
--
Regards,
Kamakshi
kamakshi...@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
* - used for multiplication as well as dereferencing
=use for bit wise and and also for address
# also i guess
On Mon, Aug 15, 2011 at 6:45 PM, aditi garg aditi.garg.6...@gmail.comwrote:
Pick the operators whose meaning is context dependent?
1. *
2.#
3.
4.No such operator exists
Plz gv
, Kamakshii Aggarwal kamakshi...@gmail.com
wrote:
semaphores are used to solve the problem of?
1.process synchronization
2.race around
3.mutual exclusion.
--
Regards,
Kamakshi
kamakshi...@gmail.com
--
You received this message because you are subscribed to the Google Groups
Algorithm
@rajeev: this link is not working...
On Mon, Aug 15, 2011 at 4:21 PM, rajeev bharshetty rajeevr...@gmail.comwrote:
Timothy J William MCQ's
http://s244.filesonic.in/download/1662179664/4e47a18f/6312d950/0/1/b4d72a29/0/49e7f6c2daf916cf807a0678329c153d3324519b
On Mon, Aug 15, 2011 at 3:24
@rajeev:+1
On Mon, Aug 15, 2011 at 6:50 PM, rajeev bharshetty rajeevr...@gmail.comwrote:
Does context dependent means a single operator having different meaning
when used in different contexts or scenarios???
If so then * is dereferencing operator for pointers and also an arithmetic
operator
@rajeev:thanks a lot..the link is really very nice..:)
On Mon, Aug 15, 2011 at 7:41 PM, rajeev bharshetty rajeevr...@gmail.comwrote:
@kamakshi : Check this link.
It has a very good explanation
http://stargazer.bridgeport.edu/sed/projects/cs503/Spring_2001/kode/os/sync.htm
On Mon, Aug 15,
t(n-2): when it took the first step as 2 stairs
the series can be started as
T(1)=1
T(2)=2
and calculate the rest from above
On Sat, Aug 13, 2011 at 8:37 PM, Gaurav Menghani
gaurav.mengh...@gmail.com wrote:
Knapsack DP
On Sat, Aug 13, 2011 at 8:35 PM, Kamakshii Aggarwal
kamakshi
@aditya i think the input should start with and also end with
On Sun, Aug 14, 2011 at 6:38 PM, aditya kumar
aditya.kumar130...@gmail.comwrote:
the input should start with \ and end with \ . in between you can take any
string .
On Sun, Aug 14, 2011 at 6:35 PM, Poised~ dip10c...@gmail.com
@arun : first is the requiremnet of the given scanf format..whenever next
is encountered it stops accepting any character due to [^\]
On Mon, Aug 15, 2011 at 9:16 AM, Arun Vishwanathan
aaron.nar...@gmail.comwrote:
so according to the discussions above input should start with and end
with
is printing a n*n array,spirally is same as printing it helically??
or is there any difference between the two??
--
Regards,
Kamakshi
kamakshi...@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
How do you make sure to unlock a mutex which was locked in a thread that
dies/terminates?
--
Regards,
Kamakshi
kamakshi...@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
yes
On Sat, Aug 13, 2011 at 8:30 PM, Puneet Goyal puneetgoya...@gmail.comwrote:
1 or 2 stairs?
On Sat, Aug 13, 2011 at 8:24 PM, Kamakshii Aggarwal kamakshi...@gmail.com
wrote:
Given n stairs, how many number of ways can you climb if u use either 1 or
2 at a time?
--
Regards
maintain an array indexed on alphabets 'a' to 'z'.
now count the occurence of each character taking *last character* of each
string
{asdsb,csasaa, bc, bc}
in this case
arr[a]=1;
arr[b]=1;
arr[c]=2;
now start with each sting let first character be first and last character be
last
while
yes nth term of fibonacci series.
.t(n)=t(n-1)+t(n-2);
where
t(1)=1;
t(2)=2;
On Sat, Aug 13, 2011 at 10:11 PM, aseem garg ase.as...@gmail.com wrote:
The soln is nth term of fibonacci sequence...isnt it?
Aseem
On Sat, Aug 13, 2011 at 9:27 PM, Akash Mukherjee akash...@gmail.comwrote:
dp
see the following example:
*a*kdhd*a* ,*b*hdgd*c*, *c*hdjd*b*
On Sat, Aug 13, 2011 at 10:20 PM, Yasir yasir@gmail.com wrote:
why following?
if(first==last)
return false;
example:
axxa, ayyb, bzza === ayybbzzaaxxa
--
You received this message because you are subscribed to the
i got error,my sol will not work for all cases
On Sat, Aug 13, 2011 at 10:22 PM, Kamakshii Aggarwal
kamakshi...@gmail.comwrote:
see the following example:
*a*kdhd*a* ,*b*hdgd*c*, *c*hdjd*b*
On Sat, Aug 13, 2011 at 10:20 PM, Yasir yasir@gmail.com wrote:
why following?
if(first==last
coz i have tried a similar question like dis...also u can check it also...
On Sat, Aug 13, 2011 at 10:47 PM, Decipher ankurseth...@gmail.com wrote:
How did you know that ?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this
i am sorry.i misinterpret the question...i dint c that the steps are between
banks..
On Sun, Aug 14, 2011 at 12:26 AM, ankit tyagi ankittya...@gmail.com wrote:
seems fine..
On Sun, Aug 14, 2011 at 12:13 AM, Mohit Goel mohitgoel291...@gmail.comwrote:
there are 5 possibilities ..5th one is
if steps are between banks then try dis.
if n=3 steps
then find t(n+2)
and use the fibonacci formula t(n)=t(n-1)+t(n-2)
t(1)=1;
t(2)=2;
now this will work ...
On Sun, Aug 14, 2011 at 12:34 AM, Kamakshii Aggarwal
kamakshi...@gmail.comwrote:
i am sorry.i misinterpret the question...i dint c
typo in above code..find t(n+1)
On Sun, Aug 14, 2011 at 12:37 AM, Kamakshii Aggarwal
kamakshi...@gmail.comwrote:
if steps are between banks then try dis.
if n=3 steps
then find t(n+2)
and use the fibonacci formula t(n)=t(n-1)+t(n-2)
t(1)=1;
t(2)=2;
now this will work ...
On Sun, Aug 14
please explain
On Tue, Aug 9, 2011 at 9:07 AM, Dipankar Patro dip10c...@gmail.com wrote:
ans : n + 2nk - k^2 - k
On 9 August 2011 08:43, Raman raman.u...@gmail.com wrote:
Yes, the answer is n + 2nk - k^2 -k
--
You received this message because you are subscribed to the Google Groups
then please elaborate?
On Mon, Aug 8, 2011 at 12:34 PM, Pradex pradam.prad...@gmail.com wrote:
get it..!! :) :)
On Aug 7, 10:49 pm, Shachindra A C sachindr...@gmail.com wrote:
8 one's and 8 two's. The order in which they get printed might vary.
On Mon, Aug 8, 2011 at 11:11 AM, Kamakshii
which code executes faster?
code1:- for(i=0;in;i++)
for(j=0;jn;j++)
large_array[i][j]=0;
code2:- for(j=0;jn;j++)
for(i=0;in;i++)
large_array[i][j]=0;
--
Regards,
Kamakshi
kamakshi...@gmail.com
--
You received this message because you are subscribed to the Google Groups
#include stdio.h
#define max(a,b)(ab)?a:b
int main()
{
int m,n;
m=3+max(2,3);
n=2*max(3,2);
printf(%d,%d,m,n);
getchar();
return 0;
}
y the o/p is 2,3,,please explain
--
Regards,
Kamakshi
kamakshi...@gmail.com
--
You received this message because you are subscribed to the Google
be faster because of higher cache hits than Code 2.
On Mon, Aug 8, 2011 at 3:25 PM, Gaurav Menghani
gaurav.mengh...@gmail.com wrote:
If the dimensions are same, both will execute equally fast.
On Mon, Aug 8, 2011 at 3:21 PM, Kamakshii Aggarwal
kamakshi...@gmail.com wrote:
which code executes
thanks..got it...
On Mon, Aug 8, 2011 at 3:45 PM, jagrati verma
jagrativermamn...@gmail.comwrote:
#define max(a,b)((ab)?a:b)
use parenthese thn it will giv the correct o/p
On Mon, Aug 8, 2011 at 3:27 PM, Kamakshii Aggarwal
kamakshi...@gmail.com wrote:
#include stdio.h
#define max
Which is not an advantage of using subroutines?
(a) Easier maintenance
(b) Runtime reduces
(c) Storage space reduces
(d) Modularity
one of the answer is b.
what about c?
does subroutine reduce space?
--
Regards,
Kamakshi
kamakshi...@gmail.com
--
You received this message because
A 1D - array A whose size is N is given and is divided into P partitions and
an element x is to be searched in the
array. Each partition is given to one processor. The elements are searched
with in the partition using a binary search.
What is the time complexity of the algorithm?
(a) O (N/P)
(b) O
the size of the source file
On Mon, Aug 8, 2011 at 4:18 PM, sourabh jakhar
sourabhjak...@gmail.comwrote:
b
On Mon, Aug 8, 2011 at 4:18 PM, Kamakshii Aggarwal
kamakshi...@gmail.com wrote:
Which is not an advantage of using subroutines?
(a) Easier maintenance
(b) Runtime reduces
(c
how??array is not sorted...so first we have to sort na??
On Mon, Aug 8, 2011 at 5:04 PM, Dipankar Patro dip10c...@gmail.com wrote:
C
On 8 August 2011 17:03, ankit sambyal ankitsamb...@gmail.com wrote:
C
--
You received this message because you are subscribed to the Google Groups
global variable conflicts due to multiple file occurence
is resolved during
a. compile-time
b. run-time
c. link-time
d. load-time
--
Regards,
Kamakshi
kamakshi...@gmail.com
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this
Fastest IPC mechanism is
1. ?shared memory
2. ?pipes
3. ?named pipes
4. ?Semaphores
--
Regards,
Kamakshi
kamakshi...@gmail.com
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send
Srivastava himanshusri...@gmail.comwrote:
named pipes!!!
On Mon, Aug 8, 2011 at 5:36 PM, Kamakshii Aggarwal kamakshi...@gmail.com
wrote:
Fastest IPC mechanism is
1. ?shared memory
2. ?pipes
3. ?named pipes
4. ?Semaphores
--
Regards,
Kamakshi
on this fork. the fork will return 0 in the 8 child processes created and
returns pid of the child in the parent processes.
On Mon, Aug 8, 2011 at 12:49 PM, Kamakshii Aggarwal
kamakshi...@gmail.com wrote:
then please elaborate?
On Mon, Aug 8, 2011 at 12:34 PM, Pradex pradam.prad
A k-diagonal matrix is a n *n square matrix in which the elements on the
principal diagonal and k diagonals above the
principal diagonal and k diagonals below the principal diagonal only have
none\ zero elements. Other elements are zero’s.
In order to save the space, the non zero elements are
, 2011 at 6:50 PM, Kamakshii Aggarwal
kamakshi...@gmail.com wrote:
ok ..thanks sagar..:)
On Mon, Aug 8, 2011 at 6:42 PM, sagar pareek
sagarpar...@gmail.comwrote:
lets label your forks :-
main()
{
int ret;
ret=fork(); -- 1
ret=fork(); -- 2
ret=fork(); --- 3
ret=fork
i copied it from net..i dint understand the question. ignore the
options..are u able to solve it?
On Mon, Aug 8, 2011 at 10:16 PM, aditi garg aditi.garg.6...@gmail.comwrote:
b) and c) options are same??
On Mon, Aug 8, 2011 at 8:53 PM, Kamakshii Aggarwal
kamakshi...@gmail.comwrote:
A k
right?or does dis ques mean
smthing else?
On Mon, Aug 8, 2011 at 10:58 PM, Kamakshii Aggarwal kamakshi...@gmail.com
wrote:
i copied it from net..i dint understand the question. ignore the
options..are u able to solve it?
On Mon, Aug 8, 2011 at 10:16 PM, aditi garg aditi.garg.6
();
if (p1 == 0) {
int p2 = fork();
if (p2 != 0) {
fork();
}
}
}
*
On Mon, Aug 8, 2011 at 11:11 AM, Kamakshii Aggarwal
kamakshi...@gmail.com wrote:
what will be the o/p of the following program:
main()
{
int
1.what is the best sorting method for almost sorted array?
a.quicksort
c.hapsort
c.shell sort
d.bubble
--
Regards,
Kamakshi
kamakshi...@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
what is the problem with the following code
void fun(int **p)
{
static int q = 10;
*p = q;
}
int main()
{
int r = 20;
int *p = r;
fun(*p);
printf(%d, *p);
getchar();
return 0;
}
--
Regards,
Kamakshi
kamakshi...@gmail.com
--
You received this message because you are
i got my mistake...sorry guys
On Mon, Aug 8, 2011 at 12:14 AM, Kamakshii Aggarwal
kamakshi...@gmail.comwrote:
what is the problem with the following code
void fun(int **p)
{
static int q = 10;
*p = q;
}
int main()
{
int r = 20;
int *p = r;
fun(*p);
printf(%d, *p
fun(p) hona tha..
but i wrote(*p)
On Mon, Aug 8, 2011 at 12:17 AM, aseem garg ase.as...@gmail.com wrote:
What was the mistake?
Aseem
On Mon, Aug 8, 2011 at 12:15 AM, Kamakshii Aggarwal kamakshi...@gmail.com
wrote:
i got my mistake...sorry guys
On Mon, Aug 8, 2011 at 12:14 AM
#includestdio.h
int main()
{
typedef static int *i;
static int j;
i a = j;
printf(%d, *a);
getchar();
return 0;
}
what is the error in the code?
--
Regards,
Kamakshi
kamakshi...@gmail.com
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks
, but not when you define the type.
Aseem
On Mon, Aug 8, 2011 at 12:29 AM, Kamakshii Aggarwal kamakshi...@gmail.com
wrote:
#includestdio.h
int main()
{
typedef static int *i;
static int j;
i a = j;
printf(%d, *a);
getchar();
return 0;
}
what is the error in the code
i think the answer will be 1/5+ 4/5*1/2=3/5
coz the question is saying what is the probability of getting head* sixth
time*(when 5 heads were already there)..
it is not saying what is the probability of getting heads* 6 times*..(in
this case answer will be 17/180)
On Mon, Aug 8, 2011 at 9:54
what will be the o/p of the following program:
main()
{
int ret;
ret=fork();
ret=fork();
ret=fork();
ret=fork();
if(!ret)
printf(one);
else
printf(two);
}
--
Regards,
Kamakshi
kamakshi...@gmail.com
--
You received this message because you are subscribed to the Google Groups
Algorithm
given a set of letters and a length N, produce all possible output.(Not
permutation). For example, give the letter (p,o) and length of 3, produce
the following output(in any order you want, not just my example order)
ppp ppo poo pop opp opo oop ooo
another example would be given (a,b) and length
@gaurav:i could not understand ur sol.can u explain it again..
On Fri, Aug 5, 2011 at 12:32 PM, Gaurav Menghani
gaurav.mengh...@gmail.comwrote:
On Fri, Aug 5, 2011 at 12:20 PM, Kamakshii Aggarwal
kamakshi...@gmail.com wrote:
given a set of letters and a length N, produce all possible output
;
backtrack(,0);
return 0;
}
On Fri, Aug 5, 2011 at 12:42 PM, Kamakshii Aggarwal
kamakshi...@gmail.com wrote:
@gaurav:i could not understand ur sol.can u explain it again..
On Fri, Aug 5, 2011 at 12:32 PM, Gaurav Menghani
gaurav.mengh...@gmail.com
wrote:
On Fri, Aug 5, 2011 at 12:20
can we implement random() function on a hash table in O(1) .
--
Regards,
Kamakshi
kamakshi...@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
logical address
On Fri, Aug 5, 2011 at 2:20 PM, Amol Sharma amolsharm...@gmail.com wrote:
physical address i think
--
Amol Sharma
Third Year Student
Computer Science and Engineering
MNNIT Allahabad
On Fri, Aug 5, 2011 at 1:01 AM, amit karmakar
amit.codenam...@gmail.comwrote:
I was given 3 packets, with 2 pens each.
1st Packet has 2 blue pens.
2nd Packet has 1 blue pen,1 black pen.
3rd Packet has 2 black pens.
I took any one packet and pulled out one pen. It turned out to be a blue
one.
What is the probability that the next pen from the same packet will
also
in case of 64 bit,
size of second structure will also be 16 not 8
On Fri, Aug 5, 2011 at 11:40 PM, UTKARSH SRIVASTAV
usrivastav...@gmail.comwrote:
I think voth are just same..
On Fri, Aug 5, 2011 at 10:57 AM, priya v pria@gmail.com wrote:
in case of 64 bit machine y
Can anyone please tell what is the procedure for amazon campus recruitment?
--
Regards,
Kamakshi
kamakshi...@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
how can two sorted arrays be merged inplace?
--
Regards,
Kamakshi
kamakshi...@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
4, 2011 at 10:25 PM, arvind kumar arvindk...@gmail.comwrote:
Written test(tech+apti),Technical interview n HR interview
On Thu, Aug 4, 2011 at 10:23 PM, Kamakshii Aggarwal
kamakshi...@gmail.com wrote:
Can anyone please tell what is the procedure for amazon campus
recruitment?
--
Regards
@dave:how can we find value of 'k' in (log n)
On Thu, Aug 4, 2011 at 5:41 PM, kartik sachan kartik.sac...@gmail.comwrote:
@amit it's given that array is increasing then decreasing..so where
there is change from incre to drece that value of i in loop will be k
in this we can find out
@sagar:please explain..
On Thu, Aug 4, 2011 at 11:59 PM, sagar pareek sagarpar...@gmail.com wrote:
87.5 %
On Thu, Aug 4, 2011 at 10:39 PM, Nikhil Gupta
nikhilgupta2...@gmail.comwrote:
There are 3 magical wells. Any input quantity of water we provide the 1st
well is returned double (of
.
On Thu, Aug 4, 2011 at 11:01 PM, Kamakshii Aggarwal
kamakshi...@gmail.com wrote:
@arvind:in technical online test,do we have to code the program?
On Thu, Aug 4, 2011 at 10:45 PM, arvind kumar arvindk...@gmail.comwrote:
First round is online test
On Thu, Aug 4, 2011 at 10:43 PM
i have a doubt regarding 3rd questions..acc to me both are valid...what is
the correct answer?
On Fri, Aug 5, 2011 at 12:27 AM, newOne trader.lu...@gmail.com wrote:
2 issues:
1. no error handling for malloc failure( can be ignored)
2. no memset for pq.
strcat will not work properly: as by
were puzzles easy one
yes i only remembered 2 question of coding
they were
1. find longest increasing sub sequence
2. print matrix in spiral form...
now u tell me ur college and how and which companies visited urs ?
On Fri, Aug 5, 2011 at 12:35 AM, Kamakshii Aggarwal kamakshi...@gmail.com
A car is traveling at a uniform speed.The driver sees a milestone showing a
2-digit number. After traveling for an hour the driver sees another
milestone with the same digits in reverse order.After another hour the
driver sees another milestone containing the same two digits. What is the
average
to u...not everyone gets it when looking
at the answer...
On Wed, Aug 3, 2011 at 3:34 PM, vaibhavmitta...@gmail.com wrote:
45 km/hr
VM
NSIT, COE, 3rd year
On , Kamakshii Aggarwal kamakshi...@gmail.com wrote:
A car is traveling at a uniform speed.The driver sees a milestone
showing a 2
..also third
milestone wil be very near to 100 to so 1 is fixed as a digit..odrs can be
found out by hit and trial..
VM
NSIT, COE, 3rd year
On , Kamakshii Aggarwal kamakshi...@gmail.com wrote:
vaibhav can u please explain.i know the answer already..i m just not
able to solve
i think dere is nothing wrong in ques 1.is there any error?
On Wed, Aug 3, 2011 at 9:46 PM, cegprakash cegprak...@gmail.com wrote:
2 is pretty easy..
3: both
5: 6/12 * 6/11 = 3/11
am i right?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks
i think answer for 5th should be 11/23. Am i right?
On Wed, Aug 3, 2011 at 10:26 PM, Kamakshii Aggarwal
kamakshi...@gmail.comwrote:
i think dere is nothing wrong in ques 1.is there any error?
On Wed, Aug 3, 2011 at 9:46 PM, cegprakash cegprak...@gmail.com wrote:
2 is pretty easy..
3
possibilities
probability of 10 or 01 = (36+36)/(30+30+36+36)
=18/31
is it one of the options?
On Wed, Aug 3, 2011 at 10:28 PM, JAIDEV YADAV jaid...@gmail.com wrote:
there is no error in first question ... u thik so.. correct me if wrong
...
On Wed, Aug 3, 2011 at 10:26 PM, Kamakshii
Given a rectangle with known width and height, design an algorithm to fill
the rectangle using n squares(n is integer given) and make sure in the
result the wasting area is minimized. Length of square doesn't have to be
integer.
i.e, given width=3,height=2,n=5, one solution is that rectangle can
@sunny:yes all the squares should be of same size
On Tue, Aug 2, 2011 at 5:03 PM, Poised~ dip10c...@gmail.com wrote:
@ narain-
i didn't see that coming. thanks for the heads up.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view
@vaibhav:can u please elaborate?
On Tue, Aug 2, 2011 at 6:31 PM, Vaibhav Mittal vaibhavmitta...@gmail.comwrote:
dynamic programming with binary search should do it..
Regards
VM
NSIT, COE, 3rd yr
On Tue, Aug 2, 2011 at 6:19 PM, Kamakshii Aggarwal
kamakshi...@gmail.comwrote:
@sunny:yes
@what kind of operations can be applied to 'A'?
On Sun, Jul 31, 2011 at 6:54 PM, Amol Sharma amolsharm...@gmail.com wrote:
yupxor would do the required task eaisly !!
--
Amol Sharma
Third Year Student
Computer Science and Engineering
MNNIT Allahabad
On Sun, Jul 31, 2011 at 6:42
a+1 will point to the next array(i.e it will skip the whole array)
where as (a+1)will print address of element 2.
On Sun, Jul 31, 2011 at 1:21 AM, Sanchit Manchanda sanchit...@gmail.comwrote:
Sorry my bad. I was wrong.
On Sun, Jul 31, 2011 at 1:15 AM, gaurav gupta grvgupta...@gmail.comwrote:
3.it is same as b=b+1;
On Sun, Jul 31, 2011 at 1:32 AM, aseem garg ase.as...@gmail.com wrote:
int b=2;b=b++;
b=???
Plz explain..
Aseem
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
@neeraj:deleting after printing will adds to complexity..
On Sun, Jul 31, 2011 at 1:34 AM, Neeraj Gupta neeraj.gupta...@gmail.comwrote:
Create a balance BST.
Maintain counter. Whenever You hit duplicate increase the counter while
inserting.
O(nlogn) for creating it and O(N) space.
Now
oh sorry,mane galat pad lia..mane sirf b++ dekha...
it is compiler dependent.value of b is changing twice b/w two serial points
On Sun, Jul 31, 2011 at 1:37 AM, aseem garg ase.as...@gmail.com wrote:
@Kamakshi: Run karke dekh leti pehle. :-/
Aseem
On Sun, Jul 31, 2011 at 1:34 AM, Kamakshii
@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
wrote:
ok lets think in terms of hashmap of number and frequency
we definitly have to maintain an order array .
traverse original array , we check if its
grvgupta...@gmail.comwrote:
so u mean der is difference between a and a[0]
On Sun, Jul 31, 2011 at 1:30 AM, Kamakshii Aggarwal
kamakshi...@gmail.com wrote:
a points to the array.so when u increment it by 1 it will get
incremented by the size of array.
On Sun, Jul 31, 2011 at 1:28 AM, gaurav
, Jul 31, 2011 at 1:34 AM, Kamakshii Aggarwal
kamakshi...@gmail.com wrote:
3.it is same as b=b+1;
On Sun, Jul 31, 2011 at 1:32 AM, aseem garg ase.as...@gmail.comwrote:
int b=2;b=b++;
b=???
Plz explain..
Aseem
--
You received this message because you are subscribed to the Google
@nivedita:ohhh :P
On Sun, Jul 31, 2011 at 1:46 AM, nivedita arora vivaciousnived...@gmail.com
wrote:
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
haan haan,i got my mistake,thanks
On Sun, Jul 31, 2011 at 1:49 AM, Sanchit Manchanda sanchit...@gmail.comwrote:
sorry. yeah likhen mein galti kardi. but take the point what i was trying
to say. (a+1) to galat hai.
On Sun, Jul 31, 2011 at 1:47 AM, Kamakshii Aggarwal kamakshi...@gmail.com
. it might depend from compiler to
compiler. but yeah it should be undefined.
On Sun, Jul 31, 2011 at 1:49 AM, Kamakshii Aggarwal
kamakshi...@gmail.com wrote:
@sanchit:it is undefined..
On Sun, Jul 31, 2011 at 1:47 AM, Sanchit Manchanda sanchit...@gmail.com
wrote:
I am getting b=2.
Maybe
1 - 100 of 168 matches
Mail list logo
