Recent activity - GATE Overflow

+41 votes

8 answers

1

GATE2016-1-27
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 __________.

answer edited 2 minutes ago in Combinatory by Sambhrant Maurya Active (3.9k points) | 8k views

+35 votes

7 answers

2

GATE2016-1-38
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$ ... possible integer value of $x$, for which at least one shortest path between some pair of vertices will contain the edge with weight $x$ is ___________.

commented 29 minutes ago in DS by vupadhayayx86 Active (1.7k points) | 8.4k views

+21 votes

2 answers

3

TIFR2015-B-9
A Boolean expression is an expression made out of propositional letters (such as $p, q, r$) and operators $\wedge$, $\vee$ and $\neg$; e.g. $p\wedge \neg (q \vee \neg r)$. An expression is said to be in sum of product ... . Every Boolean expression is equivalent to an expression without $\wedge$ operator. Every Boolean expression is equivalent to an expression without $\neg$ operator.

commented 2 hours ago in Digital Logic by Deepakk Poonia (Dee) Boss (27.6k points) | 697 views

+1 vote

1 answer

4

GO2019-FLT1-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 completed. What is the Throughput (in MIPS) of the system if $20\%$ of the instrucitons are branch ... delay. The pipeline clock rate is $0.1 \: GHz$. Branch penalty is $4$ cycles. (Upto $2$ decimal place).

comment edited 3 hours ago in CO and Architecture by JashanArora Loyal (6.9k points) | 266 views

+2 votes

1 answer

5

GO2019-FLT1-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{Insertion sort, } O(\log ^2 n)$ $\text{Merge sort, } \Theta (( \log n) \log (\log n ))$ $\text{Heap sort, } \Theta ( \log ^2)(\log n ))$ $\text{Quick sort, } O ( \log 2)(\log n ))$

comment edited 3 hours ago in Algorithms by JashanArora Loyal (6.9k points) | 223 views

+3 votes

1 answer

6

GO2019-FLT1-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 type needs 4 bytes and A is stored in row-major order. A small process that manipulates the matrix resides ... and other $2$ are initially empty? for (int i=0;i<100;i++) for (int j=0;j<100; j++) A[j][i]=1;

commented 4 hours ago in Operating System by JashanArora Loyal (6.9k points) | 228 views

+5 votes

1 answer

7

wrie through updation in cache
Consider a system with cache access time 20 ns and main memory access time 140 ns. If 60% operations are read operations and hit ratio is 90%. What is the effective access time if write through updation technique is used? (a) 75.2 ns (b) 76.4 ns (c) 83.2 ns (d) 84.4 ns

commented 5 hours ago in CO and Architecture by Rajeev-Dubey (9 points) | 828 views

+35 votes

8 answers

8

GATE2011-54
An undirected graph $G(V,E)$ contains $n \: (n>2)$ nodes named $v_1,v_2, \dots, v_n$. Two nodes $v_i, v_j$ are connected if and only if $ 0 < \mid i-j\mid \leq 2$. Each edge $(v_i,v_j)$ is assigned a weight $i+j$. A sample graph with $n=4$ is shown below. What ... minimum spanning tree (MST) of such a graph with $n$ nodes? $\frac{1}{12} (11n^2 - 5 n)$ $n^2-n+1$ $6n-11$ $2n+1$

commented 8 hours ago in Algorithms by Anisha140197 (9 points) | 5.5k views

+23 votes

5 answers

9

GATE2005-29, UGCNET-June2015-III-9
Which one of the following statements about normal forms is $\text{FALSE}?$ $\text{BCNF}$ is stricter than $3NF$ Lossless, dependency-preserving decomposition into $3NF$ is always possible Lossless, dependency-preserving decomposition into $\text{BCNF}$ is always possible Any relation with two attributes is in $\text{BCNF}$

answered 8 hours ago in Databases by rohit9 (69 points) | 3k views

+6 votes

2 answers

10

GATE1995-25b
Determine the number of positive integers $(\leq 720)$ which are not divisible by any of $2,3$ or $5.$

commented 9 hours ago in Set Theory & Algebra by prithatiti (425 points) | 423 views

