Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 10.

Size: px

Start display at page:

Download "Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 10."

Clinton Jefferson
5 years ago
Views:

1 Code No: 126VR Set No. 1 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B.Tech. III Year, II Sem., II Mid-Term Examinations, April-2018 SOFTWARE TESTING METHODOLOGIES Objective Exam Name: Hall Ticket No. Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 10. A I Choose the correct alternative: 1. What is the span of the number space if the nice domains are complete? [ ] a) infinity to +infinity in some dimensions b) infinity to +infinity in all dimensions c) +infinity to -infinity in all dimensions d) +infinity to -infinity in some dimensions 2. Two successive path segments is expressed by concatenation is known as [ ] a) path b) path sum c) path product d) path expression 3. Which of the following is the disadvantage of Decision Table? [ ] a) Insufficient program logic b) Implicit relation to specification c) No clarity d) Low level maintainability 4. If there are k predicates, then the maximum number of predicate cases possible are [ ] a) 2 k b) 2k c) 2k - 1 d) 2 k The main step in achieving the node reduction is [ ] a) cross term b) parallel term c) loop term d) serial term 6. The order of grouping in KV charts would be [ ] a) Islands, pairs, quads, octets b) Octets, islands, pairs, quads c) Octets, quads, pairs, islands d) Quads, pairs, islands, octets 7. The bugs in the State graphs are due to [ ] a) impossible states b) no. of states c) equivalence states d) all the above 8. Which of the following is not the condition of inessential finite state behavior? [ ] a) It is obtained from flow graph b) expression of exit = 1 c) It is obtained from decision table or tree d) It can be obtained by parallel program in dataflow machine 9. In graph matrices, if the link does not exists between nodes, it is represented by [ ] a) 1 b) 0 c) Φ d) null 10. The advantages of node reduction algorithm in matrices compared to that in graph is [ ] a) Redrawing of graphs is not necessary b) Errors would be less c) It is more methodical in graphs d) All the above Cont 2

2 Code No: 126VR :2: Set No. 1 II Fill in the Blanks 11. Domain testing is a form of testing. 12. Nice domains should not be. 13. Domains are most useful in testing. 14. If domain boundaries are differed by constant they are known as boundaries. 15. are algebraic representation of sets of paths. 16. The state where no input sequence can reach is known as 17. Contradictory and ambiguous state occurs in case of 18. of a matrix is obtained by adding all decision values and then adding 1 to it. 19. The number of out links a node has can be considered as 20. The automated tools used for Regression testing are and -ooo-

3 Code No: 126VR Set No. 2 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B.Tech. III Year, II Sem., II Mid-Term Examinations, April-2018 SOFTWARE TESTING METHODOLOGIES Objective Exam Name: Hall Ticket No. Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 10. A I Choose the correct alternative: 1. If there are k predicates, then the maximum number of predicate cases possible are [ ] a) 2 k b) 2k c) 2k - 1 d) 2 k The main step in achieving the node reduction is [ ] a) cross term b) parallel term c) loop term d) serial term 3. The order of grouping in KV charts would be [ ] a) Islands, pairs, quads, octets b) Octets, islands, pairs, quads c) Octets, quads, pairs, islands d) Quads, pairs, islands, octets 4. The bugs in the State graphs are due to [ ] a) impossible states b) no. of states c) equivalence states d) all the above 5. Which of the following is not the condition of inessential finite state behavior? [ ] a) It is obtained from flow graph b) expression of exit = 1 c) It is obtained from decision table or tree d) It can be obtained by parallel program in dataflow machine 6. In graph matrices, if the link does not exists between nodes, it is represented by [ ] a) 1 b) 0 c) Φ d) null 7. The advantages of node reduction algorithm in matrices compared to that in graph is [ ] a) Redrawing of graphs is not necessary b) Errors would be less c) It is more methodical in graphs d) All the above 8. What is the span of the number space if the nice domains are complete? [ ] a) infinity to +infinity in some dimensions b) infinity to +infinity in all dimensions c) +infinity to -infinity in all dimensions d) +infinity to -infinity in some dimensions 9. Two successive path segments is expressed by concatenation is known as [ ] a) path b) path sum c) path product d) path expression 10. Which of the following is the disadvantage of Decision Table? [ ] a) Insufficient program logic b) Implicit relation to specification c) No clarity d) Low level maintainability Cont 2

4 Code No: 126VR :2: Set No. 2 II Fill in the Blanks 11. If domain boundaries are differed by constant they are known as boundaries. 12. are algebraic representation of sets of paths. 13. The state where no input sequence can reach is known as 14. Contradictory and ambiguous state occurs in case of 15. of a matrix is obtained by adding all decision values and then adding 1 to it. 16. The number of out links a node has can be considered as 17. The automated tools used for Regression testing are and 18. Domain testing is a form of testing. 19. Nice domains should not be. 20. Domains are most useful in testing. -ooo-

