Professional Documents
Culture Documents
CR Cs 3: Differentiate
CR Cs 3: Differentiate
1 5TEARS
USN
CR cs 3 CMRIT
cAR STITUm or T E O O r , 1tALUu
[04 COlLI
(b) IDiscuss different types of motivation.
2 (a) Describe the steps in controlling process with an example. [08] Coi L2
(b) What are the different techniques used in controlling. 02 COL
[10] CO L2
3 (a) Explain the process involved in entrepreneurial process.
6 COL2
4 (a) Differentiate between Entrepreneur, Intrapreneur and Manager.
4] CO12
4(b) |Discuss the scope of entrepreneurship in India.
COL L2
the feasibility study for identification of business opportunity with [10
5 (a) Explain
Cxample [10 COL2
6 (a) Explain various theories of Motivation.
130 N
USN CR Cs 2S
(b) Explain setjmp and longjmp APls with an example program [05 CO3 L3
[O5] CO2 LI
4 (a) Explain test command and its shortcut with example
[0s] CO2 L3
(b) Explain if control statement" syntax with a suitable shell script example
be initiated and how process can be [10 CO3 LI
5 Explain with a neat diagram how process can
terminated
P T-0
CO3 L2
How is a view created and dropped? What problems are associated with updating 10
of views2 [10] CO2 L2
Discuss how each ER model can be mapped to the relational model.
(10) CO2 L3
For the relations provided in company database in Q1, write relational algebra
6
queries for the following:
List the name of all employee with at least two dependents.
number employee who do not work on project
11. ind the employee of
comp2.
11. Retrieve the name of manager who do not have female dependents.
with the same
iv. List the names of all employees who have a dependent
name as themselves.
V. Retrieve details of employee working on both comp3 and comp4 project
numbers. [06) CO2 L2
how the different update operations deal with constraint violations.
7 (a) Explain
[04] Co3 L3
relation algebra expression.
(b) Write the SQL query for the following
i. Bdate. Address( OFname="John' and Lname="Smith(EMP)
I (a) Convert the following DFSM into a regular expression. Show steps. [6) CO2 L3
a,b
1
92
q3
0
(b) Construct an NDFSM using Kleene's theorem for (a (b U E) b)*. Show steps 4] CO2 L3
2 (a) State and prove pumping lemma for regular languages. Prove that a'b": n 2 1 is [05] CO03 L2
not regular.
(b) Convert the following FSM into a regular expression. Show steps [05] CO2 L3
3 (a) Define CFG. Write CFG for the following languages. Show derivation for given [8] CO3 L3
strings.
All strings over {a,b} that are even or odd palindromes., w = ababa,
)
w-baab
M
02 CO3 L2
tree for w= 100101
(6) For the given grammar, draw parse
S OS1 10 SS
[07] CO3 L3
Write computation/instantaneous
4 (a) Construct PDA for L =
{a"b", n>=1}.
aabbbb
description(ID) for
=
w
[03] CO3 L2
of PDA with a neat diagram.
Define a PDA. Explain the working principle
(b)
L3
PDA for L= {a"'b'a"b": n,m2 1}. Write [10 CO3
Define and construct
abaabb
computation/instantancous description for w=
[10) C02 L3
L and M are regular
the closure properties of regular languages. If
State
LOM and L-M, are also regular.
languages, prove that
[7 CO3 L3
Write regular grammar for the following languages.
7(a) Define regular grammar.
ofa's and b's not containing
aab as a substring.
) Strings
of0's and 1's ending with 1101.
(i) Strings
CO3 L3
is ambiguous for
grammar? Prove that the following grammar
(b) What is ambiguous
the string "abababa ", SSbS a