Quiz Maker LogoMake your own QuizCopy & Edit
Make your own quizManage my QuizzesPlans / FeaturesGuides and HelpContactPrivacy & Security

Software quizes

Let ∑={a,b} . Identify the correct regular expression corresponding to the language L defined by the set of all words over ∑ that begin and end with ab .
The regular expression for L is b∗.a.b∗.
The regular expression for L is b.(a+b).b.
The regular expression for L is b.(a+b)∗.b.
The regular expression for L is b.(a.b)∗.b.
Let ∑={a,b,c} . Identify the language of words generated by the regular expression (a+b)∗.c.(a+b) . Choose the best match from the options given below.
The language is the set of all words that contain at least one c .
The language is the set of all words where the second last letter is a c .
The language is the set of all words that end with an a or a b .
The language is the set of all words that contain exactly one c .
What do regular expressions specify in the syntax of a high-level programming language?
The regular expressions specify how characters form tokens.
The regular expressions specify the characters, tokens and phrases.
The regular expressions specify how tokens form phrases.
The regular expressions specify the entire syntax of a programming language.
While doing syntax-based mutation testing, do we use the underlying grammars to generate both valid and invalid strings?
Yes.
No
In mutation testing, when do we say that a mutant is killed by a test case t ?
If the test case t can be executed on both the ground string and the mutant, then we say that the mutant is killed by t .
If the test case t can be executed on the ground string and not on the mutant, then we say that the mutant is killed by t .
If the test case t can be executed on the mutant and not on the ground string, then we say that the mutant is killed by t .
If the test case t can be executed on both the ground string and the mutant and the output produced is different, then we say that the mutant is killed by t .
If a particular mutant of a ground string results in a program that is syntactically invalid, can we say that the mutant is useful?
The syntactically invalid mutant is not useful as it cannot be complied and used for testing.
The syntactically invalid mutant can be trivially killed by any test case and hence is not useful.
The syntactically invalid mutant is such that no test case can kill it and so, it is not useful.
The syntactically invalid mutant can be useful or not based on the tester's goals.
State true or false: We can increase the mutation score and the effectiveness of mutation testing by applying more than one mutation operator at a time to test source code.
True
False
Suppose we have a statement if(x>y+5) in a program and we apply mutation twice to this statement. In the first mutation, we replace the statement with if(x<=y+5) and in the second mutation, we replace the statement with if(true). Which of the following options represent the correct mutation operation(s) of the given statement?
Both the operations correspond to relational operator replacement.
The first one corresponds to relational operator replacement and the second one corresponds to Boolean constant replacement.
Both the operations correspond to arithmetic operator replacement.
Both the operations correspond to logical operator replacement.
What does the mutation operator failonZero() help to test for, in a program?
It helps to test if there is a possibility of an error due to a particular expression evaluating to zero.
It forces an expression to evaluate to zero and tests for possible errors due to its use in operations like division.
It helps to reach a particular statement and check what happens if it fails.
It is a special function that is used to test the correctness of the division operation.
Which of the following statements are true when it comes to comparing mutation testing with graph-based and logic-based testing?
Mutation testing subsumes all the structural graph coverage criteria and only predicate coverage in logic-based testing.
Mutation testing subsumes node and edge coverage in graph-based testing and predicate coverage in logic-based testing.
Mutation testing does not subsume any graph coverage criterion and subsumes predicate coverage in logic-based testing.
Mutation testing does not subsume any graph or any logic-based coverage criterion.
{"name":"Software quizes", "url":"https://www.quiz-maker.com/QPREVIEW","txt":"Let ∑={a,b} . Identify the correct regular expression corresponding to the language L defined by the set of all words over ∑ that begin and end with ab ., Let ∑={a,b,c} . Identify the language of words generated by the regular expression (a+b)∗.c.(a+b) . Choose the best match from the options given below., What do regular expressions specify in the syntax of a high-level programming language?","img":"https://www.quiz-maker.com/3012/images/ogquiz.png"}

More Quizzes

Vanessa’a Dinner + Drinks Saturday 26th Aug
420
English Testing/Vocabulary
20100
Eeveelution thinggy which one are you
630
PAGTATAYA-M.2-Q.4
8477
Prefix & Suffix
168101
What type of toxic masculinity are you
843433
Colonists vs. British. Which side are you?
1050
Section 1 ( quiz)
52450
Present perfect/ past simple
1050
Question 122
100
Altavozchile - Política de privacidad. © Copyright Todos los derechos reservados. Provincialnoticias impactodiario
100
Mennyit tudsz Horvátországról?
520
Quiz Maker Logo Make your own Quiz
Powered by: Quiz Maker