Test Paper : III

Test Booklet Serial No. : _______________________

Test Subject : COMPUTER SCIENCE
AND APPLICATION OMR Sheet No. : _________________________________

Test Subject Code : K-2414 Roll No.

(Figures as per admission card)
Name & Signature of Invigilator/s

Signature: ____________________________________ Signature : ___________________________________

Name : ____________________________________ Name : ___________________________________
Paper : III
Subject : COMPUTER SCIENCE AND APPLICATION
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 Óܧ٨ Ü È
Ü É ¯ÊÜá¾ ÃæãàDž ®ÜíŸÃÜ®áÜ ° ŸÃæÀáÄ. 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
±æà±ÜÅ ÔàÆ®Üá° ÖÜÄÀáÄ. ÔrPRÜ Ã… ÔàDž CÆÉ¨Ü ±ÜÅͱ °æ âÜ Ô¤Pæ ÔÌàPÜÄÓܸàæ w. ñæè
æ Ü seal on the edge of this cover page. Do not accept a booklet
±ÜâÔ¤P¿æ á®Üá° ÔÌàPÜÄÓܸàæ w. without sticker-seal and do not accept an 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.
EñܤÃÜWÜÚÊæ. ¯àÊÜâ ±ÜÅÍæ°¿á G¨ÜáÃÜá ÓÜÄ¿Þ¨Ü EñܤÃÜ¨Ü ÊæáàÇæ, PæÙÜWæ PÝ~Ô¨Üíñæ 4. Each item has four alternative responses marked (A), (B), (C)
AívÝPÜꣿá®Üá° PܱݳXÓܸàæ PÜá. and (D). You have to darken the oval as indicated below on the
E¨ÝÖÜÃO Ü æ: A B C D correct response against each item.
(C) ÓÜÄ¿Þ¨Ü EñܤÃÜÊÝX¨ÝªWÜ. Example : A B C D

5. ±ÜÅÍW
°æ ÚÜ Wæ EñܤÃWÜ ÙÜ ®Ü áÜ ° , ±Ü£ÅPæ III ±ÜâÔ¤PÁ æ ãÙÜWæ PæãqrÃáÜ ÊÜ OMR EñܤÃÜ ÖÝÙæ¿áÈÉ where (C) is the correct response.
ÊÜÞñÜÅÊàæÜ ÓÜãbÓÜñPÜ RÜ ¨áÜ ª. OMR EñܤÃÜ ÖÝÙæ¿áÈÉ®Ü AívÝPÜê£ ÖæãÃÜñáÜ ±ÜwÔ ¸æàÃæ 5. Your responses to the question of Paper III are to be indicated
¿ÞÊÜâ¨æà Óܧ٨ Ü ÈÜ É WÜáÃÜá£Ô¨ÜÃ,æ A¨ÜÃÜ ÊÜåèÆÂÊÜÞ±Ü®Ü ÊÜÞvÜÇÝWÜáÊÜâ©ÆÉ. in the OMR Sheet kept inside the Booklet. If you mark at any
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.
8. ¯ÊÜá¾ WÜáÃÜáñÜ®Üá° Ÿ×ÃÜíWܱÜwÓܟÖÜá¨Ý¨Ü ¯ÊÜá¾ ÖæÓÜÃÜá A¥ÜÊÝ ¿ÞÊÜâ¨æà 7. Rough Work is to be done in the end of this booklet.
bÖæ°¿á®Üá° , ÓÜíWÜñÜÊÝ¨Ü ÓܧÙÜ ÖæãÃÜñÜá ±ÜwÔ, OMR EñܤÃÜ ÖÝÙæ¿á ¿ÞÊÜâ¨æà 8. If you write your name or put any mark on any part of the OMR
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
Pæãívæã¿á PÜãvܨÜá. at the end of the examination compulsorily and must NOT
10. ±ÜÄàPæÒ¿á ®ÜíñÜÃÜ, ±ÜÄàPÝÒ ±ÜÅÍæ° ±Ü£ÅPæ¿á®Üá° ÊÜáñÜᤠ®ÜPÜÆá OMR EñܤÃÜ ÖÝÙæ¿á®Üá° carry it with you outside the Examination Hall.
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ܱÜâ³ ¸ÝDž±ÝÀáí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.

K-2414 1 ±Üâ.£.®æãà./P.T.O.
*K2414* Total Number of Pages : 16
COMPUTER SCIENCE AND APPLICATION
PAPER – III

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

