BSCOER/INS/ACA/003

TSSM’s
BhivarabaiSawant College of Engineering and Research, Narhe, Pune-41
Department of Computer Engineering

Class & Division: TE A & B

Subject Name: Advance Data Structures (ADS)
Assignment No: 1 Batches No.:
Maximum marks for Assignment: Assignment Declaration Date:
Assignment Submission Date (on or before):
Assignment assessment declaration Date by faculty (on or before):
Level of mapping
Questio and Number Blooms
Question Statement Marks
n No. Level
CO PO PSO

Group C
Identify all possible regular expressions
for following where L = {0,1}*
i) The set & all possible string
Q1. containing 0 & 1. CO2 PO1 PSO2 2 4
ii) The set of all string that do not
end with “01”.

Explain the following terms with at least

one example
Q2 i) Kleene Closure & Positive Closure CO1 PO2 PSO1 2 4
ii) Difference between DFA & NFA

i)State a Regular expression for ∑={a,b}, W is

of length at most 3.
Q3 ii)State RE for strings containing at least one CO2 PO2 PSO2 1 4
occurrence of a & at least one occurrence of b.

Recognize extended transition function for

string 11001 for the following DFA.

Q4 CO1 PO4 PSO2 6 6

Design a FA accepting strings={aa, aab}

Q5 where ∑={a,b} CO1 PO4 PSO2 6

Write a short note on basic machines/ output CO1 - 1 4

Q6
machines.
Group B
 BSCOER/INS/ACA/003

TSSM’s
BhivarabaiSawant College of Engineering and Research, Narhe, Pune-41
Department of Computer Engineering
Consider following transition diagram, 5
PO2,
Q1 convert it to equivalent RE using Arden’s CO2 PSO2 4
PO4
Theorem.
Design Moore Machine that gives an output PO2, 5
Q2. CO1 PSO2 6
of 1 if i/p string ends in bab. PO4
Construct DFA for following RE 5
PO2,
Q3. i) (a+b)*abb CO2 PSO2 6
PO4
ii) (11)*.010.(11)*
Find RE for following FSM.

Q4. CO2 PO4 PSO2 3 5

Group A
Convert following NFA into its equivalent
DFA.
PO2,
Q1. CO1 PSO2 4 6
PO4

Construct a Moore Machine that gives an PO2,

Q2 CO1 PSO2 6 6
output of 1 if the input string ends in bab. PO4

Subject In-charge HOD