Questions with Complete Solutions - Hamro CSIT

Differentiate Kleene closure from positive closure. For ∑ = {0,1}, compute ∑^* and ∑².

Not Answered Fourth Semester Asked on 2080 Exam

Define epsilon NFA. Configure equivalent epsilon NFA for the regular expression (ab U a)^*.

Not Answered Fourth Semester Asked on 2080 Exam

When a grammar is said to be in CNF? Convert the following grammar to CNF:

S → 1A | 0B | ε

A → 1AA | 0S | 0

B → 0BB | 1 | A

C → CA | CS

Not Answered Fourth Semester Asked on 2080 Exam

How a Turing Machine works? Construct a Turing machine accepting the language L = {(ⁿ)ⁿ}. Also show the transition diagram of the machine. Illustrate whether a string (()) is accepted by the Turing machine or not.

Not Answered Fourth Semester Asked on 2080 Exam

What is deterministic pushdown automaton? Configure a pushdown automaton accepting the language, L={w C w^R | w ∈ (0,1)^*}. Show instantaneous description of strings 011C110 and 10C10.

Not Answered Fourth Semester Asked on 2080 Exam

Define the extended transition function of DFA. Draw a DFA accepting language L = {1ⁿ | n = 2, 3, 4…. }. Show acceptance of strings 1110011 and 1110 using extended transition function.

Not Answered Fourth Semester Asked on 2080 Exam

Explain constraints and characteristics of specialization and generalization of data model.

Not Answered Database Management System Asked on 2080 Exam

Define Transaction and explain its desirable properties.

Not Answered Database Management System Asked on 2080 Exam

Differentiate concept of Centralized and Client/Server Architectures for DBMSs with suitable example.

Not Answered Database Management System Asked on 2080 Exam

Why do we need database recovery? Discuss shadow paging technique for database recovery.

Not Answered Database Management System Asked on 2080 Exam

HAMROCSIT.COM

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