Categories

Computer Science Fundamentals Questions - Algorithms

Download PDF (5 Sample Questions)
What is process synchronization?
Computer Science Fundamentals Algorithms Subjective
Posted: Mar 07, 2013 View Details
The productionsE—>E+EE—>E-EE-->E*EE —> E / EE —> id
Computer Science Fundamentals Algorithms Objective
Posted: Mar 06, 2013 View Details
A class of language that is closed under
Computer Science Fundamentals Algorithms Objective
Posted: Mar 06, 2013 View Details
P, Q, R are three languages, if P and R are regular and if PQ = R, then
Computer Science Fundamentals Algorithms Objective
Posted: Mar 06, 2013 View Details
The CFG     s---> as | bs |  a |  bis equivalent to regular expression
Computer Science Fundamentals Algorithms Objective
Posted: Mar 06, 2013 View Details
Pumping lemma is generally used for proving that
Computer Science Fundamentals Algorithms Objective
Posted: Mar 06, 2013 View Details
Which of the following statement is correct?
Computer Science Fundamentals Algorithms Objective
Posted: Mar 06, 2013 View Details
Set of regular languages over a given alphabet set is not closed under
Computer Science Fundamentals Algorithms Objective
Posted: Mar 06, 2013 View Details
FSM can recognize
Computer Science Fundamentals Algorithms Objective
Posted: Mar 06, 2013 View Details
L = (an bn an | n = 1,2,3)  is an example of a language that is
Computer Science Fundamentals Algorithms Objective
Posted: Mar 06, 2013 View Details
Showing 1 to 15 of 348 results
Feedback