Register
Filter

Answers by Devwritt

0 votes
2
NIELIT 2021 Dec Scientist B - Section B: 51
The ___________ of a relationship is $0$ if there is no explicit need for the relationship to occur or the relationship is optional. modality cardinality entity structured analysis
The ___________ of a relationship is $0$ if there is no explicit need for the relationship to occur or the relationship is optional. modalitycardinalityentitystructured a...
0 votes
4
Barc cse 2023 online exam
Which of the following are true a. A relational table can have atmost one foreign key b. The main purpose of foreign key is to optimize the queries by query optimizer.
Which of the following are truea. A relational table can have atmost one foreign keyb. The main purpose of foreign key is to optimize the queries by query optimizer.
0 votes
7
NIELIT Scientist B 2020 November: 56
Which element is used to define discrete unit of content such as a blogpost, comment and so on? section class article none of the options
Which element is used to define discrete unit of content such as a blogpost, comment and so on?sectionclassarticlenone of the options
0 votes
9
NIELIT 2017 July Scientist B (CS) - Section B: 50
Match the problem domains in $\text{GROUP I}$ with the solution technologies in $\text{GROUP II}$ ... $P-3,Q-4,R-2,S-1$ $P-3,Q-1,R-4,S-2$ $P-4,Q-3,R-2,S-1$
Match the problem domains in $\text{GROUP I}$ with the solution technologies in $\text{GROUP II}$$$\begin{array}{llll} & \textbf{GROUP I}& {}& \textbf{GROUP II}\\ \text{(...
0 votes
11
NIELIT 2017 DEC Scientist B - Section B: 29
Which of the following is not deliverable of the structured system analysis? Data flow diagram Prototype model Entity Relationship diagram Data dictionary
Which of the following is not deliverable of the structured system analysis?Data flow diagramPrototype modelEntity Relationship diagramData dictionary
0 votes
12
NIELIT 2017 DEC Scientist B - Section B: 36
If the number of networks and number of hosts in class $B$ are $2^m, (2^n-2)$ respectively. Then the relation between $m,n$ is $3m=2n$ $7m=8n$ $8m=7n$ $2m=3n$
If the number of networks and number of hosts in class $B$ are $2^m, (2^n-2)$ respectively. Then the relation between $m,n$ is$3m=2n$$7m=8n$$8m=7n$$2m=3n$
0 votes
13
NIELIT 2016 DEC Scientist B (IT) - Section B: 49
Application layer protocol defines: types of messages exchanged rules for when and how processes send and respond to messages message format, syntax and semantics all of the above
Application layer protocol defines:types of messages exchangedrules for when and how processes send and respond to messagesmessage format, syntax and semanticsall of the ...
0 votes
14
NIELIT 2017 July Scientist B (CS) - Section B: 26
The process of converting the analog sample into discrete form is called Modulation Multiplexing Quantization Sampling
The process of converting the analog sample into discrete form is calledModulationMultiplexingQuantizationSampling
5 votes
15
GATE IT 2005 | Question: 7
Which of the following expressions is equivalent to $(A \oplus B) \oplus C$ $(A + B + C) (\bar A +\bar B +\bar C)$ $(A + B + C) (\bar A +\bar B + C)$ $ABC + \bar A (B \oplus C) + \bar B(A \oplus C)$ None of these
Which of the following expressions is equivalent to $(A \oplus B) \oplus C$$(A + B + C) (\bar A +\bar B +\bar C)$$(A + B + C) (\bar A +\bar B + C)$$ABC + \bar A (B \oplus...
0 votes
16
Max Heap
The number of ways in which the numbers 1, 2, 3, 4, 5 can be inserted into binary heap. Such that resulted binary heap is max heap ________.
The number of ways in which the numbers 1, 2, 3, 4, 5 can be inserted into binary heap. Such that resulted binary heap is max heap ________.
1 votes
18
#geeksfoegeeks #gate #2017 #mocktest
Let G be a simple graph with 20 vertices and 8 components. If we delete a vertex in G, then number of components in G should lie between ____. (A) 8 and 20 (B) 8 and 19 (C) 7 and 19 (D) 7 and 20 Answer is (C) but i think also possible (B). anyone explain?
Let G be a simple graph with 20 vertices and 8 components. If we delete a vertex in G, then number of components in G should lie between ____.(A) 8 and 20(B) 8 and 19(C) ...
1 votes
19
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$
2 votes
20
MadeEasy Test Series: Programming & DS - Trees
assume the preorder tŕaversal of binary tree is "abc" how many total different binary trees are possible whose postorder traversal.is "cba" with the given preorder traversal.?? how to find it ?
assume the preorder tŕaversal of binary tree is "abc" how many total different binary trees are possible whose postorder traversal.is "cba" with the given preorder trave...
0 votes
22
ISRO2009-48
The cubic polynomial $y(x)$ which takes the following values: $y(0)=1, y(1)=0, y(2)=1$ and $y(3)=10$ is $x^3 +2x^2 +1$ $x^3 +3x^2 -1$ $x^3 +1$ $x^3 -2x^2 +1$
The cubic polynomial $y(x)$ which takes the following values: $y(0)=1, y(1)=0, y(2)=1$ and $y(3)=10$ is$x^3 +2x^2 +1$$x^3 +3x^2 -1$$x^3 +1$$x^3 -2x^2 +1$
0 votes
23
ISRO2017-80
The time complexity of computing the transitive closure of a binary relation on a set of $n$ elements is known to be a. $O(n\log n)$ b. $O\left( n^{3/2}\right)$ c. $O( n^3 )$ d. $O(n)$
The time complexity of computing the transitive closure of a binary relation on a set of $n$ elements is known to bea. $O(n\log n)$b. $O\left( n^{3/2}\right)$c. $O( n^3 )...
0 votes
24
Self Doubt
How to prepare for BARC exam and how many marks required to confirm interview call from the previous cutoff’s. Thankyou.
How to prepare for BARC exam and how many marks required to confirm interview call from the previous cutoff’s.Thankyou.
1 votes
26
ACE CBT 2018
Identify valid statements pertaining to switching S1: Computer networks are based on packet switching. S2: Packet switching increases the available throughput. (A) Both S1 and S2 (B) S1 only (C) S2 only (D) Neither S1 nor S2
Identify valid statements pertaining to switchingS1: Computer networks are based on packet switching.S2: Packet switching increases the available throughput.(A) Both S1 a...
0 votes
27
Pipeline Efficiency
A pipeline has a speedup factor of 5 and operating at 70% efficiency. How many stages are there in the pipeline?
A pipeline has a speedup factor of 5 and operating at 70% efficiency. How many stages are there in the pipeline?
Page: