Register
Filter

Recent questions without answers

377
views
0 answers
0 votes
self doubt
i have come across this question and i get different answers from different people but my main doubt is now p1 and p2 not in critical section they ... this be consider as progress doesnot satisfy? please please someone clarify my doubt.
User Avatar
972
views
0 answers
1 votes
CSMA/CD
A simple network consist of two nodes X and Z which are 800 m apart. Each node has a single frame of F = 1500 bits (including all header and preambles) to send to ... X's packet (from t = 0) to be completely delivered to Z is ________ μs.
User Avatar
665
views
0 answers
0 votes
testbook test
WHICH OF THE FOLLOWING protocol IS NOT DEFINED BY TCP/IP model at Transport layer?1.TCP2.SCTP3.UDP4.ALL the above are defined.since SCTP was NEW concept for me how should we attempt these type of questions in final exam.
User Avatar
997
views
0 answers
4 votes
Expectation and BST
Here how did we find the number of comparisons for any number.
User Avatar
256
views
0 answers
0 votes
c-program output
User Avatar
370
views
0 answers
0 votes
ACE test series
I and 2 are wrong statements.If 1 were right then since every DCFL is a recursive language the intersection of two DCFL would be DCFL which is not.Same logic can be applied to 2.Ace test series sucks.
User Avatar
317
views
0 answers
0 votes
Counting
How many ways 20 distinct numbers can be arranged in location/index 1 to 20 such that,three particular numbers(say 3,10,20) will always be present in the first half.(3,10,20 location/index will be always <11) ?
User Avatar
138
views
0 answers
0 votes
Doubt!!
Anyone please tell me How maximum children would be 2B-1For B=5 it would be maximum of 6 children not 8 children right??
User Avatar
640
views
0 answers
1 votes
MadeEasy Subject Test: Compiler Design - Parsing
The given answer is 5,i am getting 616 in CLR and 10 in LALR.Please someone confirm?
User Avatar
251
views
0 answers
0 votes
Problem while making a PDA
I feel it difficult to know when to change the state while making a PDA.Could anyone tell me in detailed manner when to cahnge the state .Below is the ... a problem , could anyone tell me which one is more appropriate with justification.
User Avatar
164
views
0 answers
1 votes
Pushdown automata
For the given PDA , Which of the following is true .A) regular but infiniteB) regular but finite C) CFL but not DCFL .Answer is a .. since it generates strings of the ... true ?? PSthe move above q1 is: 0,0|0 (just in case its not readable)
User Avatar
708
views
0 answers
2 votes
Sorting
If we are asked to find best comparison based sorting algorithm to sort n numbers having d digit's and in the range from [1-k].If I say it is quick sort ... wrong ?OR in general we do sorting on these type of numbers using Radix sort only ?
User Avatar
668
views
0 answers
0 votes
Cryptography
Can a single secret key can be used by the sender to sign documents for multiple receiver ?I think we can because purpose of digital signature is to make sure ... data is not corrupted and also it is coming from the source expected by us.
User Avatar
422
views
0 answers
0 votes
dynamic programming
To be considered as a dynamic programming model...there are 2 properties1.must have optimal substructure2.must have overlapping subproblemsOnly if both are satisfied it is dynamic or any one if satisfied is sufficient
User Avatar
229
views
0 answers
0 votes
gatebook
I checked with handshaking lemma I got 3 are not trees. I added all the degree sequence and equalized with 2* no of vertices -1 because if it is tree no of edges = no of vertices -1.Then no sequence is tree.Is it the way to do?
User Avatar
593
views
0 answers
3 votes
Is cnf gnf & cyk algoritm present in gate 2018 toc syllabus??
User Avatar
948
views
0 answers
2 votes
Binary Tree
Consider the following routine on binary treevoid do(struct btnode *t) { if(t) { Do(t->Rightchild); Do(t->Leftchild); swap(t->Rightchild,t->Leftchild); } }1) What does Do(t) do on following binary tree after running the code?a)b)
User Avatar
3.0k
views
0 answers
1 votes
Multiplexer select lines confusion
Here how do we know which variable of select lines is MSB and LSB ? Do we go in MSB->LSB ordering and take A as MSB and B as LSB or do we go by number taking B as MSB (as it is S1) and A as LSB (as it is S0) ?
User Avatar
1.2k
views
0 answers
5 votes
Time Complexity
//n is a prime number hereint main() { for(i=1;i<=n;i=2*i) { for(j=1;j<=n;j++) { if(n%i==0) { k=1; while(k<=n) { a=b+c; k=k+1; } } } } }
User Avatar
642
views
0 answers
0 votes
MERGE SORT
IS 2 way merge sort and normal merge sort is same.in which we have to use bottom-up merging approach by taking 2-2 element inside the list.if 5-way merge ... -5 elements from bottom to up for merging.if I am wrong please let me correct!
User Avatar
1.2k
views
0 answers
1 votes
Array
Consider X[1...n] and Y[1...n] be two arrays, each containing n numbers both of which already sorted. What is the time complexity to find the median by combining two arrays?O(n)O(log n)O(nlogn)O(loglog n)
User Avatar
306
views
0 answers
1 votes
normal forms
Can we achieve 0% redundancy in any of the normal forms?
User Avatar
2.8k
views
0 answers
1 votes
Given a left recursive grammar. Whether LL(1) SLR(1)?
AS GIVEN GRAMMAR IS LEFT RECURSIVE SO OPTION D MUST TRUE.ANS GIVEN:C
User Avatar
366
views
0 answers
1 votes
Algorithm
True or False ExplainBellman Ford can never find shortest path of a graphFloyd Warshall can find shortest path of a graph
User Avatar
825
views
0 answers
2 votes
Planarity of graph
Whether given graph is planar or not please explain?
User Avatar
241
views
0 answers
0 votes
syllabus
Isa) Frobenius normb)Gauss-Siedel iterative method there in gate 2018?and also need a help with this question - https://gateoverflow.in/3433/gate2007-it-2
User Avatar
206
views
0 answers
0 votes
#doubt algo
What is the disadvantage of avl tree over b tree ??
User Avatar
140
views
0 answers
1 votes
doubt
what is term dependent in employee table
User Avatar
Page: