Test Paper : III

Test Booklet Serial No. : _______________________

Test Subject : COMPUTER SCIENCE
OMR Sheet No. : _________________________________
AND APPLICATIONS
Roll No.
Test Subject Code : K-2415 (Figures as per admission card)
Name & Signature of Invigilator/s
Signature : _________________________________
Name : _________________________________
Paper : III
Subject : COMPUTER SCIENCE AND APPLICATIONS
Time : 2 Hours 30 Minutes Maximum Marks : 150
Number of Pages in this Booklet : 16 Number of Questions in this Booklet : 75
A»Ü¦ìWÜÚWæ ÓÜãaÜ®æWÜÙÜá Instructions for the Candidates
1. D ±Üâo¨Ü ÊæáàÆᤩ¿áÈÉ J¨ÜXst Óܧ٨ Ü È
Ü É ¯ÊÜá¾ ÃæãàÇ ®ÜíŸÃÜ®áÜ ° ŸÃæÀáÄ. 1. Write your roll number in the space provided on the top of this page.
2. D ±Ü£ÅPæ¿áá ŸÖÜá BÁáR Ë«Ü¨Ü G±Ü³ñæô¨Üá ±ÜÅÍæ°WÜÙÜ®Üá° JÙÜWæãíw¨æ. 2. This paper consists of seventy five multiple-choice type of questions.
3. ±ÜÄàPæÒ¿á ±ÝÅÃíÜ »Ü¨ÈÜ É , ±ÜÅÍ° æ ±ÜâÔ¤P¿
æ á®Üá° ¯ÊÜáWæ ¯àvÜÇÝWÜáÊÜâ¨Üá. Êæã¨ÜÆ 5 ¯ËáÐÜWÙÜ È
Ü É 3. At the commencement of examination, the question booklet will
be given to you. In the first 5 minutes, you are requested to
¯àÊÜâ ±ÜâÔ¤P¿
æ á®Üá° ñæÿ
æ áÆá ÊÜáñÜᤠPæÙXÜ ®Üíñæ PÜvÝx¿áÊÝX ±ÜÄàQÒÓÆ Ü á PæãàÃÜÇÝX¨æ.
open the booklet and compulsorily examine it as below :
(i) ±ÜÅÍ°æ ±ÜâÔ¤PW
æ æ ±ÜÅÊàæ ÍÝÊÜPÝÍÜ ±Üv¿
æ áÆá, D Öæã©Pæ ±Üâo¨Ü Aíb®Ü ÊæáàÈÃÜáÊÜ (i) To have access to the Question Booklet, tear off the paper
±æà±Üà ÔàÆ®Üá° ÖÜÄÀáÄ. ÔrPÜRà ÔàÇ CÆÉ¨Ü A¥ÜÊÝ ñæÃæ¨Ü ±ÜâÔ¤Pæ¿á®Üá° seal on the edge of the cover page. Do not accept a
ÔÌàPÜÄÓܸàæ w. booklet without sticker seal or open booklet.
(ii) ±ÜâÔ¤Pæ¿áÈÉ®Ü ±ÜÅÍæ°WÜÙÜ ÓÜíTæ ÊÜáñÜᤠ±ÜâoWÜÙÜ ÓÜíTæ¿á®Üá° ÊÜááS±Üâo¨Ü ÊæáàÇæ (ii) Tally the number of pages and number of questions
ÊÜáá©Åst ÊÜÞ×£Áãí©Wæ ñÝÙæ ®æãàwÄ. ±ÜâoWÜÙáÜ /±ÜÅÍW°æ ÙÜ áÜ PÝOæ¿Þ¨Ü, in the booklet with the information printed on the
A¥ÜÊÝ ©Ì±ÜÅ£ A¥ÜÊÝ A®ÜáPÜÅÊÜáÊÝXÆÉ¨Ü A¥ÜÊÝ CñÜÃÜ ¿ÞÊÜâ¨æà ÊÜÂñÝÂÓÜ¨Ü cover page. Faulty booklets due to pages/questions
missing or duplicate or not in serial order or any
¨æãàÐܱäÜ ÄñÜ ±ÜâÔ¤P¿ æ á®Üá° PÜãvÜÇæ 5 ¯ËáÐÜ¨Ü AÊܗ JÙÜW,æ ÓÜíËàPÜÒPÄÜ í¨Ü ÓÜÄ other discrepancy should be got replaced immediately
CÃÜáÊÜ ±ÜâÔ¤PæWæ Ÿ¨ÜÇÝÀáÔPæãÙÜÛ¸æàPÜá. B ŸÚPÜ ±ÜÅÍæ° ±Ü£ÅPæ¿á®Üá° by a correct booklet from the invigilator within the
Ÿ¨ÜÇÝÀáÓÜÇÝWÜáÊÜâ©ÆÉ , ¿ÞÊÜâ¨æà ÖæaáÜ c ÓÜÊáÜ ¿áÊÜ®ã Ü ° PæãvÜÇÝWÜáÊÜâ©ÆÉ . period of 5 minutes. Afterwards, neither the Question
4. ±ÜÅ£Áãí¨Üá ±ÜÅÍW °æ ã
Ü (A), (B), (C) ÊÜáñÜᤠ(D) Gí¨Üá WÜáÃÜá£Ô¨Ü ®ÝÆáR ±Ü¿Þì¿á Booklet will be replaced nor any extra time will be given.
4. Each item has four alternative responses marked (A), (B), (C)
EñܤÃÜWÜÚÊæ. ¯àÊÜâ ±ÜÅÍæ°¿á G¨ÜáÃÜá ÓÜÄ¿Þ¨Ü EñܤÃÜ¨Ü ÊæáàÇæ, PæÙÜWæ PÝ~Ô¨Üíñæ
and (D). You have to darken the oval as indicated below on the
AívÝPÜꣿá®Üá° PܱݳXÓܸàæ PÜá. correct response against each item.
E¨ÝÖÜÃO Ü æ: A B C D
Example : A B C D
(C) ÓÜÄ¿Þ¨Ü EñܤÃÜÊÝX¨ÝªWÜ.
where (C) is the correct response.
5. ±ÜÅÍW
°æ ÚÜ Wæ EñܤÃWÜ ÙÜ ®Ü áÜ ° , ±Ü£ÅPæ III ±ÜâÔ¤PÁ
æ ãÙÜWæ PæãqrÃáÜ ÊÜ OMR EñܤÃÜ ÖÝÙæ¿áÈÉ
5. Your responses to the question of Paper III are to be indicated
ÊÜÞñÜÅÊàæÜ ÓÜãbÓÜñPÜ RÜ ¨áÜ ª. OMR EñܤÃÜ ÖÝÙæ¿áÈÉ®Ü AívÝPÜê£ ÖæãÃÜñáÜ ±ÜwÔ ¸æàÃæ in the OMR Sheet kept inside the Booklet. If you mark at any
¿ÞÊÜâ¨æà Óܧ٨ Ü ÈÜ É WÜáÃÜá£Ô¨ÜÃ,æ A¨ÜÃÜ ÊÜåèÆÂÊÜÞ±Ü®Ü ÊÜÞvÜÇÝWÜáÊÜâ©ÆÉ. place other than in the ovals in OMR Answer Sheet, it will not be
6. OMR EñܤÃÜ ÖÝÙæ¿áÈÉ Pæãor ÓÜãaÜ®æWÜÙÜ®Üá° hÝWÜÃÜãPÜñæÀáí¨Ü K©Ä. evaluated.
7. GÇÝÉ PÜÃÜvÜá PæÆÓÜÊÜ®Üá° ±ÜâÔ¤Pæ¿á Pæã®æ¿áÈÉ ÊÜÞvÜñÜPÜR¨Ü᪠. 6. Read the instructions given in OMR carefully.
7. Rough Work is to be done in the end of this booklet.
8. ¯ÊÜá¾ WÜáÃÜáñÜ®Üá° Ÿ×ÃÜíWܱÜwÓܟÖÜá¨Ý¨Ü ¯ÊÜá¾ ÖæÓÜÃÜá A¥ÜÊÝ ¿ÞÊÜâ¨æà
8. If you write your name or put any mark on any part of the OMR
bÖæ°¿á®Üá° , ÓÜíWÜñÜÊÝ¨Ü ÓܧÙÜ ÖæãÃÜñÜá ±ÜwÔ, OMR EñܤÃÜ ÖÝÙæ¿á ¿ÞÊÜâ¨æà Answer Sheet, except for the space allotted for the relevant
»ÝWܨÈÜ É ŸÃæ¨ÃÜ ,æ ¯àÊÜâ A®ÜÖìÜ ñæWæ ¸Ý«ÜÂÃÝXÃÜᣤàÄ. entries, which may disclose your identity, you will render yourself
9. ±ÜÄàPæÒ¿áá ÊÜááX¨Ü®ÜíñÜÃÜ, PÜvÝx¿áÊÝX OMR EñܤÃÜ ÖÝÙæ¿á®Üá° ÓÜíËàPÜÒPÜÄWæ liable to disqualification.
¯àÊÜâ ×í£ÃÜáXÓܸàæ PÜá ÊÜáñÜᤠ±ÜÄàPÝÒ PæãsÜw¿á ÖæãÃÜWæ OMR ®Üá° ¯Êæã¾í©Wæ 9. You have to return the test OMR Answer Sheet to the invigilators
at the end of the examination compulsorily and must NOT
Pæãívæã¿áÂPÜãvܨÜá.
carry it with you outside the Examination Hall.
10. ±ÜÄàPæÒ¿á ®ÜíñÜÃÜ, ±ÜÄàPÝÒ ±ÜÅÍæ° ±Ü£ÅPæ¿á®Üá° ÊÜáñÜᤠ®ÜPÜÆá OMR EñܤÃÜ ÖÝÙæ¿á®Üá° 10. You can take away question booklet and carbon copy of
¯Êæã¾í©Wæ ñæWæ¨ÜáPæãívÜá ÖæãàWܟÖÜá¨Üá. OMR Answer Sheet soon after the examination.
11. ¯àÈ/PܱÜâ³ ¸ÝÇ ±ÝÀáíp ±æ® ÊÜÞñÜÅÊæà E±ÜÁãàXÔÄ. 11. Use only Blue/Black Ball point pen.
12. PÝÂÆáRÇàæ oà A¥ÜÊÝ ÇÝW pæàŸÇ CñÝ©¿á E±ÜÁãàWÜ樆 áÜ ° ¯Ðæà—ÓÜÇÝX¨æ. 12. Use of any calculator or log table etc., is prohibited.
13. ÓÜÄ AÆÉ¨Ü EñܤÃÜWÜÚWæ Má| AíPÜ CÃÜáÊÜâ©ÆÉ . 13. There is no negative marks for incorrect answers.
14. PܮܰvÜ ÊÜáñÜᤠCíXÉàÐ BÊÜ꣤WÜÙÜ ±ÜÅÍæ° ±Ü£ÅPæWÜÙÜÈÉ ¿ÞÊÜâ¨æà Äࣿá ÊÜÂñÝÂÓÜWÜÙÜá 14. In case of any discrepancy found in the Kannada
translation of a question booklet the question in English
PÜívÜáŸí¨ÜÈÉ , CíXÉàÐ BÊÜ꣤WÜÙÜÈÉÃÜáÊÜâ¨æà Aí£ÊÜáÊæí¨Üá ±ÜÄWÜ~ÓܸæàPÜá. version shall be taken as final.
K-2415 1 ±Üâ.£.®æãà./P.T.O.
*2415* Total Number of Pages : 16
COMPUTER SCIENCE AND APPLICATIONS
PAPER – III

