Categories

Computer Science Fundamentals Questions

Download PDF (5 Sample Questions)
What are the closure properties of regular languages?
Computer Science Fundamentals Algorithms Subjective
Posted: Mar 03, 2013 View Details
What is the 2's complements of binary number 010111.1100?
Computer Science Fundamentals System Design Objective
Posted: Mar 03, 2013 View Details
Define Inverse Homomorphisms
Computer Science Fundamentals Algorithms Subjective
Posted: Mar 03, 2013 View Details
Define Homomorphisms.
Computer Science Fundamentals Algorithms Subjective
Posted: Mar 03, 2013 View Details
What is Arden’s Theorem?
Computer Science Fundamentals Algorithms Subjective
Posted: Mar 03, 2013 View Details
What are the applications of Finite automata?
Computer Science Fundamentals Algorithms Subjective
Posted: Mar 03, 2013 View Details
What are the applications of pumping lemma?
Computer Science Fundamentals Algorithms Subjective
Posted: Mar 03, 2013 View Details
What do you mean by equivalence and minimization of DFA?
Computer Science Fundamentals Algorithms Subjective
Posted: Mar 03, 2013 View Details
List the application of regular expression.
Computer Science Fundamentals Algorithms Subjective
Posted: Mar 03, 2013 View Details
How do you test the emptiness of regular language?
Computer Science Fundamentals Algorithms Subjective
Posted: Mar 03, 2013 View Details
Which one is the binary equivalent of Gray code 11100?
Computer Science Fundamentals System Design Objective
Posted: Mar 03, 2013 View Details
Describe the algebra of regular expression.
Computer Science Fundamentals Algorithms Subjective
Posted: Mar 03, 2013 View Details
What is the order of precedence of operators used in regular expression?
Computer Science Fundamentals Algorithms Subjective
Posted: Mar 03, 2013 View Details
List out the operator of regular expression.
Computer Science Fundamentals Algorithms Subjective
Posted: Mar 03, 2013 View Details
Showing 1561 to 1575 of 3002 results
Feedback