Register
Filter

Recent questions without a selected answer

1.0k
views
1 answers
0 votes
Monitors Process Synchronization
Is Monitors concept not in GATE 2019 ?
User Avatar
1.3k
views
1 answers
0 votes
State True/False
1. If f is bijective function then f-1 is also bijective function.2. If f is surjective function then f-1 is a function but not surjective.3. Inverse of a function 'f' ... 4. If a relation R: X->Y is left total, then it must be a function.
User Avatar
567
views
1 answers
0 votes
Regular languages
Kindly give the reason behind 2 and 3?
User Avatar
559
views
1 answers
0 votes
ace test series
Consider the problem of construction of minimum cost binary search tree for a given set of 'n' identifiers with their respective probabilities.The time complexity of the most efficient algorithm of ... D)0((n^3)logn)
User Avatar
643
views
1 answers
1 votes
ace test series
Consider the following instance of OBST (Optimal Binary Search Tree) Problem.n=4;<a1,a2,a3,a4>=<do,if,int,while>P(1....4)=<3,3,1,1>; Q(0....4)=<2,3,1,1,1>The Cost of OBST(optimal binary search tree) is________
User Avatar
312
views
0 answers
1 votes
Patterson-Henessey, Pipelining
Here, in the DADDI instruction, there are only two stalls. But since there is no operand forwarding, won't the contents of the register be available after they ... value of the registers is available after the M stage, before it is written.
User Avatar
169
views
0 answers
0 votes
gate 2009
What does this relational calculus evaluates to?(A) Names of employees with a male supervisor.(B) Names of employees with no immediate male subordinates.(C) ... with a female supervisor.Can you please explain how to deal with the negation?
User Avatar
1.7k
views
1 answers
2 votes
Binary Search Tree
Number of ways we can insert 5,6,9,10 in the nodes of BST, such that height of BST is either 2 or 3?
User Avatar
798
views
0 answers
1 votes
#Test series
Let R(A, B, C, D, E) be a relation which has 500000 records. Size of each record is 200 B. Size of attribute A is 16 B. Size of ... from the disk when multilevel index used and when binary search applied without indexing is _______.
User Avatar
306
views
0 answers
0 votes
Programming With C
Please provide solution
User Avatar
460
views
1 answers
0 votes
ER To RDBMS
Consider an Entity-Relationship (ER) model in which entity sets E1 and E2 are connected by an 1:1 relationship R. Primary key of E1 and E2 are A and ... participation at one end (say E1). Find minimum number Of table required in RDBMS
User Avatar
717
views
1 answers
0 votes
Verifying Relational Algebra Question
I think it should be option a)All query $1,3,4$ are equivalent but $2$ is not equivalent.Query $2$ should be $\prod \text{Room no,hotel no,type,price}(\sigma \text{type='single' } \wedge \text{price=200 })$
User Avatar
3.6k
views
2 answers
1 votes
Gate 2016 CE Set 1
If the entries in each column of a square matrix M add up to 1, then an eigen value of M isA) 4 B) 3 C) 2 D) 1
User Avatar
653
views
1 answers
0 votes
Programming
User Avatar
256
views
1 answers
0 votes
Programming
User Avatar
325
views
1 answers
1 votes
Programming
User Avatar
919
views
0 answers
3 votes
MadeEasy Workbook: Computer Networks - Sliding Window
Consider a sliding window protocol operating at the data link layer between two stations 1000kilometers apart, directly connected by an error-free 1.0 Mbps link. The frame ... size of W = 10 is used, then the efficiency of the channel is
User Avatar
236
views
1 answers
0 votes
self doubt decidability
A Turing machine can compute product of any two numbers, hence decidable problemTuring machine can perform product of two numbers, then it is an undecidable problem what is the meaning of computing and performing here???
User Avatar
458
views
0 answers
1 votes
Virtual gate
User Avatar
1.1k
views
0 answers
2 votes
Equi_Joins
https://gateoverflow.in/1670/gate1998-1-33What will be the attributes of resultant table :(A B) or (C D) ?
User Avatar
438
views
2 answers
0 votes
Testbook test series
Is the given answer correct?
User Avatar
634
views
1 answers
1 votes
Time Complexity
Given two sorted arrays A and B containing distinct elements Array length given as m and n , What is the time complexity to find the IntersectionMy query is since the length of array ... should be O(m) if m<n else O(n) instead of O(m+n).
User Avatar
333
views
1 answers
1 votes
Context Free language
0^i1^j0^k|j=max(i,k) is CFL or not pls explain?
User Avatar
254
views
0 answers
1 votes
Kenneth Rosen: Algeraic structure
https://gateoverflow.in/?qa=blob&qa_blobid=8621402344393100507 I am not able to understand How both structure have same signature? Two algebras are of same ... same number of constants and also corresponding operations are of same arity.
User Avatar
286
views
2 answers
0 votes
self doubt
Best and Worst case input for:1. Selection Sort2. Insertion Sort3. Merge Sort4. Quick Sort5. Bucket Sort6. Counting Sort7. Bubble Sort
User Avatar
2.1k
views
1 answers
1 votes
self doubt
Please explain what is mean by asymptotically faster?okk so if we have two time complexity T(n) and F(n)T(n)=O(n^2)F(n)= O(n^2 logn)i am actually confused by ... O(n^2logn)for 2nd O(n^2)<O(n^2logn)so please help what does it exactly means
User Avatar
1.1k
views
1 answers
0 votes
SELF DOUBT REDUCTION
IF P1 IS REDUCIBLE TO P2 AND P1 IS RECURSIVE ENUMERABLE THEN P2 NEED NOT BE RECURSIVE ENUMERABLE ???IS IS TRUE ??WHAT I AM THINKING IS THAT P1 IS UNDECIABLE SO P2 WILL ALSO BE UNDECIABLE HENCE SHOULD BE RECURSIVE ENUMERABLE...
User Avatar
1.7k
views
0 answers
5 votes
DECIDABILITY
WHICH OF THE FOLLOWING IS DECIDABLE?1.WHEATHER AN ARBITRARY TURING MACHINE PRINTS SOME NON BLANK CHARACTER2.WHEATHER A TURING MACHINE PRINTS A SPECIFIC CHARACTER3.THE SET OF ... STATE6.T.M VISITS STATE Q ON SOME INPUT WITHIN 10 STEPS.7.
User Avatar
331
views
1 answers
0 votes
Self doubt
In case of CISC, why more number of addressing modes helps in faster exectuion of program?
User Avatar
448
views
0 answers
0 votes
Virtual gate
User Avatar
Page: