Test Booklet Code & Serial No.

C
COMPUTER SCIENCE AND APPLICATIONS
Signature and Name of Invigilator Seat No.
1. (Signature) ......................................... (In figures as in Admit Card)
(Name) ................................................ Seat No. ..............................................................
2. (Signature) ......................................... (In words)

(Name) ................................................ OMR Sheet No.

MAR - 37223 (To be filled by the Candidate)
Time Allowed : 2 Hours] [Maximum Marks : 200
Number of Pages in this Booklet : 28 Number of Questions in this Booklet : 100
Instructions for the Candidates
1. Write your Seat No. and OMR Sheet No. in the space provided 1.
on the top of this page.
2. This paper consists of 100 objective type questions. Each question
will carry two marks. All questions of Paper II will be compulsory. 2.
3. At the commencement of examination, the question booklet
will be given to the student. In the first 5 minutes, you are 3.
requested to open the booklet and compulsorily examine it as
follows :
(i) To have access to the Question Booklet, tear off the
paper seal on the edge of this cover page. Do not accept (i)
a booklet without sticker-seal or open booklet.
(ii) Tally the number of pages and number of questions in
the booklet with the information printed on the cover (ii)
page. Faulty booklets due to missing pages/questions
or questions repeated or not in serial order or any
other discrepancy should not be accepted and correct
booklet should be obtained from the invigilator within
the period of 5 minutes. Afterwards, neither the Question
Booklet will be replaced nor any extra time will be
given. The same may please be noted.
(iii) After this verification is over, the OMR Sheet Number
(iii)
should be entered on this Test Booklet.
4. Each question has four alternative responses marked (A), (B),
(C) and (D). You have to darken the circle as indicated below on 4. (A), (B), (C) (D)
the correct response against each item.
Example : where (C) is the correct response.

A B D (C)
5. Your responses to the items are to be indicated in the OMR A B D
Sheet given inside the Booklet only. If you mark at any place
other than in the circle in the OMR Sheet, it will not be evaluated. 5.
6. Read instructions given inside carefully.
7. Rough Work is to be done at the end of this booklet. 6.
8. If you write your Name, Seat Number, Phone Number or put 7.
any mark on any part of the OMR Sheet, except for the space
8.
allotted for the relevant entries, which may disclose your
identity, or use abusive language or employ any other unfair
means, you will render yourself liable to disqualification.
9. You have to return original OMR Sheet to the invigilator at the
end of the examination compulsorily and must not carry it with 9.
you outside the Examination Hall. You are, however, allowed
to carry the Test Booklet and duplicate copy of OMR Sheet on
conclusion of examination.
10.
10. Use only Blue/Black Ball point pen.
11.
11. Use of any calculator or log table, etc., is prohibited.
12. There is no negative marking for incorrect answers. 12.
 MAR - 37223/II—C

2
 MAR - 37223/II—C
Computer Science and Applications
Paper II
Time Allowed : 120 Minutes] [Maximum Marks : 200
Note : This Paper contains Hundred (100) multiple choice questions. Each question
carrying Two (2) marks. Attempt All questions.

1. Consider a system having ‘m’ 3. A memory management system has

resources of the same type. These
resources are shared by three 64 pages with page size of 512 bytes.
processes P1, P2 and P3 which have Physical memory consists of 32 page
peak demands of 2, 5 and 7 resources
respectively. For what value of ‘m’ frames. Number of bits required in
deadlock will not occur ?
logical and physical address are
(A) 70
(B) 14 respectively :
(C) 13 (A) 14 and 15
(D) 7
2. A virtual memory has a page size (B) 14 and 29
of 1K words. There are eight pages (C) 15 and 14
and four blocks. The associative
memory page table contains the (D) 16 and 32
following entries :
4. A FAT (File Allocation Table) based
file system is being used and the
Page Block
total overhead of each entry in the
0 3
FAT is 4 bytes in size. Given a 100
2 1 × 106 bytes disk on which the file
5 2 system is stored and data block size

7 0 is 103 bytes, the maximum size of

a file that can be stored on this disk
Which of the following lists of virtual
addresses (in decimal) will NOT in units of 106 bytes is........... .
cause any page fault if referenced (A) 99.55 to 99.65
by the CPU ?
(A) 1024, 3072, 4096, 6144 (B) 100.5 to 101.4
(B) 1234, 4012, 5000, 6200 (C) 97.2 to 98.5
(C) 1020, 3012, 6120, 8100
(D) 2021, 4050, 5112, 7100 (D) 89.1 to 91.2

3 [P.T.O.
 MAR - 37223/II—C

5. A computer has twenty physical 7. Which type of encryption is preferred

page frames which contain pages to encrypt the data stored on a
numberd 101 through 120. Now a
conventional hard-disk ?
program accesses the pages
(A) Symmetric-key cryptography
numbered 1, 2,....., 100 in that order,
and repeats the access sequence (B) Asymmetric-key cryptography
THRICE. Which one of the (C) Hashing
following page replacement policies
(D) Quantum cryptography
experiences the same number of
page faults as the optimal page 8. Which system call replaces a current

replacement policy for this process in Linux ?

program ?
(A) pipe
(A) Least-recently-used
(B) First-in-first-out (B) fork

(C) Last-in-first-out
(C) exec
(D) Most-recently-used
(D) dup
6. We need to design a filesystem to
store image files having maximum 9. Which of the following is not an
one block size. Which of the following
Inter-process-communication
disk space allocation methods is
mechanism in Linux ?
most appropriate to meet this
requirement ? (A) Pipe

(A) Contiguous Allocation

(B) Redirection
(B) Linked Allocation
(C) Socket
(C) Indexed Allocation

(D) Hashed Allocation (D) Signal

4
 MAR - 37223/II—C

10. Windows operating system use the 12. In software development process,
following two modes to protect user which is not one of the key questions

applications from accessing and/or that is answered by each team

modifying critical operating system member at each daily Scrum

data : meeting ?

(A) Normal user mode and (A) What did you do since the last
Administrator mode meeting ?
(B) User mode and Kernel mode (B) What obstacles are you
(C) Hardware mode and Software encountering ?
mode
(C) What is the cause of the
(D) Hardware interrupt mode and problems you are
Software interrupt mode encountering ?
11. In software development process,
(D) What do you plan to accomplish
...................... is a design strategy that
at the next team meeting ?
tries to address the design and
13. A user is describing a real-life
implementation complications
example during requirement
associated with such inter-
gathering stage of a software
dependencies by explicitly
development project.
introducing aspects as system
characteristics. This most appropriately represents
which requirement discovery
(A) Agile development model
technique ?
(B) Evolutionary development
model (A) Viewpoint

(C) Rapid linear sequence (B) Interview

development model
(C) Scenario
(D) Aspect-oriented development
(D) Use-case
model
5 [P.T.O.
 MAR - 37223/II—C

14. Cohesion is........and coupling is...... . 17. An independent path is a path

through the program that

(A) Intra-module, Inter-module
introduces set of.......... .
(B) Inter-module, Intra-module
(i) new conditions
(C) Intra-module, Intra-module
(ii) processing statements
(D) Inter-module, Inter-module
(A) (i) only
15. One of the following is most desirable
(B) (ii) only
when using LOC as a size oriented
(C) (i) or (ii) or both
metric ?

(D) Neither (i) nor (ii)

(A) LOC is language dependent
18. Software Configuration Management
(B) LOC is language independent
(SCM) provides systematic evolution
(C) LOC can be computed before of a software under development and
design phase provides for :

(D) LOC can be easily computed (i) Visibility

(ii) Controlled change

16. Which of the following is not a size

metric ? (iii) Traceability

(iv) Monitoring
(A) LOC
(A) (i), (ii) and (iii)
(B) Function Count
(B) (i), (ii) and (iv)
(C) Program Length (C) (i), (ii), (iii) and (iv)

(D) Cyclomatic Complexity (D) (ii) and (iii)

6
 MAR - 37223/II—C

21. For a given max-heap, which is the

19. When error occurs, the process of
correct answer ?
anticipating such errors through
(A) The leaf nodes have values
setting up error handling paths to greater than or equal to their
reroute or terminating processing parents

cleanly is known as............ . (B) The leaf nodes have values less
than or equal to their parents
(A) Debugging
(C) The leaf nodes and their parents
(B) Rebugging
have same values
(C) Prebugging (D) The leaf nodes have values

(D) Antibugging different from their parents

22. B+ trees are considered BALANCED

20. Which is the correct evolutionary
because :
path of five level capability maturity
(A) The lengths of the paths from
model ? the root to all leaf nodes are all

(A) initial, defined, repeatable, equal

managed, optimizing (B) The lengths of the paths from

the root to all leaf nodes differ
(B) initial, repeatable, defined,
from each other by at most 1
managed, optimizing (C) The number of children of any

(C) initial, defined, managed, two non-leaf sibling nodes differ

by at most 1
optimizing, repeatable
(D) The number of records in any
(D) initial, repeatable, managed,
two leaf nodes differ by at
defined, optimizing most 1.

7 [P.T.O.
 MAR - 37223/II—C

23. The in-order traversal output and

26. The postfix form of A*B+C/D is :
pre-order traversal output of a
binary tree are same, then the (A) * A B / C D +
binary tree is :

(A) Left skewed (B) A B * C D / +

(B) Right skewed

(C) A * B C + / D
(C) Balanced

(D) Completely balanced (D) A B C D + / *

24. The two statements that can change

27. Let S be a sorted array of n integers.
the flow of control are :
Let T(n) denote the time taken by
(A) if and switch

(B) if and while the most efficient algorithm to

(C) switch and do-while

determine if there are two elements
(D) break and continue
in S with sum greater than m,
25. A deque is :
then :
(A) A queue implemented with a
doubly linked list
(A) T(n) is of (1)
(B) A queue implemented with both
singly and doubly linked lists (B) T(n) is of (m)
(C) Just a queue
(C) T(n) is of (n)
(D) A queue with insert and delete
defined for both front and rear
(D) T(n) is of (log n)
ends of the queue

8
 MAR - 37223/II—C

28. Match the algorithms in Group 1 29. Which of the following is not true

with the design strategy used by the for the problem classes P, NP, NP-

algorithm in Group 2 complete and NP-hard ?

(A) P NP
Group 1

(B) NP-complete NP
P. Merge Sort

(C) NP-hard NP
Q. Insertion Sort
(D) NP-complete NP-hard
R. Prim's algorithm
30. Maximum finding algorithm takes
S. Kruskal's algorithm
O(log 2 n) parallel time with
Group 2 p > n/2 processors using P-RAM

I. Greedy Strategy model of parallel computation. If we

have p < n/2 processors in reality,

II. Dynamic Programming
then which condition will retain the
III. Divide and Conquer
parallel time complexity of O(log n)

IV. Decrease and Conquer extended with some constant factor.

(A) P III, Q II, R I, S IV (A) n p n/ p n/ p

(B) P I, Q III, R II, S IV (B) n p 1 n/ p n/ p

(C) P IV, Q III, R II, S I (C) n * p 1 n / p n/ p

(D) P III, Q IV, R I, S II (D) n n/ p n/ p

9 [P.T.O.
 MAR - 37223/II—C

32. Consider the context free grammar

31. For the language L = {anb/n > 0}
with productions :
which of the following is/are DFA
S ABa
represents the above language ? A aab
B Ac
I.
After constructing an equivalent
grammar in Chomsky Normal form,
the resulting grammar will contain
II. ..............productions.
(A) 10 (B) 08
(C) 06 (D) 09
33. For to be an alphabet and
L * be a language A is said to
be decidable if there exists a Turing
III. *
machine M for every string
with which of the following conditions.
(i) If L, the computation of TM
M on input string terminates
IV. in accept state
(ii) If L ( does not belong
to L) then computation of TM
M on input string terminates
in reject state
(iii) If L then computation of
TM M on input string
(A) I and II only terminates in reject state.
(B) I and III only (A) (iii) only
(B) (i) and (iii) only
(C) II and IV only
(C) (i) and (ii) only
(D) III and IV only (D) (ii) and (iii) only

10
 MAR - 37223/II—C

36. An attribute grammar in which all

34. The decision problem "Given a
the attributes are..........is called
Turing Machine M and a step-
an.......attributed grammar.
counting function "myfun", is the (A) Synthesized, S
language accepted by M in Time (B) Inherited, S

(myfun) ?" is........... . (C) Synthesized, L

(D) Inherited, L
(A) Stable
37. Which of the following parameter

(B) Unsolvable passing methods works with the idea

that the argument is not evaluated
(C) Partially solvable
until its actual use as a parameter

(D) Solvable in the called program ?

(A) Pass by Value-Result
35. Consider the grammar G with
(B) Pass by Name
productions S ACB/CbB/Ba, (C) Pass by Value
A da/BC, B g/ C h/ (D) Pass by Reference
38. An...........is a data structure that is
Which of the following is correct set
constructed from input data to a
for FIRST (S) ? program and from which part or all
of the output data of the program
(A) {a, b, h, g}
is constructed.
(B) {a, d, g, } (A) Symbol Table
(B) Flow Graph
(C) {g, d, b, h, }
(C) Intermediate Representation
(D) {g, d, a, b, h, } (D) Object File

11 [P.T.O.
 MAR - 37223/II—C

39. Consider the following function with 40. Consider the grammar shown below

line numbers. S AA

1. Int Myfunction( ) A aA/d

2. { The grammar is :

3. int a = 24; (A) LL(1)

4. int b = 25; (B) SLR(1) but not LL(1)

5. int c; (C) LALR(1) but not SLR(1)

6. if (a! = 24) (D) LR(1) but not LALR(1)

41. While linking to Anonymous FTP

7. printf ("Is less than or
system which of the following
not equal to 24");
anchors is correct ?
8. c = a << 2;
(A) <a href = "ftpto : // ftp.
9. return c;
google.com"> google's public
10. b = 24;
FTP servers </a>
11. }
(B) <a href="ftp : // ftp.google.com">
Which line numbers contain the
google's public FTP servers
dead code/dead variable/unrea-
</a>
chable code in the above function
(C) <a href : "ftp : //ftp.google.com">
definition ?
google's public FTP servers
(A) 4, 6, 7 </a>
(B) 6, 7, 10 (D) <a href : "ftp to : //ftp.
(C) 4, 6, 7, 8, 10 google.com"> google's public
(D) 4, 6, 7, 10 FTP servers </a>'

12
 MAR - 37223/II—C

42. While virtulizing X-86 architecture, 44. The key length of a 3-key Triple
Data Encryption Standard
type-I hypervisor :
(3TDES) is :
(A) Interact with OS through ABI
(A) 112 bits
and emulate the ISA for Guest (B) 256 bits
OS (C) 512 bits

(B) run directly on top of the (D) 168 bits

45. Suppose we have to send an E-mail
hardware with ISA exposed by
with an attachment of 2.5 kbyte with
the hardware
1 Gbps bandwidth. Assume that the
(C) is known as hosted virtual distance between the sender and the
machine receiver is 12000 km and that light

(D) run directly on top of the travels at 2.4 × 108 m/s. What will
be the transmission time ?
hardware with API exposed
(A) 50 ms
43. The guard interval is provided in
(B) 2 ms
Orthogonal Frequency-Division (C) 0.020 ms
Multiplexing (OFDM). (D) 0.2 ms

(A) To eliminate the need of pulse 46. What is the minimum Hamming
distance for detection of three errors
shaping filter
or correction of two errors ?
(B) To eliminiate Inter Symbol
(A) 2
Interface (ISI)
(B) 3
(C) High symbol rate (C) 4

(D) Both (A) and (B) (D) 5

13 [P.T.O.
 MAR - 37223/II—C

47. Match the following OSI layers with 49. In symmetric-key cryptography, how

protocols : many keys are needed for more

(a) Layer 7 (Application) secure communication if Alice and

(b) Layer 4 (Transport) Bob want to communicate with each

(c) Layer 3 (Network) other ?

(d) Layer 2 (Data Link) (A) 2

(i) IPv4 (B) 3

(ii) UPP (C) 4

(iii) HTTP (D) 8

(iv) Ethernet, WiFi (802.11) 50. Match the classes of IP addresses

(A) a-(iv), b-(iii), c-(i), d-(ii) with their functional applications :

(B) a-(iv), b-(iii), c-(ii), d-(i) (a) Class A (1) Multicast

(C) a-(iv), b-(ii), c-(iii), d-(i) Services

(D) a-(iii), b-(ii), c-(i), d-(iv) (b) Classs B (2) Reserved for
future use
48. If the frame to be transmitted is
1101011011 and the CRC (c) Class D (3) Large Organi-

polynomial to be used for generating zations

checksum is x4 + x + 1, then what (d) Class E (4) Midsize Organi-

is the transmitted frame ? zations

(A) 11010110111110 (A) (a)-4, (b)-3, (c)-2, (d)-1

(B) 11010110111011 (B) (a)-2, (b)-4, (c)-1, (d)-3

(C) 11010110111101 (C) (a)-1, (b)-2, (c)-3, (d)-4

(D) 11010110111001 (D) (a)-3, (b)-4, (c)-1, (d)-2

14
 MAR - 37223/II—C

54. In the following knowledge

51. Which of the following is not an
representation using first order logic
agent communication language ? person Indian (person) ^ know

(A) FIPA–ACL (person, English) [Mother tongue

(person, lang) ^ hate (person, lang)],
(B) KSE–KQML
the number of predicates and
(C) KSE–KIF variables are respectively :

(D) FIPA–QIF (A) 4, 2

(B) 4, 3
52. An intermediate form between
(C) 3, 4
syntactic and logical form used in
(D) 5, 2
Natural language processing is
55. Which of the following statements
known as : are true for 'Rational Agents' ?

(A) Quantified logical form (i) it perceives its environment

(B) Quasi-logical form through sensors

(ii) it acts upon the environment

(C) Syntactic-logical form
through actuators
(D) Definite clause grammar
(iii) it improves its performance
53. Forward state space search is also through learning

known as : (iv) it knows the actual outcome of

its actions
(A) Regression planning
(A) (i) and (ii)
(B) Progression planning
(B) (i), (ii) and (iii)
(C) Contingency planning
(C) (i), (ii) and (iv)
(D) Consistency planning (D) (iii) and (iv)

15 [P.T.O.
 MAR - 37223/II—C

56. Consider a non-binary genome of

58. Functions that qualify as fuzzy
length l, over an alphabet of size
intersections and fuzzy unions are
p(p>2). How many different

schemata are there ? referred to as :

(A) 2 l
(A) t-norms & t-conorms
(B) 2p

(C) 2p+l (B) i-norms & v-conorms

2
(D) 2 p
(C) t-norms & i-norms

1 0.5 0.3 0.2

57. If A and (D) None of the above
~ 2 3 4 5

0.5 0.7 0.2 0.4 59. A single layer perception cannot

B ,
~ 2 3 4 5
compute the following logical
then A/B is :

0.5 0.2 0.1 0.2 function :

(A)
2 3 4 5
(A) AND
0.5 0.2 0.1 0.6
(B)
2 3 4 5
(B) OR

0.5 0.3 0.3 0.2

(C)
2 3 3 5 (C) XOR

0 0.5 0.2 0.4

(D) (D) NOT
2 3 4 5

16
 MAR - 37223/II—C

60. Which of the following data is 61.

linearly separable ?

(A)

V = {A, B, C, D, E, F, G, H, I}

E = {e1 = (A, B), e2 = (A, C), e3 =

(A, D), e4 = (B, C), e5 = (B, F),

(B)
e6 = (B, H), e7 = (C, D), e8 = (C, E),

e9 = (C, F), e10 = (D, E), e11 = (D, I),

e12 = (E, F), e13 = (E, G), e14 =

(F, G), e15 = (F, H), e16 = (G, H),

(C) e17 = (G, I), e18 = (H, I)}

W = {22, 9, 12, 35, 36, 34, 4, 33, 30,

18, 23, 24, 39, 25, 21, 19}

The weight of the shortest path from

node A to I in the undirected graph

(D)
is........... .

(A) 2 (B) 3

(C) 42 (D) 43

17 [P.T.O.
 MAR - 37223/II—C

62. Group code are generated using 65. Let X and Y be random variable with

1 0 0 1 1 0 the following distributions

G 0 1 0 0 1 1 for respectively :
0 0 1 1 0 1

communication. Then.......... is not X 1 2 3 4 5

code word. P 0.1 0.2 0.4 0.2 0.1

(A) 000000 (B) 000111

Y 10 20 35 50 60
(C) 101100 (D) 111111 P 0.1 0.2 0.4 0.2 0.1

63. The number of code word possible

(A) Skewness of X and Y are same,
1 1 0
using the generator G = Coefficient of Variations are the
0 1 1

is : same

(A) 1 (B) 2 (B) Skewness of distribution of X

(C) 4 (D) 8 and Y are not same, Coefficient

64. Let X and Y be random variables of Variations are the same

with joint distribution :
(C) Skewness of distribution of X
Pr(X i, Y j)
and Y are same, Coefficient of
1 / 6 for i 5,6 and j 3,6,9
0 otherwise Variations are not same

Then the conditional entropy (D) Skewness of distribution of X

H(X|Y) = .................. .
and Y are not same, Coefficient
(A) 0 (B) log(2)

(C) log(3) (D) log(6) of Variations are not same

18
 MAR - 37223/II—C

66. Notation : 68. Consider the following Linear

Programming Problem :
C(n, r) = n!/(r!*(n-r)!))
Maximize : Z = 5x1 + 10x2
n! is factorial n.
Subject to : x1 4
|A| cardinality of set A
x2 2
s is negation of s
x1 + x2 = 5, x1, x2 0
The number of ways to place r
The dual of this problem is given
indistinguishable balls in n(n < r)
by :
distinct boxes, with no box left
(A) Maximize : Z' = 4y1 + 2y2
empty, is........... .
+ 5y3 – 5y4
(A) C(r – 1, n – 1)
Subject to :
(B) C(n + r – 1, n – 1)
y1 + y3 – y4 5
(C) C(n + r – 1, r – 1)
–y2 + y3 – y4 > 10
(D) C(n – 1, r – 1)
y1, y2, y3, y4 0
67. Consider the following Linear (B) Minimize : Z' = 4y1 + 2y2
Programming Problem : + 5y3 – 5y4
Maximize : Z = 5x1 + 6x2 + 4x3 Subject to :

Subject to 3x1 + x2 + 4x3 60 y1 + y3 – y4 5

–y2 + y3 – y4 > 10
2x1 + 3x2 + 3x3 75
y1, y2, y3, y4 0
x1, x2, x3 0 (C) Maximize : Z' = 4y1 + 2y2
The value of the decision variables + 5y3
after the first iteration will be : Subject to : y1 + y3 4
(A) x1 = 0, x2 = 0, x3 = 25 y2 + y 3 > 2
y1 + y2 + y3 = 5
(B) x1 = 0, x2 = 25, x3 = 0
y1, y2, y3 0
(C) x1 = 20, x2 = 0, x3 = 0
(D) The dual cannot be written as
(D) x1 = 0, x2 = 37.5, x3 = 0 there are mixed constraints.

19 [P.T.O.
 MAR - 37223/II—C

69. The transportation problem of m 71. A switch debouncer circuit is an

resources and n destinations can be
application of :
written as Linear Programming
Problem with : (A) The gated SR latch

(A) mn decision variables and mn (B) The S R latch

constraints (C) SR latch
(B) (m + n) decision variables and (D) The gated D latch
(m + n) constraints 72. The ASCII code for decimal digit 9
(C) (m + n) decision variables and with an even parity, placing the
mn constraints
parity bit in the most significant
(D) (mn) decision variables and
position is :
(m + n) constraints
(A) 00111001
70. The optimal solution to the following
(B) 10111001
assignment problem
(C) 00100101
J1 J2 J3 J 4
(D) 11000110
M1 10 9 8 7
M2 3 4 5 6 73. The 15's complement of A9BH is :
M3 2 1 1 2 (A) B02 H
M4 4 3 5 6 (B) 173 H
is given by : (C) CD2H
(A) M1 J3, M2 J2, M3 J1,
(D) 564H
M4 J4
74. The write pulse width (twp) is the
(B) M1 J4 , M 2 J1 , M 3 J2,
time for which :
M4 – J3
(A) WR goes high
(C) M1 J4, M2 J1, M3 – J3,
(B) WR goes low
M4 – J2
(C) WR goes high
(D) M1 – J3, M2 – J4, M3 – J2,
M4 – J1 (D) WR goes low

20
 MAR - 37223/II—C

75. The speed of information being 77. A horizontal micro-programmed

transferred in and out of memory control unit supports the following.

Identify the correct ones.
depends on which of the following
parameters ? (i) Longer control word

(ii) Used in parallel processing

(i) Access time tA
applications
(ii) Cycle time tc
(iii) Allows high degree of
(iii) Access rate rA
parallelism
(iv) Bandwidth rc
(iv) Requires no additional
(A) (i) & (ii) hardware (decoders)

(B) (ii) & (iii) (A) (i), (ii) & (iii)

(C) (i), (ii) & (iii) (B) (i), (iii) & (iv)

(D) (i), (ii), (iii) & (iv) (C) (i), (ii), (iii) & (iv)

76. Which of the following assembler (D) (ii), (iii), (iv)

directives can be used to define & 78. Which of the following are
re-define numeric constants ? representative application areas
where vector processing is used ?
(i) EQU
(i) AI & Expert systems
(ii) % assign (ii) Seismic Data Analysis

(iii) % define (iii) Petroleum Explorations

(iv) Medical Diagnosis
(A) (i) & (ii) only
(A) (i), (ii), (iii) & (iv)
(B) (ii) & (iii) only
(B) Only (i)
(C) (i) & (iii) only
(C) Only (ii) & (iv)
(D) (i), (ii) & (iii) (D) None of the above

21 [P.T.O.
 MAR - 37223/II—C

79. A computer has 512 KB, 4-way set 81. A normalised heterogeneous
abstract syntax tree must :
associative, write back data cache
(i) Trees with magnitude of node
with block size of 32 bytes. The type are called heterogeneous
processor sends 32 bit addresses to tree
the cache controller. Each cache tag (ii) Normalised heterogeneous tree
use a normalised list of children
directory entry contains, in addition like homogeneous tree
to address tag, 2 valid bits, 1 (iii) Nodes have irregular children
modified bit and 1 replacement bit. (iv) Use more than a single node
The number of bits in the tag field data type but with normalised
child list representation.
of an address is :
(A) (i), (ii) and (iv)
(A) 80 (B) 32 (B) (i) and (ii)
(C) (ii) and (iv)
(C) 64 (D) 15
(D) (iv) only
80. Why do race conditions occur ? 82. Which of the following comparison
between static and dynamic type
(i) Values of memory locations checking is correct ?
replicated in registers during (i) dynamic type checking slow
execution. down execution
(ii) dynamic type checking offers
(ii) Content switches at arbitrary more flexibility to the
times during execution. programmers
(iii) Dynamic type checking is more
(iii) Threads can see stale memory reliable
values in registers. (iv) Unlike static type checking the
dynamic type checking is done
(A) Only (ii)
during compilations.
(B) Only (iii) (A) (i) and (ii)
(B) (i) and (iii)
(C) (i) & (ii)
(C) (ii) and (iii)
(D) (i), (ii) & (iii) (D) (iv) only

22
 MAR - 37223/II—C

83. Consider the following ‘C’ program 85. Exception handling is not meant to
fragment : handle problems for which case ?
int i = 5; (i) termination of program
do (ii) handle return value
{ representing error

putchar (i + 100); (iii) hand return a legal value and

printf ("%d", i...); leave the program in an illegal

} while (i); state

results in the following output : (iv) call an error handler function

(A) i 5 h 4 g 3 f 2 e 1 (A) (i) and (ii)

(B) (ii) and (iii)

(B) i 4 h 3 g 2 f 1 e 0
(C) (iv) only
(C) An error message will come
(D) (i), (ii) and (iv)
(D) Went into infinite loop

84. The object-oriented programming 86. The scope rules, especially the rules

can be seen as an attempt to for nested type ensures that the

enhance opportunities for code reuse resulting multitude of..........type do
be making it ease to define new not interface with each other.
abstraction as :
(A) Enumerated
(A) Extension or refinement
(B) Inherited
(B) Independence
(C) Encapsulated
(C) Containment

(D) Facult containment (D) Contained

23 [P.T.O.
 MAR - 37223/II—C

87. Most of recent browsers support an 89. The transformation matrix

additional ENCTYPE of multipart/
0 1 0
form-data, which statements out of
the following correctly define it ? 1 0 0
is used to obtain the
(i) This encoding transmit each 0 0 1

field as a separate part of MIME

reflection about the.......... .
compatible document
automatically (A) Y-axis, flipping x-coordinates
(ii) MIME compatible document
automatically use POST to (B) line Y = 0

submit data in multipart

(C) Diagonal line Y = –x
(iii) This attribute specifies the way
in which data is enclosed (D) Diagonal line Y = x
(iv) This encoding sometime makes
90. Given rx = ry, the following super
it easier for server side program
to handle complex data. ellipse has the parameter value

(A) (i) and (ii) = .......... .

(B) (ii) and (iv)

(C) (iii) and (iv)

(D) (i), (ii) and (iv)

88. Identify odd one from the
following :
(A) Digitizer
(B) Touch panel (A) 0.5 (B) 1
(C) Plotter
(C) 1.5 (D) 2
(D) Trackball

24
 MAR - 37223/II—C
91. Data integrity constraints are used 93. Every table with two single valued
for :
attributes is in :
(i) Establishing limits on
allowable property values (A) 2NF
(ii) Specifying a set of acceptable, (B) 3NF
predefined options to property (C) BCNF
values
(D) All of the above
(iii) Ensuring that duplicate values
are not entered in the table 94. Database contains two tables :
(iv) Controlling that data is Employee (id, name, salary, did) and
accessed by authorised users
Dept. (did, dname).
(A) (i) & (ii)
(B) (i), (ii) & (iii) Which of the following is an incorrect
(C) (iii) & (iv) SQL query ?
(D) (i), (ii), (iii) & (iv) (A) Select name, dname from
92. Match the following statements in employee natural join Dept;
Group 1 with database objects in
Group 2 : (B) Delete from employee where did
Group 1 in (Select did from Dept);
P. View (C) Update employee set salary =
Q. Table salary * 1.03 where salary >
R. Role
100000;
S. Function
(D) Insert values into employee
Group 2
I. that which contains data (1, 'vijay', 100000, 12);
II. that which returns a value
95. Which keyword is used to rename
III. that helps in managing groups
of privileges a field name in SQL query ?
IV. that which contains only a (A) AS
stored SQL statement
(A) P I, Q II, R III, S IV (B) ALTER
(B) P II, Q I, R IV, S III
(C) LIKE
(C) P IV, Q I, R III, S II
(D) P IV, Q III, R I, S II (D) FROM

25 [P.T.O.
 MAR - 37223/II—C

96. Which amongst the following 98. Agglomerative approach of clus-

statements are correct ?
tering is one of the..........methods.
(i) Writing a database object
without reading its initial value (A) Density
is called Blind write
(B) Partitioning
(ii) In wound wait technique, the
number of rollback is low (C) Hierarchical

(iii) In wait-die technique, the (D) Model based

younger transaction is never
99. What is the default replication factor
rolled back
in HDFS for a hadoop cluster having
(iv) The different locks in 2PL
mechanism are shared, read, 100 data nodes ?
write and unlock.
(A) 1
(A) (i), (ii) and (iii)
(B) 2
(B) (i) & (ii)

(C) (i), (ii) and (iv) (C) 3

(D) (ii), (iii) and (iv) (D) 4

97. An association rule which involves
100. Which of the following is a wide
numeric attributes having implicit
ordering among values is known column store ?

as...............association rule.
(A) Cassandra
(A) Multivalued
(B) Riak
(B) Ordered
(C) Mango DB
(C) Numeric

(D) Quantitative (D) Redis

26
 MAR - 37223/II—C

ROUGH WORK

27 [P.T.O.
 MAR - 37223/II—C

ROUGH WORK

28