+35 votes

7 answers

11

GATE2017-1-48
Let $A$ be an array of $31$ numbers consisting of a sequence of $0$'s followed by a sequence of $1$'s. The problem is to find the smallest index $i$ such that $A\left [i \right ]$ is $1$ by probing the minimum number of locations in $A$. The worst case number of probes performed by an optimal algorithm is ____________.

commented 10 hours ago in Algorithms by Shivateja MST (339 points) | 5.8k views

+13 votes

2 answers

12

GATE1993-21
The following page addresses, in the given sequence, were generated by a program: $\text{1 2 3 4 1 3 5 2 1 5 4 3 2 3}$ This program is run on a demand paged virtual memory system, with main memory size equal to $4$ pages. Indicate the page references for which page faults occur for the following page replacement algorithms. LRU FIFO Assume that the main memory is initially empty

commented 10 hours ago in Operating System by Kushagra गुप्ता Active (4.5k points) | 973 views

0 votes

0 answers

13

ISI2014-DCG-33
Let $f(x)$ be a continuous function from $[0,1]$ to $[0,1]$ satisfying the following properties. $f(0)=0$, $f(1)=1$, and $f(x_1)<f(x_2)$ for $x_1 < x_2$ with $0 < x_1, \: x_2<1$. Then the number of such functions is $0$ $1$ $2$ $\infty$

commented 12 hours ago in Calculus by slow_but_detemined (455 points) | 32 views

+29 votes

2 answers

14

GATE2017-1-23
Consider a database that has the relation schema EMP (EmpId, EmpName, and DeptName). An instance of the schema EMP and a SQL query on it are given below: ... IN (SELECT DeptName, COUNT(EmpId) AS EC(DeptName, Num) FROM EMP GROUP BY DeptName) The output of executing the SQL query is _____________ .

commented 12 hours ago in Databases by arka084 (13 points) | 4k views

+32 votes

3 answers

15

GATE2016-1-37
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 the farthest ... $O(d)$ but not $O(1)$ $O(2^d)$ but not $O(d)$ $O(d \ 2^d)$ but not $O(2^d)$

commented 13 hours ago in DS by Shivateja MST (339 points) | 5.1k views

+2 votes

1 answer

16

ISI2014-DCG-17
$\underset{x \to 2}{\lim} \dfrac{1}{1+e^{\frac{1}{x-2}}}$ is $0$ $1/2$ $1$ non-existent

commented 13 hours ago in Calculus by slow_but_detemined (455 points) | 35 views

+3 votes

4 answers

17

#compiler
given Grammar E → E + E E → E * E E → ( E ) E → id Find set of handles and viable prefixes for the input string id1 + id2 * id3

commented 13 hours ago in Compiler Design by GoalSet1 (215 points) | 841 views

+40 votes

4 answers

18

GATE2015-2-34
Assume that the bandwidth for a $TCP$ connection is $1048560$ bits/sec. Let $\alpha$ be the value of RTT in milliseconds (rounded off to the nearest integer) after which the $TCP$ window scale option is needed. Let $\beta$ be the maximum possible window size with window scale ... 2$^{16}$ $500$ milliseconds, $65535$ $\times $2$^{14}$ $500$ milliseconds, $65535$ $\times $2$^{16}$

commented 13 hours ago in Computer Networks by indra094 (15 points) | 10.7k views

0 votes

0 answers

19

ISI2018-MMA-29
Let $f$ be a continuous function with $f(1) = 1$. Define $F(t)=\int_{t}^{t^2}f(x)dx$. The value of $F’(1)$ is $-2$ $-1$ $1$ $2$

commented 13 hours ago in Calculus by slow_but_detemined (455 points) | 75 views

+3 votes

3 answers

20

UGCNET-June2016-II-9
The simplified form of the Boolean equation $(A\bar{B}+A\bar{B}+AC)(\bar{A}\bar{C}+\bar{B})$ is $A\bar{B}$ $A\bar{B}C$ $\bar{A}B$ $ABC$

commented 13 hours ago in Digital Logic by VERMARITIKA (9 points) | 1.5k views

+6 votes

6 answers

