Recent questions tagged gate2016-1 - GATE CSE Doubts

0 votes

0 answers

Gate 2016 Set Theory
Consider a set U of 23 different compounds in a chemistry lab. There is a subset S of U of 9 compounds, each of which reacts with exactly 3 compounds of U. Consider the following statements: Each compound in U \ S reacts with an odd number of compounds ... Which one of the above statements is ALWAYS TRUE? (Please Draw a graph Not Able to visualize) Only I Only II Only III None.

asked Apr 3 in Set Theory & Algebra by sushildiwakar (5 points) | 5 views

0 votes

0 answers

GATE2016-1-8 Video Solution
We want to design a synchronous counter that counts the sequence $0-1-0-2-0-3$ and then repeats. The minimum number of $\text{J-K}$ flip-flops required to implement this counter is _____________.

asked Apr 18, 2020 in Digital Logic by admin (573 points) | 15 views

0 votes

0 answers

GATE2016-1-50 Video Solution
Consider the following proposed solution for the critical section problem. There are $n$ processes : $P_0....P_{n-1}$. In the code, function $\text{pmax}$ ... be in the critical section at any time The bounded wait condition is satisfied The progress condition is satisfied It cannot cause a deadlock

asked Apr 18, 2020 in Operating System by admin (573 points) | 72 views

0 votes

0 answers

GATE2016-1-54 Video Solution
For a host machine that uses the token bucket algorithm for congestion control, the token bucket has a capacity of $1$ $\text{megabyte}$ and the maximum output rate is $20$ $\text{megabytes}$ per $\text{second}$. Tokens arrive at a rate to ... to send $12$ $\text{megabytes}$ of data. The minimum time required to transmit the data is _____________ $\text{seconds}$.

asked Apr 18, 2020 in Computer Networks by admin (573 points) | 16 views

0 votes

0 answers

GATE2016-1-39 Video Solution
Let $G$ be a complete undirected graph on $4$ vertices, having $6$ edges with weights being $1, 2, 3, 4, 5,$ and $6$. The maximum possible weight that a minimum weight spanning tree of $G$ can have is __________

asked Apr 18, 2020 in Algorithms by admin (573 points) | 8 views

0 votes

0 answers

GATE2016-1-33 Video Solution
Consider a carry look ahead adder for adding two n-bit integers, built using gates of fan-in at most two. The time to perform addition using this adder is $\Theta (1)$ $\Theta (\log(n))$ $\Theta (\sqrt{n})$ $\Theta (n)$)

asked Apr 18, 2020 in Digital Logic by admin (573 points) | 10 views

0 votes

0 answers

GATE2016-1-19 Video Solution
Consider the following code segment. x = u - t; y = x * v; x = y + w; y = t - z; y = x * y; The minimum number of total variables required to convert the above code segment to static single assignment form is __________.

asked Apr 18, 2020 in Compiler Design by admin (573 points) | 9 views

0 votes

0 answers

GATE2016-1-41 Video Solution
Let $Q$ denote a queue containing sixteen numbers and $S$ be an empty stack. $Head(Q)$ returns the element at the head of the queue $Q$ without removing it from $Q$. Similarly $Top(S)$ returns the element at the top of $S$ without removing it ... x:= Pop(S); Enqueue (Q, x); end end The maximum possible number of iterations of the while loop in the algorithm is _______.

asked Apr 18, 2020 in DS by admin (573 points) | 24 views

0 votes

0 answers

GATE2016-1-26 Video Solution
The coefficient of $x^{12}$ in $\left(x^{3}+x^{4}+x^{5}+x^{6}+\dots \right)^{3}$ is ___________.

asked Apr 18, 2020 in Combinatory by admin (573 points) | 7 views

0 votes

0 answers

GATE2016-1-32 Video Solution
The stage delays in a $4$-stage pipeline are $800, 500, 400$ and $300$ picoseconds. The first stage (with delay $800$ picoseconds) is replaced with a functionality equivalent design involving two stages with respective delays $600$ and $350$ picoseconds. The throughput increase of the pipeline is ___________ percent.

asked Apr 18, 2020 in CO & Architecture by admin (573 points) | 13 views

0 votes

0 answers

GATE2016-1-40 Video Solution
$G=(V, E)$ is an undirected simple graph in which each edge has a distinct weight, and $e$ is a particular edge of $G$. Which of the following statements about the minimum spanning trees $(MSTs)$ of $G$ is/are TRUE? If $e$ is the lightest edge of some cycle in ... of some cycle in $G$, then every MST of $G$ excludes $e$. I only. II only. Both I and II. Neither I nor II.

asked Apr 18, 2020 in Algorithms by admin (573 points) | 8 views

0 votes

0 answers

GATE2016-1-36 Video Solution
What will be the output of the following pseudo-code when parameters are passed by reference and dynamic scoping is assumed? a = 3; void n(x) { x = x * a; print (x); } void m(y) { a = 1 ; a = y - a; n(a); print (a); } void main () { m(a); } $6,2$ $6,6$ $4,2$ $4,4$

asked Apr 18, 2020 in Compiler Design by admin (573 points) | 12 views

0 votes

1 answer

GATE2016-1-55 Video Solution
A sender uses the Stop-and-Wait ARQ protocol for reliable transmission of frames. Frames are of size $1000$ bytes and the transmission rate at the sender is $80$ Kbps (1 Kbps = 1000 bits/second). Size of an acknowledgment is $100$ bytes ... . The one-way propagation delay is $100$ milliseconds. Assuming no frame is lost, the sender throughput is ________ bytes/ second.

asked Apr 18, 2020 in Computer Networks by admin (573 points) | 12 views

0 votes

0 answers

GATE2016-1-38 Video Solution
Consider the weighted undirected graph with $4$ vertices, where the weight of edge $\{i,j\}$ is given by the entry $W_{ij}$ in the matrix $W$ ... integer value of $x$, for which at least one shortest path between some pair of vertices will contain the edge with weight $x$ is ___________.

asked Apr 18, 2020 in DS by admin (573 points) | 9 views

0 votes

0 answers

GATE2016-1-11 Video Solution
Consider the following directed graph: The number of different topological orderings of the vertices of the graph is _____________.

asked Apr 18, 2020 in Algorithms by admin (573 points) | 8 views

0 votes

0 answers

GATE2016-1-27 Video Solution
Consider the recurrence relation $a_1 =8 , a_n =6n^2 +2n+a_{n-1}$. Let $a_{99}=K\times 10^4$. The value of $K$ is __________.

asked Apr 18, 2020 in Combinatory by admin (573 points) | 7 views

0 votes

0 answers

GATE2016-1-48 Video Solution
Cylinder a disk queue with requests for $I/O$ to blocks on cylinders $47, 38, 121, 191, 87, 11, 92, 10.$ The C-LOOK scheduling algorithm is used. The head is initially at cylinder number $63$, moving towards larger cylinder numbers ... are numbered from $0$ to $199$. The total head movement (in number of cylinders) incurred while servicing these requests is__________.

asked Apr 18, 2020 in Operating System by admin (573 points) | 9 views

0 votes

0 answers

GATE2016-1-GA10 Video Solution
In a process, the number of cycles to failure decreases exponentially with an increase in load. At a load of $80$ units, it takes $100$ cycles for failure. When the load is halved, it takes $10000 \ \text{cycles}$ for failure.The load for which the failure will happen in $5000 \ \text{cycles}$ is _____________. $40.00$ $46.02$ $60.01$ $92.02$

asked Apr 18, 2020 in Numerical Ability by admin (573 points) | 7 views

0 votes

0 answers

GATE2016-1-10 Video Solution
A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT ($n$ refers to the number of items in the queue) ? Both operations can be performed in $O(1)$ time. ... both operations will be $\Omega (n)$. Worst case time complexity for both operations will be $\Omega (\log n)$

asked Apr 18, 2020 in DS by admin (573 points) | 6 views

0 votes

0 answers

GATE2016-1-28 Video Solution
A function $f: \Bbb{N^+} \rightarrow \Bbb{N^+}$ , defined on the set of positive integers $\Bbb{N^+}$,satisfies the following properties: $f(n)=f(n/2)$ if $n$ is even $f(n)=f(n+5)$ if $n$ is odd Let $R=\{ i \mid \exists{j} : f(j)=i \}$ be the set of distinct values that $f$ takes. The maximum possible size of $R$ is ___________.

asked Apr 18, 2020 in Set Theory & Algebra by admin (573 points) | 17 views

0 votes

0 answers

GATE2016-1-49 Video Solution
Consider a computer system with ten physical page frames. The system is provided with an access sequence $(a_{1}, a_{2},....,a_{20}, a_{1}, a_{2},...a_{20})$, where each $a_{i}$ is a distinct virtual page number. The difference in the number of page faults between the last-in-first-out page replacement policy and the optimal page replacement policy is_________.

asked Apr 18, 2020 in Operating System by admin (573 points) | 7 views

+1 vote

1 answer

GATE2016-1-51 Video Solution
Consider the following two phase locking protocol. Suppose a transaction $T$ accesses (for read or write operations), a certain set of objects $\{O_1,\ldots,O_k \}$. This is done in the following ... -freedom guarantee neither serializability nor deadlock-freedom guarantee serializability but not deadlock-freedom guarantee deadlock-freedom but not serializability.

asked Apr 18, 2020 in Databases by admin (573 points) | 9 views

0 votes

0 answers

GATE2016-1-14 Video Solution
Let $G$ be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increased by the same value, then which of the following statements is/are TRUE? $P$: Minimum spanning tree of $G$ does not change. $Q$: Shortest path between any pair of vertices does not change. $P$ only $Q$ only Neither $P$ nor $Q$ Both $P$ and $Q$

asked Apr 18, 2020 in Algorithms by admin (573 points) | 9 views

0 votes

0 answers

GATE2016-1-43 Video Solution
Consider the transition diagram of a PDA given below with input alphabet $\Sigma=\{a,b\}$ and stack alphabet $\Gamma = \{X,Z\}$. $Z$ is the initial stack symbol. Let $L$ ... on every input $L =\{a^n\mid n \geq0 \} \cup \{a^nb^n \mid n \geq 0\}$ and is deterministic context-free

asked Apr 18, 2020 in Theory of Computation by admin (573 points) | 19 views

+1 vote

1 answer

GATE2016-1-15 Video Solution
Consider the following C program. # include <stdio.h> void mystery (int *ptra, int *ptrb) { int *temp; temp = ptrb; ptrb =ptra; ptra = temp; } int main () { int a = 2016, b=0, c= 4, d = 42; mystery (&a, &b); if (a < c) mystery (&c, &a); mystery (&a, &d); print f("%d\n", a); } The output of the program is _________.

asked Apr 18, 2020 in Programming by admin (573 points) | 19 views

0 votes

0 answers

GATE2016-1-24 Video Solution
Which one of the following protocols is NOT used to resolve one form of address to another one? DNS ARP DHCP RARP

asked Apr 18, 2020 in Computer Networks by admin (573 points) | 11 views

0 votes

0 answers

GATE2016-1-31 Video Solution
The size of the data count register of a $\text{DMA}$ controller is $16 \text{bits}$. The processor needs to transfer a file of $29,154$ ... needs to get the control of the system bus from the processor to transfer the file from the disk to main memory is _________-.

asked Apr 18, 2020 in CO & Architecture by admin (573 points) | 9 views

0 votes

0 answers

GATE2016-1-25 Video Solution
Which of the following is/are example(s) of stateful application layer protocol? HTTP FTP TCP POP3 $(i)$ and $(ii)$ only $(ii)$ and $(iii)$ only $(ii)$ and $(iv)$ only $(iv)$ only

asked Apr 18, 2020 in Computer Networks by admin (573 points) | 9 views

0 votes

0 answers

GATE2016-1-42 Video Solution
Consider the following context-free grammars; $G_1 : S \to aS \mid B, B \to b \mid bB$ $G_2 : S \to aA \mid bB, A \to aA \mid B \mid \varepsilon,B \to bB \mid \varepsilon$ Which one of the following pairs of languages is generated by $G_1$ and $G_2$ ... $\{ a^mb^n \mid m > 0 \text{ or } n>0\}$

asked Apr 18, 2020 in Theory of Computation by admin (573 points) | 11 views

0 votes

0 answers

GATE2016-1-23 Video Solution
A database of research articles in a journal uses the following schema. $\text{(VOLUME, NUMBER, STARTPAGE, ENDPAGE, TITLE, YEAR, PRICE)}$ The primary key is '$\text{(VOLUME, NUMBER, STARTPAGE, ENDPAGE)}$ and the following functional dependencies exist in the ... normal form that the new database satisfies, but the old one does not? $1NF$ $2NF$ $3NF$ $\text{BCNF}$

asked Apr 18, 2020 in Databases by admin (573 points) | 10 views

0 votes

0 answers

GATE2016-1-18 Video Solution
Which one of the following regular expressions represents the language: the set of all binary strings having two consecutive $0$'s and two consecutive $1$'s? $(0+1 )^ *0011 (0+1)^* +(0+1)^*1100(0+1)^*$ $(0+1)^* (00(0+1)^*11+11(0+1)^*00)(0+1)^*$ $(0+1)^*00(0+1)^* + (0+1)^*11 (0+1)^*$ $00(0+1)^*11 +11(0+1)^*00$

asked Apr 18, 2020 in Theory of Computation by admin (573 points) | 8 views

