End Sem PYQ
End Sem PYQ
10
fc) (b)
incone:
and
(a {C (D)
(family Consider
Extended
Nuclear
Parent
Single Nuciear
Childless
Chíldless
classification
distance
Bayes Classify dataset Let
Childless
Parent
Single Exterded Nuclear
Structure
Faniiy Typeof The ofFor
theDerentiate accuraCy,
Cornsider
for Point point ata False the Class
Actual
Confusion
Natrix
ciassiication, P6 P Pl
strueture: the the given of new a Positive
Confusion
the asset
Table precision, the
aigorithm
Lov), foliowing classgiven
ciasspoint point
in
between Cancar No
Cancer
Middle-aged
Old Hiddle-aged Coordinate I: and following
MiddlG-aged| High Young
Middie-aged Old
Old Young Low Young
group
Age will
Single Table
coordinate
P (10,12) (5,10)
(7,5) (4,9) (1,2)
Point C1, in Matrix
Questions
"Endof classify of (6,5) False
buy dataset. for with C2,Table recall
the Coordinate False
a C3. Cancer
50 No
k=3 respect 1. Negative. given 5 and
confusion
car
Parent, 1,
a fopoint
r Compute Positive
LowMedium High Low Medium With P= classify Prediotud
ClaBS Fl
Medium Incone or
Low Low Status
person the in
not. to and Q.9 score.
gzoup:
Young
age datasetP(5,other (5, Classification and
the its the (b),
No CANCO matrix.
Yes Yes Yes NoYes Yes No NoYes
they
buya Will with helpinstances. 7) the 7) C1 C3 C C
class False 100 10
car? using entry coordinates find
in
Euclidean
type Q.10 of the
Negative. Compute
Naive KNN in
the value
of (a) of
2 2 2 2 *
*Bloom's
knowledge
1. Analysing Analyze
demonstrate
application
Understand
classification,
clustering.
learning problems.
Develop
different Understand
knowledge and
Understand
Python.
processingApply mathematical Marks:
Full
Programme:60
B.Tech.
(C8E)
Subject/Course
Outcome
Learning Engineering
racully of
(c) (b) (a) the
l
Answeraltaxonomy techniques class and
year='
then
(Hint:Python
correspondence For(8.9,(7.8,average what
For Distinguish
CGPAfollowingconsider (L4), for the and techniques
the to INTRODUCTION END
analyze interpret the
solving of
the Evatuating real-world apply problems, data basics SEMESTER
the 6), 6), and values
program
if CGPAgiven levels:these for various
semester python thequestions. for and
dififerent the of of and
semester=2
second' dataset(8.76,(8.9, pl solving
extracting visualize
between
data following Remembering science
problems.
(L5), data of such
advanced models data PYTHON
3054)
(CSE Technology
for problems
to and
betweern statements: Creating use as science
find 2)1. 6),
each set,
Each the
and p2 regression, for
cases. the
statistical EXAMINATION,
TO (|1ER),
given (9.45, list machine and
the [(8.3, write
semester. will list: solvingcomplex data.
question using
semester=6 then and DATA
semester and (L6)(L1), pre SIksha
year contain
a X
year='
in 6),
4)
python ( i) = Understanding
pl=X-3:] *Taxonomy 'O'
of Q.1 (tuple
0, carries L3,L2,LA SCIENCE Anusandhan
L3,LA L3,L4 L2,L3 L3,LA
L3,LA Level
a (9.92,(8.8,
after 1,
first'
then student. and
(b), program 3, in
page python.4, equal JUNE-2023
2)4), execution(ü) Hours
Semester:
Time: 36th Leemed
year= (L2), c)
10(a,b,) 7(a,b, 9(a,c)
b, 8(a,b,
c) 5(a,c),b,4{a,c)b,
1
, year.there ,p2-X(::-1] 5, 6la.b, USING
semester=4
c) , 3(a,c),b,2(b,C), 2(a) 1(a,c),b,Nos,Ques.
of (9.34,(9.l, to 6, mark. Applying
4 Write 7, to
thìrd'] find Further,2 be
is of 8, University
4), 2), the the 9), Marks
(L3}, 6 6 28
a a 6
2 2
2.. (a) What will be the output of
folowing pvthon script? 2
fros oollectionsimport Counter (b) Write a python program for
finding the normal
*['blue',
oler count= green, blue',yellow' 'green ', approximation for the
for Counter( ) 'green') the normal distributionbinomial distribution. Compute
if
lor,ount
cont>l:
in color
oount.most comon () parameters for the binomial
distribution with parameters,
(c) Write a n= 100, p =0.7.
bË
print (color,oount) python program to find the cut-offs value for an
Suppose data of weight (in kg) and height (in cm) is
interval centred at the mean and containing 60 %
2
collected from 9 persons, labeled as [a', b, , 2 probability. What will be the probability at each left and
g. h, }, gven by: d, e, f, right tail?
7. (a) Write a python program to compute the
Weight=[53, s0, 53,e 59, linear system, y= mxt c, gradient for the 2
Beiçht=(154, 149, 155, 56, 151,
Write a python program to158,
52, 59, 47, 53)
151, 160, 147, 1511 In case of fitting model with two paramneters m and c.
using
show the relationship between the reason of squaring the gradient descent, explain
the given datasets by
Write a python programdrewing scatter plot.
a absolute value of the error error rather than taking the
between the prediction and
to draw a line chart for actual.
datasets: = the given 2 (b
Write a Python program to find the
Variane [1, 2, 4 8, 16, 32, 64, 128, the following function using point of minima of 2
Bias squared = 256, 128,
3.
Wrie a prthon program 64, 32, 16, 8, 256]
4, 2, 1] taking initial solution xÍ
Gradient Descent method
= 2 and Learning
to fnd the £(x) = - 4x+1 Rate-0.0001.
{b
vector as given as: V=2, 3, 5] distance
and V2= 2, 0, 9].between 2 (c) What is the
output of
Compute the component wise mean def derivative (x): the following code? 2
of the given
i-[,3,2,4], v2 = (3, 4,
V- 1, 3, 4, 3] 6, 7], V3 vectors.
= [3, 2,4, 6],
2 return 2tx+9
def square (x: float) ->
Conpute the ot retun x t +9* float:
vector of vi, v2, product
=-2, -2, 1, v3,
of the
va) in Q. 3(b)resultant vector (mean xs = range (-1, 3, 2)
4. 2]. with vector actual = [derivative (x) for x in xs)
print (actual)
CompIte the
toowng scOresvariance and
on an exam: standard deviation of the 2 Rewrite the above code by
the limit of the difference representing the derivative as
Wrte the python code to find (92,95,85, 80,75,50,67]
the variance and values of h=0.001). quotients (evaluating for small
8. (a
eviatkGn for the dataset given in Q. 4 fa). standard 2 Write a python program to randomly
generate data with
Write a pyhon code to I00 numbers and form a
two datasets baving same deternine the correlation between numbers should be between histogram of it. Range of the
1 and 100 (both
5.
Let P (E) denote size. bucket size=10. incduded),
the
= 1, PB) = 1/2, find probability of the (b
Write a python program to read from
the vaiues of PA event E. Given P(A) 2
B) and PB | A). file holding the mobile phone.txt', a text
Hint: A and Bare
mobile numbers based on numbers and prìnt the valid
b Write a Python independent the following criterna.
density function program for the uniform
(PDP) and the uniform probability 2 The irst
digit should contain numbers between 6to 9.
The rest 9 digit can contain any
distribution
two functions. function (CDF). Draw rough plotscumulative
for these (c) What do you mean by
number between 0 to9.
delimited files? Create a tab
delimited text file containing
Write a python script to comnpute the company rame, Number of
Distribution Function (CDF) of normalinverse Cumulative 2 students placed, and
binary scarch method. distribution using and display them onpackage of 5 software
the console using companes
6. program. a prthon
(a) Distinguish between the 9
events. Give Some Examples. dependent and independent 2 (a) Describe Bias-Variance Tradeoff by plotting a
to solve High Bias and High graph. How 2
e2 of4 Variance probiem?
9
b (a)
(b) (a) (c) (b
else
fy-a*a;}
S>a) ectaS
d:ca
optiniZeassembBy
compile alonly
needed allows ST K Rl,LD
RO,2LD
ADDDeterine
i The RO statement
address
y y-b[]
Generate
exarnple. Define
Srength Optimizesd+l; a-btc
-b+c;esa+I? suitable
Consider of
obtained
Explain blocks.
basic
Write
variables unber elimination Determine
{d-d following RO,
**kthk in the
the the RO, an of
the
thecode the the
reduction nodes the the foralgorithm
d; registercode register induction examples.
eee; are code RI above technique
concept the the
instruction costs assermbly following
and
segment dead and three-addressbasic
allocation) segment
operands of
find three of for
Bnd after the inedges blocks
variable Cused
common
following
code code code partitioning
of without set the address
eist
this is in and
Onestions architecture in segnent
minimum executed segment: code code
optimization and in
code its sub-expression the
any instruction
the code
instructions. optimization
generated the
explain DAG corresponding
spillsegment. on
for and
number three-address
rktit of representation.
the
to a
processor the toprocessor with the find in
memory. sequences: following
Generate with and
Assume the Q
of meaninga 8.
flow
registers minimum thedead (a)
code
which
suitable
(Only three heip code graphs
the that into
of
2 2 2
(a)1. Applying
*Bloom'sUnderstand techniques Understand
the synthesizedApplyparsers.
used its Analyze lexicaltranslation
LALR) Compiler, their
rolein
AcquireUnderstand Marks:
Full60
Programme:
B.Tech.
YACC,
LEX,
etc..
instruction process
(c) (b) for Programming Iacih
and analyzer, Subject/Course
Outcome
Learning
code the and knowledge
ditterent in
the Answer forevaluate END-SEMESTER
the Differentiate
printf tokens, Theprocess
compiler.defined In (L3), the
generation
ofattributes, and process the
a taxonomy set
optimization. target their symbol its and designing Eng1neerng
tokens lexical input(s)typical design specifying
and principles
Analysing types
(i=%d, for
optimization of
which for phases. all syntax
machine's table able a
code of
inherited compiler.
for designing questions. i.e.
Parser(s) various and
analyzer compiler, various to
the are between and organization.directed different in
&ci=%x*, levels:
generation use Top-downtheory Languages Technolog
For (LA),
following the run
intermediate attributes, the phasesand stages
output(s) the
translation (LL,
smallest reads a
acompilation time compilertypes of
i, self-hosting Each
Evaluating
Remembertng EXAMINATION,
JUNE-2023 (1TCR).
compiler
assignment and andSLR, computation
invoived
&ci); environment. and of
pharactersC and techniques Bottom-up CLR
tools
tokenspassesof
codeunits to question codes schemes,
different and Siksha
the in
and proceeds
(L5), and and like by the and
statement. comnpiler. Compilers O
of statement, Anusandhan
the anfirst carrles
Creating
(L6)(L1), L2,L3 L2,L3 L2,L3 L1,L2 nomy*Taxo
Level
L1,L2 L1
program. interpreter.. four with
groups Understanding
equal Semester: VI Deemed
phases x= a 10. b)
7. a) 5. 4. 3.
c) 7. 2.1.c) Time:3
Hours
6. 1.a)b)
Find
series
atb*c 9. 8.
a) a)
a) a) a) Ques. (CSE4021)
mark. a) a) a) Nos. to
them
into Define b) b) b) b)
b) b) b) b) c)
c) c) be
out of of c) c) c) c) c) University
define
page the the
well-
all
(L2), 6 16 o 18 ksMar
1 4
of 2 2
4
Page 2.
4. 3.
2 (c) {G (a)
of (b) (a) ( (a Fnd (c) {b)
4
table
Construct
Perform Let
non-terminal
FOLLOW D-’di S’Aa
A’ state
BD reason,the left-recursion.
Lett-recursive
Let Bb| Consicer castwithout is
Canstruct {begin,
Inst Seqstart
Consider Q.{b).2 manybow Find Consider
sequencoe(s Note
that Tl:
x x?T3: T2: tokens A
the lexical
us a, represents c? b?a?
obtained b, ’east-Seq
east the the
grammarsymboi b {a bTI,
consider
the east, anaivzer
sct and d the equivalent regular the
the east the Inst the strigs of a)c
lc)b| le'a T2
parsing S south
north
|west and following ofmeans
in B be gammargammar parse west,
grammar tokens zero and
in SLR north
decreasing and indexed containing |begin language
Q. the the uses
north, orzero T3
action 4 (1] write tree following length
regular
(bjparsing
table.
) gramnmar north deterministic
generatedmany over the
as gven is with or
the follows: for accepted the
for order notieft-recursion? south 8 one following
Cormpute bellow: from the expression are instances
the index set Seq, for alphabet
suitable occçrTence
rules: token
the of as accepted
string values production Inst} by fnite the patterns
the grammar the the input
string for of (a,b,c}.
A’ for automata
aabb Ifterminals, as by x. of
for
FOLLOW a so, the the tabove
he string to
AA, the top-down begin Find the
using obtained rules;
findnon-terminals, recognize
DFA DFA.
automaton. symbol
A-aAsymbols bbaacabc. all
the west a Seq
set gramnmar defined
Find possible
parsing parser, in
south as x three
in of and
b the the Q.3 the out
in
}.
2 2 2 2 2 2
2 2
8, (a7.
) 6. 5.
(a) (c) (b) (c) (b) (a) (c) (b) (a)
(c) b) (a)
Commitrz,
Commitrs
scheduleWhat
Writer1(A}, notAor
operations
Check confict Let giventhenameWite relational
(consider
employeesWrite a
CommitWrite C=1000.
after
the Defered
andSpecify
Corresponding the isolatonWhat
Differentiate protocol
Explain whether
tothe serilizable
S: data schemas
Tl:ocCurs
(A) Read(A) technique
A-A-500
Ri( R4x
ís T3, is element and a
whether ) query
Sa What transaction?
andproperty R2 the and the
cascadeless is assuming
with S: inhandle write a salary living
Commitri, (x ) schemas
immediate Readr1{A), the approach given z using
CASCadeless actions state
to between Wi(
immediate R3( of
Write(B) the of given the schedule not.or by que. in 7) in
schedule
x) z)relational
Domain
the algebra
Write(B) B-B100 T2:
transacion. given th e
Read(B) execution
initial of Explain R1(y) a
denote given
will transaction employees
schedule? operation database log Readrz(A),order
Writers(A),
Readrs(A),
Readr2(A), the operation.(Q)used same
or databasetaken be based schedule Wi(y inquery
value the using S read que.
not, system of by city
modiication usefulness
with
operations
in Writer1(A), the }W2( and 7) to
Check
S: by of recovery timestamp Ti, working
the
modification, S displayto of find
the
A=2000, time x four write Calculus
Readr1(A), following log can )w3( the
Read(C) T3: respectively.
whether log transactions inemployee the
based technique Writer2(A).
related andscheme. of complete stamp
based y)operations TCS,
atomicity R4(y) nametne of
schedule? B-500
if
ReadT2(B), the (consider
failure
recovery a database to protocol ordering
T1, all Check John.
given with and is on the 2
and its
T2 a a
2 2 2
2 2
Marks:
Full60
Programme:
2. **Bloom'
(L3), s
1. Analysing
architecture.functional To
schemas.
normalization
relational
and relational TOand
database To
through
conceptual Components
ToDBMS
concept giventhrough
diagramER To
(b)
Subject/Course
Outcome
Learning
(a) (c) (a) analyze identify
database
understand relational
apply analyzeand user
taxonomy of ER the and END-SEMESTER
EXAMINATION,
JUNE-2023
attributes abstraction.
dataWhat
semi-structured
all independence.
Distinguish physical
of dataWhat model.
dataWhatAnswerall
storage issues calculus schema requirements Introduction
possible (LA), principles
database an
design database
modeling and BTech
is is recovery and
is their
the data Evaluatinglevels: techniques
enterprise explain
data and related and to using
employeeno,
candidate questions. express functionalities
between need relational
design architecture
independence? database to
interdependernce
model? Remembering systemalong
interpret algebraand
to decomposition
of construct and the
data (L5), transaction queries schernafor
candidate Each with apply to Institule
keys different
name, Differentiate Creating
abstraction? Databases
for question the the on the the of
Differentiate (Ll), of
emailid, the key Technical
(L6) Taxonomy
employee and Understanding
betweencarries L4 LA L5 Level
L2 Education
department
phone_no, super Explain
between (CSE
equal 9 Time:3
Semester:
Hours 6th
entity key. 10
a,
b,a,b, C, C,
a,b,a,b,c
7 6 5 C,
b,4 b,c a,3 &
relational
the 8c
8 a,b,c Ques.
page C a,b a4 a,
C,2 a,b,c,
2b Nos. 3151) Reserch,
mark. (L2), 1
Identify
set three logical
1
of Applying
4having Marks SOA
level and 14 10 16
and 12
the
2 2
2 2 n
Page 4.
2 3.
of (c) (b)
4 (a) (c) (b)
a (C (b)
Consider
Dependency and =
property Suppose out diagram.
-’Let relation
Consider Analyzerelated
resulted participation
constraints. and
of customners
representing have
relationship
who association
many description is
(PR) Developthe Constructproduct. represented
customer_city.
represented order
order_customer placedexample.
is Consider proper Differentiate salary.
disjoint
withExplain and
check Q) the the online represented
and hold
all to products
the of X set schema the status. by
whether
BCNF possible the in que. The and the
Zis on
of shopping customers is a
set decomposed
relational = following que
referential appropriate entity th e named of and database
functional
(QRS).relation a 3(a). represented
by overlappingconcept the
or
database and order by rder
priçe. One
: R(A,B,C,D, 3(b) ER role
F{BC-A, not. the candidate set, a
Check system registered many as the includes customer
by
decomposed schema set and diagram and The
unique maintaining of of
Schema dependencies integrity relationship "inchudes". 'a lsorelationship in sophisticated
constraint
a generalization?
into F telational
the of draw ordersassociation ynique byan
and E): illustrated product
some online
decomposition
propertiesof
two X= functional butkeeps can a
R(A,B,C,D)
AD schemas (AB+C,
super for can product_no, order_nÍ, unique
schema (PQRS). its for schemas have products. place the imposed
F corresponding the set,
information One named shopping users
the be is of
=keys not details
Differentiate
B,C’AD}. dependencies
(QR BC-+D, th eon in mapping represented
placedordercustomer many. id,
satisfies YX relational ampunt, and
with and is ’ of the for placed
above as Each name, on
not S, R. product_name, of
generalization naive
Z C+E}. ER the for "places"
can orders.
Eachsystem.
Functional in R’ cardinality about the
Find the where database database any the Product
and phoneno,
schema diagram
schema date,and between users.
BCNF. P, include by orders
order. samne order Each
the Y S List the the and
is
2 2 2 2 2 2 2
2
7 6 5.
andnameWrite
Bhubaneswar.
CompanynameWriteMumbai placed inWrite
employees Consider Consider
satisfies
Dependency canrelation
(Justify Check F=-YZ,
Suppose V-XY).
decomposition
Z+V, Whatresultant functional
dependencies whether
Find canonical
Consider
Dependency
theFindcanonical
a be 3NF
and of a Company a whether is original the
query query Employee
Works the using R
DELHI.
placed in the relational th e the inferred U partial BCNF the cover
state living with th e dependency
decomposed decomposition cover satisfies
getting followingproperty
usingemployees relational {
Armstrong's in of set set
relational
using (ename, following of
of (company
in (ename, B+ACD, attributes the dependency?decomposition
a R of
from relational obtained of the : F.
Domain
the salary algebra
city functional F. F
of
Tuple relational functional Representset property (
Cuttack company 4NF the schema
employees working Schena Schema
more name, estate)
ecity, AB’-CD}. axioms) functional P, of ofBC+A,
relational relational query or above schema using each
not dependencies
Q, Identify
ofR R
than and schemas:
name, R, is of
in city) R(A,B,C,D) canonical decomposed specified
the R(A,B,C,D)
3NF AD
to with S, dependencies.
identical
who functional specified
Calculus 80000.
the working find dependencies
Calculus salary) Comment
reason.
andR{X,Y,V,U,Z} the key’B,CAD}. or
are company not
the PS->T T: number attribute in
working in with {P+QR, cover with in with with
to dependencies. schema.
5(a)
5(a)
to thname
e
whether the and with of
Check reason.
display placed
hold
Functional
basedComnent
findcompany of Fthe based
and
in of set RS-’T}.
PS-Q partial
FD BCNF or
any the the on set not.
inthe Rof the on the on
pageof4 3 2 2 2 2 2 2 2
Explain the use of random numbers in cryptography. What 2 Institute of Technical Education & Research, SOA Deemed To Be
Universiy
are the tworequirements for a sequence of random numbers? END SEMESTER
EXAMINATION, JUNE-2023
Solve the random number sequence for the 1inear 2 Cryptography and Network Security (CSE3035)
congruential generator for a-5, c-0, m=32 and Xol. 2
Programme: B.Tech/CSE &s CSIT
(c) Using Blum Blum Shub Generator Algorithm generate, 5 Semester:6th
Full Marks: 60
random bits if prime numbers are p=383, q =503, and seed
is s = 101355. Time:3 Hours
2
8. sa Explain cryptographic hash function? Subject/Course Learning Outcome *Taxonomy Ques. Mark
2 Level Nos.
Explain the application of hash function in message CO1-Able to understand the L2
security 6
authentication with a suitable diagram. requiremnent, different type of security threat
2 attack and the principles of security design. and
Explain the concept of digital signature with a suitable block
L3 2,3,5 16
diagram. CO2- Able to understand and
2 implement the most (c),6)
Explain symmetric encryption in message encryption with common type of cryptographic algorithm. L2 S(a),6(a 6
suitable block diagram explaining the concept of b) 2
confidentiality and authentication. L4 5(6)
2 CO3- Able to apply modern algebra and number
Solve the public key and private key for prime numbers p3 L3 4(a,b)
and q=1l using the RSA algorithm. theory for understanding of cryptographic 7(b,c) 2
algorithms and vulnerabilities. L4
4( C) 2
2
(c) Explain data encryption and decryption for plain text CO4- Able to understand the most common
12 7(a)
message using the public and privale key. L3 9(b)
asymmetric type of cryptographic algorithm used L2 9(c) 2
in current scenario.
-10 (a) List the two level of functionality that comprise a message
authentication or digital signature mechanism.
Explain the principle of MAC operation and message 2
(b)
authentication tied to ciphertext with suitable block diagram. COs- Able to evaluate security mechanism in L2 6
message authentication code using HASH
(C)Describe the attacks that affect the authentication while 2 function.
having communications over a network. A
CO6- Able to demonstrate various network L2 9(a),
"End of Questions* S3324
security applications, IPSec, Firewall, IDS, Web 10(b)
LI 10(a) 2
721o Security, Email Security and Malicious software
etc.
L2 10(c) 2
CO7- Able to understand the security
requirement, different type of security threat and
attack and the principles of security design.
*Bloom's taxonomy levels: Remembering L1, Understanding (L2), Applying L,
Analysing (LA), Evaluating (L5), Creating (L6)
page 1 of 4
by Let's consider the Ciphertext
"ICUEEPSWSMNLDHLIAEOE". Using the Rail Fence
Answer all questions. Each question carries equal mark. Cipher, find out the plaintext for key value 2.
(o Use Vigenere Cipher with key HEALTH to encrypt the 2
1. Kaj Describe the difference between computer security and 2 message "Life is full of surprises".
network security. 4. (Given polynomials with coefficients belong to GF(2 ) as 2
f(x)Fx* tx+l, g(x)=x+1 and
a Explain symmetric and asymmetric encryption with suitable 2 m(x)=x +x+1. Solve f(x)+g(x) and f(x)*g(x).
diagram.
by Imnplement polynomial arithmetic modulo tables (addition 2
) Explain active and passive attacks. Differentiate "threat" and 2 and multiplication) for GF(2² ) with
"attack".
given ireducible polynomial as, m(x)=x tx+1.