Gkseries.com | Page 603 of 5336

_I permitted him to leave, I wouldn’t have had any problem with him being absent,I

Q. __________I permitted him to leave, I wouldn’t have had any problem with him being absent,________I? (A) Had, wouldn’t (B) Have, would (C) Had, would (D) Have, wouldn’t Ans: Had, would Solution: The phrase “Had I…”, in simple language means “If I had…”. There is no such meaning behind “Have I” and therefore it would […]

_________I permitted him to leave, I wouldn’t have had any problem with him being absent,________I Read More »

John Thomas, an ______________writer, passed away in 2018.

Q. John Thomas, an ______________writer, passed away in 2018. (A) imminent (B) prominent (C) eminent (D) dominant Ans: eminent

John Thomas, an ______________writer, passed away in 2018. Read More »

In an RSA cryptosystem, the value of the public modulus parameter 𝑛 is 3007. If it is also known that φ(𝑛) = 2880, where φ() denotes Euler’s Totient Function

Q. In an RSA cryptosystem, the value of the public modulus parameter 𝑛 is 3007. If it is also known that φ(𝑛) = 2880, where φ() denotes Euler’s Totient Function, then the prime factor of 𝑛 which is greater than 50 is Ans: Given, n = p * q = 3007 … … (1) And,

In an RSA cryptosystem, the value of the public modulus parameter 𝑛 is 3007. If it is also known that φ(𝑛) = 2880, where φ() denotes Euler’s Totient Function Read More »

What is the minimum number of 2-input NOR gates required to implement a 4-variable function expressed in sum-of-minterms form as f = Σ (0, 2, 5, 7, 8, 10, 13, 15)?

Q. What is the minimum number of 2-input NOR gates required to implement a 4-variable function expressed in sum-of-minterms form as f = Σ (0, 2, 5, 7, 8, 10, 13, 15)? Assume that all the inputs and their complements are available. Answer: . Ans: K-map for given, f = Σ(0, 2, 5, 7, 8,

What is the minimum number of 2-input NOR gates required to implement a 4-variable function expressed in sum-of-minterms form as f = Σ (0, 2, 5, 7, 8, 10, 13, 15)? Read More »

Consider that 15 machines need to be connected in a LAN using 8-port Ethernet switches. Assume that these switches do not have any separate uplink ports

Q. Consider that 15 machines need to be connected in a LAN using 8-port Ethernet switches. Assume that these switches do not have any separate uplink ports. The minimum number of switches needed is. Solution: You need at least 3 switches of Ethernet are required to connect 15 computers.

Consider that 15 machines need to be connected in a LAN using 8-port Ethernet switches. Assume that these switches do not have any separate uplink ports Read More »

Let Σ be the set of all bijections from {1, … , 5} to {1, … , 5}, where 𝑖𝑑 denotes the identity function, i.e. 𝑖𝑑(𝑗) = 𝑗, ∀𝑗. Let ∘ denote composition on functions

Q. Let Σ be the set of all bijections from {1, … , 5} to {1, … , 5}, where 𝑖𝑑 denotes the identity function, i.e. 𝑖𝑑(𝑗) = 𝑗, ∀𝑗. Let ∘ denote composition on functions. For a string 𝑥 =𝑥1 𝑥2 ⋯ 𝑥𝑛 ∈ Σ𝑛, 𝑛 ≥ 0 , let 𝜋(𝑥) = 𝑥1 ∘ 𝑥2

Let Σ be the set of all bijections from {1, … , 5} to {1, … , 5}, where 𝑖𝑑 denotes the identity function, i.e. 𝑖𝑑(𝑗) = 𝑗, ∀𝑗. Let ∘ denote composition on functions Read More »

Suppose 𝑌 is distributed uniformly in the open interval (1,6). The probability that the polynomial 3𝑥2 + 6𝑥𝑌 + 3𝑌 + 6 has only real roots is

Q. Suppose 𝑌 is distributed uniformly in the open interval (1,6). The probability that the polynomial 3𝑥2 + 6𝑥𝑌 + 3𝑌 + 6 has only real roots is (rounded off to 1 decimal place) Solution: For a quadratic polynomial ax2 + bx + c = 0. There are three condition: b2 – 4ac > 0

Suppose 𝑌 is distributed uniformly in the open interval (1,6). The probability that the polynomial 3𝑥2 + 6𝑥𝑌 + 3𝑌 + 6 has only real roots is Read More »

Let 𝑇 be a full binary tree with 8 leaves. (A full binary tree has every level full.) Suppose two leaves 𝑎 and 𝑏 of 𝑇 are chosen uniformly and independently at random

Q. Let 𝑇 be a full binary tree with 8 leaves. (A full binary tree has every level full.) Suppose two leaves 𝑎 and 𝑏 of 𝑇 are chosen uniformly and independently at random. The expected value of the distance between 𝑎 and 𝑏 in 𝑇 (i.e., the number of edges in the unique path

Let 𝑇 be a full binary tree with 8 leaves. (A full binary tree has every level full.) Suppose two leaves 𝑎 and 𝑏 of 𝑇 are chosen uniformly and independently at random Read More »

A certain processor deploys a single-level cache. The cache block size is 8 words and the word size is 4 bytes. The memory system uses a 60-MHz clock.

Q. A certain processor deploys a single-level cache. The cache block size is 8 words and the word size is 4 bytes. The memory system uses a 60-MHz clock. To service a cache miss, the memory controller first takes 1 cycle to accept the starting address of the block, it then takes 3 cycles to

A certain processor deploys a single-level cache. The cache block size is 8 words and the word size is 4 bytes. The memory system uses a 60-MHz clock. Read More »

The index node (inode) of a Unix-like file system has 12 direct, one single-indirect and one double-indirect pointers

Q. The index node (inode) of a Unix-like file system has 12 direct, one single-indirect and one double-indirect pointers. The disk block size is 4 kB, and the disk block address is 32-bits long. The maximum possible file size is (rounded off to 1 decimal place) ____________GB. Solution: No. of Disk block pointers = 4kB/32bits

The index node (inode) of a Unix-like file system has 12 direct, one single-indirect and one double-indirect pointers Read More »