Register
Filter

Recent activity by vivekpinto07

1 answer
2
Pushdown automata
For every pushdown automata,there exists an equivalent A)Regular Language B)Context sensitive language C)Context free language D)Recursively Enumerable language.
For every pushdown automata,there exists an equivalentA)Regular LanguageB)Context sensitive languageC)Context free languageD)Recursively Enumerable language.
1 answer
3
The meaning of the regular expression
The meaning of the regular expression (a+b)(a+b) is A)Strings of a's and b's where length is 2 B)Strings of a's and b's of any length. C)Null string D)None
The meaning of the regular expression (a+b)(a+b) isA)Strings of a's and b's where length is 2B)Strings of a's and b's of any length.C)Null stringD)None
3 answers
4
NFA to DFA
NFA can be converted into DFA using Sub set construction method Lazy evaluation method either A or B both A and B
NFA can be converted into DFA usingSub set construction methodLazy evaluation methodeither A or Bboth A and B
1 answer
5
Regularity of the strings
Which of the following is/are not regular A)strings of 0's whose length is a perfect square B)set of all palindromes made up of 0's & 1's C)Strings of 0's whose length is prime number D)all the above
Which of the following is/are not regularA)strings of 0's whose length is a perfect squareB)set of all palindromes made up of 0's & 1'sC)Strings of 0's whose length is pr...
2 answers
6
Binary search
If the binary search algorithm determines that the scanned argument is in upper half of the array,which of the following statement will set the appropriate variable to the appropriate value. A) startsub= middlesub-1; B) startsub=middlesub+1; C)stopsub=middlesub-1; D)stopsub=middlesub+1;
If the binary search algorithm determines that the scanned argument is in upper half of the array,which of the following statement will set the appropriate variable to th...
2 answers
7
All pair shortest path
Algorithm which solves the all pair shortest path problem is A)Dijkstra's algorithm B)Floyd's algorith C)Prim's algorithmm D)Warshall's algorithm
Algorithm which solves the all pair shortest path problem isA)Dijkstra's algorithmB)Floyd's algorithC)Prim's algorithmmD)Warshall's algorithm
2 answers
8
ambiguous grammar
An ambiguous grammar is one that produces more than one left most derivation for the same sentence. more than one right most derivation for the same sentence. more than one leftmost derivation for the different sentence. i and ii i or ii ii and iii ii or iii
An ambiguous grammar is one that producesmore than one left most derivation for the same sentence.more than one right most derivation for the same sentence.more than one ...
1 answer
9
Finite Automation
A language L is accepted by finite automata if and only if it is Right linear Primitive Recursive Context Sensitive Recursive
A language L is accepted by finite automata if and only if it isRight linearPrimitive RecursiveContext SensitiveRecursive
1 answer
10
Pushdown automation
A language L is accepted by a pushdown automation if and only if it is A) Context Sensitive B)Recursive C)Context Free D)Right Linear
A language L is accepted by a pushdown automation if and only if it isA) Context SensitiveB)RecursiveC)Context FreeD)Right Linear
4 answers
11
Probability
A fair coin is tossed 3 times in succession.If the first toss produced a head then the probability of getting exactly two heads in 3 tosses(including the first toss ) is 1/8 3/8 1/2 3/4
A fair coin is tossed 3 times in succession.If the first toss produced a head then the probability of getting exactly two heads in 3 tosses(including the first toss ) is1...
7 answers
12
BCNF
Every BCNF decomposition is A)Dependency preserving B)not a dependency preserving C)Need not be dependency preserving D)None of the above
Every BCNF decomposition is A)Dependency preservingB)not a dependency preservingC)Need not be dependency preservingD)None of the above
4 answers
13
GATE CSE 1999 | Question: 2.20
The minimum number of record movements required to merge five files A (with $10$ records), B (with $20$ records), C (with $15$ records), D (with $5$ records) and E (with $25$ records) is: $165$ $90$ $75$ $65$
The minimum number of record movements required to merge five files A (with $10$ records), B (with $20$ records), C (with $15$ records), D (with $5$ records) and E (with ...
1 answer
14
Minimim RTT for the link
suppose a 128kbps point to point link is setup between earth and Rover on Mars.The distance from earth to Mars is approximately 55Gm,data travel over the link at the speed of light.What is the minimum RTT for the link?
suppose a 128kbps point to point link is setup between earth and Rover on Mars.The distance from earth to Mars is approximately 55Gm,data travel over the link at the spee...
1 answer
15
Find bandwidth.
Consider a point to point link 50Kms in length.At what bandwidth would propagation delay(at the speed of light) equal to transmit delay for 100 byte packets ? What about 512 byte packets?
Consider a point to point link 50Kms in length.At what bandwidth would propagation delay(at the speed of light) equal to transmit delay for 100 byte packets ? What about ...
2 answers
16
GATE CSE 1997 | Question: 1.1
The probability that it will rain today is $0.5$. The probability that it will rain tomorrow is $0.6$. The probability that it will rain either today or tomorrow is $0.7$. What is the probability that it will rain today and tomorrow? $0.3$ $0.25$ $0.35$ $0.4$
The probability that it will rain today is $0.5$. The probability that it will rain tomorrow is $0.6$. The probability that it will rain either today or tomorrow is $0.7$...
2 answers
17
Different color combination of identical balls
There are three identical red balls and four identical blue balls in bag.Three balls are drawn.what is the number of different color combinations ?
There are three identical red balls and four identical blue balls in bag.Three balls are drawn.what is the number of different color combinations ?
1 answer
19
# of onto functions ,# into functions,#one to one function on two sets
Could anybody give me direct formule for it set A has n elements and set B has m elements.what is the direct formula for 1)number of onto functions . 2)Into function. 3)one to one function.
Could anybody give me direct formule for it set A has n elements and set B has m elements.what is the direct formula for 1)number of onto functions .2)Into function.3)one...