If there are total 5 tyres, including the 4 attached ones...
you can change do a rotation, change tyre after every 2000 kms( or the
factors of 2000), in that case, the journey by each one would be 8000.
i think there can be several interpretations of the qn. IF for five extra
tyres, wud mean equal
ne idea abt how r thy gonna conduct their interview rounds?
On Fri, Sep 30, 2011 at 12:18 AM, Sahil Garg garg.sahi...@gmail.com wrote:
plz do tell..
i also need sm intervw questions at the earliest..
Sahil Garg
Computer Engineering
Delhi College of Engineering
On Thu, Sep 29, 2011 at
college?
On Thu, Sep 29, 2011 at 10:33 PM, aditya kumar aditya.kumar130...@gmail.com
wrote:
Guys does any one hve the idea about INTEL interview process for CS
students ?? The area they focus and types of question they ask .
If any have any idea plz help !
thnks
--
You received this
585 + (160 + 5)for slowest transactions *999 for the rest of the
instructions!
On Tue, Sep 27, 2011 at 12:49 AM, Gene gene.ress...@gmail.com wrote:
You guys have the right idea except that since it's multiple choice
you can do this with no math. With 1000 data items and only 4 stages,
the
what package did they offer?
On Mon, Sep 26, 2011 at 9:41 AM, aditya kumar
aditya.kumar130...@gmail.comwrote:
1st round was a written test . It had 30 mcq's . This was the easiest mcq's
.
20 simple aptitude questions were thr along with some 10 C questions .
21 students were shortlisted for
neone who has appeared for yahoo recently? can ne one mention thr i/w /
written rounds experience; they visited dce 3 days back also nit
surathkal...
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
vich coll?
On Fri, Sep 23, 2011 at 5:28 PM, sameer gupta gupta.sameer...@gmail.comwrote:
its a telephonic interview ..please guide how to prepare...
and please post question if anyone had interview recently
--
You received this message because you are subscribed to the Google Groups
in arrays i guess it can be simply analysed checking the last element of
array(which can be obtained by sizeof) checking how the entries are filled
inn the array...
in linked list hair tortoise rule...initialize two pointers...one's step
size:1, second's step size two... run through the linked
doesnt ur soln fails for even n?
suppose initial config : ||
now starting with second n +2 th
FEFF||EFEE
next 4, n+4:
FEFE || EFEF
4th 5th EE are continuous, correct me if m wrong:
my soln wud rather start with swaping 2nd 2n - 2 th element... n/4
swaps...
On Sun, Sep 4, 2011 at 3:24
can ne one post their experience of their test???
On Mon, Sep 5, 2011 at 3:27 PM, siva viknesh sivavikne...@gmail.com wrote:
plz mail me too once u ve attended
On Sep 5, 7:09 am, Akshay Rastogi akr...@gmail.com wrote:
Ditto harshit :)
On Sun, Sep 4, 2011 at 7:36 PM, sinjanspecial
@shady : +1
On Wed, Aug 31, 2011 at 10:22 PM, shady sinv...@gmail.com wrote:
you are banned... if this mail is genuine and then message me.
On Wed, Aug 31, 2011 at 9:16 PM, katie williams
katiewilliams...@gmail.com wrote:
*Immediate Need for Informatica Developer in IN !! $40/Hr Max...*
..100 or 99. So the probability is 47.9128/99*
*
*
*Here you are considering Sample space as length of the interval, right?
but
i think it should be cardinal({x/x belongs to Q and x belongs to
[1,100]}).*
On Fri, Aug 26, 2011 at 2:04 AM, Aditya Virmani
virmanisadi...@gmail.comwrote
it runs perfectly for me on both 64 bit 32 bit... check again
On Sun, Aug 28, 2011 at 2:20 PM, Nikhil Gupta nikhilgupta2...@gmail.comwrote:
The following C program segfaults of IA-64, but works fine on IA-32.
*int* main()
{
*int p;
p *=*
focus on quant di...verbal wud be easy...as in our college, thr were two
papers, on which had gud level of quant qns...qns were nt tough to crack,
but involved calculations which may take gud amt of time...like thr was 1
qn:
find the sum of first 1234 terms in the series 121221222112.
+1 Don... nthin is specified fr the nature of numbers if thy can be rational
or thy hav to be only natural/integral numbers...
On Wed, Aug 24, 2011 at 9:33 PM, Don dondod...@gmail.com wrote:
First find the endpoints of the region where the condition is met:
a + 100/a = 50
a^2 - 50a + 100 = 0
subtract the two check if its greater thn 0... c=a-b, if(c 1000 )
printf(a) else printf(b)
On Tue, Aug 23, 2011 at 7:50 PM, *$* gopi.komand...@gmail.com wrote:
int a,b;
int c=a-b;
c=c31;
int x =c0x01;
a=a-x*c;
Thx,
--Gopi
On Tue, Aug 23, 2011 at 7:32 PM, Sanjay Rajpal
@priya..wht if a=b=0 ? or a=b= 1000
On Sat, Aug 20, 2011 at 11:33 PM, priya ramesh
love.for.programm...@gmail.com wrote:
the answer is 1
sum=1
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
thts a Google question...17 is the answer
On Sat, Aug 20, 2011 at 2:08 AM, Dave dave_and_da...@juno.com wrote:
@Icy: A few years ago this was reported to be a Microsoft interview
question. It is so well publicized now that most people here have
probably seen it.
1 and 2 cross.
1 returns.
21, 2011 at 12:17 AM, Aditya Virmani virmanisadi...@gmail.com
wrote:
thts a Google question...17 is the answer
On Sat, Aug 20, 2011 at 2:08 AM, Dave dave_and_da...@juno.com wrote:
@Icy: A few years ago this was reported to be a Microsoft interview
question. It is so well publicized now
Regards,
PAYAL GUPTA
On Fri, Aug 19, 2011 at 3:29 AM, Aditya Virmani
virmanisadi...@gmail.com wrote:
If ü - Married
û - Not Married and
M-ü N-û
N-ü L-û
L-û M-ü
Who is married?
qn was put up in this way, asked in Deloitte 2004.
--
You received this message because you
this qn is copy pastewd as it is...no further instructions etc provided
On Fri, Aug 19, 2011 at 6:06 PM, priya ramesh
love.for.programm...@gmail.com wrote:
i think the question should be elaborated a li'l more. Plz give the
sentences given in the puzzle. May be we cud solve then
--
You
If ü - Married
û - Not Married and
M-ü N-û
N-ü L-û
L-û M-ü
Who is married?
qn was put up in this way, asked in Deloitte 2004.
--
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
+1 sagar pareek...
i used the following approach:
let the num be xy
so...
(10y + x) - (10x + y) is the distance travelled in 1 hr...
now, the the next milestone must be a three digit number, which can be of
following compostion: 1xy or xzy or yzx whr 0=z9 coz aif z=9, distance
travlled in tht hr
if k is fixed, sort the items according to their price, buy k cheapest items
start taking the most expensive item fr free
actually tht is nt a real lyf prblem, usually the dealers limit no. of free
items on a single bill k i never constant, tht may create
inconsistencies.
On Sat,
u can never find tht thru ur prgm...sizeof int is compiler dependant whether
its 32/64 bit...
On Thu, Aug 11, 2011 at 4:35 PM, sukran dhawan sukrandha...@gmail.comwrote:
how to determine whether the machine is a 32 bit or 64 bit using a c
program?
is it by sizeof(int) * 4?
--
You received
is it 100 men 100 women?
On Wed, Aug 10, 2011 at 3:25 PM, programming love
love.for.programm...@gmail.com wrote:
is it 101/200??
On Wed, Aug 10, 2011 at 3:41 AM, Prakash D cegprak...@gmail.com wrote:
is there anything like there should be atleast one man and one women
should dance
is it giving an error at *nodeptr declaration?
On Tue, Aug 9, 2011 at 8:26 PM, programming love
love.for.programm...@gmail.com wrote:
#includestdio.htypedef struct {char * a;
}*nodeptr;
main(){nodeptr *h;h-a=programming;printf(hi %s\n, h-a);}
this gives an error. Please explain the
i guess ur qn was how will u decide which frame shud b ur thumbnail...as
after tht, the frame cud be set as a thumbnail which is pretty much an eay
task in windows programming.i think most, dun hav much info abt it though,
thumbnails shud contain more of data; i mean shudnt be unicolour(blank
yes it may reduce the space req...suppose a subroutine is never called by a
execution, thn the memory req by tht subroutine wnt be allocated.
On Mon, Aug 8, 2011 at 4:26 PM, vijay goswami vjrockks...@gmail.com wrote:
it reduces the size of the source file
On Mon, Aug 8, 2011 at 4:18 PM,
what if the input is all negative?
On Mon, Aug 8, 2011 at 12:57 PM, WgpShashank shashank7andr...@gmail.comwrote:
hey guys I think we can do it in O(N) Check out
http://shashank7s.blogspot.com/2011/07/find-three-numbers-in-array-which-forms.html
let me know missed something ?
Thanks
, if not, please correct me
On Mon, Aug 8, 2011 at 4:40 PM, Aditya Virmani virmanisadi...@gmail.comwrote:
what if the input is all negative?
On Mon, Aug 8, 2011 at 12:57 PM, WgpShashank
shashank7andr...@gmail.comwrote:
hey guys I think we can do it in O(N) Check out
http://shashank7s.blogspot.com/2011
implementing these functions is not tht an easy task...google it...u ll find
malloc for sure...thr r diff versions available.
On Mon, Aug 8, 2011 at 10:56 AM, Aman Kumar amanas...@gmail.com wrote:
Hiii
tell me how to implement own realloc and malloc and free function?
any link for this??
shared memory
On Mon, Aug 8, 2011 at 5:43 PM, Himanshu Srivastava
himanshusri...@gmail.com wrote:
named pipes!!!
On Mon, Aug 8, 2011 at 5:36 PM, Kamakshii Aggarwal
kamakshi...@gmail.comwrote:
Fastest IPC mechanism is
1. ?shared memory
2. ?pipes
3. ?named
PM, Aditya Virmani
virmanisadi...@gmail.comwrote:
implementing these functions is not tht an easy task...google it...u ll
find malloc for sure...thr r diff versions available.
On Mon, Aug 8, 2011 at 10:56 AM, Aman Kumar amanas...@gmail.com wrote:
Hiii
tell me how to implement own realloc
link time i guess
On Mon, Aug 8, 2011 at 5:38 PM, hary rathor harry.rat...@gmail.com wrote:
link time
--
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
4.94 ns
c
c
b
On Tue, Aug 9, 2011 at 1:32 AM, aditi garg aditi.garg.6...@gmail.comwrote:
Q1.in a memory hierarchy, M1,M2
M1 access time is 2 ns ,M2 accesstime is 100 ns . the hit ratio for
M1 is .97, then what's the avg access time?
Q2.two heaps of sizes m,n are given,
then the time needed
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
{
i guess it depends on ur system configuration...for 32 bit
machines...respective sizes allocated would be 4,4,8 :giving 16
on 64 bit machines it wud be 8,8,8: giving 24. Correct me if i am wrong.
On Sat, Aug 6, 2011 at 9:24 PM, SANDEEP CHUGH sandeep.aa...@gmail.comwrote:
@ sukran , nitish :
@arvind : which college?
@sameer: how much are they offering?
On Sat, Aug 6, 2011 at 9:07 PM, arvind kumar arvindk...@gmail.com wrote:
oh ok..for us on 12th!
On Sat, Aug 6, 2011 at 6:46 PM, Shashank Jain shashan...@gmail.comwrote:
10th aug
Shashank Jain
IIIrd year
Computer Engineering
1033,2066?
On Sat, Aug 6, 2011 at 11:09 PM, aditi garg aditi.garg.6...@gmail.comwrote:
CHAR A[10][15] AND INT B[10][15] IS DEFINED
WHAT'S THE ADDRESS OF A[3][4] AND B[3][4]
IF ADDRESS OF A IS OX1000 AND B IS 0X2000
--
You received this message because you are subscribed to the Google
thiis is theexact thing i thought abt segmentation error...but it is again
system-dependent...if u wud try this on 7 or vista or XP...which are high
on resources it wont give error to that...but there is definately an error
in code...
but y do u think tht junk wont be overwritten? s is simply a
it has 4bytes in memory, pointed by the char pointer...just remember *(s+1)
means jump by the size of pointer(here char); so it will print first byte in
1st cycle, so on...
On Thu, Aug 4, 2011 at 10:11 PM, Vijay Khandar vijaykhand...@gmail.comwrote:
Thanks, but can u elaborate some more
42 matches
Mail list logo
