NADIAD

DHARMSINH DESAI UNIVERSITY,

ID
FACULTY OFTECHNOLOGY
SECOND SESSIONAL
(CE622)
SUBJECT: Machine Learning
Seat No.
: Monday
Examination :B.Tech Semester VI Day
Date :06/02/2023 Max. Marks :36
Time :3:15 PM to 4:30 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.
|12|
|2
Q.1 Do as directed.
technique would vou use to categorize news articles into different categories?
COI N (a) Which unsupervised learning [2
Justify your answer. 2]
CO2 R (b) Which are the limitations of K Means clustering algorithm?
Bayesian Network shown below'?
CO3 A (c) What is the Markov Blanket of node X for the

[2]
diagrams.
patterns and non-linearly separable patterns with appropriate new model to make (2]
CO1 U (d) Define linearly separable and use the
"features"" to train a new model
of multiple models as
CO2 U (e) i) Use predictions data.'Identify the ensemble learning model. estimators in Bagging Algorithm?
predictions on test of several base function ? (2)
functions used to combine outputs need a differentiable activation
ii) What are the Perceptron. Why do we
structure of a Multilayer
CO1 N () Explain the [12]
computed by a single [2]
Q.2 Answer the following questions. a single layer perceptron? How are the outputs
components of
What are the main perceptron 4)
CO2 N (a) i)layer perceptron? Algorithm. State the condition under which the
Perceptron Learning
ii) Write and explain the converge. the models.' Justify and
state (2j
learning algorithm fails yield better results when there is diversity among
to
Ensembles tend to models. [4)
CO2 N (b) i) in Ensemble learning
methods to achieve diversity Forest Algorithm in detail.
of Random
ii) Explain the working OR [12)
and 'gleason score'. The 121
following questions. features 'psa level', 'age'
Q.2 Answer the
Consider abinary classification problenn with inputI or 0. The logistic Regression model generated upon
CO4 E (a) i) disease' which takes labels
class variable is cancer score)
training is: 0.0266*(psa) -0.0208*(age) + 1.0790 *(gleasonman with a psa levelof 10
logit(cancer disease) = -6.3896 + disease=1 for a69 year old
probability of having cancer
What is the predicted according to the given model. Show all the steps. (4)
Can we use the Mean Square
and gleason score of 5 loss function used in Binary Logistic Regression.
ü) Write and explain the Justify your answer. of twofeatures X1and X2and one output [6)
CO2 N
Error Loss function in Logistic Regression?in Table ).2 B. Itconsists
the following dataset shown
C04 C (b) Consider
classifier is applied on the given
dataset. (X[>2.0). This decision node
variable Y.An Adaboost following decision node the
chose the first model hl with the label (+1) to the rest of
Let us suppose we value of X1>2.0 and class
assigns class label (-1) to all
samples which has 1). 0.2
samples.
weight assigned to all the
samples? 2). E = 0.2
i) What is the initial by model hl, compute the error.
made
ii) Based on predictions model hl. 3). Alpha = 0.693
Compute the performance of
iii)
Page I of2
4). Corr. Classified = 0.1
Miss classified= 0.4
 samplesare
samples. Show which
correctlyclassified
iv) Compute the updated weight of misclassificdl and
misclassified.
Show allthe steps and equations clearly.
Y
XI X2

0.5 1.5
1
1.5 1.5

1.5 0.5
-1
2.5 1.5
-1
2.5 2.5
Table Q.2.B [12]
Q.3 Attempt Any TWO from the following questions. Sampies [6]
Using likelihood weighting technique, draw threenumbers
CO3 E (a) For the Bayesian Network shown in Eie O 2. P=), Consider the following random to
P(R=1/ H=0.
and answer the following inference query,
draw samples. [ 25, 35, 45, 55, 65, 75, 85, 95, 35, 85, 45, 75]

PCH) o 1 P(T) O 1.
0.3 o.7
o.6 O. 4

Hones Disciplie. (Fatellgenc

Pertorumnce
Attshude. PCP)
PCAJ
D

a<o-|o|
loloal o.8 C.2.
O.6 o. 4 Reomnmond. 1
0.
O. 4 0. 6
O.3

o 0. 6 o.4
1. O. 2 O. 8 1. 1. 0.3 0.7
P(R)
A

1 0. 0.3

Oo, 4 0.6
1. o.i 0.9

Fig: Q 2
co3 E (b) For the Bayesian Network shown in Fig Q2, Draw four samples using Gibb's sampling technique and [6]
answer the following inernce query, P(R =1/1=1, H=0). Consider the following random numbers to
draw the first sample, (y5, 6s, 75.35]
CO2 N (c) Describe the working of K-Means clustering algorithm for the data given below, [6]

Data pl p2 p3 p4 PS P6 p7 P8

X1 2 4 6 3 | 8

x2 2 3 7 5 5 )

Initial cluster heads are C| =pl and C2 p4.

Page 2 of2
 10LOG

Po4 413
DHARMSINH DESAI UNIVERSITY, NADIAD

D
Date
FACULTY OF TECHNOLOGY
SECOND SESSIONAL
SUBJECT: (CE-618) NETWORK &INFORMATION SECURITY
Examination :B.Tech Se mester VI Seat No.
:08-02-2023 Day :Wednesday
Time :3:15 pm to 4:30 pm Max. Marks :36

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

