CENTRAL UNIVERSITY OFODISHA

DEPARTMENT OF COMPUTER SCIENCE

THIRD MID-SEM EXAMINATION-2024
TIME: 1Hour
SUBJECT: Theory of Computation (MCS-101) FULL MARK: 15
SEMESTER: 1
(Answer All)

'0' or l' and end with

I. L= {ww is a string accepting all the strings beginning with (3x2.5=7.5 Marksl
"01'}
Construct NFA for the above language and the correspondence transition
a)
table.
b) Construct the DFAof Q1.(a) and the correspondence transition
table.
c) Find the proper regular expression of the above language.

2. L= {whw is a string accepting all the strings end with '10' or "0'.}
[3×2.5=7.5 Marks]
a) Construct NFA for the above language and the correspondence transition
table.
b) Construct the DFAof Q2. (a) and the correspondence transition table.
c) Find the proper regular expression of the above language.

----All The Best-

& For any wrong questions, justify your

thoughts.
 For sUBJECT:
1. SEMESTER: NTRAL
1"
any your Give AIVERSE
ong e) d) c) b) a)
The The 0.The The The stringNFA's Theory
ns.
string
strings set set set is
of
of acceptingof
ofaccepting Computation
tify in
where all all all CENTRAL
DEPARTMENT
COMPUTER OF
which strings
strings strings SECOND
your orthe
the (MCS-101)
hts. each containsin
beginning not:strings
----All
Best---
The second which
string (Answer MID-SEM
All)UNIVERSITY

last
over
the a
must substring with
bit third the EXAMINATION
contain
11" is 101.alphabets
symbol
1.
1110. OF
SCIENCE
ODISHA
from {0,1}
followed
"00".by 2024
the then
right MARK: Hour 1
FULLTIME:
15
verify
end
Marks]
(3×5
whether
is
always
 ?
For 8. L3. .
any
4r
Define
aexamples.
relevant SEMESSTER:
SUBJECT:1M
QuestionCheck
4. NERSIi
tor
withDefine Explain
wrong
11010011 c) a)
Give proper Define
0010100101 b) a)
b)DFA's
questions, 1010010100 whether The The Deterministic the the Theory
regular with
set set terms term
accepting any of
justify the of of language Computation
all all "Languages
Strings"5-different
your
given stringsstrings CENTRAL
DEPARTMENT
Finite FIRST
the
thoughts. input with (MCS-101)
---All
Best---
The beginning
not strings Automaton. and MID-SEM
strings
containing their Alphabets" proper in All)
over the (AnswerUNIVERSITY
OF
below concept
examples EXAMINATION
with the relevant COMPUTER
Explain
110alphabets
101.
are "Transition in of
accepted of
the Automata OF
the
concept regular SCIENCE
ODISHA
{0,1}: term 2024
by table".
"Transition languages.
the of Theory.
Automata
above MARK: 15
FULLTIME:
Hour 1

[3-Mark]DFAs [6-Mark] diagram"

[2-Marks] [2-Marks]Theory2-Marks]
in
of
 3. 2. 1.
escribe Explain
Summarize

fferent Three SUBJECT:

SEMESTER:2nd
different
layer
types
architecture
types Database
CENTRAL
DEPARTMENT
SECOND
of
guages of Management
attributes MID-SEM
of
(AnswerAll UNIVERSITY
database Questions) ODISHAOF
used OF
and System
EXAMINATION
for COMPUTER
rammatic
management
abase? (MCS

221)

SCIENCE
notations
system 2023-24

with
used
proper
in 1Hr.
FULLTIME:
ER
diagram. MARK
model?
:
15

(5) (5) (5)

 Employee
