No.

P-474
SET/CS-IT/BT/C-503
B. Tech. (Fifth Semester)
EXAMINATION, 2021-22
(New Course)
Paper Third
DESIGN AND ANALYSIS OF ALGORITHM
Time : Two Hours ] [Maximum Marks: 70
Note : (0) Attempt any five questions from Section A and
any threequestions from Section B.
(i1) Answer each question of Section A within
50 words.

(ii) Limit your answers within the given answer

book. Additional answer book (B-Answer book)
should not be provided or used.
Section--A
Note :Attempt any five questions. Each question carries
5 marks.

y What is an algorithm ? Discuss its various properties

characteristics.
P.T.O.
 P-474
[21
Big omega (2) notation
Find the Bigtheta (0)and
for the following :

(a) f() - 14 *7 + 83
(6) f(n) = 83r +84n
(c) f(n) = n +n
(d) f(n) = 13n +8
3. Diferentrate between Depth First Search (DFS) and
Breadth First Search (BFS).
4. What is a graph ? Give ts definition. How is it
different from tree ?
$. Explain Red-Black tree with example.
6. Illustrate the performance of the heap-sort algorithm
on the following input sequendes :
{2, 5, 16, 4, 10, 23, 39, 18, 26, 15}
7. What is NP completeness ?
Section-B
Note : Attempt any three questions. Each question carries
15 marks.
1. Differentiate between Dynamic programming and
Divide and congure approach.
2. Create B-tree of order 5 from the following lists :
30, 20, 35, 95, I5, 60, 55, 25, 5, 65, 70, 10, 40,
50, 80, 45
Also explain why B-tree with minimum degree of 1 are
not alloweded.
 [3] P-474

3. (a) Determine longest common sub-sequence from

the given below :
() P= {A, B, C, D, B, C, D,C, D, D},
Q-{B, C, D, , D}
(i) P ={1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1},
Q={0, 1, 1, 0}
b) What is travelling salesman problem ? Discuss its
solution with Greedy approach.
4. (a) Find the minimum spanning tree of the following
graph using Kruskal algorithm

11
6
10

(b) Write psedo codes for Prim and Kruskal's

algorithm.
5. Write short notes on the following:
(i) FibGnacci heap
(ii) Binomial heap
(iii) Back tracking

P. T. 0.
 [4] P-474

6. Write down master theorem and solve the following

using it (any wo) :

(a) T(a) =2r+

() T(n) - 4To()
() T(n) =ST"+n ()
() T(*) = 2T| o(a)

P474
110
 Roll No. ..29).3.9S939o 2

P-475
SETIITIBT/C-504
B.Tech. (IT) (Fifth Semester)
EXAMINATION, 2022-23
Paper Fourth
THEORY OF AUTOMATA AND FORMAL
LANGUAGES
Time: Two Hours ] [ MaximumMarks: 70
Note : (i) Attempt any five questions from Section A and
any three questions from Section B.
(i) Answer each question of Section A within
50 words.
(iii) Linmit your answers within the given answer
book. Additional answer book (B-Answer book)
should not be providedor used.
Section--A

Note :Attempt any five questions. Each question carries

5 marks.

1. Define DFA and design a finite automaton that

recognizes all strings of 0 and I having substring as
010 over an alphabet {0, 1}.

P.T. O.
 [21. P-475

2. What is regular cxpression ? Write regular expression

that represents
() we fa. b}* such that w s5.
b} such that w does not have two
(ii) wE {a, b.
consecutive a's and starts with
Arden's theorem to find regular expression for
3. Apply
the following :
0, 1

q3

with
Normal Form of grammnar
gran
4.
Define Chomsky context
example. productions in a
you remove null
will
5. How
grammar ? Give example. construct an equivalent
free automaton,
following
6. For the oftype-3.
grammar

b
b
 [31 P-475

7 Define transition function in Turing machinc. Design a

Turing machine that recognizes the language 00* over
an alphabct {0}.
SectionB
Note : Attempt any three questions. Each question carries
15 marks.
(a) Find the language described by the regular
expression aa*bb*cc* for a, b, c e (An
alphabet).
(b) Convert the following NFA to its equivalent
DFA.

Inputs
States
1
lg1, 92}
{92} (91:92}
42 93} (go}
93 {43}
9. (a) Differentiate between Mealy and Moore finite
state machine.
(b) Covert the following Mealy machine into an
equivalent Moore machine.

