Database System Concepts 5th ed. by Silberschatz, Korth, Sudarshan free download
Friday, April 29, 2011
Saturday, April 23, 2011
Concrete Mathematics by Ronald L. Graham, Donald E. Knuth, Oren Patashnik
Concrete Mathematics by Ronald L. Graham, Donald E. Knuth, Oren Patashnik free download.
or
Monday, April 11, 2011
UVA Problem#11900
Question:
Solution:
1. take all the necessary inputs.
2. let count be the variable of the counter. you have to check so that count<P and count<N,then add the weight and recheck. Pseudo code is given below:
#include<stdio.h>
int main(){
while(T--){
int main(){
while(T--){
.......
.......
for(W=count=0; count<P && count<N;){
if(W+a[count]>Q)
break;
W+=a[count++];
}
printf("Case %d: %d\n", c++, count);
}
return 0;
}
for(W=count=0; count<P && count<N;){
if(W+a[count]>Q)
break;
W+=a[count++];
}
printf("Case %d: %d\n", c++, count);
}
return 0;
}
Wednesday, April 6, 2011
Microsoft Office 2007 Free Download
Download all the 3 parts. and unzip them in one folder. Then continue with the installation process.
click here to download (part 1)
click here to download (part 2)
click here to download (part 3)
click here to download (part 1)
click here to download (part 2)
click here to download (part 3)
Subscribe to:
Posts (Atom)