Register
Filter

Answers by Tesla!

1 votes
201
HCF LCM doubt
How to determine whether a question is of LCM or HCF ?? It's sometime very confusing. Please help. Thank-you in advance.
How to determine whether a question is of LCM or HCF ?? It's sometime very confusing. Please help. Thank-you in advance.
1 votes
204
how to prove?
If abc(a+b+c)=3, prove that (a+b)(b+c)(c+a)≥8
If abc(a+b+c)=3, prove that (a+b)(b+c)(c+a)≥8
1 votes
205
Progression
If second term of an AP is equal to the 9th term of another AP. What will be the sum of 17 terms of second AP, as the sum of first 3 terms of first AP is given as 9. A – 85; B – 102; C – 204; D – 51; E – Can’t be determined.
If second term of an AP is equal to the 9th term of another AP. What will be the sum of 17 terms of second AP, as the sum of first 3 terms of first AP is given as 9.A –...
0 votes
206
Progression - no.of AP's possible
Let S = {1,2,3,….,541}. Find out how many AP’s can be formed by taking the elements of S starting from 1 and ending at 541. Which have atleast 3 elements. A – 12; B – 13; C – 23; D – 24; E – 27
Let S = {1,2,3,….,541}. Find out how many AP’s can be formed by taking the elements of S starting from 1 and ending at 541. Which have atleast 3 elements.A – 12; ...
2 votes
207
Binary Stream
We have a run of 0's followed by the run of 1's and we have to find the point where first 1 will be present. We only know the start of the sequence but we have no idea about the end. what should the best case complexity of this problem? Describe your approach.
We have a run of 0's followed by the run of 1's and we have to find the point where first 1 will be present. We only know the start of the sequence but we have no idea ab...
0 votes
208
theory of computation
Show that there exists an algorithm to determine whether the language generated by some context-free grammar contains any words of length less than some given number n.
Show that there exists an algorithm to determine whether the language generated by some context-free grammar contains any words of length less than some given number n.
2 votes
209
#TOC#Hopcroft and ullman #cfg
How to solve this? Design CFG for the language {aibjck | i=j+k}
How to solve this?Design CFG for the language {aibjck | i=j+k}
4 votes
211
Gatebook Test
A man ate 300 mangoes in 15 days , each day eating two more than the previous day . How many mangoes did he eat on the 3rd day?
A man ate 300 mangoes in 15 days , each day eating two more than the previous day . How many mangoes did he eat on the 3rd day?
0 votes
214
Self doubt toc
Construct a grammar for L={a^nb^n/m, n greater then equal to 0,m doesn't equal to n}
Construct a grammar for L={a^nb^n/m, n greater then equal to 0,m doesn't equal to n}
1 votes
217
In which layer the ICMP and IGMP protocols work
How the ICMP and IGMP differ from each other ? In which OSI layer do these protocols work >
How the ICMP and IGMP differ from each other ? In which OSI layer do these protocols work >
3 votes
218
JNUEE-2016
Consider an undirected graph G with 100 nodes. What is the maximum number of edges to be included in G so that graph is connected? (a) 2451 (b) 4851 (c) 4950 (d) 9990
Consider an undirected graph G with 100 nodes. What is the maximum number of edges to be included in G so that graph is connected?(a) 2451(b) 4851(c) 4950(d) 9990
2 votes
219
cil-2017
1 votes
220
Graph Theory
let G=(V,E) be an connected graph, let $\left | V \right |= n$ Find largest value of n such that i) G is complete & ii) G is bipartite with valid proof
let G=(V,E) be an connected graph, let $\left | V \right |= n$Find largest value of n such thati) G is complete &ii) G is bipartitewith valid proof
1 votes
221
gate2017
OBC NCL GATE SCORE 654 NORMALISED MARKS=52.21 RANK=1130 Is there any chance of Old IIT.??
OBC NCLGATE SCORE 654NORMALISED MARKS=52.21RANK=1130Is there any chance of Old IIT.??
0 votes
222
gate admission
with a gate score of 689 and rank 797 in general category cse can i get any old iits?
with a gate score of 689 and rank 797 in general category cse can i get any old iits?
2 votes
223
ISI 2017
Is there any shortcut to compute this or does it have to get the sum by calculating each values?
Is there any shortcut to compute this or does it have to get the sum by calculating each values?
2 votes
224
RSA(self doubt)
0 votes
225
CIL 2017
Which of the following operators can be used if a portion of a given bit patterns needs to be copied to a new word,while the remainder of the new word is filled with 0s? 1. Bitwise AND 2. Bitwise OR 3. Bitwise XOR 4. Bitwise AND
Which of the following operators can be used if a portion of a given bit patterns needs to be copied to a new word,while the remainder of the new word is filled with 0s?1...
1 votes
226
APTITUDE
0 votes
228
CIL17
In general , root is at level 0 like if we have level 2 then no of leaf nodes in a binary tree is at most 22
In general , root is at level 0 like if we have level 2 then no of leaf nodes in a binary tree is at most 22
1 votes
229
Graph Theory Path
What is the difference between path and Euler path?
What is the difference between path and Euler path?
3 votes
230
Rosen(relations)
Let R be a relation on a set A. Explain how to use the directed graph representing R to obtain the directed graph representing the complementary relation $\overline{R}$
Let R be a relation on a set A. Explain how to use the directedgraph representing R to obtain the directed graphrepresenting the complementary relation $\overline{R}$
Page: