A relation R (ABCDE) with functional dependency F= {AB ->CD, A->E, C->D} The decomposition of R into R1(ABC), R2(BCD) and R3(CDE) (i) lossless join (ii) lossy decomposition (iii) dependency preserving (iv) not dependency preserving (A) i & ii (B) i & iv (C) ii & iii (D) ii & iv
Consider the following relation R(XYZ) with X as the primary key and Z as the foreign key referencing X with a delete cascade. X Y Z X1 Y1 X7 X3 Y1 X2 X5 Y4 X3 X2 Y2 X1 X9 Y5 X3 X7 Y3 X8 X4 Y2 X2 Suppose tuple (X2, Y2, X1) is deleted, as a result what will be the number of tuples in R after deletion?
Consider the following Relations R(IJKLMNO) With following FD’S IJ -→ K KL → M MN → O NO → M LM → K JK → I Number of candidate keys?
Number of cycles of length 4 that are possible in the complete bipartite graph K(4,6) is
FInd the translation of following SDT using “Reverse of LMD” for given input S → a{ print “1” }A A → A{print “2”}B A → {print “3”}a B → b{print “4”} Input “aab” 1234 4321 1432 4231
Highest Response Ratio Next CPU Scheduling Algorithm behaves like Shortest Process Next When _____________. Burst Time of all Process is same Burst Time of all Process are different Arrival time of all Process is same Arrival time of all Process are different
Are all serializable schedules recoverable, cascade-less, strict???
L1={WWʳ |w€(a+b)*} L2= Reversal(L1) What is L1.L2? What is the answer to this question please don't apply closure property I understood through closure property. My doubt is L1.L2 =W.Wʳ.Wʳ.W and this isn't accepted by any pda so shouldn't the answer be not cfl ??
Priority inversion problem may occur when: 1)OS uses round robin algo and programmer has used peterson's solution to synchronize 2 processes 2)OS uses preemptive priority based algo and programmer has used TSL mechanism to synchronize multiple ... to synchronize multiple processes 4)OS uses preemptive priority based algo and programmer has used semaphore to synchronize multiple processes
https://csedoubts.gateoverflow.in/?qa=blob&qa_blobid=2099352907172066319
1 vote
Given answer is option c.can any one explain how??
the answer is given as option d.But iam not satisfied with their explanation.. can anyone explain..
Which one should be correct here B or C?
Why here XNOR is using instead of XOR?? I havenot got their explanation too.Plz someone elaborate
For boolean algebra, lattice need to be complemented and distributive. What is complement (1,2), isnot (1,3) and (1,4) both?
1 vote
Should * be right associative here?plz check
How D could be correct ans here, Plz verify
should not B) correct answer here?Here for 1 ‘a’ input, two aa pushing, So, it means number of ‘b’ will be double??isnot it? Someone plz chk…..
Please explain the solution along with the concept.
Finding the number of inversions, in an array can be found using (A) Brute force and divide and conquer Ans given A) but I want to know , how inversion uses Brute force and divide and conquer? Because here we can take any unsorted array, then how that two technique could be used?
Station A needs to send a message consisting of 15 packets to station B using a sliding window(window size 4) and Go-back-N error control strategy.All packets are ready and immediately available for transmission. If every 6th packet that A transmit gets lost(but no acknowledgement from B every last) Then what is the number of packet that A transmit for sending the message B?
38.
8.