Note : This paper contains seventy-five (75) objective type questions. Each question
carries two (2) marks. All questions are compulsory.

1. A computer uses 8 digit mantissa and 4. What degree of resolution can be

2 digit exponent. If a = 0.052 and obtained using an eight bit optical
b = 28E + 11, then b + a – b will encoder ?

(A) Result in an overflow error (A) 1.4 degree

(B) 2.8 degree
(B) Result in an underflow error
(C) 4.2 degree
(C) Be 0
(D) 6.4 degree
(D) Be 5.28E + 11
5. If a clock with time period “T” is used with
2. A multiplexer with a 4 bit data select
n stages shift register, then output of final
input is a stage will be delayed by T
(A) 4 : 1 multiplexer (A) nTsec
(B) 2 : 1 multiplexer (B) (n – 1)T sec

(C) 16 : 1 multiplexer (C) n|T sec

(D) 8 : 1 multiplexer (D) (2n – 1)T sec

3. After Executing the following code the 6. Which one of the following is correct ?

status be (A) All relationships may be converted

to binary relationship
MVI A, 39H
ADI 97 H (B) All relationships may be converted
to 1:1 relationship
DAA
(C) All relationship’s attributes may be
(A) A = 0011 1001, CY = 0
attached to one of the participating
(B) A = 0011 0110, CY = 1 entities
(C) A = 0101 1011, CY = 0 (D) All relationships may be represented