0 votes

0 answers

GATE2016-1-53 Video Solution
An IP datagram of size $1000$ $\text{bytes }$arrives at a router. The router has to forward this packet on a link whose MTU (maximum transmission unit) is $100$ $\text{bytes }$. Assume that the size of the IP header is $20$ $\text{bytes }.$ The number of fragments that the IP datagram will be divided into for transmission is________.

asked Apr 18, 2020 in Computer Networks by admin (573 points) | 8 views

0 votes

0 answers

GATE2016-1-35 Video Solution
What will be the output of the following $C$ program? void count (int n) { static int d=1; printf ("%d",n); printf ("%d",d); d++; if (n>1) count (n-1); printf ("%d",d); } void main(){ count (3); } $3 \ 1 \ 2 \ 2 \ 1 \ 3 \ 4 \ 4 \ 4$ $3 \ 1 \ 2 \ 1 \ 1 \ 1 \ 2 \ 2 \ 2$ $3 \ 1 \ 2 \ 2 \ 1 \ 3 \ 4$ $3 \ 1 \ 2 \ 1 \ 1 \ 1 \ 2$

asked Apr 18, 2020 in Programming by admin (573 points) | 9 views

0 votes

0 answers

GATE2016-1-37 Video Solution
An operator $delete(i)$ for a binary heap data structure is to be designed to delete the item in the $i$-th node. Assume that the heap is implemented in an array and $i$ refers to the $i$-th index of the array. If the heap tree has depth $d$ (number of edges on the path from the root to ... $O(d)$ but not $O(1)$ $O(2^d)$ but not $O(d)$ $O(d \ 2^d)$ but not $O(2^d)$

asked Apr 18, 2020 in DS by admin (573 points) | 6 views

0 votes

0 answers

GATE2016-1-1 Video Solution
Let $p, q, r, s$ represents the following propositions. $p:x\in\left\{8, 9, 10, 11, 12\right\}$ $q:$ $x$ is a composite number. $r:$ $x$ is a perfect square. $s:$ $x$ is a prime number. The integer $x\geq2$ which satisfies $\neg\left(\left(p\Rightarrow q\right) \wedge \left(\neg r \vee \neg s\right)\right)$ is ____________.

asked Apr 18, 2020 in Mathematical Logic by admin (573 points) | 8 views

0 votes

0 answers

GATE2016-1-44 Video Solution
Let $X$ be a recursive language and $Y$ be a recursively enumerable but not recursive language. Let $W$ and $Z$ be two languages such that $\overline{Y}$ reduces to $W$, and $Z$ reduces to $\overline{X}$ (reduction means the standard ... enumerable. $W$ is not recursively enumerable and $Z$ is recursive. $W$ is not recursively enumerable and $Z$ is not recursive.

asked Apr 18, 2020 in Theory of Computation by admin (573 points) | 11 views

0 votes

0 answers

GATE2016-1-GA05 Video Solution
A cube is built using $64$ cubic blocks of side one unit. After it is built, one cubic block is removed from every corner of the cube. The resulting surface area of the body (in square units) after the removal is ________. $56$ $64$ $72$ $96$

asked Apr 18, 2020 in Numerical Ability by admin (573 points) | 10 views

0 votes

0 answers

GATE2016-1-20 Video Solution
Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths submitted at the same time to a computer system. Which one of the following process scheduling algorithms would minimize the average waiting time in the ... time quantum less than the shortest CPU burst Uniform random Highest priority first with priority proportional to CPU burst length

asked Apr 18, 2020 in Operating System by admin (573 points) | 6 views

0 votes

0 answers

GATE2016-1-47 Video Solution
Consider a computer system with $40$-bit virtual addressing and page size of sixteen kilobytes. If the computer system has a one-level page table per process and each page table entry requires $48$ bits, then the size of the per-process page table is __________ megabytes.

asked Apr 18, 2020 in Operating System by admin (573 points) | 7 views

0 votes

0 answers

GATE2016-1-29 Video Solution
Consider the following experiment. Step 1. Flip a fair coin twice. Step 2. If the outcomes are (TAILS, HEADS) then output $Y$ and stop. Step 3. If the outcomes are either (HEADS, HEADS) or (HEADS, TAILS), then output $N$ and stop. Step 4. If the ... (TAILS, TAILS), then go to Step 1. The probability that the output of the experiment is $Y$ is (up to two decimal places)

asked Apr 18, 2020 in Probability by admin (573 points) | 10 views

Page:

9,200 questions

3,182 answers

14,686 comments

96,168 users