Register
Filter

Answers by agoh

0 votes
1
PGEE 2017
Consider a graph where vertex having number 2 to 12 (including 2 and 12), there is an edge between two vertex x and y iff x divides y Which vertex will have highest in degree ?
Consider a graph where vertex having number 2 to 12 (including 2 and 12), there is an edge between two vertex x and y iff x divides yWhich vertex will have highest in deg...
0 votes
2
question
L = {ai bj ck dm} | i+j+k+m is multiple of 13} L is ? (a) Regular (b) Context-free (c) Turing-decidable (d) Turing-Recognizable
L = {ai bj ck dm} | i+j+k+m is multiple of 13}L is ?(a) Regular (b) Context-free(c) Turing-decidable (d) Turing-Recognizable
3 votes
6
MadeEasy Test Series
Consider the following schedule S : r1(A) w2(A) r3(A) w4(A) r5(A) w6(A) The number of schedules equal to given schedule(s) which not conflict equal to schedule(s) are _______.
Consider the following scheduleS : r1(A) w2(A) r3(A) w4(A) r5(A) w6(A)The number of schedules equal to given schedule(s) which not conflict equal to schedule(s) are _____...
0 votes
7
DBMS-7
0 votes
8
DBMS-10
1 votes
9
Relations
Consider the set S = {a, b} and ‘L’ be a binary relation such that L = {all binary relations except reflexive relation set S}. The number of relation which are symmetric _______.
Consider the set S = {a, b} and ‘L’ be a binary relation such that L = {all binary relations except reflexive relation set S}. The number of relation which are symmet...
0 votes
10
Wanted answer
How many strings of eight English letters are there that contain exactly one vowel, if letters can be repeated?
How many strings of eight English letters are there that contain exactly one vowel, if letters can be repeated?
2 votes
12
CMI2016-A-5
A dodecahedron is a regular solid with $12$ faces, each face being a regular pentagon. How many edges are there? And how many vertices? $60$ edges and $20$ vertices $30$ edges and $20$ vertices $60$ edges and $50$ vertices $30$ edges and $50$ vertices
A dodecahedron is a regular solid with $12$ faces, each face being a regular pentagon. How many edges are there? And how many vertices?$60$ edges and $20$ vertices$30$ ed...
0 votes
13
connectivity
Consider a simple connected undirected graph G which has m vertices and n edges. Which of the following condition always guarantee that after removal of those number of edges graph will be disconnected? a)m – n + 2 b)$_{2}^{m}\textrm{C}-n+2$ c)n – 2 d)None of the above
Consider a simple connected undirected graph G which has m vertices and n edges. Which of the following condition always guarantee that after removal of those number of e...
4 votes
14
Recurrence Relation
The recurrence relation for the number of n-digit quaternary sequences that have an even number of zeros (quaternary sequences use only 0,1,2,3 for digits) is- (A) an = an-1 + 4n-1 (B) an = 3an-1 + 4n-1 (C) an = 2an-1 + 4n-1 (D) an = an-1 + 4n-2
The recurrence relation for the number of n-digit quaternary sequences that have an even number of zeros (quaternary sequences use only 0,1,2,3 for digits) is-(A) an = an...
3 votes
15
CIDR Networking.
An Internet Service provider (ISP) has the following chunk of CIDR- based IP addresses available 252.224.128.0/22. Now it gives its quarter of addreeses to X, Calculate the valid allocation of addresses to the X ?
An Internet Service provider (ISP) has the following chunk of CIDR- based IP addresses available 252.224.128.0/22. Now it gives its quarter of addreeses to X, Calculate ...
0 votes
17
flow control
Assume that the selective repeat data link protocol uses 3-bit sequence number. When the lower and the upper edges of the sender's sliding window are 6 and 1, respectively, what will be the lower and upper edges of the receiver's sliding window
Assume that the selective repeat data link protocol uses 3-bit sequence number. When the lower and the upper edges of the sender's sliding window are 6 and 1, respectivel...
0 votes
18
CN22 doubt
0 votes
19
FA cross product
0 votes
22
Pigeon hole
3 votes
23
GATE1992-04-c
Design a $3$-bit counter using D-flip flops such that not more than one flip-flop changes state between any two consecutive states.
Design a $3$-bit counter using D-flip flops such that not more than one flip-flop changes state between any two consecutive states.
0 votes
24
ACE test
The Grammar E->TE|a, T->ET|b is (a) LR(0) (b) SLR(1) (c) LR(1) (d) None
The Grammar E->TE|a, T->ET|b is (a) LR(0) (b) SLR(1) (c) LR(1) (d) None
0 votes
25
Variable Entered K-Map (VEM)
From the given K-map for the function F=(a,b,c,d,e), answer the following questions: In the minimized form of the function how many minterms are free from e, e’ (The term should not include any of e, e’) 2 3 1 0
From the given K-map for the function F=(a,b,c,d,e), answer the following questions: In the minimized form of the function how many minterms are free from e, e’ (The te...
4 votes
26
DBMS er-model
0 votes
27
Database:
Consider f is AB->C, C->A, BC->D, ACD->B, BE->C, CE->FA, CF->BD, D->E then find the canonical cover.
Consider f is AB->C, C->A, BC->D, ACD->B, BE->C, CE->FA, CF->BD, D->E then find the canonical cover.
14 votes
28
GATE CSE 1987 | Question: 10e
Show that the conclusion $(r \to q)$ follows from the premises$:p, (p \to q) \vee (p \wedge (r \to q))$
Show that the conclusion $(r \to q)$ follows from the premises$:p, (p \to q) \vee (p \wedge (r \to q))$
Page: