1081. Which statements about multiplexing are correct? A. FDM applies when link BW > sum signals BW. B. WDM is analog. C. WDM is digital. D. TDM is digital.

Data Communication and Computer Networks • Multiplexing Techniques • JULY 2016

1082. If link transmits 4000 frames/s and each slot has 8 bits, TDM circuit rate is:

Data Communication and Computer Networks • Multiplexing: TDM Rate • JULY 2016

1083. In fully-connected mesh with 10 nodes, cables needed and ports per device?

Data Communication and Computer Networks • Network Topologies • JULY 2016

1084. Optical fiber uses reflection; angle of incidence must be ____ critical angle.

Data Communication and Computer Networks • Optical Communication • JULY 2016

1085. Pure ALOHA with 200-bit frames at 200 Kbps, system generates 500 fps. Throughput is:

Data Communication and Computer Networks • Random Access Protocols • JULY 2016

1086. Attacker captures and replays altered info between client and banker. Attack is?

Data Communication and Computer Networks • Security Attacks • JULY 2016

1087. In TCP/IP model, which layer lets hosts inject packets independently?

Data Communication and Computer Networks • TCP/IP Model • JULY 2016

1088. Multiplexer combining four 100 Kbps channels with 2-bit timeslots yields bit rate of?

Data Communication and Computer Networks • Time-Division Multiplexing • JULY 2016

1089. Which is NOT correct about HTML?

Data Communication and Computer Networks • Web Technologies: HTML • JULY 2016

1090. Expected inversions in random permutation of n distinct elements is θ(?) .

Data Structures and Algorithms • Analysis of Algorithms: Inversions • JULY 2016

1091. Which search path could NOT occur in BST of 1–100 when searching 364? Sequences given.

Data Structures and Algorithms • Binary Search Trees • JULY 2016

1092. Number of different binary trees with 6 nodes is:

Data Structures and Algorithms • Combinatorics: Binary Trees • JULY 2016

1093. Match algorithms to complexities: (a) Huffman (b) Polygon triangulation (c) Activity selection (d) Quicksort → O(n²), θ(n³), θ(n), O(n lg n).

Data Structures and Algorithms • Greedy & Divide-Conquer • JULY 2016

1094. Which array is a max‐heap? [1] [26,13,17,14,11,9,15] [2] [26,15,14,17,11,9,13] [3] [26,15,17,14,11,9,13] [4] [26,15,13,14,11,9,17]

Data Structures and Algorithms • Heaps: Max‐Heap Property • JULY 2016

1095. Stack size 5: Push(a); Pop(); Push(b); Push(c); Pop(); Push(d); Pop(); Pop(); Push(e). What occurs?

Data Structures and Algorithms • Stacks • JULY 2016

1096. Which is not an inherent application of stack?

Data Structures and Algorithms • Stacks – Applications • JULY 2016

1097. In the given BST, if we remove the root, which node from left subtree replaces it?

Data Structures and Algorithms • Trees – BST Deletion • JULY 2016

1098. For a full binary tree (zero or two children) with n nodes, maximum height is?

Data Structures and Algorithms • Trees – Height • JULY 2016

1099. In RDBMS, the constraint that no key attribute may be NULL is called?

Databases • Constraints – Entity Integrity • JULY 2016

1100. (A) Data scrubbing upgrades data quality before moving to DW; (B) Scrubbing rejects data from DW to create indexes. Which?

Databases • Data Warehousing • JULY 2016