Vous êtes sur la page 1sur 16

Test Paper : III

Test Booklet Serial No. : _______________________


Test Subject : COMPUTER SCIENCE AND
OMR Sheet No. : _________________________________
APPLICATION
Roll No.
Test Subject Code : K-2413
(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-2413 1 ±Üâ.£.®æãà./P.T.O.
*K2413* 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 Pentium microprocessor has


4. The 8255 interfacing chip has following
__________ execution unit.
features
(A) 1
(B) 2 (i) It has three ports which can be used

(C) 3 I/o mode

(D) 4 (ii) It has one internal command register

2. Ready pin of a microprocessor is used (iii) It can be used in three different


modes
(A) To indicate that the microprocessor
is ready to receive inputs (iv) Port C has some different features
(B) To indicate that the microprocessor
is ready to receive outputs (A) All are true
(C) To introduce wait states
(B) (i), (iii) and (iv) are true
(D) To provide direct memory access
(C) (ii), (iii) and (iv) are true
3. The following statements are with respect (D) (i) and (iv) are true
to the 8259 A (PIC)
(i) It can only be used for eight interrupt
5. A number of 256 × 8 bit memory chips
inputs
are available. To design a memory
(ii) It has two central words, OCW and
ICW organisation of 2K × 8 memory, number

(iii) First ICW is initialized and then of chips needed and type of multiplexor
OCW required are
(iv) It has three status registers
(A) 16 and 2 : 4
(A) All above statements are true
(B) 32 and 3 : 8
(B) First three statements are true
(C) Only last three are true (C) 8 and 3 : 8

(D) Only (ii) and (iii) are true (D) 256 and 3 : 8

Paper III 2 K-2413


*K2413* Total Number of Pages : 16

6. Create, Alter and Drop are the examples of 10. When a transaction never progresses
then we say that it is
(A) DDL

(B) DML (A) Aborted

(C) VDL (B) Starved

(D) SDL (C) Shared

(D) Locked
7. What is the cardinality of a table with 50
rows and 5 coloums ?
11. The phenomenon of having a continuous
(A) 5 glow of a beam on the screen even after
(B) 50 it is removed is called as ?

(C) 250 (A) Flourence


(D) 550 (B) Persistence

8. A buffer use to store results of the recent (C) Phosphorence

query (D) Incadescence


(A) Triggers
12. Which of the following statement is true ?
(B) Packages
(A) Request, sample and event are the
(C) Cursor
three basic modes of input
(D) Exceptions
(B) Keyboard is a device ideally suited
9. If a relation has 7 attributes then there will for use in sample mode
be how many subsets of these attributes
(C) A mouse is typically a device for
(A) 16 inputting an absolute position on the
(B) 4 screen

(C) 256 (D) Special graphics hardware support


(D) 128 is essential to an application

K-2413 3 Paper III


*K2413* Total Number of Pages : 16

13. The format for storing digital audio in 15. Match the following :
(i) Homogeneous (a) Shading
multimedia application
Coordinate
(A) JPEG (ii) Phong model (b) Clipping
(iii) BSP Tree (c) Translation
(B) TIFF (iv) Cyrus – Beck (d) Back to front
ordering
(C) WAV
(A) (i – b) (ii – a) (iii– d) (iv – c)
(D) BMP (B) (i – d) (ii – c) (iii– b) (iv – a)
(C) (i – c) (ii – b) (iii– d) (iv – a)
14. The following statements are made with (D) (i – c) (ii – a) (iii– d) (iv – b)

respect to the Bezier functions


16. Which is not object-oriented concept ?
(i) The basis functions of the Bezier (A) Data Abstraction

curves are convex (B) Inheritance


(C) Polymorphism
(ii) The basis functions are non-negative
(D) Subroutine
(iii) The Bezier curves are Affine variant
17. Which is functional language ?
(iv) When control points lie on a straight (A) PROLOG
line, then the corresponding B’ezier (B) FOTRAN

curve will also be a straight line (C) LISP


(D) PERL
(A) All (i), (ii), (iii) and (iv) are true
18. Which is not scripting language ?
(B) (i), (ii), (iii) are true, (iv) false (A) Perl
(B) Java
(C) (i), (iii), (iv) are true, (ii) false
(C) VB
(D) (i), (ii), (iv) are true, (iii) false (D) C++

Paper III 4 K-2413


*K2413* Total Number of Pages : 16

19. Which falls under regular paradigm ? 23. Flow control takes place at what level in
(A) Java (B) Lisp OSI model ?

(C) Prolog (D) Perl (A) Physical

20. Which is not data type ? (B) Network

(A) Int (C) Transport

(B) Complet (D) Data Link


(C) String
24. Consider the following statements
(D) Numeric
(i) Most logical addresses are present
21. For a given level of noise, the data rate
in network interface cards at the
could be increased by
factory
(A) Increasing signal strength and
decreasing bandwidth (ii) Session layer handles
synchronization
(B) Decreasing signal strength and
increasing band width (iii) Error detection and recovery are
(C) Increasing either signal strength or done in Data link layer
band width
(A) All are true
(D) Not possible to change it
(B) (i) and (iii) are true and (ii) false
22. For microwave transmission, loss will (C) (ii) is true and (i) and (iii) false
follow the following rule
(D) All are false
(A) Increase with distance and
frequency
25. VLAN create _________ domains.
(B) Increase with distance and
wavelength (A) Unicast

(C) Increase with square of distance and (B) Multicast


square of frequency
(C) Broadcast
(D) Increase with square of distance and
square of wavelength (D) Point-to-point

K-2413 5 Paper III


*K2413* Total Number of Pages : 16

26. The order of time complexities from most 29. A hash table of length 10 uses open
efficient to least efficient is addressing with hash function h(K) = K
mod 10, and linear probing. After inserting
(A) O(2n), O(n2), O(nlogn), O(n), O(logn)
6 values into an empty hash table, the
2 n
(B) O(n), O(n ), O(2 ), O(logn), O(nlogn) table is as shown below
(C) O(logn), O(n), O(nlogn), O(n2), O(2n)


2 n
(D) O(nlogn), O(logn), O(n ), O(n), O(2 ) 

"

27. Find the running time of the following ! !

piece of code " ! "

for i = 1 to n # #

insert (i2, s)
$ " $

for i = 1 to n
% ! !

remove (s)
&

Assume both insert (i, s) and remove (s) '

take time O(log |s|), and choose the


correct estimate Which one of the following gives a
(A) O(nlogn) possible order in which the key value
could have been inserted in the table ?
(B) O(nlogn2)
2
(A) 46, 42, 34, 52, 23, 33
(C) O(n )
(B) 34, 42, 23, 52, 33, 46
(D) O(n2logn)
(C) 46, 34, 42, 23, 52, 33

28. What is the maximum height of any (D) 42, 46, 33, 23, 34, 52
AVL-tree with 7 nodes ? Assume the
length of the tree with a single node is 30. Which of the following sorting algorithms
0(zero) has the lowest worst-case complexity ?

(A) 2 (A) Merge-sort

(B) 3 (B) Bubble-sort


(C) Quick-sort
(C) 4
(D) Selection-sort
(D) 5

Paper III 6 K-2413


*K2413* Total Number of Pages : 16

31. What does the statement 34. Forcing variable type to become another
type before accessing an appropriate
import Java.util. ;
function is known as


Import ?
(A) Regression
(A) All the classes in the package
(B) Recursion
Java.util
(C) Conversion
(B) All the methods in the class Java.util
(D) Coercion
(C) All the packages starting with
Java.util 35. The type to be used in an instantiation of
a class template follows
(D) None of these
(A) The generic class name

32. The statements (B) The keyword template

int a = 5; (C) The keyword class

System.out.printer (a – =a +=a–=a +=a); (D) The template definition

prints
36. Which of the following is NOT desired in
(A) 0 a good SRS document ?

(B) 5 (A) Functional requirements

(C) –5 (B) Non-functional requirements


(C) Goals of implementation
(D) None of these
(D) Algorithms for software
implementation
33. C++ encourages structing of a software
as a collection of components that are
37. The concurrent development model is
(A) Highly cohesive and loosely (A) Another name for the rapid
coupled application development model

(B) Not highly cohesive but loosely (B) Often used for the development of
coupled client/server applications
(C) Only used for development of
(C) Highly cohesive and tightly coupled
parallel and distributed systems
(D) Not highly cohesive but tightly (D) Used whenever a large number of
coupled change requests are anticipated

K-2413 7 Paper III


*K2413* Total Number of Pages : 16

38. Project risk factor is considered in 42. Assume IBM machine consists of 24-bit
logical address. The page size is 2 KB.
(A) Spiral model
How many bits are adequate to address
(B) Waterfall model the bytes in pages ?
(C) Prototyping model (A) 11
(D) Iterative enhance model (B) 13
(C) 15
39. The testing technique that requires
devising test cases to demonstrate that (D) 17
each program function is operational is
called 43. CPU generates

(A) Glass-box testing (A) Logical address

(B) Grey-box testing (B) Physical address

(C) Black-box testing (C) Relocatable address

(D) White-box testing (D) Good address

40. According to Bohem, the process of 44. Semaphores were given by


tacking “Are we building the product right” (A) Albrecht
is known as
(B) Peterson
(A) Testing
(C) Hamming
(B) Verification
(D) Dijkstra
(C) Validation

(D) Debugging 45. A situation where a process or a set of


processes is blocked, waiting for some
resource that is held by some other
41. Very high paging activity is known as
waiting processes
(A) Demand paging
(A) Mutual Exclusion
(B) Demand segmentation
(B) Semaphore
(C) Thrashing
(C) Deadlock
(D) Starvation
(D) Polling state

Paper III 8 K-2413


*K2413* Total Number of Pages : 16

46. When the prolog system is entered we 50. Match the following terms to their
are at top level. The system is waiting for meaning
us to initiate a (I) Turing test (a) S o f t w a r e
designed to
(A) Conversation replicate the
knowledge of
(B) Translation
human expert
(C) Procedure (II) Expert system (b) Spanish “hola”
for English
(D) Conversion “hello”
(III) Automatic (c) First Area of
47. The method known for variation on hill translation A.I. Research
climbing and the idea to include a (IV) Checkers and (d) If it acts
general survey of scene to avoid quest intelligent, It is
intelligent
climbing false foot hills
(I) (II) (III) (IV)
(A) Best first search
(A) (d) (a) (b) (c)
(B) Simulated annealing
(B) (d) (a) (c) (b)
(C) Worst case search (C) (d) (b) (c) (a)
(D) Blind search (D) (a) (b) (c) (d)

48. Attributes of a state altered by an operator 51. Match the following :


application is called as (i) Regular grammar (a) Push down
Automation
(A) Pre conditions (ii) Context free (b) Linear
(B) States grammar bounded
automation
(C) Post conditions (iii) Unrestricted (c) Deterministic
(D) Terminal conditions grammar finite
automation
(iv) Context sensitive (d) Turing
49. To invoke LISP system you must enter
grammar machine
(A) A.I. (A) (i) 
c (ii) 
a (iii) 
b (iv) 
d
(B) LISP (B) (i) 
c (ii) 
a (iii) 
d (iv) 
b
(C) CL (Common LISP) (C) (i) 
c (ii) 
b (iii) 
a (iv) 
d

(D) Both (B) and (C) (D) (i) 


c (ii) 
b (iii) 
d (iv) 
a

K-2413 9 Paper III


*K2413* Total Number of Pages : 16

52. A formal grammar is a __________ for 55. Which of the following regular
rewriting string. expression denotes a language
comprising of all possible strings over
(A) Set rules

= {a, b} of length n where n is multiple
(B) Set of functions of 3.
(C) Both (A) and (B) (A) (a + b + aa + bb + aba + bba) 

(D) Set of axious (B) (aaa + bbb) 

(C) ((a + b) (a + b) (a + b))


53. Consider the following statements.


(D) (aaa + ab + a) + (bbb + bb + a)


(i) Recursive languages are closed
under complementation 56. In block coding, if n = 5, the maximum
(ii) Recursively enumerable languages hamming distance between two code
is closed under union words is

(iii) Recursively enumerable languages (A) 5 (B) 3


are closed under complementation. (C) 2 (D) 7
Which of the statement is true
57. The Shannon limit for a infinite band
(A) (i) only width is
(B) (i) and (ii) (A) –2.6 dB
(C) (i) and (iii) (B) –1.6 dB
(D) (ii) and (iii) (C) +1.6 dB
(D) 0 dB
54. Which of the following strings is not
generated by the following grammar ?
58. Suppose that women who live beyond
the age of 70 out number men in the same
S SaSbS/E
age bracket by three to one. How much


(A) aabb information, in bits, is gained by learning


that a certain person who lives beyond
(B) abab
70 happens to be male ?
(C) aababb
(A) 1 (B) 2
(D) aaabb
(C) 3 (D) 70

Paper III 10 K-2413


*K2413* Total Number of Pages : 16

59. The mutual information I(x; y) and joint 61. Which of the following is valid objective
entropy H(x; y) are related as function for a linear programming
problem ?
(A) I(x; y) = H(x) – H(x/y)
(A) Max 5xy
(B) I(x; y) = H(x) – H(y/x)
2 2
(B) Max 5x + y
(C) I(x; y) = H(y) – H(x/y)
(C) Max 4x + 3y + (2/3)z
(D) I(x; y) = H(y) – H(y/x)
(D) Min (x1 + x2)/x3
All Symbols have their usual meaning
62. A constraint that does not affect the
60. Four classes of signals and their spectral feasible region is a
characteristics are given below. Match
(A) Non-negativity constraint
them as per their characteristics
(B) Redundant constraint
Signal Type Spectral
(C) Standard constraint
characteristics
(1) Continuous, (a) Continuous, (D) Slack contraint

aperiodic aperiodic
63. Slack is
(2) Continuous, (b) Continuous,
(A) Difference between left and right
periodic periodic
sides of constraint
(3) Discrete, (c) Discrete,
aperiodic aperiodic (B) The amount by which left side
a< constraint is smaller than the right
(4) Discrete, (d) Discrete,
side
periodic periodic
(C) The amount by which left side of
(A) (1 – a) (2 – b) (3 – c) (4 – d) a > constraint is larger than right side
(B) (1 – a) (2 – c) (3 – b) (4 – d) (D) Exists for each variable in a linear
(C) (1 – d) (2 – a) (3 – c) (4 – b) programming problem

(D) (1 – b) (2 – a) (3 – d) (4 – c)

K-2413 11 Paper III


*K2413* Total Number of Pages : 16

64. Find if possible, 67. A 4-input neuron has weights 1, 2, 3 and 4.


The transfer function is linear with the
Minimum value of objective function
constant proportionality being equal to 2.
3x – 4y
The inputs are 4, 10, 5 and 20
Subject to the following constraints respectively. The output will be
–2x + y 
12 (A) 238
x–y 
2 (B) 76
x 0, y
 
0 (C) 119
(A) – 8 (D) 28
(B) No solution
68. What is downside (demerits) of expert
(C) – 36
system ?
(D) 0
(A) Expert system are not good at
strategizing
65. The following inequalities define a
feasible region, which one of these could (B) It is very work-intensive to build the
be remoted from the list without changing knowledge base
region. (C) Expert systems handles only a
narrow domain of knowledge
(A) –x + y 10 

(D) All the above (A), (B) and (C)


(B) y 0 

(C) x 
0 69. What are the following sequence of steps
(D) x + y 20 
taken in designing fuzzy logic machine ?
(A) Fuzzification Rule evaluation
 

66. A perception is defuzzification


(A) A single layer feed-forward neural (B) Rule evaluation 
fuzzification
network with preprocessing defuzzification


(B) An autoassociative neural network (C) Fuzzy sets 


defuzzification 

(C) A double layer autoassociative rule evaluation


neural network (D) Defuzzification 
Rule evaluation
(D) A and B 
fuzzification

Paper III 12 K-2413


*K2413* Total Number of Pages : 16

70. Considering a graphical representation 73. In unix file system • and • • represents
of the ‘tallness’ of a people using its
(A) Parent, current
appropriate member function, which of
the following combinations are true (B) Parent, parent
(i) TALL is usually the fuzzy set (C) Current, parent
(ii) HEIGHT is usually the fuzzy set
(D) Current, current
(iii) PEOPLE is usually the universe of
discourse 74. In unix, the command j chmod 664 file
(A) (i), (ii) and (iii) represent
(B) (i) and (ii) only
(A) User and group read + write, others
(C) (i) and (iii) only write only
(D) (ii) and (iii) only
(B) User and group read + write, others
read only
71. In vi editor which of the following
keystrokes can delete the current line ? (C) User and group read, others read
(A) d only

(B) X (D) User and group write, others write


(C) dd only
(D) delete
75. Which of the following command
72. In unix, which following type of file used displays your login shell in Bash shell ?
for network communication
(A) j SHELL
(A) FIFO
(B) echo j Bash
(B) Socket

(C) Directory (C) echo j O

(D) Block (D) j O

_________________

K-2413 13 Paper III


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

Paper III 14 K-2413


*K2413* Total Number of Pages : 16

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


Space for Rough Work

K-2413 15 Paper III


*K2413* Total Number of Pages : 16

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


Space for Rough Work

Paper III 16 K-2413