The strategy used to reduce the number of tree branches and the number of static evaluation applied in case of a game tree is
Anonymous Quiz
27%
A.)minmax strategy
49%
B.)alpha beta pruning strategy
17%
C.)constraint satisfaction strategy
7%
D.)static max strategy
UGC NTA NET COMPUTER SCIENCE pinned «A latch can be constructed using two cross coupled»
UGC NTA NET COMPUTER SCIENCE pinned «The strategy used to reduce the number of tree branches and the number of static evaluation applied in case of a game tree is»
UGC NTA NET COMPUTER SCIENCE pinned «How many states a process can be in?»
Are we building the right product? This statement refers to
Anonymous Quiz
29%
A.)verification
19%
B.)software testing
33%
C.)validation
19%
D.)software quality assurance
UGC NTA NET COMPUTER SCIENCE pinned «Are we building the right product? This statement refers to»
The cyclomatic complexity is given by V (G)=
Anonymous Quiz
5%
a.)E-N
55%
b.)E+N-2
36%
c.)E-N+2
5%
d.)E+N
For a function of two variables, boundary value analysis yields how many test cases?
Anonymous Quiz
18%
A.)n+4
49%
B.)4n+1
24%
C.)4n+3
10%
D.)n+3
UGC NTA NET COMPUTER SCIENCE pinned «The cyclomatic complexity is given by V (G)=»
UGC NTA NET COMPUTER SCIENCE pinned «For a function of two variables, boundary value analysis yields how many test cases?»
UGC NTA NET COMPUTER SCIENCE pinned «The header in ATM cell is of how many bytes?»
Dijikstra banker algorithm is used to solve
Anonymous Quiz
17%
A.)Mutual exclusion
27%
B.)Deadlock recovery
52%
C.)Deadlock avoidance
4%
D.)Cache coherence
UGC NTA NET EXAM WILL BE HELD FROM OCT 17 TO 25 2021 as per an official update.