Scribd
Upload
120 views2 pages

The International University of Scholars: Department of Computer Science & Engineering

This document contains a mid-term exam for a theory of computation course. The exam consists of 6 sections with multiple choice questions, fill-in-the-blank, short answer, and problem solving questions covering topics like formal languages, automata theory, computability theory, and graphs. Students are asked to determine properties of deterministic and non-deterministic finite automata, define related concepts formally, draw state diagrams, and perform calculations involving functions.

Uploaded by

GK Kaderye
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
120 views2 pages

The International University of Scholars: Department of Computer Science & Engineering

This document contains a mid-term exam for a theory of computation course. The exam consists of 6 sections with multiple choice questions, fill-in-the-blank, short answer, and problem solving questions covering topics like formal languages, automata theory, computability theory, and graphs. Students are asked to determine properties of deterministic and non-deterministic finite automata, define related concepts formally, draw state diagrams, and perform calculations involving functions.

Uploaded by

GK Kaderye
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

The International university of Scholars

Department of Computer Science & Engineering


Mid-Term Exam – Fall, 2018
Course Code: CSE 2213 Marks: 30
Course Title: Theory of Computation Time: 90 minutes
[N.B: Answer all questions]
1. State whether the following statements are true or false. If False, write the correct answer: - (3 points)
(a) A language is a set of alphabets.
(b) NFA is not equal of Є – NFA.
(c) In a DFA, for a particular input character, machine goes to one state only.
(d) In NFA null (or ε) move is not allow.
(e) Cryptography is used in computability theory.
(f) Every DFA is NFA but not vice versa.
2. Fill in the blanks with proper answer: - (2 points)

(a) A set is a group of objects represented as a ______.


(b) In ________ theory, computer problems come in different environments: some are easy, and some are hard.
(c) The ______ set of A is the set of all subsets of A.
(d) The ______ of a function come from a set called its range.

3. Choose the best answer from the alternatives: - (3 points)


(a) (From figure- 1), The following deterministic finite automata recognize:
i) Set of all strings containing ‘babbba’ ii) Set of all strings containing ‘babb’
iii) Set of all strings ending in ‘babab’ iv) None of the above

(b) (From figure- 1) If a = 1, b = 0, then what is correct answer?


i) 10011 ii) 10101 iii) 10110 iv) 10111

(c) (From figure- 1), which is correct?


i) two or more ba’s ii) three or more babb’s iii) two or more a’s iv) three or more b’s

(d) In DFA, this very state is like dead-end non final state:
i) ACCEPT ii) REJECT iii) DISTINCT iv) START

(e) The production of form non-terminal ε is called:


i) Sigma Production ii) Null Production iii) Epsilon Production iv) All of the mentioned

(f) The number of tuples in an extended Deterministic Finite Automaton:


i) 5 ii) 6 iii) 7 iv) 4

4. Answer the following questions: - (4 points)

(a) Write the formal definition of DFA.


(b) What are the difference between DFA and NFA?
(c) Write the formal definition of NFA.
5. Problem solves (13 points)
5.1. Let A be the set {x, y, z} and B be the set {x, y}. (2 points)
(i) Is A a subset of B? (ii) Is B a subset of A? (iii). What is A × B? (iv). What is the power set of B?

5.2. If A has a elements and B has b elements, how many elements are in A × B? Explain your answer. (1.5 point)

5.3. If C is a set with c elements, how many elements are in the power set of C? Explain your answer. (1.5 point)

5.4. Consider the undirected graph G= (V, E) where V, the set of nodes, is {1, 2, 3, 4} and E, the set of edges, is
{{1, 2}, {2, 3}, {1, 3}, {2, 4}, {1, 4}}. Draw the graph G. What are the degrees of each node? Indicate a
path from node 3 to node 4 on your drawing of G. (1.5 points)

5.5. The formal description of a NFA, K is {{A,B,C,D}, {0,1}, A, {C}}, where δ is given by the following table.
Give the state diagram of this machine. (5.25 points)
0 1
A {A,B} {A, B}
B {C, D}
C
D D {D, C}

(a) Draw the NFA machine. Now convert NFA to DFA. Suppose string, A = 0010. Now justify L(M) = A or
L(M) != A, where mention the every characters with diagram step by step.

(b) Answer the below questions, apply on DFA machine


a. What is the start state?
b. What is the set of accept states?
c. What sequence of states does the machine go through on input 1100?
d. Does the machine accept the string 1100?
e. Does the machine accept the string ε?

5.6. Let X is the set {1, 2, 3, 4, 5} and Y be the set {6, 7, 8, 9, 10}. The unary function f: X−→Y and the binary
function g : X ×Y −→Y are described in the following tables. (1.25 points)

n f(n) g 12 14 16 18 20
2 12 2 20 20 20 20 20
4 14 4 14 16 18 20 12
6 12 6 14 14 16 17 18
8 14 8 18 16 14 12 20
10 12 10 12 12 12 12 12

a. What is the value of A =? Where A= f (8) – f (4).


b. What are the range and domain of f?
c. What is the value of B =? Where B= A + g(6, 18).
d. What are the range and domain of g?
e. What is the value of C =? Where C= B + g(8, f(8))?

6. Write shorts note on: - (5 points)


a) The Regular operations
b) Automata theory
c) Computability theory
d) String and Language
e) Graphs

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy