PAPER-III

COMPUTER SCIENCE AND APPLICATIONS

Signature and Name of Invigilator
1. (Signature) __________________________ OMR Sheet No. : ...............................................
(Name) ____________________________ (To be filled by the Candidate)

2. (Signature) __________________________ Roll No.

(Name) ____________________________ (In figures as per admission card)
Roll No.________________________________
J 87 1 4 (In words)

Time : 2 1/2 hours] [Maximum Marks : 150

Number of Pages in this Booklet : 12 Number of Questions in this Booklet : 75
Instructions for the Candidates    
1. Write your roll number in the space provided on the top of      
this page.     
2. This paper consists of seventy five multiple-choice type of            
questions.        
3. At the commencement of examination, the question booklet    
will be given to you. In the first 5 minutes, you are requested           
to open the booklet and compulsorily examine it as below :            
(i) To have access to the Question Booklet, tear off the
paper seal on the edge of this cover page. Do not accept
    
a booklet without sticker-seal and do not accept an open          
booklet.            
(ii) Tally the number of pages and number of questions            
in the booklet with the information printed on the            
cover page. Faulty booklets due to pages/questions         
missing or duplicate or not in serial order or any          
other discrepancy should be got replaced immediately           
by a correct booklet from the invigilator within the          
period of 5 minutes. Afterwards, neither the Question     
Booklet will be replaced nor any extra time will be   OMR
given.    
(iii) After this verification is over, the OMR Sheet Number
should be entered on this Test Booklet.
    (A), (B), (C) (D)
4. Each item has four alternative responses marked (A), (B), (C)        
and (D). You have to darken the circle as indicated below on   
the correct response against each item.  
Example :     
where (C) is the correct response.  OMR 
5. Your responses to the items are to be indicated in the OMR OMR
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.        
6. Read instructions given inside carefully.   (Rough Work)   
7. Rough Work is to be done in the end of this booklet.    OMR 
8. If you write your Name, Roll Number, Phone Number or put    
any mark on any part of the OMR Sheet, except for the space     
allotted for the relevant entries, which may disclose your            
identity, or use abusive language or employ any other unfair            
means such as change of response by scratching or using
white fluid, you will render yourself liable to disqualification.
   
9. You have to return the test question booklet and Original          OMR 
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 original   OMR
question booklet and duplicate copy of OMR Sheet on     
conclusion of examination.           
10. Use only Blue/Black Ball point pen.    
11. Use of any calculator or log table etc., is prohibited.    
12. There is no negative marks for incorrect answers.  

J-87-14 1 P.T.O.

www.examrace.com
 COMPUTER SCIENCE & APPLICATIONS
Paper – III
Note : This paper contains seventy five (75) objective type questions of two (2) marks each.
All questions are compulsory.
1. Beam-penetration and shadow-mask 4. Consider a window bounded by the
are the two basic techniques for lines : x = 0; y= 0; x = 5 and y = 3.
producing color displays with a CRT. The line segment joining (–1, 0) and
Which of the following is not true ? (4, 5), if clipped against this window
I. The beam-penetration is used will connect the points
with random scan monitors. (A) (0, 1) and (2, 3)
II. Shadow-mask is used in raster- (B) (0, 1) and (3, 3)
scan systems. (C) (0, 1) and (4, 3)
III. Beam-penetration method is (D) (0, 1) and (3, 2)
better than shadow-mask 5. Which of the following color models
method. are defined with three primary colors ?
IV. Shadow-mask method is better (A) RGB and HSV color models
than beam-penetration method. (B) CMY and HSV color models
(A) I and II (B) II and III (C) HSV and HLS color models
(C) III only (D) IV only (D) RGB and CMY color models
6. In a digital transmission, the receiver
2. Line caps are used for adjusting the clock is 0.1 percent faster than the
shape of the line ends to give them a sender clock. How many extra bits
better appearance. Various kinds of per second does the receiver receive
line caps used are if the data rate is 1 Mbps ?
(A) Butt cap and sharp cap (A) 10 bps (B) 100 bps
(B) Butt cap and round cap (C) 1000 bps (D) 10000 bps
(C) Butt cap, sharp cap and round cap
7. Given U = {1, 2, 3, 4, 5, 6, 7}
(D) Butt cap, round cap and
A = {(3, 0.7), (5, 1), (6, 0.8)}
projecting square cap ~
then A will be : (where ~ → complement)
3. Given below are certain output (A) {(4, 0.7), (2, 1), (1, 0.8)}
primitives and their associated (B) {(4, 0.3), (5, 0), (6, 0.2) }
attributes. Match each primitive with (C) {(1, 1), (2, 1), (3, 0.3), (4, 1),
its corresponding attributes : (6, 0.2), (7, 1)}
List – I List – II (D) {(3, 0.3), (6.0.2)}
a. Line i. Type, Size, Color 8. Consider a fuzzy set old as defined
b. Fill Area ii. Color, Size, Font below
c. Text iii. Style, Color, Pattern Old = {(20, 0.1), (30, 0.2), (40, 0.4),
d. Marker iv. Type, Width, Color (50, 0.6), (60, 0.8), (70, 1), (80, 1)}
Codes : Then the alpha-cut for alpha = 0.4 for
the set old will be
a b c d
(A) {(40, 0.4)}
(A) i ii iii iv (B) {50, 60, 70, 80}
(B) ii i iii iv (C) {(20, 0.1), (30, 0.2)}
(C) iv iii ii i (D) {(20, 0), (30, 0), (40, 1),
(D) iii i iv ii (50, 1), (60, 1), (70, 1), (80, 1)}
Paper-III 2 J-87-14

www.examrace.com
9. Perceptron learning, Delta learning 13. Match the following with respect to
and LMS learning are learning I/O classes in object oriented
methods which falls under the programming :
category of List – I List – II
(A) Error correction learning – a. fopen() i. returns end of file
learning with a teacher
(B) Reinforcement learning – b. fclose() ii. return for any
learning with a critic problem report
(C) Hebbian learning c. ferror() iii. returns 0
(D) Competitive learning – learning d. feof() iv. returns a file pointer
without a teacher Codes :
a b c d
10. Code blocks allow many algorithms (A) iv i ii iii
to be implemented with the following (B) iii i iv ii
parameters : (C) ii iii iv i
(A) clarity, elegance, performance
(D) iv iii i ii
(B) clarity, elegance, efficiency
(C) elegance, performance, execution 14. Which one of the following describes
(D) execution, clarity, performance the syntax of prolog program ?
11. Match the following with respect to I. Rules and facts are terminated
the jump statements : by full stop (.)
List – I List – II II. Rules and facts are terminated
a. return i. The conditional test by semicolon (;)
and increment III. Variables names must start
portions with upper case alphabets.
b. goto ii. A value associated
IV. Variables names must start
with it
c. break iii. Requires a label for with lower case alphabets.
operation Codes :
d. continue iv. An exit from only (A) I, II (B) III, IV
the innermost loop (C) I, III (D) II, IV
Codes :
a b c d 15. Let L be any language. Define even
(A) ii iii iv i (W) as the strings obtained by
(B) iii iv i ii extracting from W the letters in the
(C) iv iii ii i even-numbered positions and
(D) iv iii i ii even(L) = {even (W) | W ∈ L}. We
12. The control string in C++ consists of define another language Chop (L) by
three important classifications of removing the two leftmost symbols
characters of every string in L given by
(A) Escape sequence characters, Chop(L) = {W | ν W ∈ L, with | ν | = 2}.
Format specifiers and White- If L is regular language then
space characters (A) even(L) is regular and Chop(L)
(B) Special characters, White-space is not regular.
characters and Non-white space
(B) Both even(L) and Chop(L) are
characters
(C) Format specifiers, White-space regular.
characters and Non-white space (C) even(L) is not regular and
characters Chop(L) is regular.
(D) Special characters, White-space (D) Both even(L) and Chop(L) are
characters and Format specifiers not regular.
J-87-14 3 Paper-III

www.examrace.com
16. Software testing is 19. Match the following :
(A) the process of establishing that List – I List – II
errors are not present. a. Correctness i. The extent to
which a software
(B) the process of establishing tolerates the
confidence that a program does unexpected
what it is supposed to do. problems
b. Accuracy ii. The extent to
(C) the process of executing a
which a software
program to show that it is meets its
working as per specifications. specifications
(D) the process of executing a c. Robustness iii. The extent to
which a software
program with the intent of
has specified
finding errors. functions
d. Completeness iv. Meeting
specifications
17. Assume that a program will
with precision
experience 200 failures in infinite Codes :
time. It has now experienced 100 a b c d
failures. The initial failure intensity (A) ii iv i iii
was 20 failures/CPU hr. Then the (B) i ii iii iv
(C) ii i iv iii
current failure intensity will be
(D) iv ii i iii
(A) 5 failures/CPU hr
(B) 10 failures/CPU hr. 20. Which one of the following is not a
definition of error ?
(C) 20 failures/CPU hr. (A) It refers to the discrepancy
(D) 40 failures/CPU hr. between a computed, observed
or measured value and the true,
18. Consider a project with the following specified or theoretically
correct value.
functional units :
(B) It refers to the actual output of
Number of user inputs = 50 a software and the correct
Number of user outputs = 40 output.
(C) It refers to a condition that
Number of user enquiries = 35 causes a system to fail.
Number of user files = 06 (D) It refers to human action that
Number of external interfaces = 04 results in software containing a
defect or fault.
Assuming all complexity adjustment
factors and weighing factors as 21. Which one of the following is not a
average, the function points for the key process area in CMM level 5 ?
project will be (A) Defect prevention
(B) Process change management
(A) 135 (B) 722 (C) Software product engineering
(C) 675 (D) 672 (D) Technology change management

Paper-III 4 J-87-14

www.examrace.com
22. Consider the following relational 25. Consider the schema
schemas for a library database : R = {S, T, U, V}
Book (Title, Author, Catalog_no, and the dependencies
Publisher, Year, Price) S → T, T → U, U → V and V → S
Collection(Title, Author, Catalog_no)
with the following functional If R = (R1 and R2) be a
dependencies : decomposition such that R1 ∩ R2 = φ
I. Title, Author → Catalog_no then the decomposition is
II. Catalog_no → Title, Author, (A) not in 2NF
Publisher, Year
III. Publisher, Title, Year → Price (B) in 2NF but not in 3NF
Assume (Author, Title) is the key for (C) in 3NF but not in 2NF
both schemas. Which one of the (D) in both 2NF and 3NF
following is true ?
(A) Both Book and Collection are 26. Which one of the following is not a
in BCNF. Client-Server application ?
(B) Both Book and Collection are (A) Internet chat (B) Web browser
in 3NF.
(C) Book is in 2NF and Collection (C) E-mail (D) Ping
in 3NF.
(D) Both Book and Collection are 27. Which of the following concurrency
in 2NF. protocol ensures both conflict
serializability and freedom from
23. Specialization Lattice stands for
deadlock :
(A) An entity type can participate
as a subclass in only one I. 2-phase locking
specialization. II. Time phase ordering
(B) An entity type can participate (A) Both I & II
as a subclass in more than one (B) II only
specialization. (C) I only
(C) An entity type that can (D) Neither I nor II
participate in one specialization.
(D) An entity type that can
participate in one generalization. 28. Match the following :
List – I List – II
24. Match the following : a. Expert i. Pragmatics
List – I List – II systems
a. Timeout ordering i. Wait for graph
protocol b. Planning ii. Resolution
b. Deadlock ii. Roll back c. Prolog iii. Means-end
prevention analysis
c. Deadlock iii. Wait-die scheme d. Natural iv. Explanation
detection language facility
d. Deadlock iv. Thomas Write processing
recovery Rule Codes :
Codes : a b c d
a b c d
(A) iii iv i ii
(A) iv iii i ii
(B) iii ii iv i (B) iii iv ii i
(C) ii i iv iii (C) i ii iii iv
(D) iii i iv iii (D) iv iii ii i
J-87-14 5 Paper-III

www.examrace.com
29. STRIPS addresses the problem of 34. Consider a uniprocessor system
efficiently representing and where new processes arrive at an
implementation of a planner. It is not average of five processes per minute
related to which one of the following ? and each process needs an average of
(A) SHAKEY 6 seconds of service time. What will
(B) SRI be the CPU utilization ?
(C) NLP
(A) 80 % (B) 50 %
(D) None of these
(C) 60 % (D) 30 %
30. Slots and facets are used in
(A) Semantic Networks 35. Consider a program that consists of 8
(B) Frames pages (from 0 to 7) and we have 4
(C) Rules page frames in the physical memory
(D) All of these for the pages. The page reference
string is :
31. Consider f(N) = g(N) + h(N)
12325634637315363424
Where function g is a measure of the
cost of getting from the start node to 3451
the current node N and h is an The number of page faults in LRU
estimate of additional cost of getting and optimal page replacement
from the current node N to the goal algorithms are respectively (without
node. Then f(N) = h(N) is used in including initial page faults to fill
which one of the following available page frames with pages) :
algorithms ?
(A) 9 and 6 (B) 10 and 7
(A) A* algorithm
(B) AO* algorithm (C) 9 and 7 (D) 10 and 6
(C) Greedy best first search
algorithm 36. Which of the following statements is
(D) Iterative A* algorithm not true about disk-arm scheduling
algorithms ?
32. ________predicate calculus allows
quantified variables to refer to (A) SSTF (shortest seek time first)
objects in the domain of discourse algorithm increases performance
and not to predicates or functions. of FCFS.
(A) Zero-order (B) First-order (B) The number of requests for
(C) Second-order (D) High-order disk service are not influenced
by file allocation method.
33. ________ is used in game trees to (C) Caching the directories and
reduce the number of branches of the
index blocks in main memory
search tree to be traversed without
affecting the solution. can also help in reducing disk
(A) Best first search arm movements.
(B) Goal stack planning (D) SCAN and C-SCAN
(C) Alpha-beta pruning procedure algorithms are less likely to
(D) Min-max search have a starvation problem.
Paper-III 6 J-87-14

www.examrace.com
37. _________ maintains the list of free 42. The output of a sequential circuit
disk blocks in the Unix file system. depends on
(A) I-node (A) present input only
(B) Boot block (B) past input only
(C) Super block (C) both present and past input
(D) File allocation table
(D) past output only
38. A part of Windows 2000 operating
system that is not portable is 43. A byte addressable computer has a
(A) Device Management memory capacity of 2m Kbytes and
(B) Virtual Memory Management can perform 2n operations. An
(C) Processor Management instruction involving 3 operands and
(D) User Interface one operator needs a maximum of
(A) 3m bits
39. Match the following with reference
to Unix shell scripts : (B) m + n bits
List – I List – II (C) 3m + n bits
a. $? i. File name of the (D) 3m + n + 30 bits
current script
b. $# ii. List of arguments 44. Which of the following flip-flops is
c. $0 iii. The number of free from race condition ?
arguments (A) T flip-flop
d. $* iv. Exit status of last (B) SR flip-flop
command
(C) Master-slave JK flip-flop
Codes :
a b c d (D) None of the above
(A) iii ii i iv
(B) ii iii i iv 45. One of the main features that
(C) iv iii i ii distinguish microprocessor from
(D) i iii i iv micro-computers is
(A) words are usually larger in
40. The advantage of _______ is that it microprocessors.
can reference memory without (B) words are shorter in
paying the price of having a full microprocessors.
memory address in the instruction. (C) microprocessor does not
(A) Direct addressing contain I/O devices.
(B) Indexed addressing
(D) None of the above.
(C) Register addressing
(D) Register Indirect addressing
46. The output generated by the LINUX
41. The reverse polish notation command :
equivalent to the infix expression $ seq 1 2 10
((A + B) * C + D)/(E + F + G) will be
(A) A B + C * D + EF + G + / (A) 1 2 10
(B) A B + C D * + E F + G + / (B) 1 2 3 4 5 6 7 8 9 10
(C) A B + C * D + E F G + +/ (C) 1 3 5 7 9
(D) A B + C * D + E + F G + / (D) 1 5 10
J-87-14 7 Paper-III

www.examrace.com
47. All the classes necessary for 51. The pure object oriented
windows programming are available programming language with
in the module : extensive metadata available and
(A) win.txt (B) win.main modifiable at run time is
(C) win.std (D) MFC
(A) Small talk (B) C++
(C) Java (D) Eiffel
48. Windows 32 API supports
(A) 16-bit Windows
(B) 32-bit Windows 52. Match the following interfaces of
(C) 64-bit Windows Java. Servlet package :

(D) All of the above List – I List – II

a. Servlet Config i. Enables
49. Superficially the term “object- Servlets to
oriented”, means that, we organize log events
software as a b. Servlet Context ii. Read data
(A) collection of continuous objects from a client
that incorporates both data
c. Servlet Request iii. Write data to
structure and behaviour.
a client
(B) collection of discrete objects
that incorporates both discrete d. Servlet iv. To get
structure and behaviour. Response initialization
parameters
(C) collection of discrete objects
that incorporates both data Codes :
structure and behaviour. a b c d
(D) collection of objects that
(A) iii iv ii i
incorporates both discrete data
structure and behaviour. (B) iii ii iv i
(C) ii iii iv i
50. The “part-whole”, or “a-part-of”, (D) iv i ii iii
relationship in which objects
representing the components of
something associated with an object 53. The syntax of capturing events
representing the entire assembly is method for document object is
called as
(A) CaptureEvents()
(A) Association
(B) CaptureEvents(Orgs eventType)
(B) Aggregation
(C) CaptureEvents(eventType)
(C) Encapsulation
(D) Generalisation (D) CaptureEvents(eventVal)
Paper-III 8 J-87-14

www.examrace.com
54. Linking to another place in the same 58. Which of the following special cases
or another webpage require two A does not require reformulation of the
(Anchor) tags, the first with the problem in order to obtain a solution ?
________ attribute and the second (A) Alternate optimality
with the _________ attribute. (B) Infeasibility
(A) NAME & LINK (C) Unboundedness
(B) LINK & HREF (D) All of the above
(C) HREF & NAME
(D) TARGET & VALUE 59. The given maximization assignment
problem can be converted into a
minimization problem by
55. Given an image of size 1024 × 1024
pixels in which intensity of each (A) subtracting each entry in a
pixel is an 8-bit quality. It requires column from the maximum
_______ of storage space if the value in that column.
image is not compressed. (B) subtracting each entry in the
(A) one Terabyte table from the maximum value
(B) one Megabyte in that table.
(C) 8 Megabytes (C) adding each entry in a column
from the maximum value in
(D) 8 Terabytes
that column.
(D) adding maximum value of the
56. Match the following cryptographic table to each entry in the table.
algorithms with their design issues :
List – I List – II 60. The initial basic feasible solution of
a. DES i. Message Digest the following transportion problem :
b. AES ii. Public Key Destination
c. RSA iii. 56-bit key D1 D2 D3 Supply
d. SHA-1 iv. 128-bit key
O1 2 7 4 5
Codes :
a b c d Origins O2 3 3 1 8
(A) ii i iv iii O3 5 4 7 7
(B) iii i iv ii O4 1 6 2 14
(C) iii iv ii i
(D) iv i ii iii Demand 7 9 18
is given as
57. Consider a code with five valid code 5
words of length ten : 8
0000000000, 0000011111, 7
1111100000, 1110000011, 2 2 10
1111111111
then the minimum cost is
Hamming distance of the code is
(A) 76 (B) 78
(A) 5 (B) 10
(C) 8 (D) 9 (C) 80 (D) 82

J-87-14 9 Paper-III

www.examrace.com
61. Given the following equalities : 65. Given the following statements :
E1 : nK+∈ + nK lg n = θ(nK+∈) for all S1 : The subgraph-isomorphism
fixed K and ∈, K > 0 and ∈ > 0. problem takes two graphs G1
E2 : n32n + 6n23n = O(n32n) and G2 and asks whether G1 is
Which of the following is true ? a subgraph of G2.
(A) E1 is correct and E2 is correct. S2 : The set-partition problem takes
(B) E1 is correct and E2 is not as input a set S of numbers and
correct. asks whether the numbers can
(C) E1 is not correct and E2 is be partitioned into two sets A
–
correct. and A = S – A such that
(D) E1 is not correct and E2 is not x x
correct. = –
x∈A x∈A
Which of the following is true ?
62. Consider the fractional knapsack
instance n = 4, (p1, p2, p3, p4) = (10, (A) S1 is NP problem and S2 is P
10, 12, 18), (w1, w2, w3, w4) = (2, 4, problem.
6, 9) and M = 15. The maximum (B) S1 is NP problem and S2 is NP
profit is given by problem.
(Assume p and w denotes profit and
(C) S1 is P problem and S2 is P
weight of objects respectively)
(A) 40 (B) 38 problem.
(C) 32 (D) 30 (D) S1 is P problem and S2 is NP
problem.
63. The solution of the recurrence
n
relation of T(n) = 3T floor 4 + n is 66. Suppose that the splits at every level
of quicksort are in the proportion
(A) O(n2) (B) O(nlg n) (1 – α) to α, where 0 < α < ½ is a
(C) O(n) (D) O(l g n) constant. The minimum depth of a
leaf in the recursion tree is
64. If h is chosen from a universal approximately given by
collection of hash functions and is lgn
used to hash n keys into a table of (A) –
lg(1 – α)
size m, where n < m, the expected
number of collisions involving a
(B) – lg (1 – α)
particular key K is lgn
(A) less than 1
(C) – lgn
(B) less than lg n lgα
(C) greater than 1
lgα
(D) greater than lg n (D) –
lgn
Paper-III 10 J-87-14

www.examrace.com
67. Ten signals, each requiring 3000 Hz, 73. Given the following two grammars :
are multiplexed on to a single G1 : S → AB | aaB
channel using FDM. How much
minimum bandwidth is required for A → a | Aa
the multiplexed channel ? Assume B→b
that the guard bands are 300 Hz G2 : S → a S b S | b S a S | λ
wide. Which statement is correct ?
(A) 30,000 (A) G1 is unambiguous and G2 is
(B) 32,700
unambiguous.
(C) 33,000
(D) None of the above (B) G1 is unambiguous and G2 is
ambiguous.
68. A terminal multiplexer has six 1200 (C) G1 is ambiguous and G2 is
bps terminals and ‘n’ 300 bps
terminals connected to it. If the unambiguous.
outgoing line is 9600 bps, what is the (D) G1 is ambiguous and G2 is
value of n ? ambiguous.
(A) 4 (B) 8
(C) 16 (D) 28 74. Match the following :
69. Which of the following is used in the List – I List – II
options field of IPv4 ? a. Chomsky i. S → b S S | a S | c
(A) Strict source routing Normal form
(B) Loose source routing b. Greibach ii. S → a S b | ab
(C) time stamp Normal form
(D) All of the above c. S-grammar iii. S → AS | a
A → SA | b
70. Which layers of the OSI reference
d. LL grammar iv. S → a B S B
model are host-to-host layers ?
(A) Transport, Session, Presentation, B→b
Application Codes :
a b c d
(B) Network, Transport, Session, (A) iv iii i ii
Presentation (B) iv iii ii i
(C) Data-link, Network, Transport, (C) iii iv i ii
Session (D) iii iv ii i
(D) Physical, Data-link, Network,
Transport 75. Given the following two languages :
71. A network on the Internet has a L1 = {anbn | n > 1} ∪ {a}
subnet mask of 255.255.240.0. What L2 = {w C wR | w ∈ {a, b}*}
is the maximum number of hosts it Which statement is correct ?
can handle ? (A) Both L1 and L2 are not
(A) 1024 (B) 2048
(C) 4096 (D) 8192 deterministic.
(B) L1 is not deterministic and L2 is
72. Four bits are used for packed
deterministic.
sequence numbering in a sliding
window protocol used in a computer (C) L1 is deterministic and L2 is not
network. What is the maximum deterministic.
window size ? (D) Both L1 and L2 are
(A) 4 (B) 8 deterministic.
(C) 15 (D) 16
J-87-14 11 Paper-III

www.examrace.com
 Space For Rough Work

Paper-III 12 J-87-14

www.examrace.com