Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by mani312
5
answers
1
GATE2010 TF: GA-10
A student is answering a multiple choice examination with $65$ questions with a marking scheme as follows$:$ $i)$ $1$ marks for each correct answer $,ii)$ $-\frac{1}{4}$ for a wrong answer $,iii)$ $-\frac{1}{8}$ for a question that has not been attempted ... gets $37$ marks in the test then the least possible number of questions the student has NOT answered is$:$ $6$ $5$ $7$ $4$
A student is answering a multiple choice examination with $65$ questions with a marking scheme as follows$:$ $i)$ $1$ marks for each correct answer $,ii)$ $-\frac{1}{4}...
2.6k
views
commented
Jan 27, 2022
Quantitative Aptitude
general-aptitude
quantitative-aptitude
gate2010-tf
numerical-computation
+
–
6
answers
2
GATE CSE 2017 Set 2 | Question: GA-8
$X$ is a $30$ digit number starting with the digit $4$ followed by the digit $7$. Then the number $X^3$ will have $90$ digits $91$ digits $92$ digits $93$ digits
$X$ is a $30$ digit number starting with the digit $4$ followed by the digit $7$. Then the number $X^3$ will have$90$ digits$91$ digits$92$ digits$93$ digits
11.6k
views
answered
Jan 27, 2022
Quantitative Aptitude
gatecse-2017-set2
quantitative-aptitude
numerical-computation
number-representation
+
–
4
answers
3
GATE CSE 2017 Set 2 | Question: GA-9
The number of roots of $e^{x}+0.5x^{2}-2=0$ in the range $[-5,5]$ is $0$ $1$ $2$ $3$
The number of roots of $e^{x}+0.5x^{2}-2=0$ in the range $[-5,5]$ is$0$$1$$2$$3$
13.0k
views
commented
Jan 24, 2022
Quantitative Aptitude
gatecse-2017-set2
quantitative-aptitude
normal
maxima-minima
calculus
+
–
1
answer
4
GATE ECE 2021 | GA Question: 9
The number of minutes spent by two students, $X$ and $Y$, exercising every day in a given week are shown in the bar chart above. The number of days in the given week in which one of the students spent a minimum of $10\%$ more than the other student, on a given day, is $4$ $5$ $6$ $7$
The number of minutes spent by two students, $X$ and $Y$, exercising every day in a given week are shown in the bar chart above.The number of days in the given week in wh...
2.0k
views
commented
Jan 12, 2022
Quantitative Aptitude
gateec-2021
quantitative-aptitude
data-interpretation
bar-graph
+
–
9
answers
5
GATE CSE 2005 | Question: 44
What is the minimum number of ordered pairs of non-negative numbers that should be chosen to ensure that there are two pairs $(a,b)$ and $(c,d)$ in the chosen set such that, $a \equiv c\mod 3$ and $b \equiv d \mod 5$ $4$ $6$ $16$ $24$
What is the minimum number of ordered pairs of non-negative numbers that should be chosen to ensure that there are two pairs $(a,b)$ and $(c,d)$ in the chosen set such th...
13.5k
views
commented
Jan 11, 2022
Combinatory
gatecse-2005
set-theory&algebra
normal
pigeonhole-principle
+
–
6
answers
6
GATE CSE 2016 Set 2 | Question: 22
Suppose a database schedule $S$ involves transactions $T_1,\ldots,T_n$ . Construct the precedence graph of $S$ with vertices representing the transactions and edges representing the conflicts. If $S$ is serializable, which one of ... to yield a serial schedule? Topological order Depth-first order Breadth-first order Ascending order of the transaction indices
Suppose a database schedule $S$ involves transactions $T_1,\ldots,T_n$ . Construct the precedence graph of $S$ with vertices representing the transactions and edges repr...
13.3k
views
commented
Jan 3, 2022
Databases
gatecse-2016-set2
databases
transaction-and-concurrency
normal
+
–
10
answers
7
GATE CSE 2014 Set 1 | Question: 44
An access sequence of cache block addresses is of length $N$ and contains n unique block addresses. The number of unique block addresses between two consecutive accesses to the same block address is bounded above by $k$. What is the miss ratio if the access sequence is passed ... $\left(\dfrac{1}{N}\right)$ $\left(\dfrac{1}{A}\right)$ $\left(\dfrac{k}{n}\right)$
An access sequence of cache block addresses is of length $N$ and contains n unique block addresses. The number of unique block addresses between two consecutive accesses ...
22.8k
views
commented
Dec 26, 2021
CO and Architecture
gatecse-2014-set1
co-and-architecture
cache-memory
normal
+
–
6
answers
8
GATE CSE 2015 Set 1 | Question: 53
Suppose that the stop-and-wait protocol is used on a link with a bit rate of $64$ $\text{kilobits}$ per second and $20$ $\text{milliseconds}$ propagation delay. Assume that the transmission time for the acknowledgment and the processing time ... . Then the minimum frame size in bytes to achieve a link utilization of at least $50$ $\text{%}$ is_________________.
Suppose that the stop-and-wait protocol is used on a link with a bit rate of $64$ $\text{kilobits}$ per second and $20$ $\text{milliseconds}$ propagation delay. Assume th...
26.6k
views
commented
Dec 23, 2021
Computer Networks
gatecse-2015-set1
computer-networks
stop-and-wait
normal
numerical-answers
+
–
3
answers
9
GATE CSE 2018 | Question: 36
Consider the following problems. $L(G)$ denotes the language generated by a grammar $G$. L(M) denotes the language accepted by a machine $M$. For an unrestricted grammar $G$ and a string $w$, whether $w \in L(G)$ Given a Turing machine ... is correct? Only I and II are undecidable Only II is undecidable Only II and IV are undecidable Only I, II and III are undecidable
Consider the following problems. $L(G)$ denotes the language generated by a grammar $G$. L(M) denotes the language accepted by a machine $M$.For an unrestricted grammar $...
16.9k
views
commented
Dec 17, 2021
Theory of Computation
gatecse-2018
theory-of-computation
decidability
easy
2-marks
+
–
2
answers
10
GATE CSE 2016 Set 1 | Question: GA07
Indian currency notes show the denomination indicated in at least seventeen languages. If this is not an indication of the nation's diversity, nothing else is. Which of the following can be logically inferred from the above ... notes have sufficient space for all the Indian languages. Linguistic pluralism is strong evidence of India's diversity.
Indian currency notes show the denomination indicated in at least seventeen languages. If this is not an indication of the nation's diversity, nothing else is.Which of th...
3.3k
views
commented
Nov 29, 2021
Verbal Aptitude
gatecse-2016-set1
verbal-aptitude
verbal-reasoning
normal
+
–
9
answers
11
GATE IT 2006 | Question: 25
Consider the undirected graph $G$ defined as follows. The vertices of $G$ are bit strings of length $n$. We have an edge between vertex $u$ and vertex $v$ if and only if $u$ and $v$ differ in exactly one bit position (in other words, $v$ can be obtained from $u$ by ... $\left(\frac{1}{n}\right)$ $\left(\frac{2}{n}\right)$ $\left(\frac{3}{n}\right)$
Consider the undirected graph $G$ defined as follows. The vertices of $G$ are bit strings of length $n$. We have an edge between vertex $u$ and vertex $v$ if and only if ...
13.3k
views
answered
Nov 18, 2021
Graph Theory
gateit-2006
graph-theory
graph-coloring
normal
+
–
17
answers
12
GATE CSE 2004 | Question: 62
A 4-bit carry look ahead adder, which adds two 4-bit numbers, is designed using AND, OR, NOT, NAND, NOR gates only. Assuming that all the inputs are available in both complemented and uncomplemented forms and the delay of each gate is one time ... the carry network has been implemented using two-level AND-OR logic. 4 time units 6 time units 10 time units 12 time units
A 4-bit carry look ahead adder, which adds two 4-bit numbers, is designed using AND, OR, NOT, NAND, NOR gates only. Assuming that all the inputs are available in both com...
32.8k
views
answered
Nov 12, 2021
Digital Logic
gatecse-2004
digital-logic
normal
adder
+
–
5
answers
13
What is the time complexity to construct binary search tree when inorder and postorder traversal of tree is given?
6.8k
views
comment edited
Nov 10, 2021
DS
data-structures
binary-search-tree
+
–
8
answers
14
GATE CSE 2003 | Question: 66
The cube root of a natural number $n$ is defined as the largest natural number $m$ such that $(m^3 \leq n)$ . The complexity of computing the cube root of $n$ ($n$ is represented by binary notation) is $O(n)$ but not $O(n^{0.5})$ $O(n^{0.5})$ ... constant $m>0$ $O( (\log \log n)^k )$ for some constant $k > 0.5$, but not $O( (\log \log n)^{0.5} )$
The cube root of a natural number $n$ is defined as the largest natural number $m$ such that $(m^3 \leq n)$ . The complexity of computing the cube root of $n$ ($n$ is rep...
24.3k
views
answered
Nov 9, 2021
Algorithms
gatecse-2003
algorithms
time-complexity
normal
+
–
2
answers
15
GATE CSE 1990 | Question: 12b
Consider the following problem. Given $n$ positive integers $a_{1}, a_{2}\dots a_n,$ it is required to partition them in to two parts $A$ and $B$ ... that part whose sum in smaller at that step. Give an example with $n=5$ for which the solution produced by the greedy algorithm is not optimal.
Consider the following problem. Given $n$ positive integers $a_{1}, a_{2}\dots a_n,$ it is required to partition them in to two parts $A$ and $B$ such that, $\displaystyl...
2.6k
views
commented
Nov 9, 2021
Algorithms
gate1990
descriptive
algorithms
algorithm-design-technique
+
–
8
answers
16
GATE CSE 2007 | Question: 53
Consider the following two statements: P: Every regular grammar is LL(1) Q: Every regular set has a LR(1) grammar Which of the following is TRUE? Both P and Q are true P is true and Q is false P is false and Q is true Both P and Q are false
Consider the following two statements:P: Every regular grammar is LL(1)Q: Every regular set has a LR(1) grammarWhich of the following is TRUE?Both P and Q are trueP is tr...
35.8k
views
commented
Nov 8, 2021
Compiler Design
gatecse-2007
compiler-design
grammar
normal
+
–
4
answers
17
GATE CSE 1998 | Question: 14
Let $G_1 = (N, T, P, S_1)$ be a CFG where, $N=\{S_1, A, B\},T=\{a, b\}$ and $P$ ... $5$ production rules. Is $L_2$ inherently ambiguous?
Let $G_1 = (N, T, P, S_1)$ be a CFG where, $N=\{S_1, A, B\},T=\{a, b\}$ and $P$ is given by$$\begin{array}{l|l}S_1 \rightarrow a S_1 b &S_1 \rightarrow a B b \\S_1 \right...
4.4k
views
commented
Nov 8, 2021
Compiler Design
gate1998
compiler-design
grammar
descriptive
+
–
2
answers
18
GATE CSE 2001 | Question: 1.8
Which of the following statements is false? Virtual memory implements the translation of a program's address space into physical memory address space Virtual memory allows each program to exceed the size of the primary memory Virtual memory increases the degree of multiprogramming Virtual memory reduces the context switching overhead
Which of the following statements is false?Virtual memory implements the translation of a program's address space into physical memory address spaceVirtual memory allows ...
21.6k
views
commented
Oct 30, 2021
Operating System
gatecse-2001
operating-system
virtual-memory
normal
+
–
4
answers
19
GATE CSE 2017 Set 1 | Question: 42
In a database system, unique timestamps are assigned to each transaction using Lamport's logical clock. Let $TS(T_{1})$ and $TS(T_{2})$ be the timestamps of transactions $T_{1}$ and $T_{2}$ ... -free. The database system is starvation-free, but not deadlock-free. The database system is neither deadlock-free nor starvation-free.
In a database system, unique timestamps are assigned to each transaction using Lamport's logical clock. Let $TS(T_{1})$ and $TS(T_{2})$ be the timestamps of transactions ...
27.1k
views
commented
Oct 28, 2021
Databases
gatecse-2017-set1
databases
timestamp-ordering
deadlock-prevention-avoidance-detection
normal
+
–
4
answers
20
GATE CSE 2021 Set 2 | Question: 48
Consider a three-level page table to translate a $39-$bit virtual address to a physical address as shown below: The page size is $\text{4 KB} \;(1\text{KB}=2^{10}$ bytes$)$ and page table entry size at every level is $8$ bytes. A ... $P$ across all levels is _________ $\text{KB}$.
Consider a three-level page table to translate a $39-$bit virtual address to a physical address as shown below:The page size is $\text{4 KB} \;(1\text{KB}=2^{10}$ bytes$)...
28.8k
views
commented
Oct 23, 2021
Operating System
gatecse-2021-set2
numerical-answers
operating-system
memory-management
page-replacement
2-marks
+
–
2
answers
21
GATE IT 2006 | Question: 42
A cache line is $64$ bytes. The main memory has latency $32$ $ns$ and bandwidth $1$ $GBytes/s$. The time required to fetch the entire cache line from the main memory is: $32$ $ns$ $64$ $ns$ $96$ $ns$ $128$ $ns$
A cache line is $64$ bytes. The main memory has latency $32$ $ns$ and bandwidth $1$ $GBytes/s$. The time required to fetch the entire cache line from the main memory is:$...
11.9k
views
commented
Oct 13, 2021
CO and Architecture
gateit-2006
co-and-architecture
cache-memory
normal
+
–
7
answers
22
GATE IT 2006 | Question: 21
Consider the following first order logic formula in which $R$ is a binary relation symbol. $∀x∀y (R(x, y) \implies R(y, x))$ The formula is satisfiable and valid satisfiable and so is its negation unsatisfiable but its negation is valid satisfiable but its negation is unsatisfiable
Consider the following first order logic formula in which $R$ is a binary relation symbol.$∀x∀y (R(x, y) \implies R(y, x))$The formula issatisfiable and validsatisfia...
13.5k
views
commented
Sep 29, 2021
Mathematical Logic
gateit-2006
mathematical-logic
normal
first-order-logic
+
–
3
answers
23
GATE CSE 2008 | Question: 76
Delayed branching can help in the handling of control hazards For all delayed conditional branch instructions, irrespective of whether the condition evaluates to true or false, The instruction following the conditional branch instruction in memory is ... The first instruction in the taken path is executed The branch takes longer to execute than any other instruction
Delayed branching can help in the handling of control hazardsFor all delayed conditional branch instructions, irrespective of whether the condition evaluates to true or f...
18.0k
views
commented
Aug 19, 2021
CO and Architecture
gatecse-2008
co-and-architecture
pipelining
normal
+
–
3
answers
24
GATE IT 2007 | Question: 37
Consider a Direct Mapped Cache with 8 cache blocks (numbered $0-7$). If the memory block requests are in the following order $3, 5, 2, 8, 0, 63, 9,16, 20, 17, 25, 18, 30, 24, 2, 63, 5, 82,17, 24.$ Which of the following memory blocks will not be in the cache at the end of the sequence ? $3$ $18$ $20$ $30$
Consider a Direct Mapped Cache with 8 cache blocks (numbered $0-7$). If the memory block requests are in the following order$3, 5, 2, 8, 0, 63, 9,16, 20, 17, 25, 18, 30, ...
8.1k
views
commented
Aug 17, 2021
CO and Architecture
gateit-2007
co-and-architecture
cache-memory
normal
+
–
5
answers
25
GATE CSE 2007 | Question: 51
Consider the following C program segment: int IsPrime (n) { int i, n; for (i=2; i<=sqrt(n);i++) if(n%i == 0) {printf("Not Prime \n"); return 0;} return 1; } Let $T(n)$ denote number of times the $for$ loop is executed by the program on input $n$. Which of ... $T(n) = O(n) \: \text{ and } T(n) = \Omega(\sqrt{n})$ None of the above
Consider the following C program segment:int IsPrime (n) { int i, n; for (i=2; i<=sqrt(n);i++) if(n%i == 0) {printf("Not Prime \n"); return 0;} return 1; }Let $T(n)$ deno...
14.7k
views
comment reshown
Jun 17, 2021
Algorithms
gatecse-2007
algorithms
time-complexity
normal
+
–
7
answers
26
GATE CSE 2021 Set 1 | Question: 30
Consider the following recurrence relation. $T\left ( n \right )=\left\{\begin{array} {lcl} T(n ∕ 2)+T(2n∕5)+7n & \text{if} \; n>0\\1 & \text{if}\; n=0 \end{array}\right.$ Which one of the following options is correct? $T(n)=\Theta (n^{5/2})$ $T(n)=\Theta (n\log n)$ $T(n)=\Theta (n)$ $T(n)=\Theta ((\log n)^{5/2})$
Consider the following recurrence relation.$$T\left ( n \right )=\left\{\begin{array} {lcl} T(n ∕ 2)+T(2n∕5)+7n & \text{if} \; n>0\\1 & \text{if}\; n=0 \end{array}\r...
23.9k
views
commented
Jun 16, 2021
Algorithms
gatecse-2021-set1
algorithms
recurrence-relation
time-complexity
2-marks
+
–
13
answers
27
GATE CSE 2013 | Question: 9
What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon and unit-production (i.e., of type $A \rightarrow \epsilon$ and $A \rightarrow a$) to parse a string with $n$ tokens? $n/2$ $n-1$ $2n-1$ $2^{n}$
What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon and unit-production (i.e., of type $A \rightarrow \epsilo...
35.3k
views
answered
Apr 29, 2021
Compiler Design
gatecse-2013
compiler-design
parsing
normal
+
–
7
answers
28
GATE CSE 2005 | Question: 83a
Statement for Linked Answer Questions 83a & 83b: Consider the following expression grammar. The semantic rules for expression evaluation are stated next to each grammar production. ... a reduce action It detects shift-reduce conflict, and resolves the conflict in favor of a reduce over a shift action
Statement for Linked Answer Questions 83a & 83b:Consider the following expression grammar. The semantic rules for expression evaluation are stated next to each grammar pr...
20.5k
views
commented
Apr 28, 2021
Compiler Design
gatecse-2005
compiler-design
parsing
difficult
+
–
7
answers
29
GATE CSE 2017 Set 2 | Question: 32
Consider the following expression grammar $G$: $E \rightarrow E-T \mid T$ $T \rightarrow T + F \mid F$ $F \rightarrow (E) \mid id$ Which of the following grammars is not left recursive, but is equivalent to $G$? $E \rightarrow E-T \mid T$ ... $E \rightarrow TX \mid (TX)$ $X \rightarrow -TX \mid +TX \mid \epsilon$ $T \rightarrow id$
Consider the following expression grammar $G$:$E \rightarrow E-T \mid T$$T \rightarrow T + F \mid F$$F \rightarrow (E) \mid id$Which of the following grammars is not left...
11.0k
views
commented
Apr 27, 2021
Compiler Design
gatecse-2017-set2
grammar
+
–
6
answers
30
GATE CSE 1995 | Question: 1.17
A binary tree $T$ has $n$ leaf nodes. The number of nodes of degree $2$ in $T$ is $\log_2 n$ $n-1$ $n$ $2^n$
A binary tree $T$ has $n$ leaf nodes. The number of nodes of degree $2$ in $T$ is$\log_2 n$$n-1$$n$$2^n$
36.1k
views
commented
Feb 8, 2021
DS
gate1995
data-structures
binary-tree
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register