BC0052-Theory_of_Computer_Science-MQP

BC0052-Theory_of_Computer_Science-MQP - Model Question...

Info iconThis preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Model Question Paper Subject Code: BC0052 Subject Name: Fundamentals of Theory of Computer Science Credits: 4 Marks: 140 Part A (One mark questions) 1. A set which contains a single element is called a …………….. A) Singleton B) One set C) Proper set D) Improper set 2. The set of all subsets of A is called A) Improper set of A B) Proper set of A C) Power set of A D) Subset of A Ans: C 3. The sequence 1, 4, 16, 64,………. can be explicitly be defined by the formula A) f(n) = 4n B) f(n) = 4 n C) f(n) = n 4 D) f(n) = 4 + n 4. The value of 5! recursively is …………….. A) 125 B) 130 C) 110 D) 120 5. n ....... 3 2 1 A) 2 ) 1 ( n n B) 2 ) 1 ( n n C) 3 ) 1 ( n n D) 2 ) 1 ( 2 n n 6. The value of 2 2 2 2 ........ 3 2 1 n A) 4 ) 1 2 )( 1 ( n n n B) 6 ) 1 2 )( 1 ( n n n C) 5 ) 1 2 )( 1 ( n n n D) 5 ) 1 2 )( 1 ( n n n 7. If there are more than one edge associated with a given pair of vertices, then these edges are called ………………… A) loop B) Combined edges C) lines D) Parallel edges 8. Graphs containing either parallel edges or loops is referred as …………….. A) Pendant graph B) General Graph C) infinite graph D) finite graph 9. A ……………….. consists of a finite set of rules or productions which specify the syntax of the language. A) Tree B) Automata C) Roots D) Grammar 10. The …………….. of a string is the number of symbols in the string. A) Structure B) Graph C) length D) finite graph 11. An automaton system in which the output depends only on the present input is called a ……………………. A) Mealy machine B) Moore machine C) Dot machine D) DF machine 12. The machine which has a finite number of states is called a ……………….. A) Finite automata B) Finite control C) Deterministic finite machine D) finite graph 13. A string is a sequence of symbols obtained from ……………… A) £ B) ¥ C) D) 14. Digital computers are ………………………… A) automata controlled B) Finite controlled C) Deterministic machines D) finite graph structured 15. A DFA is a ------ tuple A) 4 B) 5 C) 3 D) 2 16. A DFA is ……………….. A) easy to construct B) difficult to construct C) not constructable D) only being imagined 17. …………………. are used to represent a set of strings and include symbols that are arranged using certain syntax rules. A) irregular expressions B) normal expressions C) regular expressions D) abnormal expressions 18. The union of two regular expressions is a …………………. A) irregular expression B) regular expression C) null set D) matrix 19. If L1 and L2 are regular, then the regular language is closed under ………………… A) Multiplication B) division C) addition D) complementation 20. Let and be the set of alphabets, then the function f: is called as……………… A) Isomorphism B) endomorphism C) homomorphism D) epimorphism...
View Full Document

Page1 / 21

BC0052-Theory_of_Computer_Science-MQP - Model Question...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online