(D) A = 0001 0110, CY = 1 by a table in a database

Paper III 2 K-2415

*2415* Total Number of Pages : 16

7. Which one of the following is not 10. Which one of the following privileges may
correct ?
not be granted using SQL ?
(A) A restriction selects one or more rows
of a relation (A) GRANT SELECT
(B) A projection selects one or more (B) GRANT DELETE
columns of a relation
(C) A join glues each row of one relation (C) REVOKE SELECT
with all the rows of the other (D) REVOKE VIEW
(D) A difference gives all the rows in the
first relation that are not in the 11. Let the maximum number of pixels
second
in a line be M. The number of
8. Which one of the following data definition subdivision at most necessary using
command is not an SQL command ?
the mid-point subdivision method of
(A) CREATE TABLE
clipping is
(B) DROP TABLE
(C) MODIFY TABLE (A) N = log M
2
(D) DROP DOMAIN
(B) N = 2M

9. Consider the query. ‘Find the names of (C) N = 2 M

all players from India who have made a
century In cricket’. The query involves a (D) None of the above
selection, a join and a projection. The
relation Player and Batting have both 12. Oblique projection with an angle of
been fragmented into six fragments and
45 degree to the horizontal plane is
have been replace twice. Which of the
operations require the most data called as
communication ?
(A) Cabinet projection
(A) Selection
(B) Isometric projection
(B) Projection
(C) Join (C) Cavalier projection

(D) Each is about same (D) None of the above

K-2415 3 Paper III

*2415* Total Number of Pages : 16

13. The clarity of displayed image 17. Which of the following operators cannot
depends on be overloaded ?

(A) Resolution (A) =

(B) Floating point precision of the (B) : :

system (C) →
(C) Associated software (D) = =
(D) All the above
18. Choose the correct statement.
14. The best hidden surface removal (A) A destructor is not inherited
method(s) used for complex scenes with
(B) A constructor cannot be called
more than a few thousand surfaces is /
explicitly
are
(C) A constructor is not inherited
(A) Depth sorting method
(B) Scan line algorithm (D) All the above

(C) Depth buffer algorithm 19. A terminal string W ε L(G) is ambiguous

(D) None of the above if there exists minimum ____________
derivation tree.
15. The entire graph of the function
f(x) = x2 + kx – x + 9 is strictly above the (A) –1
x-axis if and only if (B) 0
(A) –3 < k < 5 (C) 1
(B) –3 < k < 2 (D) 2
(C) –3 < k < 7
20. C++ encourages structuring software as
(D) –5 < k < 7
a collection of components that are
16. Which of the following are procedural (A) Highly cohesive and loosely
languages ? coupled
(A) Pascal (B) Not highly cohesive but loosely
(B) C coupled
(C) C++ (C) Highly cohesive and tightly coupled
(D) Both (A) and (B) (D) Not highly cohesive but tightly
coupled

Paper III 4 K-2415

*2415* Total Number of Pages : 16

21. You have 8 work stations that are 25. Which of the following is an IP link state
connected to a switch, each is connected protocol ?
to an 10 Mbps port. What will be the
(A) RIP
individual bandwidth available to each ?
(B) IGRP
(A) 80
(C) EIGRP
(B) 10
(D) OSPF
(C) 16
(D) 5 26. What is the time complexity of the
following recursive function ?
22. What does RARP do ?
int DoSomething ( int n )
(A) Get IP from MAC addresses
{
(B) Get MAC address from IP addresses
if ( n<=2)
(C) Get IP from IPX addresses
return 1;
(D) It resolves an network address to
else
DLCI
return (DoSomething ( floor (sqrt(n))) + n);

23. What port is the port number of TFTP ? }

