Register
Filter

Recent questions without answers

327
views
0 answers
0 votes
#Made _easy_TEst
i have done it like this... p = 1-( (2C2 * 8C2) / 10C4) is this wrong ???
User Avatar
173
views
0 answers
0 votes
#Made _easy_
User Avatar
480
views
0 answers
0 votes
distributive property
If suppose we take 3 vertices of a graph to check if it satisfies distributive property atleast one vertice of that graph has unique compliment then it will ... property is this assumption correct ? if not can i have an counter example
User Avatar
542
views
0 answers
0 votes
transaction
Consider the following schedule for transaction T1 , T2 and T3.R1(X),R2(Y),R3(Y),W1(X),W3(X),R2(Z),W1(X)Also assume that the time-stamp for ... write.D The schedule is allowed under both basic time-stamp protocol as well as Thomas write.
User Avatar
149
views
0 answers
0 votes
doubt in homogeneous equation
a(r) = a(r-1) + 3 it is non homogeneous linear reccurence relation right because of 3 if we remove 3 then it become homogeneous
User Avatar
125
views
0 answers
0 votes
find cycle
To find cycle in an undirected graph which is more efficient union find or BFS ? and why
User Avatar
163
views
0 answers
0 votes
keneth rosen
A chain letter starts when a person sends a letter to five others.Each person who receives the letter either sends it to five other people who have never received ... .How many people receive the letter, and how many do not send it out?
User Avatar
235
views
0 answers
0 votes
kenneth rosen
complete m arry tree is full m arry tree and vice versais it true?
User Avatar
206
views
0 answers
0 votes
doubt reccurrence relation (linear , homogeneous) , generating functions
from where to learn these concepts any channel on youtube and which one to learn first generating function or reccurrence ??
User Avatar
422
views
0 answers
0 votes
kenneth rosen
Find the crossing numbers of each of these nonplanar graphs. a) K5 b) K6 c) K7 d) K3,4 e) K4,4 f) K5,5 is there any short approach present
User Avatar
256
views
0 answers
0 votes
Database doubt
Create table Student(Rno numeric, Name varchar(20),Marks numeric, Course varchar(30));In order to ensure that the value of Marks should not exceed 100, which of the ... type system. Alter(Marks>=100) Alter(Marks<100)why not the option A???
User Avatar
196
views
0 answers
0 votes
antisymmetric or not
R = { (1,2 ) } is antisymmetric right
User Avatar
250
views
0 answers
0 votes
Please Solve this Q
User Avatar
267
views
0 answers
0 votes
Relational Algebra
User Avatar
2.6k
views
0 answers
1 votes
#candidate keys
Given a relation R{A, B, C, D, E, H} and having the following functional dependencies :{A → BC, CD → E, E → C, D → AEH, ABH → BD, DH → BC}The number of candidate keys for relation R is ________.
User Avatar
1.3k
views
0 answers
0 votes
[DBMS] Decompose into BCNF and 4NF
Minimum relations to decompose into BCNF and 4NF.List only relation names with attributes and total number of relations
User Avatar
670
views
0 answers
0 votes
TOC CFL Closure property doubt
Is it viable possibility that L and L complement can both be CFL but not Regular?
User Avatar
223
views
0 answers
0 votes
doubt in making cases in permutations check this
how to make cases in permutation in non increasing order, so that all cases will be covered example 4 , 1 ,1 ,1 ,1 ,1 ,1 ,13 ,2 , 1 ,1 ,1 ,1 ,1 ,12 , 2 ,2 ,1 ,1 ,1 ,1 ,1 if i have 7 , 1 , 1 ( how to make cases for this )
User Avatar
225
views
0 answers
0 votes
Output in C
What is the output of following program?main ( ){union a { int i; char ch[z]; }union a,u;u∙i=256 printf (%d%d%d,u∙i,u∙ch[0],u∙ch[1] ); } 255 1 0 256 0 ... 256 1 0 255 0 1How are they deciding u.ch[0] = 0 or u.ch[1] =1 ????
User Avatar
320
views
0 answers
1 votes
GATE question doubt
What does the following algorithm approximate? (Assume m>1,ϵ>0m>1,ϵ>0).x = m; y = 1; While (x-y > ϵ) { x = (x+y)/2; y = m/x; } print(x);logmm2m1/2m1/3Can i get a reason of why it cannot be log m ?when finding by substituting values
User Avatar
317
views
0 answers
0 votes
C programming
main { int i; printf ( Hellow \n ); For(i=1; j<=10; i++) main ( );}What is the o/p of the following program?Hellow 10 time Endless execution ... be option 2. but given key is 2 only .Are they ignoring 'j' or is it typing mistake?
User Avatar
203
views
0 answers
0 votes
Write through mechanism doubt
When the write through mechanism is implemented with simultaneous access,why write hit =1 andTavg (write) = word updating time i.e max(Tc, Tm)?? I am getting confused.. Any help would be appreciated
User Avatar
235
views
0 answers
0 votes
GATE 2004 modified
Consider three IP networks A,BA,B and CC. Host HAHA in network AA sends messages each containing 180 bytes of application data to a host HCHC in network CC. The TCP layer ... but from A to B it is 512kbps and from B to C it is 1Mbps ?
User Avatar
1.1k
views
0 answers
0 votes
Beladys anamoly
"if an algorithm has stack property then it never falls into Beladys Anomaly"Is their any simple proof to this? Also I wanna know if it's one way or two way implication. Thanks.
User Avatar
369
views
0 answers
0 votes
How digital certificate works ?
User Avatar
435
views
0 answers
0 votes
DBMS sql query on null
Student tableROLLNONAMEMARKS1MARKS21T50302S70993DNULL10NULLNULL78NULLNULLNULLNULLNULLa) select count(MARKS1) from student;b) select count(*) from student;
User Avatar
735
views
0 answers
0 votes
gateforum test series
I'm getting 3 but the answer given is 4.
User Avatar
154
views
0 answers
0 votes
#transportlayer
Consider a TCP connection where the last acknowledgement sent by the TCP receiver has the following fields: ACK=21000, WIN=4000, Which of the following ... number=21500a) Sender can transmit a 3000 byte segment with sequence number=23000
User Avatar
561
views
0 answers
0 votes
Normalisation
True or False:A relation is not in 2NF if Candidate keys are determining non prime attributes.
User Avatar
Page: