DHARMSINH DESAIUNIVERSITY, NADIAD

D FACULITY OF TECHNOLOGY
THIRD SESSIONAL
SUBJECT: Machine Learning (CE622)

Examination :B.Tech Semester VI Seat No.

Date : 20/03/2023 Day : Monday
Time : 2:30 PM to3:4S PM Max. Marks :36

INSTRUCTIONS:
1. Figures to the right indicate maximum marks for that question.
2. The symbols used carry their usual meanings.
3. Assume suitable data, if required & mention them clearly.
4. Draw neat sketches wherever necessary.
Q.1 Do as directed.
|12}
CO1 N (a) Which Machine Learning Algorithm you would use to automatically identify the category of a 2)
product based on the description of the
CO2 R (b) Define expectation of a random variable.product?Justify your answer.
Give an example.
CO1 U(c) What is dimensionality reduction? Why is it required? (2)
CO3 U (d) What the influence of choosing very large and small values of hyperparameter 'c' in Linear 2]
SVM?
C02 U (e) What are the advantages of an SVM classifier over a Logistic Regression classifier? Explain in (2]
brief.
C04 E () Consider a single layer perceptron with sigmoid activation function. What is the output of the
(2J
perceptron if the Input is given as [x0, xl, x2]-[1, 0.7, 0.8], the weights are [w0, wl, w2]=[0.9,
0.2, 0.3] and bias-0. Show equations and steps clearly.
Q.2 Attempt Any TWO from the following questions.
CO3 N (a) i) For Hard Margin SVM, write the primal constrained optimization and dual [12]
optimization equations. Write and explain the constraints in both the cases
lagrangian [3]
CO2 ii) Compare Hard Margin SVM and Soft Margin SVM.
CO2 U (b) i))What is Kernel Trick in SVM? Explain its [3]
CO4 E ii) Consider the following data points : X1= importance with an example.
12 31. Yl= l and X2={4 5], Y2
[2]
given data points find the values of a's associated with each data point, weight =-1. Using the (4]
the decision boundary for Linear SVM. vector, bias and
CO4 C (c) Consider the following Multi Layer Perceptron Network.
Sigmoid Activation function is used in [6
both Hidden layer and output layer. Learning rate value =0.5.
X1=1
w1=0.1

w2=0 w7=0.7 t1=1

H1
01

w3=0.3 we=0
X2=4

w4=0.4
w9=0.9

t2=0
w5=0.5) H2
02
w10=0.1
X3=5
W6=0.6
i) For the given network perform
02.
forward pass and identify the output associated with Ol and
ii) Find the error associated with each
neuron of hidden layer and output layer.
ii) Find the updated weight value for w3.

Page 1 of 2
 Q3 Answer the following questions. [12]
CO4 N (a) Explain the working of the principal comnonent analysis technique for the following data set. [6]

X1 3 11 13 15
5 7
X2 16 14 6 4 2
12 10

CO4 N (b) Describe the working of Expectation Maximization algoritbm to find out the missing data in the [6)
given data points. The jont distribution is defined as P(X1, X2, X3) =P(XI|X2)°P(X2]X3)*P(X3)
X1 1 ? 1

X2 ? 1 1 1 0
X3 1 ? 1

OR
Q.3 Answer the following questions. [12]
CO4 C (a) Perfom singular value decomposition and divide the following matrix Ainto three sub matrices.
A=[(2, 5), (3,6)]
[6]
CO2 N (b) Describe the Latent Dirichlet Allocation technique for topic modeling. List out two applications [6]
of it.

Page 2 of2
 D
DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTYOF TECHNOLOGY
THIRD SESSIONAL
SUBJECT: (CE-611) COMPUTER NETWORKS Kol3 ? 16
Examination :B.Tech Semester VI Seat No. : CEO23
Date :21/03/2023 Day :Tuesday
Time :2:30 PM-3:45 PM Max. Marks :36

INSTRUCTIONS:
1. Figures to the right indicate maximum marks for that question.
2.. The symbols used carry their usual meanings.
3. Assume suitable data, if required & mention them clearly.
4. Draw neat sketches wherever necessary.

Q.1 Do as directed. [12]

CO3 A (a) One hundred stations on pure ALOHA network share a 1-Mbps channel. If frames are [2]
1000 bits long, tind the throughput, if eachstation is sending 10 frames per second.
CO4 E (b) An Ethernet MAC sub-layer receives 42 bytes of data from upper layer. Is padding 2]
needed in the Ethernet frame, and if so, how many bytes?
COS N (c) Ethernet has imposed restrictions on both the minimum and maximum lengths of a (2]
frame." Justify.
CO1 E (d) If a channel is absolutely error free, do we need sequence numbers and [2]
acknowledgments for Segments? Justify your answer.
CO3 U (e) What are UA and MTA? What do they do? [2]
CO1 A () srtt=40, measured rtt-38, rttvar=1. What will be value of RTO if Jacobson's (2]
calculations are taken into account?

Q.2 Attempt Any TWO from the following questions. [12]

CO4 N (a) Consider a network connecting two systems located 12000 kilometers apart. The [61
bandwidth of the network is 500 x 10° bits per second. The propagation speed of the
media is 4 x 10° meters per second. It is needed to design a Go-Back-N sliding
window protocol for this network. The average frame size is 10' bits. The network is to
be used to its full capacity. Assume that processing delays at nodes are negligible.
How many minimum bits are required in the sequence number field?
COs U(b) Running TCP across wireless networks may lead to performance problems. Why? [6]
Discuss two possible solutions for the problem with their limitations if there is any.
CO3 R (c) Answer with regard to TCP. [6]
1. What is usefulness of time waited timer?
2. What is congestion avoidance?
3. What willbe triggering event and next state when TCP is in FIN WAIT Istate?

Q.3 Answer the following questions. [12]

CO2 A (a) Discuss binary countdown protocol. Explain Mok and Ward version of binary [6]
countdown. Consider that a LAN uses Mok and Ward's version of binary countdown.
At a certain instant, the ten stations have the virtual station numbers 8, 2, 4, 5, 1, 7, 3, 6,
9. and 0. The next three stations to send are 4, 3, and 9, in that order. What are the new
virtual station numbers after allthree have finished their transmissions?
CO3 N (b) Explain the role of SMI,MIB and SNMP in network management. [3]

Page 1 of 2
 cO1 N(C) Consider the following wirelesscircles
topology, consisting of 6 nodes. Each node's (31
around it.
transmission range is indicated by
When node Atransmits to node B, list the potential hidden terminals from
A and exposed terminals.
2. When node Btransmits to node C, list the potential hidden terminals from
B and exposed terminals.

OR
Q.3 Answer the following questions.
CO2 A (a) Discuss the problem created by two parallel transparent [12]
bridges in the topology. Find [61
the spanning tree for the system shown in figure below. Choose Bl as
Root Bridge.
Show the method. Identify forwarding and blocking ports of the bridges.
LANI

B1)
2
LAN? LAN3
3
1

BS)
2
2