2
(A) 23 (A) O (n )

(B) 25 (B) O (nlog2 n)

(C) 69 (C) O (log2n)
(D) 161 (D) O (nlog2n)

24. In order to have 5 subnets and 17 hosts 27. Given an empty stack, after performing
on each subnet how many bits subnetting push (1), push (2), Pop, push (3), push
will you do on the class B address (4), Pop, Pop, push (5), Pop, what is the
162.13.0.0/16 ? value of the top of the stack ?
(A) 255.255.128.0 (A) 4
(B) 255.255.224.0
(B) 3
(C) 255.255.240.0
(C) 2
(D) 255.255.248.0
(D) 1
K-2415 5 Paper III
*2415* Total Number of Pages : 16

28. Consider a linked list implementation of 32. The _______ operator dynamically
a queue with two pointers: front and rear. allocates memory for an object of a
The time needed to insert element in a
specified type and returns a ______ to
queue of length n is
that type.
(A) O (1)
(A) new, pointer
(B) O( log n)
2
(B) mem, mem
(C) O(n)
(D) O(n log2 n) (C) volatile, data

(D) pointer, mem

29. The worst case time required to search a
given element in sorted linked list of
33. When deriving a class from a base class
length n is
with public inheritance, public members
(A) O(1)
of the base class become ___________
(B) O( log 2 n)
members of the derived class, and
(C) O( n )
protected members of the base class
(D) O(n log2 n)
become ___________ members of the

30. The recurrence relation T(n)=mT(n/2) + an2 derived class.

is satisfied by (A) public, protected
m
(A) T(n) =O(n ) (B) protected, public
(B) T(n) =O(log m)
(C) private, private
(C) T(n) =O(n log m)
(D) protected, private
(D) T(n) =O(nm)

34. Overridable functions are declared using

31. An object’s non static member functions
have access to a “self pointer” to the keyword
object called the __________ Pointer. (A) void
(A) Private (B) virtual
(B) This
(C) public
(C) Double
(D) typeid
(D) Actual

Paper III 6 K-2415

*2415* Total Number of Pages : 16

35. An overloaded unary operator defined as 38. Which of the following Construct in
a member function requires how many
formal model in software
values to be passed as function
engineering execute each statement
arguments ?
in succession ?
(A) 0
(A) Selection Construct
(B) 1

(C) 2 (B) Sequence Construct

(D) A unary operator cannot be (C) Iteration Construct

overloaded
(D) Statement Construct

36. Which one of the following is not desired

39. The most important feature of spiral
in a good Software Requirement
model is
Specification (SRS) document ?

(A) Functional Requirements (A) Requirement analysis

(B) Non-functional Requirements (B) Risk management

(C) Goals of Implementation (C) Quality management

(D) Algorithms for Software
(D) Configuration management
Implementations

40. The cost of software engineering

37. Software genetic development process
includes approximately _________
contains three genetic phrases namely
of development costs and ________
(A) Definition, Development,
Maintenance of testing costs.

(B) Coding, Design, Software (A) 50%, 50%

engineering
(B) 40%, 60%
(C) Design, Coding, Development
(C) 80%, 20%
(D) Development, Definition, Testing
(D) 60%, 40%

K-2415 7 Paper III

*2415* Total Number of Pages : 16

41. At a particular time, the value of a 44. Consider a system having ‘m’ resources

counting semaphore is 10. It will become of the same type. These resources are

7 after shared by 3 processes A, B, C which

have peak time demands of 3, 4, 6
(A) 3 V operations
respectively. The minimum value of ‘m’
(B) 3 P operations
that ensures that deadlock will never
(C) 5 V operations and 2 P operations occur is

(D) None of the above (A) 11

(B) 12
42. Fence register is used for
(C) 13
(A) CPU protection
(D) 14
(B) Memory protection
45. The most efficient data set
(C) File protection
organization is
(D) All of these
(A) A sequential file

43. In a paged memory, the page hit ratio is (B) An ISAM file

0.35. The time required to access a page (C) Variable depending upon the usage
in secondary memory is equal to 100 ns. of the data set

The time required to access a page in (D) A portioned data set

primary memory is 10 ns. The average
46. Which is not a property of representation
time required to access a page is
of knowledge ?
(A) 3.0 ns
(A) Representational Verification
(B) 68.0 ns
(B) Representational Adequacy
(C) 68.5 ns (C) Inferential Adequacy
(D) 78.5 ns (D) Inferential Efficiency

Paper III 8 K-2415

*2415* Total Number of Pages : 16

47. Hill-Climbing algorithm terminates when, 50. Which part of an expert system applies

the facts of a particular case to the domain

(A) Stopping criterion met
specific knowledge-base ?
(B) Global Min/Max is achieved
(A) User interface
(C) Neighbor has higher value
(B) Knowledge-acquisition subsystem

(D) Local Min/Max is achieved (C) Inference engine

(D) Explanation subsystem

48. Following are the elements, which

constitutes to the frame structure ? 51. Any polynomial with positive integer

coefficients and a nonzero constant term

(A) Facts or Data
is a
(B) Procedures and default values
(A) Step-counting function
(C) Frame names
(B) Positive function

(D) Both (A) and (B) (C) Any function

(D) None of these

49. What is a manager’s primary use

of a MIS ? 52. If there is an NP-complete language L

whose complement is in NP, then the

(A) To facilitate problem solving and
complement of any language in NP is in
decision making
(A) P
(B) To facilitate quality control
(B) NP
(C) To monitor inventory
(C) Both (A) and (B) above

(D) To evaluate productivity (D) None of these

K-2415 9 Paper III

*2415* Total Number of Pages : 16

53. If L ε P, then 57. The topology with highest reliability is

(A) L′ ε P (A) Bus topology

(B) Star topology
(B) L′ ε NP
(C) Ring topology
(C) L′ ε PSpace (D) Mesh topology
(D) None of these
58. Find the minimum bandwidth required for
54. Recursively enumerable language are the path which uses FDM Multiplexing,
not closed under Five devices, each requiring 4000 Hz,
200 Hz guard band for each device
(A) Union
(A) 20.8 KHz
(B) Intersection
(B) 25.1 KHz
(C) A complementation
(C) 28.1 KHz
(D) Concatenation
(D) 30.8 KHz
55. Which of the following instances of the
59. The maximum data rate of a channel
post correspondence problem have a
of 3000 Hz bandwidth and SNR of
viable sequence ?
30 DB is
(A) {(b,bb)(bb,bab) (bab,abb)(abb,babba)}
(A) 15,000 bps
(B) {(ab,abb),(baa, aa)(aba, baa)}
(B) 60,000 bps
(C) {(ab,abb), (ba,aaa(aa,a)}
(C) 30,000 bps
(D) None of these
(D) 3,000 bps

56. Error detection at the data link level is

60. The frequency range at which the land
achieved by
coaxial cables will be used is
(A) Bit stuffing (A) 106 to 108 Hz
(B) Cyclic redundancy codes (B) 1010 to 1011 Hz
(C) Byte stuffing (C) 103 to 104 Hz
(D) Equalization
(D) 1014 to 1015 Hz

Paper III 10 K-2415

*2415* Total Number of Pages : 16

61. In linear programming we need to ensure 64. Identify in which among the following

that both the objective function and the methods does a row or column difference
constraints can be expressed as linear indicate the minimum unit penalty
expressions of
incurred by failing to make an allocation
(A) Constraints
to the least cost cell in that row or
(B) Basic variables
column.
(C) Decision variables
(A) North West corner rule
(D) Objective function
(B) Matrix minima method
62. When a linear programming problem is
represented in the canonical form, the (C) Vogel’s approximation method
minimization of a function is
(D) Modi method
mathematically equivalent to the
_________ function.
65. The technique of Monte Carlo involves
(A) Minimization of the negative
the selection of _________ observations
expression
(B) Maximization of the negative with in the simulation model.

expression (A) Discrete

(C) Maximization of the positive
(B) Sequential
expression
(D) Minimization of the positive (C) Random
expression (D) Indiscrete

63. When the primal problem has a

66. Synapses can be either
degenerate optimal solution the dual
has __________ solutions. (A) Excitatory
(A) Degenerate
(B) Inhibitory
(B) Infeasible
(C) Both (A) and (B)
(C) Unbounded
(D) Multiple optimal (D) None of the above

K-2415 11 Paper III

*2415* Total Number of Pages : 16

67. XOR problem can be solved using 70. A perceptron is

(A) Single layer perceptron

(B) Multi layer perceptron (A) A single layer feed-forward neural

(C) Both (A) and (B) network with preprocessing

(D) None of the above

(B) An auto associative neural network
68. Which of the following is true ?
(C) A double layer auto associative
(i) On average, neural networks have
higher computational rates than neural network
conventional computers.

(ii) Neural networks learn by example. (D) None of the above

(iii) Neural networks mimic the way the

human brain works. 71. Which statement is not true about
(A) All of them are true process 0 in the UNIX operating
(B) (ii) and (iii) are true
system ?
(C) (i) and (ii) are true

(D) None of them are true (A) Process 0 is called init process

69. An auto associative network is (B) Process 0 is not created by fork

(A) a neural network that contains no
system call
loops

(B) a neural network that contains (C) After forking process 1, process 0
feedback
becomes swapper process
(C) a neural network that has only one
loop (D) Process 0 is a special process
(D) a neural network that has multiple created when system boots
loop

Paper III 12 K-2415

*2415* Total Number of Pages : 16

72. Match the following for Windows 73. Which command is used to remove the
Operating System :
read permission of the file ‘note’ from both
List – I List – II
a) Hardware (i) Starting all processes, the group and others ?

