201. Risk factors in e-payment systems include?

Data Communication and Computer Networks • E-Payment Security • DEC 2012

202. IP packet with M-bit=1 and offset=0 is which fragment?

Data Communication and Computer Networks • IP Fragmentation • DEC 2012

203. MAP in mobile runs atop which protocol?

Data Communication and Computer Networks • Mobile Networking (MAP) • DEC 2012

204. Coaxial cable RG-59 (75 Ω) is used for?

Data Communication and Computer Networks • Transmission Media • DEC 2012

205. Example of dictionary-based coding is:

Data Communication and Computer Networks • Data Compression • DEC 2012

206. Delaying outgoing ACKs to attach them to next data frame is called

Data Communication and Computer Networks • Data Link • DEC 2012

207. Match HTML tags CITE(i), EM(ii), VAR(iii), SAMP(iv):

Data Communication and Computer Networks • HTML Semantics • DEC 2012

208. In classful addressing, IP 123.23.156.4 belongs to Class

Data Communication and Computer Networks • IP Addressing • DEC 2012

209. GSM network is divided into which three systems?

Data Communication and Computer Networks • Mobile Systems • DEC 2012

210. Match layers to protocols: (a) App (b) Trans (c) Net (d) Data link — (1) TCP (2) HDLC (3) HTTP (4) BGP

Data Communication and Computer Networks • Protocol Stack • DEC 2012

211. Using RSA p=3,q=11,d=7,M=5, ciphertext C is

Data Communication and Computer Networks • Public-Key Cryptography • DEC 2012

212. Which provides a TCP/IP interface on Windows95/NT?

Data Communication and Computer Networks • Windows Networking • DEC 2012

213. Which is a collection of templates and rules for XML transformation?

Data Communication and Computer Networks • XML Technologies • DEC 2012

214. A tree where each node’s subtrees differ in height ≤1 is?

Data Structures and Algorithms • Balanced Trees (AVL) • DEC 2012

215. In a tree, vertices with minimal eccentricity (centers) are?

Data Structures and Algorithms • Graph Theory • DEC 2012

216. Hash f(k)=k mod 13, linear probing, existing keys 55,58,68,91,27,145; location for 79?

Data Structures and Algorithms • Hashing (Open Addressing) • DEC 2012

217. Empty stack: push1,push2,pop,push3,push4,pop,pop,push5,pop. Top = ?

Data Structures and Algorithms • Stack Operations • DEC 2012

218. Worst-case time complexity of AVL tree vs BST is better for?

Data Structures and Algorithms • Balanced Trees • DEC 2012

219. Circuit steady-state Y=1. Possible values A,B,C are?

Data Structures and Algorithms • Combinational Circuits • DEC 2012

220. Match algorithms to complexities: (a) Bellman–Ford (b) Kruskal (c) Floyd–Warshall (d) Topological sort — (1) O(m log n) (2) O(n³) (3) O(m n) (4) O(n+m)

Data Structures and Algorithms • Graph Algorithms • DEC 2012