21

GATE2019-23
Consider three concurrent processes $P1$, $P2$ and $P3$ as shown below, which access a shared variable $D$ that has been initialized to $100$ ... maximum possible values of $D$ after the three processes have completed execution are $X$ and $Y$ respectively, then the value of $Y-X$ is ____

answered 13 hours ago in Operating System by Kushagra गुप्ता Active (4.5k points) | 4k views

+46 votes

5 answers

22

GATE2015-1-43
The graph shown below has $8$ edges with distinct integer edge weights. The minimum spanning tree (MST) is of weight $36$ and contains the edges: $\{(A, C), (B, C), (B, E), (E, F), (D, F)\}$. The edge weights of only those edges which are in the MST are given in the figure shown below. The minimum possible sum of weights of all $8$ edges of this graph is_______________.

commented 13 hours ago in Algorithms by Nirmalbbll (301 points) | 6.2k views

0 votes

2 answers

23

MadeEasy Subject Test: Operating System - Page Replacement
Why S1 is false??

answered 14 hours ago in Operating System by Pankajmjx (19 points) | 71 views

+29 votes

13 answers

24

GATE2018-46
The number of possible min-heaps containing each value from $\{1,2,3,4,5,6,7\}$ exactly once is _______

commented 14 hours ago in Combinatory by RAVINDRA_SAMRIA (13 points) | 9.9k views

+4 votes

1 answer

25

MadeEasy Test Series: Compiler Design - Viable Prefix
i think "(E+F*" is viable prefix but "E+F*" is not viable prefix. correct?

commented 15 hours ago in Compiler Design by GoalSet1 (215 points) | 258 views

+1 vote

0 answers

26

ISI2016-MMA-21
Let $A=\{1, 2, 3, 4, 5, 6, 7, 8 \}$. How many functions $f: A \rightarrow A$ can be defined such that $f(1)< f(2) < f(3)$? $\begin{pmatrix} 8 \\ 3 \end{pmatrix}$ $\begin{pmatrix} 8 \\ 3 \end{pmatrix} 5^8$ $\begin{pmatrix} 8 \\ 3 \end{pmatrix} 8^5$ $\frac{8!}{3!}$

commented 15 hours ago in Calculus by slow_but_detemined (455 points) | 28 views

+19 votes

3 answers

27

GATE2000-1.4
Let $S$ and $T$ be languages over $\Sigma=\{a.b\}$ represented by the regular expressions $(a+b^*)^*$ and $(a+b)^*$, respectively. Which of the following is true? $S \subset T$ $T \subset S$ $S = T$ $S \cap T = \phi$

commented 15 hours ago in Theory of Computation by Lakshman Patel RJIT Veteran (59.3k points) | 1.8k views

+2 votes

2 answers

28

CMI2019-A-9
The next two questions refer to the following program. In the code below reverse$(A,i,j)$ takes an array $A,$ indices $i$ and $j$ with $i\leq j,$ and reverses the segment $A[i],A[i+1],\cdots,A[j].$ ... } reverse(A,i,m); } return; } When the procedure terminates, the array A has been: Sorted in descending order Sorted in ascending order Reversed Left unaltered

answered 16 hours ago in Programming by Winner (445 points) | 141 views

+33 votes

9 answers

29

GATE2016-2-49
Consider a non-negative counting semaphore $S$. The operation $P(S)$ decrements $S$, and $V(S)$ increments $S$. During an execution, $20$ $P(S)$ operations and $12$ $V(S)$ operations are issued in some order. The largest initial value of $S$ for which at least one $P(S)$ operation will remain blocked is _______

answered 16 hours ago in Operating System by JashanArora Loyal (6.9k points) | 4.9k views

+54 votes

7 answers

30