5 Code No: 126VR Set No. 3 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B.Tech. III Year, II Sem., II Mid-Term Examinations, April-2018 SOFTWARE TESTING METHODOLOGIES Objective Exam Name: Hall Ticket No. Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 10. A I Choose the correct alternative: 1. The order of grouping in KV charts would be [ ] a) Islands, pairs, quads, octets b) Octets, islands, pairs, quads c) Octets, quads, pairs, islands d) Quads, pairs, islands, octets 2. The bugs in the State graphs are due to [ ] a) impossible states b) no. of states c) equivalence states d) all the above 3. Which of the following is not the condition of inessential finite state behavior? [ ] a) It is obtained from flow graph b) expression of exit = 1 c) It is obtained from decision table or tree d) It can be obtained by parallel program in dataflow machine 4. In graph matrices, if the link does not exists between nodes, it is represented by [ ] a) 1 b) 0 c) Φ d) null 5. The advantages of node reduction algorithm in matrices compared to that in graph is [ ] a) Redrawing of graphs is not necessary b) Errors would be less c) It is more methodical in graphs d) All the above 6. What is the span of the number space if the nice domains are complete? [ ] a) infinity to +infinity in some dimensions b) infinity to +infinity in all dimensions c) +infinity to -infinity in all dimensions d) +infinity to -infinity in some dimensions 7. Two successive path segments is expressed by concatenation is known as [ ] a) path b) path sum c) path product d) path expression 8. Which of the following is the disadvantage of Decision Table? [ ] a) Insufficient program logic b) Implicit relation to specification c) No clarity d) Low level maintainability 9. If there are k predicates, then the maximum number of predicate cases possible are [ ] a) 2 k b) 2k c) 2k - 1 d) 2 k The main step in achieving the node reduction is [ ] a) cross term b) parallel term c) loop term d) serial term Cont 2

6 Code No: 126VR :2: Set No. 3 II Fill in the Blanks 11. The state where no input sequence can reach is known as 12. Contradictory and ambiguous state occurs in case of 13. of a matrix is obtained by adding all decision values and then adding 1 to it. 14. The number of out links a node has can be considered as 15. The automated tools used for Regression testing are and 16. Domain testing is a form of testing. 17. Nice domains should not be. 18. Domains are most useful in testing. 19. If domain boundaries are differed by constant they are known as boundaries. 20. are algebraic representation of sets of paths. -ooo-

7 Code No: 126VR Set No. 4 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B.Tech. III Year, II Sem., II Mid-Term Examinations, April-2018 SOFTWARE TESTING METHODOLOGIES Objective Exam Name: Hall Ticket No. Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 10. A I Choose the correct alternative: 1. Which of the following is not the condition of inessential finite state behavior? [ ] a) It is obtained from flow graph b) expression of exit = 1 c) It is obtained from decision table or tree d) It can be obtained by parallel program in dataflow machine 2. In graph matrices, if the link does not exists between nodes, it is represented by [ ] a) 1 b) 0 c) Φ d) null 3. The advantages of node reduction algorithm in matrices compared to that in graph is [ ] a) Redrawing of graphs is not necessary b) Errors would be less c) It is more methodical in graphs d) All the above 4. What is the span of the number space if the nice domains are complete? [ ] a) infinity to +infinity in some dimensions b) infinity to +infinity in all dimensions c) +infinity to -infinity in all dimensions d) +infinity to -infinity in some dimensions 5. Two successive path segments is expressed by concatenation is known as [ ] a) path b) path sum c) path product d) path expression 6. Which of the following is the disadvantage of Decision Table? [ ] a) Insufficient program logic b) Implicit relation to specification c) No clarity d) Low level maintainability 7. If there are k predicates, then the maximum number of predicate cases possible are [ ] a) 2 k b) 2k c) 2k - 1 d) 2 k The main step in achieving the node reduction is [ ] a) cross term b) parallel term c) loop term d) serial term 9. The order of grouping in KV charts would be [ ] a) Islands, pairs, quads, octets b) Octets, islands, pairs, quads c) Octets, quads, pairs, islands d) Quads, pairs, islands, octets 10. The bugs in the State graphs are due to [ ] a) impossible states b) no. of states c) equivalence states d) all the above Cont 2

8 Code No: 126VR :2: Set No. 4 II Fill in the Blanks 11. of a matrix is obtained by adding all decision values and then adding 1 to it. 12. The number of out links a node has can be considered as 13. The automated tools used for Regression testing are and 14. Domain testing is a form of testing. 15. Nice domains should not be. 16. Domains are most useful in testing. 17. If domain boundaries are differed by constant they are known as boundaries. 18. are algebraic representation of sets of paths. 19. The state where no input sequence can reach is known as 20. Contradictory and ambiguous state occurs in case of -ooo-

A Answer All Questions. All Questions Carry Equal Marks.Time: 20 Min. Marks: 10.

A Answer All Questions. All Questions Carry Equal Marks.Time: 20 Min. Marks: 10. Code No: 55050 Set No. 1 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD III B.Tech. I Sem., I Mid-Term Examinations, September 2011 LINUX PROGRAMMING Objective Exam Name: Hall Ticket No. A Answer