Home > Computer Engineering > Quizzes > CS411 Final Exam - Non-Standard Computing
CS411 Final Exam - Non-Standard Computing
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 78% • Most missed: “What is reasonable computation?”

MCQs on several prominent 'unconventional' computational methods and theories, including quantum computation, DNA and molecular computation, genetic algorithms, and cellular automata.
 

CS411 Final Exam - Non-Standard Computing
Time left 00:00
25 Questions

1. What do biochemical computers depend on to achieve computational functionality?
2. Which of the following conditions must hold true for a non-accepting computation of a pushdown transducer?
3. Which type of language does a cellular automaton belong to?
4. Which class is NOT one of Wolfram's four classes characterized by the effects of small changes in initial configurations?
5. Which of the following is NOT part of the definition of a finite-state transducer?
6. What is the requirement for perfect measurement?
7. What is the difference between patterns and classes?
8. Which method is effective due to consideration of mutation and genetic recombination?
9. What is a phenomenon in which we design molecules to form a host-guest complex?
10. Which observation is the basis of genetic algorithms?
11. Fill in the blank. In classical physics, the approximation of universes is _____________.
12. What is the common learning method in neural networks that adjust the parameters in order to minimize the error function?
13. What is the most frequently used criteria to compare strings?
14. Why is it economically beneficial to use biocomputers?
15. What is the greatest common divisor (gcd) of 16,321 and 135,749?
16. What is a Cellular Wave Computer?
17. Which method takes the square roots of the fitness plus one to reduce the influence of the strongest subjects?
18. Which formal language is NOT one of Wolfram's four types of formal languages distinguished by the computer's memory size?
19. What is the definition of a finite-state automaton?
20. What is one of the biggest problems with the program of miniaturizing conventional computers?
21. What is needed to specify a quantum system?
22. Fill in the blank. A set is a regular set only if it is accepted by a _______________.
23. How can sentential forms in type 0 grammar be displayed?
24. Which of the following best describes a classification problem?
25. How do covalent bonds get broken and formed under thermodynamic control?

⚡ 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.