Register
Filter

Recent questions without answers

1.1k
views
0 answers
1 votes
#DBMS Explain these Relational Calculus Queries from GATE Question!
{t∣∃u∈R1(t[A]=u[A])∧¬∃s∈R2(t[A]=s[A])}{t∣∀u∈R1(u[A]="x"⇒∃s∈R2(t[A]=s[A]∧s[A]=u[A]))} Someone please explain how to read this queries or ... over whole relation then what is this u? These are from - https://gateoverflow.in/742/gate2001-2-24
User Avatar
895
views
0 answers
0 votes
self doubt
union of all finite subsets of regular language is regular.at least one proper infinite subset(if exists) of infinite CFL is regular.which is true??
User Avatar
561
views
0 answers
0 votes
Breadth first search
Suppose breadth first search is executed on the graph below starting at some unknown vertex. Assume that a call to visit a vertex is made only after ... the maximum possible depth of the queue (including the initial call) is _________.
User Avatar
654
views
0 answers
0 votes
GATE 1991 modified
Find the maximum clock frequency at which the counter in the figure below can be operated. Assume that the propagation delay through each flip flop and each ... flops is negligible.What if the clock was asynchronous then it will be 40ns?
User Avatar
272
views
0 answers
1 votes
Self doubt on regular language
Infinite union of regular languages Is not regular language. But if there is "Union of infinite lengths regular language " then it wud beRegular? CFL ?
User Avatar
256
views
0 answers
0 votes
#context free languages
Hi mates,Difference between 1) xcy {x, y € (0,1)*}2) xcx {x €(0,1)*} and c is a terminal symbol and c is not 0,1
User Avatar
378
views
0 answers
0 votes
ACe test
The distance between A and B is 1000000 meter and propagation speed is 2×10^8 m/s the data rate is 128kbps what is the optimal window size of A
User Avatar
316
views
0 answers
0 votes
morris mano ex
User Avatar
1.4k
views
0 answers
0 votes
morris mano Ex
Draw a NAND logic diagram that implements the complement of the following function:F(A, B, C, D) = Σ(0, 1, 2, 3, 6, 10, 11, 14)
User Avatar
263
views
0 answers
0 votes
PRACTICE PAPER
CONSIDER THREE STATEMENTS WITH RESPECT TO SOME TYPE OF TREES1:FINDING SMALLEST ELEMENTS.S2:FINDING ELEMENT x WHICH IS ALREADY AVAILABLE S3:FINDING ELEMENT x WHICH IS NOT THERE ... ) AND S2 USING AVL TREE IN BEST CASE WILL TAKE O(LOG N)
User Avatar
1.3k
views
0 answers
0 votes
Which of these is not a function of OS
User Avatar
302
views
0 answers
1 votes
General
#include<stdio.h>int main(){ int i =6; for(int i=0;i<5;i++){ printf("%d",i);}} This code when run using C compiler gave exception redefinition of i .But with Cplus plus it ran fine and gave output.Why that difference??
User Avatar
953
views
0 answers
0 votes
SR or RR conflicts
They are asking for the GO TO part. . there will be ppoint of SR or RR conflicts .It is seen in the ACTION part .Right?please correct me If I am wrong somewhere.
User Avatar
1.4k
views
0 answers
1 votes
Ambiguous grammar
How is this grammar Ambiguous??S-> SS+ / SS* / a Can anyone give me an example of a string with parse trees ,I am unable to find such string.
User Avatar
979
views
0 answers
0 votes
Turing Recognizable?
Turing recognizable language not closed under Complementation, that we know. But is it not closed under set difference? Explain it.------ ... which of the following operation?1)Intersection2)Complementation3)Set Difference4)Kleene Closuer
User Avatar
727
views
0 answers
2 votes
DFA/NFA
Consider a NFA with 6 states, what will be minimum number of states in corresponding DFA?A)6 B)64 C)36 D)1
User Avatar
477
views
0 answers
1 votes
Context Free Language
Which of the following is not context free?$I) L_{1}=\left \{ a^{i}b^{j}c^{k} |i,j,k\geq 0,i<j<k \right \}$I) L_{2}=\left \{ a^{i}b^{j}c^{k} |i,j,k\geq 0, j=max\left ( i,k \right )\right \}$
User Avatar
502
views
0 answers
0 votes
CFL To Regular Expression
Is there any standard way for converting CFL To Regular Expression assuming CFL represents a regular language? and i need to prove the language L = {w#w | w ... and i used pumping lemma and proved it to be non CFL is approach correct?
User Avatar
307
views
0 answers
0 votes
Self doubt on RR scheduling- ready queue concept
Consider a situation where there are 4 processes executing using RR scheduling. The processes are arriving at different intervals of time. Now, suppose P3 arrives when P2 is ... of P1, then what should be scheduled next(after P2) P1 or P3?
User Avatar
652
views
0 answers
4 votes
Arrays
main ( ){static char [3] [4] = {“abcd”, “mnop”, “fghi”};putchar (**a);}
User Avatar
350
views
0 answers
0 votes
tuple relational calclus
A database have relation schema Student(s_id,s_name,dept_id) and dept(dep_name,dept_id). Note that the dept_id can be permitted to be null in relation student .consider the ... ∀v ∈ DEPT(t[Dept_Id] ≠ v[DeptId]))}is this expression is safe.
User Avatar
378
views
0 answers
0 votes
MadeEasy Workbook: Programming & DS - Programming In C
how it will be solve plz someone help?
User Avatar
565
views
0 answers
0 votes
Combinatrics
User Avatar
269
views
0 answers
0 votes
MadeEasy Subject Test: Engineering Mathematics - Recurrence
Hi Guys,Why is option (C) wrong for the following question ?PS: One reason could be it is solution to the recurrence relation. is there any other reason ?
User Avatar
280
views
0 answers
0 votes
What does Non Inherited CFL Mean?
User Avatar
618
views
0 answers
1 votes
DBMS SELF DOUBT
Let R and S be two relations with the following schemaR(P−−,Q−−,R1,R2,R3)S(P−−,Q−−,S1,S2)where {P,Q} is the key for both schemas?R:{⟨"1","abc","p1","p2","p3"⟩,⟨"2" ... ","q3"⟩⟨"2","def","q1","q2","q3"⟩WHat is R *S? WHERE * IS NATURAL JOIN.
User Avatar
437
views
0 answers
1 votes
Probability of processor time utilization
A process spends 25% of the time waiting for the I/O to complete. If there are 3 processes in the memory at a time, then the probability of CPU time utilized is ____________________
User Avatar
470
views
0 answers
0 votes
#sorting
Which all sorting algorithms are there for gate ?
User Avatar
Page: