Test Booklet Code & Serial No.

A
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.

APR - 37224 (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.
 APR - 37224/II—A

2
 APR - 37224/II—A

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. The inference rule deals exclusively 3. A deck of playing cards contains 52

with formulas in conjunctive normal cards, 4 each with face values in the
set {A, 2, 3, 4, 5, 6, 7, 8, 9, 10, J,
forms is called as : Q, K}. Let us define face values of
the top and bottom cards as X and
(A) Resolution rule Y. The shuffling algorithm is defined
as follows :
(B) Contingency rule Sh1 : Permute the cards randomly
due to that each arrangement occurs
(C) Unsatisfiability rule with probability 1/52 !
Sh2 : If X Y , flip the biased coin
(D) Contradiction rule
that comes up heads with probability
P and go back to Sh1 if heads turns
2. Let A and B be the sets. The
up otherwise stop.
symmetric difference between A and Each coin flip and each permutation
is assumed to be independent of all
B is :
the other randomization. What
value of P will make X and Y
(A) A B (A – B) (B – A)
independent random variables once
this process of shuffling will stops ?
(B) A B (A B) (B A)
(A) P = 1/4
(C) A B (B A) (B – A) (B) P = 2/3
(C) P = 1/3
(D) A B (A – B) (B A) (D) P = 1/5
3 [P.T.O.
 APR - 37224/II—A

4. Identify the number of distinct string 5. Design a K-Map for F(x, y, z) =

of length 2 of the combinations of
blue and yellow beads. The both xz xyz yz of F(x, y, z) and find

ends of the strings are not marked prime implicants.

due to this they are indisting-
uishable if interchanging the ends (A) xy, yz , xz
of one will results other. Denote b
(B) x, y, z
and y as a blue and yellow beads.
Let us consider bb, by, yb and yy
(C) xy , yz, xz
are the four different strings of
length 2 when equivalence between (D) xy , yz, xz
strings is not taken into the
consideration. The number of 6. 11 students plan to have dinner

equivalent classes into which the set together for multiple days. They will
s = (bb, by, yb, yy) is divided by
be seated at the round table. Their
equivalent relation induced by the
group of permutation [{ 1 , 2 }, 0] plan is to ensure that each student
where :
sits next to different neighbours at
bb by yb yy
1
every dinner. How many days can
bb by yb yy
this arrangement be sustained ?
bb by yb yy
2
bb yb by yy (A) 5

(A) 3
(B) 11
(B) 4
(C) 4
(C) 5

(D) 6 (D) 7

4
 APR - 37224/II—A

7. Explore all 5 letter combinations 9. Let us consider the full Coca-Cola

formed using the letters a through bottles, 7 half-full and 7 empty. You
h. How many of these words contains
want to divide the 21 bottles among
no repeats, also do not include the
three persons so that each will
subword “bad” ?
receive exactly 7. Moreover, each
(A) 6660
person must receive the same
(B) 6667
quantity of Coca-Cola. Solve the

(C) 6578 problem using Integer Linear

(D) 6312 programming and find a solution.

8. Suppose G is the graph with n What will be the objective function ?

vertices such that every vertex

(A) There will be a dummy
having degree 5. What is the
objective function with all zero
smallest value of n for which graph
coefficients.
might be planar ?
Number of bottles assigned to person
5n Status
(A)
2 1 2 3

(B) 5n Full 1 3 3

(C) 2n Half-full 5 1 1

2n Empty 1 3 3
(D)
5

5 [P.T.O.
 APR - 37224/II—A

(B) Objective function will be 10. Consider the following linear

maximize the total quantity of
programming problem :
Coca-Cola distribution.
Maximize Z = 2x1 + 3x2
Number of bottles assigned to person
Status
1 2 3 Subject to : x1 + 3x2 12

Full 3 1 2
3x1 + 2x2 12
Half-full 2 1 3
x1, x2 0
Empty 2 5 1

At which points of graphical solution

(C) Objective function will be
minimize the empty bottles. space the infeasible basic optimum

Number of bottles assigned to person

solutions are represented ?
Status
1 2 3
(A) Corner points (x1 = 0, x2 = 6)
Full 0 1 2 and (x 1 = 12, x 2 = 0) are
Half-full 0 1 3 infeasible
Empty 7 5 2
(B) Corner points (x 1 = 10.29,
(D) Set of a binary variable is
x2 = 2) and (x1 = 0, x2 = 3.34)
represented for full bottle
are infeasible
representation.

Number of bottles assigned to person

(C) Corner points (x 1 = 12.20,
Status
1 2 3 x2 = 6) and (x1 = 0, x2 = 5.24)

Full 1 5 2 are infeasible

Half-full 2 1 2
(D) None of the corner points are
Empty 4 1 3 infeasible

6
 APR - 37224/II—A

11. Given Logic Gate represents which 13. The following Truth Table
represents which Logical Micro-
of the following Truth Table ?
operation ?

A B F
0 0 0
0 1 1
A Q
1 0 1
0 0
(A) 1 1 0
1 0

(A) F A B
A Q
0 1 (B) F A B
(B)
1 1 (C) F A B
(D) F A B
A Q
0 0 14. Which of the following is not
(C)
1 1 expected from a clock pulse in
CPU ?
A Q
(A) It is not applied to all registers.
0 1
(D)
1 0 (B) It changes the state of
registers as per control signal
12. “100” is a number in Decimal
requirements.
Number System. What will be its
representation in Octal Number (C) It allows synchronization of
System ? various activities.
(A) 100 (D) It may trigger the loading
(B) 144 of data into registers or the
(C) 414 transfer of data between
(D) 441 registers.

7 [P.T.O.
 APR - 37224/II—A

15. Which of the following task is 17. Stack Pointer Register (SP) in
performed by Direct Memory Access x86 architecture is generally used
(DMA) in a computer system ?
to .................. .
(A) allow data transfer between
a storage unit and CPU (A) point base of the stack
independent of memory
(B) point top of the stack
(B) allow data transfer between
a storage unit and main (C) point top or based of the stack
memory independent of CPU
based on opcode
(C) allow data transfer between
a storage unit and main (D) point top or based of the stack
memory under CPU control based on addressing mode
(D) allow data transfer between
18. Which of the following computer
CPU and main memory
independent of a storage unit systems is represented when a

16. Which of the following statements computer can process several

is not true with respect to a programs at the same time ?
Hardwired Control Unit in
comparison with a Micro- (A) Single Instruction Stream,
programmed Control Unit ? Single Data Stream (SISD)
(A) It does not require control
(B) Single Instruction Stream,
memory
Multiple Data Stream (SIMD)
(B) It provides better execution
speed
(C) Multiple Instruction Stream,
(C) It enables a simpler control unit
Single Data Stream (MISD)
design
(D) It does not allow for flexible (D) Multiple Instruction Stream,
control unit design Multiple Data Stream (MIMD)

8
 APR - 37224/II—A

19. Which Redundant Array of 21. What is the difference between a

Independent Disks (RAID) “shallow copy” and a “deep copy”

technology maintains copy of an in the context of programming

entire hard disk on other hard languages ?

disk ? (A) Shallow copy duplicates only

(A) RAID 0 references, while deep copy

duplicates entire object

(B) RAID 1

(B) Shallow copy duplicates entire

(C) RAID 5
object, while deep copy
(D) RAID 10
duplicates only references
20. Which type of memory allows
(C) Shallow copy duplicates only
computer system to execute
system variables, whereas deep
computer programs requiring more
copy duplicated user defined
memory than physically available ?
variables
(A) Auxiliary Memory
(D) Shallow copy duplicates only
(B) Associative Memory
user defined variables, whereas

(C) Cache Memory deep copy duplicated system

(D) Virtual Memory variables

9 [P.T.O.
 APR - 37224/II—A

22. The term “snapshot” is used in the

24. Predict the output of the following
context of virtualization to refer
to ..................... . C source code :

(A) Backup of virtual machine’s

int x = 10;
current state

(B) Backup of host operating int main( )

system’s current state
{
(C) Backup of guest operating
system’s current state
int x = 20;
(D) Backup of guest applications
current state {

23. Predict the output of the following

int x = 30;
source code in C language :

int main( ) {extern x; printf("%d", x);}

{
}
int i, x[5];
return 0;
for(i=0; i<5; i++) * (x+i) = i;

for(i=0; i<5; i++) printf("%d", x[i]); }

return 0;
(A) 10
}

(A) 0 1 2 3 4 (B) 20

(B) Syntax Error

(C) 30
(C) Semantic Error

(D) Garbage Value (D) 10 20 30

10
 APR - 37224/II—A

25. class C { 26. Predict the output of this source code

written in C++ language :
public:
class C1{
void f(int a) {cout << a;} public:
void f(int a, int b) {cout << a+b;}; void display() {cout<<"Hello";}

void f(int a, int b, int c) {cout };

<< a+b+c;} class C2; public C1{

}; public:
void display() {cout<<"World";}
int main( )
};
{
int main(void) {
C obj;
C1*ptr = new C2;
obj.f(10); ptr->display();
obj.f(10, 20); return 0;

obj.f(10, 20, 30); }

(A) Hello
return 0;
(B) World
}
(C) Hello World
The above C++ source code exempli-
(D) World Hello
fies which of the following principle
27. Which of the following activities is
with respect to object-oriented not an application of XML ?
programming ?
(A) Data storage
(A) Abstraction (B) Data transmission
(B) Encapsulation (C) Multiple rendering of the same
data
(C) Inheritance
(D) Interaction with the user to get
(D) Polymorphism the data
11 [P.T.O.
 APR - 37224/II—A

28. Which of the following statements 31. Which of the following commands
is not true with respect to Applets ?
is used to save any transaction
(A) All web browsers support Applets
permanently into the database ?
(B) Applets are vulnerable from
security perspective (A) Redo

(C) Applets can communicate with (B) Commit

their server on their own
(C) Rollback
(D) Applets can play multimedia on
client side (D) Undo

29. A transformation that distorts the 32. The maximum number of children
shape of an object such that the
that a B-tree of order m can have :
transformed shape appears as if the
object was composed of internal (A) m + 1
layers that had be caused to slide
over each other is called as ......... . (B) m – 1

(A) Reflection (C) m

(B) Shear (D) 2m

(C) Dither
33. Which of the following commands
(D) Translation
can be used SQL to delete all the
30. Which of the following materials has
records in the table work ?
highest spectacular reflection
coefficient at an angle of 45º of (A) Delete from work
incidence over it ?
(B) Delete from work where
(A) Water
Id = ‘Null’
(B) Glass
(C) Remove table work
(C) Gold

(D) Silver (D) Drop table work

12
 APR - 37224/II—A

34. A database is : 37. In the context of functional

dependency, Armstrong inference
(A) an organized collection of data rules refer to :
or information that can be only (A) Reflexivity, Decomposition and
accessed Transitivity

(B) an organized collection of data (B) Decomposition and Transitivity

or information that can be only (C) Transitivity, Augmentation and
Reflexivity
managed
(D) Decomposition and Reflexivity
(C) an organized collection of data 38. For the SQL query given below :
or information that can be SELECT employee_name
accessed, updated and managed
FROM employee
(D) an organized collection of data WHERE salary BETWEEN 70000
or information that cannot be and 130000
updated Select the equivalent in SQL without
BETWEEN operator :
35. The data contained in the data
(A) SELECT employee_name
warehouse is described by :
FROM employee
(A) Relational data WHERE salary > 70000 and
salary < 130000
(B) Meta data
(B) SELECT employee_name
(C) Operational data FROM employee
(D) Active data WHERE salary = 70000 and
salary = 130000
36. An advantage of distributed
(C) SELECT employee_name
database over a centralized
FROM employee
database :
WHERE salary >= 70000 and
(A) Modular growth salary <= 130000
(B) Software cost (D) SELECT employee_name
FROM employee
(C) Software complexity
WHERE salary < 70000 and
(D) Slow response salary > 130000

13 [P.T.O.
 APR - 37224/II—A

39. A transaction enters into its 43. Consider the following proposed
partially committed state : solution to dining philosopher’s
(A) When it finishes the execution problem to avoid deadlock. Consider
of final statement the binary semaphore lock in
(B) When it starts the execution of initialized to 1.
first statement Philosopher (int i)
(C) After writing ‘COMMIT’ into { while (1)
log
{ think ( );
(D) It never enters partially
committed state wait (lock); .............(i)
40. Consider the relation scheme (M, N, wait (fork [i]);
O, P, Q, R) with the following set wait (fork [(i+1)%5]);
of functional dependencies :
signal (lock); ........ (ii)
F = {MO PQ, MPR NO}
eat( );
Which of the following is the trivial
functional dependencies in F+, where wait (lock); ............. (iii)
F+ is closure of F ? signal (fork [i]);
(A) MO PQ signal (fork (i + 1) % 5);
(B) MO OP signal (lock); ............ (iv)
(C) MP P }
(D) MPR N Which of the following is correct ?
41. In what tree, for every node the
(A) Removing (i) and (ii) will not
height of its left subtree and right
subtree differ at least by one : affect the code. The code will
work fine.
(A) AVL tree
(B) Removing (iii) and (iv) will not
(B) Threaded binary tree
affect the code. The code will
(C) Binary search tree
work fine.
(D) Complete tree
(C) Removing (i), (ii), (iii), (iv) will
42. An example of a distributed OS is : not affect the code. The code will
(A) Amoeba work fine.
(B) UNIX (D) All (i), (ii), (iii), (iv) are necessary.
(C) MS-DOS Removal of any of them will
(D) MULTICS affect the code.

14
 APR - 37224/II—A

46. Match the following flag bits used

44. Which of the following type is at
in the context of virtual memory
management on the List I (Name of
lowest level in terms of operating
the bit) with the different purposes

system security ? on the List II (Purpose) of the table

mentioned :

(A) Type A List I

(Name of the bit)

(B) Type B (i) Dirty

(ii) R/W
(C) Type C (iii) Reference

(iv) Valid
(D) Type D List II

(Purpose)
45. The equivalent postfix express for
(a) Page initialization

(b) Write-back policy

d / (e + f) + b * c is :
(c) Page protection

(A) defbc / ++ (d) Page replacement policy

Codes :

(B) def + / bc + * (i) (ii) (iii) (iv)

(A) (d) (a) (b) (c)

(C) def + / bc * + (B) (b) (c) (a) (d)

(C) (c) (d) (a) (b)

(D) def / ++ bc *
(D) (b) (c) (d) (a)

15 [P.T.O.
 APR - 37224/II—A

47. An operating system contains 3 user 50. Where does the swap space reside ?
processes each requiring 2 unit of (A) RAM
resources ‘R’. The minimum number (B) Disk
of units of ‘r’ such that no deadlocks
(C) ROM
will ever arise is :
(D) On chip cache
(A) 3
51. Which problem exists from the
(B) 5
management perspective in the
(C) 4 incremental model ?
(D) 6 (A) System structure tends to
48. How much extra space is used by improve as new increments are
heapsort algorithm ? added and performs better.

(A) O(n) (B) System structure becomes

robust as new increments
(B) O(np)
added.
(C) O(l) (C) System structure tends to
(D) O(log n) degrade as new increments are
49. Consider a non-negative counting added and performs better.
semaphore S. The operation P(s) (D) System structure tends to
decrements S, and V(s) increments degrade as new increments are
S. During an execution, 20 P(s) added and regular changes
operations and 12 V(s) operations corrupts its structure.
are issued in some order. The largest 52. In development testing ............... may
initial value of S for which at least be simple entities such as functions
one P(s) operation will remain or object classes, or may be coherent
blocked is : groupings of these entities.
(A) 4 (A) Components
(B) 5 (B) Table
(C) 6 (C) View
(D) 7 (D) Domain

16
 APR - 37224/II—A

53. ................... principle expect the 56. Architectural models that may be
system requirements to change and developed may include :
so design the system to accommodate ................ models that shows
the changes in Agile software relationships, such as data flow,
between the sub-systems.
development.
(A) Static structural
(A) Incremental delivery
(B) Dynamic process
(B) People not process (C) Interface model
(C) Embrace change (D) Relationship models

(D) Maintain simplicity 57. ................. ensure the software

development team have followed
54. The ................. thread of Extreme project quality procedures.
programming comes from helping (A) Quality assurance
build software teams at their start-
(B) Quality planning
ups and need to maintain flexibility.
(C) Quality control
(A) Second (D) Quality check
(B) Fourth 58. In COCOMO II model PREX stands
for ................. .
(C) Sixth
(A) Personnel experience
(D) Seventh
(B) Reliability and complexity
55. ............. are a requirements discovery (C) Personnel capability
technique that were first introduced (D) Personal exchange
in the Objectory method. 59. Who presents the code or document
at an inspection meeting ?
(A) Classes
(A) Reader
(B) Objects
(B) Inspector
(C) Functions
(C) Chief moderator
(D) Use cases (D) Author

17 [P.T.O.
 APR - 37224/II—A

60. Which is not a factor influencing 64. A doubly linked list is :

system release strategy ?
(A) Technical quality of the system (A) A linear data structure
(B) Platform changes
(B) A non-linear data structure
(C) Lehman’s fifth law
(D) Verification (C) Both linear and non-linear data

61. The Merger sort algorithm employs structure

the design technique :
(D) Neither linear nor non-linear
(A) Backtracking
(B) Dynamic programming data structure
(C) Divide and Conquer
65. Which is the odd one among the
(D) Brute force
following ?
62. A binary tree whose every node
has either zero or two children is (A) Array
called :
(A) Binary search tree (B) Binary tree
(B) Extended binary tree
(C) Complete binary tree
(C) Complete binary tree
(D) Skewed binary tree (D) Graph

63. For binary search algorithm, which 66. If a planar graph has v vertices,
of the following is not a required
condition ? e edges and f faces, then which of
(A) The list must be sorted the following is true ?
(B) There must be an easy
mechanism to delete and/or (A) e + f – v = 2
insert elements in list
(B) e – f + v = 2
(C) There should be a direct access
to the middle element in any (C) v + e + f = 2
sublist
(D) None of the above (D) v – e + f = 2

18
 APR - 37224/II—A

67. Given a binary tree with : 68. Consider the undirected weighted
(i) The inorder tree traversal
output as : A B C D graph G with 3 vertices, whose
(ii) The preorder tree traversal adjacency matrix is given as :
output as : C B A D
Then the original binary tree is : 0 2 2
G 2 0 2
(A) 2 2 0

Which of the following is true ?

(A) Graph G has no minimum

spanning tree
(B)
(B) Graph G has a unique minimum

spanning tree of cost 4

(C) Graph G has 3 distinct minimum

(C) spanning trees, each of cost 4

(D) Graph H has 3 spanning trees

of different costs

69. The travelling salesman problem can

(D) be solved using :

(A) BFS traversal

(B) A spanning tree

(C) A minimum spanning tree

(D) DFS traversal

19 [P.T.O.
 APR - 37224/II—A

70. A complete binary tree has depth, 72. Determine the regular expression for
the language accepted by L1/L2 for
given by the formula (where n is the
L1 = L(a*baa*), L2 = (ab*) :
number nodes) :
(A) a*ba*
(A) n log 2 n (B) aba*

(B) log 2 n (C) a*b*a*

(D) (abc)*
(C) log2 (n + 1)
73. Determine the context free grammar
(D) n log2 n + 1 for the following language where
n, m 0 :
71. Let { a, b} , { a, b, c} and
L {w {a, b}*| na (v) nb (v) , where
define ‘h’ by :
v is any prefix of w}
h(a) = ab
(A) S A|B

h(b) = bbc A aA|aS|

Then h(aba) = abbbcab B bB|

(B) S A|B
The homomorphic image of
A aA|aS|
L = {aa, aba}
B bB|bS|
is the language .............. . (C) S A|B

(A) h(L) {abab, abbbcab} A aA|aB|

B bB|
(B) h(L) {abab, abbbcab, aaaa}
(D) S A|B
(C) h(L) { abab, abbbcab, bbbb}
A aA|SS|
(D) h(L) {abb, abcab} B bB|bA|

20
 APR - 37224/II—A

74. Which of the following statements 76. Which one of the following is not
are true ? decidable ?
(A) Given a Turing machine M, a
S1 : Left recursion is a major string S and an integer K, M
problem in top-down parsing accepts S with K step S
(B) Equivalence of two given
and needs to be removed first.
Turing machines
S2 : Backtracking makes the (C) Language accepted by a given
DFSA is non-empty
bottom-up parser delay the
(D) Language generated by a CFG
input processing. is non-empty
S3 : SLR parser has lesser number 77. Determine the language accepted
by the following deterministic finite
of states than canonical – accepter over { a, b} :
LR parser.

S4 : Canonical – LR parser is more

powerful than LALR parser.

(A) S1 and S2

(B) S1 only
(A) A language that recognizes the
(C) S1 and S3
set of all strings on { a, b}
(D) S1, S3 and S4 starting with prefix ‘ab’
(B) A language that recognizes the
75. What does Russell’s paradox
set of all strings on { a, b}
challenge in set theory ? starting with ‘ab’
(C) A language that recognizes the
(A) Axioms of infinity
set of all strings on { a, b}
(B) Axioms of choice starting with ‘a’ or ‘b’
(D) A language that recognizes the
(C) Axioms of regularity
set of all strings on { a, b}
(D) Axioms of foundation starting with any number of ‘as’

21 [P.T.O.
 APR - 37224/II—A

78. Which of the following is a 80. In peephole optimization, what is

characteristic of recursive descent
loop unrolling aimed at achieving ?
parsing ?
(A) Reducing the number of loops
(A) Backtracking
(B) Eliminating conditional
(B) Memoization
statements within loops
(C) Ambiguity
(C) Decreasing the size of loops
(D) Shift-Reduce conflicts
by removing redundant
79. In an S-attributed definition, what
distinguishes synthesized attributes instructions

from inherited attributes ? (D) Expanding the body of a loop to

(A) Synthesized attributes are reduce over head and improve
computed bottom-up and
parallelism
inherited attributes are
81. The ................... is a program that
computed top-down
runs on computer and servers that
(B) Inherited attributes are
computed bottom-up and allows computer to communicate

synthesized attributes are over a network.

computed top-down
(A) System Software
(C) Inherited attributes depend
(B) Application Software
only on synthesized attributes
(C) Windows Operating System
(D) Synthesized attributes depend
only on inherited attributes (D) Network Operating System

22
 APR - 37224/II—A

82. Determine the line speed for a 85. In wireless networks CDPD stands
20-channel PCM/TDM system with for ................. .
a 8-kHz sample rate, 10 bits per (A) Carrier Data Packet Data
sample and one framing bit per
(B) Collision Detection in Packet
frame.
Data
(A) 1.608 Mbps
(C) Cellular Digital Packet
(B) 1.204 Mbps Distribution
(C) 3.406 Mbps (D) Cellular Digital Packet Data
(D) 1.2 Mbps 86. Which device is used to connect
83. In dual cable system to transmit a different networks that provide
data a computer outputs the data on necessary translation both in terms
to cable 1, which runs to the device of hardware and software ?
called the ............... at the root of the (A) Switches
cable tree.
(B) Routers
(A) tail end
(C) Hubs
(B) after one hop
(D) Gateways
(C) head end
87. What is the bit pattern obtained for
(D) round trip the sequence of bits 10110101 was
84. What is the broad band frequency sent in even parity by adding a bit
in telephone network ? at the end ?

(A) 4 kHz (A) 101101011

(B) 3 kHz (B) 101101010

(C) 2 kHz (C) 001101010

(D) 1 kHz (D) 001101011

23 [P.T.O.
 APR - 37224/II—A

88. In computer networks, Pulse Code 91. In LISP the function that provides

Modulation (PCM) method is used the initial element of a list is :

for digitizing analog voice signals (A) Car

usually samples, the incoming (B) Set
voice signal once every ...................
(C) Second
microseconds.
(D) First
(A) 75
92. In neural network, the network
(B) 125
capacity is defined as :
(C) 175
(A) The traffic (tarry capacity of
(D) 225
network)
89. What is the fixed-size blocks used
(B) The total number of nodes in the
by Trivial File Transfer Protocol to
network
transfer the data ?
(C) The number of patterns that
(A) 128 bytes
can be stored and recalled in a
(B) 256 bytes network
(C) 512 bytes (D) The numbers of computes in a
(D) 1024 bytes network

90. What are the highly stable and 93. What term describes the scenario
highly volatile values that are where the training error of a model
assigned to the information in decreases while the test error
Time-to-live field ? increases ?

(A) 86400 and 60 (A) Over fitting

(B) 36000 and 0 (B) Under fitting

(C) 128000 and 128 (C) Testing error

(D) 120000 and 60 (D) Proper fitting

24
 APR - 37224/II—A

94. What is Coreference Resolution ? 96. Consider the following statements :

(A) Anaphora Resolution Statement (1) : In the logistic

(B) Given a sentence or larger regression model we pass the values

chunk of text determine which of W. x + b (for every x in the dot

words (mentions) refer to the set) through a sigmoid function to

same objects (entities) return a probabilistic class label.

(C) Solution obtained through Statement (2) : In the logistic

coreference regression model, if the value

(D) Solution of a previous solved (W. x + b) given to the sigmoid

problem function in close to zero. Then the

95. ................ is the type of morphology class label predicted (with a 0.5

that changes the word category and threashold) is very certain and

affect the meaning. reliable.

(A) Inflectional (A) Only (1) is correct

(B) Derivational (B) Only (2) is correct

(C) Cliticization (C) Both (1) and (2) are correct

(D) Infuational (D) Neither (1) nor (2) is correct

25 [P.T.O.
 APR - 37224/II—A

97. A general fuzzy controller consists 99. A neuron has five inputs given by

of .................. . I = {1, 3, 2, –1, 3} and corresponding

weights are W = {0.5, 2, –1, 2, –0.5}.
(A) Fuzzy rule base, fuzzy inference
The bias b = 0 and slope parameter
engine and fuzzification/
= 1. The sigmoid activation
defuzzification modules
function is used to generate final
(B) Fuzzy functions, fuzzy inference output y. What is the value of y ?
engine and fuzzification/
(A) –1
defuzzification modules
(B) 0.52
(C) Fuzzy rule base, fuzzy data
(C) 0.73
engine and fuzzification/
(D) 0.92
defuzzification modules
100. Which among the following
(D) Fuzzy functions, fuzzy data
minimizes the upper bound of the
engine and fuzzification/
generalization error and maximizes
defuzzification modules
the margin between a separating
98. Which of the following is not a
hyperplane and the training data,
correct encoding technique used in instead of minimizing the training
genetic algorithms ? error ?

(A) Premier encoding (A) Boltzmann machine

(B) Tree encoding (B) SVM

(C) Binary encoding (C) Hopfield neural network

(D) Value encoding (D) RBF

26
 APR - 37224/II—A

ROUGH WORK

27 [P.T.O.
 APR - 37224/II—A

ROUGH WORK

28