Register
Filter

Recent questions without a selected answer

314
views
1 answers
0 votes
SELF DOUBT DCFL
SUPPOSE WE HAVE A SITUATION IN BETWEEN LIKE THIS (DCFL) INTERSECTION (REGULAR LANG)..............................SITUATION 1NOW WE CAN WRITE DCFL ... UNDER REGULAR INTERSECTION HENCE DCFL ...........WHY THIS CONTRADICTION IS ARISING??????
User Avatar
463
views
0 answers
0 votes
Process Scheduling
printf("Hello");if(!fork())printf("World");
User Avatar
688
views
4 answers
1 votes
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 ... the receiver and sender? Please explain with solution P.S: Answer is given as 2
User Avatar
1.5k
views
1 answers
2 votes
closure properties of cfl
cfl are closed undera) min b)max c)half d)alt e)none of thesecfl are not closed under initl/acycleset diffeence
User Avatar
538
views
0 answers
0 votes
multi dimensional array
Let A be a two-dimensional array declared as follows: A: array[1..23][1..19] of integer; Assuming that each integer takes one memory location, the array is stored ... the location. Find out the address of the address of the element A[i][j].
User Avatar
217
views
0 answers
0 votes
Eigen vector
User Avatar
768
views
2 answers
0 votes
Self Doubt in checking whether a language is regular or not
Is there any way to check whether a language is regular or not without using Pumping lemma?
User Avatar
1.7k
views
1 answers
0 votes
Toc book
A good book of TOC for GATE ??
User Avatar
240
views
0 answers
0 votes
Eigen vector
Is it true that if we have 3 distinct eigen vectors x,y and z than x,y and z would respectively be orthogonal to each other .Please elaborate
User Avatar
383
views
1 answers
0 votes
Graph theory
In tree for every pair of vertices u!=v in G their is exactly 1 path from u to v .Please help me to prove this
User Avatar
687
views
0 answers
1 votes
C programming
Consider 2 cases:1. Call by value result2. Call by referenceint x = 10 ;main ( ){P(x); printf (x);}P ( int a){If ( a ≤ 40 ){a = a ... to actual.Any example in which these 2 will differ in output(especially in case of function calls)?
User Avatar
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
570
views
1 answers
0 votes
Regular languages
Kindly give the reason behind 2 and 3?
User Avatar
564
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
644
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
320
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
170
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
805
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
308
views
0 answers
0 votes
Programming With C
Please provide solution
User Avatar
462
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
654
views
1 answers
0 votes
Programming
User Avatar
257
views
1 answers
0 votes
Programming
User Avatar
326
views
1 answers
1 votes
Programming
User Avatar
922
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
239
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
460
views
0 answers
1 votes
Virtual gate
User Avatar
Page: