Register

Recent questions tagged two-marks

8 8 votes
1 1 answer
4.1k
4.1k views
GATE Overflow | Mock GATE | Test 1 | Question: 40
You are working on a laptop connected to a $100 \text{Mbps}$ Ethernet LAN. You need a $2 \text{GB}$ file that is on the server in the same LAN. The entire file is also on...
User Avatar
13 13 votes
1 1 answer
3.2k
3.2k views
GATE Overflow | Mock GATE | Test 1 | Question: 41
Consider a Computer system with a single core CPU, a single level of cache of size $4 \text{MB}$, and main memory. It takes one CPU cycle to access a memory byte if it is...
User Avatar
5 5 votes
1 answers 1 answer
1.2k
1.2k views
GATE Overflow | Mock GATE | Test 1 | Question: 42
An urn contains $m$ WHITE and $n$ BLACK balls. A ball is drawn at random and is put back into the urn along with $k$ additional balls of the same color as that of the bal...
User Avatar
2 2 votes
0 0 answers
3.7k
3.7k views
GATE Overflow | Mock GATE | Test 1 | Question: 43
Ginmans Stack are a kind of special data structure in which if there are odd number of elements then the middle most element is popped out and printed on the screen. In c...
User Avatar
4 4 votes
2 answers 2 answers
1.7k
1.7k views
GATE Overflow | Mock GATE | Test 1 | Question: 44
For two data sets, each of size $5$, the variances are given to be $4$ and $5$ and the corresponding means are given to be $2$ and $4$ respectively. The variance of the c...
User Avatar
2 2 votes
2 answers 2 answers
2.2k
2.2k views
GATE Overflow | Mock GATE | Test 1 | Question: 45
Consider the following modified Heapify and Build_heap procedure.void Heapify(int* A, int i, int n) { int left=2*i+1; int right=2*i+2; int mid=i; if (left<=n && right <=n...
User Avatar
2 2 votes
2 2 answers
5.2k
5.2k views
GATE Overflow | Mock GATE | Test 1 | Question: 46
Which of the following statements is/are not correct?(P) The class of all Turing Machines is countably infinite(Q) The class of all DCFL's is countably infinite(R) The cl...
User Avatar
4 4 votes
1 1 answer
2.9k
2.9k views
GATE Overflow | Mock GATE | Test 1 | Question: 47
Which of the following statements is/are correct with respect to Djikstra Algorithm?(P) It always works perfectly for graphs with negative weight edges.(Q) It does not wo...
User Avatar
6 6 votes
1 answers 1 answer
3.2k
3.2k views
GATE Overflow | Mock GATE | Test 1 | Question: 48
Consider the following piece of pseudo-code:A(n){ if(n==0) return 1; return A(√n) + B(n) + C(n) + D(n); } B(n){ if (n==0) return n; return B(n-1); } C(n){ return A (√n); ...
User Avatar
6 6 votes
2 2 answers
1.5k
1.5k views
GATE Overflow | Mock GATE | Test 1 | Question: 49
Consider the following two relational schemas:MovieExec(name, address, cert, netWorth)Studio(name, address, presC)Suppose we wish to require that one must have a net wort...
User Avatar
4 4 votes
2 2 answers
3.9k
3.9k views
GATE Overflow | Mock GATE | Test 1 | Question: 49
The path length of a node is defined as the number of edges from root to that node. For a given full binary tree, the sum of path length of all leaf nodes is equal to $16...
User Avatar
5 5 votes
1 1 answer
2.3k
2.3k views
GATE Overflow | Mock GATE | Test 1 | Question: 51
$\begin{array}{|c|c|c|c|c|c|c|} \hline 0 & 1 & 1 & 0 & 1 & 1 & 0 \\ \hline 1 & 0 & 0 & 1 & 1 & 0 & 1 \\ \hline 1& 0 & 0 & 1 & 1 & 1 & 0 \\ \hline 0 & 1 & 1 & 0 & 1 & 0 & ...
User Avatar
6 6 votes
2 2 answers
2.4k
2.4k views
GATE Overflow | Mock GATE | Test 1 | Question: 52
$\begin{bmatrix} 2 & 2 & 1 \\ 1 & 3 & 1 \\ 1 & 2 & 2 \end{bmatrix}$For the above given matrix $A,$$A^3 -7A^2 +10A = $$5I+A$$5I-A$$A-5I$$6I$
User Avatar
2 2 votes
3 answers 3 answers
2.4k
2.4k views
GATE Overflow | Mock GATE | Test 1 | Question: 53
A class of first year B.tech students is composed of four batches A, B, C and D, each consisting of $30$ students. It is found that the sessional marks of students in Eng...
User Avatar
5 5 votes
1 1 answer
1.7k
1.7k views
GATE Overflow | Mock GATE | Test 1 | Question: 54
Let $S$ be a set of $n$ elements $\{1, 2, \dots n\}$ and $G$ a graph with $2^n$ vertices, where each vertex corresponds to a distinct subset of $S$. Two vertices are adja...
User Avatar
1 1 vote
0 0 answers
1.6k
1.6k views
GATE Overflow | Mock GATE | Test 1 | Question: 55
Which of the following is/are true regarding Weak Entity Sets?(P) An entity set that does not have a primary key is referred to as a weak entity set.(Q) The existence of ...
User Avatar
5 5 votes
1 answers 1 answer
3.1k
3.1k views
GATE Overflow | Mock GATE | Test 1 | Question: 56
Consider the following language $L$:$L=\{<M,x,k \mid M \text{ is a Turing Machine and M does not halt on x within k steps} \}$The language family to which $L$ belongs is ...
User Avatar
4 4 votes
1 1 answer
2.9k
2.9k views
GATE Overflow | Mock GATE | Test 1 | Question: 57
Which of the following statements on Viable Prefixes is incorrect?A viable prefix does not extend past the right end of the handleFor any context-free grammar, the set of...
User Avatar
11 11 votes
1 answers 1 answer
4.3k
4.3k views
GATE Overflow | Mock GATE | Test 1 | Question: 58
Let $f(A, B, C, D)=\Pi (2, 3, 5, 9, 11, 12, 13)$The total number of prime implicants and essential prime implicants are denoted by $P$ and $Q$ respectively. What is the v...
User Avatar
0 0 votes
2 2 answers
1.9k
1.9k views
GATE Overflow | Mock GATE | Test 1 | Question: 59
Assume the initial values of $K0$, $Q_0$ and $Q_1$ to be $1$.Which of the following state transition tables correctly correspond to the circuit given above? (Note: $Q_{kN...
User Avatar
2 2 votes
2 answers 2 answers
2.2k
2.2k views
GATE Overflow | Mock GATE | Test 1 | Question: 60
A program runs in $20s$ in machine A with a clock speed of $200MHz$. A computer architecture wants to build a machine B which will run this program in $6$ seconds. The a...
User Avatar
2 2 votes
1 answers 1 answer
1.9k
1.9k views
GATE Overflow | Mock GATE | Test 1 | Question: 61
A $5$ stage pipeliine is used to overlap all the instructions except the branch instructions. The target of the branch can't be fetched till the current instruction is co...
User Avatar
7 7 votes
1 answers 1 answer
3.1k
3.1k views
GATE Overflow | Mock GATE | Test 1 | Question: 62
Which of the following sorting algorithms performs efficiently to sort a singly linked list containing $\log n$ nodes and the corresponding time complexity is?$\text{Inse...
User Avatar
1 1 vote
1 answers 1 answer
1.2k
1.2k views
GATE Overflow | Mock GATE | Test 1 | Question: 63
A system is having user processes $P_1, P_2, \dots , P_N$ each requiring $Q_N, Q_{N-1}, \dots , Q_1$ number of resource instances of resource $R$. The minimum number of r...
User Avatar
7 7 votes
1 answers 1 answer
2.2k
2.2k views
GATE Overflow | Mock GATE | Test 1 | Question: 64
Consider the $2$ dimensional array $A$:int A[][]=new int[100][100];where $A[0][0]$ is at location $800$ in a paged memory system with pages of size $800 bytes$. Each int ...
User Avatar
3 3 votes
3 3 answers
2.4k
2.4k views
GATE Overflow | Mock GATE | Test 1 | Question: 65
Consider the following operators used in an arbitrary regular expression parsing.(In all the below statements, capital letters denote the operator. Ignore quotes.)'xPy' d...
User Avatar
113 113 votes
8 answers 8 answers
35.0k
35.0k views
GATE CSE 2018 | Question: 55
Consider a simple communication system where multiple nodes are connected by a shared broadcast medium (like Ethernet or wireless). The nodes in the system use the follow...
User Avatar
70 70 votes
13 answers 13 answers
36.5k
36.5k views
GATE CSE 2018 | Question: 54
Consider an IP packet with a length of $4,500\;\text{bytes}$ that includes a $20\text{-byte}\;\textsf{IPv4}$ header and a $40\text{-byte}$ TCP header. The packet is forwa...
User Avatar
78 78 votes
3 answers 3 answers
28.6k
28.6k views
GATE CSE 2018 | Question: 53
Consider a storage disk with $4$ platters (numbered as $0, 1, 2$ and $3$), $200$ cylinders (numbered as $0, 1, … , 199$), and $256$ sectors per track (numbered as $0, 1, ...
User Avatar
129 129 votes
5 answers 5 answers
35.2k
35.2k views
GATE CSE 2018 | Question: 52
Given a language $L$, define $L^i$ as follows:$$L^0 = \{ \varepsilon \}$$$$L^i = L^{i-1} \bullet L \text{ for all } I >0$$The order of a language $L$ is defined as the s...
User Avatar
Page: