(+5) The precise time complexity of which of the following problems has not yet
ID: 3709431 • Letter: #
Question
(+5) The precise time complexity of which of the following problems has not yet been established by researchers?
A. Sorting a list
B. Searching through a list for a particular entry
C. The traveling salesman problem
D. Listing all possible subcommittees within a given committee
If the prime numbers of underlying an RSA encryption system are small, the system is not secure. For example suppose you were told that the public keys of a system were n = 15 and e = 13
A. What are the two prime numbers on which the system is based?
______ ________
B. What is the value of the decryption key d?
_______
Using the two primes 11 and 19, one possible encryption key is and decryption keys are 13 and 97 since (13*97)-1 = 7*180 (=p-1*q-1) which of the following would be another suitable encryption key (e) and a decryption key (d)
A e == 19 d == 19 B e == 17 d == 53 C. e == 15 d == 103
D e == 3 d == 47 E. e == 29 d == 143 F. e == 31 d == 53
A B
A B F
B C
A
None of the above
(+5) Which of the following best describes what the following Bare Bones program does?
copy X to Z
clear X
incr X
while Z not 0:
clear X
decr Z
It changes the value of X to 1.
If the starting value of X is 0, it sets the value of X to 0. Otherwise, it sets the value of X to 1.
If the starting value of X is 0, it sets the value of X to 1. Otherwise, it sets the value of X to 0.
It ultimately leaves X the same as it was when the program started.
(+5) If c = x mod n then c is guaranteed to be in which of the following sets
{ 1, 2, 3, … n-1 }
{ 0, 1, 2, 3, …. n-1 }
{ -(n-1), -(n-2), -(n-3), … -2, -1 0 }
{ 1, 2, 3, …. n }
(+5) Which of the following statement(s) are true.
P is contained in NP.
All solvable problems are in P.
The traveling salesman problem is in NP.
The traveling salesman problem is not solvable.
a b c
a c
a c d
a, d
(+5) Which of the following Bare Bones programs is self-terminating
A. while X not 0: B. while X not 0: C. decr X
decr X while X not 0:
A
B
C
None of the above
(+5) Suppose the variables X and Y in the following Bare Bones program have the values 3 and 2, respectively, when execution begins.
clear Z
while X not 0:
while Y not 0:
decr Y
incr Z
incr Z
decr X
What will be the value of Z when the program terminates?
0
1
5
6
(+5) The class of problems known as NP is so named because it is composed of which of the following?
Non-polynomial problems
Non-programmable problems
Non-universal problems
Non-deterministic polynomial problems
(+5) Suppose the variables X and Y in the following Bare Bones program have the values 3 and 2, respectively, when execution begins. What will be the value of Z when the program terminates?
clear Z
while X not 0:
clear W
while Y not 0:
decr Y
incr W
while W not 0:
incr Z
incr Y
decr W
decr X
incr Z
Explanation / Answer
The precise time complexity of which of the following problems has not yet been established by researchers?
Ans - The traveling salesman problem because travelling salesman problem is NP-hard, that is P =! NP and there is no exact algorithm to the traveling salesman in polynomial time, and therefore there is no chance of there being an efficient solution .
If the prime numbers of underlying an RSA encryption system are small, the system is not secure. For example suppose you were told that the public keys of a system were n = 15 and e = 13
A. What are the two prime numbers on which the system is based?
3 and 5
here we know that to make RSA secure by prime number we have n=pq ,where n is given as 15 in the question and p and q are distinct prime numbers. so we have only one option to choose p as 3 and q as 5.
B. What is the value of the decryption key d?
5
so , d = 5
Which of the following best describes what the following Bare Bones program does?
copy X to Z
clear X
incr X
while Z not 0:
clear X
decr Z
Ans -) If the starting value of X is 0, it sets the value of X to 0. Otherwise, it sets the value of X to 1.
Which of the following statement(s) are true.
P is contained in NP.
All solvable problems are in P.
The traveling salesman problem is in NP.
The traveling salesman problem is not solvable.
P is contained in NP because NP problems are checkable in polynomial time means that given a solution of a problem , we can check that whether the solution is correct or not in polynomial time.
The traveling salesman problem is in NP. because it cannot be solved in polynomial time
Which of the following Bare Bones programs is self-terminating
A. while X not 0: B. while X not 0: C. decr X
decr X while X not 0:
A
B
C
None of the above
Ans -)
All Bare Bones programs that do not contain a while statement are self-terminating so the answer is none of the above
Suppose the variables X and Y in the following Bare Bones program have the values 3 and 2, respectively, when execution begins.
clear Z
while X not 0:
while Y not 0:
decr Y
incr Z
incr Z
decr X
What will be the value of Z when the program terminates?
5
the above code is just like the below code(in C language)
#include<stdio.h>
int main()
{
int x=3,y=2,z=0;
while(x!=0)
{
while(y!=0)
{
y--;
z++;
}
z++;
x--;
}
printf("%d",z);
return 0;
}
After running it we get to know that the value of z is 5 after the program termination.
The class of problems known as NP is so named because it is composed of which of the following?
Non-polynomial problems
Non-programmable problems
Non-universal problems
Non-deterministic polynomial problems
Ans-)
Non-deterministic polynomial problems
Suppose the variables X and Y in the following Bare Bones program have the values 3 and 2, respectively, when execution begins. What will be the value of Z when the program terminates?
clear Z
while X not 0:
clear W
while Y not 0:
decr Y
incr W
while W not 0:
incr Z
incr Y
decr W
decr X
incr Z
9
the above code is similar to below C language code and after executing this code we get the value of z as 9.
#include <stdio.h>
int main()
{
int x=3,y=2,z=0,w;
while(x!=0)
{
w=0;
while(y!=0)
{
y--;
w++;
}
while(w!=0)
{
z++;
y++;
w--;
}
x--;
z++;
}
printf("%d",z);
return 0;
}
If you have any problem in running/understanding the above code or any problem in any solution provided by me . Do let me ..
and if you like my solution please give a thumbs up.
Thanks. :)
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.