Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
coder_yash
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by coder_yash
1
answer
1
GATE CSE 2014 Set 1 | Question: 17
Which one of the following is FALSE? A basic block is a sequence of instructions where control enters the sequence at the beginning and exits at the end. Available expression analysis can be used for common subexpression elimination. Live variable ... be used for dead code elimination. $x=4*5 \Rightarrow x=20$ is an example of common subexpression elimination.
Which one of the following is FALSE?A basic block is a sequence of instructions where control enters the sequence at the beginning and exits at the end. Available express...
11.6k
views
commented
Feb 3, 2021
Compiler Design
gatecse-2014-set1
compiler-design
code-optimization
normal
+
–
9
answers
2
GATE CSE 2015 Set 1 | Question: 54
Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is_______________.
Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is_______________.
24.4k
views
commented
Jan 31, 2021
Graph Theory
gatecse-2015-set1
graph-theory
graph-connectivity
normal
graph-planarity
numerical-answers
+
–
7
answers
3
GATE CSE 2012 | Question: 24
Which of the following problems are decidable? Does a given program ever produce an output? If $L$ is a context-free language, then, is $\bar{L}$ also context-free? If $L$ is a regular language, then, is $\bar{L}$ also regular? If $L$ is a recursive language, then, is $\bar{L}$ also recursive? $1, 2, 3, 4$ $1, 2$ $2, 3, 4$ $3, 4$
Which of the following problems are decidable?Does a given program ever produce an output?If $L$ is a context-free language, then, is $\bar{L}$ also context-free?If $L$ i...
15.5k
views
commented
Jan 12, 2021
Theory of Computation
gatecse-2012
theory-of-computation
decidability
normal
+
–
5
answers
4
GATE CSE 2003 | Question: 67
Let $G =(V,E)$ be an undirected graph with a subgraph $G_1 = (V_1, E_1)$. Weights are assigned to edges of $G$ as follows. $w(e) = \begin{cases} 0 \text{, if } e \in E_1 \\1 \text{, otherwise} \end{cases}$ A single-source shortest path ... edges in the shortest paths from $v_1$ to all vertices of $G$ $G_1$ is connected $V_1$ forms a clique in $G$ $G_1$ is a tree
Let $G =(V,E)$ be an undirected graph with a subgraph $G_1 = (V_1, E_1)$. Weights are assigned to edges of $G$ as follows.$$w(e) = \begin{cases} 0 \text{, if } e \in E_...
19.9k
views
comment edited
Jan 10, 2021
Algorithms
gatecse-2003
algorithms
graph-algorithms
normal
+
–
4
answers
5
GATE CSE 1997 | Question: 2-1
Let $*$ be defined as $x * y = \bar{x} + y$. Let $z = x * y$. Value of $z * x$ is $\bar{x} + y$ $x$ $0$ $1$
Let $*$ be defined as $x * y = \bar{x} + y$. Let $z = x * y$. Value of $z * x$ is $\bar{x} + y$$x$$0$$1$
5.3k
views
commented
Dec 29, 2020
Digital Logic
gate1997
digital-logic
normal
boolean-algebra
+
–
8
answers
6
GATE CSE 2010 | Question: 18
Consider a $B^+$-tree in which the maximum number of keys in a node is $5$. What is the minimum number of keys in any non-root node? $1$ $2$ $3$ $4$
Consider a $B^+$-tree in which the maximum number of keys in a node is $5$. What is the minimum number of keys in any non-root node?$1$$2$$3$$4$
32.7k
views
commented
Dec 22, 2020
Databases
gatecse-2010
databases
b-tree
easy
+
–
4
answers
7
GATE CSE 1991 | Question: 01,xv
The maximum number of possible edges in an undirected graph with $n$ vertices and $k$ components is ______.
The maximum number of possible edges in an undirected graph with $n$ vertices and $k$ components is ______.
11.4k
views
comment edited
Dec 18, 2020
Graph Theory
gate1991
graph-theory
graph-connectivity
normal
fill-in-the-blanks
+
–
2
answers
8
GATE CSE 1994 | Question: 24
An independent set in a graph is a subset of vertices such that no two vertices in the subset are connected by an edge. An incomplete scheme for a greedy algorithm to find a maximum independent set in a tree is given below: V: Set of all ... I); Complete the algorithm by specifying the property of vertex $u$ in each case. What is the time complexity of the algorithm?
An independent set in a graph is a subset of vertices such that no two vertices in the subset are connected by an edge. An incomplete scheme for a greedy algorithm to fin...
5.7k
views
commented
Dec 17, 2020
Algorithms
gate1994
algorithms
graph-algorithms
normal
descriptive
+
–
3
answers
9
GATE CSE 1996 | Question: 2.15
Quick-sort is run on two inputs shown below to sort in ascending order taking first element as pivot $1, 2, 3, \dots n$ $n, n-1, n-2, \dots, 2, 1$ Let $C_1$ and $C_2$ be the number of comparisons made for the inputs (i) and (ii) respectively. Then, $C_1 < C_2$ $C_1 > C_2$ $C_1 = C_2$ we cannot say anything for arbitrary $n$
Quick-sort is run on two inputs shown below to sort in ascending order taking first element as pivot$1, 2, 3, \dots n$$n, n-1, n-2, \dots, 2, 1$Let $C_1$ and $C_2$ be the...
10.9k
views
commented
Dec 14, 2020
Algorithms
gate1996
algorithms
sorting
normal
+
–
5
answers
10
GATE CSE 1992 | Question: 02,ix
Following algorithm(s) can be used to sort $n$ in the range $[1\ldots n^3]$ in $O(n)$ time Heap sort Quick sort Merge sort Radix sort
Following algorithm(s) can be used to sort $n$ in the range $[1\ldots n^3]$ in $O(n)$ timeHeap sortQuick sortMerge sortRadix sort
16.5k
views
commented
Dec 14, 2020
Algorithms
gate1992
easy
algorithms
sorting
multiple-selects
+
–
4
answers
11
GATE CSE 2013 | Question: 33
Consider the DFA $A$ given below. Which of the following are FALSE? Complement of $L(A)$ is context-free. $L(A) = L((11^*0+0)(0 + 1)^*0^*1^*) $ For the language accepted by $A, A$ is the minimal DFA. $A$ accepts all strings over $\{0, 1\}$ of length at least $2$. 1 and 3 only 2 and 4 only 2 and 3 only 3 and 4 only
Consider the DFA $A$ given below. Which of the following are FALSE?Complement of $L(A)$ is context-free.$L(A) = L((11^*0+0)(0 + 1)^*0^*1^*) $For the language accepted by ...
16.2k
views
commented
Nov 8, 2020
Theory of Computation
gatecse-2013
theory-of-computation
finite-automata
normal
+
–
7
answers
12
GATE CSE 2007 | Question: 65
There are $n$ stations in slotted LAN. Each station attempts to transmit with a probability $p$ in each time slot. What is the probability that ONLY one station transmits in a given time slot? $np(1-p)^{n-1}$ $(1-p)^{n-1}$ $p(1-p)^{n-1}$ $1-(1-p)^{n-1}$
There are $n$ stations in slotted LAN. Each station attempts to transmit with a probability $p$ in each time slot. What is the probability that ONLY one station transmits...
13.8k
views
commented
Oct 4, 2020
Computer Networks
gatecse-2007
computer-networks
lan-technologies
probability
normal
+
–
6
answers
13
GATE CSE 2008 | Question: 82
Consider the following $\text{ER}$ diagram The minimum number of tables needed to represent $M$, $N$, $P$, $R1$, $R2$ is $2$ $3$ $4$ $5$
Consider the following $\text{ER}$ diagramThe minimum number of tables needed to represent $M$, $N$, $P$, $R1$, $R2$ is$2$$3$$4$$5$
26.2k
views
commented
Sep 23, 2020
Databases
gatecse-2008
databases
er-diagram
normal
+
–
4
answers
14
GATE CSE 2010 | Question: 42
Consider the following schedule for transactions $T1, T2$ and $T3:$ ... correct serialization of the above? $T1 \to T3 \to T2$ $T2 \to T1 \to T3$ $T2 \to T3 \to T1$ $T3 \to T1 \to T2$
Consider the following schedule for transactions $T1, T2$ and $T3:$$$\begin{array}{|c|c|c|}\hline \textbf{T1} & \textbf{T2} & \textbf{T3} \\\hline \text{Read(X)} & \text...
10.4k
views
commented
Sep 22, 2020
Databases
gatecse-2010
databases
transaction-and-concurrency
normal
+
–
2
answers
15
view serializability
t1 t2 w(x) r(x) w(x) commit commit Why is this not view serializable?
t1 t2w(x) r(x)w(x) commit commit...
1.6k
views
commented
Sep 22, 2020
Databases
databases
transaction-and-concurrency
view-serializable
+
–
6
answers
16
GATE CSE 2003 | Question: 79
A processor uses $\text{2-level}$ page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and physical addresses are both $32$ bits wide. The memory is byte addressable. For virtual to physical address translation, ... tables of this process is $\text{8 KB}$ $\text{12 KB}$ $\text{16 KB}$ $\text{20 KB}$
A processor uses $\text{2-level}$ page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and physical...
23.6k
views
commented
Sep 10, 2020
Operating System
gatecse-2003
operating-system
normal
virtual-memory
+
–
5
answers
17
GATE CSE 1995 | Question: 2.7
The address sequence generated by tracing a particular program executing in a pure demand based paging system with $100$ records per page with $1$ free main memory frame is recorded as follows. What is the number of page faults? $0100, 0200, 0430, 0499, 0510, 0530, 0560, 0120, 0220, 0240, 0260, 0320, 0370$ $13$ $8$ $7$ $10$
The address sequence generated by tracing a particular program executing in a pure demand based paging system with $100$ records per page with $1$ free main memory frame ...
16.0k
views
commented
Sep 8, 2020
Operating System
gate1995
operating-system
page-replacement
normal
+
–
7
answers
18
GATE IT 2007 | Question: 43
An error correcting code has the following code words: $00000000, 00001111, 01010101, 10101010, 11110000$. What is the maximum number of bit errors that can be corrected? $0$ $1$ $2$ $3$
An error correcting code has the following code words: $00000000, 00001111, 01010101, 10101010, 11110000$. What is the maximum number of bit errors that can be corrected?...
25.5k
views
commented
Aug 8, 2020
Computer Networks
gateit-2007
computer-networks
error-detection
normal
+
–
1
answer
19
Made Easy Test Series:Algorithm-Time Complexity
Consider a procedure $find()$ which take array of $n$ integers as input, and produce pair of element of array whose difference is not greater than the difference of any other pair of element of that array. Which of the following represent ... Here we need to sort first and then need to compare adjacent element right?? Then what will be complexity??
Consider a procedure $find()$ which take array of $n$ integers as input, and produce pair of element of array whose difference is not greater than the difference of any o...
2.0k
views
commented
Apr 18, 2020
Algorithms
algorithms
made-easy-test-series
time-complexity
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register