Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
pratik2404
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by pratik2404
18
answers
1
GATE CSE 2017 Set 2 | Question: 44
Two transactions $T_1$ and $T_2$ are given as $T_1:r_1(X)w_1(X)r_1(Y)w_1(Y)$ $T_2:r_2(Y)w_2(Y)r_2(Z)w_2(Z)$ where $r_i(V)$ denotes a $\textit{read}$ operation by transaction $T_i$ on a variable $V$ and $w_i(V)$ denotes a ... by transaction $T_i$ on a variable $V$. The total number of conflict serializable schedules that can be formed by $T_1$ and $T_2$ is ______
Two transactions $T_1$ and $T_2$ are given as$T_1:r_1(X)w_1(X)r_1(Y)w_1(Y)$$T_2:r_2(Y)w_2(Y)r_2(Z)w_2(Z)$where $r_i(V)$ denotes a $\textit{read}$ operation by transaction...
70.8k
views
commented
Jun 17, 2023
Databases
gatecse-2017-set2
databases
transaction-and-concurrency
numerical-answers
conflict-serializable
+
–
1
answer
2
GATE CSE 2021 Set 1 | Question: 47
Consider a $\textit{dynamic}$ hashing approach for $4$-bit integer keys: There is a main hash table of size $4$. The $2$ least significant bits of a key is used to index into the main hash table. Initially, the main hash table entries are empty. Thereafter, when more keys are hashed ... notation)? $5,9,4,13,10,7$ $9,5,10,6,7,1$ $10,9,6,7,5,13$ $9,5,13,6,10,14$
Consider a $\textit{dynamic}$ hashing approach for $4$-bit integer keys:There is a main hash table of size $4$.The $2$ least significant bits of a key is used to index in...
7.7k
views
commented
Jan 29, 2023
Algorithms
gatecse-2021-set1
multiple-selects
algorithms
hashing
2-marks
+
–
7
answers
3
GATE CSE 2009 | Question: 58
Frames of $1000\text{ bits}$ are sent over a $10^6$ bps duplex link between two hosts. The propagation time is $25ms$. Frames are to be transmitted into this link to maximally pack them in transit (within the link). Let $I$ be ... before starting transmission of the next frame? (Identify the closest choice ignoring the frame processing time) $16ms$ $18ms$ $20ms$ $22ms$
Frames of $1000\text{ bits}$ are sent over a $10^6$ bps duplex link between two hosts. The propagation time is $25ms$. Frames are to be transmitted into this link to maxi...
29.9k
views
commented
Jan 13, 2023
Computer Networks
gatecse-2009
computer-networks
sliding-window
normal
+
–
18
answers
4
GATE CSE 2009 | Question: 57, ISRO2016-75
Frames of $\text{1000 bits}$ are sent over a $10^6$ $\text{bps}$ duplex link between two hosts. The propagation time is $\text{25 ms}$. Frames are to be transmitted into this link to maximally pack them in transit (within the link). What is the ... ? Assume that no time gap needs to be given between transmission of two frames. $I=2$ $I=3$ $I=4$ $I=5$
Frames of $\text{1000 bits}$ are sent over a $10^6$ $\text{bps}$ duplex link between two hosts. The propagation time is $\text{25 ms}$. Frames are to be transmitted into ...
48.1k
views
commented
Jan 12, 2023
Computer Networks
gatecse-2009
computer-networks
sliding-window
normal
isro2016
+
–
5
answers
5
GATE CSE 2022 | Question: 45
Consider routing table of an organization's router shown below: ... of the subnets in the routing table? $12.20.164.0/20$ $12.20.164.0/22$ $12.20.164.0/21$ $12.20.168.0/22$
Consider routing table of an organization’s router shown below:$$\begin{array} {|l|l|l|} \hline \text{Subnet Number} & \text{Subnet Mask} & \text{Next Hop} \\\hline 12....
15.1k
views
comment edited
Jan 12, 2023
Computer Networks
gatecse-2022
computer-networks
subnetting
multiple-selects
2-marks
+
–
6
answers
6
GATE CSE 2016 Set 1 | Question: 43
Consider the transition diagram of a PDA given below with input alphabet $\Sigma=\{a,b\}$ and stack alphabet $\Gamma = \{X,Z\}$. $Z$ is the initial stack symbol. Let $L$ ... on every input $L =\{a^n\mid n \geq0 \} \cup \{a^nb^n \mid n \geq 0\}$ and is deterministic context-free
Consider the transition diagram of a PDA given below with input alphabet $\Sigma=\{a,b\}$ and stack alphabet $\Gamma = \{X,Z\}$. $Z$ is the initial stack symbol. Let $L$ ...
16.7k
views
commented
Jan 10, 2023
Theory of Computation
gatecse-2016-set1
theory-of-computation
pushdown-automata
normal
+
–
4
answers
7
GATE CSE 2014 Set 2 | Question: 16
Let $A\:\leq_m\:B$ denotes that language $A$ is mapping reducible (also known as many-to-one reducible) to language $B$. Which one of the following is FALSE? If $A\: \leq_m B$ and $B$ is recursive then $A$ ... then $A$ is recursively enumerable. If $A\: \leq_m B$ and $B$ is not recursively enumerable then $A$ is not recursively enumerable.
Let $A\:\leq_m\:B$ denotes that language $A$ is mapping reducible (also known as many-to-one reducible) to language $B$. Which one of the following is FALSE?If $A\: \leq_...
17.3k
views
commented
Jan 10, 2023
Theory of Computation
gatecse-2014-set2
theory-of-computation
recursive-and-recursively-enumerable-languages
normal
+
–
5
answers
8
GATE CSE 2008 | Question: 48
Which of the following statements is false? Every NFA can be converted to an equivalent DFA Every non-deterministic Turing machine can be converted to an equivalent deterministic Turing machine Every regular language is also a context-free language Every subset of a recursively enumerable set is recursive
Which of the following statements is false?Every NFA can be converted to an equivalent DFAEvery non-deterministic Turing machine can be converted to an equivalent determi...
8.5k
views
commented
Jan 10, 2023
Theory of Computation
gatecse-2008
theory-of-computation
easy
recursive-and-recursively-enumerable-languages
+
–
2
answers
9
GATE CSE 1990 | Question: 3-vi
Recursive languages are: A proper superset of context free languages. Always recognizable by pushdown automata. Also called type $0$ languages. Recognizable by Turing machines.
Recursive languages are:A proper superset of context free languages.Always recognizable by pushdown automata.Also called type $0$ languages.Recognizable by Turing machine...
16.7k
views
commented
Jan 10, 2023
Theory of Computation
gate1990
normal
theory-of-computation
turing-machine
recursive-and-recursively-enumerable-languages
multiple-selects
+
–
8
answers
10
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.0k
views
comment edited
Jan 10, 2023
Theory of Computation
gatecse-2006
theory-of-computation
finite-automata
normal
minimal-state-automata
+
–
9
answers
11
GATE CSE 2017 Set 2 | Question: 25
The minimum possible number of states of a deterministic finite automaton that accepts the regular language $L$ = {$w_{1}aw_{2}$ | $w_{1},w_{2}$ $\in$ $\left \{ a,b \right \}^{*}$ , $\left | w_{1} \right | = 2, \left | w_{2} \right |\geq 3$} is ______________ .
The minimum possible number of states of a deterministic finite automaton that accepts the regular language $L$ = {$w_{1}aw_{2}$ | $w_{1},w_{2}$ $\in$ $\left \{ a,b \righ...
16.4k
views
commented
Jan 9, 2023
Theory of Computation
theory-of-computation
gatecse-2017-set2
finite-automata
numerical-answers
minimal-state-automata
+
–
4
answers
12
GATE CSE 2001 | Question: 2.5
Consider a DFA over $\Sigma=\{a,b\}$ accepting all strings which have number of a's divisible by $6$ and number of $b$'s divisible by $8$. What is the minimum number of states that the DFA will have? $8$ $14$ $15$ $48$
Consider a DFA over $\Sigma=\{a,b\}$ accepting all strings which have number of a's divisible by $6$ and number of $b$'s divisible by $8$. What is the minimum number of s...
18.4k
views
commented
Jan 9, 2023
Theory of Computation
gatecse-2001
theory-of-computation
finite-automata
minimal-state-automata
+
–
5
answers
13
GATE CSE 1996 | Question: 2.23
Consider the following state table for a sequential machine. The number of states in the minimized machine will be ... $4$ $3$ $2$ $1$
Consider the following state table for a sequential machine. The number of states in the minimized machine will be$$\begin{array}{|l|l|ll|}\hline \text{} & \text{} & \tex...
12.8k
views
commented
Jan 9, 2023
Digital Logic
gate1996
normal
finite-automata
+
–
11
answers
14
GATE CSE 2008 | Question: 52
Match the following NFAs with the regular expressions they correspond to: P Q R S $\epsilon + 0\left(01^*1+00\right)^*01^*$ $\epsilon + 0\left(10^*1+00\right)^*0$ $\epsilon + 0\left(10^*1+10\right)^*1$ $\epsilon + 0\left(10^*1+10\right)^*10^*$ $P-2, Q-1, R-3, S-4$ $P-1, Q-3, R-2, S-4$ $P-1, Q-2, R-3, S-4$ $P-3, Q-2, R-1, S-4$
Match the following NFAs with the regular expressions they correspond to: P Q R S $\epsilon + 0\left(01^*1+00\right)^*01^*$$\epsilon + 0\left(10^*1+00\right)^*0$$\epsilon...
12.5k
views
commented
Jan 8, 2023
Theory of Computation
gatecse-2008
theory-of-computation
finite-automata
normal
+
–
3
answers
15
GATE CSE 2008 | Question: 10
Which of the following are decidable? Whether the intersection of two regular languages is infinite Whether a given context-free language is regular Whether two push-down automata accept the same language Whether a given grammar is context-free I and II I and IV II and III II and IV
Which of the following are decidable?Whether the intersection of two regular languages is infiniteWhether a given context-free language is regularWhether two push-down au...
13.5k
views
commented
Jan 8, 2023
Theory of Computation
gatecse-2008
theory-of-computation
decidability
easy
+
–
7
answers
16
GATE CSE 2020 | Question: 26
Which of the following languages are undecidable? Note that $\left \langle M \right \rangle$ indicates encoding of the Turing machine M. $L_1 = \{\left \langle M \right \rangle \mid L(M) = \varnothing \}$ ... $L_1$, $L_3$, and $L_4$ only $L_1$ and $L_3$ only $L_2$ and $L_3$ only $L_2$, $L_3$, and $L_4$ only
Which of the following languages are undecidable? Note that $\left \langle M \right \rangle$ indicates encoding of the Turing machine M.$L_1 = \{\left \langle M \right \r...
14.3k
views
commented
Jan 8, 2023
Theory of Computation
gatecse-2020
theory-of-computation
decidability
2-marks
+
–
1
answer
17
GATE CSE 2021 Set 2 | Question: 36
Consider the following two statements about regular languages: $S_1$: Every infinite regular language contains an undecidable language as a subset. $S_2$: Every finite language is regular. Which one of the following choices is correct? Only $S_1$ is true Only $S_2$ is true Both $S_1$ and $S_2$ are true Neither $S_1$ nor $S_2$ is true
Consider the following two statements about regular languages:$S_1$: Every infinite regular language contains an undecidable language as a subset.$S_2$:...
11.8k
views
commented
Jan 8, 2023
Theory of Computation
gatecse-2021-set2
theory-of-computation
regular-language
decidability
2-marks
+
–
2
answers
18
GATE CSE 1989 | Question: 3-iii
Which of the following problems are undecidable? Membership problem in context-free languages. Whether a given context-free language is regular. Whether a finite state automation halts on all inputs. Membership problem for type $0$ languages.
Which of the following problems are undecidable?Membership problem in context-free languages.Whether a given context-free language is regular.Whether a finite state autom...
10.0k
views
comment edited
Jan 7, 2023
Theory of Computation
gate1989
normal
theory-of-computation
decidability
multiple-selects
+
–
8
answers
19
GATE CSE 2017 Set 1 | Question: 10
Consider the following context-free grammar over the alphabet $\Sigma = \{a,b,c\}$ with $S$ as the start symbol:$S \rightarrow abScT \mid abcT$$T \rightarrow bT \mid b$ ... $\{\left ( ab \right )^{n}\left ( cb^{n} \right )^{m} \mid m,n \geq 1 \}$
Consider the following context-free grammar over the alphabet $\Sigma = \{a,b,c\}$ with $S$ as the start symbol:$$S \rightarrow abScT \mid abcT$$$$T \rightarrow bT \mid ...
21.5k
views
comment edited
Jan 7, 2023
Theory of Computation
gatecse-2017-set1
theory-of-computation
context-free-language
normal
+
–
5
answers
20
GATE CSE 2005 | Question: 57
Consider the languages: $L_1 = \left\{ww^R \mid w \in \{0, 1\}^* \right\}$ $L_2 = \left\{w\text{#}w^R \mid w \in \{0, 1\}^* \right\}$, where $\text{#}$ ... of the following is TRUE? $L_1$ is a deterministic CFL $L_2$ is a deterministic CFL $L_3$ is a CFL, but not a deterministic CFL $L_3$ is a deterministic CFL
Consider the languages:$L_1 = \left\{ww^R \mid w \in \{0, 1\}^* \right\}$$L_2 = \left\{w\text{#}w^R \mid w \in \{0, 1\}^* \right\}$, where $\text{#}$ is a special symbol$...
8.4k
views
commented
Jan 7, 2023
Theory of Computation
gatecse-2005
theory-of-computation
context-free-language
easy
+
–
9
answers
21
GATE CSE 1993 | Question: 6-3
For the initial state of $000$, the function performed by the arrangement of the $\text{J-K}$ flip-flops in figure is: Shift Register $\text{Mod- 3}$ Counter $\text{Mod- 6}$ Counter $\text{Mod- 2}$ Counter None of the above
For the initial state of $000$, the function performed by the arrangement of the $\text{J-K}$ flip-flops in figure is:Shift Register$\text{Mod- 3}$ Counter$\text{Mod- 6}$...
12.4k
views
commented
Jan 3, 2023
Digital Logic
gate1993
digital-logic
sequential-circuit
flip-flop
digital-counter
circuit-output
multiple-selects
+
–
5
answers
22
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.7k
views
commented
Jan 3, 2023
Databases
gatecse-2020
databases
transaction-and-concurrency
2-marks
+
–
5
answers
23
GATE CSE 2019 | Question: 11
Consider the following two statements about database transaction schedules: Strict two-phase locking protocol generates conflict serializable schedules that are also recoverable. Timestamp-ordering concurrency control protocol with Thomas' Write Rule can generate view serializable ... the above statements is/are TRUE? I only II only Both I and II Neither I nor II
Consider the following two statements about database transaction schedules:Strict two-phase locking protocol generates conflict serializable schedules that are also recov...
17.3k
views
commented
Jan 3, 2023
Databases
gatecse-2019
databases
transaction-and-concurrency
1-mark
+
–
6
answers
24
GATE CSE 2016 Set 2 | Question: 51
Consider the following database schedule with two transactions $T_{1}$ and $T_{2}$ ... is TRUE? $S$ is non-recoverable. $S$ is recoverable, but has a cascading abort. $S$ does not have a cascading abort. $S$ is strict.
Consider the following database schedule with two transactions $T_{1}$ and $T_{2}$.$S= r_{2}\left(X\right); r_{1}\left(X\right); r_{2} \left(Y\right); w_{1} \left(X\right...
21.8k
views
commented
Jan 3, 2023
Databases
gatecse-2016-set2
databases
transaction-and-concurrency
normal
+
–
9
answers
25
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\%$...
27.6k
views
commented
Jan 3, 2023
Databases
gatecse-2006
databases
transaction-and-concurrency
normal
isro2015
+
–
7
answers
26
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.5k
views
commented
Jan 2, 2023
Databases
gatecse-2012
databases
transaction-and-concurrency
normal
+
–
5
answers
27
GATE CSE 2008 | Question: 15
Which of the following tuple relational calculus expression(s) is/are equivalent to $\forall t \in r \left(P\left(t\right)\right)$? $\neg \exists t \in r \left(P\left(t\right)\right)$ $\exists t \notin r \left(P\left(t\right)\right)$ ... $\exists t \notin r \left(\neg P\left(t\right)\right)$ I only II only III only III and IV only
Which of the following tuple relational calculus expression(s) is/are equivalent to $\forall t \in r \left(P\left(t\right)\right)$?$\neg \exists t \in r \left(P\left(t\ri...
13.9k
views
commented
Jan 2, 2023
Databases
gatecse-2008
databases
relational-calculus
normal
+
–
10
answers
28
GATE CSE 1998 | Question: 27
Consider the following relational database schemes: COURSES (Cno, Name) PRE_REQ(Cno, Pre_Cno) COMPLETED (Student_no, Cno) COURSES gives the number and name of all the available courses. PRE_REQ gives the information about which courses are pre- ... relational algebra: List all the courses for which a student with Student_no 2310 has completed all the pre-requisites.
Consider the following relational database schemes:COURSES (Cno, Name)PRE_REQ(Cno, Pre_Cno)COMPLETED (Student_no, Cno)COURSES gives the number and name of all the availab...
7.9k
views
commented
Jan 1, 2023
Databases
gate1998
databases
relational-algebra
normal
descriptive
+
–
5
answers
29
GATE CSE 2005 | Question: 30
Let r be a relation instance with schema R = (A, B, C, D). We define $r_1 = \pi_{A, B, C} (R)$ and $r_2=\pi_{A, D} (r)$. Let $s =r_1 \: * \: r_2$ where $*$ denotes natural join. Given that the decomposition of $r$ into $r_1$ and $r_2$ is lossy, which one of the following is TRUE? $s \subset r$ $r \cup s =r$ $r \subset s$ $r*s=s$
Let r be a relation instance with schema R = (A, B, C, D). We define $r_1 = \pi_{A, B, C} (R)$ and $r_2=\pi_{A, D} (r)$. Let $s =r_1 \: * \: r_2$ where $*$ denotes natura...
16.1k
views
commented
Jan 1, 2023
Databases
gatecse-2005
databases
relational-algebra
natural-join
normal
+
–
4
answers
30
GATE IT 2007 | Question: 68
Consider the following relation schemas : b-Schema = (b-name, b-city, assets) a-Schema = (a-num, b-name, bal) d-Schema = (c-name, a-number) Let branch, account and depositor be respectively instances of the above schemas. Assume that account and ... depositor) Пc-name (σb-city = "Agra" branch ⋈ (σb-city = "Agra" ⋀ bal < 0 account ⋈ depositor))
Consider the following relation schemas :b-Schema = (b-name, b-city, assets)a-Schema = (a-num, b-name, bal)d-Schema = (c-name, a-number)Let branch, account and depositor ...
12.8k
views
commented
Dec 31, 2022
Databases
gateit-2007
databases
joins
relational-algebra
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register