Finalpaperspastpf
Finalpaperspastpf
package pastpapers;
import java.util.Scanner;
int num=input.nextInt();
int count=0;
for(int i=1;i<num;i++){
if(num%i==0){
count=count+i;
if(count==num){
}else{
}
Qno 2 find number is substring or not
import java.util.Scanner;
// Check if the second string is a substring of the first string using contains method
if (isSubstring) {
} else {
}
// Close the scanner
scanner.close();
Palindrome
package pastpapers;
import java.util.Scanner;
System.out.println("enter a word");
String character=input.next();
boolean palindrom=true;
for(int i=0;i<=character.length()/2;i++){
palindrom=false;
break;
if(palindrom){
else{
}
import java.util.Scanner;
int largest=0;
int seclargest=0;
int thirdlar=0;
while(true){
System.out.println("enter 0 to leave");
System.out.println("enter a word");
int word=input.nextInt();
if(word==0){
break;
else if(word>largest){
thirdlar=seclargest;
seclargest=largest;
largest=word;
thirdlar=seclargest;
seclargest=word;
thirdlar=word;
}
Password
package pastpapers;
import java.util.Scanner;
while (true) {
System.out.println("Enter a password:");
if (isValidPassword(password)) {
System.out.println("Valid password!");
} else {
scanner.close();
if (password.length() < 8) {
return false;
}
if (Character.isUpperCase(c)) {
hasUppercase = true;
if (Character.isDigit(c)) {
hasDigit = true;
// Return true only if the password has at least one uppercase letter and one digit
}
package pastpapers;
import java.util.Scanner;
int x = scanner.nextInt();
int N = scanner.nextInt();
// Verify input values are positive
if (x <= 0 || N <= 0) {
return;
scanner.close();
double sum = 0;
return sum;
int result = 1;
result *= i;
}
return result;
lastGuess = nextGuess;
return nextGuess;
}
package pastpapers;
import java.util.Scanner;
// Constants for the number of cookies per box and boxes per container
scanner.close();
}
package pastpapers;
import java.io.*;
import java.util.*;
for(int i=3;i<=1000-2;i++){
boolean isprime=false;
for(int i=2;i<x/2;i++){
if(x%i==0){
return false;
return true;
}
package pastpapers;
//import java.io.*;
import java.util.*;
int choice=input.nextInt();
switch(choice){
case 1:
int length=input.nextInt();
System.out.println("enter width");
int width=input.nextInt();
int area=findarea(length,width);
break;
case 2:
double radius=input.nextDouble();
double circlearea=findarea(radius);
System.out.println("area of circle is "+circlearea);
break;
return x*l;
double result=3.14*k*k;
return result;
}
package pastpapers;
//import java.io.*;
import java.util.*;
double sum=0.0;
for(int i=1;i<=624;i++){
sum= sum+1/(Math.sqrt(i)+Math.sqrt(i+1));
}
package pastpapers;
import java.io.*;
import java.util.*;
import java.util.Random;
try {
int x = input.nextInt();
array[i] = random.nextInt(100);
}
writer.close();
} catch (IOException e) {
e.printStackTrace();
} finally {
/////
package past;
import java.io.*;
import java.util.*;
try {
String line;
int count=0;
int maximum=0;
int secondma=0;
while((line=reader.readLine())!=null){
String[]parts=line.split(" ");
count=count+parts.length;
for(int i=0;i<count;i++){
int num=Integer.parseInt(parts[i]);
if(num>maximum){
secondma=maximum;
maximum=num;
secondma = num;
reader.close();
} catch (IOException e) {
e.printStackTrace();
} finally {
}
package stringvowel;
import java.util.Scanner;
System.out.println("enter a sentence");
String sentence=input.nextLine();
int length=sentence.length();
System.out.println(length);
int vowels=vowels(sentence);
int consonant=consonant(sentence);
int count=0;
for(int i=0;i<sentence.length();i++){
if(sentence.charAt(i)==' '){
continue;
}
else if(sentence.charAt(i)=='a'|| sentence.charAt(i)=='e' || sentence.charAt(i)=='i'||
sentence.charAt(i)=='o' || sentence.charAt(i)=='u' ){
count++;
return count;
int count=0;
for(int i=0;i<sentence.length();i++){
count++;
return count;
}
package pkg2darrays;
import java.util.Scanner;
int[][]array=new int[5][5];
for(int i=0;i<5;i++){
for(int j=0;j<5;j++){
array[i][j]=input.nextInt();
System.out.println("result summary");
studentresult(array);
subjectstac(array);
printResult(array);
int sum=0;
for(int j=0;j<5;j++){
sum=sum+array1[i][j];
System.out.println();
System.out.println();
}
package javaapplication308;
import java.util.Scanner;
import java.util.Random;
int rows=input.nextInt();
int[][]raggedArray=new int[rows][];
for(int i=0;i<rows;i++){
int cols=random.nextInt(5)+1;
raggedArray[i]=new int[cols];
for(int j=0;j<cols;j++){
raggedArray[i][j]=random.nextInt(100);
System.out.println("Ragged Array:");
}
System.out.println();
if (raggedArray[i][j] == target) {
found = true;
if (!found) {
input.close();
}
;ll
package arraylistmerge;
import java.util.Scanner;
System.out.println("list 3 is");
for(int i=0;i<10;i++){
if(i%2==0){
list3[i] = list2[i];
} else {
list3[i] = list1[i];
return list3;
package n;
import java.util.Scanner;
public class N {
System.out.println("Enter 0 to exit");
while (true) {
input.nextLine();
if (choice == 0) {
System.out.println("Exiting...");
break;
} else {
switch (choice) {
case 1:
System.out.println("Enter x1:");
double x1 = input.nextDouble();
input.nextLine();
System.out.println("Enter y1:");
double y1 = input.nextDouble();
input.nextLine();
System.out.println("Enter x2:");
double x2 = input.nextDouble();
input.nextLine();
System.out.println("Enter y2:");
double y2 = input.nextDouble();
input.nextLine();
break;
case 2:
System.out.println("Enter x1:");
input.nextLine();
System.out.println("Enter y1:");
input.nextLine();
System.out.println("Enter z1:");
input.nextLine();
System.out.println("Enter x2:");
input.nextLine();
System.out.println("Enter y2:");
input.nextLine();
System.out.println("Enter z2:");
input.nextLine();
break;
default:
break;
input.close();
public static double calculateDistance2D(double x1, double y1, double x2, double y2) {
public static double calculateDistance3D(double x1, double y1, double z1, double x2, double y2,
double z2) {
return result2;