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 rishi71662data4
7
answers
1
GATE IT 2008 | Question: 18
How many bytes of data can be sent in $15$ seconds over a serial link with baud rate of $9600$ in asynchronous mode with odd parity and two stop bits in the frame? $10,000$ bytes $12,000$ bytes $15,000$ bytes $27,000$ bytes
How many bytes of data can be sent in $15$ seconds over a serial link with baud rate of $9600$ in asynchronous mode with odd parity and two stop bits in the frame?$10,000...
16.2k
views
commented
Jan 23, 2018
Computer Networks
gateit-2008
computer-networks
communication
serial-communication
normal
out-of-gate-syllabus
+
–
9
answers
2
GATE CSE 2005 | Question: 72
Consider the following code fragment: if (fork() == 0) { a = a + 5; printf("%d, %p n", a, &a); } else { a = a - 5; printf ("%d, %p n", a,& a); } Let $u,v$ be the values printed by the parent process and $x,y$ be the values printed by the child ... $u + 10 = x \text{ and } v = y$ $u + 10 = x \text{ and } v != y$
Consider the following code fragment: if (fork() == 0) { a = a + 5; printf("%d, %p n", a, &a); } else { a = a - 5; printf ("%d, %p n", a,& a); }Let $u,v$ be the values pr...
37.5k
views
commented
Jan 19, 2018
Operating System
gatecse-2005
operating-system
fork-system-call
normal
+
–
3
answers
3
Gatebook mock
Below is a precedence graph for a set of tasks to be executed on a parallel processing system $S$. Efficiency is defined as the ratio between the speedup and the number of processors. (The speedup is defined as the ratio of the time taken to perform a set of tasks on a single ... same time, what is the efficiency of this precedence graph on $S$? $25\%$ $33\:1/3\%$ $50\%$ $100\%$
Below is a precedence graph for a set of tasks to be executed on a parallel processing system $S$. Efficiency is defined as the ratio between the speedup and the number o...
1.6k
views
answered
Jan 16, 2018
CO and Architecture
gatebook-mt2
co-and-architecture
speedup
+
–
8
answers
4
GATE CSE 2014 Set 3 | Question: 39
Suppose we have a balanced binary search tree $T$ holding $n$ numbers. We are given two numbers $L$ and $H$ and wish to sum up all the numbers in $T$ that lie between $L$ and $H$. Suppose there are $m$ such numbers in $T$. If the tightest upper bound on the time to compute the sum is $O(n^a\log^bn+m^c\log^dn)$, the value of $a+10b+100c+1000d$ is ______.
Suppose we have a balanced binary search tree $T$ holding $n$ numbers. We are given two numbers $L$ and $H$ and wish to sum up all the numbers in $T$ that lie between $L$...
31.6k
views
comment edited
Jan 14, 2018
DS
gatecse-2014-set3
data-structures
binary-search-tree
numerical-answers
normal
+
–
3
answers
5
GATE CSE 2009 | Question: 42
Which of the following statements are TRUE? There exist parsing algorithms for some programming languages whose complexities are less than $\Theta(n^3)$ A programming language which allows recursion can be implemented with static storage allocation. No L-attributed ... both source language and intermediate code level. I and II I and IV III and IV I, III and IV
Which of the following statements are TRUE?There exist parsing algorithms for some programming languages whose complexities are less than $\Theta(n^3)$A programming langu...
18.5k
views
commented
Jan 14, 2018
Compiler Design
gatecse-2009
compiler-design
parsing
normal
+
–
3
answers
6
GATE CSE 2015 Set 3 | Question: 47
Consider the following code sequence having five instructions from $I_1 \text{ to } I_5$. Each of these instructions has the following format. OP Ri, Rj, Rk Where operation OP is performed on contents of registers Rj and Rk and the result is stored in ... statements is/are correct? Only S1 is true Only S2 is true Only S1 and S3 are true Only S2 and S3 are true
Consider the following code sequence having five instructions from $I_1 \text{ to } I_5$. Each of these instructions has the following format. OP Ri, Rj, RkWhere operatio...
22.0k
views
commented
Jan 13, 2018
CO and Architecture
gatecse-2015-set3
co-and-architecture
pipelining
data-dependency
normal
+
–
5
answers
7
GATE CSE 2015 Set 3 | Question: 39
Consider the following recursive C function. void get(int n) { if (n<1) return; get (n-1); get (n-3); printf("%d", n); } If $get(6)$ function is being called in $main()$ then how many times will the $get()$ function be invoked before returning to the $main()$? $15$ $25$ $35$ $45$
Consider the following recursive C function.void get(int n) { if (n<1) return; get (n-1); get (n-3); printf("%d", n); }If $get(6)$ function is being called in $main()$ th...
18.2k
views
commented
Dec 25, 2017
Algorithms
gatecse-2015-set3
algorithms
recurrence-relation
normal
+
–
1
answer
8
gatebook-os
Consider a virtual memory system running on a RISC CPU. Page tables are not locked in memory and may be swapped to disk. An 1w (load word) instruction reads one data word from memory; the address is the sum of value in a register and an immediate constant ... In the worst case how many page faults could be generated as a result of the fetch, decode, and execution of an 1w instruction?
Consider a virtual memory system running on a RISC CPU. Page tables are not locked in memory and may be swapped to disk. An 1w (load word) instruction reads one data word...
2.4k
views
commented
Dec 21, 2017
Operating System
page-fault
operating-system
virtual-memory
+
–
2
answers
9
GATE IT 2006 | Question: 8
Which of the following DMA transfer modes and interrupt handling mechanisms will enable the highest I/O band-width? Transparent DMA and Polling interrupts Cycle-stealing and Vectored interrupts Block transfer and Vectored interrupts Block transfer and Polling interrupts
Which of the following DMA transfer modes and interrupt handling mechanisms will enable the highest I/O band-width?Transparent DMA and Polling interruptsCycle-stealing an...
13.0k
views
commented
Dec 20, 2017
Operating System
gateit-2006
operating-system
io-handling
dma
normal
+
–
4
answers
10
GATE CSE 2002 | Question: 9
Consider the following $32\text{-bit}$ floating-point representation scheme as shown in the format below. A value is specified by $3$ fields, a one bit sign field (with $0$ for positive and $1$ ... the hexadecimal. What is the largest value that can be represented using this format? Express your answer as the nearest power of $10$.
Consider the following $32\text{-bit}$ floating-point representation scheme as shown in the format below. A value is specified by $3$ fields, a one bit sign field (with $...
11.6k
views
commented
Dec 16, 2017
Digital Logic
gatecse-2002
digital-logic
number-representation
normal
descriptive
+
–
4
answers
11
GATE CSE 1989 | Question: 12a
The below figure shows a $B^+$ tree where only key values are indicated in the records. Each block can hold upto three records. A record with a key value $34$ is inserted into the $B^+$ tree. Obtain the modified $B^+$ tree after insertion.
The below figure shows a $B^+$ tree where only key values are indicated in the records. Each block can hold upto three records. A record with a key value $34$ is inserted...
8.4k
views
commented
Dec 15, 2017
Databases
descriptive
gate1989
databases
b-tree
+
–
11
answers
12
GATE2014 EC-1: GA-10
You are given three coins: one has heads on both faces, the second has tails on both faces, and the third has a head on one face and a tail on the other. You choose a coin at random and toss it, and it comes up heads. The probability that the other face is tails is $\dfrac{1}{4}$ $\dfrac{1}{3}$ $\dfrac{1}{2}$ $\dfrac{2}{3}$
You are given three coins: one has heads on both faces, the second has tails on both faces, and the third has a head on one face and a tail on the other. You choose a coi...
10.3k
views
answered
Dec 14, 2017
Quantitative Aptitude
gate2014-ec-1
quantitative-aptitude
probability
conditional-probability
+
–
3
answers
13
GATE2013 AE: GA-10
In a factory, two machines $M1$ and $M2$ manufacture $60\%$ and $40\%$ of the autocomponents respectively. Out of the total production, $2\%$ of $M1$ and $3\%$ of $M2$ are found to be defective. If a randomly drawn autocomponent from the combined lot is found defective, what is the probability that it was manufactured by $M2$? $0.35$ $0.45$ $0.5$ $0.4$
In a factory, two machines $M1$ and $M2$ manufacture $60\%$ and $40\%$ of the autocomponents respectively. Out of the total production, $2\%$ of $M1$ and $3\%$ of $M2$ ar...
5.0k
views
answered
Dec 14, 2017
Quantitative Aptitude
gate2013-ae
quantitative-aptitude
conditional-probability
+
–
1
answer
14
GATE CSE 2012 | Question: 63
An automobile plant contracted to buy shock absorbers from two suppliers $ X$ and $ Y$ . $ X$ supplies $60\%$ and Y supplies $40\%$ of the shock absorbers. All shock absorbers are subjected to a quality test. The ones that pass the quality test are considered reliable. ... shock absorber, which is found to be reliable, is made by $Y$ is $0.288$ $0.334$ $0.667$ $0.720$
An automobile plant contracted to buy shock absorbers from two suppliers $ X$ and $ Y$ . $ X$ supplies $60\%$ and Y supplies $40\%$ of the shock absorbers. All shock abso...
5.1k
views
commented
Dec 13, 2017
Quantitative Aptitude
gatecse-2012
quantitative-aptitude
probability
normal
conditional-probability
+
–
20
answers
15
GATE CSE 2016 Set 1 | Question: 8
We want to design a synchronous counter that counts the sequence $0-1-0-2-0-3$ and then repeats. The minimum number of $\text{J-K}$ flip-flops required to implement this counter is _____________.
We want to design a synchronous counter that counts the sequence $0-1-0-2-0-3$ and then repeats. The minimum number of $\text{J-K}$ flip-flops required to implement this ...
52.2k
views
commented
Dec 12, 2017
Digital Logic
gatecse-2016-set1
digital-logic
digital-counter
flip-flop
normal
numerical-answers
+
–
10
answers
16
GATE CSE 2013 | Question: 45
Consider an instruction pipeline with five stages without any branch prediction: Fetch Instruction (FI), Decode Instruction (DI), Fetch Operand (FO), Execute Instruction (EI) and Write Operand (WO). The stage delays for FI, DI, FO, EI and WO are ... during the execution of this program, the time (in ns) needed to complete the program is $132$ $165$ $176$ $328$
Consider an instruction pipeline with five stages without any branch prediction:Fetch Instruction (FI), Decode Instruction (DI), Fetch Operand (FO), Execute Instruction (...
48.1k
views
commented
Dec 8, 2017
CO and Architecture
gatecse-2013
normal
co-and-architecture
pipelining
+
–
10
answers
17
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
Dec 8, 2017
CO and Architecture
gatecse-2009
co-and-architecture
pipelining
normal
+
–
4
answers
18
TIFR CSE 2014 | Part B | Question: 4
Consider the following undirected graph with some edge costs missing. Suppose the wavy edges form a Minimum Cost Spanning Tree for $G$. Then, which of the following inequalities NEED NOT hold? cost$(a, b) \geq 6$. cost$(b, e) \geq 5$. cost$(e, f) \geq 5$. cost$(a, d) \geq 4$. cost$(b, c) \geq 4$.
Consider the following undirected graph with some edge costs missing.Suppose the wavy edges form a Minimum Cost Spanning Tree for $G$. Then, which of the following inequa...
5.1k
views
commented
Dec 6, 2017
Algorithms
tifr2014
algorithms
graph-algorithms
minimum-spanning-tree
+
–
8
answers
19
GATE CSE 2010 | Question: 50
Consider a complete undirected graph with vertex set $\{0, 1, 2, 3, 4\}$. Entry $W_{ij}$ in the matrix $W$ below is the weight of the edge $\{i, j\}$ ... possible weight of a spanning tree $T$ in this graph such that vertex $0$ is a leaf node in the tree $T$? $7$ $8$ $9$ $10$
Consider a complete undirected graph with vertex set $\{0, 1, 2, 3, 4\}$. Entry $W_{ij}$ in the matrix $W$ below is the weight of the edge $\{i, j\}$$$W=\begin{pmatrix} 0...
24.0k
views
commented
Dec 6, 2017
Algorithms
gatecse-2010
algorithms
spanning-tree
normal
+
–
6
answers
20
GATE CSE 2001 | Question: 2.15
How many undirected graphs (not necessarily connected) can be constructed out of a given set $V=\{v_1, v_2, \dots v_n\}$ of $n$ vertices? $\frac{n(n-1)} {2}$ $2^n$ $n!$ $2^\frac{n(n-1)} {2} $
How many undirected graphs (not necessarily connected) can be constructed out of a given set $V=\{v_1, v_2, \dots v_n\}$ of $n$ vertices?$\frac{n(n-1)} {2}$$2^n$$n!$$2^\f...
14.3k
views
commented
Dec 6, 2017
Graph Theory
gatecse-2001
graph-theory
normal
counting
+
–
6
answers
21
GATE CSE 1999 | Question: 2.16
The number of full and half-adders required to add $16$-bit numbers is $8$ half-adders, $8$ full-adders $1$ half-adder, $15$ full-adders $16$ half-adders, $0$ full-adders $4$ half-adders, $12$ full-adders
The number of full and half-adders required to add $16$-bit numbers is$8$ half-adders, $8$ full-adders$1$ half-adder, $15$ full-adders$16$ half-adders, $0$ full-adders$4$...
22.5k
views
commented
Dec 4, 2017
Digital Logic
gate1999
digital-logic
normal
adder
+
–
5
answers
22
GATE CSE 2016 Set 1 | Question: 16
Which of the following languages is generated by the given grammar? $S \rightarrow aS \mid bS \mid \varepsilon$ $\{ a^nb^m \mid n,m \geq 0\}$ $\{ w \in \{ a,b\}^* \mid w\text{ has equal number of a's and b's}\}$ $\{a^n \mid n \geq 0 \} \cup \{b^n \mid n \geq 0\} \cup \{a^n b^n \mid n \geq 0\}$ $\{ a,b\}^*$
Which of the following languages is generated by the given grammar?$$S \rightarrow aS \mid bS \mid \varepsilon$$$\{ a^nb^m \mid n,m \geq 0\}$$\{ w \in \{ a,b\}^* \mid w\t...
12.1k
views
commented
Nov 29, 2017
Theory of Computation
gatecse-2016-set1
theory-of-computation
context-free-language
normal
+
–
2
answers
23
GATE CSE 1998 | Question: 22
An identifier in a programming language consists of up to six letters and digits of which the first character must be a letter. Derive a regular expression for the identifier. Build an $LL(1)$ parsing table for the language defined by the $LL(1)$ ... $X \rightarrow d \text{ semi } X \mid sY$ $Y \rightarrow \text{ semi } s Y \mid \epsilon$
An identifier in a programming language consists of up to six letters and digits of which the first character must be a letter. Derive a regular expression for the identi...
3.8k
views
commented
Nov 26, 2017
Compiler Design
gate1998
compiler-design
parsing
descriptive
+
–
3
answers
24
GATE CSE 1995 | Question: 1.11
What are $x$ and $y$ in the following macro definition? macro Add x, y Load y Mul x Store y end macro Variables Identifiers Actual parameters Formal parameters
What are $x$ and $y$ in the following macro definition?macro Add x, y Load y Mul x Store y end macroVariablesIdentifiersActual parametersFormal parameters
4.7k
views
commented
Nov 26, 2017
Compiler Design
gate1995
compiler-design
macros
easy
+
–
5
answers
25
GATE CSE 2007 | Question: 20
Which one of the following uses UDP as the transport protocol? HTTP Telnet DNS SMTP
Which one of the following uses UDP as the transport protocol?HTTPTelnetDNSSMTP
12.4k
views
commented
Nov 24, 2017
Computer Networks
gatecse-2007
computer-networks
network-protocols
application-layer-protocols
easy
+
–
4
answers
26
GATE CSE 2015 Set 1 | Question: 27
Consider the following relation: ... P WHERE S.Roll_No= P.Roll_No GROUP BY S.STUDENT_Name The numbers of rows that will be returned by the SQL query is_________________.
Consider the following relation:$$\overset{\text{Student}}{\begin{array}{|c|c|}\hline\\\underline{\textbf{Roll_No}}& \textbf{Student_Name}\\\hline1& \text{Raj} \\...
17.4k
views
commented
Nov 23, 2017
Databases
gatecse-2015-set1
databases
sql
normal
numerical-answers
+
–
3
answers
27
GATE CSE 2014 Set 1 | Question: 22
Given the following statements: S1: A foreign key declaration can always be replaced by an equivalent check assertion in SQL. S2: Given the table $R(a,b,c)$ where $a$ and $b$ together form the primary key, the following is a valid table definition. CREATE ... S1 is TRUE and S2 is FALSE Both S1 and S2 are TRUE S1 is FALSE and S2 is TRUE Both S1 and S2 are FALSE
Given the following statements: S1: A foreign key declaration can always be replaced by an equivalent check assertion in SQL. S2: Given the table $R(a,b,c)$ where $a$ an...
23.6k
views
commented
Nov 23, 2017
Databases
gatecse-2014-set1
databases
normal
sql
+
–
5
answers
28
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
Nov 23, 2017
Databases
gateit-2008
databases
sql
normal
+
–
4
answers
29
GATE CSE 2000 | Question: 2.14
Consider the values of $A = 2.0 \times 10^{30}, B = -2.0 \times 10^{30}, C = 1.0,$ and the sequence X:= A + B Y:= A + C X:= X + C Y:= Y + B executed on a computer where floating point numbers are represented with $32$ bits. The values for $X$ and $Y$ will be $X = 1.0, Y = 1.0$ $X = 1.0, Y = 0.0$ $X = 0.0, Y = 1.0$ $X = 0.0, Y = 0.0$
Consider the values of $A = 2.0 \times 10^{30}, B = -2.0 \times 10^{30}, C = 1.0,$ and the sequence X:= A + B Y:= A + C X:= X + C Y:= Y + Bexecuted on a computer where fl...
12.0k
views
commented
Nov 19, 2017
Digital Logic
gatecse-2000
digital-logic
number-representation
normal
+
–
1
answer
30
GATE CSE 1991 | Question: 01-v
When two $4$-bit numbers $A = a_3a_2a_1a_0$ and $B=b_3b_2b_1b_0$ are multiplied, the bit $c_1$ of the product $C$ is given by ________
When two $4$-bit numbers $A = a_3a_2a_1a_0$ and $B=b_3b_2b_1b_0$ are multiplied, the bit $c_1$ of the product $C$ is given by ________
5.0k
views
commented
Nov 18, 2017
Digital Logic
gate1991
digital-logic
normal
number-representation
fill-in-the-blanks
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register