Dark Mode

Recent questions tagged gatebook

4 votes

3 answers

1

GateBook Test Series: Digital Logic - Boolean Algebra
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

val_pro20 asked in Digital Logic May 15, 2019

1.2k views

3 votes

2 answers

2

gatebook test
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 ... this computation is ( in nanoseconds): (A) 28 (B) 33 (C) 43 (D) 49 my answer is 43 but gatebook answer is 49.

sushmita asked in CO and Architecture Dec 18, 2018

649 views

2 votes

3 answers

3

gatebook COA test
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 ... by 50%. The remaining program has a speedup of 1. The overall speedup of the program exact to two decimal places is:-

sushmita asked in CO and Architecture Dec 18, 2018

615 views

3 votes

1 answer

4

GB DL - Test 1 - Question 19
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

Sandy Sharma asked in Digital Logic Nov 19, 2018

by Sandy Sharma

331 views

1 vote

0 answers

5

GB DL - Test 1 - Question 16
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

Sandy Sharma asked in Programming in C Nov 19, 2018

by Sandy Sharma

583 views

0 votes

1 answer

6

GB DL - Test 1 - Question 7
The Gray code representation of 11710 is: (A) 1111001 (B) 1001111 (C) 1110110 (D) 1110101

Sandy Sharma asked in Digital Logic Nov 19, 2018

by Sandy Sharma

1.2k views

0 votes

0 answers

7

Gatebook Test series ques
Answer given is Option A , but here we wil first sort the jobs in order of profit , for each value of deadline scan linearly in the array depending on the value of deadline , so it should take O(n^2) in worst case .

radha gogia asked in Algorithms Nov 16, 2018

509 views

0 votes

0 answers

8

GB CN - Test 1 - Question 9
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 ... that a station in a pure Aloha network can successfully send a frame during the vulnerable time. A. B. C. D.

Sandy Sharma asked in Computer Networks Oct 18, 2018

by Sandy Sharma

1.2k views

0 votes

0 answers

9

Pipelining
Approach :

HeadShot asked in CO and Architecture Oct 7, 2018

385 views

0 votes

0 answers

10

HeadShot asked in CO and Architecture Oct 4, 2018

423 views

0 votes

0 answers

11

GB DSA-Test 4-Question 17
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)

Sandy Sharma asked in Programming in C Sep 26, 2018

by Sandy Sharma

596 views

0 votes

0 answers

12

GB-DSA-Test 3-Question 15Consider the graph shown below:
Consider the graph shown below: Cardinality of the largest maximum independent set of the above graph is: ——?

Sandy Sharma asked in Graph Theory Sep 21, 2018

by Sandy Sharma

333 views

0 votes

0 answers

13

GB-DSA-Test 3-Question 18
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

Sandy Sharma asked in Graph Theory Sep 21, 2018

by Sandy Sharma

278 views

2 votes

2 answers

14

Anusha Motamarri asked in Digital Logic Feb 7, 2017

by Anusha Motamarri

404 views

3 votes

2 answers

15

gatebook
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?

Purple asked in Quantitative Aptitude Feb 7, 2017

by Purple

928 views

1 vote

0 answers

16

GATEBOOK MOCK TEST 1
Let A and B be two stations attempting to transmit on an ethernet. Each has a steady queue of frames ready to send; A's frames will be numbered A1, A2 and so on, and B's similarly. Let T = 51.2 microsec be the exponential backoff base unit. ... --(Round off the answer to 4 decimal digits) No answer is provided in the result. My answer is 0.8125, is it correct ?

Nitesh Methani asked in Computer Networks Jan 29, 2017

by Nitesh Methani

479 views

2 votes

2 answers

17

GATEBOOK MOCK TEST 1
A processor with a word addressable memory has a two-way set associative cache. A cache line is one word and, so a cache entry contains a set of words. If there are M words of memory and C cache entries, How many words of memory map to the same cache entry? (A) C/2 (B) M/2C (C) M/C (D) 2M/C

Nitesh Methani asked in CO and Architecture Jan 29, 2017

by Nitesh Methani

1.5k views

1 vote

0 answers

18

no of balanced paraenthesis
The no of different balanced parenthesizes possible with n pairs of parenthesis? A. B. C. (2n)! D. n! please explain the answer.

indrajeet asked in Programming in C Sep 18, 2016

408 views

To see more, click for the full list of questions or popular tags.

Recent questions tagged gatebook