Register
Filter

Recent activity by Sanket_

2 answers
1
ISRO2017-16
Given two statements Insertion of an element should be done at the last node of the circular list Deletion of an element should be done at the last node of the circular list Both are true Both are false First is false and second is true None of the above
Given two statementsInsertion of an element should be done at the last node of the circular listDeletion of an element should be done at the last node of the circular lis...
4 answers
2
ISRO2017-53
In a doubly linked list the number of pointers affected for an insertion operation will be 4 0 1 Depends on the nodes of doubly linked list
In a doubly linked list the number of pointers affected for an insertion operation will be401Depends on the nodes of doubly linked list
2 answers
4
E R model
why not b) option
why not b) option
3 answers
5
Doubt about joins on keys
Consider the following relation: R (A B C) A primary key with 100 tuples. S (E F G) E primary key with 50 tuples. T (AE D) AE primary key with 80 tuples. U (D G H) H primary key with 10 tuples. The maximum number of possible records in the result of _______.
Consider the following relation:R (A B C) A primary key with 100 tuples.S (E F G) E primary key with 50 tuples.T (AE D) AE primary key with 80 tuples.U (D G H) H primary ...
0 answers
8
language of pda
i think it should be d) because it is not satisfying same no. of a's and b's constraint on some input like aa,bb.
i think it should be d) because it is not satisfying same no. of a's and b's constraint on some input like aa,bb.
0 answers
9
sql Query
i am not getting Q3.
i am not getting Q3.
1 answer
10
mux and flipflop
0 answers
11
no. of relations
0 answers
12
OS-bounded waiting
does B satisfy BW?
does B satisfy BW?
0 answers
13
euler and ham cycle
Which of the following statements is true? Every complete graph contain Hamiltonian cycle Every complete graph contain Euler cycle Both (a) and (b) None of the above It should be none of the above because when no. of vertices are 2 it doesnt follow these conditions
Which of the following statements is true?Every complete graph contain Hamiltonian cycleEvery complete graph contain Euler cycleBoth (a) and (b)None of the aboveIt should...
1 answer
17
left outer join
Find the equivalent Tuple Relational Calculus query for the following: R ⟕ S , where R(A, B) and S(A, C) are the relations and ⟕ is the left outer join symbol in Relational Algebra.
Find the equivalent Tuple Relational Calculus query for the following:R ⟕ S , where R(A, B) and S(A, C) are the relations and ⟕ is the left outer join symbol in Relat...
1 answer
18
Testbook
0 answers
19
parse tree
Consider two binary operator ‘+’ and ‘–’ with the precendence of ‘+’ being lower than that of operator ‘–’.Operator ‘–’ is right associative while operator ‘+’ to left associative. What is the parse tree for expression (5 + 2 – 7 + 3 – 4)
Consider two binary operator ‘+’ and ‘–’ with the precendence of ‘+’ being lower than that of operator ‘–’.Operator ‘–’ is right associative whi...
0 answers
21
viable prefix
1 answer
22
Reader Writer
1 answer
23
Made easy test
1 answer
24
critical section
getting A) given D)
getting A) given D)
2 answers
25
FLIP FLOP
plz make the waveform diagram for Q
plz make the waveform diagram for Q
1 answer
26
Operand forwarding
given-13 my answer-12 plz verify. I0 IF ID OF PO WO I1 IF ID OF PO PO WO I2 IF ID OF PO WO I3 IF ID OF PO PO PO PO WO 1 2 3 4 5 6 7 8 9 10 11 12
given-13my answer-12plz verify.I0IFIDOFPOWO I1 IFIDOFPOPOWO I2 IFID OFPOWO I3 IFID OFPOPOPOPOWO 123456789101112
1 answer
28
connectivity
Consider a simple connected undirected graph G which has m vertices and n edges. Which of the following condition always guarantee that after removal of those number of edges graph will be disconnected? a)m – n + 2 b)$_{2}^{m}\textrm{C}-n+2$ c)n – 2 d)None of the above
Consider a simple connected undirected graph G which has m vertices and n edges. Which of the following condition always guarantee that after removal of those number of e...