SET 2013

PAPER III
COMPUTER SCIENCE AND APPLICATIONS
Signature of the Invigilator Question Booklet No. ....................................

1. OMR Sheet No.. ....................................

Subject Code 10 ROLL No.

Time Allowed : 150 Minutes Max. Marks : 150

No. of pages in this Booklet : 15 No. of Questions : 75
INSTRUCTIONS FOR CANDIDATES
1. Write your Roll No and the OMR Sheet No in the spaces provided on top of this page.

2. Fill in the necessary information in the spaces provided on the OMR response sheet.

3. This booklet consists of seventy five (75) compulsory questions each carrying 2 marks.

4. Examine the question booklet carefully and tally the number of pages/questions in the booklet with the information
printed above. Do not accept a damaged or open booklet. Damaged or faulty booklet may be got replaced
within the first 5 minutes. Afterwards, neither the Question Booklet will be replaced nor any extra time given.

5. Each Question has four alternative responses marked (A), (B), (C) and (D) in the OMR sheet. You have to
completely darken the circle indicating the most appropriate response against each item as in the illustration.

A B D
6. All entries in the OMR response sheet are to be recorded in the original copy only.

7. Use only Blue/Black Ball point pen.

8. Rough Work is to be done on the blank pages provided at the end of this booklet.

9. If you write your Name, Roll Number, Phone Number or put any mark on any part of the OMR Sheet, except
in the spaces 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.

10. You have to return the Original OMR Sheet to the invigilators at the end of the examination compulsorily and
must not carry it with you outside the Examination Hall. You are, however, allowed to carry the test
booklet and the duplicate copy of OMR Sheet on conclusion of examination.

11. Use of any calculator, mobile phone or log table etc. is strictly prohibited.

12. There is no negative marking. 10-13

CLA-48876 1 Paper-III
{{1}}
 COMPUTER SCIENCE AND APPLICATIONS
