Register
Filter

Answers by LeenSharma

1 votes
91
UGC NET CSE | December 2013 | Part 2 | Question: 24
For any B-tree of minimum degree t $\geq$ 2, every node other than the root must have at least ____ keys and every node can have at most ____ keys. t-1, 2t+1 t+1, 2t+1 t-1, 2t-1 t+1, 2t-1
For any B-tree of minimum degree t $\geq$ 2, every node other than the root must have at least ____ keys and every node can have at most ____ keys.t-1, 2t+1t+1, 2t+1t-1, ...
0 votes
92
UGC NET CSE | December 2013 | Part 2 | Question: 23
______ is often used to prove the correctness of a recursive function. Diagnolization Communitivity Mathematical Induction Matrix Manipulation
______ is often used to prove the correctness of a recursive function.DiagnolizationCommunitivityMathematical InductionMatrix Manipulation
1 votes
93
UGC NET CSE | December 2013 | Part 2 | Question: 21
What is the value of the postfix expression a b c d + - * (where a=8, b=4, c=2 and d=5) $-\frac{3}{8}$ $-\frac{8}{3}$ 24 -24
What is the value of the postfix expression a b c d + - * (where a=8, b=4, c=2 and d=5)$-\frac{3}{8}$$-\frac{8}{3}$24-24
0 votes
94
UGC NET CSE | December 2013 | Part 2 | Question: 19
_____ allows to create classes which are derived from other classes, so that they automatically include some of its "parent's" members, plus its own members. Overloading Inheritance Polymorphism Encapsulation
_____ allows to create classes which are derived from other classes, so that they automatically include some of its "parent's" members, plus its own members.OverloadingIn...
1 votes
98
UGC NET CSE | December 2013 | Part 2 | Question: 1
When data and acknowledgement are sent in same frame, this is called as Piggy packing Piggy backing Back packing Good packing
When data and acknowledgement are sent in same frame, this is called as Piggy packingPiggy backingBack packingGood packing
0 votes
100
UGC NET CSE | September 2013 | Part 3 | Question: 57
If user A wants to send an encrypted message to user B, the plain text of A is encrypted with the Public key of user A Public key of user B Private key of user A Private key of user B
If user A wants to send an encrypted message to user B, the plain text of A is encrypted with thePublic key of user APublic key of user BPrivate key of user APrivate key ...
2 votes
101
UGC NET CSE | September 2013 | Part 3 | Question: 58
A _____ can forward or block packets based on the information in the network layer and transport layer header Proxy firewall Firewall Packet filter firewall Message digest firewall
A _____ can forward or block packets based on the information in the network layer and transport layer headerProxy firewallFirewallPacket filter firewallMessage digest fi...
2 votes
103
UGC NET CSE | September 2013 | Part 3 | Question: 32
A given memory chip has 14 address and 8 data pins. It has the following number of locations. $2^8$ $2^{14}$ $2^6$ $2^{12}$
A given memory chip has 14 address and 8 data pins. It has the following number of locations.$2^8$$2^{14}$$2^6$$2^{12}$
4 votes
106
How Many States required to construct equivalent DFA
L={am^n | n>=1,m>n} How Many States required to construct equivalent DFA?
L={am^n | n>=1,m>n}How Many States required to construct equivalent DFA?
3 votes
108
DFA
0 votes
109
UGC NET CSE | September 2013 | Part 2 | Question: 43
Thoma’s-write rule is Two phase locking protocol Timestamp ordering protocol One phase locking protocol Sliding window protocol
Thoma’s-write rule isTwo phase locking protocolTimestamp ordering protocolOne phase locking protocolSliding window protocol
3 votes
113
UGC NET CSE | December 2014 | Part 2 | Question: 18
What kind of mechanism is to be taken into account for converting a weak entity set into strong entity set in entity-relationship diagram Generalization Aggregation Specialization Adding suitable attributes
What kind of mechanism is to be taken into account for converting a weak entity set into strong entity set in entity-relationship diagramGeneralization Aggregation Specia...
4 votes
115
UGC NET CSE | December 2014 | Part 2 | Question: 20
Identify the minimal key for relational scheme $R(A, B, C, D, E)$ with functional dependencies $F = \left\{A \rightarrow B, B \rightarrow C, AC \rightarrow D\right\}$ $A$ $AE$ $BE$ $CE$
Identify the minimal key for relational scheme $R(A, B, C, D, E)$ with functional dependencies $F = \left\{A \rightarrow B, B \rightarrow C, AC \rightarrow D\right\}$ $A$...
2 votes
116
UGC NET CSE | September 2013 | Part 2 | Question: 23
Which one of the following set of gates is best suited for ‘parity’ checking and ‘parity’ generation? AND, OR, NOT NAND, NOR EX-OR, EX-NOR None of the above
Which one of the following set of gates is best suited for ‘parity’ checking and ‘parity’ generation?AND, OR, NOTNAND, NOREX-OR, EX-NORNone of the...
4 votes
117
UGC NET CSE | September 2013 | Part 2 | Question: 22
A simple graph G with n vertices is connected if the graph has (n-1)(n-2)/2 edges more than (n-1) (n-2)/2 edges less than (n-1) (n-2)/2 edges $\Sigma_{i=1}^k C(n_i, 2)$ edges
A simple graph G with n vertices is connected if the graph has(n-1)(n-2)/2 edgesmore than (n-1) (n-2)/2 edgesless than (n-1) (n-2)/2 edges$\Sigma_{i=1}^k C(n_i, 2)$ edges...
3 votes
118
UGC NET CSE | September 2013 | Part 2 | Question: 14
Regular expression for the language $L=w \in \{0,1\}* \mid w$ has no pair of consecutive zeros $\}$ is $(1+010)*$ $(01+10)*$ $(1+010)*(0+ \lambda)$ $(1+01)* (0+\lambda)$
Regular expression for the language $L=w \in \{0,1\}* \mid w$ has no pair of consecutive zeros $\}$ is$(1+010)*$$(01+10)*$$(1+010)*(0+ \lambda)$$(1+01)* (0+\lambda)$
4 votes
119
UGC NET CSE | September 2013 | Part 2 | Question: 8
Consider an undirected graph G with 100 nodes. The maximum number of edges to be included in G so that the graph is not connected is 2451 4950 4851 9900
Consider an undirected graph G with 100 nodes. The maximum number of edges to be included in G so that the graph is not connected is2451495048519900
2 votes
120
UGC NET CSE | September 2013 | Part 2 | Question: 6
The count-to-infinity problem is associated with Flooding algorithm Hierarchical routing algorithm Distance vector routing algorithm Link state routing algorithm
The count-to-infinity problem is associated withFlooding algorithmHierarchical routing algorithmDistance vector routing algorithmLink state routing algorithm
Page: