Software Engineering-I MCQs with Answers
Practice important Software Engineering-I MCQs with answers and explanations.
Chapter: 38
Q661:
In string matching, what type of equivalence partition includes "cat" vs. "dog"?
A. Equal
B. Unequal
C. Mixed
D. Boundary
Correct Answer:
B
Chapter: 38
Q662:
What type of flow does a sequence code structure depict?
A. Branching
B. Looping
C. Conditional
D. Sequential
Correct Answer:
D
Chapter: 38
Q663:
What does the first node in an "If" flow graph represent?
A. Loop guard
B. Switch statement
C. Condition check
D. None of the above
Correct Answer:
C
Chapter: 38
Q664:
In an "If" flow graph, what do the nodes next to the first node represent?
A. Successful case and unsuccessful case
B. Loop and condition
C. Sequence and case
D. Condition and sequence
Correct Answer:
A
Chapter: 38
Q665:
Which coding structure allows multiple branches, unlike the "If" structure?
A. Sequence
B. Loop
C. Case
D. None of the above
Correct Answer:
C
Chapter: 38
Q666:
Which flow graph node controls iteration in a while loop?
A. First node
B. Loop guard
C. Last node
D. Sequence node
Correct Answer:
B
Chapter: 38
Q667:
In the context of code structures, what does a "while" loop control?
A. Loop guard
B. Flow end
C. Condition check
D. Case
Correct Answer:
A
Chapter: 38
Q668:
Which graph structure is used for the bubble sort code example?
A. Sequence
B. Flow graph
C. If structure
D. Switch structure
Correct Answer:
B
Chapter: 38
Q669:
In the bubble sort flow graph, which node represents the while loop?
A. Node two
B. Node one
C. Node three
D. Node four
Correct Answer:
B
Chapter: 38
Q670:
The swapping instruction in a bubble sort flow graph is represented by:
A. Node one
B. Node two
C. Node three
D. Node four
Correct Answer:
C
Chapter: 38
Q671:
Path1 in the bubble sort flow graph represents which traversal?
A. 45297
B. 1-2-4-5-1-6
C. 1-2-3-4-5-1-6
D. 1-3-2-6
Correct Answer:
A
Chapter: 38
Q672:
Which paths represent possible paths from start to end in bubble sort?
A. Path1, Path3, Path4
B. Path2, Path3
C. Path1, Path2, Path4
D. All of the above
Correct Answer:
D
Chapter: 38
Q673:
Fill in the blank: In equivalence partitioning, ________ partitions are created to group similar inputs.
A. different
B. distinct
C. equivalent
D. unequal
Correct Answer:
C
Chapter: 39
Q674:
In white box testing, what is primarily tested?
A. User interface
B. Code structure
C. Functionality
D. Database
Correct Answer:
B
Chapter: 39
Q675:
Which coverage scheme ensures every statement in the code is executed at least once?
A. Statement Coverage
B. Branch Coverage
C. Path Coverage
D. Data Coverage
Correct Answer:
A
Chapter: 39
Q676:
The coverage scheme that tests all possible branches of decision structures is known as ______.
A. Statement Coverage
B. Path Coverage
C. Branch Coverage
D. Decision Coverage
Correct Answer:
C
Chapter: 39
Q677:
When N=1, what is one possible path in the looped code example?
A. 45296
B. 1-2-4-1-5
C. 1-3-4-1-5
D. 1-2-3-1-5
Correct Answer:
B
Chapter: 39
Q678:
What does a cyclomatic complexity measure?
A. Code readability
B. Logical complexity
C. Loop count
D. Code efficiency
Correct Answer:
B
Chapter: 39
Q679:
If a program has 8 edges and 6 nodes, what is its cyclomatic complexity?
A. 4
B. 5
C. 6
D. 3
Correct Answer:
A
Chapter: 39
Q680:
What is a good programming practice for managing infeasible paths?
A. Test more cases
B. Use nested loops
C. Minimize infeasible paths
D. Increase variable usage
Correct Answer:
C