8. 2b. 5.To t 3/ 2.
SelectSelectSelect To To Design
Tothe
display display
display
name, display Salary
count sum min 108 105 103 102 101
Ecode
(salary)(doj)number nanedetailsabovetwo SEMESTER:2nd
SUBJECT:
(distinct
and
designation and of Mansi RahulSachin ViratSourav
and of Name DatabaseCENTRAL
sgrade) employee all
maxdesignation tables
average employee DEPARTMENTOF
COIPUTER
SCIENCE
(dob) SO3 S02 SO1 EXAMINATION
END-SEMLAB
from and Sgrade CEO GMHead-IT
Receptionist Executive Management
and
from
(salary)working insert Designation
employee. sgrade of in
those Questions)
(AnswerAll UNVERSI
employee. descending 40000 24000 34000
above System
employee.
from in of
employees Salary
eachthose records SO1 S02 S03 S02 S03 (MCS
order
Sgrade lY
salary
employee 221) OF
whose
from of as 10000 8000 12000 2013-02-18
2006-03-17 2003-05-08
2001-01-10
2004-07-20
their is.it HRA
ODISHA
2023-24
table whosgrade
joining. DËo
joined
employee. is
either 1978-03-05
1967-12-28
1970-01-25
1960-11-22
1985-07-16
in TIME:
1Hr.
MARK
FULL:40
th'eS02' Dob
year
2001'. or
'S03".
 CENTRAL UNIVERSITY OF ODISHA
DEPARTMENT OF COMPUTER SCIENCE
FIRST MID-SEM EXAMINATION- 2023-24
SUBJECT: Database Management System (MCs 221)
SEMESTER: 2nd
TIME: 1Hr.
FULL MARK : 15
(Answer AllQuestions)

1. Define Database and Database Management System. Explain in detail about advantages a
disadvantages of Database Management System, (5)
2. Define Model. Explain in detail about different types of model used in database. (5)
3.

Playerld PlayerName Country TotalMatch

101 Sachin India 348
102 McGrath Australia 280
103 Junty South Africa 260
104
Jaysurya Srilanka 290
105 Sourav India 310

a)Create a table Player with above attributes and insert the records as shown.
b) Retrieve Country' of all players without any repetition.
c) Display PlayerName and their corresponding Ids who belong to 'India'.
d) Retrieve the record details where PlayerName starts with 'S'.
e) Modify the record which is having Country 4s 'Australia" to AUS'. (5)
 {5) (1) (1)
semaphores: different
thethewhich processprocesses
by begins,
imposed at
(Explain)? from statement,of
execution set set of
shared type
("D") statements
constraints the
[Process
3]
(V) goto
L3
:waitL3 this
2024 when
(MCS-104) () when
ODISHA
SEPTEMBER program two oncewait
SCIENCE printed
access but the printed
a
thatin
SYSTEMS above sequentially,
with
can stuck
assume are
OF COMPUTER are
the that ("A")
type signal
(v)
("B")
type consistent C's D's
UNIVERSITY
EXAMINATION questions) [Process
2] :wait are
15MARK:
FULL
OPERATING executing processes L2
(V) L2
goto
TIME:
1Hours processes many many
below
fork(): executed
3
any
that's how how
|| questions
OF fork() after interacting
(Answer 3 halted.halted,
ADVANCED
DEPARTMENT 3; 0; are order all
SEMESTER call. #include
<unistd.h> spawned
#include
<stdio.h> && return
0; statements until
CENTRAL fork();
fork()fork); = = any the eventually
Systemn ("C")
type
signal
(V) eventually
U V [Proçess run
three 1] L1
goto in answering
int
main() be semaphore Ll:wait
(U)
semaphore interleaved
SUBJECT: ) to
fork
will of the allowed
MID
set halted. is
{ processes is
on process execution
execution
1sT a When
program is be be is
following willexecution
many eachcansemaphores.
processes Assuming
processes ASSuming
a Within
Given How point
The runs? runs?
A. D
Q1
 E. D.
C.
Explain needed,
assigned. Consider percentageof burst.when the aConsider units,
of Is Is What
shortest
CABABDDCABCABD
CABACDBCABDD
time
Assume respectively. is
whether asthe doing the
running
remaining three
given smallest
methods does
timtehe computation,
that processes,
the below. prCcess
k*** Each number
above used alcompute
l
The I/O gets process possible a
solution by and all a
initial
processes zenmain
idle?
CPU
operations time arriving possible of
Section
Critica! while blocked the A's
spends
values first last output that
wil P1 at output
Pl schedulng 0n 10% the
work cair time sequènce migiht
ofand frst
correctly? shared de rO timeof zero, sequence be
P2 20% printed
Section
Critical(S1=
S2 while
$2); when
for overlappedalgorithmdoing with when
= Boolean of
not accessing
P2 the execution when
total this when
{S1); running /0
variables as andagain.execution set this this
their muchschedules time of set
process processes of set
critical The of
S1 asoperatingdoing time processes processes
and possible.
finishes new a
sections I/O, of runs?
S2
are process the 10, runs?
its system 20 runs?
whenever(5)
randomly For
compute next
and
what either uses 70%
30
(5) (1) (1) (1)

2
 Subject
code:
MCS-102
Time:
1Hour 9 A
[15X1=15 truth
hasin
elements
elements a
D.None in
Y input
of IMPLIES
7 number
has
TRUE/FALSE) one
KORAPUT only
EXAMINATION-2024 A
SCIENCE if the B )
elements. and Z is
is NEGATION there
what ( A
ODISHA, SEMESTER
MSC
FIRST ~Q P. Both C. Induction. FALSE)
COMPUTER UNLESS disjunction if
12 then }. ~P> established
(n+1)/2]
{r (XAND
having 17,
elements, C. I
OF D. ? Q". Mathematical QY1J1
0
(TRUE
SEMESTER 4, Q not B) [n 1 1
UNIVERSITY set A={{1,2}, Q to (PAQ)U(~PU~Q
B. or
Contradiction =
conjunction +....+n°=
be DNF. 0 1|1
OF correct? P Z) CNF.
6
universal equivalent statement of can P 0 1
DEPARTMENT has P UNLESS
calculus. in
C. "converse functions table
B outside +Q.?
by is
MID set
intersection ~Q’P
islare a equation "
tomorrow. logically is a (A truth disjunction
Subject: a
CENTRAL Discrete
Mathematics theItrains P expression is Q
predicate +3°
of for
FIRST subsets of play followingof " of
Cricket
THEN 1°+2°Boolean
table following
table
following
cardinality table
not B. is
A will ’Q Q truth A.Tautology truth
truth P
explain of
areand the following play (If many the "Conjunction
UNLESS thatthe
I
15
Marks: B elements
Full and B?the of ~P
the to thethe Express
Which likeDrawDraw Briefly
ProveProof Howe table?
Draw
HIVERS Answer union
all Find The
ORISS, A A. P "I
P
Q10.Q11.Q12. Q13. Q14. Q15.
Q2. Q3. Q4. Q5. Q6. Q7. Q8. Q9.
Q1
 CENTRAL
UNIVERSIT

CENTRAL UNIVERSITY OF ODISHA, KORAPUT

DEPARTMENT OF COMPUTER SCIENCE
SECOND MID SEMESTEREXAMINATION-2024
MSC FIRST SEMESTER
Subject: Discrete Mathematics Subject code: MCs-1
Full Marks: 15 Time: 1 Hour
Answer any ELEVEN questions including Q1 which is compulsory. [10X1+1x5=15
Q1. Given a binary tree whose inorder and preorder traversal are given below.
Inorder: EICF BGDJHK
Preorder: BCE|FDGH JK
Find the postorder.
Q2 Write the difference between planar and non-planar graph.
Q3. Write Euler's formuBa.
Acomplete graph has 6 edges. Find the number of vertices in the graph.
Q5 Explain the concept of null graph
Write the between graph and a tree.
A
complete graph has 1296 spanning trees. Find the number of vertices in the araph,
Q8. How many roots can be possible in a spanning tree which is formed from a complete
graph containing two vertices?
Q9. Draw a complete binary tree and find its inorder kyws
Q10. Which two algorithms are used for forming a minimum cost spanning tree?
Q11 A complete graph has 10 vertices. How many edges are possible?
Q12. We can construct unique binary tree usingpreorder and postorder
(TRUE/FALSE)
Q13. Using appropriate algorithm fine MST for a complete graph with following
A-B B-D A-C information
Edges 2 3 4
A-D C-D B-C
Weights: 1 5 5
Q14. Draw the tree using the information given below.
tree has root 1. 2and 3 are the immediate descendants of 1. 4is the child of 35 ie tho
A
child of 1 and 5 and 3 are siblings.
Q15. Find the inorder using the information given in 14