Quiz on Java Regular Expression

DataFlair Team

2 years ago

Get Job-ready: Java Course with 45+ Real-time Projects! - Learn Java

Unleash the hidden potential within Java strings! Regular expressions, often abbreviated as regex, are powerful tools that unlock the ability to manipulate and decipher text with incredible precision. Mastering regex empowers you to search for specific patterns within strings, extract valuable data, and even replace unwanted elements.

This interactive quiz is designed to be your personal training ground for regex mastery. By tackling real-world scenarios presented in the quiz, you’ll have the opportunity to apply your existing regex knowledge and identify areas where you can further refine your skills.

Whether you’re a seasoned Java developer well-versed in the intricacies of code, or just embarking on your programming journey, this quiz serves as your gateway to becoming a regex pro. So, are you ready to unlock the true power of text manipulation in Java? Take the quiz, challenge yourself, and watch your regex skills soar! Let’s test your knowledge.

Time limit: 0

Quiz Summary

0 of 15 Questions completed

Questions:

Information

You have already completed the quiz before. Hence you can not start it again.

Quiz is loading…

You must sign in or sign up to start the quiz.

You must first complete the following:

Results

Quiz complete. Results are being recorded.

Results

0 of 15 Questions answered correctly

Your time:

Time has elapsed

You have reached 0 of 0 point(s), (0)

Earned Point(s): 0 of 0, (0)
0 Essay(s) Pending (Possible Point(s): 0)

Categories

Not categorized 0%

Current
Review / Skip
Answered
Correct
Incorrect

Question 1 of 15

1. Question
class RegularExpressions {

public static void main ( String args [ ] )

{

Pattern p = Pattern.compile(“..s”);

Matcher m = p.matcher(“was”);

boolean b = m.matches();

system.out.println(b);

}

}
- True
- False
- Not the correct syntax.
- Compilation error.
Correct

Incorrect
Question 2 of 15

2. Question
class RegExp {

public static void main ( String args [ ] )

{

boolean b = Pattern.compile(“..d”).matcher(“adsense”).matches();

system.out.println(b);

}

}
- String pattern contains only characters input string contains more than three.
- The character d is located at 3rd position in pattern whereas it is at 2nd position in input.
- b has a default value as false.
- Syntax is not correct to find a match so it displays false.
Correct

Incorrect
Question 3 of 15

3. Question
Which of the following is not a syntax to find the strings are equal to each other ?
- Pattern p = Pattern.compile("String pattern"); Matcher m = p.matcher("input string"); boolean b = m.matches();
- boolean b = Pattern.compile("string pattern").matcher("input string").matches();
- boolean b = Pattern.matches(“String pattern", "Input string");
- boolean b = ( “ String Pattern ” = = ” Input String ” );
Correct

Incorrect
Question 4 of 15

4. Question
class Sample {

public static void main ( String args [ ] )

{

System.out.println(Pattern.matches(“[a-d[m-p]]”, “DataFlair”));

}

}
- Any characters from a to p
- Any character between d and m.
- Any character between a to d or m to p.
- No characters between a to d or m to p.
Correct

Incorrect
Question 5 of 15

5. Question
class RegExpression {

public static void main ( String args [ ] )

{

boolean b = Pattern.matches(“[d]?”, “DataFlair”);

if(b == true )

{

system.out.println(“D is present only once in the word DataFlair”);

} else {

system.out.println(“D is present more than once in the word DataFlair”);

}

}

}
- D is present only once in the word DataFlair.
- D is present more than once in the word DataFlair.
- True
- Compilation error.
Correct

Incorrect
Question 6 of 15

6. Question
Which of the following programs perform a search operation for whether the given character is present n times in the given input string ?
- class RegExp { public static void main ( String args [ ] ) { boolean b = Pattern.matches("[d]{n,}", "DataFlair"); } }
- class RegExp { public static void main ( String args [ ] ) { boolean b = Pattern.matches("[d]*", "DataFlair"); } }
- class RegExp { public static void main ( String args [ ] ) { boolean b = Pattern.matches("[d]{n}", "DataFlair"); } }
- class RegExp { public static void main ( String args [ ] ) { boolean b = Pattern.matches("[d]?", "DataFlair"); } }
Correct

Incorrect
Question 7 of 15

7. Question
class RegexCharacterClass {

public static void main ( String args [ ] )

{

boolean b = Pattern.matches(“[^xyz]”, “DataFlair”);

system.out.println(b + “DataFlair”);

}

}
- It checks whether xyz is present in the given string.
- Checks for Capital XYZ in the program.
- Checks whether the given input string contains characters from x through z.
- It checks whether xyz is not present in the input string.
Correct

Incorrect
Question 8 of 15

8. Question
class Exception {

public static void main ( String args [ ] )

{

boolean b = Pattern.matches( “DataFlair”);

system.out.println(b);

}

}
- Pattern is not declared anywhere.
- There is no string pattern given to match with the input string.
- Boolean values cannot be printed without any function.
- No errors in the program.
Correct

Incorrect
Question 9 of 15

9. Question
class RegExpressionExample {

public static void main ( String args [ ] )

{

Scanner sc = new Scanner(System.in);

char Input = sc.nextChar();

System.out.println( Pattern.matches(“\\D+”, “Input”));

}

}
- DataFlair1
- DataFlair0
- DataFlair
- Data+Flair0
Correct

Incorrect
Question 10 of 15

10. Question
1. Which matcher class in Regular expression is used to find the next expression that matches the given pattern from the given first Number ?
- boolean find ( int start )
- boolean matches ( )
- int start ( )
- boolean find ( )
Correct

Incorrect
Question 11 of 15

11. Question
class Example {

public static void main ( String args [ ] )

{

boolean b = Pattern.matches(“[a]{3,5}”, “DataFlair”));

System.out.println(b);

}

}
- True , Because a is present at 3rd position.
- False , a is not present more than 3 and less than 5.
- False , a is more than once present in the string.
- True , Because a is present at least 3 times in the string and not more than 5 times.
Correct

Incorrect
Question 12 of 15

12. Question
What should be the argument passed to the class static boolean matches ( ) to get the respected output ?
- String regex.
- char sequence input.
- Both a and b.
- None of these.
Correct

Incorrect
Question 13 of 15

13. Question
Which of the following programs is used to search a string for a non-word character ?
- class NonWord { public static void main ( String args [ ] ) { boolean b = Pattern.matches(“\\w” , “input string “ ); } }
- class NonWord { public static void main ( String args [ ] ) { boolean b = Pattern.matches(“\\d” , “input string “ ); } }
- class NonWord { public static void main ( String args [ ] ) { boolean b = Pattern.matches(“\\W” , “input string “ ); } }
- class NonWord { public static void main ( String args [ ] ) { boolean b = Pattern.matches(“\\D” , “input string “ ); } }
Correct

Incorrect
Question 14 of 15

14. Question
What will be the output of the Static pattern compile ( String regex) class in Java ?
- Compare and return instances of the pattern.
- Creates a matcher class that matches input patterns.
- Returns regex pattern.
- Split the input into strings and match the pattern.
Correct

Incorrect
Question 15 of 15

15. Question
class Regular {

public static void main ( String args [ ] )

{

boolean b = Pattern.matches(“[X]+” , “input string”);

system.out.println(b);

}

}
- Character x occurs not more than 1 time.
- Character x occurs more than 1 times.
- Character x occurs more than 0 times.
- Character x occurs n times.
Correct

Incorrect

Summary:

Regular expressions, or regex for short, are powerful tools in any Java developer’s arsenal. They allow you to wield the magic of pattern matching, sifting through mountains of text data with pinpoint accuracy. Whether you’re a seasoned regex warrior or just starting to explore this fascinating realm, this quiz is designed to be your ultimate training ground.

Dive deep into a series of interactive challenges that will test your ability to craft complex patterns, pinpoint specific text elements, and extract valuable data from seemingly chaotic strings.

This is no ordinary quiz; it’s an immersive learning experience designed to not only assess your current understanding but also push your boundaries and unlock the full potential of regex in your Java programming.

So, are you ready to put your skills to the test? Embrace the challenge, conquer each question, and watch your regex mastery blossom. You’ll emerge from this experience not just with a clearer understanding of your strengths and weaknesses, but also with the confidence to tackle any text manipulation task Java throws your way!

Quiz Summary

Information

Results

Results

Categories

1. Question

2. Question

3. Question

4. Question

5. Question

6. Question

7. Question

8. Question

9. Question

10. Question

11. Question

12. Question

13. Question

14. Question

15. Question

Summary: