Yes, can anyone tell how much do they expect knowledge of Linux?
--
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/-/IWON5SSekLAJ.
To post to this group, send
what if the alphabet is {a,b,c,d} and we have to print substrings of length
2 or 3 ?
On Sat, Aug 6, 2011 at 11:01 AM, Tushar Bindal tushicom...@gmail.comwrote:
@gaurav
didn't get this:
Just to increase the size of the string by one.
Then you can put any character at the the new last
ohh my bad... it is working fine for all cases :)
On Sat, Aug 6, 2011 at 11:56 AM, mohit verma mohit89m...@gmail.com wrote:
what if the alphabet is {a,b,c,d} and we have to print substrings of length
2 or 3 ?
On Sat, Aug 6, 2011 at 11:01 AM, Tushar Bindal tushicom...@gmail.comwrote:
Ok thats a diff thing
but what i posted is somewhat different
actually what happen is that .5 can be represented completely in binary form
and the same case with 1.0 and .25 , .125 also
but when we talk about .7 then it cant be represented in binary precisely
even we upgrade it to double.
thats
Don't know about this time, but last year the students applying for interns
were asked to solve some puzzles on their site and apply online only. They
didn't conduct any kind of test on campus.
Nitish Garg
4th Year, IT
Delhi College of Engineering
--
You received this message because you are
Hi,
Q.No:1
what is wrong here
void foo(int x=10,int y)
how compiler will treat it??
and what happen here
void foo(int x=10,int y=20)
Q.No:2
How to remove duplicate elements from an array in just one pass.. Take care
of time and space complexity..
--
You received this message because you are
Algogeeks is really awesome and very informative. I got a job in microsoft,
and this group has played vital role in building concepts. So I just want to
thank this group and the people here..
keep it up guys! All the best :)
--
Best Regards,
Harshal Choudhary
7th Semester, CSE Dept.
NIT
Its quite long... but its simple...
pls tell me its worst case time complexity..!!!
#includestdio.h
#includestring.h
#includeconio.h
#includestdlib.h
int check(char *p,int n)// this function checks for pallindromicity of
the string passed.
{
char a[100],b[100];
int k;
for(k=0;k=n;k++)
congrats man ...
On Sat, Aug 6, 2011 at 12:15 PM, Harshal hc4...@gmail.com wrote:
Algogeeks is really awesome and very informative. I got a job in microsoft,
and this group has played vital role in building concepts. So I just want to
thank this group and the people here..
keep it up guys!
Congrats dude and goodluck !!
On 6 August 2011 12:16, veera reddy veeracool...@gmail.com wrote:
congrats man ...
On Sat, Aug 6, 2011 at 12:15 PM, Harshal hc4...@gmail.com wrote:
Algogeeks is really awesome and very informative. I got a job in
microsoft, and this group has played
https://groups.google.com/forum/#!msg/algogeeks/KOKntrkVANs/acgqxPRHBAMJ
On Sat, Aug 6, 2011 at 12:03 PM, Nitish Garg nitishgarg1...@gmail.comwrote:
Don't know about this time, but last year the students applying for interns
were asked to solve some puzzles on their site and apply online only.
@sumit, these numbers containing all ones are not in binary representation.
They are in decimal system.
On Sat, Aug 6, 2011 at 9:51 AM, sahil gujral gujralsa...@gmail.com wrote:
yes u r wrong..
1 is nt divisible by 23
On Sat, Aug 6, 2011 at 9:15 AM, sumit sumitispar...@gmail.com
congrates
On Sat, Aug 6, 2011 at 12:18 PM, dilip makwana dilipmakwa...@gmail.comwrote:
Congrats dude and goodluck !!
On 6 August 2011 12:16, veera reddy veeracool...@gmail.com wrote:
congrats man ...
On Sat, Aug 6, 2011 at 12:15 PM, Harshal hc4...@gmail.com wrote:
Algogeeks
please anyone of you post more question asked by adobe this yr...
please
On Sat, Aug 6, 2011 at 12:24 PM, Nikhil Gupta nikhilgupta2...@gmail.comwrote:
@sumit, these numbers containing all ones are not in binary representation.
They are in decimal system.
On Sat, Aug 6, 2011 at 9:51 AM,
http://trickofmind.com/?p=1080
i think this will help, we need to find Carmichael number or somthing
related to ETF for the input number.
On Sat, Aug 6, 2011 at 12:24 PM, Nikhil Gupta nikhilgupta2...@gmail.comwrote:
@sumit, these numbers containing all ones are not in binary representation.
segmented trees??
On Sat, Aug 6, 2011 at 2:05 AM, Ankur Pandey ankur.0002...@gmail.comwrote:
U can use merge sort for this.. try and picture the problem, u'll get my
point..
On Fri, Aug 5, 2011 at 1:27 PM, amit kumar amitthecoo...@gmail.comwrote:
can u plz xplain d qstn a litl more
There is no difference between the two...
On 32 bit system, both structures need every address location where
int and pointer are stored to be a multiple of 4(highest size is 4)..
On 64 bit,
even if pointer is 4bytes(say, in 64 bit system), and p1, p2 be
structure variables, then p2 should start
Congrats and best wishes for life ahead :)
--
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/-/lnf8arcvmb8J.
To post to this group, send email to
hi,
can anyone tell their experience of intern questions. and how to
prepare for essay.
On Aug 3, 5:02 pm, Ankit Minglani ankit.mingl...@gmail.com wrote:
heyy thanks alot to you people .. it was of so much help :)
On Wed, Aug 3, 2011 at 2:49 AM, Kunal Patil kp101...@gmail.com wrote:
Sorry guys, int is 4 bytes on 64 bit and 2 bytes on 32 bit system..
But padding rule remains same for both structures as mentioned above...
On 8/6/11, Puneet Gautam puneet.nsi...@gmail.com wrote:
There is no difference between the two...
On 32 bit system, both structures need every address
Hey Congrats!! :)
I got intern dere :)
--
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
is it confirmed that the answer is 11/23 only?
bcoz the point that we need a left-right pair only is also valid. if we
consider that case, answer comes out to be 12/23.
since it just says pair, shall we assume that pair means just 2 of same
colour or take a proper pair that consists of one right
Hi,
How to find the longest matching substring in 2 arrays..
Say we have 2 strings,
str1=abcdefghi and str2=iabcdefgk the answer must be abcdefg
--
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 meant by IMBALANCE??
Does that mean power of 2?
On Aug 6, 10:09 am, vikas singh shyguy1...@gmail.com wrote:
On Sat, Aug 6, 2011 at 10:07 AM, Sabya Sachi sachi1...@gmail.com wrote:
At many places, it has been mentioned that in C, a structure (when not
packed) pads its content so as to
apply longest common subsequqnce problem with a little modification.
that would solve your problem.
On Aug 6, 12:54 pm, swetha rahul swetharahu...@gmail.com wrote:
Hi,
How to find the longest matching substring in 2 arrays..
Say we have 2 strings,
str1=abcdefghi and
On Sat, Aug 6, 2011 at 1:24 PM, Sabya Sachi sachi1...@gmail.com wrote:
What is meant by IMBALANCE??
Does that mean power of 2?
struct node
{
char d;
short int i;
};
int main(){
struct node a;
printf(size = %d,sizeof(a));
}
yeah... it means the same.
See, in this code, what do you
Congrats dude...
On 6 August 2011 13:07, KK kunalkapadi...@gmail.com wrote:
Hey Congrats!! :)
I got intern dere :)
--
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
congrats
Thank you,
Siddharam
On Sat, Aug 6, 2011 at 1:34 PM, Ragu ragu...@gmail.com wrote:
Congrats dude...
On 6 August 2011 13:07, KK kunalkapadi...@gmail.com wrote:
Hey Congrats!! :)
I got intern dere :)
--
You received this message because you are subscribed to the Google Groups
Hi,
Directi visited our Campus in 3rd week of July. It was recruiting for 2
profiles - System Developer and Developer Operations (Sys Admin)
There was an Apti test to start with. Depending on you performance in the
Apti test , you would be shortlisted in either the Sys Dev or Sys Admin
lists.
Congrats dude :)
On Sat, Aug 6, 2011 at 1:41 PM, siddharam suresh siddharam@gmail.comwrote:
congrats
Thank you,
Siddharam
On Sat, Aug 6, 2011 at 1:34 PM, Ragu ragu...@gmail.com wrote:
Congrats dude...
On 6 August 2011 13:07, KK kunalkapadi...@gmail.com wrote:
Hey Congrats!! :)
congrats :)
--
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
congrats harshal :) and do share your Interview Experience.
On Sat, Aug 6, 2011 at 12:15 PM, Harshal hc4...@gmail.com wrote:
Algogeeks is really awesome and very informative. I got a job in microsoft,
and this group has played vital role in building concepts. So I just want to
thank this
congrats :) and do share your Interview Experience.
On Aug 6, 1:30 pm, shady sinv...@gmail.com wrote:
congrats harshal :) and do share your Interview Experience.
On Sat, Aug 6, 2011 at 12:15 PM, Harshal hc4...@gmail.com wrote:
Algogeeks is really awesome and very informative. I got a
Any one know how the global scholar written round will be ? whether they
concentrate on OOPs language lik C++ Java or c aptitudes itself enough ? how
wil be the next techinical rounds ?
Thanks in adcance :)
--
You received this message because you are subscribed to the Google Groups
Algorithm
...For developers position they said u gotta be an expert in linux ….
…u can use any programming language ..but I found shell found to be d
best…we were allowed to use man pages…
1.Prog shud take process name as input , display the memory occupied
by all the process under that.
2. Process should
my friend s experience who got selected...
Algo round:
1. Queue in O(1) solution.. I came up with a method and it was
not the most optimal one… and I asked if I shud optimize more.. he sed
he was happy with the solution I gave and proceeded to the next
question…
2. For eg.. if
Yes, vikash is right. This will work. Works in O(nm).
http://ideone.com/G6RAK
On Sat, Aug 6, 2011 at 1:30 PM, vikash vikash.ckiiit...@gmail.com wrote:
apply longest common subsequqnce problem with a little modification.
that would solve your problem.
On Aug 6, 12:54 pm, swetha rahul
Trie ..
On 6 August 2011 14:24, Mukul Gupta mukul.gupta...@gmail.com wrote:
Yes, vikash is right. This will work. Works in O(nm).
http://ideone.com/G6RAK
On Sat, Aug 6, 2011 at 1:30 PM, vikash vikash.ckiiit...@gmail.com wrote:
apply longest common subsequqnce problem with a little
struct node
{
char d;
short int i;
};
int main(){
struct node a;
printf(size = %d,sizeof(a));
}
This will give output of 4, but what i am not getting is why does the
bit specifier snippet give 4 bytes as answer when the char and int
variables have been given just 1 bit.
On Aug 6, 1:03
For other algorithms have a look here,
http://en.wikipedia.org/wiki/Longest_common_substring_problem
On Aug 6, 1:55 pm, payel roy smithpa...@gmail.com wrote:
Trie ..
On 6 August 2011 14:24, Mukul Gupta mukul.gupta...@gmail.com wrote:
Yes, vikash is right. This will work. Works in
I think there is some error in this implementation,
On Aug 6, 1:54 pm, Mukul Gupta mukul.gupta...@gmail.com wrote:
Yes, vikash is right. This will work. Works in O(nm).
http://ideone.com/G6RAK
On Sat, Aug 6, 2011 at 1:30 PM, vikash vikash.ckiiit...@gmail.com wrote:
apply longest
use of trie will be the best option
--
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
I only know about the telephonic interview round which was of around
30 minutes.
They asked three algorithmic problems,
1. For a given binary tree where each node has a integer value
associated with it. Write a program that takes k as input and prints
the sum of all nodes after level k.
2.
any1 plz tell me y output of float type of dis prgrm is zero?
#includestdio.h
#define INT 1
main()
{
struct a
{
int type;
};
struct c
{
int type;
int e;
};
struct b
{
http://www.spoj.pl/SPOJ/problems/TUG/
earlier i thought it would be easy to do it knapsack...but when i started
coding iti feel lost.i have failed to relate it with 0/1
knapsack..
plz tell me how this problem can be solved using dp solution of
knapsack..i mean in knapsack you
that means the order is immaterial.
the sizeof the struct always remains same irrespective of the order and just
depends on the type of variables???
why char with double does not get size in multiples of 8??
On Sat, Aug 6, 2011 at 12:54 PM, Puneet Gautam puneet.nsi...@gmail.comwrote:
Sorry
@vicky
written:
3 c and ds multiple choice questions
2 java questions
1 dbms
1 c++
5 coding quesions..
1) you will be given 2 binary tree..you have to find the intersecting node..
2) rotating an image by 90 degree..
that all i remember..
round 1:
1*) rotating *a linked list..only recursion and
Mukul, in first approach instead of sending the string again and again u
can use the formula
(a*b)%m = ((a%m)*(b%m))%m
this way u can do sumthin like dis
int count = 0, a = 1;
while(a != 0) {
count++;
a = ((a*10)%n + 1) %n;
}
n later output a string consisting of count one's..
Regards
VM
3rd
c round-
output que
given an expression - take it any ( 5+((4^5)+(6/7))+(4/8) )- aim was
to ensure that brackets are correctly placed
ds/algo-
1)java virtual machine has 8 byte instruction..calc its instruction
code size
2)there was a code given using lock ,wait and thread..had to tell abt
Vaibhav,
Hmm, fine that. I am more interested in the 2nd approach. The first approach
is simple brute force.
On Sat, Aug 6, 2011 at 3:11 PM, vaibhavmitta...@gmail.com wrote:
Mukul, in first approach instead of sending the string again and again u
can use the formula
(a*b)%m = ((a%m)*(b%m))%m
out put is :
10.375001
float value =10.4
integer value=1
1 1 1 10.37500
what us the problem ?
On Sat, Aug 6, 2011 at 2:19 AM, SHIVAM AGRAWAL shivi...@gmail.com wrote:
any1 plz tell me y output of float type of dis prgrm is zero?
#includestdio.h
#define INT 1
main()
{
struct a
How remoe error of this code?
#includestdio.h
main()
{
int i=10,j=15;
if(i%2=i%3)
printf(\ncharacter);
}
--
Regards
Rajesh Kumar
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
is this *i%2=i%3 *valid statement?
Thank you,
Siddharam
On Sat, Aug 6, 2011 at 3:23 PM, Rajesh Kumar testalgori...@gmail.comwrote:
How remoe error of this code?
#includestdio.h
main()
{
int i=10,j=15;
if(i%2=i%3)
printf(\ncharacter);
}
--
Regards
Rajesh Kumar
--
You received
Amit, Yes, there was an error in printing the string.
This should work fine.
http://ideone.com/GThXg
On Sat, Aug 6, 2011 at 2:41 PM, deepika anand swinyanand...@gmail.comwrote:
use of trie will be the best option
--
You received this message because you are subscribed to the Google Groups
you shud use address on left hand side of assignment operator
so above pgm will give error:lvalue required
On 8/6/11, siddharam suresh siddharam@gmail.com wrote:
is this *i%2=i%3 *valid statement?
Thank you,
Siddharam
On Sat, Aug 6, 2011 at 3:23 PM, Rajesh Kumar
sorry actually their code is this.
how to remove error in this code?
#includestdio.h
main()
{
int i=10,j=15;
if(i%2=j%3)
printf(\ncharacter);
}
On Sat, Aug 6, 2011 at 3:37 PM, prasad jondhale
jondhale.pra...@gmail.comwrote:
you shud use address on left hand side of assignment operator
so
X,Y are two sorted arrays of length 'n'.
how to find the median( n th smallest element) in this total 2n elements in
O(log n) time??/
--
Regards
Kumar Raja
M.Tech(SIT)
IIT Kharagpur,
10it60...@iitkgp.ac.in
7797137043.
09491690115.
--
You received this message because you are subscribed to the
http://geeksforgeeks.org/?p=2105
On 6 August 2011 15:45, kumar raja rajkumar.cs...@gmail.com wrote:
X,Y are two sorted arrays of length 'n'.
how to find the median( n th smallest element) in this total 2n elements in
O(log n) time??/
--
Regards
Kumar Raja
M.Tech(SIT)
IIT Kharagpur,
take the median of both the array MX, MY. (MX+1 means next element to MX in
array X. lly to MY+1)
recursively search till you get (MX MY MX+1) (then return MY) or
(MYMXMY+1)(then return MX).
Thank you,
Siddharam
On Sat, Aug 6, 2011 at 3:45 PM, kumar raja rajkumar.cs...@gmail.com wrote:
X,Y
please tell what are the difference(scope) b/w static variable, variable
defined by malloc and global variable.
Thank you,
Siddharam
On Sat, Aug 6, 2011 at 3:52 PM, siddharam suresh siddharam@gmail.comwrote:
take the median of both the array MX, MY. (MX+1 means next element to MX in
How to remove error in this code?
#includestdio.h
main()
{
int i=10,j=15;
if(i%2=j%3)
printf(\ncharacter);
}
--
Regards
Rajesh Kumar
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
output wud be:
0.00
float value= 00.0
integer value=1
1 1 1 0.00
On Sat, Aug 6, 2011 at 2:49 PM, SHIVAM AGRAWAL shivi...@gmail.com wrote:
any1 plz tell me y output of float type of dis prgrm is zero?
#includestdio.h
#define INT 1
main()
{
struct a
{
Thank you,
Siddharam
On Sat, Aug 6, 2011 at 4:05 PM, Rajesh Kumar testalgori...@gmail.comwrote:
How to remove error in this code?
#includestdio.h
main()
{
int i=10,j=15;
if(i=j%3)
printf(\ncharacter);
}
--
Regards
Rajesh Kumar
--
You received this message because you are
hello everyone...goldman sachs is visiting our campus.Can anyone
provide me links to mock aptitude questions having somewhat same level
as that of Goldman Sachs.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email
which college
--
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
Use == for comparison not =
On 6 Aug 2011 17:35, Rajesh Kumar testalgori...@gmail.com wrote:
How to remove error in this code?
#includestdio.h
main()
{
int i=10,j=15;
if(i%2=j%3)
printf(\ncharacter);
}
--
Regards
Rajesh Kumar
--
You received this message because you are
Delhi College Of Engg
On Sat, Aug 6, 2011 at 4:12 PM, NIKHIL JAIN
nikhil.jain.shali...@gmail.comwrote:
which college
--
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
sorry people my explanation was incomplete.
give time i will pass one the complete code.
Thank you,
Siddharam
On Sat, Aug 6, 2011 at 3:52 PM, siddharam suresh siddharam@gmail.comwrote:
take the median of both the array MX, MY. (MX+1 means next element to MX in
array X. lly to MY+1)
CAN ANYONe PLEASE TELL ME WHICH TEST CASE I AM GETTING WRONG
I HAVE TRIED ALL WHICH I COULD TRY IN THIS PROBLEM
http://www.spoj.pl/problems/M00PAIR/
MY SOLUTION
--
#includestdio.h
#includestring.h
int fun(char *s)
{
int i,n;
for(i=0;s[i]!='\0';i++);
Can anyone suggests a good data structure for n-ary tree.. where n is the
input by the user...
--
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,
You are taking string as a variable when a simple int would do...:)
check your fun() function otherwise i got AC with same idea as u have used
On Sat, Aug 6, 2011 at 4:40 PM, UTKARSH SRIVASTAV
usrivastav...@gmail.comwrote:
CAN ANYONe PLEASE TELL ME WHICH TEST CASE I AM GETTING WRONG
MY LOGIC IS .LET AFTER N STEPS RELATION BETWEEN NUMBER OF
ONES(1),ZEROONE(01) AND DOUBLEZERO(00) IS
INITIALLY
ONE=1
ZEROONE=0
DOUBLEZERO=0
FOR N=1
K=ONE
L=ZEROONE
M=DOUBLEZERO
ONE=K+L+M
ZEROONE=K+M
DOUBLEZERO=L
i.e. ONE=1 ZERONE=1 DOUBLEZERO=0
FOR N=2
K=ONE
L=ZEROONE
M=DOUBLEZERO
thnx saurabh i got ac
On Sat, Aug 6, 2011 at 4:22 AM, UTKARSH SRIVASTAV
usrivastav...@gmail.comwrote:
MY LOGIC IS .LET AFTER N STEPS RELATION BETWEEN NUMBER OF
ONES(1),ZEROONE(01) AND DOUBLEZERO(00) IS
INITIALLY
ONE=1
ZEROONE=0
DOUBLEZERO=0
FOR N=1
K=ONE
L=ZEROONE
Always ready to help mate:)
Party do ab:D
On Sat, Aug 6, 2011 at 4:55 PM, UTKARSH SRIVASTAV
usrivastav...@gmail.comwrote:
thnx saurabh i got ac
On Sat, Aug 6, 2011 at 4:22 AM, UTKARSH SRIVASTAV usrivastav...@gmail.com
wrote:
MY LOGIC IS .LET AFTER N STEPS RELATION
use a linked list to store child nodes, a tree node will hold pointer
to next sibling and a pointer to its first child.
typedef struct TreeNode{
struct TreeNode * nextSibling;
struct TreeNode * fistChild;
//rest things
}
On Aug 6, 4:10 pm, Aman Goyal aman.goya...@gmail.com wrote:
Can anyone
Really helpful info thanks guys..
--
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
@harshal:
Congrats..share ur interview experience so that it will be helpful for
others.
On 6 August 2011 14:07, siva viknesh sivavikne...@gmail.com wrote:
congrats :) and do share your Interview Experience.
On Aug 6, 1:30 pm, shady sinv...@gmail.com wrote:
congrats harshal :) and do
congrats dude ... can u plz tell me the questions asked ... microsoft is
visiting our campus on 29th
--
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
hi,
can anyone pls tell whats the format of coding section in amazon
online test.
is it something like codechef ? is the format of test cases given ?
Also, usually we write some part of code/function and test it if its
running fine on local system , when it is then we submit at codechef.
If it
thanks, by no means we can add the child nodes dynamically to the father
node??
On Sat, Aug 6, 2011 at 5:33 PM, rohit q.ro...@gmail.com wrote:
use a linked list to store child nodes, a tree node will hold pointer
to next sibling and a pointer to its first child.
typedef struct TreeNode{
.. pseudo code for finding inorder successor of a node without parent
field..
--
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
how the evalution done on such type problem?
#includestdio.h
main()
{
int i=-3,j=2,k=0,m;
m=++i ++j || k++;
printf(%d %d %d %d\n,i,j,k,m);
}
--
Regards
Rajesh Kumar
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group,
was it microsoft it or microsoft idc and what is the package ?
On Sat, Aug 6, 2011 at 5:44 PM, parag khanna khanna.para...@gmail.comwrote:
congrats dude ... can u plz tell me the questions asked ... microsoft is
visiting our campus on 29th
--
You received this message because you are
Interesting :
#includeiostream
using namespace std;
int main()
{
struct p{
int i;
char j;
char k;
};
struct q{
char j;
int i;
char k;
};
printf(p=%u q=%u,sizeof(p),sizeof(q));
return 0;
}
o/p : p=8 q=12
On Sat, Aug 6, 2011 at
I think that the order is important. Because when we consider an array of
structures the order becomes extremely important just as shown in the above
example.
On Sat, Aug 6, 2011 at 6:18 PM, Prashant Gupta prashantatn...@gmail.comwrote:
Interesting :
#includeiostream
using namespace std;
int
executes 1st
On Sat, Aug 6, 2011 at 6:14 PM, Rajesh Kumar testalgori...@gmail.comwrote:
how the evalution done on such type problem?
#includestdio.h
main()
{
int i=-3,j=2,k=0,m;
m=++i ++j || k++;
printf(%d %d %d %d\n,i,j,k,m);
}
--
Regards
Rajesh Kumar
--
You received this
it's not like cc format. first they'll ask ur logic and then they see ur
code. (no submission process)
On Sat, Aug 6, 2011 at 5:45 PM, nivedita arora
vivaciousnived...@gmail.comwrote:
hi,
can anyone pls tell whats the format of coding section in amazon
online test.
is it something like
can any one tell me the same about D.e Shaw ??
On Sat, Aug 6, 2011 at 5:35 PM, raj kumar megamonste...@gmail.com wrote:
Really helpful info thanks guys..
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
You can take out sample test at
http://www.interviewstreet.com/recruit/test/start/sample
Amazon uses same env for online coding test.
On Aug 6, 5:55 pm, Atul Verma atul.iit...@gmail.com wrote:
it's not like cc format. first they'll ask ur logic and then they see ur
code. (no submission
I recently floated the idea about a seperate group for c and other language
related problems...I have created a parallel group for c problems
You may Post your c problems here
https://groups.google.com/group/algogeeks_c_problems?hl=en
--
Saurabh Singh
B.Tech (Computer Science)
MNNIT ALLAHABAD
-2 3 0 1 will be the answer...
On 8/6/11, Prashant Gupta prashantatn...@gmail.com wrote:
executes 1st
On Sat, Aug 6, 2011 at 6:14 PM, Rajesh Kumar testalgori...@gmail.comwrote:
how the evalution done on such type problem?
#includestdio.h
main()
{
int i=-3,j=2,k=0,m;
m=++i ++j || k++;
struct demo
{
char c;
double d;
int s;
};
what wud be the size of struct demo object?
--
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
i am sending the running code :)
#includeiostream
using namespace std;
struct node
{
int data;
struct node *lc,*rc;
node(int d)
{
data=d;lc=rc=NULL;
}
};
int ret,fl;
void inorder(struct node *root,int d)
{
if(ret==1)return;
if(root==NULL)return;
inorder(root-lc,d); if(ret==1)return;
given an UNSORTED real number array x1,x2,...,xn, how to find the max
distance of two neighbouring numbers in the number axis. Is there any
method with O(n) time complexity?
see an example
given x[]={2.0,1.0,9.0,-3.5}
then the answer is 7.0, because on the number axis, it is
-3.5,1.0,2.0,9.0 from
@sameer:When is GS visitin ur coll??
On Sat, Aug 6, 2011 at 4:17 PM, sameer gupta sgsa...@gmail.com wrote:
Delhi College Of Engg
On Sat, Aug 6, 2011 at 4:12 PM, NIKHIL JAIN
nikhil.jain.shali...@gmail.com wrote:
which college
--
You received this message because you are subscribed to
i feel do a heapify and then just try an O(n) adjacent element difference on
the resulting one.
On Sat, Aug 6, 2011 at 6:34 PM, Algo Lover algolear...@gmail.com wrote:
given an UNSORTED real number array x1,x2,...,xn, how to find the max
distance of two neighbouring numbers in the number axis.
can any one tell me the same about D.e Shaw ??
On Sat, Aug 6, 2011 at 6:27 PM, SANDEEP CHUGH sandeep.aa...@gmail.comwrote:
can any one tell me the same about D.e Shaw ??
On Sat, Aug 6, 2011 at 5:35 PM, raj kumar megamonste...@gmail.com wrote:
Really helpful info thanks guys..
--
You
how much does de shaw offer?
On Sat, Aug 6, 2011 at 6:40 PM, SANDEEP CHUGH sandeep.aa...@gmail.comwrote:
can any one tell me the same about D.e Shaw ??
On Sat, Aug 6, 2011 at 6:27 PM, SANDEEP CHUGH sandeep.aa...@gmail.comwrote:
can any one tell me the same about D.e Shaw ??
On Sat, Aug
10th aug
Shashank Jain
IIIrd year
Computer Engineering
Delhi College of Engineering
On Sat, Aug 6, 2011 at 6:37 PM, arvind kumar arvindk...@gmail.com wrote:
@sameer:When is GS visitin ur coll??
On Sat, Aug 6, 2011 at 4:17 PM, sameer gupta sgsa...@gmail.com wrote:
Delhi College Of Engg
its 16 bytes
for 32 bit computer ie 4 bytes
char occupies 1 byte and remaining 3 bytes are holes
double occupies 8 bytes
and int 4 bytes
since double starts on a new word boundary 3 bytes are holes
so its 16
On Sat, Aug 6, 2011 at 6:33 PM, SANDEEP CHUGH sandeep.aa...@gmail.comwrote:
struct
1 - 100 of 290 matches
Mail list logo
