Learn more about our help with Assignments: Math
Search & Filtering
Nobody knows yet if P = NP. Consider the language L defined as
follows
L=(0 + 1)* if P=NP
L= φ otherwise
Which of the following statements is true?
(A) L is recursive
(B) L is recursively enumerable but not recursive
(C) L is not recursively enumerable
(D) Whether L is recursive or not will be known after we find out if P = NP
follows
L=(0 + 1)* if P=NP
L= φ otherwise
Which of the following statements is true?
(A) L is recursive
(B) L is recursively enumerable but not recursive
(C) L is not recursively enumerable
(D) Whether L is recursive or not will be known after we find out if P = NP
A channel connecting source and destination has data rate of 1 Mbps and one
way propagation delay of 250 ms. Network uses Go Back-N flow control strategy.
Headers are very short and acknowledgements are always piggybacked onto data
frames. Assume transmission time of ACK is negligible. If frame size is of 125B and if three bit sequence number is used, then determine the maximum achievable channel utilization.
way propagation delay of 250 ms. Network uses Go Back-N flow control strategy.
Headers are very short and acknowledgements are always piggybacked onto data
frames. Assume transmission time of ACK is negligible. If frame size is of 125B and if three bit sequence number is used, then determine the maximum achievable channel utilization.
Given an arbitrary non-deterministic finite automaton (NFA) with N states, the maximum number of states in an equivalent minimized DFA is least
a) N^2
b) 2^N
c) 2N
d) N!
a) N^2
b) 2^N
c) 2N
d) N!
the logic of pumping lemma is a good example of
a)the pigeonhole principle
b)the divide and conquer technique
c)recursion
d)iteration
a)the pigeonhole principle
b)the divide and conquer technique
c)recursion
d)iteration
The language L={0^n 1^n 2^R 3^R where n.k>0} is a:
a) context-sensitive language
b) context-free language
c) regular language
d) recursively enumerable language
a) context-sensitive language
b) context-free language
c) regular language
d) recursively enumerable language
A one-dimensional cellular automaton is seeded (initialized) with the following values at time t0.
....00001010000....
The automaton evolves according to the rule 01010110. What will the automaton look like at time t3?
a) ...00101001100....
b) ...11001000110....
c) ...10101001001....
d) ...01101110110....
e) ...00011011000....
....00001010000....
The automaton evolves according to the rule 01010110. What will the automaton look like at time t3?
a) ...00101001100....
b) ...11001000110....
c) ...10101001001....
d) ...01101110110....
e) ...00011011000....
Given the following rule for the evolution of a cellular automation (a - 1'a1') + (a0 a1'). Which of the following is the binary number representation of the rule?
a) 01001010
b) 00101100
c) 00010000
d) 11001110
e) 01000101
a) 01001010
b) 00101100
c) 00010000
d) 11001110
e) 01000101
There are two strain of flu(F) virus and two types of vaccine. The first vaccine(V1), is 0.85 effective against F1 and 0.70 effective against F2, while the second vaccine(V2) is 0.60 effective against F1 and 0.90 against F2. The public health service is player 1 and nature is player 2. The service has to decide what percentage of vaccines manufactured and made available to the public are of V1 and V2. Determine how the public health service should proceed.
Please apply the gradient form of the Karush-Kuhn-Tucker (KKT) theorem to minimize the function f(x,y) = (x+1)^2 + y^2 over all x>=0, y>=0.
L = Lagrangian.
If, for a given vector x* in C, there is lamda* >= 0 such that L(x*,lamda*) <= L(x,lamda*), for all x in C, and x*_ig_i(x*) = 0, for all i, then x* is feasible and x* solves the primal Convex Programming problem.
If, for a given vector x* in C, there is lamda* >= 0 such that L(x*,lamda*) <= L(x,lamda*), for all x in C, and x*_ig_i(x*) = 0, for all i, then x* is feasible and x* solves the primal Convex Programming problem.
"assignmentexpert.com" is professional group of people in Math subjects! They did assignments in very high level of mathematical modelling in the best quality. Thanks a lot
#339914 on Dec 2023
#339914 on Dec 2023