BSc CS Sem 3 BSc CS Semester 3 (2020 2021) 2021 TOC Question Paper - Mumbai University | munotes
Loading PDF...
Older exam
2021 - WEBTECH
Semester-end · BSc CS Semester 3 (2020 2021)
→
Newer exam
2021 - OS
Semester-end · BSc CS Semester 3 (2020 2021)
→
Questions asked in this paper
The input alphabet can be represented by
with without |without
and and and and and
Finite State Machine . ft t t t t
given grammar |ns are Is not
Pumping lemma is generally used for proving |grammar |is not equivalen |None of regular
that isregular |regular |tornot |these
There are tuples in finite state
7|5*(q,ya) is equivalent to Ja) 6(q,ya) notation
single one |than one |than one |than one
When Context free grammar is called as derivatio |derivatio |leftmost gerivatio
ambiguous grammar? n tree for |n tree for |derivatio |derivatio |n tree for
might be |non
is . us us us these us
If productions of a grammar are S->AB, S- |sensitive |free normal |normal
then it is called as . grammar |grammar |form form form
If production of grammar G(V,T,P,S) are S
A->b then which is string of G
Which of the technique can be used to |Ogden’s |language |Pumping
that a language is non regular? theorem |Lemma Lemma
will be regular exression for {01,10}? |01*10
What will be regular exression for (atab+ab (atab+ab
In inverted halting machine if H is yes then infinite infinite
How many heads are there in multi part turing for one for all |two for none of for
19|machine? each tape |tape each tape |the above tape
How many tuples are used to define
When only one head is used for read and writes |turing turing turing tic turing |turing
tracks then that machine is called as? machine |machine |machine |machine |machine
In which type of turing machine there is multipart |determinis|multi track |determinis
separate actions are define for every state tic turing |turing tic turing turing
The first The first order
order theory of jorder theory of |theory of
theory of |Euclidean |theory of |the the
Which among the following are undecidable boolean |geomentr natural
input all finputall finputall all
are are are are are
and inputs inputs
machine is called as Decider . |rejected |rejected |rejected
Linear Bound automata is used to accept sensitive free sensitive
with without |without
and and and and and
Finite State Machine . ft t t t t
given grammar |ns are Is not
Pumping lemma is generally used for proving |grammar |is not equivalen |None of regular
that isregular |regular |tornot |these
There are tuples in finite state
7|5*(q,ya) is equivalent to Ja) 6(q,ya) notation
single one |than one |than one |than one
When Context free grammar is called as derivatio |derivatio |leftmost gerivatio
ambiguous grammar? n tree for |n tree for |derivatio |derivatio |n tree for
might be |non
is . us us us these us
If productions of a grammar are S->AB, S- |sensitive |free normal |normal
then it is called as . grammar |grammar |form form form
If production of grammar G(V,T,P,S) are S
A->b then which is string of G
Which of the technique can be used to |Ogden’s |language |Pumping
that a language is non regular? theorem |Lemma Lemma
will be regular exression for {01,10}? |01*10
What will be regular exression for (atab+ab (atab+ab
In inverted halting machine if H is yes then infinite infinite
How many heads are there in multi part turing for one for all |two for none of for
19|machine? each tape |tape each tape |the above tape
How many tuples are used to define
When only one head is used for read and writes |turing turing turing tic turing |turing
tracks then that machine is called as? machine |machine |machine |machine |machine
In which type of turing machine there is multipart |determinis|multi track |determinis
separate actions are define for every state tic turing |turing tic turing turing
The first The first order
order theory of jorder theory of |theory of
theory of |Euclidean |theory of |the the
Which among the following are undecidable boolean |geomentr natural
input all finputall finputall all
are are are are are
and inputs inputs
machine is called as Decider . |rejected |rejected |rejected
Linear Bound automata is used to accept sensitive free sensitive
Read from the scan above, so a character or two may differ. The scan is the original.
Something wrong on this page? Report it and we will check it against the scan.
Quick Help
No. The full paper opens straight away, with no login and nothing to pay.
Related Resources
Something wrong with this paper? Report it.
Connected Papers
BSc CS / Sem 3 · 72 papers
2017 - ATKT Combinatorics And Graph Theory
2017 - ATKT Database Management System
2017 - ATKT Operating System
2017 - ATKT Skill Enhancement Web Programming
2016 - ATKT COMPUTER III
2016 - ATKT COMPUTER II
2015 - ATKT Computer I
2014 - Comp I ADD
2014 - Comp II ADD 15 1
2014 - Comp III ADD
2014 - ATKT Comp III
2014 - ATKT Maths I
Questions? Email contact@munotes.in
Done!