Q.1 Do as directed. [12|

CO1 U (a) Find any four points of elliptic curve Eu (1, 6). [2]
CO3 A (b) Find all primitive roots of 11. [31
CO2 E (c) Justify: Rabin cryptosystem is not deterministic but RSA is deterministic. [1]
CO3 A
(d) Apply Rail fence cipher to encrypt the plain text computersoftware". [2]
CO2 (e) Determine row and column number in decimal for S-Boxl to get the 4 bits output (2]
if the input to S-Boxl is 110110 in DES.
CÓ2 N () ldentify the types of elements present in DES round. Expiain Feistel cipher [2)
structure.
Q.2 Attempt Any TWOfrom the following questions.
CO3 A (a) Find the value of x' for the following set of congruent equations
[12]
[6]
X=3 mod 5
X=6 mod 7
X=4 mod 11
CO2 N (b) i. Give the mathematical proof of Elgamal
and state why it is working in a
cryptosystem regarding decryption [2]
correct manner?
CO1 A ii. Given P(3,10), Q(9,7) for E23 (1, 1) Find R=P+Q.
CO2 U (c) i. Explain Diffie-Hellman key exchange protocol. [4]
C04 N ii. Explain Man in the middle attack in detail. [2]
[4)
Q.3 Attempt the following questions.
CO2 C (a) Construct a diagram for general structure of Data [12}
Encryption Standard (DES). [6]
Explain cach step in brief.
Co3 A (b) Apply Hill Cipher to encrypt the plain text abcd" using K and decrypt the cipher [6)
text using K given below.
K=2 18 17
1 17 18

OR
Q.3 Attempt the following questions.
C02 C (a) Construct diagrams for a round in DES (encryption site) and a |12]
DES function. [6]
cO3 A (b) Apply keyed transposition cipher to perform
encryption of plain text [61
*enemyattackstonightz" using encryption key={3,1,4,5,2}. Find decryption key
and perform decryption of cipher text.

Page 1 of 1
 ko?3344

D
DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF TECHNOLOGY
SEcONDPRT SESSIONAL
SUBJECT: COMPUTER NETWORKS
CEO23
Examination :B.Tech Semester VI Seat No.
Date :07/02/2023 Day :Tuesday
Time Max. Marks :36
:3:15pm to 4.30pm
INSTRUCTIONS:
1. Figures to the right indicate maximum marks for that question.
The symbols used carry their usual meanings.
3.
4.
Assume suitable data, if required & mention them clearly.
Draw neat sketches wherever necessary.

Q.1 Do as directed. [12]

(a) n an TP-over-Ethernet netwok. a machine X wishes to find the MACaddress of (2]
CO3 A
another machine Y in its subnet. Which one of the following can be used for this?
(1) X sends an ARP request packet with broadcast IP address in its local subnet
(2)X sends an ARP reguest packet to the local gateway's MACaddress which then
finds the MACaddress of Y and sends to X
O) A Sends an ARP request packet with broadcast MACaddress in its local subnet
() X sends an ARP request packet to the local gateway's IP address which then
finds the MAC address of Y and sends to Xzp
CO4 R (b) Which protocol(s) is/are used by DNS and FTP attransport layer and networklayer? 2
CO3 A (C), CMPlcan not be used to determine the round-trip time of packets between network [2J
o devices. Is the given statement true/false? Justify your answer.
COS U (d) Discuss milk" and wine" policies of the load shedding. [2]
CO2 A (e) For a host machine that uses the token bucket algorithm for congestion control, the (2]
token bucket has a capacity of 1 megabyte and the maximum output rate is 20
megabytes per second. Tokens arrive at a rate to sustain output at a rate of 10
megabytes per second. The token bucket is currently full and the machine needs to
send 12 megabytes of data, Calculate the minimum time required to transmit the
data iñ seconds.
CO1 N () Below are the link state packets generated by routers in a subnet. Construct the [2]
subnet graph.
A B E

Seq Seq Seq Seq Seg Seq

Age Age Age Age Age Age
B 4 A 4 2 3 5

E 5 7 7

Q.2 Attempt Any TWVO from the following questions. 6550t

CO3 A (a) How many maximum data bytes can be accommodated in a UCP datagram?
How manymaximum data bytes can be accommodated in a TCP segment?,2-Ge Bye
Why is initial sequence number random in TCP? 655
Suppose TCP has a file of 10000 bytes to transfer. The sequence number of the first
25
8o oG3 segment is 1104. If the size of a segment is same as the maximum transfer unit in
Ethernet, what will be the sequenc number of the next two segments? Which
acknowledgement willbe generated by receiver if the first segment reaches after the
second one?
CO1 E (b) (i) Correct the following module of go back n prolocol. |6]
case timeout:
next frame to send - frame expected,
for (i = 1; i<nbuffered: i++)

S. info - buffer[]:
S. seq = next frame to send:
S.ack (uck expected MAX SEO) %(MAX SE0+ 1):
to physical layer(&s):
start timer(s. seg):
inc(nextframe to_send);

PaAe of 2
 (ii)) Explain following function with examples (for selective repeat protocol),ifa 3
bitsequence number is uscd.
static Boolean between(seq_nr a, seq_nr b, seq_nr c)
(if ((a<=b)&&(b<c) (b<c)& &(e<a)) | (e<a)&&(a<-b)
return(true):
else
return(false): }
CO3 U (c) Which of the fields of TCP header can have zero value? Explain flow control of |6|
TCP.

).3 Answer the follow ing questions. (12)

CO3 A (a) Briefly discuss the leaky bucket algorithm. The following packets arrive at a switch [6)
that uses a leaky bucket algorithm. The bucket can contain up to 3000 bytes.
| Packet No. Arrival time slot Size(Bytes)
100
400
3 400
4 1000
4 1000
6 1000
7 600
7 1100
9 8 1000
The leaky bucket operates on packets in FIFO manner, and can send 1 packet in
every 3 time slots (i.e. bucket outputs a packet at slot 0, slot3, slot 6 so on).
Assuming no packet arrives after 8" slot, show when packets leave and which
packets are dropped (if any).
CO4 C (b) Consider an IP packet with a total length of 250
bytes and an id field equal to 17, sent (6]
from ahost A to host B, passing through routers X and Y
the subnet where host A is connected has an MTUof 500 respectively. Assume that
B is connected has an MTU of 80 bytes and the bytes, the subnet where host
of 120 bytes. Assuming that the subnet betweenX and Y has an MTU
Don't fragment" flag is not set, how many
fragments does router X divide the packet into? Show the total
MF and fragment offset fields of the IP length, Identification,
link from X to Y.
header in each packet transmitted over the

0.3 Answer the following questions. (OR

CO3 A (a) (i) Consider the subnet of [12]
figure-1. Distance
following vectors have just come in to router C: vector routing is used, and the (4|
from (5,0, 8, 12, 6. 2): from D
B:
:( 16. 12. 6, 0, 9, 10); and from E: (7, 6, 3, 9, 0, 4).
The measured delays to B, D
and E are 6, 3 and 5, respecctively. Consider the destination order in routing table
(A, B. C, D. E, F). What is C's new routing table? Give
use and the expected delay.
both, the outgoing lines to
(ii) Describe count-to-infinity problem of distance vector
CO4 C (b) Consider the subnet shown in figure-2. A sink tree for router routing.
I is shown in Figure-3. (6]
(i) How many packets arc generated by a broadcast from
router I using Spanning
tree based broadcast technique?
(ii) Build a tree generated by reverse path forwarding for a broadcast from router /.
(iii)How many packets are generated by a broadcast from router I using Reverse path
forwarding broadcast technique?
B
B
G G

N
N

M M

Figure-1 Figure-2 Figure-3

 ID SUBJECT:
DHARMSINH DESAI
UNIVERSITY, NADIAD
FACULTY OF TECHNOLOGY
B.TECH - Semester - V (Computer
(CE 614)THEORY OF Engineering)
AUTOMATA& FORMAL LANGUAGE
Examination : 2nd Sessional
Date : 10/02/2023 Seat No.
Time : 1. Hr. 15 Min. Day
Max. Marks :36
INSTRUCTIONS:
1. Figures to the right indicate
2
The symbols uscd carry theirmaximum
usual
marks for that question.
3 meanings.
Assume suitable data, if required & mention
4 Draw neat sketches wherever them clearly.
necessary.
Q.1 Do as Directed
CO1-R 2. Give recursive [12|
definition of j* for NFA
CO2-A b. For any regular 1
Language L *, if the FA accepting L has at least n states. then every
NFA accepting L has how many 2
Justify your Answer.
minimum number of states ?
CO2-N C. In the proof for Kleene's Theorem -
Part I (Regular Languages can be accepted by
Automata), consider this alternative to the construction Finite 3
Instead of a ncw statc Qu and ^-transition from it to Q1described:
and Q2,
new NFA-^, and create a ^-transition from it to 02. make Q] the initial state of the
Either prove this works in general or give an example in which it
your answer and the justification/example, whichever fails. Credit will be given only if
CO1-N d. applicable, is correct.
Identify the below given CFLs.
(1) S- SaSbSaS SaSaSbS SbSaSaS ^
(2) S A1A A
A ’ 0A|1A|0!1
CO1-R C. Detine: Pumping Lemma for Regular Languages
CO2-A 2
Check whether the grammar given below is Ambiguous or not. 2
S’ aaaaS aaaaaaaS ^
Q.2 Answer the Following (Any Two)
es
CO1-U
|12]
Using distinguishable strings, prove that the language of palindrome cannot be accepted
by Finitec Automata. 6
CO-N b Write a CFGfor L: (ab'ek i j+k} th 6
COi-A C. Minimize the Given Finite Automata 6
a

2Jth a

r..b

a
a

T’ Tl4 b
a

Q.3 Answer the Following |12]

CO2-A Prove the following Statement: Let L. = * is a language that is accepled by an NFA-^.
Then, there is an NEA that also accepts L.
OR

Q.3 Answer the Following |12]

CO2-A Give arecursive detinition of Regular Languages. Using the detinition and strucural
induction, plove that any regular language can be accepted by a linite Autonata.