COMPUTER SCIENCE AND APPLICATIONS

Paper – III
Qu
Note : This paper contains seventy five (75) objective type questions of two (2) marks each.
All questions are compulsory.
1. Consider the following pseudocode 4. What is Granularity ?
segment : (A) The size of database
K:=0 (B) The size of data item
for i1:= l to n (C) The size of record
for i2:= 1 to i1 (D) The size of file
e
:
: 5. Suppose that a given application is run
: on a 64-processor machine and that
for im:= 1 to im–1
sti
70 percent of the application can be
K:= K+1 parallelized. Then the expected
The value of K after the execution of performance improvement using
this code shall be Amdahl’s law is
(A) C(n + m – 1, m) (A) 4.22 (B) 3.22
(B) C(n – m + 1, m) (C) 3.32 (D) 3.52
o
(C) C(n + m – 1, n)
(D) C(n – m + 1, n)
6. If two fuzzy sets A and B are given
2. In Delta Rule for error minimization with membership functions
nP
(A) weights are adjusted [Link] µA(x) = {0.2, 0.4, 0.8, 0.5, 0.1}
change in the output µB(x) = {0.1, 0.3, 0.6, 0.3, 0.2}
(B) weights are adjusted [Link]
difference between desired Then the value of µ ––– will be
output and actual output A∩B
(C) weights are adjusted [Link] (A) {0.9, 0.7, 0.4, 0.8, 0.9}
difference between input and (B) {0.2, 0.4, 0.8, 0.5, 0.2}
ap

output (C) {0.1, 0.3, 0.6, 0.3, 0.1}

(D) none of the above (D) {0.7, 0.3, 0.4, 0.2, 0.7}

3. The concept of pipelining is most 7. Match the following :

effective in improving performance if (i) OLAP (a) Regression
the tasks being performed in different
(ii) OLTP (b) Data Warehouse
re

stages :
(iii) Decision (c) RDBMS
(A) require different amount of time
Tree
(B) require about the same amount of
time (iv) Neural (d) Classification
Network
(C) require different amount of time
(i) (ii) (iii) (iv)
.O

with time difference between any

two tasks being same (A) (b) (c) (a) (d)
(D) require different amount with (B) (b) (c) (d) (a)
time difference between any two (C) (c) (b) (a) (d)
tasks being different (D) (c) (b) (d) (a)
Paper-III 2 J-87-12
rg
 8. Which level of Abstraction describes 14. If the pixels of an image are shuffled
what data are stored in the Database ? then the parameter that may change is
Qu
(A) Physical level (A) Histogram (B) Mean
(B) View level (C) Entropy (D) Covariance
(C) Abstraction level
(D) Logical level
15. The common property of functional
9. The problem that occurs when one language and logical programming
transaction updates a database item and language :
then the transaction fails for some (A) Both are declarative
e
reason is ________. (B) Both are based on λ-calculus
(A) Temporary Select Problem
(C) Both are procedural
(B) Temporary Modify Problem
sti
(C) Dirty Read Problem (D) Both are functional
(D) None
16. Given the following statements :
10. In an image compression system 16384 (i) The power of deterministic finite
bits are used to represent 256 × 256 state machine and non-
image with 256 gray levels. What is
o
deterministic finite state machine
the compression ratio for this system ? are same.
(A) 1 (B) 2 (ii) The power of deterministic
(C) 4 (D) 8
nP
pushdown automaton and non-
deterministic pushdown automaton
11. X.25 is ________ Network. are same.
(A) Connection Oriented Network Which of the above is the correct
(B) Connection Less Network statement(s) ?
(C) Either Connection Oriented or
(A) Both (i) and (ii)
Connection Less
(B) Only (i)
ap

(D) Neither Connection Oriented nor

Connection Less (C) Only (ii)
(D) Neither (i) nor (ii)
12. Which of the following can be used for
clustering of data ?
(A) Single layer perception 17. Let Q(x, y) denote “x + y = 0” and let
there be two quantifications given as
(B) Multilayer perception
re

(C) Self organizing map (i) ∃y∀x Q(x, y)

(D) Radial basis function (ii) ∀x∃y Q(x, y)
where x & y are real numbers. Then
13. Which of the following is scheme to which of the following is valid ?
deal with deadlock ?
.O

(A) (i) is true & (ii) is false.

(A) Time out
(B) Time in (B) (i) is false & (ii) is true.
(C) Both (A) & (B) (C) (i) is false & (ii) is also false.
(D) None of the above (D) both (i) & (ii) are true.
J-87-12 3 Paper-III
rg
 18. Consider a schema R(A, B, C, D) and 22. The transform which possesses the
functional dependencies A → B and highest ‘energy compaction’ property
C → D. Then the decomposition is
Qu
R1(A, B) and R2(C, D) is (A) Slant transform
(A) Dependency preserving but not (B) Cosine transform
lossless join (C) Fourier transform
(B) Dependency preserving and (D) Karhunen-Loeve transform
lossless join
(C) Lossless Join but not dependency 23. Which one of the following prolog
preserving programs correctly implement “if G
e
succeeds then execute goal P else
(D) Lossless Join
execute goal θ ?”
(A) if-else (G, P, θ) :- !, call(G), call(P).
sti
19. The quantiser in an image-compression if-else (G, P, θ) :- call(θ).
system is a
(B) if-else (G, P, θ) :- call(G), !, call(P).
(A) lossy element which exploits the
if-else (G, P, θ) :- call(θ).
psychovisual redundancy
(C) if-else (G, P, θ) :- call(G), call(P), !.
(B) lossless element which exploits
the psychovisual redundancy if-else (G, P, θ) :- call(θ).
o
(D) All of the above
(C) lossy element which exploits the
statistical redundancy
24. The _______ memory allocation
(D) lossless element which exploits
nP
function modifies the previous
the statistical redundancy
allocated space.
(A) calloc( ) (B) free( )
20. Data Warehouse provides (C) malloc( ) (D) realloc( )
(A) Transaction Responsiveness
(B) Storage, Functionality Respon- 25. Which is not the correct statement(s) ?
siveness to queries (i) Every context sensitive language
ap

(C) Demand and Supply is recursive.

Responsiveness (ii) There is a recursive language that
(D) None of the above is not context sensitive.
(A) (i) is true, (ii) is false.
(B) (i) is true and (ii) is true.
21. A* algorithm uses f ' = g + h' to estimate
(C) (i) is false, (ii) is false.
re

the cost of getting from the initial state

to the goal state, where g is a measure (D) (i) is false and (ii) is true.
of the cost of getting from initial state
to the current node and the function h' 26. The mechanism that binds code and
is an estimate of the cost of getting data together and keeps them secure
from outside world is known as
.O

from the current node to the goal state.

To find a path involving the fewest (A) Abstraction
number of steps, we should set (B) Inheritance
(A) g = 1 (B) g = 0 (C) Encapsulation
(C) h' = 0 (D) h' = 1 (D) Polymorphism
Paper-III 4 J-87-12
rg
 27. Identify the addressing modes of below 32. The equivalent grammar corresponding
instructions and match them : to the grammar G : S → aA, A → BB,
Qu
(a) ADI (1) Immediate addressing B → aBb | ∈ is
(b) STA (2) Direct addressing (A) S → aA, A → BB, B → aBb
(c) CMA (3) Implied addressing (B) S → a|aA, A → BB, B → aBb | ab
(d) SUB (4) Register addressing (C) S → a | aA, A → BB | B, B → aBb
(A) a – 1, b – 2, c – 3, d – 4 (D) S → a | aA, A → BB | B, B → aBb | ab
(B) a – 2, b – 1, c – 4, d – 3 (a)
(C) a – 3, b – 2, c – 1, d – 4 33.
(d) Which one of the following statements
(D) a – 4, b – 3, c – 2, d – 1 is incorrect ?
e
(A) The number of regions
28. Which one of the following is not a corresponds to the cyclomatic
Greibach Normal form grammar ? complexity.
(B) Cyclometric complexity for a
sti
(i) S → a | bA | aA | bB
A→a flow graph G is V(G) = N – E + 2,
B→b where E is the number of edges
and N is the number of nodes in
(ii) S → a | aA | AB the flow graph.
A→a (C) Cyclometric complexity for a
B→b
o
flow graph G is V(G) = E – N + 2,
(iii) S → a | A | aA where E is the number of edges
A→a & N is the number of nodes in
the flow graph.
nP
(A) (i) and (ii)
(B) (i) and (iii) (D) Cyclometric complexity for a
(C) (ii) and (iii) flow graph G is V(G) = P + 1,
(D) (i), (ii) and (iii) where P is the number of
predicate nodes contained in the
29. Which of the following IP address flow graph G.
class is a multicast address ? 34. Consider a weighted undirected graph
(A) Class A (B) Class B with positive edge weights and let
ap

(C) Class C (D) Class D (u, v) be an edge in the graph. It is

known that the shortest path from
30. While unit testing a module, it is found source vertex s to u has weight 53 and
shortest path from s to v has weight
that for a set of test data, maximum 65. Which statement is always true ?
90% of the code alone were tested with (A) Weight (u, v) < 12
a probability of success 0.9. The (B) Weight (u, v) = 12
re

reliability of the module is (C) Weight (u, v) > 12

(A) atleast greater than 0.9 (D) Weight (u, v) > 12
(B) equal to 0.9
(C) atmost 0.81 35. Consider the regular expression (a + b)
(a + b) … (a + b) (n-times). The
(D) atleast 1/0.81 minimum number of states in finite
.O

automaton that recognizes the language

31. The upper bound of computing time of represented by this regular expression
m coloring decision problem is contains
(A) O(nm) (B) O(nm) (A) n states (B) n + 1 states
(C) O(nmn) (D) O(nmmn) (C) n + 2 states (D) 2n states
J-87-12 5 Paper-III
rg
 36. Number of binary trees formed with 5 42. Which one of the following binary
nodes are search tree is optimal, if probabilities
(A) 32 (B) 36 of successful search and unsuccessful
Qu
(C) 120 (D) 42 search are same ?

37. Are we building the right product ?

This statement refers to (A)
(A) Verification
(B) Validation
(C) Testing
(D) Software quality assurance
e
38. The following postfix expression is
evaluated using a stack
sti
823^/23* + 51* – (B)
The top two elements of the stack after
first * is evaluated
(A) 6, 1 (B) 5, 7
(C) 3, 2 (D) 1, 5
o
39. The following CFG
S → aB | bA, A → a | as | bAA,
B → b | bs | aBB (C)
nP
generates strings of terminals that have
(A) odd number of a’s and odd
number of b’s
(B) even number of a’s and even
number of b’s
(C) equal number of a’s and b’s (D)
(D) not equal number of a’s and b’s
ap

40. Consider the following pseudo-code :

If (A > B) and (C > D) then
A=A+1
B=B+1 43. The regular expression for the
Endif following DFA
The cyclomatic complexity of the
re

pseudo-code is
(A) 2 (B) 3
(C) 4 (D) 5 is
41. Which layer of OSI reference model (A) ab*(b + aa*b)*
uses the ICMP (Internet Control
.O

Message Protocol) ? (B) a*b(b + aa*b)*

(A) Transport layer (C) a*b(b* + aa*b)
(B) Data link layer
(C) Network layer (D) a*b(b * + aa*b)*
(D) Application layer
Paper-III 6 J-87-12
rg
 44. Which diagram provides a formal 48. If an instruction takes ‘i’ microseconds
graphic notation for modelling objects, and a page fault takes an additional ‘j’
microseconds. The effective instruction
Qu
classes and their relationships to one
time, if on the average a page fault
another ? occurs every k instructions, is
(A) Object diagram (A) i + j/k (B) i + j * k
(B) Class diagram (C) (i + j)/k (D) (i + j) * k
(C) Instance diagram 49. In any simplex table, if corresponding
(D) Analysis diagram to any negative ∆j, all elements of the
column are negative or zero, the
45. A computer system supports 32 bit solution under the test is
e
virtual address as well as 32 bit (A) degenerate solution
physical addresses. Since the virtual (B) unbounded solution
(C) alternative solution
address space is of same size as that of
(D) non-existing solution
sti
physical address space, if we want to
get rid of virtual memory, which one of 50. How many relations are there on a set
the following is true ? with n elements that are symmetric and
(A) Efficient implementation of a set with n elements that are reflexive
multiuser support is no longer and symmetric ?
possible. (A) 2n(n+1)/2 and 2n.3n(n–1)/2
o
(B) The processor cache can be made (B) 3n(n–1)/2 and 2n(n–1)
more efficient. (C) 2n(n+1)/2 and 3n(n–1)/2
(C) Hardware support for memory
(D) 2n(n+1)/2 and 2n(n–1)/2
nP
management is not needed.
(D) CPU scheduling can be made 51. The strategy used to reduce the number
more efficient. of tree branches and the number of
static evaluations applied in case of a
game tree is
46. The feasible region represented by the (A) Minmax strategy
constraints x1 – x2 < 1, x1 + x2 > 3, (B) Alpha-beta pruning strategy
x1 > 0, x2 > 0 of the objective function (C) Constraint satisfaction strategy
ap

(D) Static max strategy

Max Z = 3x1 + 2x2 is
(A) A polygon 52. Match the following :
(i) Regular (a) Pushdown
(B) Unbounded feasible region Grammar automaton
(C) A point (ii) Context free (b) Linear
(D) None of these Grammar bounded
automaton
re

47. The colour of an object is largely (iii) Unrestricted (c) Deterministic

Grammar finite
determined by its diffuse reflection automaton
coefficient. If Kd = (0.8, 0.4, 0), then (iv) Context (d) Turing
what shall be the colour of the object, Sensitive machine
if the light used is blue and magenta ? Grammar
.O

(A) White and Red (i) (ii) (iii) (iv)

(A) (c) (a) (b) (d)
(B) Red and Blue (B) (c) (a) (d) (b)
(C) Black and White (C) (c) (b) (a) (d)
(D) Black and Red (D) (c) (b) (d) (a)
J-87-12 7 Paper-III
rg
 53. Consider the below circuit and find the 57. A user level process in Unix traps the
output function f(x, y, z). signal sent on a Ctrl + C input and has
a signal handling routine that saves
appropriate files before terminating the
Qu
process. When a Ctrl + C input is given
to this process, what is the mode in
which the signal handling routine
executes ?
(A) User mode
(B) Kernel mode
– –
(A) xz + xy + yz (C) Superuser mode
(D) Privileged mode
(B) x–z + xy + –y –z
e
–– 58. A CPU generally handles an interrupt
(C) xz + xy + y z by executing an interrupt service
(D) xz + x–y + –yz routine
sti
(A) as soon as an interrupt is raised
(B) by checking the interrupt register
54. What is the size (in terms of bits) of at the end of fetch cycle
Header length field in IPV4 header ? (C) by checking the interrupt register
(A) 2 (B) 4 after finishing the executing the
(C) 8 (D) 16 current instruction
o
(D) by checking the interrupt register
at fixed time intervals
55. Match the following with respect to
[Link].* class methods : 59. The perspective projection matrix, on
nP
the view plane z = d where the centre
(a) Bit Set (i) Time zone
of projection is the origin (0, 0, 0) shall
getTimezone( )
be
(b) Calendar (ii) int hashcode( )
(c) Time zone (iii) int nextInt( )  0 0 0 d

(d) Random (iv) Void setID(String (A)
 0 0 d 0 
tzName)  0 d 0 0 
ap

(a) (b) (c) (d)  d 0 0 1 

(A) (ii) (i) (iv) (iii)  d 0 0 0

(B) (iii) (iv) (i) (ii)
(B)
 0 d 0 0 
(C) (iv) (iii) (ii) (i)  0 0 d 0 
(D) (ii) (i) (iii) (iv)  0 0 1 0 
re

 0 0 0 d

56. ______ is sometimes said to be object
oriented, because the only way to (C)
 0 0 d 0 
manipulate kernel objects is by  0 d 0 0 
invoking methods on their handles.  1 0 0 0 
 d 0 0 0

.O

(A) Windows NT
(B) Windows XP
(D)
 0 d 0 0 
(C) Windows VISTA  0 0 d 0 
(D) Windows 95/98  0 0 0 1 
Paper-III 8 J-87-12
rg
 60. Radio signals generally propagate 63. If a and b are the end points of a line,
according to the following then which one of the following is true ?
Qu
mechanisms:
(A) If both end points are left, right,
(A) Modulation, Amplification,
above or below the window, the
Scattering
line is invisible.
(B) Reflection, Diffraction, Scattering
(B) If both end points are left, right,
(C) Amplification, Diffraction,
Modulation above or below the window, the
line is completely visible.
(D) Reflection, Amplification,
e
Diffraction (C) If both end points are left, right,
above or below the window, the
line is trivially visible.
61. Identify the devices given below with
sti
their IC numbers : (D) If both end points are left, right,
(i) USART (a) 8251 above or below the window, the
(ii) Micro controller (b) 8051 line is trivially invisible.
(iii) Interrupt controller (c) 8259
o
(iv) DMA controller (d) 8257 64. Match the following with link quality
(i) (ii) (iii) (iv) measurement and handoff initiation :
(A) (a) (b) (c) (d) (a) Networked- (i) MS connect to
nP
(B) (b) (a) (d) (c) Controlled BS
(C) (c) (d) (a) (b) Handoff
(NCHO)
(D) (d) (a) (b) (c)
(b) Mobile- (ii) Process via
Assisted channel the
62. The optimal solution of the following
Handoff target BS
ap

assignment problem using Hungarian

method is (MAHO)
I II III IV (c) Forward (iii) First Generation
Handoff Analog Cellular
A 8 26 17 11
System
B 13 28 4 26
(d) Hard (iv) Second Genera-
re

C 38 19 18 15 Handoff tion Digital

Cellular System
D 19 26 24 10
(a) (b) (c) (d)
(A) (B) (C) (D)
(A) (I) (II) (III) (IV) (A) (iii) (iv) (ii) (i)
.O

(B) (I) (III) (II) (IV) (B) (ii) (iii) (i) (iv)
(C) (I) (III) (IV) (II) (C) (ii) (i) (iv) (iii)
(D) (I) (IV) (II) (III) (D) (iv) (iii) (i) (ii)
J-87-12 9 Paper-III
rg
 65. Consider the methods used by 68. HTML is defined using SGML – an
processes P1 and P2 for accessing their _______ standard, information
processing-text and office systems
critical sections. The initial values of
Qu
(SGML) for text information
shared Boolean variables S1 and S2 are processing.
randomly assigned,
(A) ISO – 8878
P1 P2
(B) ISO – 8879
while (S1 = = S2); while (S1 = = S2);
(C) ISO – 8880
critical section critical section
(D) ISO – 8881
e
S1 = S2; S1 = S2;

Which one of the following statements

69. What is the meaning of ‘Hibernate’ in
sti
describes the properties achieved ?
Windows XP/Windows 7 ?
(A) Mutual exclusion but not
(A) Restart the computers in safe
progress
mode.
(B) Progress but not mutual
(B) Restart the computers in normal
exclusion
o
mode.
(C) Neither mutual exclusion nor
(C) Shutdown the computer
progress terminating all the running
nP
(D) Both mutual exclusion and applications.
progress (D) Shutdown the computer without
closing the running applications.

66. If the period of a signal is 1000 ms,

then what is its frequency in kilohertz ? 70. Assume that we have constructor
–3 –2 functions for both base class and
ap

(A) 10 KHz (B) 10 KHz

derived class. Now consider the
(C) 10–1 KHz (D) 1 KHz declaration in main( ). Base * P = New
Derived; in what sequence will the
67. Let a * H and b * H be two cosets of H. constructor be called ?

(i) Either a * H and b * H are disjoint (A) Derived class constructor

re

followed by Base class

(ii) a * H and b * H are identical constructor.
Then, (B) Base class constructor followed
by derived class constructor.
(A) only (i) is true
.O

(C) Base class constructor will not be

(B) only (ii) is true
called.
(C) (i) or (ii) is true
(D) Derived class constructor will
(D) (i) and (ii) is false not be called.

Paper-III 10 J-87-12
rg
 71. Which one of the following options is 74. On a disk with 1000 cylinders
not a shell in UNIX system ?
(0 to 999) find the number of tracks,
Qu
(A) Bourne Shell the disk arm must move to satisfy all
(B) C Shell the requests in the disk queue. Assume
the last request service was at track
(C) Net Shell
345 and the head is moving toward
(D) Korn Shell track 0. The queue in FIFO order
e
contains requests for the following
tracks :
sti
123, 874, 692, 475, 105, 376
72.
(Assume SCAN algorithm)

(A) 2013
o
(B) 1219
G1 and G2 are two graphs as shown :
(C) 1967
nP
(A) Both G1 and G2 are planar
graphs. (D) 1507

(B) Both G1 and G2 are not planar

graphs. 75. Halftoning is defined as
(C) G1 is planar and G2 is not planar (A) a technique to obtain increased
graph.
ap

visual resolution using multiple

(D) G1 is not planar and G2 is planar intensity levels.
graph.
(B) a technique for using minimum
number of intensity levels to
73. In which file the compiler manage the obtain increased visual resolution.
re

various objects, which are used in

windows programming ? (C) a technique to obtain increased
(A) Control File visual resolution using maximum
number of intensity levels.
(B) Binary File
.O

(C) Text File (D) a technique for using appropriate

number intensity levels to obtain
(D) Obj File
increased visual resolution.

J-87-12 11 Paper-III
rg
 Space For Rough Work
Qu
e sti
o nP
ap
re
.O

Paper-III 12 J-87-12
rg