GATE2004-85
A program takes as input a balanced binary search tree with $n$ leaf nodes and computes the value of a function $g(x)$ for each node $x$. If the cost of computing $g(x)$ is: $\Large \min \left ( \substack{\text{number of leaf-nodes}\\\text{in left-subtree of $ ... worst-case time complexity of the program is? $\Theta (n)$ $\Theta (n \log n)$ $\Theta(n^2)$ $\Theta (n^2\log n)$

commented 16 hours ago in DS by Shivateja MST (339 points) | 9.2k views

+64 votes

15 answers

31

GATE2016-1-54
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 sustain output ... needs to send $12$ $\text{megabytes}$ of data. The minimum time required to transmit the data is _____________ $\text{seconds}$.

commented 17 hours ago in Computer Networks by chandrikabhuyan8 (205 points) | 13.3k views

+1 vote

4 answers

32

ISRO2018-49
in a file which contains $1$ million records and the order of the tree is $100$, then what is the maximum number of nodes to be accessed if $B$+ tree index is used? $5$ $4$ $3$ $10$

commented 17 hours ago in Databases by priyesh9875 (239 points) | 2.8k views

+50 votes

6 answers

33

GATE2016-2-15
$N$ items are stored in a sorted doubly linked list. For a delete operation, a pointer is provided to the record to be deleted. For a decrease-key operation, a pointer is provided to the record on which the operation is to be performed. An algorithm performs the following operations on the list in ... put together? $O(\log^{2} N)$ $O(N)$ $O(N^{2})$ $\Theta\left(N^{2}\log N\right)$

commented 17 hours ago in DS by JashanArora Loyal (6.9k points) | 11k views

0 votes

1 answer

34

MadeEasy Test Series: Programming & DS - Programming In C
Consider the C node fragment given below: Which of the following true about above code if input is given as linked list of n-element in which for each node memory is created in heap area? A. Compiles successfully but execution may ... in else part. I think answer should be C. Because the return type is int node* Can someone please confirm.

answered 18 hours ago in Programming by pritishc Active (2.2k points) | 226 views

+20 votes

5 answers

35

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

answered 18 hours ago in Computer Networks by indra094 (15 points) | 5.6k views

0 votes

0 answers

36

ISI2015-MMA-80
Let $0 < \alpha < \beta < 1$. Then $ \Sigma_{k=1}^{\infty} \int_{1/(k+\beta)}^{1/(k+\alpha)} \frac{1}{1+x} dx$ is equal to $\log_e \frac{\beta}{\alpha}$ $\log_e \frac{1+ \beta}{1 + \alpha}$ $\log_e \frac{1+\alpha }{1+ \beta}$ $\infty$

commented 18 hours ago in Calculus by slow_but_detemined (455 points) | 26 views

+23 votes

5 answers

37

GATE2016-2-24
In an Ethernet local area network, which one of the following statements is TRUE? A station stops to sense the channel once it starts transmitting a frame. The purpose of the jamming signal is to pad the frames that are smaller than ... transmit the packet even after the collision is detected. The exponential back off mechanism reduces the probability of collision on retransmissions.

answered 18 hours ago in Computer Networks by JashanArora Loyal (6.9k points) | 3.1k views

+17 votes

4 answers

38

GATE1994-3.8
Give a relational algebra expression using only the minimum number of operators from $(∪, −)$ which is equivalent to $R$ $∩$ $S.$

commented 19 hours ago in Set Theory & Algebra by prithatiti (425 points) | 957 views

+2 votes

2 answers

39

ISRO2020-16
A computer which issues instructions in order, has only $2$ registers and $3$ opcodes $ADD, SUB$ and $MOV$. Consider $2$ ... is better in terms of memory accesses and by how many $MOV$ instructions ? Case $2,2$ Case $2,3$ Case $1,2$ Case $1,3$

answered 19 hours ago in CO and Architecture by nkg_master9 (181 points) | 216 views

+34 votes

4 answers

40

GATE2016-2-04
Consider the system, each consisting of $m$ linear equations in $n$ variables. If $m < n$, then all such systems have a solution. If $m > n$, then none of these systems has a solution. If $m = n$, then there exists a system which has a solution. Which one of the ... is CORRECT? $I, II$ and $III$ are true. Only $II$ and $III$ are true. Only $III$ is true. None of them is true.

answered 19 hours ago in Linear Algebra by JashanArora Loyal (6.9k points) | 4.7k views

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

Recent activity

50,737 questions

57,385 answers

198,548 comments

105,362 users