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 yashpaneliya
1
answer
1
Applied Test Series
Assume that we are retrieving a HTML base file with 10 embedded objects. Consider X Round trip time(RTT's) are required to retrieve the base file and the objects under non persistent HTTP with no parallel connection, and Y Round trip time(RTT' ... HTTP with 6 parallel connections.Compute X+ Y ? [Ignore the processing delays, closing TCP connection or any other delays].
Assume that we are retrieving a HTML base file with 10 embedded objects. Consider X Round trip time(RTT’s) are required to retrieve the base file and the objects under...
1.9k
views
commented
Jan 31, 2022
Computer Networks
test-series
computer-networks
application-layer
+
–
5
answers
2
GATE CSE 2020 | Question: 37
Consider a schedule of transactions $T_1$ and $T_2$ ...
Consider a schedule of transactions $T_1$ and $T_2$:$\begin{array}{|c|c|c|c|c|c|c|c|c|c|c|} \hline T_1 & RA & & & RC & & WD & & WB & \text{Commit} & \\ \hline T_2 & & R...
11.9k
views
commented
Jan 28, 2022
Databases
gatecse-2020
databases
transaction-and-concurrency
2-marks
+
–
0
answers
3
GATE Applied Mock Test
3 -1 1 2
3-112
565
views
asked
Jan 24, 2022
Probability
probability
normal-distribution
random-variable
variance
+
–
9
answers
4
GATE CSE 2006 | Question: 42
A CPU has a five-stage pipeline and runs at $1$ GHz frequency. Instruction fetch happens in the first stage of the pipeline. A conditional branch instruction computes the target address and evaluates the condition in the third stage of the pipeline. The processor stops fetching new ... : $\text{1.0 second}$ $\text{1.2 seconds}$ $\text{1.4 seconds}$ $\text{1.6 seconds}$
A CPU has a five-stage pipeline and runs at $1$ GHz frequency. Instruction fetch happens in the first stage of the pipeline. A conditional branch instruction computes the...
21.2k
views
commented
Nov 14, 2021
CO and Architecture
gatecse-2006
co-and-architecture
pipelining
normal
+
–
3
answers
5
Applied roots test series question.
Which of the following is/are undecidable? A = { M| M is TM that accepts exactly all the odd length strings} L = { M|M is a TM and L(M) is infinite} EQ = {<D,E> | D is a DFA , E is a regular expression and L(D) = L(E ... According the key option a' is also UNDECIDABLE why is that, where am I going wrong and is the idea I've thought for option b' correct?
Which of the following is/are undecidable? A = { M| M is TM that accepts exactly all the odd length strings} L = { M|M is a TM and L(M) is infinite} EQ = {<D,E | D is a ...
575
views
commented
Nov 12, 2021
Theory of Computation
decidability
+
–
1
answer
6
DBMS Korth Edition 4 Exercise 12 Question 5 (Page No. 490)
Construct a $B^+$-tree for the following set of key values: $(2, 3, 5, 7, 11, 17, 19, 23, 29, 31)$ Assume that the tree is initially empty and values are added in ascending order. Construct B+-trees for the cases where the number of pointers that will fit in one node is as follows: a. Four b. Six c. Eight
Construct a $B^+$-tree for the following set of key values:$(2, 3, 5, 7, 11, 17, 19, 23, 29, 31)$Assume that the tree is initially empty and values are added in ascending...
1.5k
views
answered
Nov 9, 2021
Databases
korth
databases
indexing
b-tree
descriptive
+
–
4
answers
7
GATE CSE 1998 | Question: 7-a
Suppose we have a database consisting of the following three relations. $\text{FREQUENTS (student, parlor)}$ giving the parlors each student visits. $\text{SERVES (parlor, ice-cream)}$ ... the following in SQL: Print the students that frequent at least one parlor that serves some ice-cream that they like.
Suppose we have a database consisting of the following three relations.$\text{FREQUENTS (student, parlor)}$ giving the parlors each student visits.$\text{SERVES (parlor, ...
6.1k
views
commented
Oct 24, 2021
Databases
gate1998
databases
sql
descriptive
+
–
9
answers
8
GATE CSE 2012 | Question: 34, ISRO-DEC2017-32
An Internet Service Provider (ISP) has the following chunk of CIDR-based IP addresses available with it: $245.248.128.0/20$. The ISP wants to give half of this chunk of addresses to Organization $A$, and a quarter to Organization $B$, while retaining the remaining ... $245.248.136.0/24 \text{ and } 245.248.132.0/21$
An Internet Service Provider (ISP) has the following chunk of CIDR-based IP addresses available with it: $245.248.128.0/20$. The ISP wants to give half of this chunk of a...
30.2k
views
commented
Aug 10, 2021
Computer Networks
gatecse-2012
computer-networks
subnetting
normal
isrodec2017
+
–
2
answers
9
GATE IT 2005 | Question: 49
An instruction set of a processor has $125$ signals which can be divided into $5$ groups of mutually exclusive signals as follows: Group $1$ $:$ $20$ signals, Group $2$ $:$ $70$ signals, Group $3$ $:$ $2$ signals, Group $4$ ... signals. How many bits of the control words can be saved by using vertical microprogramming over horizontal microprogramming? $0$ $103$ $22$ $55$
An instruction set of a processor has $125$ signals which can be divided into $5$ groups of mutually exclusive signals as follows:Group $1$ $:$ $20$ signals, Group $2$ $:...
9.4k
views
commented
Aug 5, 2021
CO and Architecture
gateit-2005
co-and-architecture
microprogramming
normal
+
–
1
answer
10
GATE CSE 2001 | Question: 21-c
Consider a relation $\text{examinee (regno, name, score)},$ where regno is the primary key to score is a real number. Suppose the relation $\text{appears (regno, centr_code)}$ specifies the center where an examinee appears. Write an SQL query to list the centr_code having an examinee of score greater than $80.$
Consider a relation $\text{examinee (regno, name, score)},$ where regno is the primary key to score is a real number.Suppose the relation $\text{appears (regno, centr_cod...
1.9k
views
commented
Jun 12, 2021
Databases
gatecse-2001
databases
sql
normal
descriptive
+
–
8
answers
11
GATE CSE 2006 | Question: 34
Consider the regular language $L=(111+11111)^{*}.$ The minimum number of states in any DFA accepting this languages is: $3$ $5$ $8$ $9$
Consider the regular language $L=(111+11111)^{*}.$ The minimum number of states in any DFA accepting this languages is:$3$$5$$8$$9$
34.3k
views
answered
Jun 2, 2021
Theory of Computation
gatecse-2006
theory-of-computation
finite-automata
normal
minimal-state-automata
+
–
2
answers
12
GATE CSE 2013 | Question: 32
Consider the following languages. $L_1 = \left \{ 0^p1^q0^r \mid p,q,r \geq 0 \right \}$ $L_2 = \left \{ 0^p1^q0^r \mid p,q,r \geq 0, p\neq r \right \}$ Which one of the following statements is FALSE? $L_2$ is context-free. $L_1\cap L_2$ is context-free. Complement of $L_2$ is recursive. Complement of $L_1$ is context-free but not regular.
Consider the following languages.$L_1 = \left \{ 0^p1^q0^r \mid p,q,r \geq 0 \right \}$$L_2 = \left \{ 0^p1^q0^r \mid p,q,r \geq 0, p\neq r \right \}$Which one of the fol...
15.6k
views
commented
Jun 1, 2021
Theory of Computation
gatecse-2013
theory-of-computation
identify-class-language
normal
+
–
2
answers
13
TIFR CSE 2015 | Part A | Question: 12
Consider two independent and identically distributed random variables $X$ and $Y$ uniformly distributed in $[0, 1]$. For $\alpha \in \left[0, 1\right]$, the probability that $\alpha$ max $(X, Y) < XY$ is $1/ (2\alpha)$ exp $(1 - \alpha)$ $1 - \alpha$ $(1 - \alpha)^{2}$ $1 - \alpha^{2}$
Consider two independent and identically distributed random variables $X$ and $Y$ uniformly distributed in $[0, 1]$. For $\alpha \in \left[0, 1\right]$, the probability t...
1.9k
views
commented
Mar 29, 2021
Probability
tifr2015
probability
random-variable
uniform-distribution
+
–
2
answers
14
TIFR CSE 2014 | Part A | Question: 19
Consider the following random function of $x$ $F(x) = 1 + Ux + Vx^{2} \bmod 5$, where $U$ and $V$ are independent random variables uniformly distributed over $\left\{0, 1, 2, 3, 4\right\}$. Which of the following is FALSE? $F(1)$ ... $F(1), F(2), F(3)$ are independent and identically distributed random variables. All of the above. None of the above.
Consider the following random function of $x$$F(x) = 1 + Ux + Vx^{2} \bmod 5$,where $U$ and $V$ are independent random variables uniformly distributed over $\left\{0, 1, ...
1.6k
views
commented
Mar 29, 2021
Probability
tifr2014
probability
random-variable
+
–
1
answer
15
TIFR CSE 2011 | Part A | Question: 7
Let $X$ and $Y$ be two independent and identically distributed random variables. Then $P\left ( X> Y \right )$ is. $\frac{1}{2}$ 1 0 $\frac{1}{3}$ Information is insufficient.
Let $X$ and $Y$ be two independent and identically distributed random variables. Then $P\left ( X Y \right )$ is.$\frac{1}{2}$10$\frac{1}{3}$Information is insufficient.
1.8k
views
commented
Mar 29, 2021
Probability
tifr2011
probability
random-variable
+
–
4
answers
16
GATE CSE 1993 | Question: 8.1
Consider a simple connected graph $G$ with $n$ vertices and $n$ edges $(n > 2)$. Then, which of the following statements are true? $G$ has no cycles The graph obtained by removing any edge from $G$ is not connected $G$ has at least one cycle The graph obtained by removing any two edges from $G$ is not connected None of the above
Consider a simple connected graph $G$ with $n$ vertices and $n$ edges $(n 2)$. Then, which of the following statements are true?$G$ has no cyclesThe graph obtained by re...
9.8k
views
commented
Mar 26, 2021
Graph Theory
gate1993
graph-theory
graph-connectivity
easy
multiple-selects
+
–
6
answers
17
TIFR CSE 2012 | Part A | Question: 7
It is required to divide the $2n$ members of a club into $n$ disjoint teams of $2$ members each. The teams are not labelled. The number of ways in which this can be done is: $\frac{\left ( 2n \right )!}{2^{n}}$ $\frac{\left ( 2n \right )!}{n!}$ $\frac{\left ( 2n \right )!}{2^n . n!}$ $\frac{n!}{2}$ None of the above
It is required to divide the $2n$ members of a club into $n$ disjoint teams of $2$ members each. The teams are not labelled. The number of ways in which this can be done ...
4.7k
views
commented
Mar 25, 2021
Combinatory
tifr2012
combinatory
balls-in-bins
+
–
5
answers
18
GATE CSE 2005 | Question: 8
Let $A, B$ and $C$ be non-empty sets and let $X = ( A - B ) - C$ and $Y = ( A - C ) - ( B - C ).$ Which one of the following is TRUE? $X = Y$ $X ⊂ Y$ $Y ⊂ X$ None of these
Let $A, B$ and $C$ be non-empty sets and let $X = ( A - B ) - C$ and $Y = ( A - C ) - ( B - C ).$ Which one of the following is TRUE?$X = Y$$X ⊂ Y$$Y ⊂ X$None of thes...
7.1k
views
commented
Mar 25, 2021
Set Theory & Algebra
gatecse-2005
set-theory&algebra
easy
set-theory
+
–
6
answers
19
GATE CSE 2003 | Question: 31
Let $(S, \leq)$ be a partial order with two minimal elements a and b, and a maximum element c. Let P: S \(\to\) {True, False} be a predicate defined on S. Suppose that P(a) = True, P(b) = False and P(x) \(\implies\) P(y) for all $x, y \in S$ satisfying $x \leq y$ ... for all x \(\in\) S such that b ≤ x and x ≠ c P(x) = False for all x \(\in\) S such that a ≤ x and b ≤ x
Let $(S, \leq)$ be a partial order with two minimal elements a and b, and a maximum element c. Let P: S \(\to\) {True, False} be a predicate defined on S. Suppose that P(...
11.7k
views
commented
Mar 24, 2021
Set Theory & Algebra
gatecse-2003
set-theory&algebra
partial-order
normal
propositional-logic
+
–
3
answers
20
GATE CSE 1991 | Question: 01,xiv
If the longest chain in a partial order is of length $n$, then the partial order can be written as a _____ of $n$ antichains.
If the longest chain in a partial order is of length $n$, then the partial order can be written as a _____ of $n$ antichains.
5.8k
views
commented
Mar 24, 2021
Set Theory & Algebra
gate1991
set-theory&algebra
partial-order
normal
fill-in-the-blanks
+
–
5
answers
21
GATE CSE 2007 | Question: 48
Which of the following is TRUE about formulae in Conjunctive Normal Form? For any formula, there is a truth assignment for which at least half the clauses evaluate to true. For any formula, there is a truth assignment for which all the clauses ... formula such that for each truth assignment, at most one-fourth of the clauses evaluate to true. None of the above.
Which of the following is TRUE about formulae in Conjunctive Normal Form?For any formula, there is a truth assignment for which at least half the clauses evaluate to true...
14.9k
views
commented
Mar 15, 2021
Digital Logic
gatecse-2007
digital-logic
normal
conjunctive-normal-form
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register