Home > Computer Engineering > Quizzes > Theory of Computer Science 1
Theory of Computer Science 1
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 33% • Most missed: “In Moore machine, output is produced over the change of:”
Theory of Computer Science 1
Time left 00:00
25 Questions

1. If n is the length of Input string and m is the number of nodes, the running time of DFA is x that of NFA.Find x?
2. The number of elements in the set for the Language L={xϵ(∑r) *|length if x is at most 2} and ∑={0,1} is_________
3. Which of the following options is correct? Statement 1: Initial State of NFA is Initial State of DFA. Statement 2: The final state of DFA will be every combination of final state of NFA.
4. The major difference between Mealy and Moore machine is about:
5. Predict the analogous operation for the given language:
6. Which of the following options is correct for the given statement? Statement: If K is the number of states in NFA, the DFA simulating the same language would have states less than 2k.
7. Which of the following is a not a part of 5-tuple finite automata?
8. Which among the following is not an application of FSM?
9. Which of the following is an application of Finite Automaton?
10. Which among the following is not an application of FSM?
11. What is the output for the given language? Language: A set of strings over ∑= {a, b} is taken as input and it prints 1 as an output 'for every occurrence of a, b as its substring. (INPUT: abaaab)
12. Statement 1: A Finite automata can be represented graphically; Statement 2: The nodes can be its states; Statement 3: The edges or arcs can be used for transitions. Hint: Nodes and Edges are for trees and forests too. Which of the following make the correct combination?
13. Let N (Q, ∑, δ, q0, A) be the NFA recognizing a language L. Then for a DFA (Q', ∑, δ', q0', A'), which among the following is true?
14. If an Infinite language is passed to Machine M, the subsidiary which gives a finite solution to the infinite input tape is ______________
15. A DFA cannot be represented in the following format
16. For a give Moore Machine, Given Input='101010', thus the output would be of length:
17. Which of the following do we use to form an NFA from a regular expression?
18. There exists an initial state, 17 transition states, 7 final states and one dumping state, Predict the maximum number of states in its equivalent DFA?
19. Which of the following option is correct?
20. Assume the R is a relation on a set A, aRb is partially ordered such that a and b are _____________
21. When are 2 finite states equivalent?
22. Moore Machine is an application of:
23. In Moore machine, output is produced over the change of:
24. Statement 1: NFA computes the string along parallel paths. Statement 2: An input can be accepted at more than one place in an NFA. Which among the following options are most appropriate?
25. The output alphabet can be represented as:

⚡ Recently practiced quizzes in this topic
Live quiz activity
Information Technology Knowledge Test Computer Network MCQs General CS (Computer Science) Knowledge Test Big Data: NoSQL Green Computing Practice Test Natural Language Processing: Word Level Analysis Computational Thinking Concepts Computer Fundamentals Practice Test Operating Systems Practice Test: Introduction to OS Computer Fundamentals Practice Test: Generations of Computers
 
❤ If you liked Fatskills, consider supporting us by checking out The Life Manuals You Never Got.

🌈  Our mission is to help improve your scores in any subject and exam withonline quizzes, practice tests, study guides, & advice for students. Since 2018.
About | Explore | User Guide | Topics | Subjects | Doubt Solver | Career Aptitude Test | Answers | Free Tools | OSHA Basics Quiz | What Should We Know?
Privacy | Terms |
Without work one finishes nothing. - Ralph Waldo Emerson
© 2026 Fatskills.com

All trademarks, logos and brand names are the property of their respective owners. All company, product and service names used in this website are for identification purposes only. Use of these names, trademarks and brands does not imply endorsement.