means if i use like
main()
{
int *ptr;
abc(ptr);
}
abc(int *a)
{
}
this is shallow copy
m i ryt???
if yes thne tell xample of deep shallow..otherwise give me examples
regarding c++cozxamples clear everythng
On Sun, Oct 2, 2011 at 11:00 AM, megha agrawal megha14.2...@gmail.comwrote:
One
which colg??
Sahil Garg
Computer Engineering
Delhi College of Engineering
On Mon, Sep 26, 2011 at 2:04 PM, aditya kumar
aditya.kumar130...@gmail.comwrote:
5.5 lakhs
On Mon, Sep 26, 2011 at 1:46 PM, Aditya Virmani
virmanisadi...@gmail.comwrote:
what package did they offer?
On Mon, Sep
shallow copy
-
class MyString {
char *str;
public:
MyString(char *);
//MyString operator=(const MyString t);
};
MyString :: MyString(char *)
{
}
MyString a(rahul);
MyString b;
b = a;
the default = operator does a bitwise copy, so if we don't overload the
default behaviour,
ignore the prev mail, send button hd got clicked while i was typing .. :P
shallow copy
-
class MyString {
char *str;
public:
MyString(char *);
//MyString operator=(const MyString t);
};
MyString :: MyString(char *s)
{
int len = strlen(s);
str = new char[len
plz tell me hw does fork wokrs???child contain full code ore the
statements after forkhw pid is 0 with pi=fork();
i cant get these..plz tell asap...thnx
On Oct 2, 12:49 pm, rahul sharma rahul23111...@gmail.com wrote:
main()
{
int pid;
pid=fork();
if(pid==0)
{
print child;
*http://www.yolinux.com/TUTORIALS/ForkExecProcesses.html*
*
*
*hope this is helpful
*regards
- Sumit Kumar Pathak
(Sumit/ Pathak/ SKP ...)
*Smile is only good contagious thing.*
*Spread it*!
On Sun, Oct 2, 2011 at 1:20 PM, rahul sharma rahul23111...@gmail.comwrote:
plz tell me hw does
main()
{
int pid;
pid=fork();
if(pid==0)
{
print child;
print(...,getpid());
}
else
{
print print;
print(...,getpid());
}
--
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
child contains full code, bt it will start execution of the next line after
the fork.
return value of fork is 0 for the child, bt pid of the child in the parent
process.
On Sun, Oct 2, 2011 at 3:50 AM, rahul sharma rahul23111...@gmail.comwrote:
plz tell me hw does fork wokrs???child contain
working code :
#includestdio.h
int fib(int n)
{
if(n==1) return 0;
if(n==2) return 1;
return fib(n-1)+fib(n-2);
}
int main()
{
int n,i,sum=0;
printf(enter no of terms\t );
scanf(%d,n);
printf(fibonacci series = \t );
pid=0 for child
then getpid in child???gives child process id???plz xplain
On Sun, Oct 2, 2011 at 1:32 PM, rahul vatsa vatsa.ra...@gmail.com wrote:
child contains full code, bt it will start execution of the next line after
the fork.
return value of fork is 0 for the child, bt pid of the
@rahul tiwari..i have that soln...i think u cnt get questionhw do we knw
the number of terms?/
On Sun, Oct 2, 2011 at 2:09 PM, Rahul Tiwari rahultiwari6...@gmail.comwrote:
working code :
#includestdio.h
int fib(int n)
{
if(n==1) return 0;
if(n==2) return 1;
http://www.geeksforgeeks.org/archives/9705
On Sat, Oct 1, 2011 at 9:54 PM, rahul sharma rahul23111...@gmail.comwrote:
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
wen u do frok in ur code, the pr gets duplicated. so that line wher fork is
invoked is also in both the processes. nw in parent code it will return pid
of child in child code it will return 0.
getpid will always return the pid of the pr. so obviously it will return pid
of the child in the child
How about this answer:
b?z:y
int main() {
int a=0,b,y=4,z=5,k;
cinb;
k=(((b+~a+1)7)1);//k will either be 0 or 1
cout (z-int((bool)k(z-y)));
return 0;
}
On Mon, Sep 12, 2011 at 5:32 PM, beginner shubh2...@gmail.com wrote:
although multiplication operator is not allowed..
in the first loop the value of k shuld vary from 0 to j-i.
On Oct 1, 7:26 am, rahul sharma rahul23111...@gmail.com wrote:
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
yeah u r ryt.
On Sun, Oct 2, 2011 at 4:20 PM, ravi ojha rbojha...@gmail.com wrote:
in the first loop the value of k shuld vary from 0 to j-i.
On Oct 1, 7:26 am, rahul sharma rahul23111...@gmail.com wrote:
You are given two 32-bit numbers, N and M, and two bit positions, i and
j.
can u tell in this we have to set i and j also or only between elements
say if i=2 and j=6
then
whether we should set bit no 2,3,4,5,6,
or 3,4,5
acc. to me its 2,3,4,5,6,
and ur logic also give that answer
plz tell??
On Sun, Oct 2, 2011 at 4:38 PM, rahul sharma
return (((-1+!x)y) | ((-1+!!x)z)) ;
On Sun, Oct 2, 2011 at 3:18 PM, ravi maggon maggonr...@gmail.com wrote:
How about this answer:
b?z:y
int main() {
int a=0,b,y=4,z=5,k;
cinb;
k=(((b+~a+1)7)1);//k will either be 0 or 1
cout (z-int((bool)k(z-y)));
return 0;
}
On
plz post the soln.. i cant find it..
Sahil Garg
Computer Engineering
Delhi College of Engineering
On Tue, Sep 27, 2011 at 3:41 PM, shady sinv...@gmail.com wrote:
discussed, kindly look at archives
On Tue, Sep 27, 2011 at 3:13 PM, surender sanke surend...@gmail.comwrote:
print all numbers
hi all,
i will graduate in 2012/5 as a master, and now i am hunting a job.
last week, i got an oral offer from yahoo global RD center in beijing,
( http://beijing.yahoo.com/en/), the formal offer will arrive at the end of
october. does anyone know something about it? i mean the develop
I cracked amdocs interview...u need to stress on following topics..
*ONLINE TEST*
1)UNIX
Questions on various commands.Important ones are ls,tr,head,tail,tee,gzip
and questions on bash script.
2)SQL
Questions on access levels for diff. users,outer join,inner join,left and
right join,ddl and dml
let arr1[5]={6,7,8,9,10}
arr2[5]={1,2,3,4,8}
your codes gives answer=5
which is not correct...
the correct answer should be=6.5
but since you are returning integer and answer would be=6
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To
hey gaurav bhai
please provide me your phone number..amdocs visiting thapar on 7
oct.
On Sun, Oct 2, 2011 at 7:45 PM, gaurav yadav gauravyadav1...@gmail.comwrote:
I cracked amdocs interview...u need to stress on following topics..
*ONLINE TEST*
1)UNIX
Questions on various
my number= +919939569122
gtalk id=gauravyadav1...@gmail.com
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
1. remove duplicates from array when it is sorted..o(n)tym and o(1)
space..
2. remove duplicates from array when it is not sorted..o(n)tym and o(1)
space..
i can tget these from archives...if anybody earlier asked then plz post me
the link of thtaif not then rovide me with sol of
@rahul sharma
struct a
{ int a;
float b;
char c;
}b;
printf(%d,sizeof(b));
when u declare a struct variable (b in this case)...4 bytes are used for int
a,4 for float b and similarly 4 bytes for char c(though only 1 byte is
actually used).
but now look at following code..
1.
int rmvDup(int arr[],int arrLen)
{
int i,j;
for (i =1,j=0; i arrLen;i++)
{
if (arr[j] != arr[i])
{
arr[j+1] = arr[i];
j = j+1;
}
}
return j+1;
}
This function assumes that the
there were 10 objective questions covering c,c++ and ds
questions were on mainly memory allocation
stack and heap ,etc
output/error ;
subjective part
1. compress the given string
eg. aaabbcccaadee
o/p = a3b2c3de2
2. u have to give the various test case and fault cases for a USB
device
such
25 objective questions
focused on operatig system
basic commands of linux
aptitude - 4-5 questions
rest on algos, ds, c nd c++
3 subjective questions
1) merge two sorted link list
2) u have given coins of vrious denominations and u have to make a sum
with min. no. of coins
3) an amazon own alogo
hey sachin: amdocs is coming for job at wich location??
On Oct 2, 8:55 pm, gaurav yadav gauravyadav1...@gmail.com wrote:
my number= +919939569122
gtalk id=gauravyadav1...@gmail.com
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to
what is 'print'?
there's no such thing in C.
On Sun, Oct 2, 2011 at 4:49 AM, rahul sharma rahul23111...@gmail.com wrote:
main()
{
int pid;
pid=fork();
if(pid==0)
{
print child;
print(...,getpid());
}
else
{
print print;
print(...,getpid());
}
--
You received this message because
hey from which college r u???
On Sun, Oct 2, 2011 at 10:51 PM, gaurav kumar mailmea...@gmail.com wrote:
there were 10 objective questions covering c,c++ and ds
questions were on mainly memory allocation
stack and heap ,etc
output/error ;
subjective part
1. compress the given string
eg.
just given a basic psudocode
On Sun, Oct 2, 2011 at 11:11 PM, Hatta tmd...@gmail.com wrote:
what is 'print'?
there's no such thing in C.
On Sun, Oct 2, 2011 at 4:49 AM, rahul sharma rahul23111...@gmail.com
wrote:
main()
{
int pid;
pid=fork();
if(pid==0)
{
print child;
pec, unversity of technology
chandigarh
On Oct 2, 10:46 pm, rahul sharma rahul23111...@gmail.com wrote:
hey from which college r u???
On Sun, Oct 2, 2011 at 10:51 PM, gaurav kumar mailmea...@gmail.com wrote:
there were 10 objective questions covering c,c++ and ds
questions were on
u r a 3rd year studentfor placement test is different???
On Sun, Oct 2, 2011 at 11:19 PM, gaurav kumar mailmea...@gmail.com wrote:
pec, unversity of technology
chandigarh
On Oct 2, 10:46 pm, rahul sharma rahul23111...@gmail.com wrote:
hey from which college r u???
On
hello moderators n owners of this group.
I have made a new id in gmail for my exclusive study on algogeeks. I sent a
request for adding me but it got rejected.
Can you please let me get added on this group by that id also , it is
anika.jain...@gmail.com. If you want after getting permission on
Design a logic to implement doubly linked list with only one pointer
--
Cheers,
Vicky
--
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
xor linked list.
On Sun, Oct 2, 2011 at 11:32 PM, ~*~VICKY~*~ venkat.jun...@gmail.comwrote:
Design a logic to implement doubly linked list with only one pointer
--
Cheers,
Vicky
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
ya, it was rejected because you were already subscribed
i will add you in this one... kindly unsubscribe from the other one.
On Sun, Oct 2, 2011 at 11:25 PM, Anika Jain anika.jai...@gmail.com wrote:
hello moderators n owners of this group.
I have made a new id in gmail for my exclusive
@rahul : can u give any related links plz
On Sun, Oct 2, 2011 at 11:33 PM, rahul sharma rahul23111...@gmail.comwrote:
xor linked list.
On Sun, Oct 2, 2011 at 11:32 PM, ~*~VICKY~*~ venkat.jun...@gmail.comwrote:
Design a logic to implement doubly linked list with only one pointer
--
http://www.geeksforgeeks.org/archives/12367
On Sun, Oct 2, 2011 at 11:34 PM, ~*~VICKY~*~ venkat.jun...@gmail.comwrote:
@rahul : can u give any related links plz
On Sun, Oct 2, 2011 at 11:33 PM, rahul sharma rahul23111...@gmail.comwrote:
xor linked list.
On Sun, Oct 2, 2011 at 11:32
package is 6lpa
On Sep 28, 1:14 pm, sukran dhawan sukrandha...@gmail.com wrote:
wats the package ?
On Tue, Sep 27, 2011 at 9:08 PM, Nitin coolguyinat...@gmail.com wrote:
C questions there are 12 -13 questions given on internet it will be same as
it is given in the paper ,i dnt find a
hope u were asking about dat...
On Sun, Oct 2, 2011 at 11:36 PM, rahul sharma rahul23111...@gmail.comwrote:
http://www.geeksforgeeks.org/archives/12367
On Sun, Oct 2, 2011 at 11:34 PM, ~*~VICKY~*~ venkat.jun...@gmail.comwrote:
@rahul : can u give any related links plz
On Sun, Oct 2,
ya thanks a lot rahul !
On Sun, Oct 2, 2011 at 11:39 PM, rahul sharma rahul23111...@gmail.comwrote:
hope u were asking about dat...
On Sun, Oct 2, 2011 at 11:36 PM, rahul sharma rahul23111...@gmail.comwrote:
http://www.geeksforgeeks.org/archives/12367
On Sun, Oct 2, 2011 at 11:34 PM,
xor linked list
http://www.geeksforgeeks.org/archives/12367
On Sun, Oct 2, 2011 at 11:33 PM, rahul sharma rahul23111...@gmail.comwrote:
xor linked list.
On Sun, Oct 2, 2011 at 11:32 PM, ~*~VICKY~*~ venkat.jun...@gmail.comwrote:
Design a logic to implement doubly linked list with only
h anika.amdocs in coming to thapar on 7 oct.
On Sun, Oct 2, 2011 at 11:01 PM, Anika Jain anika.jai...@gmail.com wrote:
hey sachin: amdocs is coming for job at wich location??
On Oct 2, 8:55 pm, gaurav yadav gauravyadav1...@gmail.com wrote:
my number= +919939569122
gtalk
for a N * M matrix is is possible to print zigzag fashion of that matrix?
For example:
1 2 3 4 5
6 7 8 9 10
11 12 13 14 15
i want print like
1
6 2
11 7 3
12 8 4
13 9 5
14 10
15
I am able to get this where N !=M..
How can i do this, ??
--
You received this message because you are
hiii... ok i meant job offer is for Pune or NCR area ??if u knw..
On Oct 2, 11:29 pm, sachin goyal monugoya...@gmail.com wrote:
h anika.amdocs in coming to thapar on 7 oct.
On Sun, Oct 2, 2011 at 11:01 PM, Anika Jain anika.jai...@gmail.com wrote:
hey sachin: amdocs is
they provide first one year job in puneif your profile is testing then
it may be at gurgaon
On Mon, Oct 3, 2011 at 12:13 AM, Anika Jain anika.jai...@gmail.com wrote:
hiii... ok i meant job offer is for Pune or NCR area ??if u knw..
On Oct 2, 11:29 pm, sachin goyal
only possible for continuous disctees attributes.
--
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
if element is 0 in matrix then entire row and column should be set to 0
i got this from sumwhr
void makeRowColZero(int (*a)[COL])
{
int i, j, k;
k = 0;
for(i = 0; i ROW; i++)
for(j = k; j COL; j++)
{
if(0 ==
Define a data structure , using extra memory/space , such that :
Insert(int a)
Delete(int a)
isPresent(int a)
get(int a)
All above operations on the defined data structure take O(1) , i.e. constant
time.
--
You received this message because you are subscribed to the Google Groups
nput is a matrix of size n x m of 0s and 1s.
eg:
1 0 0 1
0 0 1 0
0 0 0 0
If a location has 1; make all the elements of that row and column = 1. eg
1 1 1 1
1 1 1 1
1 0 1 1
Solution should be with Time complexity = O(n*m) and O(1) extra space
--
You received this message because you are
you can implement using hashmap..
On Mon, Oct 3, 2011 at 12:51 AM, Ankur Garg ankurga...@gmail.com wrote:
Define a data structure , using extra memory/space , such that :
Insert(int a)
Delete(int a)
isPresent(int a)
get(int a)
All above operations on the defined data structure
Can u provide a proper HashMap
Not Implementation..A proper Idea wud do :)
On Mon, Oct 3, 2011 at 1:03 AM, Preetam Purbia preetam.pur...@gmail.comwrote:
you can implement using hashmap..
On Mon, Oct 3, 2011 at 12:51 AM, Ankur Garg ankurga...@gmail.com wrote:
Define a data structure , using
See you are actually passing the address of 'rest' each time, so the
changes made to *head_ref are actually reflected in the value at the
address of 'rest' each time the recursive call returns, so the value
of 'rest' is carried backwards to the front once we start popping from
the tail of the
in which clg???
when is coming?
On 2 October 2011 23:39, Anika Jain anika.jai...@gmail.com wrote:
package is 6lpa
On Sep 28, 1:14 pm, sukran dhawan sukrandha...@gmail.com wrote:
wats the package ?
On Tue, Sep 27, 2011 at 9:08 PM, Nitin coolguyinat...@gmail.com wrote:
@ Digo ..i got almost wat u said...can u give me a example with 3-4
nodes...it will help me a lot..thnx..
On Mon, Oct 3, 2011 at 1:43 AM, Digo dipitgro...@gmail.com wrote:
See you are actually passing the address of 'rest' each time, so the
changes made to *head_ref are actually reflected in
got it...thnx a lot buddy,,,
On Mon, Oct 3, 2011 at 7:20 AM, rahul sharma rahul23111...@gmail.comwrote:
@ Digo ..i got almost wat u said...can u give me a example with 3-4
nodes...it will help me a lot..thnx..
On Mon, Oct 3, 2011 at 1:43 AM, Digo dipitgro...@gmail.com wrote:
See you are
Write a routine that takes input as a string such as
aabbccdef and o/p a2b2c2def
or
a4bd2g4 for bdd
if i want to make a general program for this..cani do by checking
the 2nd array item if it is a number then i will call a fxn
expandelse i will call
guys if i have
Print the sum of the even terms occuring in Fibbonaci (till 1000 terms)
then i will go for(i=0;i=1000;i++)
{
fibonicii code
add if even
}
for 1000 fib terms
if i have Print the sum of the even terms occuring in Fibbonaci (till 1000)
it indicates that we will stop when we
find the sum of all even nos. in the fibbonacci series upto 100
it means upto when my term in fibonici is 100 stop...???ok?
On Mon, Oct 3, 2011 at 8:06 AM, rahul sharma rahul23111...@gmail.comwrote:
guys if i have
Print the sum of the even terms occuring in Fibbonaci (till 1000 terms)
@rahul if u have to find first 100 even fibonacci term sum
the u have to simply find the t2n+1 term -1
--
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
@Rahul
Parse the string and check the next element of the array if it is exactly
the previous one then *increase the counter by 1* else no need to increase
the counter.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this
linked list + hash table. check for similar question poster on last friday ..
On 10/3/11, Ankur Garg ankurga...@gmail.com wrote:
Can u provide a proper HashMap
Not Implementation..A proper Idea wud do :)
On Mon, Oct 3, 2011 at 1:03 AM, Preetam Purbia
preetam.pur...@gmail.comwrote:
you can
@rahul verma
yeah i know supposes i m doing for
a3b3c3..
o/p :- aaabbbccc
if i give i/p: abc to same program
then should it accept n display then errorrcoz abc not accepted...a1b1c1
is aceeptedor it will show abc as such..
tell me wat to do for abc
On Mon, Oct 3, 2011 at
66 matches
Mail list logo
