0% found this document useful (0 votes)

425 views

Milestone 1 Questions With Answer

Milestone 1 of WCP Java

Uploaded by

Sabari Sabster

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as DOCX, PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

425 views

Milestone 1 Questions With Answer

Milestone 1 of WCP Java

Uploaded by

Sabari Sabster

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as DOCX, PDF, TXT or read online on Scribd

You are on page 1/ 33

public class sample {

public static void main(String[] args) {

public class sample {

public static void main(String[] args) {

// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
int input1=sc.nextInt();
int input2=sc.nextInt();
int input3=sc.nextInt();
int in1[]=new int[4];
String s1=input1+"";
for(int i=0;i<4;i++)
{
in1[i]=Integer.parseInt(s1.charAt(i)+"");
}
int in2[]=new int[4];
String s2=input2+"";
for(int i=0;i<4;i++)
{
in2[i]=Integer.parseInt(s2.charAt(i)+"");
}
int in3[]=new int[4];
String s3=input3+"";
for(int i=0;i<4;i++)
{
in3[i]=Integer.parseInt(s3.charAt(i)+"");
}
String key="";
int th1000=in1[0] >in2[0] ? ( in1[0] > in3[0] ? in1[0] : in3[0]) :
(in2[0] > in3[0] ? in2[0] : in3[0]);
int hun100=in1[1] > in2[1] ? ( in1[1] > in3[1] ? in1[1] : in3[1]) :
(in2[1] > in3[1] ? in2[1] : in3[1]);
int tens10=in1[2] > in2[2] ? ( in1[2] > in3[2] ? in1[2] : in3[2]) :
(in2[2] > in3[2] ? in2[2] : in3[2]);
int once1=in1[3] > in2[3] ? ( in1[3] > in3[3] ? in1[3] : in3[3]) :
(in2[3] > in3[3] ? in2[3] : in3[3]);
key=key+th1000+hun100+tens10+once1;
int res=Integer.parseInt(key);
System.out.println(res);
}
}
import java.util.Arrays;

import java.util.Scanner;

public class sample {

public static void main(String[] args) {

// TODO Auto-generated method stub

Scanner sc=new Scanner(System.in);

int input1=sc.nextInt();

int input2=sc.nextInt();
int input3=sc.nextInt();

int in1[]=new int[4];

String s1=input1+"";

for(int i=0;i<4;i++)

in1[i]=Integer.parseInt(s1.charAt(i)+"");

int in2[]=new int[4];

String s2=input2+"";

for(int i=0;i<4;i++)

in2[i]=Integer.parseInt(s2.charAt(i)+"");

int in3[]=new int[4];

String s3=input3+"";

for(int i=0;i<4;i++)

in3[i]=Integer.parseInt(s3.charAt(i)+"");

String key="";

int th1000=in1[0] <in2[0] ? ( in1[0] < in3[0] ? in1[0] : in3[0]) : (in2[0] < in3[0] ? in2[0] :
in3[0]);

int hun100=in1[1] < in2[1] ? ( in1[1] < in3[1] ? in1[1] : in3[1]) : (in2[1] < in3[1] ? in2[1] :
in3[1]);

int tens10=in1[2] < in2[2] ? ( in1[2] < in3[2] ? in1[2] : in3[2]) : (in2[2] < in3[2] ? in2[2] :
in3[2]);
int once1=in1[3] < in2[3] ? ( in1[3] < in3[3] ? in1[3] : in3[3]) : (in2[3] < in3[3] ? in2[3] :
in3[3]);

key=key+th1000+hun100+tens10+once1;

int res=Integer.parseInt(key);

System.out.println(res);

}
import java.util.Arrays;

import java.util.Scanner;
public class sample {

public static void main(String[] args) {

// TODO Auto-generated method stub

Scanner sc=new Scanner(System.in);

int input1=sc.nextInt();

int input2=sc.nextInt();

int input3=sc.nextInt();

int input4=sc.nextInt();

int input5=sc.nextInt();

int n1=input1;

int n2=input2;

int n3=input3;

int n4=input4;

int n5=input5;

int in1[]=new int[10];

int in2[]=new int[10];

int in3[]=new int[10];

int in4[]=new int[10];

int in5[]=new int[10];

while(input1>0)

in1[input1%10]++;

input1/=10;

while(input2>0)
{

in2[input2%10]++;

input2/=10;

while(input3>0)

in3[input3%10]++;

input3/=10;

while(input4>0)

in4[input4%10]++;

input4/=10;

while(input5>0)

in5[input5%10]++;

input5/=10;

int stable[]=new int[5];

int l=0;

int unstable[]=new int[5];

int m=0;

if(stable_check(in1)==1)

{
stable[l]=n1;

l++;

else

unstable[m]=n1;

m++;

if(stable_check(in2)==1)

stable[l]=n2;

l++;

else

unstable[m]=n2;

m++;

if(stable_check(in3)==1)

stable[l]=n3;

l++;

else

{
unstable[m]=n3;

m++;

if(stable_check(in4)==1)

stable[l]=n4;

l++;

else

unstable[m]=n4;

m++;

if(stable_check(in5)==1)

stable[l]=n5;

l++;

else

unstable[m]=n5;

m++;

int sum=0;

for(int i=0;i<5;i++)
{

sum=sum+stable[i];

System.out.println(sum);

static int stable_check(int in[])

Arrays.sort(in);

int c=in[9];

int flag=1;

for(int i=0;i<10;i++)

if(in[i]==0||in[i]==c)

flag=1;

else{

flag=0;

break;

return flag;

}
public class sample {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
int input1=sc.nextInt();
int input2=sc.nextInt();
int input3=sc.nextInt();
int input4=sc.nextInt();
int input5=sc.nextInt();
int n1=input1;
int n2=input2;
int n3=input3;
int n4=input4;
int n5=input5;
int in1[]=new int[10];
int in2[]=new int[10];
int in3[]=new int[10];
int in4[]=new int[10];
int in5[]=new int[10];
while(input1>0)
{
in1[input1%10]++;
input1/=10;
}
while(input2>0)
{
in2[input2%10]++;
input2/=10;
}
while(input3>0)
{
in3[input3%10]++;
input3/=10;
}
while(input4>0)
{
in4[input4%10]++;
input4/=10;
}
while(input5>0)
{
in5[input5%10]++;
input5/=10;
}
int stable[]=new int[5];
int l=0;
int unstable[]=new int[5];
int m=0;
if(stable_check(in1)==1)
{
stable[l]=n1;
l++;
}
else
{
unstable[m]=n1;
m++;
}
if(stable_check(in2)==1)
{
stable[l]=n2;
l++;
}
else
{
unstable[m]=n2;
m++;
}
if(stable_check(in3)==1)
{
stable[l]=n3;
l++;
}
else
{
unstable[m]=n3;
m++;
}
if(stable_check(in4)==1)
{
stable[l]=n4;
l++;
}
else
{
unstable[m]=n4;
m++;
}
if(stable_check(in5)==1)
{
stable[l]=n5;
l++;
}
else
{
unstable[m]=n5;
m++;
}
Arrays.sort(unstable);
int max_uns=unstable[4];
int min_uns=0;
for(int i=0;i<5;i++)
{
if(unstable[i]>0)
{
min_uns=unstable[i];
break;
}
}
System.out.println(max_uns);
System.out.println(min_uns);
int res=max_uns+min_uns;
System.out.println(res);
}
static int stable_check(int in[])
{
Arrays.sort(in);

int c=in[9];
int flag=1;
for(int i=0;i<10;i++)
{
if(in[i]==0||in[i]==c)
{
flag=1;
}
else{
flag=0;
break;
}
}
return flag;
}
}

public class sample {

public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
int input1=sc.nextInt();
int input2=sc.nextInt();
int input3=sc.nextInt();
int input4=sc.nextInt();
int input5=sc.nextInt();
int n1=input1;
int n2=input2;
int n3=input3;
int n4=input4;
int n5=input5;
int in1[]=new int[10];
int in2[]=new int[10];
int in3[]=new int[10];
int in4[]=new int[10];
int in5[]=new int[10];
while(input1>0)
{
in1[input1%10]++;
input1/=10;
}
while(input2>0)
{
in2[input2%10]++;
input2/=10;
}
while(input3>0)
{
in3[input3%10]++;
input3/=10;
}
while(input4>0)
{
in4[input4%10]++;
input4/=10;
}
while(input5>0)
{
in5[input5%10]++;
input5/=10;
}
int stable[]=new int[5];
int l=0;
int unstable[]=new int[5];
int m=0;
if(stable_check(in1)==1)
{
stable[l]=n1;
l++;
}
else
{
unstable[m]=n1;
m++;
}
if(stable_check(in2)==1)
{
stable[l]=n2;
l++;
}
else
{
unstable[m]=n2;
m++;
}
if(stable_check(in3)==1)
{
stable[l]=n3;
l++;
}
else
{
unstable[m]=n3;
m++;
}
if(stable_check(in4)==1)
{
stable[l]=n4;
l++;
}
else
{
unstable[m]=n4;
m++;
}
if(stable_check(in5)==1)
{
stable[l]=n5;
l++;
}
else
{
unstable[m]=n5;
m++;
}
Arrays.sort(stable);
Arrays.sort(unstable);
int max_s=stable[4];
int min_uns=0;
for(int i=0;i<5;i++)
{
if(unstable[i]>0)
{
min_uns=unstable[i];
break;
}
}
System.out.println(max_s);
System.out.println(min_uns);
int res=max_s+min_uns;
System.out.println(res);
}
static int stable_check(int in[])
{
Arrays.sort(in);

int c=in[9];
int flag=1;
for(int i=0;i<10;i++)
{
if(in[i]==0||in[i]==c)
{
flag=1;
}
else{
flag=0;
break;
}
}
return flag;
}
}

public class sample {

public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
int input1=sc.nextInt();
int input2=sc.nextInt();
int input3=sc.nextInt();
int input4=sc.nextInt();
int input5=sc.nextInt();
int n1=input1;
int n2=input2;
int n3=input3;
int n4=input4;
int n5=input5;
int in1[]=new int[10];
int in2[]=new int[10];
int in3[]=new int[10];
int in4[]=new int[10];
int in5[]=new int[10];
while(input1>0)
{
in1[input1%10]++;
input1/=10;
}
while(input2>0)
{
in2[input2%10]++;
input2/=10;
}
while(input3>0)
{
in3[input3%10]++;
input3/=10;
}
while(input4>0)
{
in4[input4%10]++;
input4/=10;
}
while(input5>0)
{
in5[input5%10]++;
input5/=10;
}
int stable[]=new int[5];
int l=0;
int unstable[]=new int[5];
int m=0;
if(stable_check(in1)==1)
{
stable[l]=n1;
l++;
}
else
{
unstable[m]=n1;
m++;
}
if(stable_check(in2)==1)
{
stable[l]=n2;
l++;
}
else
{
unstable[m]=n2;
m++;
}
if(stable_check(in3)==1)
{
stable[l]=n3;
l++;
}
else
{
unstable[m]=n3;
m++;
}
if(stable_check(in4)==1)
{
stable[l]=n4;
l++;
}
else
{
unstable[m]=n4;
m++;
}
if(stable_check(in5)==1)
{
stable[l]=n5;
l++;
}
else
{
unstable[m]=n5;
m++;
}
int S_count=0;
int uns_count=0;
for(int i=0;i<5;i++)
{
if(stable[i]>0)
{
S_count++;
}
}
for(int i=0;i<5;i++)
{
if(unstable[i]>0)
{
uns_count++;
}
}
System.out.println(S_count);
System.out.println(uns_count);
int res=(S_count*10)+uns_count;
System.out.println(res);
}
static int stable_check(int in[])
{
Arrays.sort(in);

int c=in[9];
int flag=1;
for(int i=0;i<10;i++)
{
if(in[i]==0||in[i]==c)
{
flag=1;
}
else{
flag=0;
break;
}
}
return flag;
}
}

public class sample {

public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
int input1=sc.nextInt();
int input2=sc.nextInt();
int input3=sc.nextInt();
int input4=sc.nextInt();
int input5=sc.nextInt();
int n1=input1;
int n2=input2;
int n3=input3;
int n4=input4;
int n5=input5;
int in1[]=new int[10];
int in2[]=new int[10];
int in3[]=new int[10];
int in4[]=new int[10];
int in5[]=new int[10];
while(input1>0)
{
in1[input1%10]++;
input1/=10;
}
while(input2>0)
{
in2[input2%10]++;
input2/=10;
}
while(input3>0)
{
in3[input3%10]++;
input3/=10;
}
while(input4>0)
{
in4[input4%10]++;
input4/=10;
}
while(input5>0)
{
in5[input5%10]++;
input5/=10;
}
int stable[]=new int[5];
int l=0;
int unstable[]=new int[5];
int m=0;
if(stable_check(in1)==1)
{
stable[l]=n1;
l++;
}
else
{
unstable[m]=n1;
m++;
}
if(stable_check(in2)==1)
{
stable[l]=n2;
l++;
}
else
{
unstable[m]=n2;
m++;
}
if(stable_check(in3)==1)
{
stable[l]=n3;
l++;
}
else
{
unstable[m]=n3;
m++;
}
if(stable_check(in4)==1)
{
stable[l]=n4;
l++;
}
else
{
unstable[m]=n4;
m++;
}
if(stable_check(in5)==1)
{
stable[l]=n5;
l++;
}
else
{
unstable[m]=n5;
m++;
}
Arrays.sort(stable);
int max_s=stable[4];
int min_s=0;
for(int i=0;i<5;i++)
{
if(stable[i]>0)
{
min_s=stable[i];
break;
}
}
System.out.println(max_s);
System.out.println(min_s);
int res=max_s+min_s;
System.out.println(res);
}
static int stable_check(int in[])
{
Arrays.sort(in);

int c=in[9];
int flag=1;
for(int i=0;i<10;i++)
{
if(in[i]==0||in[i]==c)
{
flag=1;
}
else{
flag=0;
break;
}
}
return flag;
}
}

public class sample {

public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
int input1=sc.nextInt();
int input2=sc.nextInt();
int input3=sc.nextInt();
int input4=sc.nextInt();
int input5=sc.nextInt();
int n1=input1;
int n2=input2;
int n3=input3;
int n4=input4;
int n5=input5;
int in1[]=new int[10];
int in2[]=new int[10];
int in3[]=new int[10];
int in4[]=new int[10];
int in5[]=new int[10];
while(input1>0)
{
in1[input1%10]++;
input1/=10;
}
while(input2>0)
{
in2[input2%10]++;
input2/=10;
}
while(input3>0)
{
in3[input3%10]++;
input3/=10;
}
while(input4>0)
{
in4[input4%10]++;
input4/=10;
}
while(input5>0)
{
in5[input5%10]++;
input5/=10;
}
int stable[]=new int[5];
int l=0;
int unstable[]=new int[5];
int m=0;
if(stable_check(in1)==1)
{
stable[l]=n1;
l++;
}
else
{
unstable[m]=n1;
m++;
}
if(stable_check(in2)==1)
{
stable[l]=n2;
l++;
}
else
{
unstable[m]=n2;
m++;
}
if(stable_check(in3)==1)
{
stable[l]=n3;
l++;
}
else
{
unstable[m]=n3;
m++;
}
if(stable_check(in4)==1)
{
stable[l]=n4;
l++;
}
else
{
unstable[m]=n4;
m++;
}
if(stable_check(in5)==1)
{
stable[l]=n5;
l++;
}
else
{
unstable[m]=n5;
m++;
}
Arrays.sort(stable);
int max_s=stable[4];
int min_s=0;
for(int i=0;i<5;i++)
{
if(stable[i]>0)
{
min_s=stable[i];
break;
}
}
System.out.println(max_s);
System.out.println(min_s);
int res=max_s-min_s;
System.out.println(res);
}
static int stable_check(int in[])
{
Arrays.sort(in);

int c=in[9];
int flag=1;
for(int i=0;i<10;i++)
{
if(in[i]==0||in[i]==c)
{
flag=1;
}
else{
flag=0;
break;
}
}
return flag;
}
}
public class sample {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
int input1=sc.nextInt();
int input2=sc.nextInt();
int input3=sc.nextInt();
int input4=sc.nextInt();
int input5=sc.nextInt();
int n1=input1;
int n2=input2;
int n3=input3;
int n4=input4;
int n5=input5;
int in1[]=new int[10];
int in2[]=new int[10];
int in3[]=new int[10];
int in4[]=new int[10];
int in5[]=new int[10];
while(input1>0)
{
in1[input1%10]++;
input1/=10;
}
while(input2>0)
{
in2[input2%10]++;
input2/=10;
}
while(input3>0)
{
in3[input3%10]++;
input3/=10;
}
while(input4>0)
{
in4[input4%10]++;
input4/=10;
}
while(input5>0)
{
in5[input5%10]++;
input5/=10;
}
int stable[]=new int[5];
int l=0;
int unstable[]=new int[5];
int m=0;
if(stable_check(in1)==1)
{
stable[l]=n1;
l++;
}
else
{
unstable[m]=n1;
m++;
}
if(stable_check(in2)==1)
{
stable[l]=n2;
l++;
}
else
{
unstable[m]=n2;
m++;
}
if(stable_check(in3)==1)
{
stable[l]=n3;
l++;
}
else
{
unstable[m]=n3;
m++;
}
if(stable_check(in4)==1)
{
stable[l]=n4;
l++;
}
else
{
unstable[m]=n4;
m++;
}
if(stable_check(in5)==1)
{
stable[l]=n5;
l++;
}
else
{
unstable[m]=n5;
m++;
}
Arrays.sort(stable);
Arrays.sort(unstable);
int max_s=stable[4];
int min_uns=0;
for(int i=0;i<5;i++)
{
if(unstable[i]>0)
{
min_uns=unstable[i];
break;
}
}
System.out.println(max_s);
System.out.println(min_uns);
int res=max_s-min_uns;
System.out.println(res);
}
static int stable_check(int in[])
{
Arrays.sort(in);

int c=in[9];
int flag=1;
for(int i=0;i<10;i++)
{
if(in[i]==0||in[i]==c)
{
flag=1;
}
else{
flag=0;
break;
}
}
return flag;
}
}

All Milestone MCQ PDF
No ratings yet
All Milestone MCQ PDF
75 pages
Sample - Core Java Developer Assessment - 1635359098862
0% (1)
Sample - Core Java Developer Assessment - 1635359098862
10 pages
InfyTQ Coding Questions Set 1 PDF
67% (3)
InfyTQ Coding Questions Set 1 PDF
39 pages
AMCAT Automata Questions
No ratings yet
AMCAT Automata Questions
35 pages
Level 3 Coding Merged
No ratings yet
Level 3 Coding Merged
75 pages
Assignment 2 - Flow Conrtrol Statement
0% (1)
Assignment 2 - Flow Conrtrol Statement
8 pages
PRP Wipro
67% (9)
PRP Wipro
56 pages
JMIGMON State Properties: Restart: Lesson: Controlling The JLOAD Processes
No ratings yet
JMIGMON State Properties: Restart: Lesson: Controlling The JLOAD Processes
70 pages
Wipro Solutions
100% (3)
Wipro Solutions
14 pages
Mile3 1 PDF
No ratings yet
Mile3 1 PDF
22 pages
207 Jva Programs
0% (1)
207 Jva Programs
116 pages
Java PRP Programs
No ratings yet
Java PRP Programs
12 pages
Maximum of Unstable-Minimum of Unstable
No ratings yet
Maximum of Unstable-Minimum of Unstable
3 pages
Prime Encoder
100% (1)
Prime Encoder
1 page
Find Key
No ratings yet
Find Key
3 pages
Answers
No ratings yet
Answers
6 pages
Assignment 2
No ratings yet
Assignment 2
12 pages
LogicBuildingHour Plan Mile1
0% (3)
LogicBuildingHour Plan Mile1
4 pages
1.5 Empirical Analysis
No ratings yet
1.5 Empirical Analysis
8 pages
WEEK - 08 - CODING - Attempt Review Hareesh
100% (1)
WEEK - 08 - CODING - Attempt Review Hareesh
7 pages
Find Key
100% (1)
Find Key
2 pages
RSF Program in Java
61% (23)
RSF Program in Java
2 pages
Milestones BITS Final
No ratings yet
Milestones BITS Final
87 pages
Talentnext - 2021 - Learningphase - Mile1 - Mcqs Wipro: Nipoorva Yadav
100% (1)
Talentnext - 2021 - Learningphase - Mile1 - Mcqs Wipro: Nipoorva Yadav
3 pages
Assignment 2
No ratings yet
Assignment 2
11 pages
BVA
No ratings yet
BVA
4 pages
PRP Ques
No ratings yet
PRP Ques
14 pages
Problem: Logic Pyramid: Sno. Input Output
No ratings yet
Problem: Logic Pyramid: Sno. Input Output
28 pages
What Is A Program
No ratings yet
What Is A Program
27 pages
Assessment Milestone
100% (1)
Assessment Milestone
37 pages
Java MCQ
100% (1)
Java MCQ
13 pages
SQL
No ratings yet
SQL
18 pages
WIPRO LOGIC BUILDING JAVA PROGRAMS Most Important (PART-II)
100% (2)
WIPRO LOGIC BUILDING JAVA PROGRAMS Most Important (PART-II)
2 pages
Milestone 2
No ratings yet
Milestone 2
6 pages
Collection & Maps Question 1
No ratings yet
Collection & Maps Question 1
12 pages
ML2 All MCQ's
No ratings yet
ML2 All MCQ's
22 pages
Hexaware 6th FEB 2022
No ratings yet
Hexaware 6th FEB 2022
12 pages
All Number Related Programs in Java
No ratings yet
All Number Related Programs in Java
12 pages
Amcat Programming Questions With Answers
No ratings yet
Amcat Programming Questions With Answers
39 pages
TCS Digital D4
No ratings yet
TCS Digital D4
66 pages
Nambiar Number
No ratings yet
Nambiar Number
2 pages
WEEK - 9 - CODING - Attempt Review Hareesh
No ratings yet
WEEK - 9 - CODING - Attempt Review Hareesh
7 pages
File 2
No ratings yet
File 2
5 pages
TCS Adv MCQ With Answers
No ratings yet
TCS Adv MCQ With Answers
34 pages
DICE ID APP FAQs
No ratings yet
DICE ID APP FAQs
5 pages
Vehicles Detection and Counting Based On Internet of Things Technology and Video Processing Techniques
No ratings yet
Vehicles Detection and Counting Based On Internet of Things Technology and Video Processing Techniques
9 pages
Java
No ratings yet
Java
3 pages
Six Phrase Aptitude Training Short Cuts I
100% (4)
Six Phrase Aptitude Training Short Cuts I
17 pages
Double Tail Comparator
No ratings yet
Double Tail Comparator
32 pages
Coding Questions (Accenture and Cognizant)
No ratings yet
Coding Questions (Accenture and Cognizant)
30 pages
CTS Sample Questions With Solutions
No ratings yet
CTS Sample Questions With Solutions
62 pages
Core Java
50% (2)
Core Java
42 pages
Java Practice - Questions
No ratings yet
Java Practice - Questions
2 pages
LabVIEW Data Types & Conversions Between These Types
100% (4)
LabVIEW Data Types & Conversions Between These Types
23 pages
Accenture QNS 23-08-2023
No ratings yet
Accenture QNS 23-08-2023
9 pages
Java Questions
No ratings yet
Java Questions
14 pages
TCS Questions
No ratings yet
TCS Questions
51 pages
Java Solved Programs PDF
100% (5)
Java Solved Programs PDF
59 pages
Abstraction, Packages, Exception Handling
No ratings yet
Abstraction, Packages, Exception Handling
14 pages
VERDIS APTITUDE TEST-II
No ratings yet
VERDIS APTITUDE TEST-II
12 pages
Milestone 2
100% (2)
Milestone 2
8 pages
Insyde Flash Firmware Tool (H2OFFT) · ISpillMyDrink_UEFI-Repair-Guide Wiki · GitHub
No ratings yet
Insyde Flash Firmware Tool (H2OFFT) · ISpillMyDrink_UEFI-Repair-Guide Wiki · GitHub
5 pages
ICT Form 1 Pamphlet-2025(1)
No ratings yet
ICT Form 1 Pamphlet-2025(1)
70 pages
Full download Image and Graphics Technologies and Applications 17th Chinese Conference IGTA 2022 Beijing China April 23 24 2022 Revised Selected Papers Yongtian Wang pdf docx
100% (4)
Full download Image and Graphics Technologies and Applications 17th Chinese Conference IGTA 2022 Beijing China April 23 24 2022 Revised Selected Papers Yongtian Wang pdf docx
34 pages
8th Annual Exam - Question Paper - D
No ratings yet
8th Annual Exam - Question Paper - D
4 pages
Business Models in The 20th Vs 21st Centuries-Cicwum 141767 1666249768
No ratings yet
Business Models in The 20th Vs 21st Centuries-Cicwum 141767 1666249768
32 pages
Code: Csc118 (Fundamental of Algorithm Development) : Nf2F Students Are Expected To Spend 9 Hours
No ratings yet
Code: Csc118 (Fundamental of Algorithm Development) : Nf2F Students Are Expected To Spend 9 Hours
3 pages
CFM56_7B_SB_REV_80-0016_TSN.00_N_20150421
No ratings yet
CFM56_7B_SB_REV_80-0016_TSN.00_N_20150421
7 pages
MTID322 Lab2 W21
No ratings yet
MTID322 Lab2 W21
7 pages
Ip Address Activity
No ratings yet
Ip Address Activity
18 pages
Resume Karun Sharma
No ratings yet
Resume Karun Sharma
1 page
Types of OS
No ratings yet
Types of OS
14 pages
Testimine 2
No ratings yet
Testimine 2
85 pages
Introduction To Unix Commands
No ratings yet
Introduction To Unix Commands
23 pages
Chap 2
No ratings yet
Chap 2
50 pages
Manuel AutoCad 2012
No ratings yet
Manuel AutoCad 2012
1,698 pages
UNIT-1 OOAD
No ratings yet
UNIT-1 OOAD
12 pages
3423950 - NT 2023.004 v1.1_ New Fields Added to Nota Fiscal - SAP for Me2
No ratings yet
3423950 - NT 2023.004 v1.1_ New Fields Added to Nota Fiscal - SAP for Me2
1 page
SENSI IOS
No ratings yet
SENSI IOS
2 pages
IT Companies in Oman
No ratings yet
IT Companies in Oman
12 pages
Global Work Cell Phone Policy
No ratings yet
Global Work Cell Phone Policy
7 pages
IDT Module 3
No ratings yet
IDT Module 3
19 pages
Unit 2
No ratings yet
Unit 2
29 pages
ESENT Event ID 508,510 and 533 Warnings in Event Viewer - Microsoft Community
No ratings yet
ESENT Event ID 508,510 and 533 Warnings in Event Viewer - Microsoft Community
10 pages
The Weaponization of Artificial Intelligence
100% (1)
The Weaponization of Artificial Intelligence
7 pages
Enhancing Productivity Through AI Technologies
No ratings yet
Enhancing Productivity Through AI Technologies
11 pages
Final Year Project Idea
No ratings yet
Final Year Project Idea
20 pages
Perubahan Sistem Pergudangan Dengan Metode 5S Dan Perancangan Sistem Informasi Pendukung Pada PT Indokarlo Perkasa
No ratings yet
Perubahan Sistem Pergudangan Dengan Metode 5S Dan Perancangan Sistem Informasi Pendukung Pada PT Indokarlo Perkasa
12 pages
service_actions
No ratings yet
service_actions
2 pages
CS8073 - Assignment - II
No ratings yet
CS8073 - Assignment - II
4 pages

Milestone 1 Questions With Answer

Uploaded by

Milestone 1 Questions With Answer

Uploaded by

public class sample {

public static void main(String[] args) {

public static void main(String[] args) {

public class sample {

public static void main(String[] args) {

public class sample {

public static void main(String[] args) {

// TODO Auto-generated method stub

Scanner sc=new Scanner(System.in);

int in1[]=new int[4];

int in2[]=new int[4];

int in3[]=new int[4];

public static void main(String[] args) {

// TODO Auto-generated method stub

Scanner sc=new Scanner(System.in);

int in1[]=new int[10];

int in2[]=new int[10];

int in3[]=new int[10];

int in4[]=new int[10];

int in5[]=new int[10];

int stable[]=new int[5];

int unstable[]=new int[5];

static int stable_check(int in[])

public class sample {

public class sample {

public class sample {

public class sample {

You might also like