LAN4
CO3 N (b) Explain 1-persistent and
CO1 N (C) Suppose measurements madep-persistent CSMA.
on a slotted ALOHA channel for a very large (3]
of users shows that on average 20% of
the slots are idle. number [31
1. What is the channel load G?
2. What is the throughput of the channel?
3. Is this channel overloaded or under
loaded?

Page
 DHARMSINH DESAIUNIVERSITY, NADIAD
FACULTY ÔF TECHNOLOGY

D
Examination :B.Tech Semester VI
THIRD SESSIONAL
SUBJECT: (CE-618) NETWORK & INFORMATION
Seat No. : CEoz3
: Thursday
SECURITY

Date :23-03-2023 Day

Max. Marks :36
Time :2:30 pm to 3:45 pm

INSTRUCTIONS:
1 Figures to the right indicate maximum marks for that question.
2 The symbols used carry their usual meanings.
3 Assume suitable data, if required & mention them clearly.
4 Draw neat sketches wherever necessary.

Q.1 Do as directed, [12]

(a) Apply shift row operation on the given state obtained after sub byte step in AES. (2]
t9 FE 30 63
CO4 A Si= 63 F2 F2 26
C9 7D C9 D4
82 63 FA D4

CO4 A
(b) Compute the value in hex of roundconstant RC, with respect to polynomial x°+ [2]
x+x +x+ 1.
CO3 N (c) Compare transport mode and tunnel mode in IP Sec protocol. [2)
(d) Modify basic digital signature scheme such that it can also achieve [2]
C02 C
confidentiality. Explain your answer.
CO1 U (e) In which cases certificate revocation is required in X.509? Explain any two in brief. (2]
CO4 E () Distinguish between MDC and MAC. [2]

Q.2 A Attempt
CO4
Any TWO from the following questions. [12]
(a) In AES round, in mix column step, calculate Sz(1,1) if we perform S3 =Cx S, [6)
Assume, first row of matrix C is [231 1] and first column of matrix S, is [63
F2 7D D4]. Multiply first row by the first column and obtain the result. Consider
polynomial x°+ x*+x+x+ 1for modulo operation.
CO4 E (b) Consider sub byte computation in AES. Assume that multiplicative inverse (6]
output S(r,c) found is( x° + x + x' +1). X is given below. Represent the
polynomial ( x° + x+x*+1) as binary, transform it as 8xl matrix (lsb to msb)
and evaluate X*S(r,c)".
10001 1 11
11000111
11100011
1111000 1
1111 1000
0111 1100
00111 110
|o0011 1 11
Give brief explanation of (6]
CO3 C (c) Construct a pseudo code for key expansion in AES-128.
operations.

Page I of2
 Attempt the following questions. [12]
Q.3 neat and clean diagram. [6]
C02 R (a) Explain Needham-Schroeder key sharing protocol with detail and [6]
ExplainthatCertification
CO3 A (b) apply authority method of public key distribution in
to soive the following question: Show how userl, knowing only the
public key of the CA (the root), can obtain a verified copyof User8's public key?
Use the following figure to answer the question.
CA

CA2 CAS

Uscrl Tscrtset3 Uscr4Users Uscr6 User7 User8

OR
Q.3 Attempt the following questions.
CO2 R (a) Assume Alice (the client) wants to create a shared secret key [12]
with Bob (the server) 6
using AS and TGS. Explain all 6 steps in detail with
CO3 A (b) Initial values of
Buffers
example.
are as below.
A=0X7 B-0XA C=0XC D=0X4 E=0X9 F=0Xa G=0Xf [6]
H=0X6. If these initial
values are given to round 0 of SHA-512 then what will be the
DEFG H after round-02(WO=0X7 K0=0X9 value of buffer A BC
1bits. Use addition mod 2). Rotate(X)=circular rotation in left by

Page 2 of 2
 DHARMSINH DESAI UNIVERSITY, NADIAD

D
FACULTY OF TECHNOLOGY
B.TECH - Semester - VI (Computer Engineering)LANGUAGES
SUBJECT: (CE 614)THEORY OF AUTOMATA & FORMAL

Seat No.
Examination
Date
: 3rd Sessional
25/03/2023 Day
Max. Marks
iSootudoy
:36
Time 1. Hr. 1S Min.

INSTRUCTIONS:
1. Figures to the right indicate maximum marks for that question.
The symbols used carry their usual meanings.
3 Assune suitable data, if required & mention them clearly.
4 Draw neat sketches wherever necessary.

Q.1 Do as Directed [12]|

2
CO4-R a State Church-Turing Thesis and its importance.
CO4-A b. Using a block diagram, specify the input and output of Universal Turing 2
Machines.
CO4-N c. We don't talk about ^-transition in a Turing Machine. Why are they 2
significant in NFA-^s or in PDAsbut not necessary in Turing Machines ?
CO3-R d. Define the rules for Deterministic Push-Down Automata. 3
3
CO1-A e. What is the Left-Recursion problem? Remove Left-Recursion from the
given grammar.
E’E +T|$T
T’T* F|F
F’a
0.2 Answer the Following (Any Two) [12]
CO3-N a. Construct a Turing Machine for accepting the below given language. 6
L= (ss|sE fa,b}*}
CO3-A b. Construct a Turing Machine for computing a characteristic function for 6
the language of non-palindromes.
CO3 With a suitable exanmple, explain cascading of Turing Machines. 6
U
Q.3 Answer the Following [12]
CO4 Find an NPDA on E= (a, b, c} that accepts the language given below. 6
N L={W,cw) : W|, W, E {a, b} *, w# w,
CO4 b. Construct Top-Down NPDA for the given Grammar 6
A S ’ aABB|aAA, A ’ aBB |a, B bBB|A
OR
Q.3 Answer the Following |12)
6
CO4 a. Develop NPDA for the Regular Expression: abb*aba*
N
CO4 b. Create Bottom-Up NPDA for the given Grammar
A S ’ aABB|aAA, A- aBB| a, B-’ bBB A