can u please elaborate...i am not able to understand the figure..plz
explainit would be of great help
On Sat, Oct 27, 2012 at 5:57 AM, payal gupta gpt.pa...@gmail.com wrote:
should be 6C3 or 20 perhaps.
On Sat, Oct 27, 2012 at 3:29 AM, rahul sharma rahul23111...@gmail.comwrote:
Finite
should i take it how many ways are there to reach from start to the top
right destination...x,y,z,a,b,c, are i/p statexyzabc one stringabc
xyz is another...if m ryt then is dere any formulla to calute or we have to
do it manuall
On Sat, Oct 27, 2012 at 11:02 AM, rahul sharma
compiler tried to link with the memory of int arr[10] it could nt find it ,
as u have declraed it to be integer type pointer , and in file 1 it could
find integer pointer .
On Wed, Oct 24, 2012 at 11:06 PM, rahul sharma rahul23111...@gmail.comwrote:
int arr[10] // in fyl 1
now in fyl 2
: This is an algorithm group, please refrain from asking such language
specific questions.
On 21 October 2012 00:19, rahul sharma rahul23111...@gmail.com wrote:
Actually i have taken form http://www.geeksforgeeks.org/archives/730
Please explain me o/p...as hex representated by 4 bitsthen how cum
]still how these
are able to grouped??
On Fri, Oct 26, 2012 at 1:53 AM, rahul sharma rahul23111...@gmail.comwrote:
As per o/p below:
00 00 80 3f
01 00 00 00
44 ff 28 00
01 00 00 00
first byte address is first row.
second byte address is second row.
third byte address third row
and so
Please dont reply to thi post..wrng questionsry for that
On Fri, Oct 26, 2012 at 2:31 AM, rahul sharma rahul23111...@gmail.comwrote:
address of each byte is printed...each byte is 32 bit long...so 32/4=8 hex
for each row...but how these are separated with %.2x tin group of
2's%.2x
Plz give a program for this...thnx
--
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
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
Pleaase reply with sol as asp
Fille 1:
#includestdio.h
extern int i;
extern int j;
void next(void);
int main()
{
++i;
printf(%d,i);
next();
getchar();
}
int i=3;
void next()
{
++i;
printf(%d,i);
printf(%d,j);
other();
}
File 2:
extern int i;
void other()
{
++i;
for this shall we process all items and parallely calculate first and
second max.
or tournament methos i best for thsi..
if tournament method is best can anybody provide me with code with
tournament method to find second smallest..
--
You received this message because you are subscribed to
PM, rahul sharma rahul23111...@gmail.comwrote:
Pleaase reply with sol as asp
Fille 1:
#includestdio.h
extern int i;
extern int j;
void next(void);
int main()
{
++i;
printf(%d,i);
next();
getchar();
}
int i=3;
void next()
{
++i;
printf(%d,i);
printf(%d,j
can nyone provide me dummy code of how exactly to use extern in c..
in dev environment
when i declare int i in one fyl
and try use use with extern int i in another then it doesnt compile..plz
coment
On Wed, Oct 24, 2012 at 9:58 PM, rahul sharma rahul23111...@gmail.comwrote:
Then why its
int arr[10] // in fyl 1
now in fyl 2
extern int *arr
void foo()
{
arr[0]=10;
}
what kind of problem can be there?in what condition and y?
plz comment
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
I think it is overwritng old values when child end..parent overwrite old
value with new..m i ryt?
On Thu, Oct 25, 2012 at 3:00 AM, rahul sharma rahul23111...@gmail.comwrote:
I wana ask that when we pass array by recursion then as we know formal
parameters are passed by value and array by base
We could create a string representing the inorder and preorder traversals.
If T2’s preorder traversal is a substring of T1’s preorder traversal, and
T2’s inorder traversal is a substring of T1’s inorder traversal, then T2 is
a substring of T1
any other method??
we can also do by folloowing
1.
Guys i have read an article somewhere regarding optimization of recursive
fibonicci so that we donot need to calculate the sum that we have already
calculated...
In case if factorial,we donot need to find factorial that we have already
calculated...
I just forgot where i read from..may br from
thnx a lot atul...was looking for that only...can u plz tell me under which
section u get this post
On Sun, Oct 21, 2012 at 4:03 PM, atul anand atul.87fri...@gmail.com wrote:
http://www.geeksforgeeks.org/archives/10120
On 10/21/12, rahul sharma rahul23111...@gmail.com wrote:
Guys i have
yes got it..thnx :d
On Sun, Oct 21, 2012 at 4:19 PM, atul anand atul.87fri...@gmail.com wrote:
@rahul : nope it wont work ..check for this input :-
input = 1, 2,3,6,4 ,101, 6
by removing msis[i] msis[j] + arr[i] condition then you are
excluding the max sub-sequence found from j
Nice Dude ...:D
On Sun, Oct 21, 2012 at 11:28 PM, atul anand atul.87fri...@gmail.comwrote:
google searched it : geeksforgeeks + Fibonacci number ;) ;)
On 10/21/12, rahul sharma rahul23111...@gmail.com wrote:
thnx a lot atul...was looking for that only...can u plz tell me under
which
, 2012 at 12:05 AM, rahul sharma rahul23111...@gmail.comwrote:
void show_bytes(byte_pointer start, int len)
{
int i;
for (i = 0; i len; i++)
printf( %.2x, start[i]);
printf(\n);
}
byte_pointr is unsigned char *...typedef unsigned char * byte_pointer
plz tell
at 12:31 AM, Rahul Kumar Patle
patlerahulku...@gmail.com wrote:
Pls help to solve this que.. does any one have DP solution for following
que.
http://www.geeksforgeeks.org/archives/24488
section 5/question 2
Write a program to find all the possible paths from a starting point to
dest point
0 0 1 1
If there is a block it’s represented by 0.
If there is a path it’s represented by 1.
--
Thanks and Regards:
Rahul Kumar Patle
M.Tech, School of Information Technology
Indian Institute of Technology, Kharagpur-721302,
Indiahttp://www.iitkgp.ac.in/
Mobile No: +91-8798049298, +91
response awaited!!!
anyone??
On Sat, Oct 13, 2012 at 12:31 AM, Rahul Kumar Patle
patlerahulku...@gmail.com wrote:
Pls help to solve this que.. does any one have DP solution for following
que.
http://www.geeksforgeeks.org/archives/24488
section 5/question 2
Write a program to find all
, is compiler dependent).*
*3. Sizeof(reference) is always the sizeof Object itself. (mandated by
C++ standard)*
*4. Do references require extra storage? Maybe or maybe not. Read your
compiler docs.*
On 10 October 2012 02:30, rahul sharma rahul23111...@gmail.com wrote:
Clear some more questiosn
over here:
http://www.parashift.com/c%2B%2B-faq-lite/calling-virtuals-from-ctors.html
Also i recommend - *Inside the C++ Object Model* By Stanley B. Lippman.
Cheers,
On 10 October 2012 02:16, rahul sharma rahul23111...@gmail.com wrote:
Guys i have read that concept of virtual fxn
; /// Linked to standard output
extern ostream cerr; /// Linked to standard error (unbuffered)
The new implementation is done in C# format. So we use the term using to
include the iostream package.
On Tue, Oct 9, 2012 at 12:01 AM, rahul sharma rahul23111...@gmail.comwrote:
using name space
Plz explain below code
circle operator=(circle )
{
radius=c.radius;
x=c.x;
y=x.y;
return *this;
}
QUESTION IS : as we know reference is a const pointer...so return type
circle mean a pointer pointing to circle class object is created.Now
during return we write * this..
As per book this contains
@saurabhif i look from the way that i need to return a referencei.e. i
mean object...i will ryt *this for this..i knew thisbut
i have read that reference is a const pointer so if i look from this
prespective then do i need to return pointer(this)..
int *
Guys i have read that concept of virtual fxn is not applicable in case of
constructors..I means using virtual function in constructors always call
local function..i wan to read more on this..can nybody explain use of
virtual functions in constructor or provide me with a link for this..
thnx
--
at 12:23 AM, rahul sharma rahul23111...@gmail.comwrote:
@saurabhif i look from the way that i need to return a referencei.e.
i mean object...i will ryt *this for this..i knew
thisbut i have read that reference is a const pointer so if
i look from this prespective
,,,does it mean some pointer returned or it mean whole object
returned??
On Wed, Oct 10, 2012 at 2:23 AM, rahul sharma rahul23111...@gmail.comwrote:
Got confusedcant get it..:([?]
On Wed, Oct 10, 2012 at 1:00 AM, Prem Krishna Chettri
hprem...@gmail.comwrote:
Well Lemme try few more hand
If its NULL then y does it give segmentation fault as for NULL it should
print an empty stringplz xomment
On Sun, Oct 7, 2012 at 6:56 PM, DHARMENDRA KUMAR VERMA
dharmendrakumarverm...@gmail.com wrote:
Bcoz u r trying to access an argument which doesnt even exist...
for exmple
@dharmendradoes every uninitialized memory has NULL or there can be
some garbage value also...plz comment???
On Mon, Oct 8, 2012 at 9:02 PM, rahul sharma rahul23111...@gmail.comwrote:
If its NULL then y does it give segmentation fault as for NULL it should
print an empty stringplz
??
On Mon, Oct 8, 2012 at 5:07 PM, Sachin sachin.maheshw...@gmail.com wrote:
@rahul According to C specification, half filled array will be filled with
value 0. In your example you are setting str[0] as 'g' and str[1] as 'k'.
So the compiler sets str[29] as 0. So you string str becomes
{'g
using name space std
Please explain about this
thnx
--
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
#includestdio.h
int main()
{
int i;
char ch;
scanf(%c,ch);
printf(%d,ch);
// getchar();
getchar();
}
when i enter one digit no. it showswhen 2 digit it halts...y so??? we
can store 2 digit number like 65 in 8 bit char???plz tell
--
You received this message because
Sorry wrng question copiedits a silly question to be asked..sorry guys
On Sun, Oct 7, 2012 at 6:06 PM, rahul sharma rahul23111...@gmail.comwrote:
#includestdio.h
int main()
{
int i;
char ch;
scanf(%c,ch);
printf(%d,ch);
// getchar();
getchar();
}
when i
#includestdio.h
int main(int argc,char *argv[])
{
printf(%d\n,argv[argc]);
getchar();
return 0;
}
what will it print n y??
thnx
rahul
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email
char str[]=ab;
char str1[]={'a','b'};
sizeof(str) ...o/p is 3
sizeof(str1)o/p is 2..
Why so
plz explain...
--
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
...@gmail.comwrote:
For string, C appends '\0' internally. hence sizeof(str) returned the
value 3.
str1 is char array with two character. hence sizeof(str1) returned the
value 2.
-- RK :)
On Sat, Oct 6, 2012 at 5:53 PM, rahul sharma rahul23111...@gmail.comwrote:
char str[]=ab;
char str1[]={'a','b
#includestdio.h
int main()
{
char str[10]={'g','k'};
char str1[10]=gh;
int i;
for(i=0;str1[i]!=NULL;i++)
printf(%c,str[i]);
getchar();
}
NUll is there in character array also...make clear me...
On Sat, Oct 6, 2012 at 9:22 PM, rahul sharma rahul23111...@gmail.comwrote:
int
char ch
ch=i++[s];
printf(%c,ch); this will print i[s],then i is incrementrd after
assigning to ch
ch=++i[s];// this will inccrement value at i[s]
My question is what is role of priority which is making them behaving
differentI am not getting y not first i is incremented then i[s]
:37:04 PM UTC-4, rahul sharma wrote:
Guys i have read that we cant define function in another function in c
Then why this followung program running fine on gcc
#includestdio.h
void abc()
{
printf(bac);
void abf()
{
printf(bas);
getchar
Guys i have read that we cant define function in another function in c
Then why this followung program running fine on gcc
#includestdio.h
void abc()
{
printf(bac);
void abf()
{
printf(bas);
getchar();
}
}
int main()
{
abc();
check this out..
#includeiostream
#includestdlib.h
using namespace std;
void print_sets(string *s,int pos,int n,char *to_print)
{
if(pos==n)
{
return;
}
for(int i=0;is[pos].length();i++)
{
to_print[pos] = s[pos][i];
print_sets(s,pos+1,n,to_print);
check this out..
#includeiostream
#includestdlib.h
using namespace std;
void print_sets(string *s,int pos,int n,char *to_print)
{
if(pos==n)
{
return;
}
for(int i=0;is[pos].length();i++)
{
to_print[pos] = s[pos][i];
print_sets(s,pos+1,n,to_print);
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
did u get it submitted?
--
--
Thanks
Rahul Singh
B.tech CSE ,final Year
IIT Roorkee
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email
.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
--
Thanks
Rahul Singh
B.tech CSE ,final Year
IIT Roorkee
--
You received this message because you are subscribed
@dave sir: i understand your point, here my solution is only limited to
hold the divisor in range of integer..
On Sat, Sep 22, 2012 at 1:41 AM, Dave dave_and_da...@juno.com wrote:
@Rahul: What does this print for n = 193?
Dave
On Friday, September 21, 2012 12:14:18 AM UTC-5, Rahul Kumar
to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*RAHUL KUMAR DUBEY*
*BTech-3rd year *
*Computer Science Engineering *
*Motilal Nehru National Institute Of Technology*
*Allahabad[211004],UP.*
--
You received
group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Thanks and Regards:
Rahul Kumar Patlehttp
)
{
divisor = 10 * divisor + 1;
temp = 10 * temp + 1;
}
printf(%d and %d\n , divisor, temp);
}
printf(%d\n, divisor);
}
On Fri, Sep 21, 2012 at 10:30 AM, Rahul Kumar Patle
patlerahulku...@gmail.com wrote:
@navin: you have to find a number containing all 1's which is divisible
Plz provide me efficeient sol. 4 thisthnx
--
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
http://www.geeksforgeeks.org/archives/19622
Plz tell what is size 4 in this case
--
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
, Sep 15, 2012 at 9:10 PM, Rahul Kumar Patle
patlerahulku...@gmail.com wrote:
A 2D array of order A[N][N] is given, considering entry A[i][i] as
invalid you have to select one element from each row such that
1. Selected elements does not belong to same column.
2. Sum of selected element has
A 2D array of order A[N][N] is given, considering entry A[i][i] as invalid
you have to select one element from each row such that
1. Selected elements does not belong to same column.
2. Sum of selected element has maximal.
--
Thanks and Regards:
Rahul Kumar Patlehttp://www.linkedin.com/profile
http://www.geeksforgeeks.org/archives/14873
Please explain heap method..hw it works..with given i/pthnx
--
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
http://www.geeksforgeeks.org/archives/17235
Please explain me by drawing tree...as i am not able to get this right
suppose we have 12,2,3,0,11,1
so first
start from ryt
1[0] // 1 is root...count is 0
\
11[1] // left subtree is 0 and 0+1=1
now 0
insert on left
1[0] // 1 is
0.50
On Fri, Sep 7, 2012 at 6:05 PM, noname narayan.shiv...@gmail.com wrote:
[image: -]14Answers http://www.careercup.com/question?id=14553727
What is the probability of being the answer correct for this question,
when the answer is chosen randomly:
a. 0.25
b. 0.60
c. 0.25
d. 0.50
Kant *
***Think positive and find fuel in failure*
http://thinkndoawesome.blogspot.com/
*System/Software Engineer*
*Hewlett-Packard India Software Operations.
*
On Tue, Sep 4, 2012 at 1:56 PM, Rahul Kumar Patle
patlerahulku...@gmail.com wrote:
@atul: correctly caught...
here you have
missed this part of bharat post :-
/*
If we don't get the violation for the second time .. means both are
side-by-side elements .. swap them ..
*/
i was saying the same.so it will work.
On 9/4/12, atul anand atul.87fri...@gmail.com wrote:
@rahul : Here are the boundary cases need
.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Thanks and Regards:
Rahul Kumar Patlehttp://www.linkedin.com/profile/view?id=106245716trk=tab_pro
M.Tech, School
..
if it happens for the second time..then mark current element for swapping.
swap both ..
If we don't get the violation for the second time .. means both are
side-by-side elements .. swap them ..
Hope works .. If I miss any case .. correct me
thanks,
On Sun, Sep 2, 2012 at 7:45 PM, Rahul
help to solve the following..
Question: Two of the nodes of a BST are swapped. Correct the BST (taken
from GeekforGeeks http://www.geeksforgeeks.org/archives/23272 2nd online
test 3rd question)
--
Thanks and Regards:
Rahul Kumar Patlehttp://www.linkedin.com/profile/view?id=106245716trk=tab_pro
rajatdubey2...@gmail.comwrote:
@Rahul kumar Dubey
#includestdio.h
double fn(char *a , int b , char c)
{
return (1.1);
}
int main()
{
int it = 2;
char ct = 'c';
char a[30];
printf(%d\n,(sizeof(fn)));
}
why it is always giving output as 1 irrespective of the return type of
function
;
swap((temp1-data), (temp2-data));
swap((temp1-data), (temp3-data));
found = 1;
return;
}
if(!flag)
prev = root;
correctBST(root-right);
}
}
On Sun, Sep 2, 2012 at 4:02 PM, Rahul Kumar Patle
patlerahulku...@gmail.com
explain..
--
Thanks and Regards:
Rahul Kumar Patlehttp://www.linkedin.com/profile/view?id=106245716trk=tab_pro
M.Tech, School of Information Technology
Indian Institute of Technology, Kharagpur-721302,
Indiahttp://www.iitkgp.ac.in/
Mobile No: +91-8798049298, +91-9424738542
Alternate Email
of double on your machine )
On Fri, Aug 31, 2012 at 9:25 PM, Rahul Kumar Patle
patlerahulku...@gmail.com wrote:
#includestdio.h
#includestdbool.h
bool fn(char *a , int b , char c)
{
return true;
}
int main()
{
int it = 2;
char ct = 'c';
char a[30];
printf(%d\n,(sizeof(fn(a , it , ct
i m talking in contest of question, not explaining overall picture of
static in c,c++,java.
On Sep 2, 2012 12:07 AM, Puneet Gautam puneet.nsi...@gmail.com wrote:
@rahul: There is something more to static than to retain old value.
Are u sure it is not used anywhere else for any other purpose
old style C, where you can't have auto array. just that.
On Thu, Aug 30, 2012 at 12:52 PM, Romil ... vamosro...@gmail.comwrote:
It should give an error in the line names[3] = names[4]
These are fixed address values..you cannot change them.
On Thu, Aug 30, 2012 at 12:44 PM, Puneet
Gautam puneet.nsi...@gmail.comwrote:
Well, its gives error in every array assignment..ISO forbids this type of
assignment.
@rahul: But whats with the static here. how does it affect any string
declared..? I couldnt get your answer ..pls explain
On Thu, Aug 30, 2012 at 12:54 PM, rahul rahulr
plz provide me algo for this,thnx
--
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
me if i'm wrong..
On Sat, Aug 25, 2012 at 7:11 PM, rahul sharma rahul23111...@gmail.comwrote:
*Let w(n) and A(n) denote respectively, the worst case and average case
running time of an algorithm executed on an input of size n. which of the
following is ALWAYS TRUE?*
(A) [image: A(n) = \Omega(W
guys can anyone tell me the link from where i can read about the big o ,big
w and big q ...i read from corma but i didnt get theses from that...thnx in
advance
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email
*Let w(n) and A(n) denote respectively, the worst case and average case
running time of an algorithm executed on an input of size n. which of the
following is ALWAYS TRUE?*
(A) [image: A(n) = \Omega(W(n))]
(B) [image: A(n) = \Theta(W(n))]
(C) [image: A(n) = O(W(n))]
(D) [image: A(n) = o(W(n))]
to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*RAHUL KUMAR
initializing a array of pointer with NULL.
On Thu, Aug 9, 2012 at 10:00 AM, Sathish babu satbrucei...@gmail.comwrote:
tree *a[100]={(tree *)0};
Hey guys can any one explain me the above statement...
**~Sathish Babu~**
--
You received this message because you are subscribed to the Google
Mail to me alsothnx
On Thu, Aug 9, 2012 at 2:28 PM, Piyush Khandelwal
piyushkhandelwal...@gmail.com wrote:
Hi !
Google is visiting our campus tomorrow. Anyone having latest written test
paper of google, please mail it...
Thanx in advance!!!
*Piyush Khandelwal** | Placement
64 32
16 32
16 32
64 32
On Fri, Jul 27, 2012 at 6:48 PM, Hraday Sharma hradaysha...@gmail.comwrote:
#includestdio.h
int main(){
printf(%d %d\n, 321, 320);
printf(%d %d\n, 32-1, 32-0);
printf(%d %d\n, 321, 320);
printf(%d %d\n, 32-1, 32-0);
return 0;
--
You
http://www.ocf.berkeley.edu/~wwu/cgi-bin/yabb/YaBB.cgi?board=riddles_cs;action=display;num=1280183627
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
N+=3;
print N!-(N^2-1);
let me know if I am wrong
On Wednesday, 11 July 2012 16:42:38 UTC+5:30, wentworth miller wrote:
hi ..
can anybody tell the Nth term of the following series...
9 96 685 4992.
--
You received this message because you are subscribed to the Google Groups
what is the time complexity for the code ?
#includeiostream
using namespace std;
main()
{
int arr[] = { 2,3,4,9,2,7};
int *ptr1 = arr[0];
int *ptr2 = arr[1];
const int SIZE = sizeof arr / sizeof arr[0];
while(1)
{
if(*ptr1 ==
Guys i am having amazon support engg. test tonyt...90 min 27 questions
mcq...plz tell how to prepare and wats dis profyl???reply asap..and sory
for posting it in algogeeks as i need quick response.waiting for +ve
response soon...
thnx
--
You received this message because you are subscribed
=en.
--
Thanks and Regards:
Rahul Kumar Patle
M.Tech, School of Information Technology
Indian Institute of Technology, Kharagpur-721302, India
Mobile No: +91-8798049298, +91-9424738542
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
yeahu r ryt
On Tue, Jul 10, 2012 at 10:01 AM, Firoz Khursheed
firozkhursh...@gmail.comwrote:
Well, when i compiled the code the output ie i is alway i=2,
http://ideone.com/AFljo
http://ideone.com/87waz
This expression is ambiguous, and compiler dependent.
--
You received this
what about post increment??
On Sun, Jul 8, 2012 at 10:37 PM, mitaksh gupta mitak...@gmail.com wrote:
the o/p will be 2 not 1 because of the post-increment operator.
On Sun, Jul 8, 2012 at 10:23 PM, rahul sharma rahul23111...@gmail.comwrote:
int i=5;
i=++i/i++;
print i;
i=1
how
PM, rahul sharma rahul23111...@gmail.comwrote:
what about post increment??
On Sun, Jul 8, 2012 at 10:37 PM, mitaksh gupta mitak...@gmail.comwrote:
the o/p will be 2 not 1 because of the post-increment operator.
On Sun, Jul 8, 2012 at 10:23 PM, rahul sharma
rahul23111...@gmail.comwrote
int i=5;
i=++i/i++;
print i;
i=1
how?
--
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.
**)malloc( sizeof(int*) * nrows );
int *ar = (int *)malloc( sizeof(int) * nrows * ncols );
for( int a = 0; a nrows; a ++ ) {
arra[a] = ar + ncols * a;
}
now index of array i and j can be accessed as arra[i][j]
On Friday, June 29, 2012 4:46:18 PM UTC+5:30, rahul r
, 2012 at 4:46 PM, rahul r. srivastava
rahul.ranjan...@gmail.com wrote:
implement a 2d matrix using only 2 mallocs.
--
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
i dont knw read it in some paper.. most prob developer.
On Sat, Jun 30, 2012 at 9:56 PM, rahul sharma rahul23111...@gmail.comwrote:
these are asked for which profyl??developer or white box??
On Sat, Jun 30, 2012 at 8:03 PM, Amol Sharma amolsharm...@gmail.comwrote:
@sarthak
oh bhai mere. kewal preorder use karke kaise tree bana dega???
On Fri, Jun 29, 2012 at 11:23 PM, amrit harry dabbcomput...@gmail.comwrote:
@bhaskar ur algo fails on this case (5+3)-(2+(3/6))
-+53+2/36
63/2+35-+
showing that 6/3 but actually it is 3/6
so i think it could be done by
can anyone tell me how to prepare OS subject for placement and interview
which type of question interviewer will ask?
which website will i prefer ?
plzzz tell me ...
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to
@himanshu...i didnt read full question.got it now...
On Mon, Jun 25, 2012 at 9:12 AM, himanshu kansal
himanshukansal...@gmail.com wrote:
@rahul: the ques itself says that we have to implement abstract class*without
* using pure virtual function...
On Sun, Jun 24, 2012 at 12:00 AM
yeah use pure virtual fxn..
On Fri, Jun 22, 2012 at 3:41 PM, himanshu kansal
himanshukansal...@gmail.com wrote:
i told the interviewer...bt he said thn the constt would not be accessible
to derived class alsohe told me dt u shld make the constt.
protecteddats why i ws confused...
yea it s short circuiting
--
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
/group/algogeeks?hl=en.
--
Regards,
Rahul Patil
--
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
int main()
{
int i;
float a=5.2;
char *ptr;
ptr=(char *)a;
for(i=0;i=3;i++)
printf(%d ,*ptr++);
return 0;
}
give me explanation of this code.
--
You received this message
to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Thanks and Regards:
Rahul Kumar Patle
M.Tech, School of Information Technology
Indian Institute of Technology, Kharagpur-721302, India
Mobile No: +91-8798049298
101 - 200 of 822 matches
Mail list logo
