Question
stringlengths 39
1.33k
| Tag
stringlengths 3
46
| label
int64 0
206
|
|---|---|---|
An unrestricted use of the goto statement is harmful because it makes it more difficult to verify programs it increases the running time of the programs it increases the memory required for the programs it results in the compiler generating longer machine code | Goto | 70 |
An unrestricted use of the goto statement is harmful because it makes it more difficult to verify programs it increases the running time of the programs it increases the memory required for the programs it results in the compiler generating longer machine code | Goto | 70 |
An unrestricted use of the goto statement is harmful because it makes it more difficult to verify programs it increases the running time of the programs it increases the memory required for the programs it results in the compiler generating longer machine code | Goto | 70 |
An unrestricted use of the goto statement is harmful because it makes it more difficult to verify programs it increases the running time of the programs it increases the memory required for the programs it results in the compiler generating longer machine code | Goto | 70 |
A vertex colouring of a graph G V E with k coulours is a mapping c V rightarrow 1 dots k such that c u eq c v for every u v in E Consider the following statements If every vertex in G has degree at most d then G admits a vertex coulouring using d 1 colours Every cycle admits a vertex colouring using 2 colours Every tree admits a vertex colouring using 2 colours Which of the above statements is are TRUE Choose from the following options only i only i and ii only i and iii only ii and iii i ii and iii | Graph Coloring | 71 |
What is the chromatic number of an n vertex simple connected graph which does not contain any odd length cycle Assume n gt 2 2 3 n 1 n | Graph Coloring | 71 |
The minimum number of colours required to colour the following graph such that no two adjacent vertices are assigned the same color is 2 3 4 5 | Graph Coloring | 71 |
What is the chromatic number of an n vertex simple connected graph which does not contain any odd length cycle Assume n gt 2 2 3 n 1 n | Graph Coloring | 71 |
The minimum number of colours required to colour the following graph such that no two adjacent vertices are assigned the same color is 2 3 4 5 | Graph Coloring | 71 |
A cycle on n vertices is isomorphic to its complement The value of n is _____ | Graph Isomorphism | 73 |
A cycle on n vertices is isomorphic to its complement The value of n is _____ | Graph Isomorphism | 73 |
Which of the following graphs is isomorphic to | Graph Isomorphism | 73 |
Which of the following graphs is isomorphic to | Graph Isomorphism | 73 |
A cycle on n vertices is isomorphic to its complement The value of n is _____ | Graph Isomorphism | 73 |
A cycle on n vertices is isomorphic to its complement The value of n is _____ | Graph Isomorphism | 73 |
A cycle on n vertices is isomorphic to its complement The value of n is _____ | Graph Isomorphism | 73 |
A cycle on n vertices is isomorphic to its complement The value of n is _____ | Graph Isomorphism | 73 |
A cycle on n vertices is isomorphic to its complement The value of n is _____ | Graph Isomorphism | 73 |
Which of the following graphs is isomorphic to | Graph Isomorphism | 73 |
Which of the following graphs is isomorphic to | Graph Isomorphism | 73 |
Which of the following graphs is isomorphic to | Graph Isomorphism | 73 |
A cycle on n vertices is isomorphic to its complement The value of n is _____ | Graph Isomorphism | 73 |
How many perfect matching are there in a complete graph of 6 vertices 15 24 30 60 | Graph Matching | 74 |
How many perfect matching are there in a complete graph of 6 vertices 15 24 30 60 | Graph Matching | 74 |
How many perfect matching are there in a complete graph of 6 vertices 15 24 30 60 | Graph Matching | 74 |
How many perfect matching are there in a complete graph of 6 vertices 15 24 30 60 | Graph Matching | 74 |
How many perfect matching are there in a complete graph of 6 vertices 15 24 30 60 | Graph Matching | 74 |
How many perfect matching are there in a complete graph of 6 vertices 15 24 30 60 | Graph Matching | 74 |
How many perfect matching are there in a complete graph of 6 vertices 15 24 30 60 | Graph Matching | 74 |
How many perfect matching are there in a complete graph of 6 vertices 15 24 30 60 | Graph Matching | 74 |
How many perfect matching are there in a complete graph of 6 vertices 15 24 30 60 | Graph Matching | 74 |
How many perfect matching are there in a complete graph of 6 vertices 15 24 30 60 | Graph Matching | 74 |
How many perfect matching are there in a complete graph of 6 vertices 15 24 30 60 | Graph Matching | 74 |
How many perfect matching are there in a complete graph of 6 vertices 15 24 30 60 | Graph Matching | 74 |
How many perfect matching are there in a complete graph of 6 vertices 15 24 30 60 | Graph Matching | 74 |
How many perfect matching are there in a complete graph of 6 vertices 15 24 30 60 | Graph Matching | 74 |
Choose the correct alternatives More than one may be correct A graph is planar if and only if It does not contain subgraphs homeomorphic to k_ 5 and k_ 3 3 It does not contain subgraphs isomorphic to k_ 5 or k_ 3 3 It does not contain a subgraph isomorphic to k_ 5 or k_ 3 3 It does not contain a subgraph homeomorphic to k_ 5 or k_ 3 3 | Graph Planarity | 75 |
Answer the following Which of the following graphs is are planner see Fig 2 | Graph Planarity | 75 |
Choose the correct alternatives More than one may be correct A graph is planar if and only if It does not contain subgraphs homeomorphic to k_ 5 and k_ 3 3 It does not contain subgraphs isomorphic to k_ 5 or k_ 3 3 It does not contain a subgraph isomorphic to k_ 5 or k_ 3 3 It does not contain a subgraph homeomorphic to k_ 5 or k_ 3 3 | Graph Planarity | 75 |
Choose the correct alternatives More than one may be correct A graph is planar if and only if It does not contain subgraphs homeomorphic to k_ 5 and k_ 3 3 It does not contain subgraphs isomorphic to k_ 5 or k_ 3 3 It does not contain a subgraph isomorphic to k_ 5 or k_ 3 3 It does not contain a subgraph homeomorphic to k_ 5 or k_ 3 3 | Graph Planarity | 75 |
Answer the following Which of the following graphs is are planner see Fig 2 | Graph Planarity | 75 |
Answer the following Which of the following graphs is are planner see Fig 2 | Graph Planarity | 75 |
Answer the following Which of the following graphs is are planner see Fig 2 | Graph Planarity | 75 |
Choose the correct alternatives More than one may be correct A graph is planar if and only if It does not contain subgraphs homeomorphic to k_ 5 and k_ 3 3 It does not contain subgraphs isomorphic to k_ 5 or k_ 3 3 It does not contain a subgraph isomorphic to k_ 5 or k_ 3 3 It does not contain a subgraph homeomorphic to k_ 5 or k_ 3 3 | Graph Planarity | 75 |
Choose the correct alternatives More than one may be correct A graph is planar if and only if It does not contain subgraphs homeomorphic to k_ 5 and k_ 3 3 It does not contain subgraphs isomorphic to k_ 5 or k_ 3 3 It does not contain a subgraph isomorphic to k_ 5 or k_ 3 3 It does not contain a subgraph homeomorphic to k_ 5 or k_ 3 3 | Graph Planarity | 75 |
Choose the correct alternatives More than one may be correct A graph is planar if and only if It does not contain subgraphs homeomorphic to k_ 5 and k_ 3 3 It does not contain subgraphs isomorphic to k_ 5 or k_ 3 3 It does not contain a subgraph isomorphic to k_ 5 or k_ 3 3 It does not contain a subgraph homeomorphic to k_ 5 or k_ 3 3 | Graph Planarity | 75 |
Choose the correct alternatives More than one may be correct A graph is planar if and only if It does not contain subgraphs homeomorphic to k_ 5 and k_ 3 3 It does not contain subgraphs isomorphic to k_ 5 or k_ 3 3 It does not contain a subgraph isomorphic to k_ 5 or k_ 3 3 It does not contain a subgraph homeomorphic to k_ 5 or k_ 3 3 | Graph Planarity | 75 |
Answer the following Which of the following graphs is are planner see Fig 2 | Graph Planarity | 75 |
Choose the correct alternatives More than one may be correct A graph is planar if and only if It does not contain subgraphs homeomorphic to k_ 5 and k_ 3 3 It does not contain subgraphs isomorphic to k_ 5 or k_ 3 3 It does not contain a subgraph isomorphic to k_ 5 or k_ 3 3 It does not contain a subgraph homeomorphic to k_ 5 or k_ 3 3 | Graph Planarity | 75 |
Let G V E be a directed graph where V is the set of vertices and E the set of edges Then which one of the following graphs has the same strongly connected components as G G_1 V E_1 where E_1 left u v mid u v otin E right G_2 V E_2 where E_2 left u v mid v u in E right G_3 V E_3 where E_3 u v mid there is a path of length leq2 from u to v in E G_4 V_4 E where V_4 is the set of vertices in G which are not isolated | Graphs | 76 |
G is a graph on n vertices and 2n 2 edges The edges of G can be partitioned into two edge disjoint spanning trees Which of the following is NOT true for G For every subset of k vertices the induced subgraph has at most 2k 2 edges The minimum cut in G has at least 2 edges There are at least 2 edge disjoint paths between every pair of vertices There are at least 2 vertex disjoint paths between every pair of vertices | Graphs | 76 |
What is the size of the smallest MIS Maximal Independent Set of a chain of nine nodes 5 4 3 2 | Graphs | 76 |
G is a graph on n vertices and 2n 2 edges The edges of G can be partitioned into two edge disjoint spanning trees Which of the following is NOT true for G For every subset of k vertices the induced subgraph has at most 2k 2 edges The minimum cut in G has at least 2 edges There are at least 2 edge disjoint paths between every pair of vertices There are at least 2 vertex disjoint paths between every pair of vertices | Graphs | 76 |
What is the size of the smallest MIS Maximal Independent Set of a chain of nine nodes 5 4 3 2 | Graphs | 76 |
What is the size of the smallest MIS Maximal Independent Set of a chain of nine nodes 5 4 3 2 | Graphs | 76 |
Let G be the graph with 100 vertices numbered 1 to 100 Two vertices i and j are adjacent if vert i j vert 8 or vert i j vert 12 The number of connected components in G is 8 4 12 25 | Graphs | 76 |
Let G V E be a directed graph where V is the set of vertices and E the set of edges Then which one of the following graphs has the same strongly connected components as G G_1 V E_1 where E_1 left u v mid u v otin E right G_2 V E_2 where E_2 left u v mid v u in E right G_3 V E_3 where E_3 u v mid there is a path of length leq2 from u to v in E G_4 V_4 E where V_4 is the set of vertices in G which are not isolated | Graphs | 76 |
Let G be the graph with 100 vertices numbered 1 to 100 Two vertices i and j are adjacent if vert i j vert 8 or vert i j vert 12 The number of connected components in G is 8 4 12 25 | Graphs | 76 |
Consider numbers represented in 4 bit Gray code Let h_ 3 h_ 2 h_ 1 h_ 0 be the Gray code representation of a number n and let g_ 3 g_ 2 g_ 1 g_ 0 be the Gray code of n 1 modulo 16 value of the number Which one of the following functions is correct g_ 0 h_ 3 h_ 2 h_ 1 h_ 0 sum 1 2 3 6 10 13 14 15 g_ 1 h_ 3 h_ 2 h_ 1 h_ 0 sum 4 9 10 11 12 13 14 15 g_ 2 h_ 3 h_ 2 h_ 1 h_ 0 sum 2 4 5 6 7 12 13 15 g_ 3 h_ 3 h_ 2 h_ 1 h_ 0 sum 0 1 6 7 10 11 12 13 | Gray Code | 77 |
Consider numbers represented in 4 bit Gray code Let h_ 3 h_ 2 h_ 1 h_ 0 be the Gray code representation of a number n and let g_ 3 g_ 2 g_ 1 g_ 0 be the Gray code of n 1 modulo 16 value of the number Which one of the following functions is correct g_ 0 h_ 3 h_ 2 h_ 1 h_ 0 sum 1 2 3 6 10 13 14 15 g_ 1 h_ 3 h_ 2 h_ 1 h_ 0 sum 4 9 10 11 12 13 14 15 g_ 2 h_ 3 h_ 2 h_ 1 h_ 0 sum 2 4 5 6 7 12 13 15 g_ 3 h_ 3 h_ 2 h_ 1 h_ 0 sum 0 1 6 7 10 11 12 13 | Gray Code | 77 |
Consider numbers represented in 4 bit Gray code Let h_ 3 h_ 2 h_ 1 h_ 0 be the Gray code representation of a number n and let g_ 3 g_ 2 g_ 1 g_ 0 be the Gray code of n 1 modulo 16 value of the number Which one of the following functions is correct g_ 0 h_ 3 h_ 2 h_ 1 h_ 0 sum 1 2 3 6 10 13 14 15 g_ 1 h_ 3 h_ 2 h_ 1 h_ 0 sum 4 9 10 11 12 13 14 15 g_ 2 h_ 3 h_ 2 h_ 1 h_ 0 sum 2 4 5 6 7 12 13 15 g_ 3 h_ 3 h_ 2 h_ 1 h_ 0 sum 0 1 6 7 10 11 12 13 | Gray Code | 77 |
Consider numbers represented in 4 bit Gray code Let h_ 3 h_ 2 h_ 1 h_ 0 be the Gray code representation of a number n and let g_ 3 g_ 2 g_ 1 g_ 0 be the Gray code of n 1 modulo 16 value of the number Which one of the following functions is correct g_ 0 h_ 3 h_ 2 h_ 1 h_ 0 sum 1 2 3 6 10 13 14 15 g_ 1 h_ 3 h_ 2 h_ 1 h_ 0 sum 4 9 10 11 12 13 14 15 g_ 2 h_ 3 h_ 2 h_ 1 h_ 0 sum 2 4 5 6 7 12 13 15 g_ 3 h_ 3 h_ 2 h_ 1 h_ 0 sum 0 1 6 7 10 11 12 13 | Gray Code | 77 |
Consider numbers represented in 4 bit Gray code Let h_ 3 h_ 2 h_ 1 h_ 0 be the Gray code representation of a number n and let g_ 3 g_ 2 g_ 1 g_ 0 be the Gray code of n 1 modulo 16 value of the number Which one of the following functions is correct g_ 0 h_ 3 h_ 2 h_ 1 h_ 0 sum 1 2 3 6 10 13 14 15 g_ 1 h_ 3 h_ 2 h_ 1 h_ 0 sum 4 9 10 11 12 13 14 15 g_ 2 h_ 3 h_ 2 h_ 1 h_ 0 sum 2 4 5 6 7 12 13 15 g_ 3 h_ 3 h_ 2 h_ 1 h_ 0 sum 0 1 6 7 10 11 12 13 | Gray Code | 77 |
Consider numbers represented in 4 bit Gray code Let h_ 3 h_ 2 h_ 1 h_ 0 be the Gray code representation of a number n and let g_ 3 g_ 2 g_ 1 g_ 0 be the Gray code of n 1 modulo 16 value of the number Which one of the following functions is correct g_ 0 h_ 3 h_ 2 h_ 1 h_ 0 sum 1 2 3 6 10 13 14 15 g_ 1 h_ 3 h_ 2 h_ 1 h_ 0 sum 4 9 10 11 12 13 14 15 g_ 2 h_ 3 h_ 2 h_ 1 h_ 0 sum 2 4 5 6 7 12 13 15 g_ 3 h_ 3 h_ 2 h_ 1 h_ 0 sum 0 1 6 7 10 11 12 13 | Gray Code | 77 |
Consider numbers represented in 4 bit Gray code Let h_ 3 h_ 2 h_ 1 h_ 0 be the Gray code representation of a number n and let g_ 3 g_ 2 g_ 1 g_ 0 be the Gray code of n 1 modulo 16 value of the number Which one of the following functions is correct g_ 0 h_ 3 h_ 2 h_ 1 h_ 0 sum 1 2 3 6 10 13 14 15 g_ 1 h_ 3 h_ 2 h_ 1 h_ 0 sum 4 9 10 11 12 13 14 15 g_ 2 h_ 3 h_ 2 h_ 1 h_ 0 sum 2 4 5 6 7 12 13 15 g_ 3 h_ 3 h_ 2 h_ 1 h_ 0 sum 0 1 6 7 10 11 12 13 | Gray Code | 77 |
Consider numbers represented in 4 bit Gray code Let h_ 3 h_ 2 h_ 1 h_ 0 be the Gray code representation of a number n and let g_ 3 g_ 2 g_ 1 g_ 0 be the Gray code of n 1 modulo 16 value of the number Which one of the following functions is correct g_ 0 h_ 3 h_ 2 h_ 1 h_ 0 sum 1 2 3 6 10 13 14 15 g_ 1 h_ 3 h_ 2 h_ 1 h_ 0 sum 4 9 10 11 12 13 14 15 g_ 2 h_ 3 h_ 2 h_ 1 h_ 0 sum 2 4 5 6 7 12 13 15 g_ 3 h_ 3 h_ 2 h_ 1 h_ 0 sum 0 1 6 7 10 11 12 13 | Gray Code | 77 |
Consider numbers represented in 4 bit Gray code Let h_ 3 h_ 2 h_ 1 h_ 0 be the Gray code representation of a number n and let g_ 3 g_ 2 g_ 1 g_ 0 be the Gray code of n 1 modulo 16 value of the number Which one of the following functions is correct g_ 0 h_ 3 h_ 2 h_ 1 h_ 0 sum 1 2 3 6 10 13 14 15 g_ 1 h_ 3 h_ 2 h_ 1 h_ 0 sum 4 9 10 11 12 13 14 15 g_ 2 h_ 3 h_ 2 h_ 1 h_ 0 sum 2 4 5 6 7 12 13 15 g_ 3 h_ 3 h_ 2 h_ 1 h_ 0 sum 0 1 6 7 10 11 12 13 | Gray Code | 77 |
Consider numbers represented in 4 bit Gray code Let h_ 3 h_ 2 h_ 1 h_ 0 be the Gray code representation of a number n and let g_ 3 g_ 2 g_ 1 g_ 0 be the Gray code of n 1 modulo 16 value of the number Which one of the following functions is correct g_ 0 h_ 3 h_ 2 h_ 1 h_ 0 sum 1 2 3 6 10 13 14 15 g_ 1 h_ 3 h_ 2 h_ 1 h_ 0 sum 4 9 10 11 12 13 14 15 g_ 2 h_ 3 h_ 2 h_ 1 h_ 0 sum 2 4 5 6 7 12 13 15 g_ 3 h_ 3 h_ 2 h_ 1 h_ 0 sum 0 1 6 7 10 11 12 13 | Gray Code | 77 |
Consider numbers represented in 4 bit Gray code Let h_ 3 h_ 2 h_ 1 h_ 0 be the Gray code representation of a number n and let g_ 3 g_ 2 g_ 1 g_ 0 be the Gray code of n 1 modulo 16 value of the number Which one of the following functions is correct g_ 0 h_ 3 h_ 2 h_ 1 h_ 0 sum 1 2 3 6 10 13 14 15 g_ 1 h_ 3 h_ 2 h_ 1 h_ 0 sum 4 9 10 11 12 13 14 15 g_ 2 h_ 3 h_ 2 h_ 1 h_ 0 sum 2 4 5 6 7 12 13 15 g_ 3 h_ 3 h_ 2 h_ 1 h_ 0 sum 0 1 6 7 10 11 12 13 | Gray Code | 77 |
Consider numbers represented in 4 bit Gray code Let h_ 3 h_ 2 h_ 1 h_ 0 be the Gray code representation of a number n and let g_ 3 g_ 2 g_ 1 g_ 0 be the Gray code of n 1 modulo 16 value of the number Which one of the following functions is correct g_ 0 h_ 3 h_ 2 h_ 1 h_ 0 sum 1 2 3 6 10 13 14 15 g_ 1 h_ 3 h_ 2 h_ 1 h_ 0 sum 4 9 10 11 12 13 14 15 g_ 2 h_ 3 h_ 2 h_ 1 h_ 0 sum 2 4 5 6 7 12 13 15 g_ 3 h_ 3 h_ 2 h_ 1 h_ 0 sum 0 1 6 7 10 11 12 13 | Gray Code | 77 |
Consider numbers represented in 4 bit Gray code Let h_ 3 h_ 2 h_ 1 h_ 0 be the Gray code representation of a number n and let g_ 3 g_ 2 g_ 1 g_ 0 be the Gray code of n 1 modulo 16 value of the number Which one of the following functions is correct g_ 0 h_ 3 h_ 2 h_ 1 h_ 0 sum 1 2 3 6 10 13 14 15 g_ 1 h_ 3 h_ 2 h_ 1 h_ 0 sum 4 9 10 11 12 13 14 15 g_ 2 h_ 3 h_ 2 h_ 1 h_ 0 sum 2 4 5 6 7 12 13 15 g_ 3 h_ 3 h_ 2 h_ 1 h_ 0 sum 0 1 6 7 10 11 12 13 | Gray Code | 77 |
Consider numbers represented in 4 bit Gray code Let h_ 3 h_ 2 h_ 1 h_ 0 be the Gray code representation of a number n and let g_ 3 g_ 2 g_ 1 g_ 0 be the Gray code of n 1 modulo 16 value of the number Which one of the following functions is correct g_ 0 h_ 3 h_ 2 h_ 1 h_ 0 sum 1 2 3 6 10 13 14 15 g_ 1 h_ 3 h_ 2 h_ 1 h_ 0 sum 4 9 10 11 12 13 14 15 g_ 2 h_ 3 h_ 2 h_ 1 h_ 0 sum 2 4 5 6 7 12 13 15 g_ 3 h_ 3 h_ 2 h_ 1 h_ 0 sum 0 1 6 7 10 11 12 13 | Gray Code | 77 |
Consider the set H of all 3 3 matrices of the type left begin array ccc a amp f amp e 0 amp b amp d 0 amp 0 amp c end array right where a b c d e and f are real numbers and abc u2260 0 under the matrix multiplication operation the set H is a group a monoid but not a group a semi group but not a monoid neither a group nor a semi group | Groups | 78 |
A half adder is implemented with XOR and AND gates A full adder is implemented with two half adders and one OR gate The propagation delay of an XOR gate is twice that of an AND OR gate The propagation delay of an AND OR gate is 1 2 microseconds A 4 bit ripple carry binary adder is implemented by using four full adders The total propagation time of this 4 bit binary adder in microseconds is ______ | Half Adder | 79 |
A half adder is implemented with XOR and AND gates A full adder is implemented with two half adders and one OR gate The propagation delay of an XOR gate is twice that of an AND OR gate The propagation delay of an AND OR gate is 1 2 microseconds A 4 bit ripple carry binary adder is implemented by using four full adders The total propagation time of this 4 bit binary adder in microseconds is ______ | Half Adder | 79 |
A half adder is implemented with XOR and AND gates A full adder is implemented with two half adders and one OR gate The propagation delay of an XOR gate is twice that of an AND OR gate The propagation delay of an AND OR gate is 1 2 microseconds A 4 bit ripple carry binary adder is implemented by using four full adders The total propagation time of this 4 bit binary adder in microseconds is ______ | Half Adder | 79 |
A half adder is implemented with XOR and AND gates A full adder is implemented with two half adders and one OR gate The propagation delay of an XOR gate is twice that of an AND OR gate The propagation delay of an AND OR gate is 1 2 microseconds A 4 bit ripple carry binary adder is implemented by using four full adders The total propagation time of this 4 bit binary adder in microseconds is ______ | Half Adder | 79 |
A half adder is implemented with XOR and AND gates A full adder is implemented with two half adders and one OR gate The propagation delay of an XOR gate is twice that of an AND OR gate The propagation delay of an AND OR gate is 1 2 microseconds A 4 bit ripple carry binary adder is implemented by using four full adders The total propagation time of this 4 bit binary adder in microseconds is ______ | Half Adder | 79 |
A half adder is implemented with XOR and AND gates A full adder is implemented with two half adders and one OR gate The propagation delay of an XOR gate is twice that of an AND OR gate The propagation delay of an AND OR gate is 1 2 microseconds A 4 bit ripple carry binary adder is implemented by using four full adders The total propagation time of this 4 bit binary adder in microseconds is ______ | Half Adder | 79 |
A half adder is implemented with XOR and AND gates A full adder is implemented with two half adders and one OR gate The propagation delay of an XOR gate is twice that of an AND OR gate The propagation delay of an AND OR gate is 1 2 microseconds A 4 bit ripple carry binary adder is implemented by using four full adders The total propagation time of this 4 bit binary adder in microseconds is ______ | Half Adder | 79 |
A half adder is implemented with XOR and AND gates A full adder is implemented with two half adders and one OR gate The propagation delay of an XOR gate is twice that of an AND OR gate The propagation delay of an AND OR gate is 1 2 microseconds A 4 bit ripple carry binary adder is implemented by using four full adders The total propagation time of this 4 bit binary adder in microseconds is ______ | Half Adder | 79 |
A half adder is implemented with XOR and AND gates A full adder is implemented with two half adders and one OR gate The propagation delay of an XOR gate is twice that of an AND OR gate The propagation delay of an AND OR gate is 1 2 microseconds A 4 bit ripple carry binary adder is implemented by using four full adders The total propagation time of this 4 bit binary adder in microseconds is ______ | Half Adder | 79 |
A half adder is implemented with XOR and AND gates A full adder is implemented with two half adders and one OR gate The propagation delay of an XOR gate is twice that of an AND OR gate The propagation delay of an AND OR gate is 1 2 microseconds A 4 bit ripple carry binary adder is implemented by using four full adders The total propagation time of this 4 bit binary adder in microseconds is ______ | Half Adder | 79 |
A half adder is implemented with XOR and AND gates A full adder is implemented with two half adders and one OR gate The propagation delay of an XOR gate is twice that of an AND OR gate The propagation delay of an AND OR gate is 1 2 microseconds A 4 bit ripple carry binary adder is implemented by using four full adders The total propagation time of this 4 bit binary adder in microseconds is ______ | Half Adder | 79 |
A half adder is implemented with XOR and AND gates A full adder is implemented with two half adders and one OR gate The propagation delay of an XOR gate is twice that of an AND OR gate The propagation delay of an AND OR gate is 1 2 microseconds A 4 bit ripple carry binary adder is implemented by using four full adders The total propagation time of this 4 bit binary adder in microseconds is ______ | Half Adder | 79 |
A half adder is implemented with XOR and AND gates A full adder is implemented with two half adders and one OR gate The propagation delay of an XOR gate is twice that of an AND OR gate The propagation delay of an AND OR gate is 1 2 microseconds A 4 bit ripple carry binary adder is implemented by using four full adders The total propagation time of this 4 bit binary adder in microseconds is ______ | Half Adder | 79 |
A half adder is implemented with XOR and AND gates A full adder is implemented with two half adders and one OR gate The propagation delay of an XOR gate is twice that of an AND OR gate The propagation delay of an AND OR gate is 1 2 microseconds A 4 bit ripple carry binary adder is implemented by using four full adders The total propagation time of this 4 bit binary adder in microseconds is ______ | Half Adder | 79 |
An advantage of chained hash table external hashing over the open addressing scheme is Worst case complexity of search operations is less Space used is less Deletion is easier None of the above | Hashing | 80 |
In a binary max heap containing n numbers the smallest element can be found in time O n O log n O log log n O 1 | Heap | 81 |
Let L denote the languages generated by the grammar S o 0S0 mid 00 Which of the following is TRUE L 0 L is regular but not 0 L is context free but not regular L is not context free | Identify Class Language | 82 |
The following bit pattern represents a floating point number in IEEE 754 single precision format 1 10000011 101000000000000000000000 The value of the number in decimal form is 10 13 26 None of the above | Ieee Representation | 83 |
The decimal value 0 5 in IEEE single precision floating point representation has fraction bits of 000 dots 000 and exponent value of 0 fraction bits of 000 dots 000 and exponent value of u22121 fraction bits of 100 dots 000 and exponent value of 0 no exact representation | Ieee Representation | 83 |
In the IEEE floating point representation the hexadecimal value 0 ext x 00000000 corresponds to The normalized value 2 127 The normalized value 2 126 The normalized value 0 The special value 0 | Ieee Representation | 83 |
In the IEEE floating point representation the hexadecimal value 0 ext x 00000000 corresponds to The normalized value 2 127 The normalized value 2 126 The normalized value 0 The special value 0 | Ieee Representation | 83 |
In the IEEE floating point representation the hexadecimal value 0 ext x 00000000 corresponds to The normalized value 2 127 The normalized value 2 126 The normalized value 0 The special value 0 | Ieee Representation | 83 |
The decimal value 0 5 in IEEE single precision floating point representation has fraction bits of 000 dots 000 and exponent value of 0 fraction bits of 000 dots 000 and exponent value of u22121 fraction bits of 100 dots 000 and exponent value of 0 no exact representation | Ieee Representation | 83 |
The following bit pattern represents a floating point number in IEEE 754 single precision format 1 10000011 101000000000000000000000 The value of the number in decimal form is 10 13 26 None of the above | Ieee Representation | 83 |
In the IEEE floating point representation the hexadecimal value 0 ext x 00000000 corresponds to The normalized value 2 127 The normalized value 2 126 The normalized value 0 The special value 0 | Ieee Representation | 83 |
The decimal value 0 5 in IEEE single precision floating point representation has fraction bits of 000 dots 000 and exponent value of 0 fraction bits of 000 dots 000 and exponent value of u22121 fraction bits of 100 dots 000 and exponent value of 0 no exact representation | Ieee Representation | 83 |
In the IEEE floating point representation the hexadecimal value 0 ext x 00000000 corresponds to The normalized value 2 127 The normalized value 2 126 The normalized value 0 The special value 0 | Ieee Representation | 83 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.