1. The crystal oscillator is operating at 4. The PCI bus is the important bus found
15 MHz, the PCLK output of 8284 is in all the new pentium system because
(A) 2.5 MHz
(A) It has plug and play characteristics
(B) 5 MHz
(B) It has ability to function with a 64-bit
(C) 7.5 MHz
data bus
(D) 10 MHz
(C) Any microprocessor can be
2. What will be the contents of Register AL interfaced to it with PCI controller
after the following has been executed or bridge
MOV BL, 8C (D) All of the above
MOV AL, 7E
ADD AL, BL 5. The following four statements are related
(A) 0A and carry flag is set to interrupts
(B) 0A and carry flag is reset (i) vector table occupies memory
(C) 6A and carry flag is set location 0000H – 0FFFH
(D) 6A and carry flag is reset (ii) Each interrupt vector has four bytes

3. Match the following : (iii) Interrupt descriptor table contain

256 interrupt descriptors
(i) D word (a) End of
procedure (iv) Each address has a 32-bit offset
(ii) ENDP (b) Displacement address
(iii) OFF set (c) Name of (A) All above statements are true
variable
(B) Only first three are true and last is
(iv) ASSUME (d) Mapping
false
(A) (i – d) (ii – a) (iii– b) (iv – c)
(C) Last two are true and first two are
(B) (i – c) (ii – a) (iii– b) (iv – d)
false
(C) (i – d) (ii – b) (iii– a) (iv – c)
(D) Last three are true and first one is
(D) (i – c) (ii – b) (iii– a) (iv – d) false

Paper III 2 K-2414

*K2414* Total Number of Pages : 16

6. An ER-diagram that shows the concept 10. A checkpoint where transactions are
of specialization and Generalization are allowed to perform update even while
known as buffer blocks are being written out is
(A) Extended ER-diagrams called as a

(B) Effective ER-diagrams (A) Buffer

(C) Expanded ER-diagrams (B) Fuzzy checkpoint

(D) Enhanced ER-diagrams (C) Shadow paging

7. ROLLBACK, COMMIT and SAVEPOINT (D) Page swap

are
11. Reflection of a point about x-axis followed
(A) TCLS
by a counter clock wise rotation of 90° is
(B) DDLS
equivalent to reflection about the line.
(C) DMLS
(A) x = – y
(D) VDLS
(B) y = – x

8. After normalization, the original table can (C) x = y

be obtained by
(D) x + y = 1
(A) Delete operation

(B) Cascade operation 12. A cube of side 1 unit is placed such that
the origin coincides with one of its
(C) Join operation
vertices and the three axes run along
(D) Generalization operation
three of its edge. The vertex diagonally

9. The initial state of a transaction is known as opposite to (0, 1, 0) is

(A) Failed state (A) (0, 0, 0)

(B) Active state (B) (1, 1, 0)

(C) Partially committed state (C) (0, 1, 1)

(D) Aborted state (D) (1, 0, 1)

K-2414 3 Paper III
*K2414* Total Number of Pages : 16

13. Assuming that one allows 256 depth 17. In the statement static refers to
value levels to be used, how much
Public Static int x ;
memory would a 512 × 512 pixel display
require to store the Z-buffer. (A) scope of the variable
(A) 512 K
(B) not to the scope of the variable
(B) 256 K
(C) public
(C) 1024 K
(D) protected
(D) 128 K

14. In 2 – D computer animation, moving 18. Which is perfect match

objects are often referred to as
(I) Regular Language
(A) Translate
(II) Functional Language
(B) Sprites
(C) Move (III) Logical Language

(D) RUN (IV) Perl

(V) LISP
15. The dimension of a fractal is defined in
terms of two parameters, N and S, where (VI) PROLOG
N is the no. of pieces and S is the scaling
factor. The expression for Dimension is (A) (I) and (IV)

(A) S/N (B) (II) and (VI)

(B) log N/Log S (C) (III) and (IV)
(C) N/S
(D) (III) and (V)
(D) log S/log N

19. Which is not parallel command ?

16. Which is not parameter passing
(A) Call-by-value (A) Thread

(B) Call-by-reference (B) Fork

(C) Call-by-name
(C) Par do
(D) Call-by-function
(D) Socket
Paper III 4 K-2414
*K2414* Total Number of Pages : 16

20. Which is not parallelism ? 24. Consider the following statements

(A) Parallel (i) Transport layer does packet
(B) Concurrency sequencing

(C) Distributed (ii) MAC and LLC are the sublayer of

Network layer
(D) Simultaneous
(iii) Bridges operate at Network layer
21. Consider a channel with a bandwidth of
(A) All three statements are true
3100 Hz. If 8 levels of signals are
transmitted through the channel. (B) (i) and (ii) are true and (iii) false
Compute capacity of the channel using (C) (i) and (iii) are true and (ii) false
the Niquist formulation.
(D) (ii) and (iii) are true and (iii) false
(A) 6200 bps
(B) 3100 bps 25. In a(n) ____________ configuration,
the initializing is done manually, with
(C) 18600 bps
migrations done automatically.
(D) 24800 bps
(A) manual
22. What shall be data rate for a voice signal (B) automatic
through PCM ? Assume 128 quantization
(C) semiautomatic
levels and bandwidth of 4 kHz.
(D) multipoint
(A) 56 kbps
(B) 28 kbps 26. Consider a stack, A character occurrence
(C) 512 kbps indicates “Push the character”, and an
occurrence of indicates “pop”. The string
(D) 1024 kbps *
given is
E XA
23. Which of the following operates at the * ** MQ *UES * T* ION
presentation layer ? Give the sequence of values popped by
the above operations.
(A) FTP and HTTP
(A) EXAMQUESTION
(B) SMTP
(B) NOITSEUQMAXE
(C) UDP (C) EAXQST
(D) MIDI and JPEG (D) EAXQMSEUTNOI

K-2414 5 Paper III

*K2414* Total Number of Pages : 16

27. Find the running time of the following 30. An undirected graph G with n vertices
piece of code and e edges is represented by adjacency
int f(int n)
list. What is the time required to generate
{
all the connected components ?
if n > 3 then
return (f(n – 1). f(n – 3)) ; (A) O(n)
else (B) O(e)
return ;
(C) O(e2)
}
(D) O(n + e)
(A) T(n) = T(n – 1) + T(n – 3) + 0(1)
(B) T(n) = T(n – 1) . T(n – 3) + 0(1)
31. Aggregation is a special form of
(C) T(n) = 2T(n – 1) + 0(n – 3)
______________ between a whole
(D) T(n) = T(n – 1) + 0(n)
and its ports in which the whole is

28. Given two vertices s and t in a directed composed of the ports.

unweighted graph, which of the following
(A) Generalization
graph search algorithm is best suited for
efficiently finding the shortest path from (B) Specialization
s to t ?
(C) Association
(A) Depth first search
(D) Object
(B) Breadth first search
(C) Dijkastra’s algorithm
32. Assume a class with obj 1, obj 2 and obj 3,
(D) Bellman-ford algorithm
for the statement obj 3 = 1 – obj 2 to work

29. Which of the following sorting methods correctly, the overloaded operator must
would be most suitable for sorting a list
(A) return a value
which is almost sorted ?
(B) create a named temporary object
(A) Bubble sort
(B) Insertion sort (C) use the object of which is a member
as an operand
(C) Selection sort
(D) both (A) and (C) above
(D) Quick sort

Paper III 6 K-2414

*K2414* Total Number of Pages : 16

33. Garbage collector frees the programmer 36. In project estimation the with used for
from worrying about estimation of development effort and

(A) memory leaks development time are

(B) dangering references (A) Month persons and months

(C) creating new objects

(B) Person months and month persons
(D) recursion
(C) Months and person months

34. Consider the condition, (D) Person months and months

(m > = 5) || (n! = m)

How you rewrite this condition if JAVA 37. Decomposition of a module requires

does not have | | operator ? (A) High cohesion and high coupling

(A) ! ((m < 5) & & (n = = m))

(B) Low cohesion and low coupling
(B) (m < 5) & & (n = = m)
(C) High cohesion and low coupling
(C) (m < 5) || (n = = m)
(D) Low cohesion and high coupling
(D) None of these

38. In top-down testing strategy, the dummy

35. Which of the following parameter
procedures invoked by the module under
passing mode is | are supported by
testing are known as
JAVA ?
(A) Drives
(A) Pass by value

(B) Pass by reference (B) Stubs

(C) Pass by result value (C) Leads

(D) A mode that depends on the context (D) Trailers

K-2414 7 Paper III

*K2414* Total Number of Pages : 16

39. The changes made in software systems

42. The worst fit algorithm
during software maintenance when the
customer need the product to be (A) Is used only when nothing better is
interfaced with new hardware and
available
software is known as
(B) Is to place program in largest
(A) Corrective maintenance
available partition
(B) Perfective maintenance

(C) Adaptive maintenance (C) Should never be used

(D) Integrative maintenance (D) Places a program in the smallest

possible partition
40. The quality assurance method consists
of the following different stages
43. A thread is a
1. Inspection
(A) Task
2. Quality control

3. Quality assurance (B) Process

4. Total quality management. The (C) Program

required sequence of the above
(D) Light weight process
stages in quality assurance
process are
44. Consider a logical address space of eight
(A) 1, 2, 3, 4
pages of 1024 words each, mapped onto
(B) 1, 2, 4, 3
a physical memory of 32 frames. How
(C) 1, 3, 2, 4
many bits are there in the logical address
(D) 1, 4, 2, 3
and physical address.

41. Logical memory is divided into (A) 12, 14

(A) Pages (B) 12, 16
(B) Frames
(C) 13, 15
(C) Partitions
(D) 14, 16
(D) Parts

Paper III 8 K-2414

*K2414* Total Number of Pages : 16

45. Assume we have a demand-paged 48. What is the name computer program that
memory. The page table is held in simulates the thought process of human
registers. It takes 8 milliseconds to beings ?
service a page fault if an empty page is
(A) Human logic
available or the replaced page is not
modified and 20 milliseconds if the (B) Expert system
replaced page is modified. Memory
(C) Expert reason
access time is 100 nanoseconds.
Assume that the page to be replaced is (D) Personal system
modified 70 percent of time. What is the
maximum acceptable page-fault rate for 49. Which of following algorithm is on-line
an effective access time of no more than search algorithm ?
200 nanoseconds ?
(A) Breadth-first search algorithm
(A) 0.000002
(B) Depth-first search algorithm
(B) 0.000003
(C) Hill-climbing search algorithm
(C) 0.000006
(D) None of the above mentioned
(D) 0.200000

50. PROLOG is
46. Uninformed search is also called as
(A) Programing logic based on logic
(A) Hill climbing
(B) Describe the structure of the content
(B) Best first search
of the data base
(C) Worst case search
(C) Operating system
(D) Brute force search
(D) None of the above mentioned

47. A set of possible permutation that can be

51. Context Free Grammar (CFG) is
examined by a search method in order
recognized by
to find solution is
(A) finite state automata
(A) Formula
(B) 2-way linear bounded automata
(B) Function

(C) Search space (C) push down automata

(D) Procedure (D) both (B) and (C) of above

K-2414 9 Paper III

*K2414* Total Number of Pages : 16

52. The following Grammar 55. Which of the following denotes

G = { N, T, P, S} Chomskian hierarchy ?
N = { S, A, B} (A) REG ⊂ CFL ⊂ CSL ⊂ Type 0
T = {a, b, c} (B) CFL ⊂ REG ⊂ Type 0 ⊂ CSL
P : S → asa (C) CSL ⊂ Type 0 ⊂ REG ⊂ CFL
S → asa (D) CSL ⊂ CFL ⊂ REG ⊂ Type 0
A → bB
B → bB 56. If there are only eight alphabets in a
B→C particular vocabulary system, the size of
the variable length code will be
is Grammar of type
(A) 8
(A) Type 3
(B) 18
(B) Type 2 but not Type 3
(C) 20
(C) Type 1 but not Type 2
(D) 24
(D) Type 0 but not Type 1
57. For the code C = { 001, 110, 101}, the
53. Push down machine behaves like error pattern of weight _________ can be
Turing machine when number of detected.
auxiliary memory it has (A) 0
(A) 2 (B) 1
(B) 1 (C) 2

(C) 0 (D) 3

(D) 4
58. If a function g(x) has Fourier transform
G(k), the Fourier transform of the nth
54. Which of the following regular expression
derivative of g(x) will be
identity is true ?
(A) (ik)–n G(k)
(A) r(*) = r*
(B) (ik)n G(k)G*(k)
(B) (r* s*)* = (r + s)*
(C) (ik)n G(k)
(C) (r + s)* = r* + s*
(D) r* s* = r* + s* (D) (ik)–n G*(k)

Paper III 10 K-2414

*K2414* Total Number of Pages : 16

59. A divisor in a cyclic code is normally 61. The maximization and minimization of a
called the quantity is the

