Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
meethunjadhav
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by meethunjadhav
0
votes
1
OS-question
if c has value =0 initially ....i am getting MAX=2 and minimum =-2..is it correct??
if c has value =0 initially ....i am getting MAX=2 and minimum =-2..is it correct??
971
views
answered
Jul 9, 2018
Operating System
process-synchronization
+
–
0
votes
2
gateforum test series
i'm getting 5 but the answer given is 4
i'm getting 5 but the answer given is 4
387
views
answered
Feb 24, 2018
DS
data-structures
binary-heap
numerical-answers
gateforum-test-series
+
–
1
votes
3
Finite Automata : DFA
Is the following DFA valid ?? Can we go to same state from a same state with different inputs ??
Is the following DFA valid ?? Can we go to same state from a same state with different inputs ??
492
views
answered
Feb 11, 2018
Theory of Computation
finite-automata
+
–
0
votes
4
Gate 2018
Which of the following is true In slow start phase cwnd 1)Increase by 2mss after every successfull ack 2) approximately double after every rtt 3) increase by 1mss after every successfull ack 4) approximately double after every rtt I am not sure but question was something like that
Which of the following is trueIn slow start phase cwnd1)Increase by 2mss after every successfull ack2) approximately double after every rtt3) increase by 1mss after every...
1.2k
views
answered
Feb 6, 2018
0
votes
5
Transport Layer
Solution for Q1 ,Q2?
Solution for Q1 ,Q2?
1.3k
views
answered
Feb 4, 2018
Computer Networks
computer-networks
transport-layer
tcp
+
–
0
votes
6
madeeasy test series
Consider 3 processes P0, P1 and P2 to be scheduled as per the SRTF algorithm. The process P0' is known to be scheduled first and when P0 has been running 6' units of time, then the process P2' has arrived. The process P2' has run for 4' unit of ... ' units of time. Then the minimum burst time of P0' is _______ (in units). Please explain how to solve this. Ans is given 17
Consider 3 processes P0, P1 and P2 to be scheduled as per the SRTF algorithm. The process ‘P0’ is known to be scheduled first and when ‘P0 has been running ‘6’ ...
462
views
answered
Jan 15, 2018
0
votes
7
Testt
Consider the below given grammar: A→AA+ A→a Consider the below given statements: S1: The grammar is not LL(1). S2: The grammar is CLR(1) but not LALR(1). S3: The grammar is ambiguous. S4: The grammar is LALR(1) as well as CLR(1). Choose the correct option:( Marks: ... of states in LALR(1) is 5. Only S1 and S2 are correct. Answer given is option (3). But I cant understand why S3 is incorrect.
Consider the below given grammar:A→AA+A→aConsider the below given statements:S1: The grammar is not LL(1).S2: The grammar is CLR(1) but not LALR(1).S3: The grammar is...
449
views
answered
Jan 13, 2018
Theory of Computation
parsing
+
–
3
votes
8
Lexical Analysis
What are different set of characters which are taken as single token in lexical analysis in compiler design? For eg. Charaters under double quotes are taken as single token, post-increment and pre-increment is taken as single token etc.
What are different set of characters which are taken as single token in lexical analysis in compiler design?For eg. Charaters under double quotes are taken as single toke...
814
views
answered
Jan 12, 2018
Compiler Design
compiler-design
lexical-analysis
compiler-tokenization
+
–
2
votes
9
Lexical error or No of tokens
Is this line a/*b successfully generating the token's or it give lexical error ? if it is given the lexical error then why so ? I think it will give lexical error because we don't find */ here
Is this line a/*b successfully generating the token's or it give lexical error ? if it is given the lexical error then why so ?I think it will give lexical error because...
1.2k
views
answered
Jan 12, 2018
Compiler Design
compiler-tokenization
lexical-analysis
+
–
0
votes
10
Transactions & Concurrency Control
The above question has a blind write so it should be View Serializable. But can it be Conflict Serializable?
The above question has a blind write so it should be View Serializable. But can it be Conflict Serializable?
467
views
answered
Jan 9, 2018
Databases
serializability
conflict-serializable
transaction-and-concurrency
+
–
0
votes
11
conflict serializable schedules
How many concurrent schedules are conflict serializable of given transactions T1 and T2 :
How many concurrent schedules are conflict serializable of given transactions T1 and T2:
508
views
answered
Jan 8, 2018
1
votes
12
how to find no. of terms in Gp series here
$n^2 + 2n^2 + 4n^2 + 8n^2 + ------------ + 8^{logn}$ base =2
$n^2 + 2n^2 + 4n^2 + 8n^2 + + 8^{logn}$base =2
475
views
answered
Jan 8, 2018
0
votes
13
Memory techniques
Fixed partitioning for contiguous memory allocation suffers from external fragmentation or not please explain with example
Fixed partitioning for contiguous memory allocation suffers from external fragmentation or not please explain with example
387
views
answered
Jan 8, 2018
Operating System
memory-management
+
–
0
votes
14
BCNF, lossless, functional dependency preserving.
Given R(ABCDEFG) and functional dependencies AB $\rightarrow$ C BC $\rightarrow$ A AC $\rightarrow$ B B $\rightarrow$ D D $\rightarrow$ E Decompositions: 1. R1(ABC) R2(ABFG) R3(BD) R4(DE) 2. R1(ABC) R2(BCFG) R3(BD) ... ABC) R2(ACFG) R3(BD) R4(DE) Is all of these decompositions are lossless, dependency persevering and BCNF? Please confirm. Thank you.
Given R(ABCDEFG) and functional dependenciesAB $\rightarrow$ CBC $\rightarrow$ AAC $\rightarrow$ BB $\rightarrow$ DD $\rightarrow$ EDecompositions:1. R1(ABC) R2(ABFG) R3...
2.3k
views
answered
Jan 8, 2018
Databases
database-normalization
dependency-preserving
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register