search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.

Recent questions tagged ace-academy-test-series

0 votes
1 answer 10 views
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
asked Jun 8 in Databases DKY123 15 points 10 views
0 votes
1 answer 16 views
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?
asked Jun 7 in Databases DKY123 15 points 16 views
0 votes
1 answer 58 views
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?
asked Sep 7, 2020 in Databases Pathki Shivamsh 9 points 58 views
0 votes
0 answers 31 views
0 votes
1 answer 44 views
Number of cycles of length 4 that are possible in the complete bipartite graph K(4,6) is
asked Sep 2, 2020 in Graph Theory Vishal_kumar98 37 points 44 views
0 votes
1 answer 97 views
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
asked Aug 25, 2020 in Compiler Design Raj Bopche 13 points 97 views
0 votes
1 answer 39 views
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
asked Aug 18, 2020 in Operating System Pathki Shivamsh 9 points 39 views
0 votes
1 answer 34 views
Are all serializable schedules recoverable, cascade-less, strict???
asked Aug 4, 2020 in Databases manas_kulkarni 1 point 34 views
0 votes
0 answers 45 views
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 ??
asked Jul 31, 2020 in Theory of Computation Aman kumar jha 5 points 45 views
0 votes
1 answer 29 views
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
asked Jul 24, 2020 in Operating System Rahul8697 5 points 29 views
0 votes
0 answers 54 views
https://csedoubts.gateoverflow.in/?qa=blob&qa_blobid=2099352907172066319
asked Apr 25, 2020 in Databases Jahanvi Pritam 5 points 54 views
1 vote
1 answer 66 views
0 votes
0 answers 30 views
0 votes
1 answer 39 views
the answer is given as option d.But iam not satisfied with their explanation.. can anyone explain..
asked Feb 22, 2020 in Algorithms chirudeepnamini 13 points 39 views
0 votes
1 answer 66 views
Which one should be correct here B or C?
asked Feb 2, 2020 in Algorithms srestha 1k points 66 views
0 votes
0 answers 47 views
Why here XNOR is using instead of XOR?? I havenot got their explanation too.Plz someone elaborate
asked Feb 1, 2020 in Digital Logic srestha 1k points 47 views
0 votes
0 answers 139 views
For boolean algebra, lattice need to be complemented and distributive. What is complement (1,2), isnot (1,3) and (1,4) both?
asked Feb 1, 2020 in Set Theory & Algebra srestha 1k points 139 views
1 vote
1 answer 52 views
Should * be right associative here?plz check
asked Feb 1, 2020 in Databases srestha 1k points 52 views
0 votes
1 answer 67 views
How D could be correct ans here, Plz verify
asked Feb 1, 2020 in Databases srestha 1k points 67 views
0 votes
0 answers 36 views
0 votes
0 answers 42 views
0 votes
0 answers 43 views
0 votes
1 answer 79 views
0 votes
0 answers 41 views
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…..
asked Jan 26, 2020 in Theory of Computation srestha 1k points 41 views
0 votes
1 answer 89 views
Please explain the solution along with the concept.
asked Jan 25, 2020 in Programming Rudr Pawan 1.1k points 89 views
0 votes
1 answer 38 views
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?
asked Jan 24, 2020 in Algorithms srestha 1k points 38 views
0 votes
1 answer 31 views
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?
asked Jan 24, 2020 in Computer Networks srestha 1k points 31 views
0 votes
0 answers 38 views
0 votes
1 answer 52 views
0 votes
0 answers 84 views
0 votes
1 answer 90 views
0 votes
0 answers 36 views
0 votes
0 answers 16 views
0 votes
1 answer 28 views
0 votes
0 answers 63 views
0 votes
0 answers 27 views
0 votes
0 answers 32 views
...