41. Active X controls are Pentium binary programs that can be embedded in ________
(A) Word pages
(B) URL pages
(C) Script pages
(D) Web pages
42. Match the following :
List – I List – II
a. Wireless Application Environment i. HTTP
b. Wireless Transaction Protocol ii. IP
c. Wireless Datagram Protocol iii. Scripts
d. Wireless iv. UDP
Codes :
a b c d
(A) ii iv i iii
(B) iv iii ii i
(C) iv iii i ii
(D) iii i iv ii
43. Which of the following is widely used inside the telephone system for long-haul data traffic ?
(A) ISDN
(B) ATM
(C) Frame Relay
(D) ISTN
44. The document standards for EDI were first developed by large business house during the 1970s and are now under the control of the following standard organisation :
(A) ISO
(B) ANSI
(C) ITU-T
(D) IEEE
45. Electronic Data Interchange Software consists of the following four layers :
(A) Business application, Internal format conversion, Network translator, EDI envelope
(B) Business application, Internal format conversion, EDI translator, EDI envelope
(C) Application layer, Transport layer, EDI translator, EDI envelope
(D) Application layer, Transport layer, IP layer, EDI envelope
46. Consider a preemptive priority based scheduling algorithm based on dynamically changing priority.Larger priority number implies higher priority. When the process is waiting for CPU in the ready queue (but not yet started execution), its priority changes at a rate a = 2. When it starts running, its priority changes at a rate b = 1. All the processes are assigned priority value 0 when they enter ready queue. Assume that the following processes want to execute :
Process ID Arrival Time Service Time
P1 0 4
P2 1 1
P3 2 2
P4 3 1
The time quantum q = 1. When two processes want to join ready queue simultaneously, the process which has not executed recently is given priority. The finish time of processes P1, P2, P3 and P4 will respectively
be
(A) 4, 5, 7 and 8
(B) 8, 2, 7 and 5
(C) 2, 5, 7 and 8
(D) 8, 2, 5 and 7
47. The virtual address generated by a CPU is 32 bits. The Translation Look-aside Buffer (TLB) can hold total 64 page table entries and a 4-way set associative (i.e. with 4-cache lines in the set). The page size is 4 KB. The minimum size of TLB tag is
(A) 12 bits
(B) 15 bits
(C) 16 bits
(D) 20 bits
48. Consider a disk queue with request for input/output to block on cylinders 98, 183, 37, 122, 14, 124, 65, 67 in that order. Assume that disk head is initially positioned at cylinder 53 and moving towards cylinder number 0. The total number of head movements using Shortest Seek Time First (SSTF) and SCAN algorithms are respectively
(A) 236 and 252 cylinders
(B) 640 and 236 cylinders
(C) 235 and 640 cylinders
(D) 235 and 252 cylinders
49. How much space will be required to store the bit map of a 1.3 GB disk with 512 bytes block size ?
(A) 332.8 KB
(B) 83.6 KB
(C) 266.2 KB
(D) 256.6 KB
50. Linux operating system uses
(A) Affinity Scheduling
(B) Fair Preemptive Scheduling
(C) Hand Shaking
(D) Highest Penalty Ratio Next
0 comments:
Post a Comment