Question Papers

1. A"4 Aerrt M;Tech
USN
Second Semester
Time: 3 hrs.
2016
Max. Marks:100
Note: Answer any FIVE full questions.
Discuss the variety dimension of Big Data. What is structured, unstruc d and
semi-structured data? Explain with examples. (10 Marks)
How big data analytics can help in detecting fraud? Explain with industry example.
(10 Marks)
a. Explain the three business models for big data. ', (06 Marks)
b. What is impedance mismatch'l Why is it a major source of frustration for application
developers? (06 Marks)
c. What are different ways of constructing..version stamps? What are their pros and cons?
(08 Marks)
a. Compare and contrast sharding and replication. Explain the advantages and limitations of
sharding and replication. (10 Marks)
b. Explain the trade off involved in consistency and availability with respect to the CAP
theorem. (10 Nlarks)
a. Write brief note on materialized views. (04 Marks)
b. A Hadoop cluster is configured to use block size of 128 MB and replication factor of 3.
A user has a file "mylife" of size 520 i{B and uses the following command:
"hadoop fs-put myfi le /user/hadoop".
i) What is the size of the last block of the file when stored on HDFS?
iD How many blocks will be,stored on HDFS for the file? (04 Marks)
c. Discuss the factors considered for design of HDFS. Which are the areas where HDFS is not
a good fit today? (12 Marks)
a. What is the mechanism used by HDFS to ensure dataintegrity? How datanodes and clients
verify the data for integrity? (06 Marks)
b. What is serialization and why is it needed? Explain the process of seriahzation and
de-serialization in Hadoop. (08 Marks)
c. Explain the following in brief,
1) Hadoop streaming ii) Reduce flinction. (06 Marks)
a. Explain mapreduce workflows. (10 Marks)
b. Given a text file containing multiple words, we need to count how many times each word
appears in the file using mapreduce. Explain shuffle and sort in detail for this word count
problem using a neat diagram. (10 Marks)
a. Explain with a neat diagram, how hadoop runs amap reduce job using YARN. (t0Marks)
b. Provide overview of HBASE data model. (10 Marks)
Write a brief notes on:
a. PIG data model, i.e., data types.
b. Hive QL.
c. CASSANDRA
d. AVRO.
()
o
()
tr
E
O(l
o
0)
3<
3Rbo#
-Y-
(tr !J
=.}bo 'l
coo
.S c(o-t
ior]
ts c.)
o=.- G)
8e
aX
1;r()
(d0
o0tr(gd
t5>q
- (:
EC6
5,Y(h*
c.E
-=?.2
6*
1()
C,E
!(J
6.e> (F
ooo
c50
0J=
^!Y
=vX6)
o
(-, <
-N
0)
z
L
o
E
la.
b.
(20 Marks)

2. USN
Time: 3 hrs.
a.
b.
14SCS22
for the network shown in
(I0Ifarlcs)
Second Semester M.Tech. Degnee Exarnination, JurnelJuly 2016
AdvaRces in Gomputer Network
t')
(J
o
'_
E
a
o
C)
9i
(h
0.lX
C€U
=(aco"
troc
.i or
(gs
OJ ::
Lv
o:lg
6)
a
(.) "-l
qcc
a4
q2G)
3-
o0c
-c5
'I-
o;t,4
c-X
trEoLv
o;
at J
o..l=
s()
t(J
6.=
ceo
o=
=9
U:
U<
-
c..l
0)
Z
(g
l.i
o
o.
1a.
b.
Max. Marks:100
Note: Answer (tny FIVE full questions.
Explain the requirernents to built a computer networks that will supp;r,t different
applications. : (10 hlarks)
Brietly discuss the different performance metrics of- networks. Calculate the delay x
bandwidth product for channel rvith one way latency of lOprs and bandwidth of i00 Mbps.
(10 Plarks)
With illustration explain the sliding window algorithm.
3a
b
(10 Marks)
Explain TCP/IP layer refereuce model. Discuss two protocol layering principles. (10 Marks)
What is source routing? With an example explain three ways to handle header for source
routing. (10 Plarks)
. Describe the spanning tree algorithm. For extended LAN shown in Fig. Q3(b), assume that
bridge B1 suffers catastrophic failure. Indicate wirich ports are not selected by the spanning
tree algorithm after the recovery process and a new tree has been fbrmed. (10 NIarks)
Fie. Q3(b)
algorithm and trace the algorithma. Explain link state routing
Fig. Qa(a).
b.
Fig. Qa(a)
With an example explain the need of, subnetting. (10 Marks)

3. a. List the BGP characteristics and give the BGP path attributes.
b. Explain the following :
i) Mobile IPV4 address
iD IPV4 registration massage format.
a. Describe the format of UDP header and UDP message queue.
b. Explain different end-to-end issues in the TCP protocol.
c. Write a short note on reliable and order delivery.
Explain the principle of bit-by-bit algorithm under round robin scheme in
congestion control.
Explain the implementation of RED algorithm.
Explain the following :
i) Mapping domain names to address'
ii) Mail retrieval and mail bot manipulation protocol.
With neat diagram, explain structure and representing MIB object names.
a.
b
a.
14SC522
(10 Marks)
(10 Marks)
(08 Marks)
(06 Marks)
(06 Marks)
fair queuin-e for
(10 Marks)
(10 Marks)
(10 Marks)
(10 Marks)b.
ik****
2 cf 2

4. USN
Find the shortest path
Fig. Q3 (b). Use DAG
Fig. Q3 (a)
from the source vertex 'S' to the
shortest path algorithrn.
14SC323
2016
nemaining vertices in the DAG of
(10 Marks)
O
Q
()
L
(h
0)
o3-
Eg
dlJ
7.r)
o0 ,,
ioo
.g c
63 tf,
Y C,J
(.) c{)
Erd
Ct
o2
.ra H
()()
od ci
}E!tr=
!(g
,O
=w(t-
;e
();
?.=
6:
C,E
i6-a .=
bo-
tro0
0r=
3s?
=o)V L
(r<
-N
()
z
I(s
F
o
c-
Second Semester
Time: 3 hrs. Max. Vlarks: 100
It{ote: Answer $n7t FIVE full qwestiorxs.
a. Define and explain the various asymptotic notations with related graphs and examptres"
' (08 Marks)
b. Solve the fbllowing recurrence relation to give a tight upper bound using substitution
method.
/n 1
T(n) - 4Tl - l+ n- (06 Marks)
2)
c. Illustrate the aggregate analysis of amortized analysis on the operation INCREN{ENT in a
binary counter. (06 Marks)
2 a. Use a recursion tree to determine a good asymptotic upper bound on the recurrence
/
Trnl =2rl 1]+ n
t, t
(09 Marks)
b. State the Master theorem and solve the following recurrence relations using Master theorem.
/__
i) Ttn)=Srl Il*n
.3 /
ii) r(n)=r[4.).r (o6M8rks)
3/
c. Write the Johnson's algorithm to solve all-pairs shortest path problem for sparse graphs.
(05 Marks)
3 a. Using Bellman-Ford algorithm, find the shortest path from the source vertex 'S' to the
remaining vertices in the graph shown in the Fig. Q3 (a). (10 Marks)
b.
Fig. Q3 (b)

5. a. Starling froin the flow network shown in the Fig. Qa (a), find the
basic Ford-Fulkerson algorithm.
14SC523
maximum flow using the
(05 Marks)
)4.
b.
b" Explain the point-value representation of a polynomial lvith examptres. (07 N{arks)
c. Give the pseudocode for computing GCD of two numbers using extended form of Euclid's
algorithm. Also, frnd GCD (899, 493) and show the computational steps at each level of
recursion. (08 Marks)
Define the DF'T of a vector and also compute the DFT of the vector (0, i ,2,3). (05 Marks)
Define a grou,p and give its properties, Also, rvrite the group table fbr the muitiplicative
group modulo 15(ri, ,. i 5). (07 Marks)
Write the Chinese remainder theorem. Aiso. find ail integers that leave remainders l, 2. 3
when divided by 9, 8, 7 respectively using Chinese remainder theorem. (08 Marks)
Write the procedr-rral steps of the llSA public-key cryptosystem. Also, consider an RSA key
set with P:61, q:53 and e: 17. What vaiue of 'd'should be used in the secret key? What
is the encryption of tire rnessage N{ : 65? (10 Marks)
Write and explain the Rabin-Karp string matching algorithm. Working modrrlo q - 1 1, how
manyspurioushitsdoestheRabin-tr(arpmatcherencounterforthetextT=314159265
3 5 8 919 3 when looking forthepattern P:26? (t0Marks)
a. Explain string matching with finite automaton. Also, write the state transition diagrarn and
the transition ftlrrction 6 for the string matching automaton that accepts all the strings
containingthepattern'ababaca'andillustrateitsoperationonthetextstring'ababab
acaba'. (08Marks)
b. Computetheprefix functionn forthepatten:I'ab abb abbabb ab abbabb'inthe
alphabet I= {u,b} fbr the Knuth-Morris-Pratt algorithm. (05 Marks)
c. Apply Boyer-Moore algorithm to search for the pattern'BAOBAB'in the text
'BESS_KNEW_ABOUT_BAOBABS'. (07 Marks)
a-
I
h
b.
Explain the randomizing deterntinistic algorithms by taking linear search as
Explain Monte Carlo and Las Vegas algonthms with suitable exampies.
an example.
(10 Marks)
(10 Marks)
tt{tQ
Fig Q4 (a)
,{***{<

6. USN
Time: 3 hrs.
which determine the actual algorithm of Feistal Cipher.
Explain the Avalanche effect.
a. Explain with an example the Elgamal cryptosystem.
b. Perform encryption and decryptiolr using the RSA algorithm for I::3, Q:
M :5.
a. Explain the following: i) Caesar cipher ii) Vernam cipher.
b. Explain Diffie-Hellman key exchange.
Second Semester M.Tech. Degree Examinationo .Iuune/July 2CI 16
Infornnation and Network $ecurity
1,4SCS252
(tr2 Nlarks)
(08 Marks)
(tr2 Marks)
li, e - 7 and
(88 Marks)
(10 Marks)
(10 Marks)
Max. Marks: lGO
Note: Amswer nny F'IYE.fitll questions.
Explain the Feistal Cipher structure. Also explain the various parameter and design choices
o.)
o
o
li
;
o
q)
:i
169
oC-
6(J
;(n
-oo ll
coo
.= c
6d -t
gdi
00)ae(J
0()2
ch=
O()
do
0s cg
o
>q.G'
ss=
'oCd
3c)
OE
a-
4(')gi- r^,
TE
oj
.=5/a .)
6:
rr6
6.v
oo-
=o0()=
::. sr
=o)()
r<
_ c.t
c.)
o
z
tr
!.
o
c-
E
ia.
b.
5a.
b.
(-
a. Explain with neat diagram the generai format of X.509 certificate. (08 Marks)
b. Brietly explain fbur general categories of scheme for distribution of public keys. (12 Manks)
Differentiate betu,een conventional encryption and public key encryption. (05 Marks)
List and briefly define types of cryptanalytic attacks based on what is knor,vn to the attacker.
(05 &Earks)
Explain packet exchanges and packet fonnation of secure shell transport layer protocol.
(10 l4arks)
a. Explain in detail the IEEE 802.1 1 WLAN. (10 Marks)
b. Briefly explain architecture and record protocol operations of secure sockets layer. (10 Marks)
a. What is S/MIME? Write the functions of S/MIME. {05 $z[arks]
b. Explain application of lPsec. (S5 Marks)
c. Explain with a neat diagram encapsulating security payload format. (tr0 Marks)
a. Write the differences between version 4 and version 5 of Kerberos. (I0 Marks)
b. Describe the function flow of domain keys identified mall. (10 lvxarks)
*****