{"id":29,"date":"2020-03-30T14:02:52","date_gmt":"2020-03-30T14:02:52","guid":{"rendered":"https:\/\/temp.ashkerala.com\/?p=29"},"modified":"2020-03-30T14:02:52","modified_gmt":"2020-03-30T14:02:52","slug":"discrete-structure-mcq-01","status":"publish","type":"post","link":"https:\/\/temp.ashkerala.com\/?p=29","title":{"rendered":"Discrete Structure MCQ-01"},"content":{"rendered":"

1) Context free Grammar is ?<\/strong>
a.\u00a0\u00a0 \u00a0A Compiler
b.\u00a0\u00a0 \u00a0A language expression
c.\u00a0\u00a0 \u00a0A regular expression
d.\u00a0\u00a0 \u00a0None of these
\u00a0
Answer = B<\/strong>
Explanation: Context free Grammar generate the context free languages. These are defined by the rule of the form A -> b Where A a non terminal and b is the string of terminals.<\/p>\n

2) The idea of an automation with a stack as auxiliary storage… ?<\/strong>
a.\u00a0\u00a0 \u00a0Finite automata
b.\u00a0\u00a0 \u00a0Push down automata
c.\u00a0\u00a0 \u00a0Deterministic automata
d.\u00a0\u00a0 \u00a0None of these
\u00a0
Answer = B<\/strong>
Explanation: Push down automata manipulate the stack, as a part of performing a transition.<\/p>\n

3) A Pushdown automata is…..if there is at most one transition applicable to each configuration ?<\/strong>
a.\u00a0\u00a0 \u00a0Deterministic
b.\u00a0\u00a0 \u00a0Non Deterministic
c.\u00a0\u00a0 \u00a0Finite
d.\u00a0\u00a0 \u00a0Non Finite
\u00a0
Answer = A<\/strong>
Explanation:If in every situation only one transition is available as continuation of computation, then the result is a deterministic push down automation (DPDA).<\/p>\n

4) The graphical representation of the transition of finite automata is ?<\/strong>
a.\u00a0\u00a0 \u00a0Finite diagram
b.\u00a0\u00a0 \u00a0State diagram
c.\u00a0\u00a0 \u00a0Node diagram
d.\u00a0\u00a0 \u00a0E-R diagram
\u00a0
Answer = B<\/strong>
Explanation: State diagram is called the graphical representation of Finite automata.<\/p>\n

5) If two sets A and B have no common elements i.e (A intersection B) has no element then such sets are known as ?<\/strong>
a.\u00a0\u00a0 \u00a0Intersection
b.\u00a0\u00a0 \u00a0Union
c.\u00a0\u00a0 \u00a0Disjoint
d.\u00a0\u00a0 \u00a0Complement
\u00a0
Answer = C<\/strong>
Explanation:If two sets have no element in common then they are called disjoint sets.<\/p>\n

6) The domain D of the relation R is defined as the…. ?
a.\u00a0\u00a0 \u00a0Set of all elements of ordered pair which belongs to R
b.\u00a0\u00a0 \u00a0Set of all last elements of ordered pair which belongs to R
c.\u00a0\u00a0 \u00a0Set of all first elements of ordered pair which belongs to R
d.\u00a0\u00a0 \u00a0None of these
\u00a0
Answer = C<\/strong><\/p>\n

7) ‘A language is regular if and only if it is accepted by a finite automation’ ?<\/strong>
a.\u00a0\u00a0 \u00a0The given statement is true
b.\u00a0\u00a0 \u00a0The given statement is false
c.\u00a0\u00a0 \u00a0The given statement is partially true
d.\u00a0\u00a0 \u00a0Sometime true, sometimes false
\u00a0
Answer = A<\/strong>
Explanation: A regular language is accepted by the finite automation. Every regular language is context free.<\/p>\n

8) Which of the following does not belong to the context free grammer?<\/strong>
a.\u00a0\u00a0 \u00a0Terminal symbol
b.\u00a0\u00a0 \u00a0Non-terminal symbol
c.\u00a0\u00a0 \u00a0Start symbol
d.\u00a0\u00a0 \u00a0End symbol
\u00a0
Answer = D<\/strong>
Explanation:Context free grammar consist of terminal symbols, non terminal symbols, set of production rules, a start symbol but does not have any End symbol.<\/p>\n

9) A regular grammar is a….. ?<\/strong>
a.\u00a0\u00a0 \u00a0Context free grammar
b.\u00a0\u00a0 \u00a0Non context free grammar
c.\u00a0\u00a0 \u00a0English grammar
d.\u00a0\u00a0 \u00a0None of above
\u00a0
Answer = A<\/strong>
Explanation: Regular grammar is context free grammar. Such a grammar restricts its rules to a single non terminal on the left hand side and right hand side consisting of a single terminal.<\/p>\n

10) The context free language are closed under… ?<\/strong>
a.\u00a0\u00a0 \u00a0Union
b.\u00a0\u00a0 \u00a0Kleene star
c.\u00a0\u00a0 \u00a0Concatenation
d.\u00a0\u00a0 \u00a0All of above
\u00a0
Answer = D<\/strong>
Explanation: Context free language is closed under union, kleene star and concatenation.<\/p>\n","protected":false},"excerpt":{"rendered":"

1) Context free Grammar is ? a.\u00a0\u00a0 \u00a0A Compiler b.\u00a0\u00a0 \u00a0A language expression c.\u00a0\u00a0 \u00a0A regular expression d.\u00a0\u00a0 \u00a0None of these \u00a0 Answer = B Explanation: Context free Grammar generate the context free languages. These are defined by the rule of the form A -> b Where A a non terminal and b is the…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_kad_post_transparent":"","_kad_post_title":"","_kad_post_layout":"","_kad_post_sidebar_id":"","_kad_post_content_style":"","_kad_post_vertical_padding":"","_kad_post_feature":"","_kad_post_feature_position":"","_kad_post_header":false,"_kad_post_footer":false,"footnotes":""},"categories":[6],"tags":[],"class_list":["post-29","post","type-post","status-publish","format-standard","hentry","category-ugc-computer"],"_links":{"self":[{"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/posts\/29","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=29"}],"version-history":[{"count":0,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/posts\/29\/revisions"}],"wp:attachment":[{"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=29"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=29"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=29"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}