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 scholaraniket
5
answers
1
GATE CSE 2015 Set 3 | Question: 31
Consider the following grammar G $S \rightarrow F \mid H$ $F \rightarrow p \mid c$ $H \rightarrow d \mid c$ Where $S$, $F$, and $H$ are non-terminal symbols, $p, d$, and $c$ are terminal symbols. Which of the following statement(s) ... grammar G S2: LR(1) can parse all strings that are generated using grammar G Only S1 Only S2 Both S1 and S2 Neither S1 and S2
Consider the following grammar G$S \rightarrow F \mid H$$F \rightarrow p \mid c$$H \rightarrow d \mid c$ Where $S$, $F$, and $H$ are non-terminal symbols, $p, d$, and $c...
15.3k
views
commented
Jan 31, 2020
Compiler Design
gatecse-2015-set3
compiler-design
parsing
normal
+
–
6
answers
2
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.8k
views
commented
Jan 27, 2020
Databases
gatecse-2008
databases
er-diagram
normal
+
–
1
answer
3
#Totally Confused# please tell Using Dijkstra Algorithm solve shortest path algorithm from A to D.
Using DIjkstra algorithm solve shortest path algorithm from A to D
Using DIjkstra algorithm solve shortest path algorithm from A to D
984
views
commented
Jan 26, 2020
Computer Networks
algorithms
shortest-path
dijkstras-algorithm
computer-networks
+
–
0
answers
4
Instruction Pipeline
Consider an instruction pipeline with five stages , it allows overlapping of all instructions except branch type. Let there are 20% branch instructions and pipeline is operated with 800 megahertz. 1) what is the speedup? 2) what is average instruction time. 3) what is the time taken for 10 million instructions. 4) what is the throughput.
Consider an instruction pipeline with five stages , it allows overlapping of all instructions except branch type. Let there are 20% branch instructions and pipeline is o...
1.3k
views
commented
Jan 26, 2020
CO and Architecture
co-and-architecture
pipelining
+
–
10
answers
5
GATE CSE 2009 | Question: 28
Consider a $4$ stage pipeline processor. The number of cycles needed by the four instructions $I1, I2, I3, I4$ in stages $S1, S2, S3, S4$ ... the number of cycles needed to execute the following loop? For (i=1 to 2) {I1; I2; I3; I4;} $16$ $23$ $28$ $30$
Consider a $4$ stage pipeline processor. The number of cycles needed by the four instructions $I1, I2, I3, I4$ in stages $S1, S2, S3, S4$ is shown below:$$\begin{array}{|...
34.7k
views
commented
Jan 22, 2020
CO and Architecture
gatecse-2009
co-and-architecture
pipelining
normal
+
–
5
answers
6
ISRO2020-41
Minimum number of states required in DFA accepting binary strings not ending in $\text{“101”}$ is $3$ $4$ $5$ $6$
Minimum number of states required in DFA accepting binary strings not ending in $\text{“101”}$ is$3$$4$$5$$6$
7.1k
views
commented
Jan 20, 2020
Theory of Computation
isro-2020
theory-of-computation
finite-automata
normal
+
–
2
answers
7
Multiple Overlapping candidate keys
2.0k
views
commented
Jan 17, 2020
Databases
databases
database-normalization
+
–
2
answers
8
Sum of Data dependencies
$I_1 : MUL \ \ \ \ \ R_1, R_2, R_3$ // $R_1 \leftarrow R_2 \times R_3$ $I_2 : ADD \ \ \ \ \ R_4, R_4, R_1$ $I_3 : MUL \ \ \ \ \ R_1, R_5, R_6$ $I_4 : SUB \ \ \ \ \ R_4, R_4, R_1$ Sum of RAW, WAR and WAW dependencies is _____.
$I_1 : MUL \ \ \ \ \ R_1, R_2, R_3$ // $R_1 \leftarrow R_2 \times R_3$$I_2 : ADD \ \ \ \ \ R_4, R_4, R_1$$I_3 : MUL \ \ \ \ \ R_1, R_5, R_6$$I_4 : SUB...
785
views
commented
Jan 13, 2020
CO and Architecture
data-hazards
data-dependency
co-and-architecture
numerical-answers
+
–
1
answer
9
true data dependency
1.5k
views
commented
Jan 13, 2020
1
answer
10
Graph
Also let me know the approach to find back edges, cross edges, forward edges, How to solve these questions
Also let me know the approach to find back edges, cross edges, forward edges,How to solve these questions
2.5k
views
commented
Jan 8, 2020
Algorithms
algorithms
graph-algorithms
depth-first-search
descriptive
test-series
+
–
4
answers
11
ISRO2015-78
The decimal number has $64$ digits. The number of bits needed for its equivalent binary representation is? $200$ $213$ $246$ $277$
The decimal number has $64$ digits. The number of bits needed for its equivalent binary representation is?$200$$213$$246$$277$
10.5k
views
commented
Jan 7, 2020
Digital Logic
isro2015
digital-logic
number-representation
+
–
4
answers
12
ISRO2017-68
A critical region is a piece of code which only one process executes at a time is a region prone to deadlock is a piece of code which only a finite number of processes execute is found only in windows NT operating system
A critical regionis a piece of code which only one process executes at a timeis a region prone to deadlockis a piece of code which only a finite number of processes execu...
5.5k
views
answered
Jan 5, 2020
Operating System
isro2017
operating-system
critical-section
process-synchronization
+
–
2
answers
13
ISRO2018-7
Assume $A$ and $B$ are non-zero positive integers. The following code segment: while(A!=B){ if*(A> B) A -= B; else B -= A; } cout<<A; // printing the value of A Computes the $LCM$ of two numbers Divides the larger number by the smaller number Computes the $GCD$ of two numbers Finds the smaller of two numbers
Assume $A$ and $B$ are non-zero positive integers. The following code segment:while(A!=B){ if*(A B) A -= B; else B -= A; } cout<<A; // printing the value of AComputes the...
4.2k
views
commented
Jan 2, 2020
Algorithms
isro2018
algorithms
identify-function
+
–
4
answers
14
MadeEasy Test Series 2018: Compiler Design - Runtime Environments
Consider the following statements: S1 : Static allocation can not support recursive function. S2 : Stack allocation can support pointers but can not deallocate storage at run-time. S3 : Heap allocation can support pointers and it can allocate or deallocate ... statements are true? a S1 and S2 b S2 and S3 c S3 and S1 d S1, S2 and S3
Consider the following statements:S1 : Static allocation can not support recursive function.S2 : Stack allocation can support pointers but can not deallocate storage at r...
3.0k
views
answered
Dec 27, 2019
Compiler Design
compiler-design
runtime-environment
made-easy-test-series
+
–
9
answers
15
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.7k
views
answered
Dec 24, 2019
Graph Theory
gatecse-2015-set1
graph-theory
graph-connectivity
normal
graph-planarity
numerical-answers
+
–
8
answers
16
GATE CSE 2016 Set 2 | Question: 28
Consider a set $U$ of $23$ different compounds in a chemistry lab. There is a subset $S$ of $U$ of $9$ compounds, each of which reacts with exactly $3$ compounds of $U$. Consider the following statements: Each compound in U \ S reacts ... \ S reacts with an even number of compounds. Which one of the above statements is ALWAYS TRUE? Only I Only II Only III None.
Consider a set $U$ of $23$ different compounds in a chemistry lab. There is a subset $S$ of $U$ of $9$ compounds, each of which reacts with exactly $3$ compounds of $U$. ...
16.7k
views
commented
Dec 21, 2019
Set Theory & Algebra
gatecse-2016-set2
set-theory&algebra
difficult
set-theory
+
–
5
answers
17
GATE CSE 2017 Set 1 | Question: 19
Let $X$ be a Gaussian random variable with mean 0 and variance $\sigma ^{2}$. Let $Y$ = $\max\left ( X,0 \right )$ where $\max\left ( a,b \right )$ is the maximum of $a$ and $b$. The median of $Y$ is ______________ .
Let $X$ be a Gaussian random variable with mean 0 and variance $\sigma ^{2}$. Let $Y$ = $\max\left ( X,0 \right )$ where $\max\left ( a,b \right )$ is the maximum of $a$ ...
20.6k
views
commented
Dec 20, 2019
Probability
gatecse-2017-set1
probability
numerical-answers
normal-distribution
+
–
1
answer
18
Probability- Gravner- 79.c
A random variable $X$ has the density function $f(x)= \begin{Bmatrix} c(x+\sqrt{x}) & x\epsilon [0,1]\\ 0& otherwise \end{Bmatrix}.$ (c) Determine the probability density function of $Y$ $=$ $X^2$
A random variable $X$ has the density function$f(x)= \begin{Bmatrix} c(x+\sqrt{x}) & x\epsilon [0,1]\\ 0& otherwise \end{Bmatrix}.$(c) Determine the probability density ...
516
views
commented
Dec 20, 2019
Probability
probability
gravner
engineering-mathematics
random-variable
+
–
1
answer
19
How can we found second smallest element with n+[lgn]-2 comparisons in worst case ??
3.5k
views
commented
Dec 7, 2019
Algorithms
divide-and-conquer
sorting
algorithms
+
–
4
answers
20
GATE CSE 2012 | Question: 36
Consider the program given below, in a block-structured pseudo-language with lexical scoping and nesting of procedures permitted. Program main; Var ... Procedure A1; Var ... Call A2; End A1 Procedure A2; Var ... Procedure A21; Var ... Call ... The correct set of activation records along with their access links is given by:
Consider the program given below, in a block-structured pseudo-language with lexical scoping and nesting of procedures permitted.Program main; Var ... Procedure A1; Var ....
13.1k
views
answered
Dec 6, 2019
Compiler Design
gatecse-2012
compiler-design
runtime-environment
normal
+
–
5
answers
21
GATE CSE 2015 Set 2 | Question: 46
Consider a simple checkpointing protocol and the following set of operations in the log. (start, T4); (write, T4, y, 2, 3); (start, T1); (commit, T4); (write, T1, z, 5, 7); (checkpoint); (start, T2); (write, T2, x, 1, 9); (commit, T2); (start, T3); ( ... Undo: T3, T1; Redo: T2 Undo: T3, T1; Redo: T2, T4 Undo: none; Redo: T2, T4, T3, T1 Undo: T3, T1, T4; Redo: T2
Consider a simple checkpointing protocol and the following set of operations in the log.(start, T4); (write, T4, y, 2, 3); (start, T1); (commit, T4); (write, T1, z, 5, 7)...
24.8k
views
commented
Dec 2, 2019
Databases
gatecse-2015-set2
databases
transaction-and-concurrency
normal
+
–
2
answers
22
Vertical Microprograming
Consider a CPU where all the instruction require 10 clock cycles to complete execution. There are 258 instructions in instruction set. It is found that 129 control signals are needed to be generated by control unit. While designing the vertical μ- ... unit, single address field format is used for branch control logic. The size of control memory in byte is ________.
Consider a CPU where all the instruction require 10 clock cycles to complete execution. There are 258 instructions in instruction set. It is found that 129 control signal...
1.2k
views
answered
Oct 26, 2019
CO and Architecture
co-and-architecture
microprogramming
+
–
2
answers
23
Made Easy Test Series:Microprogramming
A hypothetical cpu supports $300$ instructions.each instruction takes $5$ cycle to accomplish the execution. the control unit is designed using vertical programming which has $130$ control signals $,64$ flags and $12$ branch conditions .$X$ and ... register$(CDR)$ respectively.value of $X+Y$ is ______? How to work with branch condition in micro programming :(
A hypothetical cpu supports $300$ instructions.each instruction takes $5$ cycle to accomplish the execution. the control unit is designed using vertical programming which...
2.8k
views
commented
Oct 26, 2019
CO and Architecture
made-easy-test-series
microprogramming
co-and-architecture
+
–
7
answers
24
GATE CSE 2012 | Question: 27
Consider the following transactions with data items $P$ and $Q$ initialized to zero: ${\begin{array}{|c|l|r|c|}\hline \textbf{$ ... leads to a serializable schedule a schedule that is not conflict serializable a conflict serializable schedule a schedule for which a precedence graph cannot be drawn
Consider the following transactions with data items $P$ and $Q$ initialized to zero:$${\begin{array}{|c|l|r|c|}\hline \textbf{$T_1$}& \text{read (P);}\\ & \text{read...
22.9k
views
commented
Oct 24, 2019
Databases
gatecse-2012
databases
transaction-and-concurrency
normal
+
–
1
answer
25
[DBMS] Navathe 21.24 Schedule classification
Consider schedules S3, S4, and S5 below. Determine whether each schedule is strict, cascadeless, recoverable, or nonrecoverable. (Determine the strictest recoverability condition that each schedule satisfies.) S3: r1 (X); r2 (Z); r1 (Z); r3 (X); r3 (Y); w1 (X); c1; w3 (Y); c3; r2 ... X); r1 (Z); r2 (Y); r3 (Y); w1 (X); c1; w2 (Z); w3 (Y); w2 (Y); c3; c2;
Consider schedules S3, S4, and S5 below. Determine whether each schedule isstrict, cascadeless, recoverable, or nonrecoverable. (Determine the strictestrecoverability con...
12.6k
views
commented
Oct 23, 2019
Databases
databases
+
–
5
answers
26
GATE CSE 2007 | Question: 61
Consider the table employee(empId, name, department, salary) and the two queries $Q_1, \, Q_2$ below. Assuming that department $5$ has more than one employee, and we want to find the employees who get higher salary than anyone in the department $5,$ ... $Q_1$ and $Q_2$ produce the same answer Neither $Q_1$ nor $Q_2$ is the correct query
Consider the table employee(empId, name, department, salary) and the two queries $Q_1, \, Q_2$ below. Assuming that department $5$ has more than one employee, and we want...
26.9k
views
commented
Oct 23, 2019
Databases
gatecse-2007
databases
sql
normal
verbal-aptitude
+
–
5
answers
27
GATE IT 2008 | Question: 74
Consider the following relational schema: $\text{Student} (\underline{\text{school-id}, \text{sch-roll-no}}, \text{sname}, \text{saddress})$ ... the name of the school and the number of its students scoring $100$ in at least one exam nothing; the query has a syntax error
Consider the following relational schema:$\text{Student} (\underline{\text{school-id}, \text{sch-roll-no}}, \text{sname}, \text{saddress})$$\text{School} (\underline{\tex...
18.3k
views
commented
Oct 23, 2019
Databases
gateit-2008
databases
sql
normal
+
–
6
answers
28
GATE CSE 2017 Set 2 | Question: 19
Consider the following tables $T1$ and $T2.$ ... delete record $\langle 3, 8 \rangle$ from the table $T1,$ the number of additional records that need to be deleted from table $T1$ is _______
Consider the following tables $T1$ and $T2.$$$\overset{T1}{\begin{array}{|c|c|c|} \hline \textbf {P} & \textbf {Q} \\\hline \text {2} & \text{2 }\\\hline \text{3} & \te...
18.4k
views
commented
Oct 22, 2019
Databases
gatecse-2017-set2
databases
numerical-answers
referential-integrity
normal
+
–
8
answers
29
GATE IT 2008 | Question: 66
Data transmitted on a link uses the following $2D$ parity scheme for error detection: Each sequence of $28$ bits is arranged in a $4\times 7$ matrix (rows $r_0$ through $r_3$, and columns $d_7$ through $d_1$) and is padded with a column $d_0$ and row $r_4$ ... received by a receiver and has $n$ corrupted bits. What is the minimum possible value of $n$? $1$ $2$ $3$ $4$
Data transmitted on a link uses the following $2D$ parity scheme for error detection:Each sequence of $28$ bits is arranged in a $4\times 7$ matrix (rows $r_0$ through $r...
15.6k
views
answer edited
Oct 17, 2019
Computer Networks
gateit-2008
computer-networks
normal
error-detection
+
–
7
answers
30
GATE CSE 2016 Set 2 | Question: 38
Let $A_{1}, A_{2}, A_{3}$ and $A_{4}$ be four matrices of dimensions $10 \times 5, 5 \times 20, 20 \times 10$ and $10 \times 5$, respectively. The minimum number of scalar multiplications required to find the product $A_{1}A_{2}A_{3}A_{4}$ using the basic matrix multiplication method is _________.
Let $A_{1}, A_{2}, A_{3}$ and $A_{4}$ be four matrices of dimensions $10 \times 5, 5 \times 20, 20 \times 10$ and $10 \times 5$, respectively. The minimum number of scala...
22.8k
views
commented
Oct 1, 2019
Algorithms
gatecse-2016-set2
dynamic-programming
algorithms
matrix-chain-ordering
normal
numerical-answers
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register