PAPERIII
Note : This paper contains seventy five (75) objective type questions of two (2) marks each. All questions are
compulsory.
1. The maximum data rate of a noiseless channel with a 5. Consider the following logic circuit :
bandwidth of 10 KHz is 40 Kbps. How many
discrete levels are used to transmit the data in this
channel ?
(A) 2
(B) 16
(C) 3
(D) 4 Which of the following best describes the circuit ?
(A) Exclusive OR (a XOR b)
2. A certain CPU takes on the average 1.2 clock cycles (B) Equivalence (a = b)
to execute an instruction. Suppose the CPU is driven (C) The carry bit of a + b
by a 480 MHz clock. What would be the MIPS
(D) The sum bit of a + b
value of the CPU ?
(A) 400
(B) 0.4 6. Modularity and concept of abstraction enables the
(C) 40 engineer to :
(D) 576 (A) Re-use the software components
(B) Increase Interdependencies among the modules
3. The addressing mode for an operand defines how (C) Increase highest possible coupling
the address of the operand is determined. In which (D) Lower the cohesion
addressing mode, the operand is given explicitly in
the instruction (example instruction : Add R4, #3) ?
(A) Absolute mode 7. Which measurement activity is missing from the list
(B) Immediate mode below ?
(C) Register indirect mode Formulation, Collection, Analysis, Interpretation :
(D) Based indexed mode (A) Design
(B) Feedback
4. CPI recently became more important performance (C) Measurement
metric than the clock cycle rate for processors
(D) Quantification
performance index, because :
(A) Increasing processor clock cycle rate is almost
reaching the physical limit 8. Component-level metrics do NOT include measure
(B) CPI and Clock Cycle rate are the terms having of :
exactly the same meaning (A) Complexity
(C) Processors clock cycle rate can be increased (B) Coupling
without any limit (C) Module cohesion
(D) CPI is always equal to 1 and clock cycle rate is (D) Performance
same as CPI

CLA-48876 2 Paper-III
{{2}}
9. ___________ establishes information about when, 12. In OpenGL, graphical primitives are defined by
why and by whom changes are made in software. vertices which are transformed by the OpenGL
(A) Software Configuration Management pipeline. Which sequence of operations is
(B) Change Control CORRECT ?
(C) Version Control
(A) IlluminationMODELVIEW transformation
(D) An Audit Trail
PROJECTION transformationClipping
Viewport transformation
10. _________ metric does NOT depend on the
programming language used. (B) PROJECTION transformation Illumination
(A) Line of code MODELVIEW transformationViewport
(B) Function count transformationClipping
(C) Number of tokens (C) MODELVIEW transformationClipping
(D) Loop count IlluminationPROJECTION
transformationViewport transformation
11. What is the homogeneous matrix for reflecting a 2D (D) MODELVIEW transformationIllumination
point on the line y = x (i.e. the line which consists of
PROJECTION transformationClipping
all points (k, k), k ) ?
Viewport transformation
0 1 0
(A) R = 1 0 0 13. Consider the following statements about digital
0 0 1 images :
I. Computer Graphics is about transforming
0 1 0
(B) R = 1 0 0
images into new images

0 0 1 II. Image Processing is about generating digital

images
0 1 0 III. Computer Graphics and Image processing are

(C) R = 1 0 0 the terms that have same meaning
0 0 1 Which of these is FALSE ?
(A) I only
0 1 0
(B) II only
(D) R = 1 0 0
(C) II and III only
0 0 1
(D) All of I, II and III

CLA-48876 3 Paper-III
{{3}}
14. Which homogeneous 2D matrix transforms the figure 16. NULL values can NOT be used in the relational
on the left side to the figure on the right side ? model :
(A) To allow duplicate tuples in the table by filling

(Diagram) the primary key column(s) with NULL

(B) To avoid confusion with actual legitimate data
values like 0 for integer columns and (the empty
string) for string columns
1 0 2 (C) To fill a column in tuple when that column does

(A) 0 2 0
not really exist for that particular tuple
0 0 1
(D) To opt a tuple out of enforcement of a foreign
1 0 0 key

(B) 0 2 0
0 0 1
17. Which of the following is impossible to represent in a
relational schema ?
0.5 0 0

(C) 0 2 0 (A) Any mandatory participation constraint in a
0 0 1 many-to-one relationship

(B) Any mandatory participation constraint in a
0 .5 0 2
many-to-many relationship
(D) 0 1 0
0 0 1 (C) A one-to-one relationship

(D) A many-to-one relationship
15. A relational database management system (RDBMS)
does NOT do which of the following ? 18. Schema normalization is not for :
(A) Provide mechanisms to protect the integrity of
(A) Reducing the number of tables in the schema
the data
(B) Ensure that relational schemas are in at least (B) Eliminating uncontrolled redundancy of data
3NF (C) Eliminating anomalies that could otherwise occur
(C) Optimize query evaluation for arbitrary SQL
with inserts and deletes
queries and allow for concurrent transactions
against the database (D) Ensuring that functional dependencies are
(D) Facilitate crash recovery of the database in case enforced
of hardware failure

CLA-48876 4 Paper-III
{{4}}
19. What result set is returned from the following SQL
query ?
Select customer_name, telephone
from customers
where city in (Jaipur, New Delhi. Agra);
(A) The customer_name and telephone of all
customers
(B) The customer_name and telephone of all
customers living in either Jaipur, New Delhi or
Agra
(C) The customer_name and telephone of all
customers living in Jaipur and New Delhi and
Agra
(D) The customer_name of all customers living in
Jaipur, New Delhi or Agra
20. Identify the factor which enforces a relation in 3NF :
(A) Every non-key attribute is fully functionally
dependent on primary key
(B) Every non-key attribute is partially dependent
on super key
(C) The domain of attribute must include only atomic
values
(D) Every non-key attribute is non-transitively
dependent on primery key
21. Consider the relations R(A,B) and S(B,C) and the
following queries over R and S :
I. {A, C | (, R ,CS)} 25. In a LAN, the function of ARP is to :
II. select distinct A,C from R,S where R.B = S.B
III. A,C(R S)
One can deternmine that :
(A) I & II are the same query
(B) I & III are the same query
(C) II & III are the same query
(D) I, II & III are the same query
CLA-48876
{{5}}
22. The Internet Protocol (IPv4) is an example of a :
(A) Connection-less network layer protocol
(B) Connection-oriented network layer protocol
(C) Connection-less transport layer protocol
(D) Connection-oriented transport layer protocol
23. Version 6 of the Internet Protocol (IPv6) improves
upon IPv4 by :
(A) Expanding the IP address space
(B) Providing better support for mobility
(C) Providing better support for Quality of Service
(D) All of the above
24. Consider the following statements regarding
difference between UDP and TCP. Which of these
is TRUE ?
I. TCP is a reliable byte stream protocol, while
UDP is not
II. TCP is connection-oriented, while UDP is
connection-less
III. TCP uses sequence numbers, while UDP does
not
IV. TCP enforces flow control, while UDP has no
flow control
Codes :
(A) I and II only
(B) III and IV only
(C) I, II and III only
(D) All are True
(A) Find the MAC address given an IP address
(B) Find the IP address given a MAC address
(C) Provide domain name resolution service. That
is, given a hostname, ARP provides its
corresponding IP address
(D) Forward network traffic based on IP address
5 Paper-III
26. The main distinguishing characteristic between 29. Consider two hosts, A and B, connected by a store-
Routers and End systems is :
and-forward switch as shown in the diagram. The links
(A) Routers are typically owned by network
providers, not by users. They are typically between each host and switch have a bandwidth of
expensive, unlike most end systems 10 Mbps and a propagation delay of 1 millisecond.
(B) Routers are typically operated 24 7, unlike What is the one-way latency (first bit sent to last bit
most end systems
(C) Routers typically have multiple network received) for sending a 1000-bit packet from A to
interfaces and links, unlike most end systems B?
(D) All of the above
10 Mbps. 1 ms 10 Mbps. 1 ms
27. In the initial deployment of the Internet, the three A Switch B
primary network applications were :
(A) Electronic mail, file transfer and chat
(B) Network news, file transfer and the Web (A) 2.0 millisecond
(C) Remote login, file transfer and electronic mail
(D) Facebook, YouTube and eBay (B) 2.1 millisecond
(C) 2.2 millisecond
28. Match column X with Y. (D) 2.0 microseconds

Column X Column Y
(i) IMAP p used by the Mail Transfer 30. In the Transmission Control Protocol (TCP),
Protocol Agent (MTA) to deliver acknowledgements (ACKs) are used for :
(A) Error control
(ii) POP3 q is not a protocol dedicated for
Protocol email communications, but it (B) Flow control
can be used for accessing your (C) Congestion control
mailbox (D) All of the above

(iii) SMTP r is a client/server protocol in

Protocol which e-mail is received and 31. Why is information security much more important
held for you by your Internet today than it was 25 years ago ?
server (A) The amount of digital property in the world has
(iv) HTTP s used to download e-mail mushroomed
Protocol messages from the mail server (B) Information is much more widely accessible
to a local computer today via the Internet
(C) Information systems are much more highly
Codes :
(i) (ii) (iii) (iv) interconnected today
(A) p q r s (D) All of the above
(B) s q r p
(C) q r s p
(D) r s p q

CLA-48876 6 Paper-III
{{6}}
32. Which of the following statements is/are TRUE with
regard to deadlock prevention and starvation ?
I. Process requests for all their resources before
starting execution will help to avoid the mutual
exclusion condition
II. Solving hold and wait condition will reduce
starvation
III. Starvation can be avoided by using a first-come,
first serve resources allocation policy
IV. Circular wait condition can be broken by
34. It is known that UNIX OS has an inode-based file
system. The file system has 512 byte blocks. Each
inode has 10 direct, 1 single indirect, 1 double indirect
block and 1 triple in direct block pointer. Block
pointers are 4 bytes each. Assume the inode and
any block free list is always in memory. Blocks are
not cached. What is the maximum file size that can
be stored before the double indirect pointer
needed ?
(A) 5 K
(B) 25 K
(C) 69 K
(D) 8261 K

ordering resources numerically

35. A critical section of code is :
Codes : (A) A section that is executed very often and
(A) Only IV therefore should be written to run very efficently
(less space and less time)
(B) Only III and IV
(B) A section of the program that must not be
(C) Only III interrupted by the scheduler
(D) Only II (C) A section of the program that is susceptible to
race conditions, unless mutual exclusion is
enforced
33. Choose the correct UNIX access permission list that (D) A section of the code executed in kernal mode
conforms to the following requirements.
36. Deadlocks can be eliminated using resource
There is a file which can be executed by the owner
preemption and give these resources to other
but the others cannot. In addittion, the owner and the processes until the deadlock cycle is broken. Which
group users can read and write to the file. All other of the following may become issues with this
approach ?
users can read the file but cannot write.
I. Banker Algorithm
(A) -rwxrw-r-- II. Rollback
(B) dr-xrwxr-x III. Starvation
(C) -rwxr- -rw- Codes :
(A) I only
(D) -r-xrwxr-x
(B) II only
(C) I and II only
(D) II and III only

CLA-48876 7 Paper-III
{{7}}
37. Match the most appropriate algorithm or data 38. When viewing a site securely, where does the SSL
structure that can be used to provide efficient correct protocol run in relation to TCP/IP, HTTP and the
solution to the problems given below : Browser ?
Name of the Problem Description (A) TCP/IPHTTPSSLBrowser
(B) TCP/IPSSLHTTPBrowser
algorithm or
(C) HTTPTCP/IPSSLBrowser
Data Structure (D) HTTPBrowserSSLTCP/IP
I Bellman-Ford (i) Sort a list of keys which
are already nearly in 39. If N is an n-bit number, how many bits long is N!,
sorted order approximately in (.) form ?
(A) (n log n)
II Simplex (ii) Sort a large list of keys in (B) (2n)
roughly random order (C) (n2n)
(D) (n2)
III Insertion sort (iii) Find a shortest path in an
40. Let n denote a positive integer. Suppose a function L
edge-weighted digraph
is defined recursively as follows : (here k denotes
with some negative edge the floor of k).
weights but no negative 0 if n = 1
L(n ) =
L( n / 2) + 1 if n > 1
cycles

IV Quicksort (iv) Find a shortest path in an What does L find ?

edge-weighted digraph
(A) L = log 2 n
with no negative edge n2
weights (B) L= +1
4n
(C) L=2
V Dijkstra (v) Find the maximum of a (D) L = n3
linear objective function
subject to linear equality 41. In which tree, for every node the height of its left
sub-tree and right sub-tree differ almost by one ?
and inequality constraints
(A) Binary search tree
(B) Threaded Binary Tree
Codes : (C) AVL tree
I II III IV V (D) Complete Binary Tree
(A) (iii) (v) (i) (ii) (iv)
(B) (iv) (v) (i) (ii) (iii) 42. A pushdown automata is to a ______ as a finite
(C) (iv) (v) (ii) (i) (iii) automata is to a regular expression.
(D) (iii) (iv) (i) (ii) (v) (A) Arithmetical Expression
(B) Context Free Grammar
(C) Entity-Relationship Diagram
(D) Wild Card Character

CLA-48876 8 Paper-III
{{8}}
43. How might the following be written in prolog ? If I 47. Let G = (V, E) be the following weighted undirected
forget my umbrella on a day when it rains, Ill graph : V = {1, 2, 3, 4, 5, 6, 7} and E = {[(1,2) 7],
get wet. [(1,4) 4], [(2,4) 4], [(1,3) 22], [(3,5) 5], [(4,5) 10],
(A) wet(m) :- rainy(d). wet(m) :- no_umbrella(m,d) [(2,6) 4], [(4,6) 5], [(5,7) 3], [(6,7) 5]}, where
(B) rainy(d), no_umbrella(m,d) :-wet(m) [(i,j) k] means that (i,j) is an edge of weight k. The
(C) rainy(d) :-wet(m). no_umbrella(m,d):-wet(m) cost of a minimum spanning tree in G is :
(D) wet(m) :-rainy(d), no_umbrella(m,d) (A) 30
(B) 25
44. Which of the following is TRUE ? (C) 32
(A) Uniform-cost search is a special case of
(D) 24
Breadth-first search
(B) Breadth-first search, depth-first search and
48. Match the name of three principle memory allocation
uniform-cost search are special cases of best-
classes with their corresponding object lifetimes :
first search
(C) A* is a special case of uniform-cost search Memory Object Lifetime
(D) All are True Allocation
Class
45. Match the following AI pioneers to the area of AI I Static (i) Objects can have arbitrary
for which they are associated with : lifetimes; allocation & de-
1. Alain Colmerauer (a) First Neural Network allocation is possible at any
2. Claude Shannon (b) MYCIN point in time.
3. John McCarthy (c) PROLOG
Codes : II Runtime (ii) Objects exist through out
1 2 3 stack program run time; corres-
(A) (c) (b) (a) ponding memory is allocated
(B) (c) (a) (b) by OS before program
(C) (b) (a) (c) execution starts
(D) (a) (c) (b)
III Heap (iii) Objects exist for the duration
46. Let A and B be two languages over {0, 1} such that
of one subroutine execution
A is a subset of B. Consider the following
statements :
Codes :
I. If B is finite, then A is finite
II. If B is context-free, A is context-free I II III
III. If the complement of B is context-free, then (A) (i) (iii) (ii)
the complement of A is context-free (B) (ii) (iii) (i)
Which of the above statements is TRUE ? (C) (iii) (ii) (i)
(A) I only (D) (i) (ii) (iii)
(B) II only
(C) I and III only
(D) II and III only

CLA-48876 9 Paper-III
{{9}}
49. For the regular expression r, s and t, consider the 53. The sort_F(double[] data) Java method uses the
following equalities (which may be true or false) : selection algorithm and takes 3 seconds to sort an
array of 20,000 elements. What is the expected time
I. (r + s)* = (r* s*)*
for the method to sort 40,000 elements ?
II. (rs + r)*r = r(sr + r)* (A) 6 seconds
III. (rs + r)* = r(sr + r)* (B) 12 seconds
Which of the above equalities are TRUE ? (C) 9 seconds
(A) Only I (D) 15 seconds
(B) Only I and II
54. The functionality which handles the exchange of
(C) Only I and III
information between database and a user interface is
(D) All of I, II and III called :
(A) Client-Server exchange
50. By definition, a DSS must include which of the (B) Two tier architecture
following component ? (C) Connection Object
(D) Business Logic
(A) Business intelligence
(B) Expert system 55. A large item such as an image or an exe file
(C) Animation system represented in binary form :
(D) User interface (A) Binary executable Module
(B) Binary executable Method
51. A system development strategy that emphasizes (C) Binary Large Object
(D) Binary Large Component (BLC)
extensive user involvement and iterative, incremental
prototypes is : 56. You want to make a photo-quality (300 PPI, pixels
(A) RAD per inch) print of a picture that you took with your
(B) Information Engineering cell phone over the weekend. The cell phone has an
(C) Structured Design image size of 1200 900 (about 1 mega pixel), what
size will the print be ?
(D) Structured Analysis
(A) 4 3
(B) 3 4
52. Which of the following model combines the elements (C) 3 3
of the waterfall model with the philosophy of (D) 4 4
prototyping ?
(A) Prototyping 57. The major difference between Servlet and CGI is :
(A) Servlets are thread based and CGI is process
(B) Iterative
based
(C) Incremental (B) Servlets executes slower compared to CGI
(D) RAID (C) Servlet has no platform specific API, where as
CGI has
(D) Servlets require more memory than CGI

CLA-48876 10 Paper-III
{{10}}
58. In GSM (Global System for Mobile Communications) 61. What is returned by the Java method call b(0, new
system architecture, several mobile stations : int[]{-4, 5, 3, 6, 9, 12, 15, 0} ) ?
(A) Interface to a base station controller, several Public int b(int i, int[] data {
base station controllers to a base transceiver and if (i>= data.length-1)
several base transceivers to a mobile services return 0;
switching centre. else if(data[i] <data [i + 1])
(B) Interface to a base transceiver, several base return 1 + b(i +1, data);
transceivers to a base station controller, and else
several base station controllers to a mobile return b(i + 1, data);
services switching centre. }
(C) Interface to a mobile services switching centre, (A) 3
several switching centres to a base station (B) 4
controller and several base station controller to (C) 5
a base transceiver (D) 6
(D) Interface to a mobile services switching centre
and several switching centers to a base station The next THREE questions are based on the following
controller. C-program that uses arrays and pointers :
void
59. Consider the following segment of a program written g(int a[], int asize)
in Java : { int*p, *q;
String a = Vimukthi; int t;
int index = -1, count = 0; for (p = &a[asize-1]; p >= &a[0]; p--){
while (index = a.indexOf(i, ++index)) > -1) for (q = &a[0]; q < p ; q++) {
{ if (*q > *(q+1)) {
count++; t = *q;
} *q = *(q+1);
System.out.println (count); *(q+1) = t;
What would the output of the program be if the }
program is executed ? }
(A) 1 printf(%d, *p);
(B) 2 }
(C) 3 }
(D) Error main()
{
60. The Nyquist sampling theorem says : int a[8];
(A) For lossless digitization, the sampling rate must int i;
be in the range of human hearing frequency; for (i = 0; i<8; i++) a [i] = 8-i;
(B) For lossless digitization, the sampling rate must g(a,8);
be at least twice the maximum frequency }
responses
(C) For lossless digitization, the sampling rate must 62. What does this program print ?
be 44100 Hz (A) 8 7 6 5 4 3 2 1
(D) None of the above
(B) 1 2 3 4 5 6 7 8
(C) 0 1 2 3 4 5 6 7
(D) 7 6 5 4 3 2 1 0

CLA-48876 11 Paper-III
{{11}}
63. What is the complexity of the function g() in big O 66. Reliability is the ability of software to perform its
notation ? required functions under stated conditions for a
(A) O(n) specified period time and Availibility, on the other
(B) O(log n) hand, is the degree to which software is operational
2
(C) O(n ) and accessible when required for use. What is the
(D) O(n log n) availability of software with the following reliability
figures ?
64. Consider the following statements regarding the
Mean Time Between Failure (MTBF) = 25 days
function g() in the above program :
Mean Time To Repair (MTTR) = 6 hours
I. The function g() is in the complexity class P
(A) 1 %
II. The function g() is in the complexity class NP
(B) 24 %
III. The function g() is in the complexity class NP-
(C) 99 %
complete
(D) 99.009 %
Which of these statement is/are FALSE ?
(A) I only
67. Shadow price in a Linear Programming Problem
(B) II only
represents :
(C) III only
(D) II and III only (A) The value of one additional unit of a basic
variable of the problem
65. Consider the following Huffman Code tree : (B) The value of one less unit of a basic variable
(C) The value of one less unit of a specific resource
(Diagram) (D) The value of one additional unit of a specific
resource

68. If problems (P) and (Q) are dual of each other, what
Given the above tree what is the result of encoding is a,b and c ?
2x + x 2 3
OLIVE ? List the correct sequence of 0s and 1s. ( P ) max 2 x1 + ax 2 subject to 1 , x1 x 2 0
bx1 + 2 x 2 c
(A) 110000110001
2 u + 4 u 2 2
(B) 110001110001 ( Q ) min 3u1 + 4 u 2 subject to 1 , u1 u 2 0
u1 + 2 u 2 5
(C) 101000110001 (A) (a,b,c) = (4,5,4)
(D) 111100001111 (B) (a,b,c) = (5,5,4)
(C) (a,b,c) = (5,4,4)
(D) (a,b,c) = (4,4,5)

CLA-48876 12 Paper-III
{{12}}
69. An intelligent agent is capable of flexible autonomous
action in order to meet its design objectives. Here
flexibility does not include :
(A) Reactivity
(B) Pro-activeness
(C) Social ability
(D) Querying
70. Read the following description about X, Y and Z :
X : It does something harmful to the computer
system, but is disguised as something useful
Y : It is a computer program that propagates itself
across computers, creating copies of itself in each
computer and infecting the entire network
Z : It is a computer program designed to replicate
itself by infecting other files or system areas
which need a host program to spread to another
computer
Identify X, Y and Z.
(A) X : Virus, Y : Worm, Z : Trojan horse
(B) X :Trojan horse, Y : Virus, Z : Worm
(C) X :Worm, Y : Virus, Z : Trojan horse
(D) X :Trojan horse, Y : Worm, Z : Virus
71. Consider the following statements :
(I) Exceptions can be generated by the Java run-
time system
(II) Exception can be generated by the user code
(III) Exception thrown by Java relate to violations of
its language rules
Which of the above statements regarding exception
handling is/are true ?
(A) All
(B) Only (I)
(C) Only (II) and (III)
(D) Only (II)
CLA-48876 13
{{13}}
72. In context of artificial neural networks, generalization
is :
(A) The ability of a pattern recognition system to
approximate the desired output values for
pattern vectors which are not in the test set
(B) The ability of a pattern recognition system to
approximate the desire output values for pattern
vectors which are not in the training set
(C) The ability of a pattern recognition system to
extrapolate on pattern vectors which are not in
the training set
(D) The ability of a pattern recognition system to
interpolate on pattern vector which are not in
the test set
73. Which of the following characteristics of an object-
oriented programming language restricts behavior so
that an object can only perform actions that are
defined for its class ?
(A) Dynamic Binding
(B) Polymorphism
(C) Inheritance
(D) Encapsulation
74. Which of the following is in correct LEXICO-
GRAPHIC order when using ASCII code ?
(A) AND, OR ,a, an
(B) 1, 5, 15, 125
(C) a, an, OR, AND
(D) 1, 15, 125, 5
75. Multiprogramming permits the Unix Operating System
to overlap the execution of _______ processes with
that of ________ processes.
(A) Background, Foreground
(B) Parent, Child
(C) I/O Bound, CPU Bound
(D) Critical, Non-critical
Paper-III
 ROUGH WORK

CLA-48876 14 Paper-III
{{14}}
 ROUGH WORK

CLA-48876 15 1540
{{15}}