Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
SaurabhKatkar
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by SaurabhKatkar
2
answers
1
TOC DCFL vs CFL
1. L ={ a^n b^m c^x d^y | n=m or x=y} 2. L ={ a^n b^x c^m d^y | n=m or x=y} Classify above in CFL/DCFL?
1. L ={ a^n b^m c^x d^y | n=m or x=y}2. L ={ a^n b^x c^m d^y | n=m or x=y}Classify above in CFL/DCFL?
3.4k
views
commented
Dec 29, 2019
Theory of Computation
theory-of-computation
context-free-language
dcfl
+
–
1
answer
2
Maxima and Minima
Find the stationary points, maxima and minima f(x)=|x+1|+|x-1| , -3<=x<=2
Find the stationary points, maxima and minimaf(x)=|x+1|+|x-1| , -3<=x<=2
798
views
commented
Dec 26, 2019
Calculus
calculus
engineering-mathematics
maxima-minima
+
–
3
answers
3
Finding Time complexity
Given answer: B Please explain
Given answer: BPlease explain
2.0k
views
commented
Dec 24, 2019
Algorithms
time-complexity
algorithms
recursion
test-series
+
–
1
answer
4
find the time complexity
What is the time complexity of the following function foo() void foo() { int i, j; for(i = 1; i <= n ; i++) for(j = i; j <= log(i); j++) printf(“gate”); } what is the time complexity? the answer given is nlogn. but I think it should be O(n)
What is the time complexity of the following function foo() void foo() { int i, j; for(i = 1; i <= n ; i++) for(j = i; j <= log(i); j++) printf(“gate”); } what is the...
1.3k
views
commented
Dec 24, 2019
Algorithms
algorithms
time-complexity
+
–
2
answers
5
How to check if a schedule is 2PL or not?
How to check if a schedule is allowed in 2PL or not? S1:R2(A)W1(B)W1(C)R3(B)R2(B)R1(A)R2(C)W3(A) S2:W2(A)W1(A)W3(A)W2(B)W1(B)W3(B)
How to check if a schedule is allowed in 2PL or not?S1:R2(A)W1(B)W1(C)R3(B)R2(B)R1(A)R2(C)W3(A)S2:W2(A)W1(A)W3(A)W2(B)W1(B)W3(B)
7.4k
views
commented
Dec 22, 2019
Databases
databases
transaction-and-concurrency
+
–
2
answers
6
synchronization
the following five concurrent processes operating on counting semaphore variable (s) which is initialized to 0 P1: wait (s); cs; signal (s); P2: wait (s); cs; signal (s); P3: wait (s); cs; signal (s); P4: signal s); cs; wait (s); P5: signal (s); cs; wait (s); what is the maximum possible value of s? A) 1 B) 2 C) 3 D) 0
the following five concurrent processes operating on counting semaphore variable (s) which is initialized to 0P1: wait (s); cs; signal (s);P2: wait (s); cs; signal (s);P3...
1.6k
views
answered
Dec 21, 2019
Operating System
semaphore
process-synchronization
operating-system
+
–
2
answers
7
Process Synchronisation Of Operating System
Consider the below Algorithm where flag and lock are global variables: P0: P1: while (flag= =1 && lock= = 0); while (flag= = 0 && lock= = 1); Enter CS Enter CS lock= 0 flag= 0 flag= 1 lock= 1 (a) The above algorithm is deadlock free (b) The above algorithm guarantees Mutual Exclusion (c) Both (a) & (b) (d) None of the above
Consider the below Algorithm where flag and lock are global variables:P0: P1:while (fla...
1.4k
views
answered
Dec 21, 2019
Operating System
operating-system
process-scheduling
process-synchronization
semaphore
+
–
1
answer
8
No. of Binary trees
FIve nodes labelled 1,2,3,4,5 are used to construct different binary trees. How many such binary trees can be constructed whose preorder traversal is 1,2,3,4,5 ?
FIve nodes labelled 1,2,3,4,5 are used to construct different binary trees. How many such binary trees can be constructed whose preorder traversal is 1,2,3,4,5 ?
1.1k
views
commented
Dec 21, 2019
13
answers
9
Minimum number of tables to represent ER-Diagram
How many minimum relations required for given ER diagram ?
How many minimum relations required for given ER diagram ?
8.6k
views
answered
Dec 18, 2019
Databases
er-diagram
databases
er-to-relational
relational
+
–
1
answer
10
TOSETs and Bounded Lattices
Which of the following are bounded lattices? (S, subset operation) (Z, <=) Are all TOSETs bounded lattices?
Which of the following are bounded lattices? (S, subset operation)(Z, <=)Are all TOSETs bounded lattices?
1.6k
views
commented
Dec 4, 2019
Set Theory & Algebra
discrete-mathematics
lattice
+
–
1
answer
11
TOC....CFL Intersection
Choose the appropriate CFL L2 that ensures $L1\bigcap L2$ is not CFL where L1={anbmcm|n,m>0) (A)L2={anbncn|n>0} (B)L2={anbmcp|n>m and m>p} (C)L2={anbnc2m|n,m>0} (D)both B and C
Choose the appropriate CFL L2 that ensures $L1\bigcap L2$ is not CFL where L1={anbmcm|n,m>0)(A)L2={anbncn|n>0}(B)L2={anbmcp|n>m and m>p}(C)L2={anbnc2m|n,m>0}(D)both B and...
968
views
commented
Dec 2, 2019
5
answers
12
GATE CSE 2015 Set 2 | Question: 55
Which one of the following well-formed formulae is a tautology? $\forall x \, \exists y \, R(x,y) \, \leftrightarrow \, \exists y \, \forall x \, R(x, y)$ ... $\forall x \, \forall y \, P(x,y) \, \rightarrow \, \forall x \, \forall y \, P(y, x)$
Which one of the following well-formed formulae is a tautology? $\forall x \, \exists y \, R(x,y) \, \leftrightarrow \, \exists y \, \forall x \, R(x, y)$$( \forall x \,...
20.5k
views
commented
Nov 30, 2019
Mathematical Logic
gatecse-2015-set2
mathematical-logic
normal
first-order-logic
+
–
3
answers
13
Morris Mano Edition 3 Exercise 5 Question 6 (Page No. 198)
Assume that the EXCLUSIVE-OR gate has a propagation delay of 20ns and that the AND and OR gates have a Propagation delay of 10ns. What is the total Propagation delay time in the four-bit adder of the figure given below?
Assume that the EXCLUSIVE-OR gate has a propagation delay of 20ns and that the AND and OR gates have a Propagation delay of 10ns. What is the total Propagation delay time...
5.3k
views
answered
Nov 28, 2019
Digital Logic
digital-logic
morris-mano
combinational-circuit
adder
+
–
2
answers
14
Digital Logic
F is a function which have three variable A,B and C. How many Universal Gates will be needed to implement this function.
F is a function which have three variable A,B and C. How many Universal Gates will be needed to implement this function.
2.0k
views
commented
Nov 27, 2019
Digital Logic
digital-logic
+
–
1
answer
15
madeeasy
Which of the following is true? A. TCP uses only cumulative acknowledgment. B. In TCP to identify the network capacity congestion window size always start with 1 MSS C. Keep alive timer is used when receiver send ack with window size 0. D. both a and c Please explain Ans is given B
Which of the following is true?A. TCP uses only cumulative acknowledgment.B. In TCP to identify the network capacity congestion window size always start with 1 MSSC. Keep...
436
views
answered
Nov 19, 2019
1
answer
16
MADE EASY COMBINATORICS
490
views
commented
Nov 19, 2019
1
answer
17
Made Easy Test Series: Algo- Mathematical Solution
Through an experiment, it is found that selection sort performs $5000$ comparisons when sorting an array of size $k.$ If the size of array is doubled, what will be the number of comparisons? will it be $\left ( 5000 \right )^{2}$ or $\left ( 5000 \right )\times 4$. Someone check plz
Through an experiment, it is found that selection sort performs $5000$ comparisons when sorting an array of size $k.$ If the size of array is doubled, what will be the nu...
430
views
commented
Nov 18, 2019
Algorithms
made-easy-test-series
algorithms
sorting
+
–
2
answers
18
made easy test series
please provide a detailed solution
please provide a detailed solution
566
views
answered
Nov 18, 2019
CO and Architecture
co-and-architecture
cache-memory
+
–
4
answers
19
MadeEasy Test Series: Algorithms - Sorting
Consider a scenario of modified quick sort, where we have given an input sorted array A[1 .. . n], all elements of array are distinct and n >=3. Pivot is the median of set of 3 elements [First element, middle element, and last element]. What will be worst case time complexity of modified quick sort? a.O($n^{2}$) b.O(nlogn) c.O($n^{2}$logn) d.O(nloglogn)
Consider a scenario of modified quick sort, where we have given an input sorted array A[1 .. . n], all elements of array are distinct and n >=3. Pivot is the median of se...
1.5k
views
answered
Nov 14, 2019
Algorithms
algorithms
sorting
quick-sort
made-easy-test-series
+
–
3
answers
20
MadeEasy Full Length Test 2019: Combinatory - Permutations And Combinations
The number of ways 5 letter be put in 3 letter boxes A,B,C. If letter box A must contain at least 2 letters.
The number of ways 5 letter be put in 3 letter boxes A,B,C. If letter box A must contain at least 2 letters.
1.4k
views
commented
Nov 14, 2019
Combinatory
discrete-mathematics
combinatory
made-easy-test-series
+
–
2
answers
21
T(n) = sqrt(n) * T(sqrt(n)) + n
T(n) = sqrt(n) * T(sqrt(n)) + n Given solution is O(log log n). But my solution is O(n log log n). 'wolframalpha'' shows the answer same as mine. You can find the solution here. Can anyone confirm the solution and provide an explantion?
T(n) = sqrt(n) * T(sqrt(n)) + n Given solution is O(log log n). But my solution is O(n log log n).'wolframalpha'' shows the answer same as mine. You can find the solution...
11.4k
views
answered
Nov 10, 2019
Algorithms
algorithms
recurrence-relation
time-complexity
+
–
3
answers
22
Rosen chapter 5.5 question 50
How many ways are there to distribute 5 distinguishable objects into three indistinguishable boxes?
How many ways are there to distribute 5 distinguishable objects into three indistinguishable boxes?
1.8k
views
answered
Nov 9, 2019
4
answers
23
MadeEasy Test Series: Computer Networks - Network Security
DH key exchange algorithm is used to establish a session between sender and receiver with n=23 and g=5. The sender's secret key is 6 and the receiver's secret key is 15. What is the secret key between the receiver and sender? Please explain with solution P.S: Answer is given as 2
DH key exchange algorithm is used to establish a session between sender and receiver with n=23 and g=5. The sender's secret key is 6 and the receiver's secret key is 15. ...
563
views
commented
Oct 22, 2019
Computer Networks
made-easy-test-series
network-security
computer-networks
+
–
1
answer
24
MadeEay Test Series 2018: Databases - Relational Algebra
here for 1st relation algebra operation the join operation is given without condition , will it be considered as natural join or cartesian product?
here for 1st relation algebra operation the join operation is given without condition , will it be considered as natural join or cartesian product?
401
views
answered
Oct 21, 2019
Databases
databases
relational-algebra
made-easy-test-series
madeeasy-testseries-2018
+
–
1
answer
25
GATE CSE 2002 | Question: 22
Construct all the parse trees corresponding to $i + j * k$ for the grammar $E \rightarrow E+E$ $E \rightarrow E*E$ $E \rightarrow id$ In this grammar, what is the precedence of the two operators $*$ and $+$? If only one parse tree is desired for any string in the same language, what changes are to be made so that the resulting LALR(1) grammar is unambiguous?
Construct all the parse trees corresponding to $i + j * k$ for the grammar $E \rightarrow E+E$ $E \rightarrow E*E$ $E \rightarrow id$In this grammar, what is the pr...
3.8k
views
commented
Sep 30, 2019
Compiler Design
gatecse-2002
compiler-design
parsing
normal
descriptive
+
–
4
answers
26
Testbook Test Series: Algorithms - Greedy Algorithm
The optimal time required in merging the list of size 11, 21, 33, 34,45,54,60 is my answer (11+21)*4+ 33*3 +(34+45)*3 + (54+60)*2 but the provided answer is 269 to 282 I don't think I have solved it wrong but just want to confirm is there any other way to do this?
The optimal time required in merging the list of size 11, 21, 33, 34,45,54,60 ismy answer (11+21)*4+ 33*3 +(34+45)*3 + (54+60)*2but the provided answer is 269 to 282I don...
1.9k
views
commented
Sep 25, 2019
Algorithms
testbook-test-series
test-series
merging
algorithms
greedy-algorithm
+
–
2
answers
27
MadeEasy Test Series 2018: Operating System - VIrtual Memory
Consider the following statements: S1 : User level process cannot modify its own page table entries. S2 : Demand paging requires that the programmer to take specific action to force the operating system to load a particular virtual memory page. ... S1 and S2 D.) None of the above My answer is A but the answer given is D please explain
Consider the following statements:S1 : User level process cannot modify its own page table entries.S2 : Demand paging requires that the programmer to take specific action...
1.3k
views
commented
Sep 21, 2019
Operating System
made-easy-test-series
operating-system
virtual-memory
madeeasy-testseries-2018
+
–
5
answers
28
Algorithm quicksort
Reply with solution @ Habibkhan,@Gabbar,@Arjun Sir
Reply with solution @ Habibkhan,@Gabbar,@Arjun Sir
2.0k
views
commented
Sep 12, 2019
Algorithms
algorithms
quick-sort
numerical-answers
made-easy-test-series
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register