Register
Filter

Answers by santhoshdevulapally

2 votes
81
Check whether given graph is planar
G1 and G2 are two graphs as shown— (A) Both 01 and G2 are planar graphs (B) Both G1 and G2 are not planar graphs (C) GI is planar and G2 is not planar graph (D) G1 is not planar and G2 is planar graph
G1 and G2 are two graphs as shown—(A) Both 01 and G2 are planar graphs(B) Both G1 and G2 are not planar graphs(C) GI is planar and G2 is not planar graph(D) G1 is not p...
1 votes
83
Madeeasy workbook
Correct answer?
Correct answer?
0 votes
84
Madeeasy workbook
Correct option?
Correct option?
0 votes
85
Madeeasy workbook
Correct option
Correct option
1 votes
86
gate 2005
Consider the following CFG, find the number of productions in the minimized grammar after it was convert it into Greibach normal form. S → AA| 0, A → SS | 1 plzzz explain how to convert the given grammer into gnf in detail.
Consider the following CFG, find the number of productions in the minimized grammar after it was convert it into Greibach normal form.S → AA| 0, A → SS | 1 plzzz expl...
1 votes
89
linked list
2 votes
90
decidablity
$L1 = a^{p}$ | p is prime . $L2 = a^{p}$| p is odd . state the decidability of below statement. 1) $L1 \cup L2$ is regular 2) regular expression of $L1 \cup L2$ is $a(aa)^*$
$L1 = a^{p}$ | p is prime .$L2 = a^{p}$| p is odd .state the decidability of below statement. 1) $L1 \cup L2$ is regular2) regular expression of $L1 \cup L2$ is $a(aa...
0 votes
91
Database
Given R (ABCDE) FDS ARE A-->BC,C-->DE, D-->E R1(ABCD) R2(DE) FIND WHETHER ITS DECOMPOSITION IS VALID OR NOT and Fd preserving too
Given R (ABCDE)FDS ARE A >BC,C >DE, D >ER1(ABCD) R2(DE)FIND WHETHER ITS DECOMPOSITION IS VALID OR NOT and Fd preserving too
1 votes
92
Doubt:::
1 votes
93
gate previous
$\begin{bmatrix}2 &1 & -4\\ 4 & 3 & -12\\ 1 & 2 & -8 \end{bmatrix}\cdot \begin{bmatrix} x\\ y\\ z \end{bmatrix}= \begin{bmatrix} \alpha \\5 \\ 7 \end{bmatrix}$ For how many values of $\alpha$ , this system has infinite solutions ?
$\begin{bmatrix}2 &1 & -4\\ 4 & 3 & -12\\ 1 & 2 & -8 \end{bmatrix}\cdot \begin{bmatrix} x\\ y\\ z \end{bmatrix}= \begin{bmatrix} \alpha \\5 \\ 7 \end{bmatrix}$For how man...
0 votes
95
toc rlg
Construct a Right Linear Grammar for the Language L((aab*ab)*)
Construct a Right Linear Grammar for the Language L((aab*ab)*)
0 votes
96
Find the serializability of given schedule
i) Is this schedule conflict serializable? ii)is this scheule view serializable? ii) Is this schedule serializable?? HOW TO SOLVE THIS PROBLEM?
i) Is this schedule conflict serializable?ii)is this scheule view serializable?ii) Is this schedule serializable??HOW TO SOLVE THIS PROBLEM?
1 votes
98
Made easy mock test
The Round trip delay between sender and receiver is 160 ms and the bottleneck bandwidth of the link is 256 Kbps. Sender uses sliding window protocol to send a 64 Byte packet. The optimal size of the window that sender should use is __________ (in packets).
The Round trip delay between sender and receiver is 160 ms and the bottleneck bandwidth of the link is 256 Kbps. Sender uses sliding window protocol to send a 64 Byte pac...
1 votes
100
MadeEasy Test Series: Computer Networks - Ethernet
Please explain question first ::: For gigabit ethernet, the length of the cable, if length of the cable in standard ethernet l (2000) to maintain same frame size is _______.
Please explain question first :::For gigabit ethernet, the length of the cable, if length of the cable in standard ethernet l (2000) to maintain same frame size is ______...
1 votes
102
compilation
Which of the following class of statement usually produces no executable codes when compiled? Assignment Declaration Input and output statement Structural statements
Which of the following class of statement usually produces no executable codes when compiled?Assignment Declaration Input and output statement Structural statements
0 votes
103
#Gatebook Qno.25
Here is a CFG with only 2 variables, and a single terminal, and 2 only productions (No unit, epsilon, useless products). What would be the max number of productions if that gets converted into CNF (A). 2 (B). <=4 (C). <=8 (D). None
Here is a CFG with only 2 variables, and a single terminal, and 2 only productions (No unit, epsilon, useless products). What would be the max number of productions if th...
0 votes
104
BST_traverse
While inserting an element into a BST, we will pass the element’s predecessor and successor (if they exist). (a) Ture (b) false (c) can't be determined.
While inserting an element into a BST, we will pass the element’s predecessor and successor (if they exist).(a) Ture(b) false(c) can't be determined.
1 votes
105
Suppose a connected graph has 15 labeled nodes
Suppose a connected graph has 15 labeled nodes, given that it has an eularian circuit, what is the minimum number of distinct circuits which it must have? [Note : the circuit a->b->c->a is not same as b->c->a->b]
Suppose a connected graph has 15 labeled nodes, given that it has an eularian circuit, what is the minimum number of distinct circuits which it must have? [Note : the cir...
0 votes
106
me/test
Can anyone help with the output ?? and a good concept about the address in 3-D array..
Can anyone help with the output ?? and a good concept about the address in 3-D array..
0 votes
107
TABLE
Agency called immediate cover supplies part time 1 temporary staff to hotels throughout India. The table shown below lists the time speed by agency staff working at two hotels. In the process of normalizing the above table into 3NF, how many tables will be formed? (Assume FD’s based on given table)
Agency called immediate cover supplies part time 1 temporary staff to hotels throughout India. The table shown below lists the time speed by agency staff working at two h...
Page: