No video
Frequently Asked Java Program 11: Check Given Number is Prime Or Not
Рет қаралды 239,660
Күн бұрынFrequently Asked Java Program
Check Given Number is Prime Or NotPrime Number:
------------------------------
Natural Number greater than 1
Which has only 2 factors 1 and itself
19 1 and 19 Prime Number
28 1,2,4,7,14,28 Not a Prime Number
Examples: 2, 3, 5, 7, 11, 13, 17..
#########################
Udemy Courses:
#########################
Manual Testing+Agile with Jira Tool
************************************
► shorturl.at/xNXZ4
Selenium with Java+Cucumber
********************************
► shorturl.at/aIKMW
Selenium with Python & PyTest
********************************
► shorturl.at/ELW09
Selenium with python using Robot framework
****************************************
► shorturl.at/bcDPZ
API Testing(Postman, RestAssured & SoapUI)
*****************************************
► shorturl.at/uAWY7
Web & API Automation using Cypress with Javascript
********************************************
► rb.gy/4uum2n
Playwright with Javascript
**************************
► shorturl.at/gALZ1
Jmeter-Performance Testing
************************
► rb.gy/ocj7r2
SDET Essencials(Full Stack QA)
*************************
► rb.gy/hlnf2v
Appium-Mobile Automation Testing
************************************
► rb.gy/wmzv64
Java Collections
*****************
► bit.ly/3S66ezE
Python Programming
*********************
► urlis.net/gdsf...
Cucumber BDD Framework
***************************
► bit.ly/3F7d69r
Protractor with Javascript
***************************
► urlis.net/4udd...
####################################
KZfaq Playlists:
####################################
Manual Testing & Agile
***********************
► bit.ly/3ujvaYa
► bit.ly/3OYzxQj
SQL
*************************
► bit.ly/3R6XjeG
► bit.ly/3nE0a1s
► bit.ly/3IeKuuJ
linux & Shell Scripting
**********************
► bit.ly/3up1Z6a
► bit.ly/3nzvGxx
Java
**********************
► bit.ly/3R9QfOs
► bit.ly/3AoRMKM
► bit.ly/3IbTTDn
► bit.ly/3ybXInv
► bit.ly/3yCoHdw
Selenium With Java+Cucumber
********************************
► bit.ly/3P2FMm4
► bit.ly/3yhiIt4
► bit.ly/3uokzet
► bit.ly/3a7XIND
► bit.ly/3umN2S9
► bit.ly/3aar7GW
► bit.ly/3y9kD2S
► bit.ly/3uhLskn
Python
********************************
► bit.ly/3agNgU0
► bit.ly/3NJNnoy
► bit.ly/2CTQ4mR
► bit.ly/3OIYWh1
Selenium With Python,Pytest&Behave
***************************************
► bit.ly/3OHHoC9
► bit.ly/3IeNLdv
► bit.ly/2J4tPeT
► bit.ly/3ydSkAq
Selenium With Python Using Robert Framework
(Web&API Testing)
*************************************************
► bit.ly/3nUvlpr
► bit.ly/3nUvE3z
API Testing (Postman,SoapUi,&Rest Assured)
**********************************************
► bit.ly/3OXacWY
► bit.ly/3yh0UhE
► bit.ly/3nC9DWQ
► bit.ly/3yGfhNS
► bit.ly/3OJa11H
► bit.ly/3P2slCC
Mobile App Testing Appium
****************************
► bit.ly/3Al49HG
Performance Testing Jmeter
*******************************
► bit.ly/3nz4fE7
Maven,Jenkins,Git,Github,CI/CD
*******************************
► bit.ly/3P16HPj
► bit.ly/3yhlUVA
► bit.ly/3afYfwT
► bit.ly/3yGzweG
► bit.ly/3yF73Ws
► bit.ly/3NCOmH7
SQL,DB Testing&ETL,Bigdata
*******************************
► bit.ly/3NKOcNY
► bit.ly/3OVpDyI
► bit.ly/3NEvUy0
► bit.ly/3IryxlT
► bit.ly/3RkWBLh
JavaScript Based Automation Tools
********************************
► bit.ly/3nUx51X
► bit.ly/3AqI6Q0
► bit.ly/3yeurbT
► bit.ly/3ujzpTK
Selector Hub Tools
********************
►rb.gy/h3h424
GraphQL
******************
► rb.gy/sj3gys
Cypress API Testing
********************
► shorturl.at/fjKPX
Cypress Web Testing
**********************
► shorturl.at/agjlK
Playwright with Javascipt
**************************
► shorturl.at/adSTY
#PrimeCheck
#PrimeOrNot
#PrimeTest
#IsItPrime
#PrimeNumber
#NumberTheory
#Mathematics
#NumberProperties
#Primality
#NumberAnalysis
#PrimeAlgorithm
#NumberDivisibility
#NumberTheory101
#NumberPuzzles
#MathPuzzles
#PrimeChallenge
#MathHelp
#NumberCuriosity
#MathEnthusiast
#NumberQuiz
#PrimeSieve
#NumberPatterns
#PrimeExploration
#MathGeek
#PrimeDiscovery
#NumberInvestigation
#PrimeInquiry
#MathMagic
#PrimeWisdom
#NumberInsight
#PrimeQuest
#MathWhiz
#PrimeInsights
#NumberMagic
#PrimeJourney
#MathChallenge
#NumberAdventures
#PrimeJungle
#MathWonders
#PrimeInspection
#NumberPioneers
#MathExploration
#PrimeHunters
#NumberMysteries
#PrimeOdyssey
#MathPioneers
#NumberGenius
#PrimeVenture
#MathAdventures
#NumberGeniuses
@neerajk_10 3 жыл бұрын
Good explanation. But I think we should further optimize it by keeping the limit to i 2. If yes, immediately exit the loop. This will save a lot of time for big numbers.
@rishabhbillore7979 2 жыл бұрын
no bro what if i input 5 than it will only divide 5 with 1 and 2 so the count will be 1 only so it will give output that 5 is not prime number
@sirmonke8946 Жыл бұрын
year old comment but it should be i
@akkiroy5871 Жыл бұрын
@@rishabhbillore7979 we can change the condition as If(count==1) { System.out.println("prime no."); }
@HarshTV97 2 жыл бұрын
Lets simplify this program::- main() { int num=10; int count=0; for(int i=2;i
@NuanDaa 2 жыл бұрын
this gives a result 9 is a prime number which in not
@duggirambabu7792 2 жыл бұрын
if(num%i==0) { count=1; break; }
@iamms351 3 жыл бұрын
Please add star pattern questions and metrics multiplication in this series
@EdClarkHYCT 4 жыл бұрын
Great video! Awesome solution! Keep up the great work!!👌👍👏
@sdetpavan Жыл бұрын
Thanks
@arabindamohanty2190 4 жыл бұрын
Really the way u explain I understood all the program 🙏🙏🙏
@sdetpavan Жыл бұрын
Thanks
@samiullah2039 4 жыл бұрын
not palindrome but prime, small fix needed, Rest great explaination
@ravalipanja5194 4 жыл бұрын
Yeah..
@pravinbalwante3959 Жыл бұрын
first use "if". condition for number greater than 1 and then take inner if for scond condition that is (number divided by 2 it give remainder 1) and print statment for inner if is (it is prime number) otherwies take else (not prime)
@johnnyjohn9134 4 жыл бұрын
You are a great teacher! Tell me please when do You LL make java and c++ pe phyton tutorials for begginers?!
@lakshmidevilakshmidevi3984 Жыл бұрын
Thanks for the clear explanation Sir
@sdetpavan Жыл бұрын
Welcome
@theoneinyou2233 Жыл бұрын
simply go like this public static String isPrime(int n) { for(int i=2;i
@sweetyraghav9637 Жыл бұрын
Superb explanation sir , really loved ur videos and very useful keep going
@sdetpavan Жыл бұрын
Thanks
@SUNNU-wg1sq 7 ай бұрын
Great explanation sir....Thank you
@sdetpavan 6 ай бұрын
Welcome
@kaneezfatma4935 4 жыл бұрын
Thnxx alot sir for explaining and clearing our logic
@sdetpavan Жыл бұрын
Welcome
@sirmonke8946 Жыл бұрын
//This is an old video but I think this is a better solution class Main { public static void main(String[] args) { int num = 3; boolean isPrime = true; //default for (int i=2; i
@kassasuresh3909 Жыл бұрын
Ur way of teaching is verygood.
@vineelavineelapilla4117 Ай бұрын
Thank you so much Sir😊
@sdetpavan Ай бұрын
Welcome
@Rhg2204 2 жыл бұрын
can we just loop till num/2 and make if statement to count=1? it will also show if its prime or not
@RajeshPasupuleti-xn5ti Жыл бұрын
In if condition use if(count>=2) This gives good results
@sanjayyadav-xe7mf 2 жыл бұрын
best solution thanks a lot
@sdetpavan 2 жыл бұрын
Most welcome
@sangireddyeswarreddy1787 3 жыл бұрын
Iam very much loved your way of explanation ❤️❤️❤️❤️❤️❤️ .
@sdetpavan Жыл бұрын
Thanks
@parshu3238 3 жыл бұрын
This is grate explation for understand but we are using lot of loop, we should consider big O notation as well
@datareport1582 Жыл бұрын
Nice explanation
@sdetpavan Жыл бұрын
Thanks
@vijayalakshmisuren3152 2 жыл бұрын
Very Good explanation... Thank you...
@sdetpavan 2 жыл бұрын
Most welcome
@JanuJanu-iz7vw 2 жыл бұрын
Super explanation sir
@sdetpavan 2 жыл бұрын
thanks
@start1learn-n171 4 ай бұрын
TQ
@sdetpavan 4 ай бұрын
Welcome
@gauri992 3 жыл бұрын
ur the best sir
@mahalakshmi-or9iq 2 жыл бұрын
Excellent Explanation
@sdetpavan 2 жыл бұрын
Thanks
@maheshdeore7330 Жыл бұрын
Good Explanation
@sdetpavan Жыл бұрын
Thanks
@prasana98 Жыл бұрын
excellent explanation sir but you've mentioned 2 is not a prime number. that's wrong. 2 is a Prime number.
@kmkbabu3 3 жыл бұрын
Excellent bro
@lakshmidevilakshmidevi3984 Жыл бұрын
Best playlist .Thank you Sir
@surya-ow4wr 2 жыл бұрын
Not understood if(count ==2)
@SanjayVerma-qd3ur 3 жыл бұрын
Explain tracing also
@tejajami6729 9 ай бұрын
sir, ones explain the print the 20th prime number program
@aries2aqua 2 жыл бұрын
Thank you
@sdetpavan 2 жыл бұрын
welcome
@gautampandey1685 10 ай бұрын
superbb
@sdetpavan 10 ай бұрын
Thanks
@UmmayamanAman 2 ай бұрын
Prime number with in a range ?
@vikashkr14296 6 ай бұрын
Sorry to interrupt you but till 5:33 you are talking about palindrome number and your title is not matching with our voice. I can't imagine how did you uploaded this video.
@kotaanirudh1388 5 ай бұрын
noob
@gokulkrish8139 3 жыл бұрын
Why this can't be put in Scanner Class??
@yashwantchawan96 Жыл бұрын
We can bro❤
@satishgollu9106 2 жыл бұрын
U r explaining prime number.... Not palindrome number🤷♂️
@yggamingtech6109 Жыл бұрын
How to print range of prime numbers
@prasadbuddhala758 4 жыл бұрын
Good
@sdetpavan Жыл бұрын
Thanks
@aloksinghkushwaha4615 3 жыл бұрын
how to find total prime number in range
@aisumolda6794 2 жыл бұрын
You said Prime number As a Polindrome Its not correct
@sdetpavan 11 ай бұрын
right
@preetiparnasahoo5084 2 жыл бұрын
Efficient code: public class PrimeNumber { public static void main(String[] args) { int n = 27; if (n < 2) { System.out.println("Not prime"); return; } for (int i = 2; i * i
@amritsnehi5975 2 жыл бұрын
PALINDROME NUMBER BOL RHE SIR I THINK BY MISTAKE , PRIME NO HOGA NA SIR?
@amritsnehi5975 2 жыл бұрын
I WATCHED YOUR ALL VIDEOS OF THIS PLAYLIST, REALLY AMAZING CONTENT, I THINK THIS PLAYLIST WILL EXPERT TO ME IN JAVA, U ARE THE GOD OF MY LIFE DURING THIS PERIOD TEACHING JAVA,
@ghareluupaylearnings 3 ай бұрын
Lol 😂😂 explaining prime number and showing palindrome number 😂
@kvelez 11 ай бұрын
package javaapplication23; import java.util.Scanner; public class JavaApplication23 { public static void main(String[] args) { Scanner scan = new Scanner(System.in); System.out.println("Num: "); int n = scan.nextInt(); String value = ""; for (int i = 2; i
@shashankdwivedi4354 3 жыл бұрын
Please explain
@kaneezfatma4935 4 жыл бұрын
Palindrome number 🤭🤭
@ashubtech9911 3 жыл бұрын
In this large world....no can appreciate one's success....but they will definitely identify one's mistake....use common sense and appreciate him....
@based1708 Жыл бұрын
This comment is so funny kek.
@priyanshumodiani_007 9 ай бұрын
😂
@hemmishra1102 Жыл бұрын
import java.util.Scanner; public class PrimeNumber { public static void main(String[] args) { System.out.println("Enter a number:"); Scanner sc=new Scanner(System.in); int num ; num =sc.nextInt(); int i=1; int count=0; if (num!=1) { while (i
@lakshmidevilakshmidevi3984 Жыл бұрын
Very nice explanation
@sdetpavan Жыл бұрын
Thanks
SDET- QA
Рет қаралды 118 М.
SDET- QA
Рет қаралды 164 М.