Engineering
Engineering MCQs With Answers
0 Engineering MCQs for CSS, PPSC, FPSC, NTS and entry-test preparation. Take a scored quiz instead →
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)
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
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)
Software static code analysis metric that counts the total number of decision statements ($D$) in a function to compute Cyclomatic Complexity using $V(G) = D + 1$ is:
AMcCabe's Cyclomatic Complexity Formula
BHalstead's Volume Metric
CHenry-Kafura Information Flow
DChidamber & Kemerer Metric
If an integer input field accepts values between 10 and 100 inclusive, the critical boundary values for Boundary Value Analysis (BVA) are:
A10, 50, 100
B0, 10, 100, 1000
C9, 10, 100, 101
D5, 15, 95, 105