Hi
Are u attending off-campus or on-campus interview?
On 10/1/11, R@TH!$H rathishkan...@gmail.com wrote:
Hi,
I am attending Google interview on Monday. Please help me with sample
questions.
Thanks Regards,
Rathish Kannan
--
You received this message because you are subscribed to the
@somnath...can u pls elaborate...
he was looking for an elaborate ans...
--
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
@adi..
he gave a hint that space used should not b of order of range of numbers but
should depend on how many numbers are inserted...
eg..if range is say 1000...bt u entered only 5 nos -8,100,202,600,989.
u can use space of order 5..and not 1000
--
You received this message because you are
The hash table would be used by separate chaining method not open
addressing because it may not find the correct entry efficiently in
the hash table . In case of open addresssing the value gets entered in
the first available entry after collision.
In case of insertion :- (I have considered only
Thanx,,NIT Durgapur,Do i need to study OS and RDBMS
On Sat, Oct 1, 2011 at 10:41 AM, .itoa nitm...@gmail.com wrote:
BST ,very Large Input data problems, graphs (dfs bfs ,etc). which college
?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks
The written round will consist of 4 sets . Time 1hr 30 mins
First 20 question : C/C++ ( lots of segmentation error , run time and
compile time errors , pointer to function , and Binary Trees )
Second 20 quesitons : OS questions ( Page , Trashing , Demand paging ,
scheduling , throughout etc)
Focus on Algorithm , Data Structure and your coding skills , as they
can ask for proper working code at tht moment .
--
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
Thanx :)
On Sat, Oct 1, 2011 at 12:39 PM, SAMMM somnath.nit...@gmail.com wrote:
Focus on Algorithm , Data Structure and your coding skills , as they
can ask for proper working code at tht moment .
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks
Dont know how to delete (how adress will be known of the node?
On Sat, Oct 1, 2011 at 12:27 PM, SAMMM somnath.nit...@gmail.com wrote:
The hash table would be used by separate chaining method not open
addressing because it may not find the correct entry efficiently in
the hash table . In case
What is the time complexity of morris traversal ?
--
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
anyone with better explanation ??.it's still not clear to me :(
--
Amol Sharma
Third Year Student
Computer Science and Engineering
MNNIT Allahabad
http://gplus.to/amolsharma99
http://twitter.com/amolsharma99http://in.linkedin.com/pub/amol-sharma/21/79b/507http://youtube.com/amolsharma99
similar question...also gives segmentation fault...plz explain...
http://ideone.com/nlpzT
#includeunistd.h#includefcntl.h#includestdio.h
int main()
{
int pid;
printf
http://www.opengroup.org/onlinepubs/009695399/functions/printf.html(Parent\n);
pid = vfork();
off campus.
-- RK :)
On Sat, Oct 1, 2011 at 11:59 AM, arvind kumar arvindk...@gmail.com wrote:
Hi
Are u attending off-campus or on-campus interview?
On 10/1/11, R@TH!$H rathishkan...@gmail.com wrote:
Hi,
I am attending Google interview on Monday. Please help me with sample
hey,,,what is the process of attending google offcampus process.
kindly let us know..
On Sat, Oct 1, 2011 at 1:52 PM, Rathish Kannan rathishkan...@gmail.comwrote:
off campus.
-- RK :)
On Sat, Oct 1, 2011 at 11:59 AM, arvind kumar arvindk...@gmail.comwrote:
Hi
Are u attending
apply through google careers site...
-- RK :)
On Sat, Oct 1, 2011 at 2:02 PM, Deepak Garg deepakgarg...@gmail.com wrote:
hey,,,what is the process of attending google offcampus process.
kindly let us know..
On Sat, Oct 1, 2011 at 1:52 PM, Rathish Kannan rathishkan...@gmail.comwrote:
hey can pls share the link.
thnks
On Sat, Oct 1, 2011 at 2:04 PM, Rathish Kannan rathishkan...@gmail.comwrote:
apply through google careers site...
-- RK :)
On Sat, Oct 1, 2011 at 2:02 PM, Deepak Garg deepakgarg...@gmail.comwrote:
hey,,,what is the process of attending google
Any who has appeared for the Infibeam process,please shed some light
on the pattern of the written paper and interview process?
Thanks in advance
Deepak Kanojia
Computer Engineering,NSIT
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
FFS. here you go: http://lmgtfy.com/?q=google+careers
On Sat, Oct 1, 2011 at 2:09 PM, Deepak Garg deepakgarg...@gmail.com wrote:
hey can pls share the link.
thnks
On Sat, Oct 1, 2011 at 2:04 PM, Rathish Kannan rathishkan...@gmail.comwrote:
apply through google careers site...
--
Can anybody tell me the procedure of amdocs and the difficulty level to
crack the company??
--
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
lol!!!
--
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
did you search archives before asking ?
On Sat, Oct 1, 2011 at 4:04 PM, Nitin coolguyinat...@gmail.com wrote:
Can anybody tell me the procedure of amdocs and the difficulty level to
crack the company??
--
You received this message because you are subscribed to the Google Groups
Algorithm
guys plz xplain logic behind the string permutation.n if we have
duplicates that should program display the duplicates or notnyone plz
tell the logic/code for this.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group,
hey guys till date SAP lab has already visited to many colleges so
now plz do share any info or experience u have.
--
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
Hey, Kronos India is visiting our college. Any idea about the pattern
of the campus
selection process? As in type of questions asked?
college - MNNIT Allahabad
pkg - 6.48 lpa
Rahul Tiwari
information tech.
MNNIT Allahabad
9838339030
--
You received this message because you are
Guys plz suggest me some final year topic which is feasible ?
my interest area is network security
thanks regards
jestin
--
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
@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
Both share the same address space that includes even the stack
The child *returns first clearing the stack.*Now when the parent process
tries to return the child process had already cleared the stack.SO it no
longer belongs to the parent process,so sigsegv.
Try with gdb dissassemble and
You are given two 32-bit numbers, N and M, and two bit positions, i and j.
Write a method to set all bits between i and j in N equal to M (e.g., M
becomes a substring of N located at i and starting at j).
EXAMPLE:
Input: N = 100, M = 10101, i = 2, j = 6
Output: N = 10001010100
_
plz xpalin waht is deep and shallow copy in c++
--
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
Given 2 set of arrays of size N(sorted +ve integers ) find the median of the
resultent array of size 2N.
(dont even think of sorting the two arrays in a third array , though u can
sort them. Try something better than order N ..order LogN )
--
Regards
Chunky Garg
--
You received this message
deep copy-value copy
so for pointers oly address is copied nt the value
so its like two variables pointing to same value
shallow copy means pointed to value is copied.so two distinct copies exists
On Sat, Oct 1, 2011 at 5:20 PM, rahul sharma rahul23111...@gmail.comwrote:
plz xpalin waht is
sukran can u given a litle xample plz...
On Sat, Oct 1, 2011 at 6:01 PM, sukran dhawan sukrandha...@gmail.comwrote:
deep copy-value copy
so for pointers oly address is copied nt the value
so its like two variables pointing to same value
shallow copy means pointed to value is copied.so two
void main()
{
void *ptr;
char *a='A';
char *b=TAN;
int i=50;
ptr=a;
ptr=(*char)malloc(sizeof(a));
printf(%c,*ptr);
ptr=i;
ptr=(*int)malloc(sizeof(i));
printf(%d,++(*ptr));
ptr=b;
ptr=(*char)malloc(sizeof(b));
printf(%c,++(*ptr));
}
Ans: A51AN
int his o/p int last printf it is %c but hw it is
@sukran, it seems u ve by mistake written deep copy in place of shallow
copy vice versa.
On Sat, Oct 1, 2011 at 8:31 AM, sukran dhawan sukrandha...@gmail.comwrote:
deep copy-value copy
so for pointers oly address is copied nt the value
so its like two variables pointing to same value
yup sorry vice versa :)
On Sat, Oct 1, 2011 at 6:17 PM, rahul vatsa vatsa.ra...@gmail.com wrote:
@sukran, it seems u ve by mistake written deep copy in place of shallow
copy vice versa.
On Sat, Oct 1, 2011 at 8:31 AM, sukran dhawan sukrandha...@gmail.comwrote:
deep copy-value copy
so
http://www.learncpp.com/cpp-tutorial/912-shallow-vs-deep-copying
Go through this link..
--
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/-/NIWaOsWRCT0J.
To
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 ,
Think pointer as an array , then u can understand the problm.
Here *ptr=TAN ; so ptr points to the First adress of the string . when
u do increment it just point to the next address and Thus is gives
AN .
On 10/1/11, rahul sharma rahul23111...@gmail.com wrote:
void main()
{
void *ptr;
char
I should definitely thank this group and all its members. This
group played a vital role in my placement preparations and surely it
was an excellent doubt clearing group.
To mention some instance I read about mutex and semaphore in many
sites which is not so good, but in this group, some of
A shallow copy of an object copies all of the member field values.
This works well if the fields are values, but may not be what you want
for fields that point to dynamically allocated memory. The pointer
will be copied. but the memory it points to will not be copied -- the
field in both the
guys
i m a computer science 4th year students.
Recently i developed an Intrusion detection system and bandwidth utilization
monitoring tool (using JAVA) for ATT as a 2 months internship project
kindly do suggest me some very good final year projects
my interest area is Artificial Intelligence,
but it is ++(*ptr)
i mean valure at ptr is incremented..n hw AN when we have written
%ci cant get dat
On Sat, Oct 1, 2011 at 6:47 PM, SAMM somnath.nit...@gmail.com wrote:
Think pointer as an array , then u can understand the problm.
Here *ptr=TAN ; so ptr points to the First adress
congrats buddy
On Sat, Oct 1, 2011 at 6:51 PM, siva viknesh sivavikne...@gmail.com wrote:
I should definitely thank this group and all its members. This
group played a vital role in my placement preparations and surely it
was an excellent doubt clearing group.
To mention some instance I
cONGRATES
On Sat, Oct 1, 2011 at 7:34 PM, rahul sharma rahul23111...@gmail.comwrote:
congrats buddy
On Sat, Oct 1, 2011 at 6:51 PM, siva viknesh sivavikne...@gmail.comwrote:
I should definitely thank this group and all its members. This
group played a vital role in my placement
plz give any c++ xample to xplain bit more
On Sat, Oct 1, 2011 at 6:59 PM, Bejoy kalikotay(sikkimesechora)
bijaykaliko...@gmail.com wrote:
A shallow copy of an object copies all of the member field values.
This works well if the fields are values, but may not be what you want
for fields
thnx saurabh.u rock :)
--
Amol Sharma
Third Year Student
Computer Science and Engineering
MNNIT Allahabad
http://gplus.to/amolsharma99
http://twitter.com/amolsharma99http://in.linkedin.com/pub/amol-sharma/21/79b/507http://youtube.com/amolsharma99
On Sat, Oct 1, 2011 at 4:55 PM, saurabh
you if you like both security and artificial intelligence
maybe you would enjoy developing a binary analyser
that could be used for fuzzing, reverse engineering and
(the one I find more interesting) worm/trojan/botnet analysis.
On Sat, Oct 1, 2011 at 10:47 AM, Deepak Garg deepakgarg...@gmail.com
thanks for replying sir :)
cn u pls tell me more about developing a binary analyzer that could be used
for fuzzing
On Sat, Oct 1, 2011 at 7:40 PM, Hatta tmd...@gmail.com wrote:
you if you like both security and artificial intelligence
maybe you would enjoy developing a binary analyser
that
hi frnds..can any of you pls tell how to cut strings in optimal
time..in dynamic programming..
thanx:)
--
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
an example: http://www.eresi-project.org
fuzzing as in fuzzy-testing -- an automated engine to find bugs,
vulnerabilities, etc.
On Sat, Oct 1, 2011 at 11:24 AM, Deepak Garg deepakgarg...@gmail.com wrote:
thanks for replying sir :)
cn u pls tell me more about developing a binary analyzer that
in code bellow you declare main because any executable needs an
entrypoint you cannot fake that
anyway, it doesn't use main at all to invoke those functions.
http://www.geeksforgeeks.org/archives/14538
#includestdio.h
/* Apply the constructor attribute to myStartupFun() so that it
is
all pairs of integers sum upto x.shiuld we take care of duplicates??
--
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
what is the question
???
On Sat, Oct 1, 2011 at 9:08 PM, rahul sharma rahul23111...@gmail.comwrote:
all pairs of integers sum upto x.shiuld we take care of
duplicates??
--
You received this
Just wondering when a element in a Vector is deleted/removed , is the
preceding elements r shifted left or it behave like a linked
list???
For both Java and C+++ ...
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group,
hey...d code doesn't compile on gcc though
On Sat, Oct 1, 2011 at 7:32 PM, rahul sharma rahul23111...@gmail.comwrote:
but it is ++(*ptr)
i mean valure at ptr is incremented..n hw AN when we have written
%ci cant get dat
On Sat, Oct 1, 2011 at 6:47 PM, SAMM somnath.nit...@gmail.com
nice question, Vector are implemented as arrays so they are shifted unlike
linked list.
On Sat, Oct 1, 2011 at 9:34 PM, SAMMM somnath.nit...@gmail.com wrote:
Just wondering when a element in a Vector is deleted/removed , is the
preceding elements r shifted left or it behave like a linked
congrats :) wats d package ?
On Sat, Oct 1, 2011 at 7:35 PM, sagar pareek sagarpar...@gmail.com wrote:
cONGRATES
On Sat, Oct 1, 2011 at 7:34 PM, rahul sharma rahul23111...@gmail.comwrote:
congrats buddy
On Sat, Oct 1, 2011 at 6:51 PM, siva viknesh sivavikne...@gmail.comwrote:
I
all integers pairs in array that sum to given value say (k)...i have two sol
for the array that contain unique elements..m asking should i take care of
duplicates or notcoz my logic wont work for duplicates like if i have 0
1 2 3 4 5 6 8 8 if i want all pairs having some 8 ...den it should
congrats man, you deserved it... :D
On Sat, Oct 1, 2011 at 9:53 PM, sukran dhawan sukrandha...@gmail.comwrote:
congrats :) wats d package ?
On Sat, Oct 1, 2011 at 7:35 PM, sagar pareek sagarpar...@gmail.comwrote:
cONGRATES
On Sat, Oct 1, 2011 at 7:34 PM, rahul sharma
yeah...i have got it from somewhr i thought that in hurry someone had posted
it in wrong syntax..like changing (*char) to (*char)
On Sat, Oct 1, 2011 at 9:43 PM, Akash Mukherjee akash...@gmail.com wrote:
hey...d code doesn't compile on gcc though
On Sat, Oct 1, 2011 at 7:32 PM, rahul
yes they are shifted
that's why you should use std::deque whenever that matters
http://www.cplusplus.com/reference/stl/vector/erase/
Because vectors keep an array format, erasing on positions other than
the vector end also moves all the elements after the segment erased to
their new positions,
---
Shiwakant Bharti wants to stay in better touch using some of Google's
coolest new
products.
If you already have Gmail or Google Talk, visit:
http://mail.google.com/mail/b-9b563a2e55-fc6890b3d9-4iBp_s4t31qYJm2UZYnkfC0OI7A
problem description ? any link to the problem ?
On Sat, Oct 1, 2011 at 7:55 PM, Srividhya srisam261...@gmail.com wrote:
hi frnds..can any of you pls tell how to cut strings in optimal
time..in dynamic programming..
thanx:)
--
You received this message because you are subscribed to the
nyone provide me with recursive sol of the following prob.
find the sum of all even nos. in the fibbonacci series upto 1000thnx in
davance
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
thanks a lot ppl :) .. package was 5 without ctc + lot of benefits...
On Oct 1, 9:24 pm, shady sinv...@gmail.com wrote:
congrats man, you deserved it... :D
On Sat, Oct 1, 2011 at 9:53 PM, sukran dhawan sukrandha...@gmail.comwrote:
congrats :) wats d package ?
On Sat, Oct 1, 2011 at
What is the package??
On Oct 1, 3:23 pm, Deepak Kanojia dint...@gmail.com wrote:
Any who has appeared for the Infibeam process,please shed some light
on the pattern of the written paper and interview process?
Thanks in advance
Deepak Kanojia
Computer Engineering,NSIT
--
You received this
F(0)+F(2)+...+F(2n) = F(2n+1) - 1
Wladimir Araujo Tavares
*Federal University of Ceará http://lia.ufc.br/%7Ewladimir/
Homepage http://lia.ufc.br/%7Ewladimir/ |
Maratonahttps://sites.google.com/site/quixadamaratona/|
*
On Sat, Oct 1, 2011 at 1:40 PM, rahul sharma rahul23111...@gmail.comwrote:
PLZ EXPLAIN A BIT MORE
On Sat, Oct 1, 2011 at 10:46 PM, Wladimir Tavares wladimir...@gmail.comwrote:
F(0)+F(2)+...+F(2n) = F(2n+1) - 1
Wladimir Araujo Tavares
*Federal University of Ceará http://lia.ufc.br/%7Ewladimir/
Homepage http://lia.ufc.br/%7Ewladimir/ |
I am I not wrong, the problem asks for fib numbers which are even, not fib
numbers with even index...?
On Sat, Oct 1, 2011 at 10:16 PM, Wladimir Tavares wladimir...@gmail.comwrote:
F(0)+F(2)+...+F(2n) = F(2n+1) - 1
Wladimir Araujo Tavares
*Federal University of Ceará
yeah like0 1 1 3 5 8 .only even shpuld be added 0+8..u r ryt
On Sat, Oct 1, 2011 at 10:56 PM, Shuaib Khan aries.shu...@gmail.com wrote:
I am I not wrong, the problem asks for fib numbers which are even, not fib
numbers with even index...?
On Sat, Oct 1, 2011 at 10:16 PM,
Sorry!
you want to find the following sum:
F (0) + F (3) + F (6) + ... + F (3n) =?
I do not know any formula for this sum.
This formula may help here:
F (0) + F (1) + F (2) + F (3 )+...+ F (n) = F (n +2) - 1
F (3n) = 3F (n) ^ 3 + 3 (-1) ^ nF (n)
You can prove this by induction!
Wladimir
DBMS questions.designing architecture stuffs using normalization
etc..basic DS questions.DBMS is the most imp aspect prepare it
well...good luck :)
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
check dis out
int fibbevensum()
{
static int a=0,b=1;
static int c,sum;
c=a+b;
if(c1000)
return sum;
if(c%2==0)
sum=sum+c;
a=b;
b=c;
fibbevensum();}
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
its giving 16384???
On Sat, Oct 1, 2011 at 11:29 PM, geeks ankurshukla.h...@gmail.com wrote:
check dis out
int fibbevensum()
{
static int a=0,b=1;
static int c,sum;
c=a+b;
if(c1000)
return sum;
if(c%2==0)
sum=sum+c;
a=b;
b=c;
fibbevensum();}
--
You received this message because
it looks ok but not working
On Sat, Oct 1, 2011 at 11:37 PM, rahul sharma rahul23111...@gmail.comwrote:
its giving 16384???
On Sat, Oct 1, 2011 at 11:29 PM, geeks ankurshukla.h...@gmail.com wrote:
check dis out
int fibbevensum()
{
static int a=0,b=1;
static int c,sum;
c=a+b;
if(c1000)
guys, i have created a FILESYSTEM web site and created a connection
with database in sql server 2008it worked fine
but when i use the same connection string to connect a http website
hosted on my IIS sever locally to the same databaseit says it
cannot open the connection.please
as we know in recursion new set of variables are created for every
recurrsive call...if i have array in recursion,then does a new array created
for every recursive call???
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group,
arrays are passed by reference, but variables are created each time
On Sun, Oct 2, 2011 at 12:14 AM, rahul sharma rahul23111...@gmail.comwrote:
as we know in recursion new set of variables are created for every
recurrsive call...if i have array in recursion,then does a new array created
for
Does microsoft hire off-campus???..if yes, then what is their
process???..n what type of questions they ask???...what about
google???
actually i've gone through microsoft's collg hiring process.it was
closebut hard luck,anyway..so gonna try after 6 months.
--
You
how much package??
Sahil Garg
Computer Engineering
Delhi College of Engineering
On Sun, Sep 25, 2011 at 1:32 AM, aditya kumar
aditya.kumar130...@gmail.comwrote:
since the company is about data and storage manageemnt so do we need to
stress on DBMS .??
and thnks fr all the help :)
On Sat,
package is 8.75 l that has 7.5l as fst mothn bonus .
so ctc is 8l
On Sun, Oct 2, 2011 at 2:10 AM, Sahil Garg garg.sahi...@gmail.com wrote:
how much package??
Sahil Garg
Computer Engineering
Delhi College of Engineering
On Sun, Sep 25, 2011 at 1:32 AM, aditya kumar
if the string is like abcdef
then they will be numbered like 012345 and now we represent them in base 5
numbering and also in sorted order
the next permutation is
012354
012435
012453
012534
012543
013245
and so on..
On Sat, Oct 1, 2011 at 4:11 PM, rahul sharma rahul23111...@gmail.comwrote:
wait wait, that depends on the scope, the language, eventually the
compiler, everything.
please show a snip of recursive code so we can tell, please?
On Sat, Oct 1, 2011 at 3:44 PM, rahul sharma rahul23111...@gmail.com wrote:
as we know in recursion new set of variables are created for every
@rahul:
here is the full working codE:
#includestdio.h
int fibbevensum()
{
static int a=0,b=1;
static int c=0,sum=0;
// printf(\nHi %d %d %d\n,a,b,sum);
c=a+b;
if(c8)
return sum;
if(c%2==0)
sum=sum+c;
a=b;
b=c;
int d=fibbevensum();
return d;}
int main(){
int ans;
every company hire off campus ...just type company name followed by
carrers..n apply...simple.
On Sun, Oct 2, 2011 at 12:47 AM, Manish Verma jalsa.n.sa...@gmail.comwrote:
Does microsoft hire off-campus???..if yes, then what is their
process???..n what type of questions they
i have searched the archives.any give me algorithm with example...it
would be great help..thnx in advance
On Sun, Oct 2, 2011 at 2:57 AM, Prakash D cegprak...@gmail.com wrote:
if the string is like abcdef
then they will be numbered like 012345 and now we represent them in base 5
numbering
supose i have an array in recursion which is initialized with value n...
in every recusrsive call i decrement n
so that mean if initially array initialized with 10
but in second recursive call it will be 9
n when i print it will print with 10 initialized value n with 9 alosi
thnk so...what
--
**With Regards
Deoki Nandan Vishwakarma
*
*
--
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
int sum(int f0,int f1)
{
if(f1=1000)
{
int x= sum(f1,f0+f1);
if(f1%2==0) x+=f1;
return x;
}
else
return 0;
}
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send
nebody has OPERATING SYSTEMS DESIGN AND IMPLEMENTATION by Andrew S. Tanenbaum
thanx :)
On Sun, Oct 2, 2011 at 8:38 AM, Deoki Nandan deok...@gmail.com wrote:
--
With Regards
Deoki Nandan Vishwakarma
--
You received this message because you are subscribed to the Google Groups
Algorithm
i have searched the archives.any give me algorithm with
example...it would be great help..thnx in advance
#include iostream
#include string
#include stdio.h
using namespace std;
void
permute(string inp, string oth)
{
if ( inp == ) {
coutothendl;
in structure we want adress to be multiple of the max size variable of
structure.
mean i have
struct
{
int
float
char}
then multiple of 4
struct
{
short int
int
}
then multiple of 2.
m i ryt
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
does it actually work ?
i think such kind of mails to recruiters directly go to spam.
On Sun, Oct 2, 2011 at 8:07 AM, rahul sharma rahul23111...@gmail.comwrote:
every company hire off campus ...just type company name followed by
carrers..n apply...simple.
On Sun, Oct 2, 2011 at 12:47 AM,
gr 8 soln...thnx
2011/10/2 akanksha akanksha.271...@gmail.com
int sum(int f0,int f1)
{
if(f1=1000)
{
int x= sum(f1,f0+f1);
if(f1%2==0) x+=f1;
return x;
}
else
return 0;
}
--
You received this message because you are subscribed to the
i dont think sofor fresher its best throug campusotherwise at
least1-2 year experience needed...for ms u can go
https://careers.microsoft.com/search.aspx...there are lot of openings..
On Sun, Oct 2, 2011 at 10:28 AM, shady sinv...@gmail.com wrote:
does it actually work ?
i think such
there must be a non brute force approach too rite???
--
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
ok, thanks :)
On Sun, Oct 2, 2011 at 10:35 AM, rahul sharma rahul23111...@gmail.comwrote:
i dont think sofor fresher its best throug campusotherwise at
least1-2 year experience needed...for ms u can go
https://careers.microsoft.com/search.aspx...there are lot of openings..
On Sun,
yea...first sol is brute force...but this is not..that is posted by
akanshai think...but not sure...the question wants only
recursivehoope sumone may come with sumthng new
On Sun, Oct 2, 2011 at 10:35 AM, Siddhartha Banerjee
thefourrup...@gmail.com wrote:
there must be a non brute
this is bruteforce. You are calculating all fib. numbers.
On Sun, Oct 2, 2011 at 10:38 AM, rahul sharma rahul23111...@gmail.comwrote:
yea...first sol is brute force...but this is not..that is posted by
akanshai think...but not sure...the question wants only
recursivehoope sumone may
Using Wladimir's formulas, you have:
F(0) + F(1) + F(2) + F(3) + F(4) + F(5) + F(6) + ... + F(3n-2) + F(3n-1) +
F(3n) = F(3n+2) - 1
F(0) +(F(1) + F(2))+ F(3) +(F(4) + F(5))+ F(6) + ... +(F(3n-2) + F(3n-1))+
F(3n) = F(3n+2) - 1
F(0) + 2F(3) + 2F(6) + ... + 2F(3n) = F(3n+2) - 1
Since F(0) = 0,
1 - 100 of 102 matches
Mail list logo