(A) redundancy (A) Goal of management science

(B) degree (B) Decision for decision analysis

(C) generator (C) Construct of operations research

(D) backwards (D) Objective of linear programming

60. For a binary symmetric channel whose 62. To find the optimal solution to a linear
input source is the alphabet X = {0, 1} with programming problem using graphical
probabilities {0.5, 0.5} and whose output method is
alphabet is Y = {0, 1}, having the following
(A) Find the feasible point that is
channel matrix where ∈ is the probability
fartherest away from the origin
of transmission error.
⎛1 − ∈ ∈ ⎞ (B) Find the feasible point that is at
⎜ ⎟
⎝ ∈ 1 + ∈⎠ highest location
The expressions – (1 – ∈) log (1 – ∈) – ∈
log ∈ and 1 + (1 – ∈) log(1 – ∈) + ∈ log ∈ (C) Find the feasible point closest to the

represent. origin

(A) Conditional entropy and mutual (D) None of the Alternative is correct

information respectively
63. All linear programming problems will
B) Mutual information and conditional
have following properties Except
entropy respectively
(A) a linear objective function that is to
(C) Uncertainity in conditional entropy
be maximised or minimised
and mutual information of channel
respectively (B) a set of linear constraints

(D) Uncertainity in conditional entropy (C) alternative optimal solution

and mutual information of channel (D) variable restricted to non negative

respectively values

K-2414 11 Paper III

*K2414* Total Number of Pages : 16

64. Total profits are maximised when the 67. An autoassociative network is
objective function (as straight line on a (A) a neural network contains no loop
graph) is
(B) a neural network contains feedback
(A) Nearest to origin and tangent to the
(C) a neural network that has only one
‘feasible region’
loop
(B) Fartherest from the origin and
(D) a neural network that has two
tangent to the ‘feasible region’ loops
(C) Nearest to the origin irrespective of
‘feasible region’. 68. Which of the following is true

(D) Fartherest from origin irrespective of (i) On average, neural networks have
the ‘feasible region’ higher computational rates than
conventional computers.
65. The point (x, 3) satisfies inequality, (ii) Neural networks learn by example.
– 5x – 2y ≤ 13 find smallest possible (iii) Neural networks mimic the way
value of x human brain works.
(A) 1.4 (A) All of (i), (ii) and (iii) are true
(B) 0 (B) (ii) and (iii) are true
(C) 3.8 (C) (i) is only true
(D) 1.4 (D) (iii) is only true

66. A 3-input neuron is trained to output a 69. Which of the following is not true
zero, when the input is 110 and above regarding the principles of fuzzy logic ?
when the input 111. After generalization, (A) Fuzzy logic is a concept of certain
the output will be zero when and when degree
the input is
(B) Fuzzy logic following principles of
(A) 000 or 000 or 011 or 101 Aristotle and Buddha

(B) 010 or 100 or 110 or 101 (C) Japan is currently is the most active
user of fuzzy logic
(C) 000 or 010 or 110 or 100
(D) Boolean logic is the subset of fuzzy
(D) 000 or 110 or 110 or 100
logic
Paper III 12 K-2414
*K2414* Total Number of Pages : 16

70. Fuzzy Approximation Theorem (FAT) is 73. The inode in the directory links the

(A) A fuzzy system can model any filename directly to the physical file is
continuous system known as

(B) The conversion of fuzzy logic to (A) Hard link

probability
(B) Soft link
(C) A continuous system that can model
(C) Symbolic link
a fuzzy system
(D) Complex link
(D) Used in sorting mechanism

74. The unix command copies a specified

71. To show size of files in blocks, ls number of lines from the beginning of
command is used with option. one or more files to the standard output
stream is
(A) size

(B) s (A) head

(C) b (B) top

(D) block (C) begin

(D) title
72. The command copies standard input to
75. The regular expression
standard output and at the same time
– ? [0 – 9] +
copies it to one or more files is matches
(A) signed number
(A) cp
(B) number with plus
(B) mv
(C) Signed number including an
(C) tee optional leading minus

(D) inputoutput (D) Signed number with plus

_____________

K-2414 13 Paper III

*K2414* Total Number of Pages : 16

bñÜᤠŸÃÜÖÜPÝRX ÓܧÙÜ

Space for Rough Work

Paper III 14 K-2414

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

K-2414 15 Paper III

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

Paper III 16 K-2414