Make a Position in the software / web developer field where my analytical and technical skills can help.
#include <stdio.h> #define MAX_SIZE 100 void main() { int arr[MAX_SIZE]; int size, i, toSearch, found; printf("Enter size of array: "); scanf("%d", &size); printf("Enter elements in array: "); for(i=0; i<size; i++) { ...
Download Jar Files From below Jar Files Index page(index.jsp) <%@ page language="java" contentType="text/html; charset=ISO-8859-1" pageEncoding="ISO-8859-1"%> <!DOCTYPE html> <html> <head> <meta charset="ISO-8859-1"> <title>Index Page</title> <st...
import java.util.Scanner; public class ReverseString { public static void main(String[] args) { System.out.println("Enter any String: "); Scanner sc = new Scanner(System.in); String str = sc.nextLine(); String rev...
import java.util.Scanner; public class ReverseNumber { static void reverseNumber(int num) { if (num < 10) { System.out.println(num); return; } else { Sys...
import java.util.Scanner; public class PrimeNumber { static void checkPrime(int n) { int m= 0, flag = 0; m = n /2; if(n == 0 || n == 1) { System.out.println(n+" is not Prime Number."); } ...
import java.util.Scanner; public class PositionOfChar { public static void main(String[] args) { Scanner sc = new Scanner(System.in); System.out.println("Enter the String: "); String str = sc.nextLine(); System...
import java.util.Scanner; public class PerfectNumber { static long isPerfect(long num) { long sum=0; for(int i=1; i <= num/2; i++) { if(num % i == 0) { sum=sum + i...
import java.util.Scanner; public class PalindromeString { static boolean isPalindrome(String str) { int i = 0, j = str.length() - 1; while (i < j) { if (str.charAt(i) != str.charAt(j)) { ...
import java.util.Scanner; public class PalindromeNumber { public static void main(String args[]) { int remainder,sum=0; System.out.println("Enter Any Number to check for Palindrome:1"); Scanner sc = new Scann...