Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by vivekpinto07
3
answers
1
What is the type of loading?
Routine is not loaded until it is called.All routine are kept on disk in a relocatable load format.The main program is loaded into memory and is executed.This type of loading is called as _________ A)Static Loading B)Dynamic Loading C)Dynamic Linking D)Overlays Kindly give explanation /attach references if any.
Routine is not loaded until it is called.All routine are kept on disk in a relocatable load format.The main program is loaded into memory and is executed.This type of loa...
2.8k
views
answer selected
Jul 29, 2016
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.
2.1k
views
asked
Jul 6, 2016
Theory of Computation
theory-of-computation
pushdown-automata
+
–
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
561
views
commented
Jun 25, 2016
Theory of Computation
theory-of-computation
regular-expression
+
–
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
2.5k
views
commented
Jun 25, 2016
Theory of Computation
theory-of-computation
finite-automata
+
–
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...
7.7k
views
asked
Jun 24, 2016
Theory of Computation
regular-expression
regular-language
theory-of-computation
+
–
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...
3.0k
views
commented
Jun 24, 2016
DS
binary-search
+
–
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
9.3k
views
asked
Jun 24, 2016
DS
graph-algorithms
graph-theory
+
–
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 ...
4.0k
views
asked
Jun 24, 2016
Unknown Category
parsing
compiler-design
grammar
ambiguous
+
–
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
4.9k
views
asked
Jun 24, 2016
Theory of Computation
theory-of-computation
finite-automata
+
–
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
1.5k
views
asked
Jun 24, 2016
Theory of Computation
theory-of-computation
pushdown-automata
+
–
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.3k
views
answer selected
Jun 23, 2016
Probability
probability
+
–
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
2.6k
views
asked
Jun 19, 2016
Databases
bcnf
docm
bcnf-decomposition
database-normalization
+
–
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 ...
14.6k
views
commented
Jun 15, 2016
Algorithms
gate1999
algorithms
normal
greedy-algorithm
+
–
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.9k
views
asked
Jun 13, 2016
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 ...
1.1k
views
asked
Jun 13, 2016
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$...
6.3k
views
commented
Jun 5, 2016
Probability
gate1997
probability
easy
+
–
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 ?
2.8k
views
commented
May 27, 2016
Combinatory
combinatory
+
–
10
answers
18
GATE CSE 2001 | Question: 1.10, UGCNET-Dec2012-III: 36
Suppose a processor does not have any stack pointer registers, which of the following statements is true? It cannot have subroutine call instruction It cannot have nested subroutines call Interrupts are not possible All subroutine calls and interrupts are possible
Suppose a processor does not have any stack pointer registers, which of the following statements is true?It cannot have subroutine call instructionIt cannot have nested s...
18.0k
views
comment reshown
May 22, 2016
CO and Architecture
gatecse-2001
co-and-architecture
normal
ugcnetcse-dec2012-paper3
runtime-environment
+
–
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...
2.3k
views
asked
May 4, 2016
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register