Register
Filter

Questions by atul_21

1 votes
0 answers
31
Databases
0 votes
0 answers
32
Set theory : Number of functions
The number of ways possible to form injective function from set A set B where |A| = 3 and |B| = 5 such that pth element of set A cannot match with pth element of set B are ??
The number of ways possible to form injective function from set A set B where |A| = 3 and |B| = 5 such that pth element of set A cannot match with pth element of set B ar...
0 votes
0 answers
33
Set Theory
How(In S3: statement) phi is a subset of P(S) ?? It must be {phi} . Right??
How(In S3: statement) phi is a subset of P(S) ?? It must be {phi} . Right??
0 votes
0 answers
34
Self doubt on SQL
The IN clause can be used as multiple AND condition. True or false?? please explain
The IN clause can be used as multiple AND condition. True or false?? please explain
0 votes
1 answer
35
Rank of adj mAtrix
1 votes
1 answer
36
Combinatorics
How many ways 5 identical apples and 5 identical oranges be distributed among 5 people such that each person receives exactly two fruits??
How many ways 5 identical apples and 5 identical oranges be distributed among 5 people such that each person receives exactly two fruits??
0 votes
1 answer
37
Maximum number of vertices
Graph can be a tree (Will it not give the maximum no. of vertices??)
Graph can be a tree (Will it not give the maximum no. of vertices??)
0 votes
1 answer
38
Set theory
I thought it is multi set, each of the 4 places have 6 choices. so 64 . .?? please clear this out. What is multiset means??
I thought it is multi set, each of the 4 places have 6 choices. so 64 . .?? please clear this out. What is multiset means??
1 votes
1 answer
39
Non negative integral solutions
How many non – negative integral solutions are there to the equation $x_1 + x_2 + x_3 + x_4 + x_5 = 40$ if we must satisfy $x_1 \leq 20$ ?
How many non – negative integral solutions are there to the equation $x_1 + x_2 + x_3 + x_4 + x_5 = 40$ if we must satisfy $x_1 \leq 20$ ?
0 votes
0 answers
40
Graph theory : Disconnect the graph
Assumed undirected graph G is connected. G has 6-vertices and 10 edges. Find the minimum number of edges whose deletion from graph G is always guarantee that it will become disconnected.
Assumed undirected graph G is connected. G has 6-vertices and 10 edges. Find the minimum number of edges whose deletion from graph G is always guarantee that it will bec...
0 votes
2 answers
41
Minimal DFA
What will be the number of final and non-final states for the minimal DFA accepting the language which contains all the strings that either begin or end (or both) with 01? Can anyone provide the DFA diagram for this?
What will be the number of final and non-final states for the minimal DFA accepting the language which contains all the strings that either begin or end (or both) with 01...
1 votes
2 answers
42
DCFL or not??
$L1 = \bigl\{a^mb^nc^pd^q \mid m+q = n+p \bigr\}$ $L2 = \bigl\{a^mb^nc^pd^q \mid m+p = n+q \bigr\}$ 1. L1 is DCFL, L2 is not 2. L2 is DCFL, L1 is not 3. Both are not DCFL 4. Both are DCFL
$L1 = \bigl\{a^mb^nc^pd^q \mid m+q = n+p \bigr\}$$L2 = \bigl\{a^mb^nc^pd^q \mid m+p = n+q \bigr\}$1. L1 is DCFL, L2 is not2. L2 is DCFL, L1 is not3. Both are not DCFL...
0 votes
1 answer
43
Probability
0 votes
1 answer
44
Matching number in complete bipartitite graph
I am not convinced by this. Please explain or please tell me the source from where I can clear this out.
I am not convinced by this. Please explain or please tell me the source from where I can clear this out.
2 votes
0 answers
45
Recurrence Relation
How to solve this question ??? it ws getting lengthy . I tried to evaluate the nth term but I was stuck at some point. Please help
How to solve this question ??? it ws getting lengthy . I tried to evaluate the nth term but I was stuck at some point. Please help
1 votes
0 answers
46
Connected graph
The condition must be |E| > n-1C2 Isn't it???
The condition must be |E| n-1C2 Isn't it???
1 votes
2 answers
47
Is L CFL or not?
L ={ww | w ∈{a, b}∗} Is compliment of L, CFL? Support with reason
L ={ww | w ∈{a, b}∗}Is compliment of L, CFL? Support with reason
0 votes
0 answers
50
Number of view serializable
S1: R(A) W(A) W(B) S2: R(A) W(A) R(B) W(B) How many view serializable schedules are possible which are not conflict serializable? (A) 0 (B) 1 (C) 2 (D) 3
S1: R(A) W(A) W(B) S2: R(A) W(A) R(B) W(B)How many view serializable schedules are possible which are not conflict serializable?(A) 0 (B) 1 (C) 2 (D) 3
Page: