8. Write only the correct answer in the Answer Book. Do not reproduce the questions.

(1) If the highest frequency of a signal is 2100 Hz and lowest frequency of a signal is 200 Hz, sample rate will be:
(a) 4000 Hz
(b) 4600 Hz
(c) 4200 Hz
(d) 2300 Hz
(e) None of these

(2) A 56 K modem can download at a rate of _________ Kbps and upload at a rate of _________ Kbps.
(a) 33.6; 33.6
(b) 33.6; 56.6
(c) 56.6; 33.6
(d) 56.6; 56.6
(e) None of these

(3) A system call provides interface between:
(a) A process and a thread
(b) A thread and a user program
(c) A process and an operating system
(d) A process and a user program
(e) None of these

(4) CPU scheduling information about a process is held by:
(a) a PC
(b) the CPU Register
(c) the Cache
(d) a PCB
(e) None of these

(5) An example of Last-In-First-Out (LIFO) data structure is a:
(a) Class
(b) List
(c) Stack
(d) Tree
(e) None of these

(6) In Object Oriented Programming, overload methods:
(a) Can have the same types and number of parameters as another method with the same name in the same class as long as the return type is different.
(b) Cannot be used as methods that manipulate attributes
(c) Must always have different number of parameters
(d) Must have different number of parameters or if the number of parameters is the same a different sequence of parameter type
(e) None of these

(7) If you wanted to sort many large objects or structures, it would be most efficient to:
(a) Place them in an array and sort the array
(b) Place pointers to them in an array and sort the array
(c) Place them in a linked list and sort the linked list
(d) Place references to them in an array and sort the array
(e) None of these

(8) The type of the variable a pointer points to must be part of the pointer’s definition so that:
(a) Data types do not get mixed up when arithmetic is performed on them.
(b) Pointers can be added to one another to access structure members
(c) No one’s religious conviction will be offended
(d) The computer can perform overloading
(e) None of these

(9) If we have a tree of n nodes, its depth can be calculated as:
(a) Log2 (n+1) – 1
(b) Log2 n
(c) Log2 (n+1) – 1
(d) Log10 (n+1) – 1
(e) None of these

(10) Which one of the following methods does not change the original value of the argument in the calling function?
(a) Call by passing reference of the argument
(b) Call by passing the address of the argument
(c) Call by passing value of the argument
(d) Call by passing pointer of the argument
(e) None of these


(B) Write short notes on the following:

(a) Virtual Memory
(b) VLAN
(c) 802.11b
(d) BIOS
(e) FAT32

__________________
The Me you have always known, the Me that's a stranger still.