DEPARTMENT OF INFORMATION TECHNOLOGY
CS – THEORY OF COMPUTATION EX-02/REV-00
INTENSIVE COACHING TEST- 1(UNIT -1)
Year / Sem : II / IV (A & B & C category) Session : FN
Date : 25.04.2025 Max Mark : 100
Time : 3 Hours
PART A (10×02=20MARKS)
Sl.N
Questions Blooms CO
O
1. Define Finite automata. R 4
2. Define induction Principle. R 4
3. Define NFA A 4
4. Define Directed graph C 4
5. Define Palindrome R 4
6. Define Finite state system U 4
7. Define relation. R 4
8. Define DFA R 4
9. Define transition diagram AP 4
10.
Define string. AP 4
PART B (5×16=80MARKS)
a. Obtain the DFA equivalent to the following NFA.(16)
R 4
OR
b.Convert to a DFA the following NFA.(16)
11.
0 1
P {p,q} {p}
AP 4
q {r} {r}
r {s} Φ
*s {s} {s}
12. a. Find the E-Clasure.(16) A 4
i.
ii.
Compute the Ɛ -Closure(ab)
OR
a. Find the FA Without Ɛ-Transitions for the following figure.(16)
R 4
a .Construct the following Ɛ-NFA .(16)
Ɛ a b c
P Φ {p} {a} {r}
q {p} {q} {r} Φ AP 4
r {q} {r} Φ {p}
13.
a).Compute the Ɛ-Closure of each state.
b). Give all the strings of length three or less accepted by the automation.
c). convert the automation to a DFA.
OR
a. Draw deterministic finite automata recognizing the language containing string that
are multiple of 4 when represented in binary. Test your DFA using any two string of
U 4
the language.(16)
a.Draw a deterministic finite automata recognizing the language
corresponding to the regular expression (a+bca*)*. Test your DFA using any AP 4
14. two string of the language . (16)
OR
b. Describe the closure properties of regular language . (16) U 4
15. a.Give deterministic FA accepting the following language over the alphabet. AP 4
(16)
1) Number of 1’s is a multiples of 3.
2) Convert the following NFA to a DFA .
a b
P {p} {p,q}
q {r} {r}
*r {Φ} {Φ}
OR
b.Constrct a minimal state DFA.(16)
0 1 0 1
A B E a H B
B C F H 1 C
*C D G *I A E
U 4
D E H
E F 1
*F G B
R- Remembering, U- Understanding, Ap- Applying, A- Analyzing, E- Evaluating, C- Creating
FACULTY INCHARGE HOD PRINCIPAL
DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING
CS3354 – DATA STRUCTURES AND OOPS EX-02/REV-00
INTENSIVE COACHING TEST- 2 (UNIT -4)
Year / Sem : II / III (A&B category) Session : FN
Date : 09.11.2022 Max Mark : 100
Time : 3 Hours
PART A (10×02=20MARKS)
Sl.NO Questions Blooms CO
1. Define non linear data structure. R 4
2. What is binary tree? R 4
3. Difference between binary tree & binary search tree. A 4
4. Define complete binary tree and give the binary tree node structure. C 4
5. Give the pre & postfix form of the expression (a+((b*(c-e))/f). R 4
6. Define collision in hashing. U 4
7. What are the applications of hashing? R 4
8. What is rehashing & extensible hashing? R 4
9. Define binary tree and give the binary tree node structure. AP 4
10. What are the different types of traversal? AP 4
PART B (5×16=80MARKS)
a. Define tree. Explain the tree traversals with algorithms and examples.(16) R 4
11. OR
b. Construct an expression tree for the expression (a+b*c)+((d*e+f)*g). Give
AP 4
the outputs when you apply pre order, inorder and postorder traversals. (16)
a. Write an algorithm to find an element from binary search tree.(16) A 4
12. OR
b. Write a program to insert and delete an element form binary search tree.(16) R 4
a . What are the different traversal techniques? Explain with examples.(16) AP 4
13. OR
b. Construct an expression tree for the expression ab+cde++*. What is the
U 4
expression tree and construct the expression tree.(16)
a. Construct a hash table by inserting give sequence of elements 54, 26,
AP 4
93,17,77,31,44,55,20 using linear probing method. (16)
OR
14.
b. Construct a hash table by inserting and reduce collision for the given
sequence of element 113,117,97,100,114,108,116,105,99 using quadratic U 4
probing method. (16)
a. Using the hash function “key mod 7” insert the following sequence of keys
AP 4
in the hash table 50,700,76,85,92,73,101 using separate chaining method.(16)
15.
OR
b. Difference between separate chaining vs open addressing.(16) U 4
R- Remembering, U- Understanding, Ap- Applying, A- Analyzing, E- Evaluating, C- Creating
FACULTY INCHARGE HOD PRINCIPAL
