Java lab PART 1 QUESTIONS Type 1. List of Java Programs: For Beginners
-
WAP to swap two numbers with using and without using third variable.
-
Write a menu driven program to check whether a triangle is valid, equilateral, isosceles, scalene or right angled or not.
-
Write a program to find the largest and smallest numbers among three numbers.
-
WAP to check whether an input character is vowel or not.
-
WAP to print factorial and table of a number.
-
WAP to find sum of the following series a. 12 + 22 +32 +42 +52 +62 +72 +.... +n b. 1-2+3-4+5-6+......... n c. 1! + 2! + 3! + 4! +...... n d. 2/9-5/13+8/17.
-
WAP a program to print table and factorial of the numbers lying between 1 to 1000.
-
Write a menu driven program to check whether a number is Prime, Armstrong, Magic, Palindrome, or Perfect or Not.
-
Write a menu driven program to count no of even digits, no of odd digits present in the number.
-
Write a menu driven program to print Fibonacci and Tribonacci series up to n terms.
-
Write a menu driven program to find even and odd divisors of a number.
-
WAP to find roots of the quadratic equations.
-
WAP to check whether three points lies in the same line or not.
-
Write a menu driven program to find LCM and GCD of two numbers.
-
WAP to find the largest integer value n, such that its factorial can be correctly stored in the variable long.
-
WAP to generate pascal triangle.17. WAP to print prime numbers from 1 to 1000.
-
WAP to check whether a point lies in the given circle or not.
-
WAP to decide whether a given date is valid date for a non leap year. Read only date and month.
-
WAP to check whether an input number is smith or not? Where smith number is a composite number, the sum of whose digits is the sum of the prime factors obtained as a result of prime factorization (excluding 1). The first few numbers are 4,22, 27,58... Example: a. 666 Prime factors are 2,3,3 and 37 Sum of the digits are (6+6+6) = 18. Sum of the digits of the factors (2 + 3 + 3 + (3 + 7)) = 18. So 666 is the Smith Number.
-
WAP to input a number and print it in words For ex. Input is 45 Output will be Four Five.
-
WAP to find Primorial of a number. Primorial is defined as the product of prime numbers less than or equal to that number. e.g. Primorial of 6 will be 235 = 30.
-
WAP to print prime factors of a number.
-
WAP to print nth term of the Fibonacci series and also print the prime numbers present in the Fibonacci series.25. WAP to print factorial of every number that comes in the every step while printing the table of any number.
-
WAP to find sum of the prime numbers present in the single dimensional array of size n.
-
WAP to Check if a Matrix is Invertible.
-
WAP to compute determinant of a matrix.
-
WAP to print a Matrix in to spiral order.
-
WAP to implement sieve of erathostone algorithm to generate prime numbers.31. WAP to find transpose of a matrix.
-
WAP to print primary and secondry diagonal of a square matrix.
-
WAP to multiple two matrix of size m x n and p x q.
-
WAP that reads in an odd integer N and prints out N X N magic square. The square contains each of the integers between 1 and N^2 exactly once, such that all row sums, column sums and diagonal sums are equal.
-
WAP to generate Hadamard Matrix.
-
WAP to find sum of the digits of the largest and smallest number present in the array of size m x n.
-
WAP to convert single dimensional array to multi dimensional array and vice versa. As per users choice.
-
WAP a program to merge two single dimensional array of size m and p respectively.39. Write a program to declare a square matrix A[][] of order (M x M) where M must be greater than 3 and less than 10. Allow the user to input positive integers into this matrix. Perform the following tasks on the matrix: (a) Sort the non-boundary elements in ascending order using any standard sorting technique and rearrange them in the matrix. (b) Calculate the sum of both the diagonals. (c) Display the original matrix, rearranged matrix and only the diagonal elements of the rearranged matrix with their sum.
-
Write a Program in Java to input a word and print its anagrams. Note: Anagrams are words made up of all the characters present in the original word by re- arranging the characters. Example: Anagrams of the word TOP are: TOP, TPO, OPT, OTP, PTO and POT.
-
Write a program to input a word from the user and remove the duplicate characters present in it.
-
Write a Program in Java to fill a 2-D array with the first m x n prime numbers, where m is the number of rows and n is the number of columns.
-
Write a program to accept a sentence which may be terminated by either “.” or “?” only. The words are to be separated by a single blank space. Print an error message if the input does not terminate with “.” or “?”. You can assume that no word in the sentence exceeds 15 characters, so that you get a proper formatted output. Perform the following tasks: (i) Convert the first letter of each word to uppercase. (ii) Find the number of vowels and consonants in each word and display them with proper headings along with the words. 19.
-
Write a program to declare a square matrix A[ ][ ] of order MxM where M is the number of rows and the number of columns, such that M must be greater than 2 and less than 10. Accept the value of M as user input. Display an appropriate message for an invalid input. Allow the user to input integers into this matrix. Perform the following tasks: (a) Display the original matrix. (b) Rotate the matrix 90° clockwise as shown below: (c) Find the sum of the elements of the four corners of the matrix.
-
A simple encryption system uses a shifting process to hide a message. The value of the shift can be in the range 1 to 26. For example a shift of 7 means that A = U, B =V,C = W, etc. i e. Text : A B C D E F G H I J K L M N O P Q R S T U V W X Y Z Code: U V W X Y Z A B C D E F G H I J K L M N O P Q R S T Fist an extra space is added to the end of the string. To make things little more difficult, spaces within the original text are replaced with QQ before the text is encrypted. Double Q (QQ) was selected because no English word ends in Q or contains QQ. Additionally the coded message is printed in blocks of six charactersseparated by spaces. The last block might not contain six characters. Write a program that takes the coded text (less than 100 characters), the shift value and prints the decoded original text. Your program must reject any non-valid value for shift and display an error message “INVALID SHIFT VALUE”. Assume all characters are upper case. Test your program for the following data and some data that you have coded, using the rules given above: SAMPLE DATA: 1. INPUT: CODED TEXT: “UHINBY LKKQCH HYLKK” SHIFT: 7 OUTPUT: DECODED TEXT: ANOTHER VALUE 2. INPUT: CODED TEXT: “RUIJGG EVGGBK SAGG” SHIFT: 11 OUTPUT: DECODED TEST: BEST OF LUCK 3. INPUT: CODED TEXT: “DKSMMW NAMMUK QMM” SHIFT: 29 OUTPUT: INVALID SHIFT VAULE.
-
WAP to count vowels, Upper Case Characters and Lower case characters present in the string.
-
WAP to count palindrome words present in the string.
-
WAP to count words that start and ends with vowel.
-
WAP to sort words present in the string lexicographically.
-
WAP to check whether any string contains digits or not.
-
WAP to count vowels present in each word of the string.
-
WAP to find the permutation of a string.
-
WAP a program to find longest palindrome in a string?
-
WAP to return highest occurred character in a String?
-
WAP to check if a String is valid shuffle of two String? Suppose You are given 3 strings: first, second, and third. third String is said to be a shuffle of first and second if it can be formed by interleaving the characters of first and second String in a way that maintains the left to right ordering of the characters from each string. For example, given first = "abc" and second = "def", third = "dabecf" is a valid shuffle since it preserves the character ordering of the two strings. So, given these 3 strings write a function that detects whether third String is a valid shuffle of first and second String.
-
Accept a paragraph of text consisting of sentences that are terminated by either „.‟ (full stop), „!‟ (exclamation mark) or a „?‟ (question mark). Assume that there can be maximum 10 sentences in a paragraph. Write a program to arrange the sentences in increasing order of their number of words.57. Write a program to declare a square matrix A[][] of order (M x M) where „M‟ must be greater than 3 and less than 10. Allow the user to input positive integers into this matrix. Perform the following tasks on the matrix: ( a) Sort the boundary elements in descending order using any standard sorting technique and rearrange them in the matrix. (b) Calculate the sum of the boundary elements. (c) Display the original matrix, rearranged matrix and sum of the boundary elements. Test your program with the sample data and some random data: Example 1 INPUT :M = 4 9 2 1 5 8 13 8 4 15 6 3 11 7 12 23 8 OUTPUT: ORIGINAL MATRIX 9 2 1 5 8 13 8 4 15 6 3 11 7 12 23 8 REARRANGED MATRIX 23 15 12 11 1 13 8 9 2 6 3 8 4 5 7 8 The sum of boundary elements is = 105
-
Write a program to accept the year, month and the weekday name of the 1st day of that month and generate its calendar.
-
A square matrix is said to be a Magic Square, if the sum of each row, each column and each diagonal is same. Write a program to enter an integer number „n‟. Create a magic square of size „n*n‟. Finally, print the elements of the matrix as Magic Square.Note: n <= 5 Sample Input: Enter the size of the matrix : 4 Sample Output: The Magic Matrix of size 4×4 is: Sample Input: Enter the size of the matrix : 5 Sample Output: The Magic Matrix of size 5×5 is:
-
Write a Program in Java to input a 2-D array of size „m*n‟ and print its boundary (border) elements. For example:
-
A simple encryption system uses a shifting process to hide a message. The value of the shift can be in the range 1 to 26. For example a shift of 7 means that A = U, B =V,C = W, etc.i e.Text : A B C D E F G H I J K L M N O P Q R S T U V W X Y Z Code: U V W X Y Z A B C D E F G H I J K L M N O P Q R S T Fist an extra space is added to the end of the string. To make things little more difficult, spaces within the original text are replaced with QQ before the text is encrypted. Double Q (QQ) was selected because no English word ends in Q or contains QQ. Additionally the coded message is printed in blocks of six characters separated by spaces. The last block might not contain six characters. Write a program that takes the coded text (less than 100 characters), the shift value and prints the decoded original text.Your program must reject any non-valid value for shift and display an error message “INVALID SHIFT VALUE)”. Assume all characters are upper case. Test your program for the following data and some data that you have coded, using the rules given above: SAMPLE DATA:
-
INPUT: CODED TEXT : “UHINBY LKKQCH HYLKK” SHIFT : 7 OUTPUT: DECODED TEXT : ANOTHER VALUE
-
INPUT: CODED TEXT : “RUIJGG EVGGBK SAGG” SHIFT : 11 OUTPUT: DECODED TEST : BEST OF LUCK
-
INPUT: CODED TEXT : “DKSMMW NAMMUK QMM” SHIFT : 29 OUTPUT: INVALID SHIFT VAULE
-
Write a Program in Java to input a number in Decimal number system and convert it into its equivalent number in the Binary number system. Note: Binary Number system is a number system which can represent a number in any other number system in terms of 0 and 1 only. This number system consists of only two basic digits i.e. 0 and 1. For Example: 25 in the Decimal number system can be represented as 11001 in the Binary number system.Figure Illustrating Decimal to Binary Number System Conversion
-
Write a Program in Java to print all the Twin Prime numbers within a given range. Note: Twin Prime numbers are a pair of numbers which are both prime and their difference is
Example: Twin Prime numbers in the range 1 to 100 are : (3,5) (5,7) (11,13) (17,19) (29,31) (41,43) (59,61) (71,73)
-
Caesar Cipher is an encryption technique which is implemented as ROT13 („rotate by 13 places‟). It is a simple letter substitution cipher that replaces a letter with the letter 13 places after it in the alphabets, with the other characters remaining unchanged. Write a program to accept a plain text of length L, where L must be greater than 3 and less than 100. Encrypt the text if valid as per the Caesar Cipher. Test your program with the sample data and some random data: Example 1 INPUT : Hello! How are you? OUTPUT : The cipher text is: Uryyb? Ubj ner lbh? Example 2 INPUT : Encryption helps to secure data.OUTPUT : The cipher text is: Rapelcgvba urycf gb frpher qngn. Example 3 INPUT : You OUTPUT : INVALID LENGTH
-
A Circular Prime is a prime number that remains prime under cyclic shifts of its digits. When the leftmost digit is removed and replaced at the end of the remaining string of digits, the generated number is still prime. The process is repeated until the original number is reached again. A number is said to be prime if it has only two factors I and itself.
-
WAP to perform bubble sort and selection sort.
-
WAP to find common elements in two array.
-
WAP to reverse singly linked list.
-
WAP to find maximum repeated word in the file.
70.WAP to implement hash code and equals. -
WAP to find longest substring without repeating characters.
-
WAP to sort a stack using temporary stack.
-
WAP to get distinct elements from an array by avoiding duplicate elements.
-
WAP for insertion sort in java.
-
WAP to check whether a given number is binary or not?
-
WAP to remove multiple spaces from the string.
-
WAP to remove HTML tag from the string.
-
WAP to find duplicate numbers from 1 to 1000.
-
WAP to implement linear and binary search.
-
WAP to change cases of the characters present in string.