This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
A prime triplet is a collection of three Prime Numbers in the form | |
(p, p + 2, p + 6) or (p, p + 4, p + 6) | |
Write a program to input M and N where M < N and , M and N less than 50. | |
Find and Display all the possible Prime Triplets in the range M and N | |
where the value of M and N entered by the user. | |
Eg: | |
INPUT : |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
Write a Program to input a square Matrix of size between 2 to 10. | |
Find if the Matrix is symmetric or not. | |
Find the Sum to the Diagonals of the Matrix | |
EG: | |
INPUT: | |
Size : 3 | |
OUTPUT: |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
name: Flutter Test Analysis Build | |
on: | |
push: | |
branches: [master] | |
pull_request: | |
branches: [master] | |
jobs: | |
flutter_test: |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
Generate and print lucky Number for a Given Number N | |
INPUT: 25 | |
OUTPUT: | |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 | |
1 3 5 7 9 11 13 15 17 19 21 23 25... eleminate the 2nd number from the list | |
1 3 7 9 13 15 19 21 25... eleminate the 3rd number from the list | |
1 3 7 13 15 19 25... eleminate the 4th number from the list |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
Write a program to accept a number using int accept() function | |
and check whether the number is prime or not using recursion. | |
*/ | |
import java.util.*; | |
class PrimeCheckRecursive { | |
int accept() { |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
Write a program to accept a number | |
and calculate the factorial of that number using recursion. | |
INPUT: 5 | |
OUTPUT: 5 * 4 * 3 * 2 * 1 = 120 | |
*/ | |
import java.util.*; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
Write a program to accept a number | |
and find the sum of its digits using recursion. | |
INPUT: 23567 | |
OUTPUT: 2+3+5+6+7 = 23 | |
*/ | |
import java.util.*; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
Write a program to accept a word using String accept() function | |
and count the number of vowels in the word using int vowels(String, int) recursive function | |
and display the word and the frequency of vowels in the word using void display(String, int) function. | |
*/ | |
import java.util.Scanner; | |
class VowelsRecursion { |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
Write a program to accept a number | |
and print the number is a perfect number or not using a recursion | |
and print the result. | |
INPUT: 6 | |
OUTPUT: 6 is a perfect number | |
*/ | |
import java.util.Scanner; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
Write a program to accept a sentence | |
and the number of words in the sentence. | |
INPUT: Kolkata is a nice City | |
OUTPUT: Number of Words: 5 | |
*/ | |
import java.util.Scanner; |