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 toxicdesire
7
answers
1
GATE CSE 2021 Set 2 | Question: 3
Consider the following $\text{ANSI C}$ program: int main () { Integer x; return 0; } Which one of the following phases in a seven-phase $C$ compiler will throw an error? Lexical analyzer Syntax analyzer Semantic analyzer Machine dependent optimizer
Consider the following $\text{ANSI C}$ program:int main () { Integer x; return 0; }Which one of the following phases in a seven-phase $C$ compiler will throw an error?Lex...
17.3k
views
commented
Feb 19, 2021
Compiler Design
gatecse-2021-set2
compilation-phases
compiler-design
1-mark
+
–
1
answer
2
GATE Overflow Test Series | Mock GATE | Test 3 | Question: 50
A device with transfer rate of $25$ KBps is connected to a CPU. Data is transferred byte-wise. Let the interrupt overhead be $12$ microseconds. The byte transfer time between the device interface register and CPU or memory is negligible. What is the minimum performance gain of operating device under interrupt driven mode?
A device with transfer rate of $25$ KBps is connected to a CPU. Data is transferred byte-wise. Let the interrupt overhead be $12$ microseconds. The byte transfer time bet...
594
views
comment edited
Feb 12, 2021
CO and Architecture
go2025-mockgate-3
numerical-answers
co-and-architecture
dma
+
–
1
answer
3
GATE Overflow Test Series | Mock GATE | Test 4 | Question: 50
Consider the following synchronization solution for Producer-Consumer problem. Here, counter is a shared variable initialized to 0, buffer is the shared memory region and increment and decrement operations take place atomically ... The solution works fine for Producer Consumer problem. Progress is violating. Buffer overflow is possible.
Consider the following synchronization solution for Producer-Consumer problem. Here, counter is a shared variable initialized to 0, buffer is the shared memory region and...
411
views
commented
Feb 6, 2021
Operating System
go2025-mockgate-4
operating-system
process-synchronization
+
–
1
answer
4
GATE Overflow Test Series | Mock GATE | Test 3 | Question: 36
Consider a matrix Type-$A$ such that $[A_{ij}]_{3 \times 3}=X_{\text{base}5}.$ The elements of matrix are also dependent on their position as, if $(i+j)\%2=0$, then $A_{ij}$ is even and else $A_{ij}$ is odd. Calculate the number of non-symmetric matrices of Type-$A$ ________
Consider a matrix Type-$A$ such that $[A_{ij}]_{3 \times 3}=X_{\text{base}5}.$ The elements of matrix are also dependent on their position as, if $(i+j)\%2=0$, then $A_{i...
596
views
commented
Jan 31, 2021
Linear Algebra
go2025-mockgate-3
numerical-answers
linear-algebra
matrix
+
–
1
answer
5
GATE Overflow Test Series | Mock GATE | Test 2 | Question: 59
Which of the following is/are correct? (Mark all the appropriate choices) If $X$ and $Y$ are finite sets and $f\colon X\to Y$ is one-one (injective), then $\mid X \mid \le \mid Y \mid.$ If $X$ and $Y$ ... $f$ is one-to-one. If $f\circ g$ is one-to-one, then $g$ is one-to-one.
Which of the following is/are correct? (Mark all the appropriate choices)If $X$ and $Y$ are finite sets and $f\colon X\to Y$ is one-one (injective), then $\mid X \mid \le...
477
views
commented
Jan 22, 2021
Set Theory & Algebra
go2025-mockgate-2
functions
multiple-selects
+
–
1
answer
6
GATE Overflow Test Series | Spatial and Analytical Aptitude | Test 1 | Question: 13
Malik wants to plant trees in his garden. If the number of trees in each row is the same and if there are either $120,72,48,36,$ or $84$ rows, then no tree is left. The least number of trees Malik has is __________
Malik wants to plant trees in his garden. If the number of trees in each row is the same and if there are either $120,72,48,36,$ or $84$ rows, then no tree is left. The l...
174
views
commented
Dec 28, 2020
Analytical Aptitude
go2025-spatial-and-analytical-aptitude-1
numerical-answers
numerical-relations-and-reasoning
+
–
1
answer
7
GATE Overflow Test Series | Compiler Design | Test 1 | Question: 14
The number of tokens in the following C code segment is ______ switch(value) { case 1 : y = z*w; continue; case 2 : a = b***c; break; default : y = y++; break; }
The number of tokens in the following C code segment is ______switch(value) { case 1 : y = z*w; continue; case 2 : a = b *c; break; default : y = y++; break; }
356
views
comment edited
Dec 20, 2020
Compiler Design
go2025-cd-1
numerical-answers
lexical-analysis
+
–
1
answer
8
GATE Overflow Test Series | Compiler Design | Test 1 | Question: 6
Which of the following is $TRUE$ regarding $LL(0)$ grammar? (Mark all the appropriate choices) We can have an $LL(0)$ ... has prefix property We cannot have an $LL(0)$ grammar for any regular language if it contains more than one string
Which of the following is $TRUE$ regarding $LL(0)$ grammar? (Mark all the appropriate choices)We can have an $LL(0)$ grammar for any finite language but not necessarily f...
405
views
commented
Dec 20, 2020
Compiler Design
go2025-cd-1
parsing
multiple-selects
+
–
3
answers
9
GATE Overflow Test Series | Algorithms | Test 1 | Question: 27
You are given an array $A$ of $n$ elements. The best possible algorithm to find two numbers in $A$ which sum to the largest number in $A$ will run in (assuming comparison based sorting) (Mark all CORRECT choices) $O(n)$ `$\Omega(n \log n)$ $\Omega( n^2\log n)$ $O(n^2)$
You are given an array $A$ of $n$ elements. The best possible algorithm to find two numbers in $A$ which sum to the largest number in $A$ will run in (assuming comparison...
490
views
commented
Nov 30, 2020
Algorithms
go2025-algorithms-1
time-complexity
algorithm-design
multiple-selects
+
–
4
answers
10
GATE CSE 1999 | Question: 2.20
The minimum number of record movements required to merge five files A (with $10$ records), B (with $20$ records), C (with $15$ records), D (with $5$ records) and E (with $25$ records) is: $165$ $90$ $75$ $65$
The minimum number of record movements required to merge five files A (with $10$ records), B (with $20$ records), C (with $15$ records), D (with $5$ records) and E (with ...
14.6k
views
commented
Sep 29, 2020
Algorithms
gate1999
algorithms
normal
greedy-algorithm
+
–
2
answers
11
What is the time complexity of Make-set function in kruskal algorithm ?
what is the time-complexity in kruskal algorithm for the overall step 2 where for each vertex Make-set function is called ? How come overall time for this step is O(v log v) ? We are performing this Operation for all the ... right because after we come out of loop we have v sets of 1 vertex each . Please explain this clearly .
what is the time-complexity in kruskal algorithm for the overall step 2 where for each vertex Make-set function is called ? How come overall time for this step is O(v lo...
1.2k
views
commented
Sep 24, 2020
Algorithms
algorithms
greedy-algorithm
+
–
2
answers
12
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
Sep 22, 2020
Algorithms
gate1990
descriptive
algorithms
algorithm-design-technique
+
–
5
answers
13
GATE CSE 1990 | Question: 3-i
Choose the correct alternatives (More than one may be correct). Two NAND gates having open collector outputs are tied together as shown in below figure. The logic function $Y,$ implemented by the circuit is, $Y=ABC + DE$ $Y=\overline{ABC + DE}$ $Y=ABC.DE$ $Y=\overline{ABC.DE}$
Choose the correct alternatives (More than one may be correct).Two NAND gates having open collector outputs are tied together as shown in below figure.The logic function ...
7.4k
views
answered
Sep 20, 2020
Digital Logic
gate1990
normal
digital-logic
circuit-output
+
–
2
answers
14
NIELIT 2017 July Scientist B (IT) - Section B: 40
Give the output #include<iostream> using namespace std; class Base1{ public: ~Base1() {cout<<"Base1's destructor"<<endl;} }; class Base2 { public: ~Base2(){cout<<"Base2's ... 's Destructor Derived's Destructor Base$2$'s destructor Base$1$'s destructor Derived's Destructor Compiler Dependent
Give the output #include<iostream using namespace std; class Base1{ public: ~Base1() {cout<<"Base1's destructor"<<endl;} }; class Base2 { public: ~Base2(){cout<<"Base2's ...
1.7k
views
commented
Jun 11, 2020
Object Oriented Programming
nielit2017july-scientistb-it
non-gate
object-oriented-programming
+
–
2
answers
15
GATE2016 EC-3: GA-9
Find the area bounded by the lines $3x + 2y=14, 2x - 3y = 5$ in the first quadrant. $14.95$ $15.25$ $15.70$ $20.35$
Find the area bounded by the lines $3x + 2y=14, 2x - 3y = 5$ in the first quadrant.$14.95$$15.25$$15.70$$20.35$
5.0k
views
commented
Jun 10, 2020
Quantitative Aptitude
gate2016-ec-3
cartesian-coordinates
geometry
normal
+
–
9
answers
16
GATE CSE 2006 | Question: 20, ISRO2015-17
Consider the following log sequence of two transactions on a bank account, with initial balance $12000,$ that transfer $2000$ to a mortgage payment and then apply a $5\%$ interest. T1 start T1 B old $=12000$ new $=10000$ ... $3$ because transaction T1 has committed We can apply redo and undo operations in arbitrary order because they are idempotent
Consider the following log sequence of two transactions on a bank account, with initial balance $12000,$ that transfer $2000$ to a mortgage payment and then apply a $5\%$...
28.0k
views
commented
Jun 1, 2020
Databases
gatecse-2006
databases
transaction-and-concurrency
normal
isro2015
+
–
3
answers
17
GATE CSE 1989 | Question: 2-iii
Match the pairs in the following: ... 2)$} &\text{(s)} & \text{Selection of the $k^{th}$ smallest element in a set of $n$ elements} \\\hline \end{array}$
Match the pairs in the following:$$\begin{array}{ll|ll}\hline \text{(A)} & \text{$O (\log n)$} & \text{(p)} & \text{Heapsort} \\\hline \text{(B)} & \text{$O (n)$} & \tex...
5.4k
views
commented
Feb 3, 2020
Algorithms
gate1989
match-the-following
algorithms
time-complexity
+
–
3
answers
18
Test by Bikram | Mock GATE | Test 1 | Question: 26
Suppose we have a block-addressable disk drive. With such block organized disk non data overhead of subblocks and, interblock gaps have to be accounted for. There are $40,000$ bytes per track and the amount of space taken up by subblocks ... to the stored in each block in a file. A block is organized to hold an integral number of logical records.
Suppose we have a block-addressable disk drive. With such block organized disk non data overhead of subblocks and, interblock gaps have to be accounted for.There are $40,...
1.0k
views
commented
Jan 28, 2020
GATE
tbb-mockgate-1
numerical-answers
disk
operating-system
+
–
2
answers
19
Test by Bikram | Mock GATE | Test 1 | Question: 48
State whether the following statements are true or false? $(P\to Q) \rightarrow (Q\to P)$ always holds, for all propositions $P, Q$. $\left ( \left ( P\vee Q \right )\rightarrow Q \right )$ $\rightarrow$ ... true, $b$ is false Both $a$ and $b$ are true $a$ is false, $b$ is true. Both $a$ and $b$ are false.
State whether the following statements are true or false?$(P\to Q) \rightarrow (Q\to P)$ always holds, for all propositions $P, Q$.$\left ( \left ( P\vee Q \right )\right...
808
views
commented
Jan 28, 2020
GATE
tbb-mockgate-1
discrete-mathematics
mathematical-logic
propositional-logic
+
–
4
answers
20
GATE CSE 1997 | Question: 11
Consider the grammar $S \rightarrow bSe$ $S \rightarrow PQR$ $P \rightarrow bPc$ $P \rightarrow \varepsilon$ $Q \rightarrow cQd$ $Q \rightarrow \varepsilon$ $R \rightarrow dRe$ $R \rightarrow \varepsilon$ where $S, P, Q, R$ ... $i, j, k, m$? Find the smallest string that has two parse trees.
Consider the grammar$S \rightarrow bSe$$S \rightarrow PQR$$P \rightarrow bPc$$P \rightarrow \varepsilon$$Q \rightarrow cQd$$Q \rightarrow \varepsilon$$R \rightarrow dRe...
6.5k
views
comment edited
Jan 26, 2020
Compiler Design
gate1997
compiler-design
grammar
normal
theory-of-computation
descriptive
+
–
3
answers
21
ISRO2020-46
A magnetic disk has $100$ cylinders, each with $10$ tracks of $10$ sectors. If each sector contains $128$ bytes, what is the maximum capacity of the disk in kilobytes? $1,280,000$ $1280$ $1250$ $128,000$
A magnetic disk has $100$ cylinders, each with $10$ tracks of $10$ sectors. If each sector contains $128$ bytes, what is the maximum capacity of the disk in kilobytes?$1,...
3.9k
views
commented
Jan 17, 2020
CO and Architecture
isro-2020
co-and-architecture
disk
normal
+
–
5
answers
22
ISRO2020-47
How many total bits are required for a direct-mapped cache with $128$ KB of data and $1$ word block size, assuming a $32$-bit address and $1$ word size of $4$ bytes? $2$ Mbits $1.7$ Mbits $2.5$ Mbits $1.5$ Mbits
How many total bits are required for a direct-mapped cache with $128$ KB of data and $1$ word block size, assuming a $32$-bit address and $1$ word size of $4$ bytes?$2$ M...
6.1k
views
commented
Jan 17, 2020
CO and Architecture
isro-2020
co-and-architecture
cache-memory
direct-mapping
normal
+
–
4
answers
23
GATE CSE 2019 | Question: 47
Suppose $Y$ is distributed uniformly in the open interval $(1,6)$. The probability that the polynomial $3x^2 +6xY+3Y+6$ has only real roots is (rounded off to $1$ decimal place) _______
Suppose $Y$ is distributed uniformly in the open interval $(1,6)$. The probability that the polynomial $3x^2 +6xY+3Y+6$ has only real roots is (rounded off to $1$ decimal...
16.3k
views
commented
Jan 16, 2020
Probability
gatecse-2019
numerical-answers
engineering-mathematics
probability
uniform-distribution
2-marks
+
–
18
answers
24
GATE CSE 2019 | Question: 21
The value of $3^{51} \text{ mod } 5$ is _____
The value of $3^{51} \text{ mod } 5$ is _____
18.2k
views
commented
Jan 16, 2020
Combinatory
gatecse-2019
numerical-answers
combinatory
modular-arithmetic
1-mark
+
–
9
answers
25
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
commented
Jan 7, 2020
Graph Theory
gateit-2006
graph-theory
graph-coloring
normal
+
–
3
answers
26
GATE CSE 1994 | Question: 3.3
State True or False with one line explanation A FSM (Finite State Machine) can be designed to add two integers of any arbitrary length (arbitrary number of digits).
State True or False with one line explanationA FSM (Finite State Machine) can be designed to add two integers of any arbitrary length (arbitrary number of digits).
15.0k
views
comment edited
Jan 4, 2020
Theory of Computation
gate1994
theory-of-computation
finite-automata
normal
true-false
+
–
4
answers
27
GATE CSE 1994 | Question: 2.9
The Hasse diagrams of all the lattices with up to four elements are ________ (write all the relevant Hasse diagrams)
The Hasse diagrams of all the lattices with up to four elements are ________ (write all the relevant Hasse diagrams)
4.5k
views
commented
Dec 29, 2019
Set Theory & Algebra
gate1994
set-theory&algebra
lattice
normal
fill-in-the-blanks
+
–
3
answers
28
GATE CSE 1993 | Question: 8.5
The less-than relation, $<,$ on reals is a partial ordering since it is asymmetric and reflexive a partial ordering since it is antisymmetric and reflexive not a partial ordering because it is not asymmetric and not reflexive not a partial ordering because it is not antisymmetric and reflexive none of the above
The less-than relation, $<,$ on reals isa partial ordering since it is asymmetric and reflexivea partial ordering since it is antisymmetric and reflexivenot a partial ord...
9.1k
views
commented
Dec 29, 2019
Set Theory & Algebra
gate1993
set-theory&algebra
partial-order
easy
+
–
1
answer
29
UGC NET CSE | December 2018 | Part 2 | Question: 8
In PERT/CPM, the merge event represents _____ of two or more events. completion beginning splitting joining
In PERT/CPM, the merge event represents _____ of two or more events.completionbeginningsplittingjoining
3.5k
views
commented
Dec 29, 2019
Numerical Methods
ugcnetcse-dec2018-paper2
operation-research-pert-cpm
+
–
6
answers
30
GATE CSE 2016 Set 2 | Question: 27
Which one of the following well-formed formulae in predicate calculus is NOT valid ? $(\forall _{x} p(x) \implies \forall _{x} q(x)) \implies (\exists _{x} \neg p(x) \vee \forall _{x} q(x))$ ... $\forall x (p(x) \vee q(x)) \implies (\forall x p(x) \vee \forall x q(x))$
Which one of the following well-formed formulae in predicate calculus is NOT valid ?$(\forall _{x} p(x) \implies \forall _{x} q(x)) \implies (\exists _{x} \neg p(x) \vee ...
16.9k
views
commented
Dec 25, 2019
Mathematical Logic
gatecse-2016-set2
mathematical-logic
first-order-logic
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register