Computer Applications
Write a program to input 10 alphabets in an array. Now ask the user to input an alphabet and search if the alphabet is present in the array or not using linear search technique. If found display "Search Successful" and print the index of the alphabet in the array, otherwise display "Search Unsuccessful".
Answer
import java.util.Scanner;
public class KboatLinearSearch
{
public static void main(String args[]) {
Scanner in = new Scanner(System.in);
char arr[] = new char[10];
System.out.println("Enter 10 alphabets:");
for (int i = 0; i < 10; i++) {
arr[i] = in.next().charAt(0);
}
System.out.print("Enter alphabet to search: ");
char ch = in.next().charAt(0);
int i = 0;
for (i = 0; i < 10; i++) {
if (arr[i] == ch) {
break;
}
}
if (i == 10) {
System.out.println("Search Unsuccessful");
}
else {
System.out.println("Search Successful");
System.out.println(ch + " present at index " + i);
}
}
}Output
Related Questions
Define a class pin code and store the given pin codes in a single dimensional array. Sort these pin codes in ascending order using the Selection Sort technique only. Display the sorted array.
110061, 110001, 110029, 110023, 110055, 110006, 110019, 110033
Define a class to accept values into an integer array of order 4 x 4 and check whether it is a DIAGONAL array or not. An array is DIAGONAL if the sum of the left diagonal elements equals the sum of the right diagonal elements. Print the appropriate message.
Example:
3 4 2 5
2 5 2 3
5 3 2 7
1 3 7 1Sum of the left diagonal element = 3 + 5 + 2 + 1 = 11
Sum of the right diagonal element = 5 + 2 + 3 + 1 = 11
Consider the following program segment and answer the questions given below:
int x[][] = {{2,4,5,6}, {5,7,8,1}, {34, 1, 10, 9}};(a) What is the position of 34?
(b) What is the result of x[2][3] + x[1][2]?