Software Engineering
Software Engineering MCQs with Answers
Software engineering MCQs with answers and detailed explanations for NTS, GAT, university tests and IT job interviews. SDLC, testing and design covered. Take a scored quiz instead →
The international functional safety standard governing safety-critical electrical/electronic/programmable software systems across industries is:
AISO 9001
BIEEE 830
CIEC 61508
DISO 27001
A top-down deductive safety analysis technique that uses boolean logic diagrams (AND/OR gates) to trace system failure causes to root events is:
AFault Tree Analysis (FTA)
BFailure Mode and Effects Analysis (FMEA)
CCleanroom Verification
DImpact Analysis
If a software task has optimistic estimate $a = 4$ days, most likely $m = 7$ days, and pessimistic $b = 16$ days, its PERT expected duration $T_e$ is:
A7 Days
B9 Days
C8 Days
D10 Days
The systematic technique used to analyze failure modes, their immediate effects on system operation, and criticality ranking is:
AFault Tree Analysis (FTA)
BHazard and Operability Study (HAZOP)
CCause-Effect Analysis
DFailure Mode and Effects Analysis (FMEA)
In PERT scheduling, the variance ($sigma^2$) of a task duration estimate is mathematically given by:
A$sigma^2 = rac{b - a}{6}$
B$sigma^2 = left( rac{b - a}{6}
ight)^2$
C$sigma^2 = rac{b + a}{2}$
D$sigma^2 = (b - m)^2$
In PERT project estimation, the expected activity duration ($T_e$) is calculated using Optimistic ($a$), Most Likely ($m$), and Pessimistic ($b$) estimates as:
A$T_e = rac{a + 4m + b}{6}$
B$T_e = rac{a + m + b}{3}$
C$T_e = rac{a + 2m + b}{4}$
D$T_e = rac{a + 6m + b}{4}$
In Chidamber & Kemerer (C&K) Object-Oriented metrics, Weighted Methods per Class (WMC) measures:
ATotal lines of code in a class
BNumber of subclass children
CSum of complexities of all methods defined within a class
DNumber of inherited interfaces
In C&K OO metrics, Depth of Inheritance Tree (DIT) measures:
AThe total number of subclasses inheriting from a base class
BThe number of private fields
CThe total overriding methods
DThe maximum structural length from the class node to the root of the inheritance hierarchy
In Halstead’s Software Science, program length ($N$) is calculated using total operators ($N_1$) and total operands ($N_2$) as:
A$N = N_1 imes N_2$
B$N = N_1 + N_2$
C$N = log_2(N_1 + N_2)$
D$N = N_1 / N_2$
Testing technique where input data domain is divided into contiguous partitions where software is expected to process all members within a partition identically is:
ABoundary Value Analysis
BCombinatorial Testing
CMutation Testing
DEquivalence Partitioning (EP)