The document contains questions from an examination on Artificial Intelligence and Agent Technology. It asks students to answer any five full questions out of eight questions provided. The questions cover various topics in AI including state space search, knowledge representation using predicate logic and frames, non-monotonic reasoning, Bayesian networks, and probabilistic inference. Students are expected to explain concepts, provide examples, represent problems logically, and solve problems using appropriate AI techniques.

1. USN 14SCS23
Second Semester M.Tech. Degree Examiniltilir, June/July 2015
Adva nced Algorithm s
f,Time: 3 hrs. ax. Marksltffir
Note: Answer any FIVEfull questions. *i
.g 1 a. Use a recursion tree to determine a asymptotic upper bound on recurrencs r '- r
E T(n) = +r/r)*cn. Use the substitution method to verify your answer. ,11,.*,,,1, (10 Marks)
d,
E b. Write Johnsons algorithm for sparse graphs. Use same to find shor,teso.faths between all
: pairs of vertices in the graph of Fig. qiOi ,'rlr-.r (10 Marks)
u . ---- o---E-- -- - -e- --/
GI
g ft . -,-'-
f E c- Write Bellman-Fordp@piithm. Apply same to Fig. Q2(c) to find shortest path from source S
€t .^-^-^-:-^:,-. ----at--{
.- e - --- E-'-
; E to remaining ver{qer{l-r (10 Marks)
'8s
eE " ufu*
E $ *Eh*
; s "i*'
E E Fig. Q2 (c) S
A e dq,'r*p
E.E 4{6=&
r b q
ep fl>'!= f !,/
ho v 1s,. $
co0
()=
^
:Y &&% )
()=
=9
;-"
[ q..*W a. Write DAG-SHORTEST-PATHS algorithm Run the same the directed graph of Fig Q.3 (a)
Atpqu-.-' Using vertex r as the source. (10 Marks)Jq
-: ^i::
o
z
cd --.
E Fig. Q3 (a)o
g
g5 /-r*
BI Fio or /h ( 7Hr Fie. et (b)
E+
Fie'Qr(b)
W J
iE 'W*39'
9e ',w t
; E 2 a. Define master method. Use masior-rn4thod to give tigiri asyinpto'ric bouruis for the foiiowirrg
$f recuffences. *W
i S i) r(n) =+r(y/r)+n' _#", =+r/r)+n' (07Marks)o13
gE b. P-,"-t*".9;,1"?:::*:,t#* A--,..^^5^a^D:- ^.,, + ,--J L a .-.,^"- ]o:r:'r]

2. 14SCS23
b. Write Ford-Fulkerson method. Run the same to find maximum flow in graph of Fig Q3 (b)
0
Fig. Q3 (b)
B
4a.
b.
ryyWrite EXTENDED-EUCLID algorithm and compute the vaffih$ Id, x, y)
EXTENDED-EUCLID (99,78). trr
Define group. Draw tle group operation tables for the grgffit'
(zo,r) u"o (z;,*s) ^
1{3*
Write modular linear equation survey (a, b, n).
operation on the tex-t string T
=
(10 Marks)
that the call
(10 Marks)
(08 Marks)
(02 Marks)
(08 Marks)
(10 Marks)
(02 Marks)
aabab and illustrate its
(08 Marks)
(02 Marks)
its operation on the text
(10 Marks)
for the pattern
(10 Marks)
(10 Marks)
(10 Marks)
as an example.
(10 Marks)
a. Write Chinese remainder theorem. t,os "
b. Find all Solutions to the equation x = 2 (mffiand x = 3 (mod 13).
c. Write modular exponentiation (a, b, 11) algorithm.
&sFi"u+*r
a. Construct the string matching affiion for the pattern P -
operation on the text string T
=
affib6baabaababaab.
b. Write naive string matching_ ithm.
c. Compute the prefix functiffri for the pattem babaca and illustrate
7a.
b.
8a.
!.r
E
tt'!
q, t:_b:
:-.:1il
. re;),"*,,,**t4u
string.
T=aab
Write Boyer-M6'r& string algorithm Apply Boyer-More algorithm to search
BARBER intfue text.
r*;1,il JIM-sAw-ME-IN-A-BARBERSHoP
Expl4iff&ggregate and Accounting methods with example.
ir.!|'i,.'.,
Explain Monte Carlo and Las Vegas algorithms with appropriate examples.
Explain randomizing deterministic algorithms taking linear search algorithm
**{<{<{<
't"3
u
s
fh-
u
2 of2

3. USN
Time: 3 hrs. Max. Marks:100
Note: Answer any FIVE full questions.
I a. What are the three types of big data that are a big deal for market? Discuss briefly each nf
them. (10 Marks)
b. Analyse the operation of Distributed file system and RDBMS. (10 Marks)
What is credit analytics? How does it help in the real world? (08 Marks)
How is it possible to detect brand with Big Data in social network analysis? (06 Marks)
Consider a computer system which has four UO channels and each channel can record data
at 16MB/Sec. What is the time taken to read 2TB of data? What is the number of system
required to read all the data if the time given is 5Sec. (06 Marks)
a. How is NOSQL polyglot persistent? (03 Marks)
b. How is crowd sourcing a great way to capitahze on the resources that can build algorithms
and predictive models? to5 Marks)
c. What is data aggregation? What are different data models used in NOSQL? Give example
and explain. (12 Marks)
4 a. What is the main process of operation is master slave replication? What are the pros and
cons of maser slave replication. (10 Marks)
b. What does CAP theory convey? Give an example to support CAP theorem. (10 Marks)
5 a. With a diagram explain the sequence of events that takes place when reading a file between
the client and HDFS. (10 Marks)
b. Write two racks with a at least 5 nodes in each rack. Show two data counter and process of
pipeline replication placement when replication factor is 3. Show this distance for
i) Disrance Q
a' /r' lnt , ldl lrt ln') ii; Distance Q d tr' ln' , / d' lrt ln')
iii)Distanc. td' /l ln', ldt lr'ln') iv) Disranc. (/d' /r'ln', ld2 /r'lno)
When n', n2, fl3, fl4 nodes rl, 12, and 13 are racks and dl, d2 are data centre. (10 Marks)
6 a. What is the function of a combiner in Map reduce? How does it differ from Reduce
function? (04 Marks)
b. What is the procedure to recover from a failed name node? (05 Marks)
c. What is HDFS Federation? Explain with a diagram how Namenode , Namespace, Block
pools and common storage configuration system work. (ll Marks)
7 a. List the different failures that need to be considered for MapReduce programs running on
YARN. What is the effect of each failure. (10 Marks)
b. What are different job schedulers available in later version of Hadoop? Explain the merit
and demerit of each. (10 Marks)
8 a. What is the difference between HBASE and HDFS in Hadoop? (05 Marks)
b. How is Cassandra considered as distributed decentralized, elastic, fault tolerant and column-
oriented?
c. What are the main features of Big Latin script.
l45CS/SCB21
, June/July 2015
(10 Marks)
(05 Marks)
d
Q
,J
i
o.
E
=_:
-o
-. il
=ca
6:t
--o>
"Y
2A
+,=
!,!
a,
^:
-_=t;-
=95.e>rk
"oc= a[r
'-C
-)F>
YL
U<
-
a..l
.)
z
o
o-
2a.
b.

4. 14SCS22USN
Time: 3 hrs.
Second Semester M.Tech. Degree Examination, June/July 2015
Advances in Computer Networks
1a.
b.
.:
o
E
=^
--il
:t.=r
.= c!
Z't
!=
o>
!;n
-o>atd
-D
4..
-.=
=P
=9
)4L
cno
'-a
*o
F>
YL
U<
-41
a
Z
ts
c
o-
Note: Answer any FIVE full questions.
Describe the different cost effective resource sharing.
Max. Marks:100
(08 Marks)
(04 Marks)
following cases,
x RTT of "hand
(04 Marks)
(08 Marks)
shaking" before data is sent :
i) the band width is 1.5 Mbps, and data packets can be sent continuously
ii) the band width is 1.5 Mbps, but after we finish sending such data packet we must wait
one RTT before sending the next. (08 Marks)
2 a. What is layering principle? Explain the layering principles in TCP/P internet environment.
(08 Marks)
b. How "wide" is a bit on a 10 Gbps link? How long is a bit in copper wire, where the speed of
Define the following :i) latency ii) propagation time
iii) transmit time iv) delay X bandwidth.
c. Calculate the total time required to transfer a 1000 - KB file in the
assuming an RTT of 50 ms, a packet size of 1 KB data, and an intral2
propagation is 2.3 x 108 m/s.
c. Explain the sliding window algorithm with time line, sender and receiver window.
Fig. Q4(a)
Describe the format of a IPv4 mobility agent.
3 a. What is a bridge? What are its limitations? Illustrate the working of a learning bridge.
(10 Marks)
b. Explain the header field used in IP fragmentation. Suppose a TCP message that contains
1024 bytes of data and 20 bytes of TCP header is passed to IP for delivery across two
networks interconnected by a router. The first network has a MTU of 1024 bytes; the second
hasanMTU of 576 bytes.Givethesizesandoffsetof thesequenceof fragmentsdelivered
to destination host. Assume all IP header are 20 bvtes. (10 Marks)
4 a. Explain the distance vector routing algorithm used for the network shown in Fig .Q4(a), give
global distance vector table. Assume cost of each link is set to 1 when :
i) Initial distance stored at each node
ii) Initial routing table at node A
iii) Final routing table at node A
iv) Final distance stored at each node.
b.
(10 Marks)
(10 Marks)