O/0
q0 ql
1/1

1/0

1/0
P. T. 0.
 [4] P-475

10. (a) With the lhclp of an example explain the

climination method for converting a FA having
more than one final state to its equivalent regular
expression.
(b) Design a PDA for the language :
L={wwyk | we{0,1} and w* is reverse of w}
11. (a) Chomsky's hierarchy of
(b) Reduce the following
grammars.
grammar into Chomsky
Normal Form.
G=({S, A, B}, {a, b}, S {S ASB,
A’aAS ae, B ’ Sbs A|bb} )
12. (a) How to define
transitions in Turing machine ?
Explain ID representation of Turing
example. machine with
(b) Design Turing machine that
L= {01" | n 1}.
accepts the language
13. Write short notes on
any two of the
(a) Universal
Turing machine
following
(b) Pumnping
lemma for regular sets
(c) Myhill
Nerode theorem
(d)
Anbiguityof Context free grammars
P-475
70
 Roll No...9!32O.30o4

P-475
SET/CS-IT/BT/C-504
B. Tech. (IT/CS)(Fifth Semester)
EXAMINATION, 2021-22
THEORY.OF AUTOMATA AND FORMAL
LANGUAGE

Time : Tvo Hcurs ] [Maximum Marks : 70

Note : (i) Attempt any five questions from Section A and

any three questions from Section B.
(ii) Answer each question of Section A within
50words.
(iii) Limit your answers within the given answer
book. Additional answer book (B-Answer book)
should not be provided or used.
Section--A

Note : Attempt any five questions. Each question carries

5 marks.

. Furnish two difference between NFA and DFA.

P. T. O.
 ,9. 2.
Construct
suitable 8. Note 1. 6. S. 4. 3.
{a, language : L= all Discuss
Construct Discuss
DiscussDefine Discuss
gramimars.
Construct :Attempt
marks. 15 parameters
b}, Set
S p of ambiguity the
PDAOfline
,p, all DFA Chomsky
equivalent any HP
{9, string with
s}),
L=ab"c"
:n>0 three of
for Turing (Halting
Section--B over
DFA: example. in
where DFA the CFGs. hierarchy
grammar questions. [21
9,
s} (a, following Machine. Problem)
8 for b}
is not
given NFA Each of
for ending language of
M= Turing phrase
below the question
({p, in
following aa. and Machine.structured
:
4, carries define P-475
r,
s},
 [31

L0. Consider a grammar G whose production rules are :

S ’OB| 1A, A ’ ojoS|1AA, B ’ 1|1S|OBB. Find
(a) leftmost and (b) rightmost derivation for string
00110101 and construct a derivation tree.
11. Find equivalent grammar in Greibach normal form
(GNF) for the following gramnmar.
S’ AA 0, A ’SS|i

12. Find the regular expression reconized by DFA shown

in below: aa+ bb)

A B
b aub
L b a
b b

o1s1

P-475
 Roll No. 29l34.5Q.39.!.2

P-471
SET/IT-CS/BTIC-501
B. Tech. (IT/CS) (Fifth Semester)
EXAMINATION, 2022-23
DATABASE MANAGEMENT SYSTEM

Time : Two Hors ] [Maximum Marks:70

Section A and
Note : (i) Atempt any five questions from
B.
any three questions from Section
A within
(ii) Answer each question of Section
50words.
given answer
(iii) Limit your answers within the
book. Additional answer book (B-Answer book)
should not be provided or used.
Section-A

carries
Note :Attempt any five questions. Each question
5 marks.
based
1. Discuss different architectures of DMBS
applications.
P. T. O.
 (2) P-471

2. Discuss various components of Query Processor and

their role in DBMS.
3 Define the concept of Super Key, Candidate Key and
Primary Key in E-R Model.
4. Write a query (using relational algebra) to find the
second max account balance at the Delhi branch from
Account relation:

Account (account number, branch name, balance).

5. Define Armstrong's Axioms in DBMS. What is their
use in DBMS design ?
6. Define a Transaction in DBMS. What are the essential
properties which DBMS need to maintain for a
Transaction ?
7. Define Conflict Equivalent Schedules with appropriate
examples.
Section-B

Note :Attempt any three questions. Each question carries

15 marks.

8. (a) What are the problems with traditional File

Processing System for data storage ? How DBMS
overcomes these dificulties ?
 (31 P-471

(b) Explain the following :

() Disjoint Generalization
(i) Agregation in E-R Model
Define Extraneous Attributes and Canonical Cover of
Functional Dependency Set. Consider the following
functional dependency set F on schema (A, B, C) and
calculate the canonical cover of F:
A’BC

B’C

A’B

AB’C

10. (a) Define Referential Integrity Constraint with

example in SQL.
(b) What are the different types of DDL and DML

statements available in SQL ? Explain where

these are used.

11. (a) What is. Normalization ? What is the role of

normal forms in Normalization ? Kindly explain
INF and 2NF with an example.

P. T.O.
 [4) P471

(b) What are the desired propertics of an ideal

decompositión of any relation ? Explain each in
detail.

12. (a) What are Schedules, Serial Schedules and

Serializable Schedules ?
(b) Define the following :
(i) Cascadeless Schedules
(ii) Cascading Rollback
(iii)) Blind Writes inSchedules

13. Write short notes on any three of the following :

(a) Multivalued Attributes and Composite Attributes
(b) Participation and Cardinality of Relationship
(c) Triggers
(d) Assertions

(e) Strict Two-Phase Locking Protocol

() Testing for Serializability

P471 120
 Roll No.

P-471
B. Tech. (Fifth Semester)
EXAMINATION, 2021-22
DATABASE MANAGEMENT SYSTEM
Time : Two Hours] [ Maximum Marks : 70
Note : (i) Attempt any five questions from Section A and
any three questions from Section B.
(i1) Answer cach question of Section A within
50words.
(il) Linit your answers within the given answer
book. Additiona! answer book (B-Answer book)
should not be provided or used.
Section--A
Note :Attempt any five questions. Each question carries
5 marks.

A. What is Redundancy ? Explain the anomalies in

relational database.
Explain natural join with an example.
P.T. O.
 (2] P71
3. Let R=(A, B, C, D, E, F) be a relation schema with
the following functional dependencies :C ’ F,
E A. EC ’ D, A ’ B. What is the
primary key
of R ?
4. Describe the properties of a relation.
5. What is Functional Dependency ? Explain it briefly.
6. What are the advantages of DBMS ?
7. Distinguish between primary and super keys.
Section--B
Note : Attempt any three questions. Each question carries
15 marks.

1. (a) Discuss in detail about the concepts ofE-R model

with suitable examples.
(b) Draw and explain the detailed system architecture
of DBMS.

2. (a) Explain in detail about various key constraints

used in database system.
(b) State INE, 2NF and 3NF and explain with
examples.
3. (a) Write and explain the structure of SQL SELECT
statement with suitable example.
(b) Compare the database system with conventional
file system.
 [31

4. (a) By considering suitable examples, describe the

usage of SQL CREATE and ALTER statements.
(b) What is serialization ? Explain it.
5. (a) List and explain aggregate functions used in SQL
with examples.
(b) Explain insertion, deletion, and modification
anomalies.

6. (a) What is degree and cardinality of a relation ?

Explain with an example.
(b) What is an integrity constraint ?
Explain its
enforcement by DBMS with an illustrative
example.

P-471 l10