Register
Filter

Answers by Devwritt

0 votes
61
Graph theory
How many simple graph are possible on six vertices in which the number of edge is odd??
How many simple graph are possible on six vertices in which the number of edge is odd??
2 votes
62
self DOUBT database
If R1 have 120 tuples R2 have 100 tuples and R3 have 70 tuples then R1⋈R2⋈R3 WILL BE?
If R1 have 120 tuples R2 have 100 tuples and R3 have 70 tuples then R1⋈R2⋈R3 WILL BE?
0 votes
63
Theory of computaion
Minimum number of states in DFA over Ʃ = {0, 1} with each string contains odd number of 0’s or odd number of 1’s. (a) 3 (b) 4 (c) 5 (d) 6 Can anyone draw the Dfa? :{
Minimum number of states in DFA over Ʃ = {0, 1} with each string contains odd number of 0’s or odd number of 1’s.(a) 3 (b) 4 (c) 5 (d) 6Can anyone draw the Dfa? :{
1 votes
65
Minimum Spanning tree
If a simple undirected graph with positive weighted edges has 10 vertices and 30 edges, such that the cost of the Minimum Spanning tree is 59. Now, if all the edges weights are increased by 2, then the cost of the new MST is
If a simple undirected graph with positive weighted edges has 10 vertices and 30 edges, such that the cost of the Minimum Spanning tree is 59. Now, if all the edges weigh...
6 votes
66
GATE CSE 2002 | Question: 2.13
The smallest finite automaton which accepts the language $\{x \mid$ length of $x$ is divisible by $3\}$ has $2$ states $3$ states $4$ states $5$ states
The smallest finite automaton which accepts the language $\{x \mid$ length of $x$ is divisible by $3\}$ has$2$ states$3$ states$4$ states$5$ states
15 votes
67
GATE CSE 2018 | Question: GA-7
If $pqr \ne 0$ and $p^{-x}=\dfrac{1}{q},q^{-y}=\dfrac{1}{r},r^{-z}=\dfrac{1}{p},$ what is the value of the product $xyz$ ? $-1$ $\dfrac{1}{pqr}$ $1$ $pqr$
If $pqr \ne 0$ and $p^{-x}=\dfrac{1}{q},q^{-y}=\dfrac{1}{r},r^{-z}=\dfrac{1}{p},$ what is the value of the product $xyz$ ?$-1$$\dfrac{1}{pqr}$$1$$pqr$
1 votes
71
Testbook Test Series: CO & Architecture - Cache Memory
If a 16-way Set Associative cache is made up of 64 bit words , 16 words per line and 8192 sets, How big is the cache in Megabytes ?
If a 16-way Set Associative cache is made up of 64 bit words , 16 words per line and 8192 sets,How big is the cache in Megabytes ?
9 votes
75
Max Number of edges
A simple undirected graph ‘X’ has 10 vertices. If ‘X’ has 5 equally sized connected components, the maximum number of edges in graph ‘X’ is _________.
A simple undirected graph ‘X’ has 10 vertices. If ‘X’ has 5 equally sized connected components, the maximum number of edges in graph ‘X’ is _________.
0 votes
79
SQL
Consider the following functional dependency set F. F: ABC, CB, BA The number of minimal covers possible for F? (A) 1 (B) 2 (C) 3 (D) 4 It should be 1 minimal cover.Isnt it?
Consider the following functional dependency set F.F: ABC, CB, BAThe number of minimal covers possible for F?(A) 1(B) 2(C) 3(D) 4It should be 1 minimal cover.Isnt it?
1 votes
80
UGC NET CSE | December 2014 | Part 2 | Question: 03
Consider the Graph shown below : This graph is a _________. Complete Graph Bipartite Graph Hamiltonian Graph All of the above
Consider the Graph shown below : This graph is a _________.Complete GraphBipartite GraphHamiltonian GraphAll of the above
0 votes
81
Gate 2017
Please Tell me where I can find Gate-2017 official syllabus . and please guide me how to prepare.
Please Tell me where I can find Gate-2017 official syllabus .and please guide me how to prepare.
0 votes
83
UGC NET CSE | June 2014 | Part 2 | Question: 49
Let $R =\{A, B, C, D, E, F\}$ be a relation schema with the following dependencies $C \rightarrow F$, $E \rightarrow A$, $EC \rightarrow D$, $A \rightarrow B$. Which of the following is a key for $R$ ? CD EC AE AC
Let $R =\{A, B, C, D, E, F\}$ be a relation schema with the following dependencies $C \rightarrow F$, $E \rightarrow A$, $EC \rightarrow D$, $A \rightarrow B$. Which of t...
2 votes
85
UGC NET CSE | June 2014 | Part 2 | Question: 50
Match the following $:$ ... $\text{a-ii; b-iii; c-i; d-iv}$ $\text{a-iv; b-i; c-ii; d-iii}$
Match the following $:$$\begin{array} {cIcI} & \textbf{List – I} && \textbf{List – II} \\ \text{a.} & \text{DDL} & \text{i.} & \text{LOCK TABLE} \\ \text{b.} & \tex...
2 votes
86
UGC NET CSE | June 2014 | Part 2 | Question: 43
While (87) printf(“computer”); The above $C$ statement will print “computer” $87$ times print “computer” $0$ times print “computer” $1$ times print “computer” infinite times
While (87) printf(“computer”); The above $C$ statement will print “computer” $87$ timesprint “computer” $0$ timesprint “computer” $1$ times print “compu...
7 votes
87
ISRO2014-78
Which of the following is not an optimization criterion in the design of a CPU scheduling algorithm? Minimum CPU utilization Maximum throughput Minimum turnaround time Minimum waiting time
Which of the following is not an optimization criterion in the design of a CPU scheduling algorithm?Minimum CPU utilizationMaximum throughputMinimum turnaround timeMinimu...
10 votes
88
ISRO2014-12
How many states are there in a minimum state deterministic finite automaton accepting the language $L = \{w \mid w \in \{0,1\}^*,$ number of 0's is divisible by 2 and number of 1's is divisible by 5, respectively $\}$? 7 9 10 11
How many states are there in a minimum state deterministic finite automaton accepting the language $L = \{w \mid w \in \{0,1\}^*,$ number of 0's is divisible by 2 and num...
2 votes
90
Simplified Boolean expression for A'BC+AB'C'+A'B'C'+AB'C+ABC
Simplified Boolean expression for A'BC+AB'C'+A'B'C'+AB'C+ABC A . AB B . B'C C . AB+(A'+AB')C D . AB'+BC+B'C'
Simplified Boolean expression for A'BC+AB'C'+A'B'C'+AB'C+ABCA . ABB . B'CC . AB+(A'+AB')CD . AB'+BC+B'C'
Page: