HIHimanshu Itankarinhimanshu09.hashnode.dev·Nov 30, 2021 · 1 min readC Program to find Number Present in an Array#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++) { ...00
HIHimanshu Itankarinhimanshu09.hashnode.dev·Sep 19, 2021 · 14 min readLogin, Register, View using HibernateDownload 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...00
HIHimanshu Itankarinhimanshu09.hashnode.dev·Sep 19, 2021 · 1 min readReverse String using Javaimport 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...00
HIHimanshu Itankarinhimanshu09.hashnode.dev·Sep 19, 2021 · 1 min readReverse Number using Javaimport java.util.Scanner; public class ReverseNumber { static void reverseNumber(int num) { if (num < 10) { System.out.println(num); return; } else { Sys...00
HIHimanshu Itankarinhimanshu09.hashnode.dev·Sep 19, 2021 · 1 min readPrime Number using Javaimport 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."); } ...00
