Register
Filter

Answers by Isha_99

2 votes
1
MADE-EASY FULL LENGTH TEST
Let A={2,3,4,5,6,7,8,9,10,11,12,13,14,15,16} and consider the divides relation on A. Let C denote the length of the maximal chain, M the number of maximal element, and m the number of minimal elements. Which is true? C=3,M=8,m=6 C=4,M=8,m=6 C=3,M=6,m=6 C=4,M=6,m=4
Let A={2,3,4,5,6,7,8,9,10,11,12,13,14,15,16} and consider the divides relation on A. Let C denote the length of the maximal chain, M the number of maximal element, and m ...
5 votes
7
2 Phase Locking | Made Easy Test Series
Given Problem : S1 can be shown allowed under 2PL. However, the solution that they have provided for S2 : Seems wrong, as So, is S2 allowed under 2PL, or the answer given is incorrect?
Given Problem : S1 can be shown allowed under 2PL.However, the solution that they have provided for S2 : Seems wrong, as So, is S2 allowed under 2PL, or the answer give...
4 votes
8
made easy mock 1 2022
persistent connection require all info at one time while non persistent require every time a new connection can any one solve this question..
persistent connection require all info at one timewhile non persistent require every time a new connection can any one solve this question..
1 votes
12
combinatorics
How many 5-digit even numbers have all digits distinct?
How many 5-digit even numbers have all digits distinct?
3 votes
15
Applied Gate Test Series Question
Consider the following code segments, the total number of processes (including the initial process) is ______.
Consider the following code segments, the total number of processes (including the initial process) is ______.
2 votes
17
Applied Test Series
Consider the following sequence of instructions Add #20,R0,R1 Mul #3,R2,R3 And # ... fetch(other stages also) requires only one clock cycle. Number of cycles required to complete the given sequence of instructions are_____
Consider the following sequence of instructions Add #20,R0,R1 Mul #3,R2,R3 And #$3A,R2,R4 Add R0, R2, R5 In all instructions, the destination operand is given last. Init...
4 votes
19
Self doubt in CLR(1)
if a grammar is CLR(1) with no mergeable states, then it is LALR(1) ? I suppose it is “yes”, am I right?
if a grammar is CLR(1) with no mergeable states, then it is LALR(1) ? I suppose it is “yes”, am I right?
1 votes
21
Theory of computability
Regular expression for 0's and 1's that have odd no.of 1's
Regular expression for 0's and 1's that have odd no.of 1's
2 votes
27
Applied Test Series: Mock
Consider the following schedule S: S: R3(A), W2(A), R1(A), W3(A), W1(A); The possible number of view serializable schedules of the schedule S (other than S) are _____ Can someone help me in this.
Consider the following schedule S:S: R3(A), W2(A), R1(A), W3(A), W1(A);The possible number of view serializable schedules of the schedule S (other than S) are _____Can so...
Page: