61. Which
of the following is/are fundamental method(s) of antialiasing?
(i) Increase of sample rate.
(ii) Treating a pixel as a finite area rather
than as a point.
(iii) Decrease of sample rate.
(A) (i) and (ii)
(B) (ii) and (iii)
(C) (i) only
(D) (ii) only
Answer: A
62. The
two color systems – the HSV and HLS are
(A) Hue, Saturation, Value and Hue,
Lightness, Saturation.
(B) High, Standard, Value and High,
Lightness, Saturation.
(C) Highly, Saturated, Value and Highly,
Lightened, Saturation.
(D) Highly, Standard, Value and Hue,
Lightness, Saturation.
Answer: A
63. The
parametric representation of the line segment between the position vectors P1(2,
3) and P2(5, 4) is given as
(A) x(t)= 2+7t, y(t) = 3+7t 0 ≤ t ≤ ∝
(B) x(t)=2+10t, y(t) = 3+12t 0 ≤ t ≤ 1
(C) x(t)= 2+3t, y(t)=3+t 0 ≤ t ≤ 1
(D) t(x, y) = 14t 0 ≤ t ≤ 1
Answer: C
64. Consider
the following transformation matrix for rotation(clockwise) :
This matrix rotates an object by an angle θ
about :
(A) X-axis
(B) Y-axis
(C) Z-axis
(D) All of the above
Answer: C
65. Consider
the following sequence of operations :
(i) Pointer p1 is set to point at a new
heap-dynamic variable.
(ii) Pointer p2 is assigned p1’s value.
(iii) The heap dynamic variable pointed to by
p1 is explicitly de-allocated, but p2 is not changed by the operation.
This situation leads to which of the following
:
(A) p1 becomes a dangling pointer
(B) p2 becomes a dangling pointer
(C) Both p1 and p2 are now dangling pointers
(D) Neither p1 nor p2 is now a dangling
pointer
Answer: B
66. The
programming languages C and C++ are not strongly typed languages because :
(A) Both C and C++ allow functions for which
parameters are not type checked.
(B) Both C and C++ allow functions for which
parameters are type checked.
(C) Both C and C++ allow functions for which
parameters are not type checked and also the union types in these languages are
not type checked.
(D) Union types in these (C and C++)
languages are not type checked.
Answer: C
67. The
tracing model in Prolog describes program execution in terms of certain events.
These events are
(A) call and exit
(B) call and fail
(C) call, exit and redo
(D) call, exit, redo and fail
Answer: D
68. Which
of the following statements is not correct with reference to distributed
systems?
(A) Distributed system represents a global
view of the network and considers it as a virtual uni-processor system by
controlling and managing resources across the network on all the sites.
(B) Distributed system is built on bare
machine, not an add-on to the existing software.
(C) In a distributed system, kernel provides
smallest possible set of services on which other services are built. This
kernel is called microkernel. Open servers provide other services and access to
shared resources.
(D) In a distributed system, if a user wants
to run the program on other nodes or share the resources on remote sites due to
their beneficial aspects, user has to log on to that site.
Answer: D
69. A
system contains 10 units of resource of same type. The resource requirement and
current allocation of these resources for three processes P, Q and R are as
follows :
Now, consider the following resource requests
:
(i) P makes a request for 2 resource units.
(ii) Q makes request for 2 resources units.
(iii) R makes a request of 2 resource units.
For a safe state, which of the following
options must be satisfied?
(A) Only request (i)
(B) Only request (ii)
(C) Only request (iii)
(D) Request (i) and (ii)
Answer: C
70. Consider
the following set of processes with the length of CPU burst time in
milliseconds (ms) :
Assume that processes are stored in ready
queue in following order :
A – B – C – D – E
Using round robin scheduling with time slice
of 1 ms, the average turn around time is
(A) 8.4 ms
(B) 12.4 ms
(C) 9.2 ms
(D) 9.4 ms
Answer: A
0 Comments