KINGDOM OF SAUDI ARABIA | JAZAN UNIVERSITY
COLLEGE OF ENGINEERING & COMPUTER SCIENCE
ASSIGNMENT - I
Academic Year 2024-2025 Semester Second
Course with code Computer Security & Privacy / COMP–535 Section 2655
Type of Assignment Theoretical (Home Assignment) Marks 10
KINGDOM OF SAUDI ARABIA | JAZAN UNIVERSITY
Date of Announcement 10-02-2025COLLEGE OF ENGINEERING & COMPUTERDeadline
SCIENCE 28-02-2025
ASSIGNMENT I - 2024-2025
ASSIGNMENT PROBLEM STATEMENT
Academic Year 2024-25 Semester First
Course with code Theory of Computation (535 COMP) Section 1257
Answer
Type the following
of Assignment questions. Each question carries an equal mark.
Individual Marks (5 x 2 = 10
10Marks)
Date of Announcement 25-9-2024 Deadline 30-10-2024
1. a) Write the regular expression for: w| w has aodd number of b’s and each a is followed
by at least one a or one b.
ASSIGNMENT PROBLEM STATEMENT
b)Show the steps to convert NFA to DFA.
Answer All Questions.Each question carries TWO marks.
1. a) Convert the given NFA to DFA.(Show the steps)
b) Write the regular expression for: Any no. of a followed by any no. of b followed by any no. of c.
2. a) Let G = (V,Σ,R,S) be the following grammar. V = {S,T,U}; Σ = {0,#}; and R is the set of rules:
2. Write the CNF for the given context-free grammar.
S→AAC S→TT|U
T → 0T | T 0 | #
A→aAb|€
C→aC|aU → 0U00 | #
3. Show that the language L={0m1n 0m+n m>=1 and n>=1}is not regular using pumping lemma.
(i)Describe L(G) .
4. Check the ambiguity for the string ((0)) in the given grammar:
S→ (A)
(ii)Prove | 0L(G) is not regular.
that
A→SB
B→, SB| €
3.5. Use the pumping
Convert lemma to show that the following languages are not context free.
the following:
a) Given DFA to {0nRE
1n0n1n| n ≥ 0}
4. Check the ambiguity for the string ((0)) in the given grammar:
S→ (A) | 0
A→SB
B→, SB| €
5. a)Given RE to DFA
(0+11)* . (010+110) . (00+1)*
b) Given RE to DFA
(0+1)* . (010+101) . (0+1)*
Name of the Course
Ms.Sameena Shaik Signature
teacher
b)Given DFA to RE
Name of the Course teacher Dr.Shermin Signature
