Questions with Complete Solutions - Hamro CSIT

Does machine always refer to hardware? Justify. Define positive closure and Kleene closure.

Not Answered No Subject Asked on 2081 Exam

Define the language of a grammar. For the grammar S → 0S0 | 1 | ε, show the leftmost derivation for the string 00100 with its parse tree.

Not Answered No Subject Asked on 2081 Exam

Represent the following regular grammar to finite automata.
S → aA | aB | ε
A → aA | aS
B → bB | ε

Not Answered No Subject Asked on 2081 Exam

Design the DFA that accepts binary string ending with “00” and show its extended transition function for the string 111000.

Not Answered No Subject Asked on 2081 Exam

Convert the following grammar to CNF.
S → AAB, A → aA | ε, B → ab | a

Not Answered No Subject Asked on 2081 Exam

Differentiate between Class P and Class NP problem. Mention the transition function of DFA, NFA, and ε-NFA.

Not Answered No Subject Asked on 2081 Exam

Define ε-closure of a state. Differentiate between Moore and Mealy machine.

Not Answered No Subject Asked on 2081 Exam

What is undecidable problem? Discuss about Post Correspondence Problem.

Not Answered No Subject Asked on 2081 Exam

For the following Turing Machine, test whether the string “( ) ) )” is accepted or rejected and represent it in transition diagram.

State X Action (Write, Move, New State) Y Action (Write, Move, New State) B Action (Write, Move, New State)

q₀ ( X,R,q₁ , , , ,

q1 ) X,L,q₂ $Y, L, q_{2}$ Y,L,q₂

q2 X X,R,q₀ Y Y,R,q₃ ,

q3 , , , , ,

Not Answered No Subject Asked on 2081 Exam

Define Turing machine as enumerators of strings of a language. Encode the Turing machine TM = ({q₀, q₁, q₂} , {a, b}, {a, b, B}, δ, q₂, B, F) with input w = ba and δ is defined as follows:
δ(q₀, b) → (q₁, b, R), δ(q₁, a) → (q₂, a, R), δ(q₂, a) → (q₁, a, R), δ(q₂, b) → (q₂, b, L)

Not Answered Fourth Semester Asked on 2081 Exam

HAMROCSIT.COM

Copyright 2024 | HAMROCSIT.COM | All Right Reserved - Nymna Technology