Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
gvinay
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by gvinay
0
votes
1
GATE CSE 2014 Set 1 | Question: 47
A function $f(x)$ is continuous in the interval $[0,2]$. It is known that $f(0) = f(2) = -1$ and $f(1) = 1$. Which one of the following statements must be true? There exists a $y$ in the interval $(0,1)$ such that $f(y) = f(y+1)$ For every $y$ ... the function in the interval $(0,2)$ is $1$ There exists a $y$ in the interval $(0,1)$ such that $f(y)$ = $-f(2-y)$
A function $f(x)$ is continuous in the interval $[0,2]$. It is known that $f(0) = f(2) = -1$ and $f(1) = 1$. Which one of the following statements must be true?There exis...
20.7k
views
answered
Nov 20, 2023
Calculus
gatecse-2014-set1
calculus
continuity
normal
+
–
0
votes
2
GATE CSE 2008 | Question: 80
The subset-sum problem is defined as follows. Given a set of $n$ positive integers, $S = \{ a_1, a_2, a_3, \dots , a_n \}$, and positive integer $W$, is there a subset of $S$ whose elements sum to $W$? A dynamic program for solving this problem uses a $\text{2-dimensional}$ Boolean array, ... $X[i, j] = X[i-1, j] \wedge X[i-1, j-a_i]$
The subset-sum problem is defined as follows. Given a set of $n$ positive integers, $S = \{ a_1, a_2, a_3, \dots , a_n \}$, and positive integer $W$, is there a subset of...
11.6k
views
answered
Nov 11, 2023
Algorithms
gatecse-2008
algorithms
normal
dynamic-programming
+
–
0
votes
3
GATE CSE 1997 | Question: 4.7
A priority queue $Q$ is used to implement a stack that stores characters. PUSH (C) is implemented as INSERT $(Q, C, K)$ where $K$ is an appropriate integer key chosen by the implementation. POP is implemented as ... For a sequence of operations, the keys chosen are in non-increasing order non-decreasing order strictly increasing order strictly decreasing order
A priority queue $Q$ is used to implement a stack that stores characters. PUSH (C) is implemented as INSERT $(Q, C, K)$ where $K$ is an appropriate integer key chosen by ...
24.1k
views
answered
Oct 31, 2023
DS
gate1997
data-structures
stack
normal
priority-queue
+
–
0
votes
4
GATE CSE 2012 | Question: 35
Suppose a circular queue of capacity $(n −1)$ elements is implemented with an array of $n$ elements. Assume that the insertion and deletion operations are carried out using REAR and FRONT as array index variables, respectively. Initially, $REAR = FRONT = 0$. The conditions to detect ... : $(REAR+1) \mod n == FRONT$ full: $(FRONT+1) \mod n == REAR$ empty: $REAR == FRONT$
Suppose a circular queue of capacity $(n −1)$ elements is implemented with an array of $n$ elements. Assume that the insertion and deletion operations are carried out u...
24.0k
views
answered
Oct 31, 2023
DS
gatecse-2012
data-structures
queue
normal
+
–
2
votes
5
GATE CSE 1999 | Question: 2.11
Which of the following is/are advantage(s) of virtual memory? Faster access to memory on an average. Processes can be given protected address spaces. Linker can assign addresses independent of where the program will be loaded in physical memory. Program larger than the physical memory size can be run.
Which of the following is/are advantage(s) of virtual memory?Faster access to memory on an average.Processes can be given protected address spaces.Linker can assign addre...
13.7k
views
answered
Oct 22, 2023
Operating System
gate1999
operating-system
virtual-memory
easy
+
–
0
votes
6
GATE CSE 1994 | Question: 3.8
Give a relational algebra expression using only the minimum number of operators from $(∪, −)$ which is equivalent to $R$ $∩$ $S.$
Give a relational algebra expression using only the minimum number of operators from $(∪, −)$ which is equivalent to $R$ $∩$ $S.$
6.9k
views
answered
Oct 9, 2023
Databases
gate1994
databases
relational-algebra
normal
descriptive
+
–
2
votes
7
GATE CSE 1994 | Question: 3.7
An instance of a relational scheme $R(A, B, C)$ has distinct values for attribute $A$. Can you conclude that $A$ is a candidate key for $R?$
An instance of a relational scheme $R(A, B, C)$ has distinct values for attribute $A$. Can you conclude that $A$ is a candidate key for $R?$
8.9k
views
answered
Oct 9, 2023
Databases
gate1994
databases
easy
database-normalization
candidate-key
descriptive
+
–
1
votes
8
GATE CSE 2014 Set 3 | Question: 22
A prime attribute of a relation scheme $R$ is an attribute that appears in all candidate keys of $R$ in some candidate key of $R$ in a foreign key of $R$ only in the primary key of $R$
A prime attribute of a relation scheme $R$ is an attribute that appearsin all candidate keys of $R$in some candidate key of $R$in a foreign key of $R$only in the primary ...
13.0k
views
answered
Oct 8, 2023
Databases
gatecse-2014-set3
databases
easy
candidate-key
+
–
0
votes
9
GATE CSE 1998 | Question: 2.8
Which of the following operations is commutative but not associative? AND OR NAND EXOR
Which of the following operations is commutative but not associative?ANDORNANDEXOR
9.1k
views
answered
Sep 29, 2023
Digital Logic
gate1998
digital-logic
easy
boolean-algebra
+
–
0
votes
10
GATE CSE 2014 Set 3 | Question: 44
The memory access time is $1$ nanosecond for a read operation with a hit in cache, $5$ nanoseconds for a read operation with a miss in cache, $2$ nanoseconds for a write operation with a hit in cache and $10$ nanoseconds for a write ... cache hit-ratio is $0.9$. The average memory access time (in nanoseconds) in executing the sequence of instructions is ______.
The memory access time is $1$ nanosecond for a read operation with a hit in cache, $5$ nanoseconds for a read operation with a miss in cache, $2$ nanoseconds for a write ...
23.7k
views
answered
Sep 28, 2023
CO and Architecture
gatecse-2014-set3
co-and-architecture
cache-memory
numerical-answers
normal
+
–
1
votes
11
GATE CSE 2014 Set 2 | Question: 18
Which one of the following is NOT performed during compilation? Dynamic memory allocation Type checking Symbol table management Inline expansion
Which one of the following is NOT performed during compilation?Dynamic memory allocationType checkingSymbol table managementInline expansion
9.2k
views
answered
Sep 27, 2023
Compiler Design
gatecse-2014-set2
compiler-design
easy
runtime-environment
+
–
0
votes
12
GATE CSE 1987 | Question: 1-xi
In a compiler the module that checks every character of the source text is called: The code generator. The code optimiser. The lexical analyser. The syntax analyser.
In a compiler the module that checks every character of the source text is called:The code generator.The code optimiser.The lexical analyser.The syntax analyser.
6.3k
views
answered
Sep 21, 2023
Compiler Design
gate1987
compiler-design
compilation-phases
+
–
3
votes
13
GATE CSE 2016 Set 1 | Question: 46
Consider the following Syntax Directed Translation Scheme $( SDTS )$, with non-terminals $\{S,A \}$ and terminals $\{a,b \}$. $S \to aA \quad \{\text{print }1\}$ $S \to a \quad \{\text{print }2\}$ $A \to Sb \quad \{\text{print }3\}$ Using the above $SDTS$ ... printed by a bottom-up parser, for the input $aab$ is: $1 \ 3 \ 2 $ $2 \ 2 \ 3 $ $2 \ 3 \ 1 $ syntax error
Consider the following Syntax Directed Translation Scheme $( SDTS )$, with non-terminals $\{S,A \}$ and terminals $\{a,b \}$. $S \to aA \quad \{\text{print }1\}...
10.5k
views
answered
Sep 21, 2023
Compiler Design
gatecse-2016-set1
compiler-design
syntax-directed-translation
normal
+
–
1
votes
14
GATE CSE 2003 | Question: 58
Consider the translation scheme shown below. $S \rightarrow T\;R$ $R \rightarrow + T \{\text{print}( +');\} R\mid \varepsilon$ $T \rightarrow$ num $\{\text{print}$(num.val)$;\}$ Here num is a token that represents an integer and num.val represents the corresponding integer value. For an ... scheme will print $9 + 5 + 2$ $9 \ 5 + 2 +$ $9 \ 5 \ 2 + +$ $+ + 9 \ 5 \ 2$
Consider the translation scheme shown below.$S \rightarrow T\;R$$R \rightarrow + T \{\text{print}(‘+’);\} R\mid \varepsilon$$T \rightarrow$ num $\{\text{print}$(num....
12.5k
views
answered
Sep 21, 2023
Compiler Design
gatecse-2003
compiler-design
grammar
normal
+
–
0
votes
15
GATE CSE 1997 | Question: 1.6
In the following grammar $X ::= X \oplus Y \mid Y$ $Y::= Z * Y \mid Z$ $Z::= id $ Which of the following is true? $\text{ }\oplus\text{'}$ is left associative while $\text{ }*\text{'}$ ... $\text{ }\oplus\text{'}$ is right associative while $\text{ }*\text{'}$ is left associative None of the above
In the following grammar$X ::= X \oplus Y \mid Y$$Y::= Z * Y \mid Z$$Z::= id $Which of the following is true?$\text{‘}\oplus\text{’}$ is left associative while $\text...
6.6k
views
answered
Sep 21, 2023
Compiler Design
gate1997
compiler-design
grammar
normal
+
–
1
votes
16
GATE IT 2007 | Question: 14
Consider a $TCP$ connection in a state where there are no outstanding $ACK$s. The sender sends two segments back to back. The sequence numbers of the first and second segments are $230$ and $290$ respectively. The first segment was lost, but the second segment was received correctly ... $Y$ (in that order) are $60$ and $290$ $230$ and $291$ $60$ and $231$ $60$ and $230$
Consider a $TCP$ connection in a state where there are no outstanding $ACK$s. The sender sends two segments back to back. The sequence numbers of the first and second seg...
10.4k
views
answered
Sep 17, 2023
Computer Networks
gateit-2007
computer-networks
tcp
normal
+
–
0
votes
17
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
answered
Aug 22, 2022
Theory of Computation
gatecse-2012
theory-of-computation
decidability
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register