# Recent questions tagged gatebook 1
What is the time complexity for checking whether an assignment of truth values to variables $x_1,\dots ,x_n$ satisfies a given formula $f(x_1\dots,x_n)$? $O(2^n)$ $O(g(n))$ where $g$ is a polynomial $O(log(n))$ None of the above
2
Suppose the functions F and G can be computed in 8 and 3 nanoseconds by functional units UF and UG, respectively. Given three instances of UF and three instances of UG, it is required to implement the computation F(G(Xi)) for 1 ≤ i ≤ 13. A control Unit selects next task/s and ... complete this computation is ( in nanoseconds): (A) 28 (B) 33 (C) 43 (D) 49 my answer is 43 but gatebook answer is 49.
1 vote
3
Consider a program being run on a processor. A modification in processor design caused 30% of the program to speed up by ten times while three fourth of the remaining program has a speed up of 80 and 40% of the remaining part of the program performs poorer and looses its speed by 50%. The remaining program has a speedup of 1. The overall speedup of the program exact to two decimal places is:—
4
If decimal value of is less than that of then possible values of x and y in octal number system respectively are: (A) 11, 16 (B) 15, 9 (C) 9, 12 (D) 17, 11
1 vote
5
The gray code for a decimal number N is . This number N is converted into P which belongs to 84 − 2 − 1 code system. What is the Hexadecimal representation for P? (A) ABC (B) F55 (C) 170 (D) 790
6
The Gray code representation of 11710 is: (A) 1111001 (B) 1001111 (C) 1110110 (D) 1110101
7
A multiple access network with a large number of stations can be analyzed using the Poisson distribution. When there is a limited number of stations in a network, we need to use another approach for this analysis. In a network with N stations, we assume that each station ... The probability that a station in a pure Aloha network can successfully send a frame during the vulnerable time. A. B. C. D.
8
The number of elements that can be sorted in Θ() time using merge sort is, where n is the size of input which can be represented as some power of 2 for some positive integer k: (A) (B) (C) (D)
9
Consider the graph shown below: Cardinality of the largest maximum independent set of the above graph is: ——?
10
Consider following statements about Cycle graph, Complete Bipartite graph and Complete graph. (i) Cycle graph Cn is subgraph of a complete graph Kn. (ii) Kn,n a subgraph of Km iff m ≤ 2n. (iii) Cn a subgraph of Kn,n iff n is even. Which of the above statements are true? (A) (i) and (ii) only (B) (ii) and (iii) only (C) (i) and (iii) only (D) (ii) only
11
12
How many ways are there for arranging letters of the word AMAZING such that the 'I' appears between the two 'A's? (A) 5! ways (B) 7! ways (C) 8! ways (D) 4! ways Note: AMZIA is valid and AIA is also valid right?
1 vote