5. r
5a.
b.
6a.
b.
I4SCS22
What ARP? Why is it needed? Explain the format of ARP packet and describe how ARP
function on the intemet. (10 N,Iarks)
Explain the following :
i) BGP open message
ii) BGP update message. (10 Marks)
Define spooling? With neat diagram, explain the conceptual components of an electronic
mail. (10 Marks)
What is URL? Give example of URL. Explain the GET request command with e.xample.
(10 Marks)
Explain the principle of bit - by - bit algorithm under round robin scheme, in Fair queuin_e
for congestion control. (10 Marks)
Explain RED (random early detection) congestion avoidance mechanism. (10 Marks)
a.
b.
a.
b.
Explain the network management architectural model.
Write notes on following :
i) Domain hierarchy
ii) HTTP.
(10 Marks)
(10 Marks)
*****
2 of2

6. USN
Time: 3 krs.
2a.
b.
c.
3a.
b.
c.
4a.
b.
c.
5a.
b.
6a.
b.
c.
la-
Second Semester M.Tech. Degree Examination, June/July 2015
lnformation and Network Security
Max. Marks:I00
14SC5252
(06 Marks)
(08 Marks)
(06 Marks)
(06 Marks)
(06 Marks)
(08 Marks)
(08 Marks)
(08 Marks)
(04 Marks)
(10 Marks)
(10 Marks)
la.
b.
c.
()
()
q
()
o
(JX
*(n
EO
.= a{
<d$
o ::J
ol
o2
.=5
!Y
>!,G
-o
d_g
oi.
fr.Y
6:
!o
6.Y
=qJ
o=
=.)
o-
rJ<
J6i
o)
z
(d
o
o.
Note: Answer any FIVE full qaestions.
Explain play fair cipher with an example. Also state rules to be followed in detail. (08 Marks)
Discuss Fiestal architecture in detail. (08 Marks)
Describe the effects of avalanche in DES. (04 Marks)
Discuss the design criteria of function F.
Explain the public key encryption model with a neat diagram.
Bring out the differences between symmetric and asymmetric cryptography.
Describe RSA algorithm with an example.
Explain Diffie - Hellman key exchange procedure.
Discuss ECC over arealnumber.
Describe public -key authority method of key distribution.
What are the differences between Kerberos Version 4 andVersion 5?
Write a note on federated indentify management.
Discuss threats in wireless networks.
Explain SSL architecture with a neat diagram in detail.
a.
b.
c.
d.
Bring out the companion of threats a web security. (06 Marks)
Explain with a diagram how authentication and Confidentiality are implemented in PGP
Servlces. (10 Marks)
Discuss the structure of RFC 822. (04 Marks)
Write the IP the architecture with diagram in detail. Also discuss IP the services. (10 Marks)
Explain the header of the ESP with a neat diagram. Discuss the importance of padding.
(10 Marks)
Write short notes on :
PRNG
Mutual authentication
X.509 certificate
IEEE802 wireless architecture. (20 Marks)

7. a.
'.)
t
a
.:-
'a
,
,)
!)
:: .^,
.= (-l
.,O
:>
':a,..
'
t:. --
::l
/ad
:-' i)
-|^'
:9
.N
Lll
:rZ
Z'^t,
!D
.=:
,-)
:,1
t:
''
&"J $,^ €s
USN
1
14SC524
Second Semester M.Tech Degree Examination, June/July 2015
Artificial Intelligence and Agent Technology
'l"inre: 3 hrs. Max. Marks:100
Note: Answer any FIVE.full questions.
a. Define Al and discuss any two applications of AI. (05 Marks)
b. You are given two water j ugs, a 6 - ga1lon one and 8 - gallon one. Neither of the jugs has
measuring marks on them. There is a pump that can be used to f,rli ttry jugs with water. How
can you get exactly 4 - gallons of water into 8 - gallons jug? Define the problem as a state
space and solve the probleni using state space approach.
c. Discuss any two characteristics of AI problems in detail with examples.
a. With exarnples, describe any three properties of task environments. (06 Marks)
b. Given the following initial and goal configuration of 8 - puzzle problem, use the Best
First search urethod to obtain solution path from initial to goal configuration. Specifli the
heuristic functjon used. (06 Nlarks)
Lxplain in detail the following issues in representation of knowledge.
i) Relationship amorlg attributes ii) Finding right structures as needed. (08 Marks)
Consider the following set of sentences. Represent theni in predicate logic, convert them to
clause form and prove the statement hate (marcus, Caesar) using resolution.
i) Marcus was a man ii) Marcus was a Pompeian iii) A1l Pompeian's were Romans.
iv) Caesar was a ruler v) All Romans were either loyal to Caesar or hated him
vi) Everyone is loyal to someone vii) People only try to assassinate mler's they are not
lo5,al to viii) Marcus tried to assassinate Caesar. (12 Marks)
b. Explain in detail construction of circuit based agents that operate using propositional logic.
(08 Marks)
a. With a diagram, describe non - monotonic reasoning. (04 Marks)
b. Describe the following types of non - monotonic reasoning, with an example fur each :
i) Abduction ii) Inheritance. (06 Marks)
c. State Baye's theorem and describe with an example how to perform reasoning using Baye's
network mechanism. (10 Marks)
a. Explain probabilistic inference using full joint distribution with an example. Aiso write
aigorithm for the same. (10 Marks)
Describe in detail representation of knowledge as a Frame, considering an example.
(06 Marks)
Write algorithm for property inheritance used in weak slot - & - fiiler structures. (04 Marks)
a. Write a script fcr going to a restaurant. (10 Marks)
b. With an example show that Alpha - Beta pruning method saves the search space. (10 Marks)
I of 2
(09 Marks)
(06 NIarks)
ir.
lnitial State Goal State

8. l-
I4SC524
7 a. List various ry*pes oi'learning methods and briefly explain them. (10 iltarks)
b. with an example, discuss leaming from decision trees. (10 M*rris)
8 Write short notes on the following :
a. Conjunctive Normal Form.
b. Implementation issues in non - monotonic reasoning.
c. EM algorithni.
d. Goal based agents. (20 N{arks)
#,y
2 ofZ