Register
Filter

Answers by shivanisrivarshini

1 votes
2
UGC NET CSE | November 2017 | Part 2 | Question: 27
_________ do not take their decisions on measurements or estimates of the current traffic and topology. Static algorithms Adaptive algorithms Non-Adaptive algorithms Recursive algorithms.
_________ do not take their decisions on measurements or estimates of the current traffic and topology.Static algorithmsAdaptive algorithmsNon-Adaptive algorithmsRecursiv...
5 votes
3
Peter Linz Exercise 2.1 question 21
L = $\left \{a^{*}b \right \}$ what is $L^{2} - L $
L = $\left \{a^{*}b \right \}$what is $L^{2} - L $
7 votes
4
Heaps
How many Binary Max-Heaps can be constructed from the elements {1,1,2,2,3,3,4,4} ?
How many Binary Max-Heaps can be constructed from the elements {1,1,2,2,3,3,4,4} ?
2 votes
6
ISRO 2008- ECE SR flipflop to D flip flop
A $S$-$R$ flip flop with a clock input can be converted to a $’D’$ flip flop using : Two inverters the flip flop outputs ($Q$&$\bar{Q}$) connected to its inputs ($S$&$R$) One inverter Not possible
A $S$-$R$ flip flop with a clock input can be converted to a $’D’$ flip flop using :Two invertersthe flip flop outputs ($Q$&$\bar{Q}$) connected to its inputs ($S$&$R...
1 votes
7
ISRO 2007-ECE Boolean Dual
For the identity $AB + A' C + BC = AB + A' C$, the dual form is $(A+B) (A'+C)(B+C)= (A+B)(A'+C)$ $(A'+ B') ( A' + C') (B'+C')= (A'+ B') (A +C')$ $(A+B) (A'+C) (B+C) = (A'+ B') (A+ C')$ $A'B'+AC'+ B'C'= A'B'+AC'$
For the identity $AB + A' C + BC = AB + A' C$, the dual form is$(A+B) (A'+C)(B+C)= (A+B)(A'+C)$$(A'+ B') ( A' + C') (B'+C')= (A'+ B') (A +C')$$(A+B) (A'+C) (B+C) = (A'+ B...
1 votes
8
ISRO 2006- ECE Boolean algebra
For the switch circuit, taking open as 0 and closed as 1, the expression for the circuit is $\text{Y}$. $A+ (B+C) D$ $A+ BC +D$ $A (BC+D)$ None of these
For the switch circuit, taking open as 0 and closed as 1, the expression for the circuit is $\text{Y}$.$A+ (B+C) D$$A+ BC +D$$A (BC+D)$None of these
3 votes
10
c programming
What will be the output? printf("%d",printf("tim"));
What will be the output?printf("%d",printf("tim"));
1 votes
11
UGC NET CSE | December 2013 | Part 3 | Question: 33
The message 11001001 is to be transmitted using the CRC polynomial $x^3 + 1 $ to protect it from errors. The message that should be transmitted is 110010011001 11001001 110010011001001 11001001011
The message 11001001 is to be transmitted using the CRC polynomial $x^3 + 1 $ to protect it from errors. The message that should be transmitted is110010011001110010011100...
3 votes
12
UGC NET CSE | June 2014 | Part 2 | Question: 32
Match the following $:$ ... $\text{a-iii; b-i; c-iv; d-i}$ $\text{a-ii; b-iii; c-iv; d-i}$
Match the following $:$$\begin{array}{clcl} & \textbf{List – I} && \textbf{List – II} \\ \text{a}. & \text{Multilevel feedback queue} & \text{i.} & \text{Time-slicin...
5 votes
13
UGC NET CSE | June 2007 | Part 2 | Question: 14
What is the output of the following $\text{’C’}$ program? main() { printf(“%x”,-1>>4); } $\text{ffff}$ $\text{0fff}$ $\text{0000}$ $\text{fff0}$
What is the output of the following $\text{’C’}$ program?main() { printf(“%x”,-1>>4); }$\text{ffff}$$\text{0fff}$$\text{0000}$$\text{fff0}$
0 votes
14
IDENTIFYING RELATIONSHIP IN STRONG :WEAK ENTITY
Cardinality ratio ' string entity set : weak entity set' in their binary identifying relatoinship is one-to-one one-to-many many-to-one many-to-many
Cardinality ratio ' string entity set : weak entity set' in their binary identifying relatoinship isone-to-oneone-to-manymany-to-onemany-to-many
4 votes
15
Discrete Mathematics logics
If p->q is true, then the truth value of which of the following can be determined? a)p b)q c)p^q d)p or-q
If p->q is true, then the truth value of which of the following can be determined?a)pb)qc)p^qd)p or-q
4 votes
16
How to Trace the recursion ?
Can Someone explain either Tree or Stack method to trace out this recursion ? What is the output of this Program ?
Can Someone explain either Tree or Stack method to trace out this recursion ?What is the output of this Program ?
5 votes
17
Compiler Design
Consider the following grammar , and test whether the grammar is LL(1) or not. S → 1AB | ∈ A → 1AC | 0C B → OS C → 1
Consider the following grammar , and test whether the grammar is LL(1) or not.S → 1AB | ∈A → 1AC | 0CB → OSC → 1
0 votes
18
Gate Compiler Design
Consider the following grammar E → E+T/T T → T*F/F F → id/(E) Calculate Lead and Last for every Non terminal.
Consider the following grammarE → E+T/TT → T*F/FF → id/(E)Calculate Lead and Last for every Non terminal.
0 votes
20
Dbms Normalization
0 votes
22
NFA to DFA
NFA can be converted into DFA using Sub set construction method Lazy evaluation method either A or B both A and B
NFA can be converted into DFA usingSub set construction methodLazy evaluation methodeither A or Bboth A and B
1 votes
24
RS Flip Flop
In an RS flip-flop, if the S line (Set line) is set high (1) and the R line (Reset line) is set low (0), then the state of the flip-flop is Set to 1 Set to 0 No change in state Forbidden
In an RS flip-flop, if the S line (Set line) is set high (1) and the R line (Reset line) is set low (0), then the state of the flip-flop isSet to 1Set to 0No change in st...
8 votes
25
ISRO2011-15
What is the equivalent serial schedule for the following transactions? $\text{T}_1 - \text{T}_2 - \text{T}_3$ $\text{T}_3 - \text{T}_1 - \text{T}_2$ $\text{T}_2 - \text{T}_1 - \text{T}_3$ $\text{T}_1 - \text{T}_3 - \text{T}_2$
What is the equivalent serial schedule for the following transactions? $\text{T}_1 - \text{T}_2 - \text{T}_3$$\text{T}_3 - \text{T}_1 - \text{T}_2$$\text{T}_2 - \text{T}_...
3 votes
26
B+ tree
Consider a B+ tree with order 15, what is the max no of records that can be indexed with 3 levels ?
Consider a B+ tree with order 15, what is the max no of records that can be indexed with 3 levels ?
1 votes
27
simplify Boolean expression to one literals mano 2.4 c ans is :B
A'B(D' + C'D) + B(A + A'CD)
A'B(D' + C'D) + B(A + A'CD)
5 votes
28
super key / candidate key
R (A, B, C ,D ,E ) F={ A->B, BC-> D, D->BC, B->E, B->A } Check whether BD is C.Key or S.key . Also find the candidate key.
R (A, B, C ,D ,E )F={ A->B, BC- D, D->BC, B->E, B->A }Check whether BD is C.Key or S.key . Also find the candidate key.
1 votes
29
Isro 2011 65
In given graph, i found only a and c as decision points ( 2 outgoing edges) . Hence cyclomatic complexity is 3. Am i correct?
In given graph, i found only a and c as decision points ( 2 outgoing edges) . Hence cyclomatic complexity is 3. Am i correct?
3 votes
30
super key
R ( A, B, C, D) A & B are the candidate keys . what are the possible Super keys and there no ..??
R ( A, B, C, D)A & B are the candidate keys .what are the possible Super keys and there no ..??
Page: