". VdoTips: COMPUTER FUNDAMENTAL PRACTICE SET 32

APPLY LATEST GOVT JOBS

hi

COMPUTER FUNDAMENTAL PRACTICE SET 32

247. DFD is a
(A)Dataflow Graph (or) bubble chart
(B).Flow Chart
(C). Procedural chart
(D).Structural Chart 248. The worst case time complexity of AVL tree is better in comparison to binary search tree for
(A). Search and Insert Operations
(B). Search and Delete Operations
(C). Insert and Delete Operations
(D). Search, Insert and Delete Operations

(A). 249. The GSM network is divided into the following three major systems:
(A). SS, BSS, OSS
(B). BSS, BSC, MSC
(C). CELL, BSC, OSS
(D). SS, CELL, MSC

(B). 250. If the disk head is located initially at 32, find the number of disk moves required with FCFS if the disks queue of I/O blocks requests are 98, 37, 14, 124, 65, 67.
(A). 239
(B). 310
(C). 321
(D). 325

(B).