#Coding Question1 

Write an algorithm for quicksort.

#Solution:

```sh

import java.util.Arrays;

class Quicksort 

{

// method to find the partition position

 static int partition(int array[], int leftmost, int rightmost) 

{

//leftmost element as pivot

int pivot = array[rightmost];

// pointer for greater element

int i = (leftmost - 1);

// compare each element with pivot

for (int j = leftmost; j < rightmost; j++) 

{

if (array[j] <= pivot) 

{

// If element found is smaller than pivot

//it will be swapped with the larger element pointed by i

i++;

// element at i is swapped with element at j

int s = array[i];

array[i] = array[j];

array[j] = s;

}

}

// swapt the pivot element with the greater element specified by i

int s = array[i + 1];

array[i + 1] = array[rightmost];

array[rightmost] = s;

// return the position from where partition is done

return (i + 1);

}

static void quickSort(int array[], int leftmost, int rightmost) 

{

if (leftmost < rightmost) 

{

int pi = partition(array, leftmost, rightmost);

// recursive call on the left of pivot

quickSort(array, leftmost, pi - 1);

// recursive call on the right of pivot

quickSort(array, pi + 1, rightmost);

}

}

}

class Main 

{

public static void main(String args[]) 

{

int[] arr = { 5, 4, 6, 1, 0, 8, 3 };

System.out.println("Unsorted Array");

System.out.println(Arrays.toString(arr));

int size = arr.length;

Quicksort.quickSort(arr, 0, size - 1);

System.out.println("Sorted Array in Ascending Order: ");

System.out.println(Arrays.toString(arr));

}

}

```

‍

#Output:

```sh

Unsorted Array

[5, 4, 6, 1, 0, 8, 3]

‍

Sorted Array in Ascending Order: 

[0, 1, 3, 4, 5, 6, 8]

```

#Coding Question2 

Write a program to count the number of vowels occurring in all the substrings of a given String.

‍

#Solution:

```sh

import java.io.*;

import java.util.*;

import java.util.Scanner; 

public class Main {

//calculates total sum of all vowel occurrences

static int vowel_calc(String str)

{

int n = str.length();

int arr[] = new int[n];

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

{ 

if (i == 0)

// Number of times the 0th character occurs in all substrings

arr[i] = n; 

else

// Number of times the ith character occurs in all substrings

arr[i] = (n - i) + arr[i - 1] - i;

}

int sum = 0;

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

char ch = str.charAt(i);

// Check to see if ith character is a vowel

if (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u')

sum += arr[i];

}

// Return total sum of all vowel occurrences      

return sum;

}

// Driver Code

public static void main(String args[])

{

Scanner sc= new Scanner(System.in); 

System.out.println("Enter a String");

String str=sc.nextLine();

System.out.println(vowel_calc(str));

}

}

```

‍

#Output:

```sh

Enter a String

Scaler

22

```

#Coding Question3

Print ASCII Value in Java

‍

#Solution:

```sh

public class PrintAsciiValueExample1   

{  

public static void main(String[] args)   

{  

// character whose ASCII value to be found  

char ch1 = 'a';  

char ch2 = 'b';  

// variable that stores the integer value of the character  

int asciivalue1 = ch1;  

int asciivalue2 = ch2;  

System.out.println("The ASCII value of " + ch1 + " is: " + asciivalue1);  

System.out.println("The ASCII value of " + ch2 + " is: " + asciivalue2);  

}  

}  

```

#Output:

```sh

The ASCII value of a is: 97

The ASCII value of b is: 98

```

#Coding Question4

Write a Java Program to Display Alternate Prime Numbers

#Solution

```sh

import java.util.Scanner;

class AlternatePrimeNumbers {

public static void main(String[] args) {

Scanner input = new Scanner(System.in);

System.out.print("Enter the range: ");

int range = input.nextInt();

input.close();

boolean isPrime;

int counter = 0;

System.out.println("Alternate Prime Numbers: ");

for (int num = 2; num <= range; num++) {

isPrime = true;

for (int i = 2; i <= num / 2; i++) {

if (num % i == 0) {

isPrime = false;

break;

}

}

if (isPrime) {

counter++;

if (counter % 2 == 0) {

System.out.print(num + " ");

}

}

}

}

}

```

#Coding Question5

Write a Java Program to find Third Largest Number in an Array

#Solution

```sh

public class ThirdLargestInArrayExample{  

public static int getThirdLargest(int[] a, int total){  

int temp;  

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

{  

for (int j = i + 1; j < total; j++)   

{  

if (a[i] > a[j])   

{  

temp = a[i];  

a[i] = a[j];  

a[j] = temp;  

}  

}  

}  

return a[total-3];  

}  

public static void main(String args[]){  

int a[]={1,2,5,6,3,2};  

int b[]={44,66,99,77,33,22,55};  

System.out.println("Third Largest: "+getThirdLargest(a,6));  

System.out.println("Third Largest: "+getThirdLargest(b,7));  

}}  

```

#Output:

```sh

Third Largest:3

Third Largest:66

```