Lab
5 Solutions, ESC101, 2004-2005 Semester-II
1.
class fibonacci{
public static void
main(String args[]){
int n=5;
int v1=1, v2=1, tmp, i;
for(i=0; i<n; i++){
if((i == 0) || (i==1)){
System.out.println("1 ");
continue;
}
tmp = v1 + v2;
v1 = v2;
v2 = tmp;
System.out.println(tmp + " ");
}
}
}
2.
class factoring{
static void factors(int n)
{
boolean isPrime;
while(n > 0){
isPrime = true;
for(int i=2; i<n; i++){
if((n%i) == 0){
System.out.println(i);
n = n/i;
isPrime = false;
break;
}
}
if(isPrime){
System.out.println(n);
break;
}
}
}
public static void
main(String args[]){
int n=150;
factors(n);
}
}
3.
class num_occurrences{
public static void
main(String args[]){
String s1="bcabcbcdbc", s2="bc";
int tmp=-1, cnt=0;
do{
tmp = s1.indexOf(s2, tmp+1);
if(tmp != -1)
cnt++;
}while(tmp != -1);
System.out.println(cnt);
}
}
4.
class print_parts{
public static void
main(String args[]){
String s="abcdefghijkl";
int len,i;
for(i=0; i<(s.length() / 3); i++)
System.out.println(s.substring(i*3, i*3 + 3));
System.out.println(s.substring(i*3, s.length()));
}
}