Register
Filter

Answers by rishu_darkshadow

0 votes
121
decompose to 3nf
4 votes
122
3NF is inadequate in situations where the relation:
3NF is inadequate in situations where the relation: A. has multiple candidates key B. has candidate key that are composite C. has overlapped candidate keys D. all the above
3NF is inadequate in situations where the relation:A. has multiple candidates keyB. has candidate key that are compositeC. has overlapped candidate keysD. all the above
0 votes
123
GATE CSE 1998 | Question: 1.34
Which normal form is considered adequate for normal relational database design? $2NF$ $5NF$ $4NF$ $3NF$
Which normal form is considered adequate for normal relational database design?$2NF$$5NF$$4NF$$3NF$
0 votes
125
Number of invalid functional dependency
Given the following functional dependencies $\left\{X \rightarrow W, X \rightarrow Y, Y \rightarrow Z, Z \rightarrow PQ\right\}$ Consider the $FD$ set implied using above $FD$ set. Implied $FD$ ... $FD$ set are invalid are ______________.
Given the following functional dependencies$\left\{X \rightarrow W, X \rightarrow Y, Y \rightarrow Z, Z \rightarrow PQ\right\}$Consider the $FD$ set implied using above $...
0 votes
126
bcnf
0 votes
130
Tree traversals
If the inorder traversal and preorder traversal of a binary tree having N elements are given, then what will be the time complexity of post order traversal and level order traversal of such a tree. Plz explain also ?
If the inorder traversal and preorder traversal of a binary tree having N elements are given, then what will be the time complexity of post order traversal and level orde...
0 votes
131
UGC NET CSE | June 2016 | Part 2 | Question: 21
Consider the following binary search tree: If we remove the root node which of the node from the left subtree will be the new root? 11 12 13 16
Consider the following binary search tree:If we remove the root node which of the node from the left subtree will be the new root?11121316
1 votes
133
Binary tree Made-easy-test-series
The minimum size that an array may require to store a binary tree with n nodes $2^{\left \lceil(log_2(n+1)) \right \rceil -1}$ $2n-1$ $2n-n+1$ $n+1$
The minimum size that an array may require to store a binary tree with n nodes$2^{\left \lceil(log_2(n+1)) \right \rceil -1}$$2n-1$$2n-n+1$$n+1$
1 votes
134
the height of a binary tree
The height of a binary tree having 'i' nodes at level 'i' considering root to be at level 1 is ------. where 'n' is the total no of nodes in the tree. A. O(logn) B. O(n) C. O(ROOT(N)) D. O(N2)
The height of a binary tree having 'i' nodes at level 'i' considering root to be at level 1 is . where 'n' is the total no of nodes in the tree.A. O(logn)B. O(n)C. O(R...
2 votes
140
ISRO2017-29
The default subnet mask for a class B network can be $255.255.255.0$ $255.0.0.0$ $255.255.192.0$ $255.255.0.0$
The default subnet mask for a class B network can be$255.255.255.0$$255.0.0.0$$255.255.192.0$$255.255.0.0$
9 votes
141
ISRO2017-42
Which of the following operator(s) cannot be overloaded? .(member Access or Dot operator) ?: (ternary or Conditional Operator) :: ( Scope Resolution Operator) All of the above
Which of the following operator(s) cannot be overloaded?.(member Access or Dot operator)?: (ternary or Conditional Operator):: ( Scope Resolution Operator)All of the abov...
2 votes
142
ISRO2017-58
Which of the following is not a life cycle model? Spiral model Prototyping model Waterfall model Capability maturity model
Which of the following is not a life cycle model?Spiral modelPrototyping modelWaterfall modelCapability maturity model
5 votes
143
ISRO2017-76
Which of the following algorithms solves the all pair shortest path problem? Prim's algorithm Dijkstra's algorithm Bellman ford algorithm Floyd warshalls algorithm
Which of the following algorithms solves the all pair shortest path problem?Prim's algorithmDijkstra's algorithmBellman ford algorithmFloyd warshalls algorithm
0 votes
144
ISRO2017-17
Which of the following data structure is useful in traversing a given graph by breadth first search? Stack Queue List None of the above
Which of the following data structure is useful in traversing a given graph by breadth first search?StackQueueListNone of the above
0 votes
145
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
0 votes
146
UGC NET CSE | December 2010 | Part 2 | Question: 45
The Warnier diagram enables analyst To represent information hierarchy in a compact manner To further identify requirement To estimate the total cost involved None of the above
The Warnier diagram enables analystTo represent information hierarchy in a compact mannerTo further identify requirementTo estimate the total cost involvedNone of the abo...
1 votes
147
UGC NET CSE | December 2010 | Part 2 | Question: 4
The minimum number of edges in a connected graph with $‘n’$ vertices is equal to $n (n – 1)$ $\frac{n(n-1)}{2}$ $n^{2}$ $n – 1$
The minimum number of edges in a connected graph with $‘n’$ vertices is equal to$n (n – 1)$ $\frac{n(n-1)}{2}$$n^{2}$$n – 1$
0 votes
148
UGC NET CSE | December 2010 | Part 2 | Question: 36
The dynamic allocation of storage areas with VSAM files is accomplished by Hashing Control splits Overflow areas Relative recoding
The dynamic allocation of storage areas with VSAM files is accomplished byHashingControl splitsOverflow areasRelative recoding
1 votes
149
UGC NET CSE | December 2010 | Part 2 | Question: 8
An Astable multivibrator has : One stable state Two stable states No stable states None of these
An Astable multivibrator has :One stable stateTwo stable statesNo stable statesNone of these
Page: