Académique Documents
Professionnel Documents
Culture Documents
#chage -m 10
-M 20
-W 7
-I 7
-E 1/10/2018 ty
arr[i] = Integer.parseInt(br.readLine());
dos.writeInt(arr[i]) ;
}
for(int i=0;i<n;i++)
total = total+arr[i];
int avg = total/n;
dos.writeInt(avg);
dos.close();
dis.close();
s.close();
}}
TCP/IP SOCKET PROGRAM TO DISPLAY REVERSE OF THE NUMBER
CLIENT SIDE
import java.io.* ;
import java.net.* ;
public class clientreverse {
public static void main(String[] args) throws IOException {
Socket s = new Socket("localhost",6666);
DataInputStream dis = new DataInputStream(s.getInputStream());
DataOutputStream dos = new DataOutputStream(s.getOutputStream());
BufferedReader br = new BufferedReader(new InputStreamReader(System.in)) ;
System.out.println("Enter the number :");
int num = Integer.parseInt(br.readLine());
dos.writeInt(num) ;
int rev = dis.readInt();
System.out.println("Reverse is " + rev);
dos.close();
dis.close();
s.close();
}
}
SERVER SIDE
import java.io.* ;
import java.net.* ;
public class serverreverse {
public static void main(String[] args) throws IOException {
ServerSocket ss = new ServerSocket(6666);
Socket s= ss.accept();
while(num!=0);
dos.writeInt(rev);
dos.close();
dis.close();
s.close();
}
}
c++ PROGRAM TO DISPLAY A NUMBER IS PALINDROME OR NOT
#include <iostream>
using namespace std;
int main()
{
int n, num, digit, rev = 0;
cout << "Enter a positive number: ";
cin >> num;
n = num;
do
{
digit = num%10;
rev = (rev*10) + digit;
num = num/10;
}while (num!=0);
cout << " The reverse of the number is: " << rev << "\n";
if (n==rev)
cout << " The number is a palindrome";
else
cout << " The number is not a palindrome";
return 0;
}
int main()
{
int n, i, flag=0;
cout << "Enter a positive integer: ";
cin >> n;
for(i=2;i<=n/2;++i)
{
if(n%i==0)
{
flag=1;
break;
}
}
if (flag==0)
cout << "This is a prime number";
else
cout << "This is not a prime number";
return 0;
}
#include <stdio.h>
3.
4.
void main()
{
5.
6.
int i, j, a, n, number[30];
7.
8.
9.
10.
11.
12.
scanf("%d", &number[i]);
for (i = 0; i < n; ++i)
13.
14.
{
for (j = i + 1; j < n; ++j)
15.
16.
17.
18.
19.
20.
21.
22.
{
if (number[i] > number[j])
{
a = number[i];
number[i] = number[j];
number[j] = a;
}
}
23.
24.
}
printf("The numbers arranged in ascending order are given below \n");
25.
26.
27.