abstraction emulation of different (A) chmod go+r note

layer operating systems,
security functions, (B) chmod go+rw note
transform character
(C) chmod go-x note
based applications to
graphical (D) chmod go-r
representation
b) Kernel (ii) Export a virtual memory
74. A command __________ is a word linked
interface, support for
symmetric to a block of text that is substituted by the
multiprocessing,
shell whenever that word is used as a
administration, details
of mapping memory, command.
configuring I/O buses,
setting up DMA (A) group
c) Executive (iii) Thread scheduling,
(B) alias
interrupt and exception
handling, recovery (C) rename
after power failure
d) Win32 (iv) Object manager, (D) proxy
subsystem virtual memory
manager, process 75. Which of the following tools can be
manager, plug
used to keep track of evolving versions
and-play and power
manager of a file ?
Codes :
(A) make
(a) (b) (c) (d)
(A) (i) (iii) (ii) (iv) (B) yacc
(B) (iv) (iii) (ii) (i)
(C) sccs
(C) (ii) (iii) (iv) (i)
(D) dv
(D) (iii) (ii) (i) (iv)

K-2415 13 Paper III

*2415* Total Number of Pages : 16
bñÜᤠŸÃÜÖÜPÝRX ÓܧÙÜ
Space for Rough Work

Paper III 14 K-2415

*2415* Total Number of Pages : 16
bñÜᤠŸÃÜÖÜPÝRX ÓܧÙÜ
Space for Rough Work

K-2415 15 Paper III

*2415* Total Number of Pages : 16
bñÜᤠŸÃÜÖÜPÝRX ÓܧÙÜ
Space for Rough Work

Paper III 16 K-2415

 KSET - 2015
Subject: COMPUTER SCI. & Code: 24
APPLICATION
KEY - Paper - III
Q.No Ans Q.No Ans Q.No Ans
1 A 26 D 51 C
2 C 27 D 52 B
3 B 28 A 53 A
4 A 29 C 54 C
5 B 30 C 55 C
6 D 31 B 56 B
7 C 32 A 57 D
8 C 33 A 58 A
9 C 34 B 59 C
10 C 35 A 60 A
11 A 36 D 61 C
12 C 37 A 62 B
13 D 38 B 63 D
14 C 39 B 64 C
15 D 40 D 65 C
16 D 41 B 66 C
17 B 42 B 67 B
18 D 43 C 68 A
19 D 44 A 69 B
20 A 45 C 70 A
21 B 46 A 71 A
22 B 47 D 72 C
23 C 48 D 73 D
24 B 49 A 74 B
25 D 50 C 75 C