explain how is it 3?
On Jun 26, 11:18 pm, D.N.Vishwakarma@IITR deok...@gmail.com
wrote:
3 mice .
On Sun, Jun 26, 2011 at 6:13 PM, ArPiT BhAtNaGaR
arpitbhatnagarm...@gmail.com wrote:
3
On Mon, Jun 27, 2011 at 2:10 AM, amit the cool
amitthecoo...@gmail.comwrote
In windows you can choose codeblocks or best is use linux gnu compiler
On Wed, Jun 15, 2011 at 8:50 PM, shashankreddy509
shashankreddy...@gmail.com wrote:
can any one tell the best compiler for c and c++...
Thanks,
G. Shashank Reddy
--
You received this message because you are
thanx in advance
--
**With Regards
Deoki Nandan Vishwakarma
IITR MCA
*
*
--
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
to be thankful for !!
*
On Thu, Jun 9, 2011 at 8:57 AM, D.N.Vishwakarma@IITR deok...@gmail.comwrote:
we have to find solution in O(nlgn)
On Thu, Jun 9, 2011 at 8:22 AM, D.N.Vishwakarma
thanx a lot Now it is working for all cases..
On Thu, Jun 9, 2011 at 11:28 AM, varun pahwa varunpahwa2...@gmail.comwrote:
may be now it works for all. please correct me if i am wrong.you haven't
put termination in binary search.
#includeiostream
using namespace std;
void merge(int
Inversion means pair(i,j) such that ij and A[i]A[j]
--
**With Regards
Deoki Nandan Vishwakarma
IITR MCA
*
*
--
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
, 2011 at 4:05 PM, D.N.Vishwakarma@IITR deok...@gmail.comwrote:
Inversion means pair(i,j) such that ij and A[i]A[j]
--
**With Regards
Deoki Nandan Vishwakarma
IITR MCA
*
*
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
how insertion sort will do in O(nlogn)?
On Thu, Jun 9, 2011 at 4:27 PM, Navneet Gupta navneetn...@gmail.com wrote:
Insertion sort also would do.
On Thu, Jun 9, 2011 at 4:22 PM, D.N.Vishwakarma@IITR deok...@gmail.com
wrote:
thanx for suggestion
On Thu, Jun 9, 2011 at 4:08 PM, sunny
thanx in advance
--
**With Regards
Deoki Nandan Vishwakarma
IITR MCA
*
*
--
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
we have to find solution in O(nlgn)
On Thu, Jun 9, 2011 at 8:22 AM, D.N.Vishwakarma@IITR deok...@gmail.comwrote:
thanx in advance
--
**With Regards
Deoki Nandan Vishwakarma
IITR MCA
*
*
--
**With Regards
Deoki Nandan Vishwakarma
IITR MCA
*
*
--
You received this message because
#includeiostream
using namespace std;
void merge(int A[],int p,int q,int r)
{
int n1=q-p+1;int n2=r-q;
int L[n1];
int R[n2];
for(int i=0;in1;i++)
L[i]=A[p+i];
for(int j=0;jn2;j++)
R[j]=A[q+j+1];
int i=0,j=0,k;
for(k=p;kr;k++)
{
if((L[i]=R[j])in1)
{A[k]=L[i];i++;}
else
{A[k]=R[j];j++;}
}
we have to find in O(nlgn)
On Thu, Jun 9, 2011 at 10:55 AM, D.N.Vishwakarma@IITR deok...@gmail.comwrote:
#includeiostream
using namespace std;
void merge(int A[],int p,int q,int r)
{
int n1=q-p+1;int n2=r-q;
int L[n1];
int R[n2];
for(int i=0;in1;i++)
L[i]=A[p+i];
for(int j=0;jn2;j
link to tenenbaum os solutions
http://www.ebah.com.br/content/ABGlsAA/tanenbaum-modern-operating-systems-2ed-solution
On Wed, Jun 8, 2011 at 10:56 AM, Rahul Singhal nitk.ra...@gmail.com wrote:
Dear All,
If you have any ebook mentioned above, please share them.
Thanks
--
Rahul singhal
say memory location is 0x33f070 of int *x=new int(p);
p is some value at that location. we have to find p at that location using
some indirect way...
without using cout(void*x); Is there any other way to find p?
--
**With Regards
Deoki Nandan Vishwakarma
IITR MCA
Mathematics Department*
*
--
are you trying
to do?
Looks like you want to allocate space for an integer value and assign
the value p to it.
So, you need to refer it with some pointer (in this case x).
On Jun 4, 2:24 pm, D.N.Vishwakarma@IITR deok...@gmail.com wrote:
say memory location is 0x33f070 of int *x=new int(p
f is NOT 1.0
On Thu, Jun 2, 2011 at 8:35 PM, Balaji S balaji.ceg...@gmail.com wrote:
#include stdio.h
int main()
{
float f=0.0f;
int i;
for(i=0;i10;i++)
f = f + 0.1f;
if(f == 1.0f)
printf(f is 1.0 \n);
else
better than O(n2) algo
--
**With Regards
Deoki Nandan Vishwakarma
IITR MCA
Mathematics Department*
*
--
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
@Sanjay ahuja
yes ans is required in O(n)
how it can be done by hashing?
On Fri, Jun 3, 2011 at 1:19 AM, Supraja Jayakumar
suprajasank...@gmail.comwrote:
Hi
I think multi hash table will solve this problem.
Thanks
Supraja J
On Thu, Jun 2, 2011 at 1:37 PM, Harshal hc4...@gmail.com wrote:
and make hash on key. But this will not be one
pass.
On Fri, Jun 3, 2011 at 7:31 AM, D.N.Vishwakarma@IITR deok...@gmail.com
wrote:
@Sanjay ahuja
yes ans is required in O(n)
how it can be done by hashing?
On Fri, Jun 3, 2011 at 1:19 AM, Supraja Jayakumar
suprajasank...@gmail.com
wrote
There are two n length array A[1...n] ,B[1...n] in which n-bit binary
integers are stored... We have to sum these two integers and store it in n+1
length array C[1...n+1] in binary form
--
**With Regards
Deoki Nandan Vishwakarma
IITR MCA
Mathematics Department*
*
--
You received this message
:36 AM, D.N.Vishwakarma@IITR
deok...@gmail.comwrote:
without default constructor what will be solution
On Wed, May 25, 2011 at 10:56 AM, Aakash Johari
aakashj@gmail.comwrote:
This way you can do:
#include iostream
using namespace std;
class A {
public
/Initializeanarrayofobjectswithoutreferencingtheconstructordirectly.htm
Thanks,
Immanuel
On Wed, May 25, 2011 at 7:34 AM, D.N.Vishwakarma@IITR
deok...@gmail.comwrote:
There is a class A which contains just one parameterized constructor
A(int a). How would you initialize an array of objects of this class
There is a class A which contains just one parameterized constructor
A(int a). How would you initialize an array of objects of this class.
--
**With Regards
Deoki Nandan Vishwakarma
IITR MCA
Mathematics Department*
*
--
You received this message because you are subscribed to the Google Groups
No Its not an assignment
On Thu, Apr 28, 2011 at 6:40 PM, Umer Farooq the.um...@gmail.com wrote:
This is an assignment. Ryt? :P
On Thu, Apr 28, 2011 at 1:31 PM, D.N.Vishwakarma@IITR
deok...@gmail.comwrote:
*
*
*Just give some time to these problems and solve it. Its sort
*
*
*Just give some time to these problems and solve it. Its sort of Urgent.And
Let me know the Solution.
*
1. Write an algorithm to implement a stack using a two dimensional
array.
2. Write an algorithm to store elements of a two-dimensional array in a
simple stack.
3. You
Thanks in advance
--
**With Regards
Deoki Nandan Vishwakarma
IITR MCA
Mathematics Department*
*
--
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,
please mail me too
On Mon, Apr 25, 2011 at 8:02 AM, DIPANKAR DUTTA
dutta.dipanka...@gmail.comwrote:
can Any one have the link of the following book:
Cracking the IT interview: jump start your career with confidence By M
Balasubramaniam
--
Thanks and Regards,
*
*
--
**With Regards
Deoki Nandan Vishwakarma
IITR MCA
Mathematics Department*
*
--
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
No It is not a fake link wait for 5 seconds then pree skip ad button then
you will be directed to actual site
On Mon, Apr 25, 2011 at 3:13 PM, KK kunalkapadi...@gmail.com wrote:
Hey it seems to be a fake link... It directs to some site which
shorten URLs
--
You received this message because
Thanks in advance
--
**With Regards
Deoki Nandan Vishwakarma
IITR MCA
Mathematics Department*
*
--
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,
@KK I have shared a link of sartaj sahni ebook wth you
On Sun, Apr 24, 2011 at 4:06 PM, KK kunalkapadi...@gmail.com wrote:
@ Carl Barton:
I also know that site... i want a shared link u stupid...
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks
I have shared this book with algo geek group please check in group
On Sun, Apr 24, 2011 at 6:52 PM, hary rathor harry.rat...@gmail.com wrote:
send link to me also
harry.rat...@gmail.com
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To
*http://adf.ly/1Jcs4
*
--
**With Regards
Deoki Nandan Vishwakarma
IITR MCA
Mathematics Department*
*
--
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
http://adf.ly/1JcvH
--
**With Regards
Deoki Nandan Vishwakarma
IITR MCA
Mathematics Department*
*
--
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
http://adf.ly/1JcyN
--
**With Regards
Deoki Nandan Vishwakarma
IITR MCA
Mathematics Department*
*
--
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
*Book can't be send to group as it is more than 4.0 mb . and group can't
have massage more than 4.0 mb
*
On Sat, Apr 23, 2011 at 7:01 PM, UMESH KUMAR kumar.umesh...@gmail.comwrote:
hi.
Do you have anybody C++ by Stroustrup
e-book please send on group.
Thanks and Regards
Umesh kumar
--
No I don't but I can give link of my gmail documents where I have uploaded
that book
On Sat, Apr 23, 2011 at 7:31 PM, UMESH KUMAR kumar.umesh...@gmail.comwrote:
If you know link for that book please send for direct Download
On Sat, Apr 23, 2011 at 6:57 AM, D.N.Vishwakarma@IITR
deok
subhransu.panigr...@gmail.comwrote:
Could you please mail me the URL/PDF of this. the above link seems not
working for me
*Subhransu Panigrahi
*
*Mobile:* *+91-9840931538*
*Email:* subhransu.panigr...@gmail.com
On Wed, Apr 20, 2011 at 7:22 AM, D.N.Vishwakarma@IITR
deok...@gmail.comwrote:
*I've
*
*
--
**With Regards
Deoki Nandan Vishwakarma
IITR MCA
Mathematics Department*
*
--
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
www.etwist.net
On Fri, Apr 22, 2011 at 12:53 AM, KK kunalkapadi...@gmail.com wrote:
Hello people please share sites from where good programming ebooks can
be downloaded...
i use library.nu and 4shared.com
--
You received this message because you are subscribed to the Google Groups
1.Mastering Java 2
2. Java 2 by Ivor Horton
--
**With Regards
Deoki Nandan Vishwakarma
IITR MCA
Mathematics Department*
*
--
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
Cracking the Coding Interview by *Gayle
Laakmannhttp://pothi.com/pothi/search/google?cx=014194668748364006794:ovhp_xhwczgcof=FORID:11query=Gayle%20Laakmannop=Searchform_id=google_cse_searchbox_form
*
--
**With Regards
Deoki Nandan Vishwakarma
IITR MCA
Mathematics Department*
*
--
You
*I've already got But thanks for your link
*
On Wed, Apr 20, 2011 at 5:32 AM, DIPANKAR DUTTA
dutta.dipanka...@gmail.comwrote:
plz chk the folowing link..
www.*mediafire*.com/?692caj1v154c5kc
On Tue, Apr 19, 2011 at 11:05 PM, D.N.Vishwakarma@IITR
deok...@gmail.comwrote:
Cracking
*
I'll if I could.
*
On Thu, Apr 14, 2011 at 1:24 PM, ArPiT BhAtNaGaR
arpitbhatnagarm...@gmail.com wrote:
kick him plzzz
On Thu, Apr 14, 2011 at 11:44 AM, taocp mojiedash...@gmail.com wrote:
Plz ban him.
2011/4/14 ramya raman ramyaraman9...@gmail.com
hot
3 1 2 2 1 1
1 3 1 1 2 2 2 1
On Thu, Apr 14, 2011 at 10:24 PM, arpit.gupta arpitg1...@gmail.com wrote:
3 1 2 2 1 1
1 3 1 1 2 2 2 1
On Apr 13, 12:32 pm, Lavesh Rawat lavesh.ra...@gmail.com wrote:
* Sequence Puzzle
The below is a number puzzle. It should be read left to right, top to
*122 it's so simple
*
On Tue, Mar 29, 2011 at 1:15 PM, Arpit Sood soodfi...@gmail.com wrote:
122
On Tue, Mar 29, 2011 at 1:05 PM, Lavesh Rawat lavesh.ra...@gmail.comwrote:
*Series Problem Solution*
1, 2, 5, 14, 41, x
Whats x ??
Update Your Answers at : Click
at 11:37 AM, himanshu kansal
himanshukansal...@gmail.com wrote:
can u gv any link for reference...???
On Sat, Mar 26, 2011 at 12:29 PM, D.N.Vishwakarma@IITR
deok...@gmail.com
wrote:
there is vtable known as virtual table which contains addresses of
virtual
functions
*what is bf code??
*
On Sun, Mar 27, 2011 at 4:45 PM, saurabh singh saurab...@gmail.com wrote:
Write a program that reads a file and convert it to an equivalent bf
code.(That is the on execution the bf code should yield the content of
file).Several approaches are possible,but try to develop it
*there is vtable known as virtual table which contains addresses of virtual
functions .
And there is vptr a pointer that points to vtable of that class space
occupied by class having virtual function wil be equal to space occupied by
a pointer * number of virtual functions ..
I think this if there
*@ Saurabh Singh gcc doesn't give it as error but turbo gives it as error
...
As per ANSI C there is no error becoz n is already known before use...
*
On Sun, Mar 27, 2011 at 8:44 AM, saurabh singh saurab...@gmail.com wrote:
The array allocation in c should be done at compile time.since its
On Tue, Mar 22, 2011 at 11:14 AM, D.N.Vishwakarma@IITR
deok...@gmail.com wrote:
--
*With Regards
Deoki Nandan Vishwakarma
IITR MCA
Mathematics Department
*
--
You received this message because you are subscribed to the Google
Groups Algorithm Geeks group.
To post to this group, send
--
*With Regards
Deoki Nandan Vishwakarma
IITR MCA
Mathematics Department
*
--
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;
int main()
{
arr a[100];
}
On Wed, Mar 16, 2011 at 9:47 PM, kumar anurag
anurag.it.jo...@gmail.com wrote:
using two different functions calling one another ?
like
fun1()
{
fun2()
}
fun2()
{
fun1();
}
On Wed, Mar 16, 2011 at 9:39 PM, D.N.Vishwakarma@IITR
deok
*
*
--
*With Regards
Deoki Nandan Vishwakarma
IITR MCA
Mathematics Department
*
--
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
*this code is perfectly working . use gcc based compiler
*
On Thu, Mar 3, 2011 at 11:34 PM, Vishnutej
mylavarapu.vishnu...@gmail.comwrote:
I dunno y dis code isnt working.
#includeiostream
#includelimits
using namespace std;
int main()
{
coutnumeric_limitslong double::infinity();
}
*which compiler you r using?
*
On Fri, Mar 4, 2011 at 12:15 AM, Vishnutej Mylavarapu
mylavarapu.vishnu...@gmail.com wrote:
When I submit..Im getting a WA
On Thu, Mar 3, 2011 at 11:55 PM, D.N.Vishwakarma@IITR
deok...@gmail.comwrote:
*this code is perfectly working . use gcc based compiler
*Send some really hot photos link or videos link
These r just normal... okay ..
otherwise
*
On Tue, Feb 22, 2011 at 7:46 PM, SUNITHA BUSETTY
sunitha.buse...@gmail.comwrote:
SEXY DIYA MIRZA
http://karomasti9.blogspot.com/2010/12/diya-mirza.html
*What type of this algorithm ?
Dynamic programming or heuristic approach?
*
On Mon, Feb 21, 2011 at 10:41 PM, SUNITHA BUSETTY sunitha.buse...@gmail.com
wrote:
```ONLY HOT VIDEOS FOR YOUTH
HOT VIDEOS
http://sexy-rainsongs.blogspot.com/
58 matches
Mail list logo
