Placement Papers - Wipro

Wipro Paper At Anna University

(A)0
(B)8
(C) 9
(D) 10



43. What is the difference between public and private inheritance?

(A) under the public inheritance ,public and protected members of the base class have the same status in the derived class.
(B)under private inheritance ,public and protected members of the base class all become private members of the derived class.
(C)both A &B
(D) none of these.



44.inheritance facilitates reusability because

(A) child object cannot be modified.
(B)the base class need not be modified to derive a new class.
(C)derived class objects inherit only the desirable feature of the base class.
(D) objects of the base class can be treated as objects of the derived class.



45.the ability for the processor to delegate its use by application is called?

(A) cooperative multitasking
(B) preemptive multitasking
(C) time slicing
(D)sharing



46.a thread differs from a lightweight process in that :

(A)threads have a parent process

(B)threads share process?s resources but light weight process do not.

(D)threads run in user space ,but light weight thread run in kernel space.



47.the login prompt can be changed by changing the contents of the file

(A)initab
(B) init
(C) passwd
(D)gettydefs





48.which command is used to delete all files in the current directory as well as all files and sub directories in its sub directory?

(A)rm*
(B)rm-r*
(C)rm all
(D)rm *.*



49. when all the elements above the main diagonal of a square matrix are zero ,then the matrix is said to be ?lower triangular matrix? .consider that such a matrix A is represented in an array A[1:n*(n+1)/2)], such that the elements aij are stored by rows in the array ,what is the addressing formula for element aij.(i.j=[1:n])

(A)(j*(j+1)/2)+1
(B) (i*(i+1)/2)+j
(C)(i*(i-1)/2)+j
(D) (j*(j-1)/2)+1



50.an algorithm for searching a large sorted array for a specific entry x compares every fourth item in the array to x until it finds one that is larger than or equal to x. whenever a larger item is found ,the algorithm examines the preceding three entries .if the array is sorted smallest to the largest ,which of the following describes all cases when this algorithm might use fewer comparisons to find x than would a binary tree search?

(A)it will never use fewer comparisons.
(B)when x is very close to the beginning of the array .
(C)when x is in the middle position in the array
(D)when x is very close to the end of the array