COMPETITIVE EXAMINATION - 2016 GFGC

DATE SUBJECT SUBJECT CODE TIME

05-03-2016 COMPUTER SCIENCE 18 2.00 pm to 5.00 pm
MAXIMUM MARKS TOTAL DURATION MAXIMUM TIME FOR ANSWERING
200 210 Minutes 180 Minutes
MENTION YOUR REGISTER NUMBER QUESTION BOOKLET DETAILS
QUESTION BOOKLET SERIAL NO. & VERSION NO.

DOs:
1. Check whether the Register No. has been entered and shaded in the respective circles on the OMR answer
sheet.
2. Check whether the Centre Code has been entered and shaded in the respective circles on the OMR answer
sheet.
3. Check whether the subject name has been written and the subject code has been entered and shaded in the
respective circles on the OMR answer sheet.
4. This question booklet will be issued to you by the invigilator after the 2nd bell i.e., after 1.55 pm.
5. The serial number of this question booklet should be entered on the OMR answer sheet.
6. The Version Number of this question booklet should be entered on the OMR answer sheet and the respective
circles should also be shaded completely.
7. Compulsorily sign at the bottom portion of the OMR answer sheet in the space provided.
DONTs:
1. The timing and mark’s printed on the OMR answer sheet should not be damaged / mutilated / spoiled.
2. The 3rd Bell rings at 2.00 pm, till then;
• Do not remove the seal on the right hand side of this question booklet.
• Do not look inside this question booklet.
• Do not start answering on the OMR answer sheet.
IMPORTANT INSTRUCTIONS TO CANDIDATES
1. This question booklet contains 100 questions and each question will have one statement and four distracters
(Four different options / choices.)
2. After the 3rd Bell is rung at 2.00 pm, remove the seal on the right hand side of this question booklet and check
that this booklet does not have any unprinted or torn or missing pages or items etc., if so, get it replaced by
complete test booklet. Read each item and start answering on the OMR answer sheet.
3. During the subsequent 180 minutes:
• Read each question carefully,
• Choose the correct answer from out of the four available distracters (options / choices) given under each
question / statement.
• Completely darken / shade the relevant circle with a blue or black ink ballpoint pen against the question
number on the OMR answer sheet.
Correct Method of shading the circle on the OMR answer sheet is as shown below:
A B C D
4. Please note that even a minute unintended ink dot on the OMR answer sheet will also be recognized and
recorded by the scanner. Therefore, avoid multiple markings of any kind on the OMR answer sheet.
5. Use the space provided on the question booklet for Rough Work. Do not use the OMR answer sheet for the
same.
6. After the last bell is rung at 5.00 pm, stop writing on the OMR answer sheet and affix your left hand thumb
impression on the OMR answer sheet as per the instructions.
7. Hand over the OMR answer sheet to the room invigilator as it is.
8. After separating the top sheet, the invigilator will return the bottom sheet replica (candidate’s copy) to you to
carry home for self evaluation.
9. Preserve the replica of the OMR answer sheet for a minimum period of ONE year.
10. In case of any discrepancy in the English and Kannada Versions, the English version will be taken as final in case
of Compulsory Paper – III and Optional Papers, except the languages of optional paper.

18
1. The number of one’s present in the binary representation of 10 × 256 + 5 × 16 + 5 is
10 × 256 + 5 × 16 + 5gÀ ¨ÉÊ£Àj ¤gÀÆ¥ÀuÉAiÀÄ°è ¸ÀASÉå MAzÀÄ JµÀÄÖ ¨Áj §gÀÄvÀÛzÉ ?
(A) 5 (B) 6
(C) 7 (D) 8
2. In which of the following gates, the output is one, iff atleast one input is one ?
F PɼÀV£À AiÀiÁªÀ UÉÃmï£À°è PÀ¤µÀÖ ¥ÀPÀë MAzÀÄ ºÀÆrPÉ (input)AiÀÄÄ MAzÀÄ DVzÀÝgÉ,
¤ÃrPÉ (output)AiÀÄÄ MAzÀÄ DVgÀÄvÀÛzÉ ?
(A) NOR (B) AND
(C) OR (D) NAND
3. The hexadecimal number for (95.5)10 is
(95.5)10 UÉ ºÉPÁìqɹªÀÄ2ï (hexadecimal) ¸ÀASÉå AiÀiÁªÀÅzÀÄ ?
(A) (5F.8)16 (B) (9A.B)16
(C) (2E.F)16 (D) (5A.4)16

4. Which of the following sets of component(s) is/are sufficient to implement only arbitrary
Boolean function ?
(A) XOR gates, NOT gates
(B) 2 to 1 multiplexers
(C) AND gates, XOR gates
(D) Three - input gates that output (A.B) + C for the inputs A, B and C
F PɼÀPÀAqÀ AiÀiÁªÀ WÀlPÀ(UÀ¼À) UÀtªÀÅ AiÀiÁªÀÅzÉà ¤µÀàçªÀiÁtÂvÀ §Æ°AiÀiÁÄó PÁAiÀÄðªÀ£ÀÄß
C£ÀĵÁפ¸À®Ä ¸ÁPÁUÀÄvÀÛzÉ ?
(A) XOR UÉÃmïUÀ¼ÀÄ, NOT UÉÃmïUÀ¼ÀÄ
(B) 2 to 1 ªÀÄ°Ö¥ÉèPÀìgïUÀ¼ÀÄ
(C) AND UÉÃmïUÀ¼ÀÄ, XOR UÉÃmïUÀ¼ÀÄ
(D) A, B ªÀÄvÀÄÛ C ºÀÆrPÉUÀ½UÉ (A.B) + C ¤ÃrPÉUÀ¼ÁzÀ ªÀÄÆgÀÄ ºÀÆrPÉ UÉÃmïUÀ¼ÀÄ

5. Consider the following pseudo program segment :

F PɼÀV£À PÀæªÀÄ«¢ü ¨sÁUÀUÀ¼À£ÀÄß ¥ÀjUÀt¹
if (a>b) printf(“a>b”);
else printf(“else part”);
printf(“ a<=b”);
a<=b will be printed if
(A) a < b (B) a > b
(C) a = = b (D) In all cases/ J2Áè ¸ÀAzÀ¨sÀðUÀ¼À°è
Space For Rough Work

A-1 2 Computer Science

6. Match List I with List II and select the correct answer using the codes given below the
lists.
List I List II
P. while loop 1. Executed at least once.
Q. do while loop 2. Are used when it is known that how many times
loop is executed.
R. for loop 3. Are used when we want to loop until certain
condition was met.
S. continue 4. Put the control starting of the loop.
T. break 5. Put the control out of the loop.
Codes :
P Q R S T
(A) 1 2 3 4 5
(B) 2 1 3 4 5
(C) 3 1 2 4 5
(D) 4 1 3 2 5
F PɼÀV£À ¥ÀnÖ I ªÀÄvÀÄÛ ¥ÀnÖ II £ÀÄß ºÉÆA¢¹j ªÀÄvÀÄÛ ¥ÀnÖUÀ¼À PɼÀUÉ PÉÆnÖgÀĪÀ
¸ÀAPÉÃvÀUÀ½AzÀ ¸ÀjAiÀiÁzÀ GvÀÛgÀªÀ£ÀÄß DAiÉÄ̪ÀiÁr.
¥ÀnÖ-I ¥ÀnÖ-II
P. ªÉÊ2ï ®Æ¥ï 1. PÀ¤µÀÖ ¥ÀPÀë MAzÀÄ ¨Áj PÁAiÀÄðUÀvÀUÉƼÀÄîvÀÛzÉ
Q. qÀÄ-ªÉÊ2ï ®Æ¥ï 2. ®Æ¥ïUÀ¼ÀÄ JµÀÄÖ ¨Áj PÁAiÀÄðUÀvÀUÉÆArªÉ JAzÀÄ
w½¢zÁÝUÀ §¼À¸À2ÁUÀÄvÀÛzÉ
R. ¥sÁgï ®Æ¥ï 3. £ÁªÀÅ PÉ®ªÀÅ µÀgÀvÀÄÛUÀ¼À£ÀÄß ¸Á¢ü¸ÀĪÀªÀgÉUÀÆ ®Æ¥ï
ªÀiÁqÀ®Ä EaÒ¹zÁUÀ §¼À¸À2ÁUÀÄvÀÛzÉ
S. ªÀÄÄAzÀĪÀgɸÀÄ 4. ®Æ¥ï£À ¥ÁægÀA¨sÀzÀ°è ¤AiÀÄAvÀæPÀªÀ£ÀÄß Ej¸ÀĪÀÅzÀÄ
T. vÀqÉ 5. ®Æ¥ï£À ºÉÆgÀUÉ ¤AiÀÄAvÀæPÀªÀ£ÀÄß Ej¸ÀĪÀÅzÀÄ
Codes :
P Q R S T
(A) 1 2 3 4 5
(B) 2 1 3 4 5
(C) 3 1 2 4 5
(D) 4 1 3 2 5
Space For Rough Work

Computer Science 3 A-1

7. The function sprintf() works like printf() but operates on
(A) data in a file (B) stderr
(C) stdin (D) string
printf() £ÀAvÉ sprintf() PÉ®¸À ªÀiÁqÀÄvÀÛzÉ. DzÀgÉ ______ gÀ ªÉÄÃ2É PÁAiÀÄð¤ªÀð»¸ÀÄvÀÛzÉ
(A) PÀqÀvÀzÀ°è zÀvÀÛ (´µæ¯æ) (B) stderr
(C) stdin (D) string

8. What is the effect of the following pseudo ‘C’ program code ?

for(int i=1; i<=5; i=i+1/2)
printf(“%d”, i);
it prints
(A) 1, 1.5, 2, 2.5, 3, 3.5, 4, 4.5, 5, 5.5 and stops.
(B) 1, 2, 3, 4, 5 and stops.
(C) 1, 2, 3, 4, 5 and repeats for ever the same sequence.
(D) 1, 1, 1, 1, 1, and repeats for ever the same sequence.
F ªÀÄÄA¢£À C ¸ÀAPÉÃvÀzÀ ¥ÀjuÁªÀĪÉãÀÄ ?
for (int i=1; i<=5; i=i+1/2)
printf(“%d”, i);
(A) EzÀÄ 1, 1.5, 2, 2.5, 3, 3.5, 4, 4.5, 5, 5.5 ªÀÄÄ¢æ¸ÀÄvÀÛzÉ ªÀÄvÀÄÛ ¤°è¸ÀÄvÀÛzÉ
(B) EzÀÄ 1, 2, 3, 4, 5 ªÀÄÄ¢æ¸ÀÄvÀÛzÉ ªÀÄvÀÄÛ ¤°è¸ÀÄvÀÛzÉ
(C) 1, 2, 3, 4, 5 ªÀÄÄ¢æ¸ÀÄvÀÛzÉ ªÀÄvÀÄÛ CzÉà C£ÀÄPÀæªÀĪÀ£ÀÄß ¸ÀzÁ ¥ÀÄ£ÀgÁªÀwð¸ÀÄvÀÛzÉ
(D) EzÀÄ 1, 1, 1, 1, 1 ªÀÄÄ¢æ¸ÀÄvÀÛzÉ ªÀÄvÀÄÛ CzÉà C£ÀÄPÀæªÀĪÀ£ÀÄß ¸ÀzÀ
¥ÀÄ£ÀgÁªÀwð¸ÀÄvÀÛzÉ

9. If the following ‘C’ program (myprog) is run from the command line as
C:>myprog Friday Tuesday Sunday then, what would be the output?
F PɼÀV£À C PÀæªÀÄ«¢ü (myprog) AiÀÄ£ÀÄß DzÉñÀ ¸Á°¤AzÀ C :>myprog Friday Tuesday
Sunday £ÀqɹzÁUÀ ¤ÃrPÉ output K£ÁVgÀÄvÀÛzÉ ?
main(int argc, char *argv[])
{
printf(“%c” ,**++argv);
}
(A) m (B) f
(C) myprog (D) Friday

Space For Rough Work

A-1 4 Computer Science

10. In ‘C’ program, if the condition is missing in ‘for loop’ then
(A) It is assumed to be present and taken to be false.
(B) It is assumed to be present and taken to be true.
(C) It result in a syntax error.
(D) Execution will be terminated abruptly.
C PÀæªÀÄ«¢üAiÀÄ°è ¥sÁgï-®Æ¥ï £À°è ¤§AzsÀ£ÉAiÀÄÄ PÁuÉAiÀiÁVzÀÝgÉ, DUÀ _______
(A) CzÀÄ G¥ÀÜÝvÀ ÀªÁVzÉ JAzÀÄ ¨sÁ«¸À2ÁUÀÄvÀÛzÉ ªÀÄvÀÄÛ vÀ¥ÀÄà JAzÀÄ
¥ÀjUÀt¸ÀÑæUÀÄvÀÛzÉ
(B) CzÀÄ G¥ÀÜÝvÀ ÀªÁVzÉ JAzÀÄ ¨sÁ«¸À2ÁUÀÄvÀÛzÉ ªÀÄvÀÄÛ ¸Àj JAzÀÄ ¥ÀjUÀt¸À2ÁUÀÄvÀÛzÉ
(C) ªÁPÀågÀZÀ£ÉAiÀÄ°è zÉÆõÀ GAmÁUÀÄvÀÛzÉ
(D) PÁAiÀÄð¤ªÀðºÀuÉAiÀÄÄ KPÁKQ PÉÆ£ÉAiÀiÁUÀÄvÀÛzÉ

11. A type of class that allows only one object of it to be created is

(A) Virtual class (B) Abstract class
(C) Singleton class (D) Friend class
PÉêÀ® vÀ£Àß MAzÀÄ D¨ÉÓPïÖ£ÀÄß gÀƦ¸À®Ä C£ÀĪÀÄw¸ÀĪÀ PÁèöå¸ï£À MAzÀÄ «zsÀ
(A) ªÀZÀÄðAiÀÄ2ï PÁèöå¸ï (B) C¨ï¸ÁÖçPïÖ PÁèöå¸ï
(C) ¹AUÀ2ïl£ï PÁèöå¸ï (D) ¥sÉæAqï PÁèöå¸ï

12. Identify the correct statement in the following:

(A) Base class pointer cannot point to derived class.
(B) Derived class pointer cannot point to base class.
(C) Pointer to derived class cannot be created.
(D) Pointer to base class cannot be created.
F PɼÀV£ÀªÀÅUÀ¼À°è ¸ÀjAiÀiÁzÀ ºÉýPÉAiÀÄ£ÀÄß UÀÄgÀÄw¹
(A) ¨Éøï PÁè¸ï ¥Á¬ÄAlgï, rgÉʪïØ PÁè¸ïUÉ ¸ÀÆa¸À2ÁUÀĪÀÅ¢®è
(B) rgÉʪïØ PÁè¸ï ¥Á¬ÄAlgï, ¨Éøï PÁèöå¸ïUÉ ¸ÀÆa¸À2ÁUÀĪÀÅ¢®è
(C) rgÉʪïØ PÁè¸ïUÉ ¥Á¬ÄAlgï C£ÀÄß gÀƦ¸À2ÁUÀĪÀÅ¢®è
(D) ¨Éøï PÁèöå¸ïUÉ ¥Á¬ÄAlgï C£ÀÄß gÀƦ¸À2ÁUÀĪÀÅ¢®è

13. Exception handling is targeted at

(A) Runtime error (B) Compile time error
(C) Logical error (D) Syntax error
JPÉìÇÈåÛ£ï ºÁåArèAUï F PɼÀPÀAqÀ AiÀiÁªÀÅzÀ£ÀÄß UÀÄjAiÀiÁV¸ÀÄvÀÛzÉ ?
(A) gÀ£ïmÉʪÀiï JgÀægï (B) PÀA¥ÉÊ2ï mÉʪÀiï JgÀægï
(C) 2ÁfPÀ2ï JgÀægï (D) ¹AmÁåPïì JgÀægï
Space For Rough Work

Computer Science 5 A-1

14. Which of the following is used to implement the late binding ?
(A) Virtual function (B) Operator function
(C) Const function (D) Static function
PɼÀV£À AiÀiÁªÀ ¥sÀAPÀë£À£ÀÄß 2ÉÃmï ¨ÉÊArAUï C¼ÀªÀr¸À®Ä G¥ÀAiÉÆÃV¸ÀÄvÁÛgÉ ?
(A) ªÀZÀÄåðAiÀÄ2ï ¥sÀAPÀë£ï (B) D¥ÀgÉÃlgï ¥sÀAPÀë£ï
(C) PÁ£ïì÷Ö ¥sÀAPÀë£ï (D) ¸ÁÖöånPï ¥sÀAPÀë£ï

15. To access a class data member using ‘this’ pointer is

PɼÀV£À AiÀiÁªÀÅzÀ£ÀÄß PÁè¸ï qÁl ªÉÄA§gï£ÀÄß CåPÀì¸ïì ªÀiÁqÀ®Ä G¥ÀAiÉÆÃV¸À2ÁUÀĪÀÅzÀÄ ?
(A) this->x (B) this.x
(C) *this.x (D) *this-x

16. Identify the access specifier that is used as a default in a class definition
(A) protected (B) public
(C) private (D) friend
PÁèöå¸ï qɦü£ÉñÀ£ï£À°è r¥sÁ2ïÖ DV §¼À¸À®àqÀĪÀ ƒ’ðÜ
Þ Èó ¸É๥ÉÊAiÀÄgÀ£ÀÄß UÀÄgÀÄw¹
(A) ¥ÉÆæmÉPÉÖqï (B) ¥À©èPï
(C) ¥ÉæöʪÉÃmï (D) ¥sÉæAqï

17. Which of the following C++ statement is true ?

EªÀÅUÀ¼À°è AiÀiÁªÀ C++ ºÉýPÉ ¸ÀjAiÀiÁVzÉ ?
(A) int *p=new int (B) int new=*p
(C) int *new=*p (D) int *p=int new

18. A common property of logic programming languages and functional languages is

(A) Both are procedural languages.
(B) Both are based on Lambda-calculus.
(C) Both are declarative.
(D) Both are Horn- clauses.
vÀPÀð ¥ÉÆæÃUÁæ«ÄAUï ¨sÁµÉUÀ¼ÀÄ ªÀÄvÀÄÛ PÁAiÀÄðPÁj ¨sÁµÉUÀ¼À ¸ÁªÀiÁ£Àå UÀÄt®PÀëtUÀ¼ÁªÀŪÀÅ ?
(A) JgÀqÀÆ PÁAiÀÄð«zsÁ£ÀzÀ ¨sÁµÉUÀ¼ÀÄ
(B) JgÀqÀÆ PÀ®£À±Á¸ÀÛçªÀ£ÀÄß DÁ·j µå ¹zÉ
(C) JgÀqÀÆ WÉÆõÀuÁvÀäPÀªÁVªÉ
(D) JgÀqÀÆ ºÁ£ïð-PÁèÜÜ Èð Èó
Space For Rough Work

A-1 6 Computer Science

19. Which of the following describes the overloading of functions ?
(A) Virtual polymorphism (B) Transient polymorphism
(C) Ad-hoc polymorphism (D) Pseudo polymorphism
NªÀgï 2ÉÆÃrAUï „Ç·Èó Ç·ÒÈå ’åÛÄó C£ÀÄß ’ðâ˜ÿå Ä™ å ²ìåìæÔåíúÁµåê «ªÀj¸ÀÄvÀÛzÉ ?
(A) ªÀZÀÄåðAiÀÄ2ï ¥Á°ªÀiÁ¦üð¸ÀªÀiï
(B) mÁæ¤A
ì iÀÄAmï ¥Á°ªÀiÁ¦üð¸ÀªÀiï
(C) CqïºÉÆÃPï ¥Á°ªÀiÁ¦üð¸ÀªÀiï
(D) ¸ÀÆåqÉÆà ¥Á°ªÀiÁ¦üð¸ÀªÀiï

20. C++ encourages structuring of software as a collection of components that are

(A) Highly cohesive and loosely coupled.
(B) Not highly cohesive but loosely coupled.
(C) Highly cohesive and tightly coupled.
(D) Not highly cohesive but tightly coupled.
DVgÀĪÀ PÁA¥ÉÆãÉAmïUÀ¼À ¸ÀAUÀæºÀuÉAiÀiÁV vÀAvÁæA±ÀzÀ ¸ÀAgÀZÀ£ÉAiÀÄ£ÀÄß, C++ GvÉÛÃf¸ÀÄvÀÛzÉ
(A) ºÉZÀÄÑ ¸ÀAWÀnvÀ ªÀÄvÀÄÛ ¸Àr® eÉÆÃqÀuÉ
(B) ºÉZÀÄÑ ¸ÀAWÀl£É gÀ»vÀ DzÀgÉ ¸Àr® eÉÆÃqÀuÉ
(C) ºÉZÀÄÑ ¸ÀAWÀnvÀ ªÀÄvÀÄÛ ºÉZÀÄÑ ¨sÀzÀævÉAiÀÄ eÉÆÃqÀuÉ
(D) ºÉZÀÄÑ ¸ÀAWÀl£É gÀ»vÀ DzÀgÉ ¨sÀzÀævÉAiÀÄ eÉÆÃqÀuÉ

21. Given a binary tree, whose inorder and preorder traversal are given by
Inorder : EICFBGDJHK
Preorder : BCEIFDGHJK
The post order traversal of the above binary tree is
¨ÉÊ£Àj ªÀÈPÀëzÀ E£ïDqïðgï ºÁUÀÆ ¥ÉÆøïÖ DqÀðgï mÁæöåªÀ¸Àð2ïUÀ¼ÀÄ F ªÀÄÄA¢£ÀAwzÀÝgÉ :
M¼ÀªÀåªÀ¸ÉÜ : EICFBGDJHK
¥ÀƪÀðªÀåªÀ¸ÉÜ : BCEIFDGHJK
F PɼÀV£À AiÀiÁªÀÅzÀÄ ¨ÉÊ£Àj ªÀÈPÀëzÀ ¥ÉÆøïÖ DqÀðgï mÁæöåªÀ¸Àð2ï DVzÉ ?
(A) IEFCGJKHDB (B) IEFCJGKHDB
(C) IEFCGKJHDB (D) IEFCGJKDBM
Space For Rough Work

Computer Science 7 A-1

22. The number of disk access performed by insertion operation in B - tree of height h is
h JvÀÛgÀzÀ B-ªÀÈPÀëzÀ°è ¸ÉÃj¸ÀĪÀ PÁAiÀiÁðZÀgÀuÉ ªÀÄÄSÁAvÀgÀ r¸ïÌ DQì¸ï£ÀÄß JµÀÄÖ ¨Áj
¤ªÀð»¸À2ÁUÀÄvÀÛzÉ ?
(A) O(1) (B) O(h2)
(C) O(h) (D) O(log(h))

23. The efficient data structure to insert/delete a number in a stored set of number is
(A) Queue (B) Linked list
(C) Doubly linked list (D) Binary tree
¸ÀASÉåUÀ¼À£ÀÄß ±ÉÃRj¹zÀ MAzÀÄ UÀtzÀ°è MAzÀÄ ¸ÀASÉåAiÀÄ£ÀÄß ¸ÉÃj¸À®Ä/
vÉUÉzÀĺÁPÀĪÀÅzÀPÁÌV ¸ÀªÀÄ¥ÀðPÀªÁzÀ zÀvÀÛ ¸ÀAgÀZÀ£É AiÀiÁªÀÅzÀÄ ?
(A) PÀÆå (B) eÉÆÃr¹zÀ ¥ÀnÖ
(C) JgÀqÀÄ ¨Áj eÉÆÃr¹zÀ ¥ÀnÖ (D) ¨ÉÊ£Àj ªÀÈPÀë

24. The minimum number of nodes in a binary tree of depth ‘d’ (root is at level o) is
‘d’ D¼ÀzÀ ¨ÉÊ£Àj ªÀÈPÀëzÀ°è£À PÀ¤µÀÖ £ÉÆÃqïUÀ¼À ¸ÀASÉå JµÀÄÖ ?
(A) 2d – 1 (B) 2d+1 – 1
(C) 2d–1 (D) d + 1

25. The postfix expression AB + CD - * can be evaluated by using

(A) Stack (B) Tree
(C) Queue (D) Linked list
F PɼÀV£À AiÀiÁªÀÅzÀ£ÀÄß §¼À¹PÉÆAqÀÄ ¥ÉÆøïÖ¦Pü ïì JPÀì¥ÉæµÀ£ï AB + CD -*£ÀÄß ªÀiË°åÃPÀj¸À§ºÀÄzÀÄ ?
(A) ¸ÁÖöåPï (B) ªÀÈPÀë
(C) PÀÆå (D) eÉÆÃr¹zÀ ¥ÀnÖ

26. The post order traversal of a binary tree is DEBFCA, then the pre - order traversal is
¨ÉÊ£Àj ªÀÈPÀëzÀ ¥ÉÆøïÖ DqÀðgï mÁæªÀ¸Àð2ï DEBFCA DVzÀÝgÉ, ¦æà DqÀðgï mÁæªÀ¸Àð2ï AiÀiÁªÀÅzÀÄ ?
(A) ABFCDE (B) ADBFEC
(C) ABDECF (D) ABCDEF
Space For Rough Work

A-1 8 Computer Science

27. The inorder traversal of the tree will yield a sorted listing of elements of tree in
(A) Binary tree. (B) Binary search tree.
(C) AVL tree. (D) B+ tree.
F PɼÀV£À AiÀiÁªÀÅzÀgÉƼÀUÉ ªÀÈPÀëzÀ E£ïDqÀðgï mÁæöåªÀ¸Àð2ï ªÀÈPÀëzÀ J°ªÉÄAmïUÀ¼ÀÄ
¸ÁmÉðqï ¥ÀnÖAiÀÄ£ÀÄß ¤ÃqÀÄvÀÛzÉ ?
(A) ¨ÉÊ£Àj ªÀÈPÀë (B) ¨ÉÊ£Àj ±ÉÆÃzsÀ£Á ªÀÈPÀë
(C) AVL ªÀÈPÀë (D) B+ ªÀÈPÀë

28. What is the appropriate data structure for representing hierarchical relationship between
the elements ?
(A) Dequeue. (B) Priority Queue.
(C) Tree. (D) Stack.
CA±ÀUÀ¼À £ÀqÀÄ«£À ±ÉæÃtÂPÀÈvÀ ¸ÀA§AzsÀªÀ£ÀÄß ¤gÀƦ¸ÀĪÀÅzÀPÉÌ ¸ÀªÀÄAd¸ÀªÁzÀ zÀvÀÛ ¸ÀAgÀZÀ£É
AiÀiÁªÀÅzÀÄ ?
(A) rPÀÆå (B) DzÀåvÁ PÀÆå
(C) ªÀÈPÀë (D) ¸ÁÖöåPï

29. The minimum number of interchanges needed to convert the array 89, 19, 14, 40, 17, 12,
10, 2, 5, 7, 11, 6, 9, 70 into a heap with the maximum element at the root is
DgÉæà 89, 19, 14, 40, 17, 12, 10, 2, 5, 7, 11, 6, 9, 70 AiÀÄ£ÀÄß ªÀÄÆ®zÀ°è UÀjµÀÖ
CA±ÀzÉÆA¢UÉ MAzÀÄ gÁ²AiÀiÁV ¥ÀjªÀwð¸À®Ä CUÀvÀåªÁVgÀĪÀ CAvÀg﫤AiÀĪÀÄzÀ
PÀ¤µÀ× ¸ÀASÉå AiÀiÁªÀÅzÀÄ ?
(A) 0 (B) 1
(C) 2 (D) 3

30. A full binary tree with (2n + 1) nodes contain

(A) n leaf nodes (B) n non - leaf nodes
(C) (n – 1) leaf nodes (D) (n – 1) non - leaf nodes
(2n + 1)£ÉÆÃqï£À MAzÀÄ ¸ÀA¥ÀÆtð ¨ÉÊ£Àj ªÀÈPÀëªÀÅ F PɼÀV£À AiÀiÁªÀÅzÀ£ÀÄß ºÉÆA¢gÀÄvÀÛzÉ ?
(A) n °Ã¥sï £ÉÆÃqïUÀ¼ÀÄ (B) n £Á£ï °Ã¥sï £ÉÆÃqïUÀ¼ÀÄ
(C) (n – 1) °Ã¥sï £ÉÆÃqïUÀ¼ÀÄ (D) (n – 1) £Á£ï °Ã¥sï £ÉÆÃqïUÀ¼ÀÄ

Space For Rough Work

Computer Science 9 A-1

31. A special software that is used to create a job queue is called
(A) Drive (B) Spooler
(C) Interpreter (D) Linkage editor
eÁ¨ï PÀÆå C£ÀÄß ¸ÀÈf¸À®Ä §¼À¸ÀĪÀ MAzÀÄ «±ÉõÀ vÀAvÁæA±À AiÀiÁªÀÅzÀÄ ?
(A) qÉæöʪï (B) ¸ÀÆà®gï
(C) EAlgï¦ælgï (D) °APÉÃeï Jrlgï

32. Block or Buffer caches are used to

(A) Improve disk performance.
(B) Handle Interrupts.
(C) Increase the capacity of main memory.
(D) Speed up main memory read operations.
¨ÁèPï CxÀªÁ §¥sÀgï PÁå±ïUÀ¼À£ÀÄß AiÀiÁªÀÅzÀPÁÌV §¼À¸À2ÁUÀÄvÀÛzÉ ?
(A) r¸ïÌ ¤ªÀðºÀuÉAiÀÄ£ÀÄß GvÀÛªÀÄUÉƽ¸À®Ä
(B) CqÀZÀuÉUÀ¼À£ÀÄß ¤ªÀð»¸À®Ä
(C) ªÀÄÄRå ¸ÀäøwAiÀÄ ¸ÁªÀÄxÀðåªÀ£ÀÄß ºÉaѸÀÄvÀÛzÉ
(D) ªÀÄÄRå ¸Àäøw M¢zÀ PÁAiÀiÁðZÀgÀuÉAiÀÄ£ÀÄß ZÀÄgÀÄPÀÄUÉƽ¸ÀÄvÀÛzÉ.

33. A relationship between processes such that each has some point (critical section) which
must not be executed while the critical section of another is being executed is known as
(A) Semaphore (B) Mutual execution
(C) Multiprogramming (D) Message passing
¥ÀæwAiÉÆAzÀÆ, ªÀÄvÉÆÛAzÀgÀ QænPÀ2ï «¨sÁUÀªÀ£ÀÄß ¤ªÀð»¸ÀĪÁUÀ, ¤ªÀð»¸À¨ÁgÀzÁzÀ
PÉ®ªÀÅ ¨sÁUÀ (critical section) UÀ¼À£ÀÄß ºÉÆA¢gÀĪÀ ¥ÀæQæAiÉÄUÀ¼À £ÀqÀÄ«£À ¸ÀA§AzsÀªÀ£ÀÄß
K£ÉAzÀÄ PÀgÉAiÀÄ2ÁUÀÄvÀÛzÉ ?
(A) ¸ÉªÀiÁ¥sÉÆÃgï (B) ¥ÀgÀ¸ÀàgÀ §»µÀÌgÀt
(C) §ºÀÄPÀæªÀÄ«¢ü (D) ¸ÀAzÉñÀ gÀªÁ£É

Space For Rough Work

A-1 10 Computer Science

34. Pre - emptive scheduling is the strategy of temporarily suspending a gunning process
(A) Before the CPU time slices expires.
(B) To allow starving process to run.
(C) When it requests I/O.
(D) To avoid collision.
¦æÃ-JAnªï µÉqÀÆå°AUï M0zÀÄ _________ UÀ¤ßAUï ¥ÀæQæAiÉÄAiÀÄ£ÀÄß vÁvÁÌ°PÀªÁV
¸ÀÜVvÀUÉƽ¸ÀĪÀ vÀAvÀæªÁVzÉ.
(A) CPU mÉʪÀiï ¸Éèöʸï CAvÀåªÁUÀĪÀ ªÉÆzÀ®Ä
(B) PÉÆgÀvÉAiÀÄ°ègÀĪÀ ¥ÀæQæAiÉÄAiÀÄ£ÀÄß £ÀqɸÀ®Ä C£ÀĪÀÄw¸ÀĪÀÅzÀÄ
(C) CzÀÄ I/O £ÀÄß PÉÆÃjPÉÆAqÁUÀ
(D) ¸ÀAWÀµÀðtªÀ£ÀÄß vÀqÉAiÀÄ®Ä

35. In round robin CPU scheduling algorithm as the time quantum increases the average turn
around time
(A) Decreases (B) Increases
(C) Remains constant (D) Varies randomly
gËAqï gÁ©£ï ¹¦AiÀÄÄ µÉqÀÆå°AUï D2ÉÆÎjzÀªÀiï£À°è mÉʪÀiï PÁéAlªÀiï ºÉZÁÑzÀAvÉ
¸ÀgÁ¸Àj l£ïð CgËAqï mÉʪÀiï _________
(A) PÀrªÉÄAiÀiÁUÀÄvÀÛzÉ (B) ºÉZÁÑUÀÄvÀÛzÉ
(C) ¹ÜgÀªÁVgÀÄvÀÛzÉ (D) AiÀiÁzÀÈaÒPÀªÁV ªÀåvÁå¸ÀªÁUÀÄvÀÛzÉ.

36. Consider the following page trace:

4, 3, 2, 1, 4 , 3, 5, 4, 3, 2, 1, 5
Percentage of page fault that would occur if, FIFO page replacement algorithm is used
with number of frames for the JOB m = 4
F PɼÀV£À ¥ÉÃeï mÉæøï : 4, 3, 2, 1, 4, 3, 5, 4, 3, 2, 1, 5£ÀÄß ¥ÀjUÀt¹, FIFO ¥ÉÃeï
jÃ¥ÉèøïªÉÄAmï D2ÉÆÎjzÀªÀiï£ÀÄß JOB m = 4UÉ ¥sÉæêÀiïUÀ¼À ¸ÀASÉåUÀ¼ÉÆA¢UÉ
§¼À¹PÉÆAqÀgÉ ¸ÀA¨sÀ«¸À§ºÀÄzÁzÀ ¥ÉÃeï ¥sÁ2ïÖ£À ±ÉÃPÀqÀªÁgÀÄ K£ÁVgÀÄvÀÛzÉ ?
(A) 8 (B) 9
(C) 10 (D) 12
Space For Rough Work

Computer Science 11 A-1

37. If an instruction takes ‘ i ’, microseconds, a page fault takes an additional ‘ j ’
microseconds and on an average a page fault occur every ‘k’ instruments, then the
effective instruction time is
MAzÀÄ ¸ÀÆZÀ£ÉAiÀÄÄ ‘i’ ªÉÄÊPÉÆæ ¸ÉPÉAqïUÀ¼À£ÀÄß vÉUÉzÀÄPÉÆAqÀgÉ MAzÀÄ ¥ÉÃeï ¥sÁ2ïÖ C¢üPÀ
‘j’ ªÉÄÊPÉÆæøÉPÉAqïUÀ¼À£ÀÄß vÉUÉzÀÄPÉƼÀÄîvÀÛzÉ ªÀÄvÀÄÛ MAzÀÄ ¸ÀgÁ¸Àj ¥ÉÃeï ¥sÁ2ïÖUÉ ¥Àæw ‘k’
¸ÀÆZÀ£ÉUÀ¼ÀÄ ¸ÀA¨sÀ«¸ÀÄvÀÛzÉ, DUÀ ¥ÀjuÁªÀiÁvÀäPÀ E£ïìlæPÀë£ï mÉʪÀiï ________ DVgÀÄvÀÛzÉ.
(A) i+j/k (B) i+j*k
(C) (i+j)/k (D) (i+j)*k
38. The octal number to be given along with ‘chmod’ command to make a file readable,
writable and executable to the owner, readable and executable to group and others is
MAzÀÄ PÀqÀvÀªÀ£ÀÄß ªÀiÁ°ÃPÀ¤UÉ NzÀĪÀAvÉ §gÉAiÀÄĪÀAvÉ ªÀÄvÀÄÛ ¤ªÀð»¸ÀĪÀAvÉ ªÀiÁqÀ®Ä
MAzÀÄ UÀÄA¥ÀÄ ªÀÄvÀÄÛ EvÀgÀjUÉ NzÀĪÀAvÉ ¤ªÀð»¸ÀĪÀAvÉ ªÀiÁqÀ®Ä chmod
DzÉñÀzÉÆA¢UÉ PÉÆÃqÀ¨ÉÃPÁÁµå D’å±2ï ¸ÀASÉå AiÀiÁªÀÅzÀÄ ?
(A) 000 (B) 755
(C) 744 (D) 555
39. ________ checks type field in the file’s inode structure.
(A) Shell (B) Kernel
(C) Compiler (D) Assembler
PÀqÀvÀUÀ¼À L£ÉÆÃqï gÀZÀ£ÉAiÀÄ°è mÉÊ¥ï ¦üÃ2ïØ£ÀÄß _________ ¥Àj²Ã°¸ÀÄvÀÛzÉ.
(A) ±É2ï (B) PÀ£Éð2ï
(C) ¸ÀAPÀ®£À (D) ¸ÀAAiÉÆÃdPÀ
40. Which option will be used with ps command to slow the entire command line of the
process being run ?
MAzÀÄ £ÀqÉAiÀÄÄwÛgÀĪÀ ¥ÀæQæAiÉÄAiÀÄ ¸ÀA¥ÀÆtð DzÉñÀ ¸Á®£ÀÄß ¤zsÁ£ÀUÉƽ¸À®Ä ¦J¸ï
DzÉñÀzÉÆA¢UÉ §¼À¸ÀĪÀ DAiÉÄÌAiÀÄÄ AiÀiÁªÀÅzÀÄ ?
(A) – 4 (B) – f
(C) – l (D) +4
41. Many causes of the software crisis can be traced to mythology based on
(A) Management myth (B) Customer myths
(C) Practitioner myths (D) (A) (B) & (C) are true.
vÀAvÁæA±À ©PÀÌnÖ£À C£ÉÃPÀ PÁgÀtUÀ¼À£ÀÄß _______ ªÉÄÃ2É DzsÁjvÀªÁzÀ ¥ÀÄgÁtzÀ°è
PÁt§ºÀÄzÁVzÉ.
(A) ªÀåªÀºÀgÀt ¥ÀÄgÁtUÀ¼ÀÄ (B) UÁæºÀPÀ ¥ÀÄgÁtUÀ¼ÀÄ
(C) ªÀÈwÛUÁgÀ ¥ÀÄgÁtUÀ¼ÀÄ (D) (A) (B) Ôåê¼åê¾ (C) ˜µâ
å ÿåê ÜÈ²å ™
Space For Rough Work

A-1 12 Computer Science

42. _______ is an “umbrella” activity that is applied throughout the software engineering
process.
(A) Debugging (B) Tasking
(C) Designing (D) Software quality assurance
_________ MAzÀÄ vÀAvÁæA±À JAf¤AiÀÄjAUï ¥ÀæQæAiÉÄAiÀÄ GzÀÝPÀÆÌ C£Àé¬Ä¸ÀĪÀ
“CA¨Éæ2Áè” ZÀlĪÀnPÉAiÀiÁVzÉ.
(A) r§VÎAUï (B) ¥ÀjÃPÉë ªÀiÁqÀĪÀÅzÀÄ
(C) «£Áå¸ÀUÉƽ¸ÀĪÀÅzÀÄ (D) vÀAvÁæA±ÀzÀ UÀÄtªÀÄlÖzÀ RavÀvÉ

43. In estimating the software cost the Lines of Code (LOC) and Function Point (FP) are used
to measure what ?
(A) Length of code (B) Size of software
(C) Functionality of s/w (D) Both (A) and (B) are true
vÀAvÁæA±ÀzÀ ªÉZÀѪÀ£ÀÄß CAzÁdÄUÉƽ¸ÀĪÀ°è 2ÉÊ£ïì D¥sï PÉÆÃqï(LOC) ºÁUÀÆ ¥sÀAPÀë£ï
¥Á¬ÄAmï (FP) UÀ¼À£ÀÄß AiÀiÁªÀÅzÀ£ÀÄß C¼ÀvɪÀiÁqÀ®Ä §¼À¸À2ÁUÀÄvÀÛzÉ ?
(A) ¸ÀAPÉÃvÀzÀ GzÀÝ (B) vÀAvÁæA±ÀzÀ UÁvÀæ
(C) s/w £À PÁAiÀÄ𠤪ÀðºÀuÉ (D) (A) ªÀÄvÀÄÛ (B) JgÀqÀÆ ¸Àj
44. What is the equivalence partitioning method that divides the input domain of a program
into classes of the data from which task case can be derived ?
(A) White box testing (B) Black box testing
(C) Orthogonal array testing (D) Stress testing
MAzÀÄ PÀæªÀÄ«¢üAiÀÄ HrPÉ ªÁå¦ÛAiÀÄ£ÀÄß, mÁ¸ïÌ PÉøïUÀ¼À£ÀÄß vÀAiÀiÁj¸À§ºÀÄzÁzÀ zÀvÀÛzÀ
PÁè¸ïUÀ¼À£ÀÄß «AUÀr¸ÀĪÀ FQéªÀ2É£ïì ¥ÁnðµÀ¤AUï «zsÁ£À AiÀiÁªÀÅzÀÄ ?
(A) ªÉÊmï ¨ÁPïì ¥ÀjÃPÉë (B) ¨ÁèöåPï ¨ÁPïì ¥ÀjÃPÉë
(C) DxÁðUÀ£À2ï DgÉà ¥ÀjÃPÉë (D) ¸ÀÖç¸ï ¥ÀjÃPÉë
45. In a function oriented design
(A) Cohesion and coupling are minimised.
(B) Cohesion and coupling are maximised.
(C) Cohesion minimised and coupling are maximised.
(D) Cohesion maximised and coupling are minimised.
MAzÀÄ PÁAiÀiÁð¨sÁgÀ ¸ÀA§A¢üvÀ «£Áå¸ÀzÀ°è _________
(A) ¸ÀAWÀl£É ªÀÄvÀÄÛ eÉÆÃqÀuÉUÀ¼ÀÄ PÀÄUÀÄÎvÀÛªÉ
(B) ¸ÀAWÀl£É ªÀÄvÀÄÛ eÉÆÃqÀuÉUÀ¼ÀÄ »UÀÄÎvÀÛªÉ
(C) ¸ÀAWÀl£ÉAiÀÄÄ PÀÄUÀÄÎvÀÛzÉ ªÀÄvÀÄÛ eÉÆÃqÀuÉUÀ¼ÀÄ »UÀÄÎvÀÛzÉ
(D) ¸ÀAWÀl£ÉAiÀÄÄ »UÀÄÎvÀÛzÉ ªÀÄvÀÄÛ eÉÆÃqÀuÉUÀ¼ÀÄ PÀÄUÀÄÎvÀÛªÉ
Space For Rough Work

Computer Science 13 A-1

46. A process model that removes defects before they can precipitate serious hazards is
(A) Incremental model
(B) Spiral model
(C) Clean room software engineering
(D) Agile model
UÀA©üÃgÀªÁzÀ CqÀôåuÉUÀ¼À£ÀÄßAlĪÀiÁqÀĪÀ ªÉÆzÀ2Éà zÉÆõÀUÀ¼À£ÀÄß vÉUÉzÀĺÁPÀĪÀ ¥ÀæQæAiÀiÁ
ªÀiÁzÀj :
(A) E£ïQÔðêAl2ï ªÀiÁzÀj
(B) ¸ÉàöÊgÀ2ï ªÀiÁzÀj
(C) Qèãï gÀƪÀiï ¸Á¥sïÖªÉÃgï JAf¤AiÀÄjAUï
(D) JeÉÊ2ï ªÀiÁzÀj

47. Software safety is a _________ activity that focuses on the identification and assessment
of potential hazards that may affect software negativity and cause an entire system to fail.
(A) Risk mitigation, monitoring and management
(B) Software quality assurance
(C) Software cost estimation
(D) Defect removal efficiency
vÀAvÁæA±À ¸ÀÄgÀPÀëvÉ, EzÀÄ vÀAvÁæA±À £ÀPÁgÁvÀäPÀvÉ ªÀÄvÀÄÛ MAzÀÄ ¸ÀA¥ÀÆt𠹸ÀÖªÀiï£À
«¥sÀ®ªÁUÀÄ«PÉAiÀÄ ªÉÄÃ2É ¥ÀjuÁªÀÄ ©ÃgÀĪÀ ¸ÀªÀÄxÀð CqÀZÀuÉUÀ¼À UÀÄgÀÄw¸ÀÄ«PÉ ªÀÄvÀÄÛ
ªÀiË°åÃPÀgÀtzÀ ªÉÄÃ2É UÀªÀÄ£À«j¸ÀĪÀ MAzÀÄ ________ ZÀlĪÀnPÉAiÀiÁVzÉ.
(A) j¸ïÌ «ÄnUÉñÀ£ï, ªÀiÁ¤ljAUï, ªÀiÁå£ÉÃeïªÉÄAmï
(B) ¸Á¥sïÖªÉÃgï PÁé°n C¸ÀÄìgÀ£ïì
(C) ¸Á¥sïÖªÉÃgï PÁ¸ïÖ J¹ÖªÉÄñÀ£ï
(D) r¥sÉPïÖ jªÀÄƪÀ2ï J¦ü²AiÀĤì

48. On an average the programmer months(pm) is given by 3.6 * (KLOC)12. If so, a project
requiring one thousand sources instructions will require
3.6 * (KLOC)12 £À ªÀÄÆ®PÀ ¥ÉÆæÃUÁæªÀÄgï ªÀÄAvïì(pm) £ÀÄß ¤ÃqÀ2ÁVzÉ, ºÁUÁzÀgÉ MAzÀÄ
¸Á«gÀ DPÀgÀ ¸ÀÆZÀ£ÉUÀ¼À CªÀ±ÀåPÀvɬÄgÀĪÀ MAzÀÄ ¥ÁæeÉPïÖ _______ £ÀÄß PÉÆÃgÀÄvÀÛzÉ.
(A) 3.6 pm (B) 0.36 pm
(C) 0.0036 pm (D) 7.23 pm

Space For Rough Work

A-1 14 Computer Science

49. A relation of COCOMO model is
F PɼÀV£À AiÀiÁªÀÅzÀÄ COCOMO ªÀiÁzÀjAiÀÄ ¸ÀA§AzsÀªÁVzÉ ?
(A) E=a*(KLOC)6 (B) E=a*(KLOC)5
(C) E=a*(KLOC)7 (D) E=a*(KLOC)3

50. If the number of conditions in a decision table is n, then maximum number of rules
(Column) is possible is
MAzÀÄ ¤tðAiÀÄ ¥ÀnÖAiÀÄ°è µÀgÀvÀÄÛUÀ¼À ¸ÀASÉåAiÀÄÄ n DVzÀÝgÉ, ¤AiÀĪÀÄ(column) UÀ¼À
¸ÀA¨sÀªÀ¤ÃAiÀÄ UÀjµÀÖ ¸ÀASÉåAiÀÄÄ
(A) n (B) 2n
(C) 2n (D) log2n

51. For a database relation R(a,b,c,d), where domain of a,b,c,d include only the atomic values
the functional dependency a
c, b
d holds in the following relation in
a,b,c,d AiÀÄ PÁAiÀÄðPÉëÃvÀæªÀÅ DmÉÆëÄPï ªÀiË®åUÀ¼À£ÀÄß ªÀiÁvÀæ M¼ÀUÉÆArgÀĪÀ zÀvÁÛA±À
¸ÀA§AzsÀ R(a,b,c,d)UÉ, PÁAiÀÄðzÀ CªÀ®A§£É a
c, b
d AiÀÄÄ F PɼÀV£À AiÀiÁªÀÅzÀgÉƼÀUÉ
ºÉÆA¢gÀÄvÀÛzÉ ?
(A) 1NF not in 2NF (B) 2NF not in 3NF
(C) 3NF (D) 1NF

52. B+ tree is preferred to binary tree in database, because

(A) Disk capacity are greater than memory capacities.
(B) Disk access is much lower than memory access.
(C) Disk data transfer rates are much less than memory data transfer rate.
(D) Disk are more reliable than memory.
B+ ªÀÈPÀëPÉÌ ¨ÉÊ£Àj ªÀÈPÀëQÌAvÀ zÀvÁÛA±ÀzÀ°è DzsÀåvɬÄzÉ, KPÉAzÀgÉ :
(A) r¸ïÌ ¸ÁªÀÄxÀåðªÀÅ ªÉĪÀÄj ¸ÁªÀÄxÀåðQÌAvÀ ºÉZÁÑVzÉ
(B) r¸ïÌ DPÉì¸ï EzÀÄ ªÉĪÀÄj DPÉì¸ïVAvÀ ¤zsÁ£ÀªÁVzÉ
(C) r¸ïÌ zÀvÀÛzÀ ªÀUÁðªÀuÉ zÀgÀªÀÅ ªÉĪÀÄj zÀvÀÛ ªÀUÁðªÀuÉAiÀÄ zÀgÀQÌAvÀ §ºÀ¼À
PÀrªÉÄAiÀiÁVzÉ
(D) r¸ïÌUÀ¼ÀÄ ªÉĪÉÆjUÀ½VAvÀ §ºÀ¼ÀµÀÄÖ £ÀA©PÉUÉ CºÀðªÁVgÀÄvÀÛzÉ.

Space For Rough Work

Computer Science 15 A-1

53. Which of the following is true ?
(A) A relation in BCNF is always in 3NF.
(B) A relation in 3CNF is always in BCNF.
(C) BCNF and 3NF are same.
(D) A relation in BCNF is not in 3NF.
F PɼÀV£ÀªÀÅUÀ¼À°è AiÀiÁªÀÅzÀÄ ¸ÀjAiÀiÁVzÉ ?
(A) BCNF £À°è£À ¸ÀA§AzsÀªÀÅ 3NF £À°è AiÀiÁªÁUÀ®Æ EgÀÄvÀÛzÉ
(B) 3CNF £À°è£À ¸ÀA§AzsÀªÀÅ BCNF £À°è AiÀiÁªÁUÀ®Æ EgÀÄvÀÛzÉ
(C) BCNF ªÀÄvÀÄÛ 3NF UÀ¼ÀÄ MAzÉà DVgÀÄvÀÛªÉ
(D) BCNF £À°ègÀĪÀ ¸ÀA§AzsÀªÀÅ 3NF £À°è E®è

54. If in a tree, for every node the height of its left subtree and, right subtree differ almost by
one then the tree is
(A) Binary search tree (B) AVL tree
(C) Threaded tree binary tree (D) Complete binary tree.
MAzÀÄ ªÀÈPÀëzÀ°è ¥Àæw £ÉÆÃqïUÉ JqÀUÀqÉAiÀÄ ªÀÄvÀÄÛ §®UÀqÉAiÀÄ G¥ÀªÀÈPÀëUÀ¼À JvÀÛgÀªÀÅ ¸ÀASÉå
1 gÀµÀÄÖ ªÀåvÁå¸À«zÀÝgÉ, D ªÀÈPÀëªÀÅ
(A) ¨ÉÊ£Àj ¸ÀZïð næà (B) AVL næÃ
(C) vÉæqÉqï næà ¨ÉÊ£Àj næà (D) PÀA¦èÃmï ¨ÉÊ£Àj næÃ

55. How many character per second (7 bits +1 parity) can be transmitted over a 2400 bps line
in case of synchronous data transfer ?
JµÀÄÖ CPÀëgÀUÀ¼À£ÀÄß ¥Àæw ¸ÉPÀArUÉ (7bits + 1 parity)UÉ 2400 bps 2ÉÊ£ï£À°è ¹APÉÆæãÉʸï
zÀvÀÛ ªÀUÁðªÀuÉAiÀÄ°è ªÀUÁð¬Ä¸À§ºÀÄzÀÄ ?
(A) 300 (B) 240
(C) 250 (D) 275

56. Decryption and encryption of data are responsibility of

(A) Physical layer (B) Data link layer
(C) Presentation layer (D) Session layer
rQæ¥Àë£ï ªÀÄvÀÄÛ J£ïQæ¥Àë£ï zÀvÀÛ AiÀiÁªÀÅzÀPÉÌ dªÁ¨ÁÝj ?
(A) ¦üfPÀ2ï 2ÉÃAiÀÄgï (B) qÁmÁ °APï 2ÉÃAiÀÄgï
(C) ¥ÀæeÉAmÉñÀ£ï 2ÉÃAiÀÄgï (D) ¸É±Àê£ï 2ÉÃAiÀÄgï
Space For Rough Work

A-1 16 Computer Science

57. Which of the following are session layer check points ?
(A) Allow just a partition of a file to be resent.
(B) Detect and recover errors.
(C) Control and addition of headers.
(D) Are involved in dialog control.
PɼÀV£À AiÀiÁªÀÅzÀÄ ¸É±Àê£ï2ÉÃAiÀÄgï ZÉPï ¥Á¬ÄAmïìUÀ¼ÁVzÉ ?
(A) PÉêÀ® MAzÀÄ PÀqÀvÀzÀ ¨sÁUÀªÀ£ÀÄß ªÀÄgÀ½ PÀ¼ÀÄ»¸À®Ä C£ÀĪÀÄw¸ÀĪÀÅzÀÄ
(B) vÀ¥Àà£ÀÄß PÀAqÀÄ»rAiÀÄĪÀÅzÀÄ ªÀÄvÀÄÛ ¸Àj ªÀiÁqÀĪÀÅzÀÄ
(C) ºÉqÀgïìUÀ¼À eÉÆÃqÀuÉ ªÀÄvÀÄÛ ¤AiÀÄAvÀæt ªÀiÁqÀĪÀÅzÀÄ
(D) ¸ÀA¨sÁµÀuÉ ¤AiÀÄAvÀætzÉƼÀUÉ M¼ÀUÉƼÀîÑn É ÖgÀÄvÀÛªÉ

58. What is the maximum size of data that the application layer can pass on to the TCP layer ?
(A) Any size (B) 216 bytes
(C) Size of TCP header (D) 1500 bytes
C¦èèPÉõÀ£ï 2ÉÃAiÀÄgï TCP 2ÉÃAiÀÄgïUÉ PÀ¼ÀÄ»¸À§ºÀÄzÁzÀ qÁmÁzÀ UÀjµÀ× UÁvÀæªÀÅ
(A) AiÀiÁªÀÅzÉà UÁvÀæ¢gÀ§ºÀÄzÀÄ
(B) 216 ¨ÉÊmïìUÀ¼ÁVgÀ§ºÀÄzÀÄ
(C) TCP ºÉqÀgï UÁvÀæzÀ¶ÖgÀ§ºÀÄzÀÄ
(D) 1500 ¨ÉÊmïìUÀ¼ÁVgÀ§ºÀÄzÀÄ

59. FDDI stands for

(A) Fibre Distributed Data Interface
(B) Fully Distributed Device Interface
(C) Frequency Data Digital Interface
(D) Fibre Data Device Interconnection
FDDI JAzÀgÉ
(A) ¥sÉʧgï r¹Öç§ÆåmÉqï qÁmÁ EAlgï¥sÉøï
(B) ¥sÀÄ°è r¹Öç§ÆåmÉqï rªÉʸï EAlgï¥sÉøï
(C) ¦üæÃPÉé¤ì qÁmÁ rfl2ï EAlgï¥sÉøï
(D) ¥sÉʧgï qÁmÁ rªÉʸï EAlgïPÀ£ÉPÀë£ï
Space For Rough Work

Computer Science 17 A-1

60. The delay that occur during the playback of a stream is called
(A) Stream delay (B) Play back delay
(C) Filter (D) Event delay
¹ÖçêÀiï£À ¥Éèà ¨ÁåPï ¸ÀAzÀ¨sÀðzÀ°è «¼ÀA§ªÁUÀĪÀÅzÀPÉÌ K£ÉAzÀÄ PÀgÉAiÀÄÄvÁÛgÉ ?
(A) ¹ÖçêÀiï «¼ÀA§ (B) ¥Éèà ¨ÁåPï «¼ÀA§
(C) ¦üѱgï (D) FªÉAmï «¼ÀA§

61. A binary relation R = {(1,1),(2,1),(2,2),(2,3), (2,4), (3,1),(3,2), (3,3), (3,4)} on the set
A = {1,2,3,4} is
(A) reflexive symmetric and transitive
(B) neither reflexive nor irreflexive but transitive
(C) irreflexive anti-symmetric
(D) irreflexive symmetric and transitive.
¨ÉÊ£Àj j2ÉõÀ£ï R={(1,1),(2,1),(2,2),(2,3)(2,4),(3,1),(3,2),(3,3),(3,4)}ªÀÅ ˜µ¸ å A={1,2,3,4}
zÀ ªÉÄÃ2É ªÁåSÁ夹zÁUÀ PɼÀV£À AiÀiÁªÀÅzÀ£ÀÄß vÀȦۥÀr¸ÀÄvÀÛzÉ ?
(A) j¥sÉèQìªï, ¹«ÄnæPï „ÏAqï mÁæ¤ìnªï
(B) j¥sÉèQìªï C®è, Egïj¥sÉèQìªï C®è DzÀgÉ mÁæ¤ìnªï DVgÀÄvÀÛzÉ
(C) Egïj¥sÉèQìªï, DAn ¹«ÄnæPï
(D) Egïj¥sÉèQìªï, ¹«ÄnæPï „ÏAqï mÁæ¤ìnªï

62. The proposition p^(~p v q) is

(A) A tautology (B) A contradiction
(C) Logically equivalent to p^q (D) both (A) and (B) are true
¥Àæw¥ÁzÀ£É p^(~p v q) UÉ PɼÀV£À AiÀiÁªÀÅzÀÄ ¸ÀjAiÀiÁVzÉ ?
(A) mËmÉÆÃ2Áf
(B) PÁAnærPÀë£ï
(C) p^q UÉ 2ÁfPÀ°Ã FQéªÉ2ÉAmï
(D) (A) ªÀÄvÀÄÛ (B) JgÀqÀÆ ¸Àj

63. In propositional logic which of the following is equivalent to p→q ?

¥Àæ¸ÁÛ¦vÀ vÀPÀðzÀ°è F PɼÀV£À AiÀiÁªÀÅzÀÄ p→q ˜µð ¸ÀªÀĪÁVzÉ ?
(A) ~p → q (B) ~ p v q
(C) ~p v ~q (D) p→~q
Space For Rough Work

A-1 18 Computer Science

64. Which of the following is a declaration statement ?
(A) It is beautiful.
(B) He says “It is correct”.
(C) Two may not be an even integer.
(D) I love you.
F PɼÀV£À AiÀiÁªÀÅzÀÄ rPÉègÉõÀ£ï ¸ÉÖÃmïªÉÄAmï DVzÉ ?
(A) Emï E¸ï §Æån¥sÀÄ2ï
(B) »Ã ¸ÉÃÜÈó “Emï E¸ï PÀgÉPïÖ”
(C) lÆ ªÉÄà £Ámï ©Ã D£ï EªÀ£ï EAndgï
(D) L ®ªï AiÀÄÆ

65. (G,*) is an abelian group, then

(A) x=x –1 belongs to G, for any x.
(B) x=x2 belongs to G, for any x.
(C) (x*y)2= x2 * x2 belongs to G, for any x and y.
(D) G is of finite order.
(G,*) ªÀÅ J©°AiÀÄ£ï UÀÆæ¥ï DzÀgÉ
(A) AiÀiÁªÀÅzÉà x UÉ x=x –1 ªÀÅ G AiÀÄ°ègÀÄvÀÛzÉ
(B) AiÀiÁªÀÅzÉà x UÉ x=x2 ªÀÅ G AiÀÄ°ègÀÄvÀÛzÉ
(C) AiÀiÁªÀÅzÉà x ªÀÄvÀÄÛ y UÉ (x*y)2= x2 * x2 ªÀÅ G AiÀÄ°ègÀÄvÀÛzÉ
(D) G ªÀÅ ¥Àj«ÄvÀ PÀæªÀĪÁVgÀÄvÀÛzÉ.

66. How many distinguishable permutation can be generated from a word “BANANA” ?
“BANANA” JA§ ¥ÀzÀ¢AzÀ JµÀÄÖ ¨ÉÃgÉ ¨ÉÃgÉ PÀæªÀÄ eÉÆÃqÀuÉUÀ¼À£ÀÄß GvÀàwÛ¸À§ºÀÄzÀÄ ?
(A) 720 (B) 60
(C) 240 (D) 120

67. The term 2+5+8+…….+(3n-1) is equal to

2+5+8+…….+(3n-1) ÜÈÒ
å ¦ÿðö˜âµå ÿåê …Áµ’å ð” ÜÈÔ
å åêÔæÁµÁ
å µåêÂ
(A) (n2 –1)/2 (B) n(n+1)/2
(C) n(3n+1)/2 (D) n(3n-1)/2

Space For Rough Work

Computer Science 19 A-1

68. The 2-D translation equation in the matrix form P is equal to
ªÀiÁånæPïì gÀZÀ£ÉAiÀÄ°è£À 2-r mÁæ£Àì2ÉõÀ£ï FPÉéõÀ£ï ‘P’ AiÀÄÄ AiÀiÁªÀÅzÀ’ð” ÜÈÔ
å åê ?
(A) P+T (B) P–T
(C) P*T (D) P

69. All the hidden surface algorithms employee image space approach except which one of
the flowing method ?
(A) Back space removal (B) Depth buffer
(C) Scan line (D) Depth sort
J2Áè »qÀ£ï ¸À¥sÉðøï D2ÉÆÎjzsÀªÀiïUÀ¼ÀÄ PɼÀV£À AiÀiÁªÀ «zsÁ£ÀzÀ ºÉÆgÀvÁV EªÉÄÃeï
¸Éàøï C¥ÉÆæÃZÀ£ÀÄß C¼ÀªÀr¸ÀÄvÀÛzÉ ?
(A) ¨ÁåPï ¸Éàøï jªÀÄƪÀ2ï (B) qÉ¥ïÛ §¥sÀgï
(C) ¸ÁÌöå£ï 2ÉÊ£ï (D) qÉ¥ïÛ ¸Ámïð

70. Oblique projection with an angle of 45° to horizontal plane is called as

(A) Cabinait projection (B) Isometric projection
(C) Cavalier projection (D) Diagonal projection
F PɼÀV£À AiÀiÁªÀÅzÀÄ CqÀØ ¸ÀªÀÄvÀ¼ÀPÉÌ 45° PÉÆãÀzÀ C©èPÀÆå (oblique) ¥ÉÆæÃeÉPÀë£ï DVzÉ ?
(A) PÁ婤AiÉÄÃmï ¥ÉÆæeÉPÀë£ï (B) L¸ÉÆêÉÄnæPï ¥ÉÆæeÉPÀë£ï
(C) PÉ«°AiÀÄgï ¥ÉÆæeÉPÀë£ï (D) qÀAiÀiÁUÀ£À2ï ¥ÉÆæeÉPÀë£ï

71. What is the prototype of the default constructor for public class test() ?
public class test() EzÀgÀ°è r¥sÁ2ïÖ PÀ£ïìlæPÀÖgï£À ¥ÉÆæmÉÆÃmÉÊ¥ï AiÀiÁªÀÅzÀÄ ?
(A) test () (B) test (void)
(C) public test () (D) public test (void)

72. Which of the following method belongs to thread class ?

PɼÀV£À AiÀiÁªÀ «zsÁ£ÀªÀÅ xÉæqï PÁè¹UÉ ¸ÀA§A¢ü¹zÉ ?
(A) wait() (B) join()
(C) notify() (D) sleep()
Space For Rough Work

A-1 20 Computer Science

73. What is the priority of the garbage collector thread of the JDK ?
(A) Low priority (B) Highest priority
(C) Median priority (D) Decided at run time
eÉrPÉAiÀÄ UÁgÉâÃeï PÀ2ÉPÀÖgï xÉæqïÄå DzÀåvÉ AiÀiÁªÀÅzÀÄ ?
(A) PÀrªÉÄ DzÀåvÉ (B) ºÉaÑ£À DzÀåvÉ
(C) ªÀÄzsÀåªÀÄ DzÀåvÉ (D) gÀ£ï ªÉüÉAiÀÄ°è ¤UÀ¢ ¥Àr¸ÀĪÀÅzÀÄ

74. Which one of the following method is used to obtain values of invoking object as a long ?
PɼÀV£À AiÀiÁªÀ «zsÁ£ÀÔåÄåêÆ E£ïªÉÇÃQAUï D¨ÉÓPïÖ Då¸ï J 2ÁAUï JA§ÄzÀgÀ
ªÀiË®åªÀ£ÀÄß PÀAqÀÄ»rAiÀÄ®Ä G¥ÀAiÉÆÃV¸ÀÄvÁÛgÉ ?
(A) long value() (B) longlongValue()
(C) Long longvalue() (D) LongLongvalue()

75. Multimedia system require hard real time scheduling to

(A) ensure critical tasks will be serviced within timing deadlines
(B) deliver the media file to the client
(C) minimize the delay
(D) ensure security
K£À£ÀÄß RavÀ ¥Àr¸À®Ä ªÀÄ°Ö«ÄÃrAiÀiÁ ¹¸ÀÖªÀiïUÉ ºÁqïð jÃAiÀÄ2ï mÉʪÀiï µÉqÀÆå°AUï
¨ÉÃPÁUÀÄvÀÛzÉ ?
(A) QænPÀ2ï mÁ¸ïÌUÀ¼À£ÀÄß ¤UÀ¢vÀ ¸ÀªÀÄAiÀÄzÀ°èAiÉÄà ¥ÀÆtðUÉƽ¸ÀĪÀÅzÀÄ
(B) «ÄÃrAiÀiÁ ¥sÉÊ2ï£ÀÄß PÉèöÊAnUÉ ¸ÀgÀ§gÁdÄ ªÀiÁqÀĪÀÅzÀ£ÀÄß
(C) «¼ÀA§ªÀ£ÀÄß PÀrªÉÄ ªÀiÁqÀ®Ä
(D) gÀPÀëuÉAiÀÄ£ÀÄß

76. MIDI stand for ________.

(A) Musical Instrument Digital Interface
(B) Musical Instrument Digital Instruction
(C) MP3 Instrument Digital Interface
(D) Musical Instrument Design Interface
MIDI JAzÀgÉ :
(A) ªÀÄÆå¨PÀ2ï E£ïìlÄæªÉÄAmï rfl2ï EAlgï¥sÉøï
(B) ªÀÄÆå¨PÀ2ï E£ïìlÄæªÉÄAmï rfl2ï E£ïìlæPÀë£ï
(C) MP3 E£ïìlÄæªÉÄAmï rfl2ï EAlgï¥sÉøï
(D) ªÀÄÆå¨PÀ2ï E£ïìlÄæªÉÄAmï r¸ÉÊ£ï EAlgï¥sÉøï
Space For Rough Work

Computer Science 21 A-1

77. Which of the keyword can be used inside any method to refer to the current object?
(A) new (B) delete
(C) finalize (D) this
AiÀiÁªÀÅzÉà ¥ÀzÀÝwAiÉƼÀUÉ PÀgÉAmï D¨ÉÓPïÖ£ÀÄß G2ÉèÃT¸À®Ä AiÀiÁªÀ Qà ªÀqïð
G¥ÀAiÉÆÃV¸ÀÄvÁÛgÉ ?
(A) £ÀÆå (B) r°mï
(C) ¥sÉÊ£À2Éʸï (D) ¢¸ï

78. Which of the following is TRUE only for XML but not for HTML ?
(A) Derived from SGML.
(B) Describes control and layout.
(C) Allows user defined tags.
(D) Restricted only to be used with web browser.
PɼÀV£À AiÀiÁªÀÅzÀÄ JPïìJAJ2ïUÉ ªÀiÁvÀæ ¸ÀjAiÀiÁVzÉ DzÀgÉ ºÉZïnJAJ2ïUÉ
¸ÀA§A¢ü¹gÀĪÀÅ¢®è ?
(A) SGML ¤AzÀ rgÉʪïØ DVzÉ
(B) EzÀÄ PÀAmÉÆæÃ2ï ªÀÄvÀÄÛ 2ÉÃOmïUÀ¼À£ÀÄß «ªÀj¸ÀÄvÀÛzÉ
(C) EzÀÄ AiÀÄÆdgï r¥sÉÊ£Àqï mÁåUïì£ÀÄß C£ÀĪÀÄw¸ÀÄvÀÛzÉ.
(D) EzÀÄ ªÉ¨ï ¨Ëædgï£ÉÆA¢UÉ ªÀiÁvÀæ G¥ÀAiÉÆÃV¸À®Ä ¤§ðA¢ü¸À®ànÖgÀÄvÀÛzÉ.

79. The XML DOM object is

(A) anentity (B) anentity reference
(C) acomment reference (D) acomment data
XML DOM D¨ÉÓPïÖªÀÅ PɼÀV£À AiÀiÁªÀÅzÀÄ ?
(A) JAnn (B) JAnn gÉ¥sÀgÀ£ïì
(C) PÁªÉÄAmï gÉ¥sÀgÉ£ïì (D) PÁªÉÄAmï qÁmÁ

80. Which JavaScript features uses JAR files ?

(A) Stylesheets (B) Object signing
(C) Netcaster channels (D) Image rollovers
eÁgï PÀqÀvÀUÀ¼À£ÀÄß AiÀiÁªÀ eÁªÁ ÜÝ”ø¥ïÖ ¦üÃZÀgïUÀ¼ÀÄ §¼À¹PÉƼÀÄîvÀÛzÉ ?
(A) ¸ÉÖöÊ2ï ²Ãmïì (B) C¨ÉÓPïÖ ¸ÉʤAUï
(C) £ÉmïPÁ¸ÀÖgï ôæÄðÑóÞ (D) EªÉÄÃeï gÉÆÃ2ïMªÀgïì
Space For Rough Work

A-1 22 Computer Science

81. Computing the binomial coefficient nCr is an application of
(A) Divide and conquer techniques
(B) Decrease and conquer techniques
(C) Transform and conquer techniques
(D) Dynamic programming techniques
¨ÉÊ£ÉÆëÄAiÀÄ2ï PÉÆÃJ¦ü²AiÉÄAmï nCr C£ÀÄß PÀAqÀÄ»rAiÀÄĪÀÅzÀÄ ________ C¦èPÉñÀ£ï
DVzÉ.
(A) rªÉÊqï ªÀÄvÀÄÛ PÁ£ÀÌgï vÀAvÀæUÀ¼À
(B) rQæÃ¸ï ªÀÄvÀÄÛ PÁ£ÀÌgï vÀAvÀæUÀ¼À
(C) mÁæ£ïì¥sÁÔåìóð ªÀÄvÀÄÛ PÁ£ÀÌgï vÀAvÀæUÀ¼À
(D) qÉÊ£Á«ÄPï ¥ÉÆæÃUÁæ«ÄAUï vÀAvÀæUÀ¼À

82. The worst case time complexity of the sorting algorithm by using divide- and -conquer is
rªÉÊqï ªÀÄvÀÄÛ PÁ£ÀÌgï ¥ÀzÀÞwAiÀÄ£ÀÄß G¥ÀAiÉÆÃV¹PÉÆAqÀÄ PÀæªÀĪÁV eÉÆÃr¸ÀĪÀ
C2ÉÆÎÃjzsÀªÀiï £À QèÚÈå± ¸ÀªÀÄAiÀÄzÀ vÉÆqÀPÀÄ AiÀiÁªÀÅzÀÄ ?
(A) Ο(n log n) (B) Ο(n3)
(C) Ο(n2 log n) (D) Ο(log n)

83. The application of transform-and-conquer technique is

(A) Merge sort for sorting a list
(B) Gauss Elimination for solving the system of equations
(C) All pairs shortest path
(D) Minimum spanning tree
mÁæ£ïì¥sÁÔåìóð ªÀÄvÀÄÛ PÁ£ÁÌ÷éAiÀÄgï vÀAvÀæzÀ C¦èPÉñÀ£ï
(A) ªÀÄeïð ¸Ámïð ¥sÁgï ¸ÁnðAUï J °¸ïÖ
(B) FPÉéñÀ£ï ¥ÀzÀÞwAiÀÄ£ÀÄß ¥ÀjºÀj¸À®Ä UÁ¸ï J°«Ä£ÉñÀ£ï
(C) D2ï ¥ÉÃgïì ±ÁmÉð¸ïÖ ¥Áxï
(D) ÕêÅÔåêÔåìó ÜÈéðÉ ÅÒ˜µó °Ðé
Space For Rough Work

Computer Science 23 A-1

84. The travelling salesman problem can be solved in
(A) Polynomial time using dynamic programming
(B) Polynomial time using branch and bound techniques
(C) Exponential time using dynamic programming/branch and bound techniques
(D) Exponential time using back tracking
¥ÀæªÁ¹ ªÀiÁgÁlUÁgÀ£À ¸ÀªÀĸÉåAiÀÄ£ÀÄß ¥ÀjºÁgÀ ªÀiÁqÀ®Ä
(A) qÉÊ£Á«ÄPï ¥ÉÆæUÁæ«ÄAUï §¼À¹PÉÆAqÀÄ ¥Á°£Á«ÄAiÀÄ2ï ¸ÀªÀÄAiÀÄ
G¥ÀAiÉÆÃV¹zÁUÀ ¨ÉÃPÁUÀÄvÀÛzÉ
(B) ¨ÁæöåAZï ªÀÄvÀÄÛ ¨ËAqï vÀAvÀæ §¼À¹PÉÆAqÀÄ ¥Á°£Á«ÄAiÀÄ2ï ¸ÀªÀÄAiÀÄ
G¥ÀAiÉÆÃV¹zÁUÀ ¨ÉÃPÁUÀÄvÀÛzÉ
(C) qÉÊ£Á«ÄPï ¥ÉÆæUÁæ«ÄAUï / ¨ÁæöåAZï ªÀÄvÀÄÛ ¨ËAqï ¼åÒ¼åИâ
µå Äÿå åêÆ §¼À¹PÉÆAqÀÄ
J’óÞ¥ÉƣɤìAiÀÄ2ï ¸ÀªÀÄAiÀÄ ¨ÉÃPÁUÀÄvÀÛzÉ
(D) ¨ÁåPï mÁæQAUï §¼À¹PÉÆAqÀÄ J’óÞ¥ÉƣɤìAiÀÄ2ï ¸ÀªÀÄAiÀÄ ¨ÉÃPÁUÀÄvÀÛzÉ

85. Given 0 – 1 knapsack problem and fractional knapsack problem and the following
statements:
S1: 0 – 1 knapsack is efficiently solved by using Greedy algorithm.
S2: Fractional knapsack is efficiently solved using by dynamic programming.
Which of the following is true?
(A) S1 is correct and S2 is not correct
(B) S1 and S2 both are correct
(C) S1 and S2 both are not correct
(D) S1 is not correct and S2 is correct
0–1 knapsack ªÀÄvÀÄÛ fractional knapsack ¸ÀªÀĸÉåUÀ¼À£ÀÄß PÉÆmÁÖUÀ ªÀÄvÀÄÛ PɼÀV£À
ºÉýPÉUÀ¼À£ÀÄß UÀªÀĤ¹zÁUÀ :
S1 : 0 – 1 knapsack C£ÀÄß VæÃqï C2ÉÆÎjzÀªÀiï£À ¸ÀªÀÄ¥ÀðPÀ §¼ÀPɬÄAzÀ ¥ÀjºÀj¸À2ÁVzÉ
S2 : fractional knapsackC£ÀÄß qÉÊ£Á«ÄPï ¥ÉÆæÃUÁæªÀiï£À ¸ÀªÀÄ¥ÀðPÀ §¼ÀPɬÄ0zÀ
¥ÀjºÀjÜÈå2ÁUÀĪÀÅÁµåê. DUÀ F PɼÀV£À AiÀiÁªÀÅzÀÄ ¸ÀjAiÀiÁVzÉ ?
(A) S1 ¸Àj ªÀÄvÀÄÛ S2 vÀ¥ÀÄà
(B) S1 ªÀÄvÀÄÛ S2 JgÀqÀÆ ¸Àj
(C) S1 ªÀÄvÀÄÛ S2 JgÀqÀÆ vÀ¥ÀÄà
(D) S1 vÀ¥ÀÄà ªÀÄvÀÄÛ S2 ¸Àj
Space For Rough Work

A-1 24 Computer Science

86. Bresenham line drawing algorithm is attractive, because it uses
(A) real arithmetic only (B) integer arithmetic only
(C) floating point arithmetic (D) real and integer arithmetic
¨Éæ±À£ïºÁåªÀiï UÉgÉ J¼ÉAiÀÄĪÀ D2ÉÆÎjzÀªÀiï DPÀµÀð’å, Š’ðÒÁµ²
å µð …Áµåê ‡ÇȲå ìðë阙ÜÈåêÔåíúÁµåê
(A) jAiÀÄ2ï CxÀðªÉÄnPï ªÀiÁvÀæ

(B) ¥ÀÆuÁðAPÀ ƒxÀðªÉÄnPï ªÀiÁvÀæ

(C) ¥sÉÆèÃnAUï ¥Á¬ÄAmï ƒxÀðªÉÄnPï
(D) jAiÀÄ2ï ªÀÄvÀÄÛ ¥ÀÆuÁðAPÀ CxÀðªÉÄnPï

87. The Newton–Raphson iteration xn+1 = (xn / 2) + (3 / 2xn) can be used to solve the equation
£ÀÆål£ï-gÁå¥À¸À£ï£À, ElgÉõÀ£ï xn+1 = (xn / 2) + (3 / 2xn) £ÀÄß PɼÀV£À AiÀiÁªÀ ¸À«ÄÃPÀgÀtPÉÌ
¥ÀjºÁgÀ PÀAqÀÄ»rAiÀÄ®Ä G¥ÀAiÉÆÃV¸À§ºÀÄzÀÄ ?
(A) x2 = 3 (B) x3 = 3
(C) x2 = 2 (D) x3 = 2

88. A root of the equation x3 – x – 11 = 0, correct to four decimal using bisection method is
¨ÉʸÉPÀë£ï ¥ÀzÀÞwAiÀÄ£ÀÄß G¥ÀAiÉÆÃV¹ x3 – x – 11 = 0, ¸À«ÄÃPÀgÀtªÀ£ÀÄß ©r¹zÁUÀ
x ªÀÄÆ® ¨É2ÉAiÀÄÄ £Á®ÄÌ zÀ±ÁA±ÀUÀ½UÉ F PɼÀV£À AiÀiÁªÀ MAzÀÄ ¸ÀASÉå ¸ÀjAiÀiÁVgÀÄvÀÛzÉ ?
(A) 2.3737 (B) 2.3838
(C) 2.3736 (D) 2.3837

89. The order of errors in the Simpson’s rule for solving a numerical integration with a step
size h is
¹A¥Àì£ï ¤AiÀĪÀÄzÀ°è ‘h’ UÁvÀæ-ºÀAvÀzÀ £ÀÆåªÀÄjPÀ2ï EAnæUÉæñÀ£ï ¥ÀjºÁgÀ
PÀAqÀÄ»rAiÀÄĪÁUÀ zÉÆõÀUÀ¼À PÀæªÀĪÀÅ PɼÀV£À AiÀiÁªÀÅzÁVgÀÄvÀÛzÉ ?
(A) h (B) h2
(C) h3 (D) h4
Space For Rough Work

Computer Science 25 A-1

90. Match the following :
P. Newton – Raphson 1. Integration
Q. Runge – Kutta 2. Root finding
R. Gauss – Seidal 3. Ordinary Differential Equations
S. Simpson’s Rule 4. Solving the System of Linear equations
P Q R S
(A) 2 3 4 1
(B) 3 2 1 4
(C) 1 4 2 3
(D) 4 1 3 2
F PɼÀV£ÀªÀÅUÀ¼À£ÀÄß ºÉÆA¢¹ §gɬÄj :
P. £ÀÆål£ï-gÁå¥Àì£ï 1. EAnUÉæõÀ£ï
Q. gÀAUÉ-PÀÄmÁÖ 2. ªÀÄÆ® PÀAr»rAiÀÄĪÀÅzÀÄ
R. UÁ¸ï-¹ÃqÀ2ï 3. DjØ£Àj r¥sÀgɤìAiÀÄ2ï FPÉëõÀ£ï
S. ¹AÇÈÄ åÞ óÄå ¤AiÀĪÀÄ 4. °¤AiÀÄgï ¸À«ÄÃPÀgÀtªÀ£ÀÄß ©r¸ÀĪÀÅzÀÄ
P Q R S
(A) 2 3 4 1
(B) 3 2 1 4
(C) 1 4 2 3
(D) 4 1 3 2

91. Which of the following is a data warehouse ?

(A) Can be updated by end users.
(B) Contains numerous naming conventions and formats.
(C) Organized around important subject areas.
(D) Contains only current data.
F PɼÀV£ÀªÀÅUÀ¼À°è AiÀiÁªÀÅzÀÄ zÀvÀÛ ªÉÃgïºË¸ï DVzÉ ?
(A) PÉÆ£ÉAiÀÄ §¼ÀPÉzÁgÀgÀÄ C¥ïqÉmï ªÀiÁqÀ§ºÀÄzÁVzÉ
(B) C£ÉÃPÀ ºÉ¸Àj¸ÀĪÀ DZÀgÀuÉUÀ¼ÀÄ ªÀÄvÀÄÛ PÀæªÀÄ ªÀåªÀ¸ÉÜUÀ¼À£ÀÄß ºÉÆA¢gÀÄvÀÛzÉ
(C) ¥ÀæªÀÄÄR «µÀAiÀÄ PÉëÃvÀæUÀ¼À ¸ÀÄvÀÛ ¸ÀAWÀnvÀUÉÆArgÀÄvÀÛzÉ
(D) PÉêÀ® ¥Àæ¸ÀÄÛvÀ zÀvÀÛªÀ£ÀÄß ªÀiÁvÀæ ºÉÆA¢gÀÄvÀÛzÉ

Space For Rough Work

A-1 26 Computer Science

92. Which of the following is a Fact table ?
(A) completely denormalized (B) partially denormalized
(C) completely normalized (D) partially normalized
F PɼÀV£ÀªÀÅUÀ¼À°è AiÀiÁªÀÅzÀÄ ¥ÁåPïÖ mÉç2ï DVzÉ ?
(A) ¸ÀA¥ÀÆtðªÁV r£ÁgÀä2Éʸï DVgÀÄvÀÛzÉ
(B) ¨sÁUÀ±ÀB r£ÁgÀä2Éʸï DVgÀÄvÀÛzÉ
(C) ¸ÀA¥ÀÆtðªÁV £ÁgÀä2Éʸï DVgÀÄvÀÛzÉ
(D) ¨sÁUÀ±ÀB £ÁgÀä2Éʸï DVgÀÄvÀÛzÉ.

93. The load and index is a process to

(A) reject data from the data warehouse and to create the necessary indexes.
(B) load the data in the data warehouse and to create the necessary indexes.
(C) upgrade the quality of data after it is moved into a data warehouse.
(D) upgrade the quality of data before it is moved into a data warehouse.
2ÉÆÃqï ªÀÄvÀÄÛ EAqÉPïì ¥ÀæQæAiÉÄAiÀÄÄ
(A) qÁmÁ ªÉÃgïºË¸ï¤AzÀ qÁmÁªÀ£ÀÄß wgÀ¸ÀÌj¸ÀĪÀ ºÁUÀÆ CªÀ±ÀåPÀ
EAqÉPïìUÀ¼À£ÀÄß gÀa¸ÀĪÀ ¥ÀæQæAiÉÄ
(B) qÁmÁ ªÉÃgïºË¸ï£À°è qÁmÁªÀ£ÀÄß 2ÉÆÃqï ªÀiÁqÀĪÀ ºÁUÀÆ CªÀ±ÀåPÀ
EAqÉPïìUÀ¼À£ÀÄß gÀa¸ÀĪÀ ¥ÀæQæAiÉÄ
(C) qÁmÁªÀ£ÀÄß, qÁmÁ ªÉÃgïºË¸ï£ÉƼÀUÉ ¸ÉÃj¹zÀ £ÀAvÀgÀ CzÀgÀ UÀÄtªÀÄlÖªÀ£ÀÄß
ªÀ¢üð¸ÀÄvÀÛzÉ.
(D) qÁmÁªÀ£ÀÄß qÁmÁ ªÉÃgïºË¸ï£ÉƼÀUÉ ¸ÉÃj¸ÀĪÀ ªÀÄÄAavÀªÉà CzÀgÀ
UÀÄtªÀÄlÖªÀ£ÀÄß ªÀ¢üð¸ÀÄvÀÛzÉ.

94. In star schema, a type of relationship between a dimension and fact table is
(A) many-to-many (B) one-to-one
(C) one-to-many (D) many-to-one
¸ÁÖgï ¹ÌÃÔåìæzÀ MAzÀÄ qÉʪÉÄ£Àë£ï ªÀÄvÀÄÛ ¥sÁå’ó± mÉç2ï£À £ÀqÀÄ«£À ¸ÀA§AzsÀzÀ «zsÁ£À
AiÀiÁªÀÅzÀÄ ?
(A) ªÉĤ-lÄ-ªÉĤ (B) M£ï-lÄ-M£ï
(C) M£ï-lÄ-ªÉĤ (D) ªÉĤ-lÄ-M£ï

Space For Rough Work

Computer Science 27 A-1

95. Which of the following is Transient data ?
(A) Data in which the changes to existing records cause the previous version of the
records to be eliminated.
(B) Data in which changes to existing records do not cause the previous version of
the records to be eliminated.
(C) Data that are never altered once they have been added.
(D) Data that are never deleted once they have been added.
PɼÀV£ÀªÀÅUÀ¼À°è AiÀiÁªÀÅzÀÄ mÁæöå¤ìAiÀÄAmï qÁmÁ DVzÉ ?
(A) C¹ÜvÀézÀ°ègÀĪÀ gÉPÁ´µó¤UÀ½UÉ §zÀ2ÁV, gÉPÁ´µó¤˜µâ
å ÿå »A¢£À DªÀÈwÛAiÀÄ£ÀÄß
vÉUÉzÀĺÁPÀ®àqÀÄ«PÉUÉ PÁgÀtªÁUÀĪÀ qÁmÁ
(B) C¹ÜvÀézÀ°ègÀĪÀ gÉPÁqïðUÀ½UÉ §zÀ2ÁV, gÉPÁ´µó¤˜µâ
å ÿå »A¢£À DªÀÈwÛAiÀÄ£ÀÄß
vÉUÉzÀĺÁPÀÄ«PÉUÉ PÁgÀtªÁUÀzÀ qÁmÁ
(C) MAzÀÄ ¨Áj ¸ÉÃj¹zÀ £ÀAvÀgÀ JA¢UÀÆ §zÀ2ÁUÀzÀ qÁmÁ
(D) MAzÀÄ ¨Áj ¸ÉÃj¹zÀ £ÀAvÀgÀ JA¢UÀÆ vÉUÉzÀĺÁPÀ®àqÀzÀ qÁmÁ

96. Strategic value of data mining is

(A) time-sensitive (B) work-sensitive
(C) cost- sensitive (D) technical-sensitive
zÀvÀÛ UÀtÂUÁjPÉAiÀÄ PÁAiÀÄðvÀAvÀæ ªÀiË®åªÀÅ F PɼÀV£ÀªÀÅUÀ¼À°è AiÀiÁªÀÅzÁVzÉ ?
(A) ¸ÀªÀÄAiÀÄzÀ ¸ÀÆPÀëöävÉ (B) PÉ®¸ÀzÀ ¸ÀÆPÀëöävÉ
(C) ¨É2ÉAiÀÄ ¸ÀÆPÀëöävÉ (D) vÁAwæPÀ ¸ÀÆPÀëöävÉ

97. The term ____________ refer loosely to the process of semi-automatically analyzing large
databases to find useful pattern.
(A) data analysis (B) data warehouse
(C) data mining (D) knowledge discovery
MAzÀÄ G¥ÀAiÀÄÄPÀÛ ªÀiÁzÀjAiÀÄ£ÀÄß ºÀÄqÀÄPÀĪÀÅzÀPÁÌV ¸É«Ä DmÉÆêÉÄnPÀ° C£Á2ÉʹAUï
2Á¦ÿóð qÁmÁ ¨ÉÃ¸ï ¥ÀæQæAiÉÄAiÀÄ£ÀÄß G2ÉèÃT¸ÀĪÀ ¥ÀzÀ _______
(A) qÁmÁ C£Á°¹¸ï (B) qÁmÁ ªÉÃgïºË¸ï
(C) qÁmÁ ªÉÄʤA˜µó (D) £Á2ÉqïÓ r¸À̪Àj

Space For Rough Work

A-1 28 Computer Science

98. Meta data is used by end user for the purpose of
(A) managing database (B) querying
(C) making decisions (D) structuring database
ªÉÄmÁ zÀvÀÛªÀ£ÀÄß ’ðëÄð²ìåê §¼ÀPÉzÁgÀgÀÄ AiÀiÁªÀ PÁgÀtPÉÌ G¥ÀAiÉÆÃV¸ÀÄvÁÛgÉ ?
(A) zÀvÁÛA±ÀzÀ ¤ªÀðºÀuÉUÉ (B) ¥Àæ²ß¸ÀĪÀ GzÉÝñÀ
(C) ¤tðAiÀÄ ªÀiÁqÀ®Ä (D) zÀvÁÛA±ÀzÀ ¸ÀAgÀZÀ£ÉUÉ

99. A type of classifier that gives accurate classification across a range of application is
(A) Binary split (B) Multiway split
(C) Overfitting (D) Support vector machine
J2Áè C¦èÃPÉõÀ£ïUÀ¼À£ÀÄß ¸ÀjAiÀiÁV «AUÀr¸ÀĪÀ MAzÀÄ §UÉAiÀÄ PÁè¹¥sÉÊAiÀÄgï AiÀiÁªÀÅzÀÄ ?
(A) ¨ÉÊ£Àj ¹à÷èmï (B) ªÀÄ°ÖªÉà ¹à÷èmï
(C) NªÀgïÇ·n
Ý ÖAUï (D) ¸À¥ÉÆÃmïð ªÉPÁÖgï ªÉĶ£ï

100. Data scrubbing is a process of

(A) rejecting data from the data warehouse and to create the necessary indexes.
(B) loading the data in the data warehouse and to create the necessary indexes.
(C) upgrading the quality of data after it is moved into a data warehouse.
(D) upgrading the quality of data before it is moved into a data warehouse.
qÁmÁ ¸ÀÌç©âAUï, F ¥ÀæQæAiÉÄAiÀÄÄ
(A) qÁmÁ ªÉÃgïºË¸ï¤AzÀ qÁmÁªÀ£ÀÄß w²µ¸å ÀÌj¸ÀÄvÀÛzÉ ªÀÄvÀÄÛ CUÀvÀå EAqÉPïìUÀ¼À£ÀÄß
gÀa¸ÀÄvÀÛzÉ.
(B) qÁmÁ ªÉÃgïºË¸ï¤AzÀ qÁmÁªÀ£ÀÄß 2ÉÆÃqï ªÀiÁqÀÄvÀÛzÉ ªÀÄvÀÄÛ CUÀvÀå
EAqÉPïìUÀ¼À£ÀÄß gÀa¸ÀÄvÀÛzÉ.
(C) qÁmÁªÀ£ÀÄß, qÁmÁ ªÉÃgïºË¸ï£ÉƼÀUÉ ¸ÉÃj¹zÀ £ÀAvÀgÀ CzÀgÀ UÀÄtªÀÄlÖªÀ£ÀÄß
ªÀ¢üð¸ÀÄvÀÛzÉ.
(D) qÁmÁªÀ£ÀÄß ªÉÃgïºË¸ï£ÉƼÀUÉ ¸ÉÃj¸ÀĪÀ ªÀÄÄAavÀªÉà CzÀgÀ UÀÄtªÀÄlÖªÀ£ÀÄß
ªÀ¢üð¸ÀÄvÀÛzÉ.
___________
Space For Rough Work

Computer Science 29 A-1

 Space For Rough Work

Space For Rough Work

A-1 30 Computer Science

 Space for Rough Work

Space For Rough Work

Computer Science 31 A-1

1. The number of one’s present in the binary representation of 10 × 256 + 5 × 16 + 5 is
10 × 256 + 5 × 16 + 5gÀ ¨ÉÊ£Àj ¤gÀÆ¥ÀuÉAiÀÄ°è ¸ÀASÉå MAzÀÄ JµÀÄÖ ¨Áj §gÀÄvÀÛzÉ ?
(A) 5 (B) 6
(C) 7 (D) 8
2. In which of the following gates, the output is one, iff atleast one input is one ?
F PɼÀV£À AiÀiÁªÀ UÉÃmï£À°è PÀ¤µÀÖ ¥ÀPÀë MAzÀÄ ºÀÆrPÉ (input)AiÀÄÄ MAzÀÄ DVzÀÝgÉ,
¤ÃrPÉ (output)AiÀÄÄ MAzÀÄ DVgÀÄvÀÛzÉ ?
(A) NOR (B) AND
(C) OR (D) NAND
3. The hexadecimal number for (95.5)10 is
(95.5)10 UÉ ºÉPÁìqɹªÀÄ2ï (hexadecimal) ¸ÀASÉå AiÀiÁªÀÅzÀÄ ?
(A) (5F.8)16 (B) (9A.B)16
(C) (2E.F)16 (D) (5A.4)16

4. Which of the following sets of component(s) is/are sufficient to implement only arbitrary
Boolean function ?
(A) XOR gates, NOT gates
(B) 2 to 1 multiplexers
(C) AND gates, XOR gates
(D) Three - input gates that output (A.B) + C for the inputs A, B and C
F PɼÀPÀAqÀ AiÀiÁªÀ WÀlPÀ(UÀ¼À) UÀtªÀÅ AiÀiÁªÀÅzÉà ¤µÀàçªÀiÁtÂvÀ §Æ°AiÀiÁÄó PÁAiÀÄðªÀ£ÀÄß
C£ÀĵÁפ¸À®Ä ¸ÁPÁUÀÄvÀÛzÉ ?
(A) XOR UÉÃmïUÀ¼ÀÄ, NOT UÉÃmïUÀ¼ÀÄ
(B) 2 to 1 ªÀÄ°Ö¥ÉèPÀìgïUÀ¼ÀÄ
(C) AND UÉÃmïUÀ¼ÀÄ, XOR UÉÃmïUÀ¼ÀÄ
(D) A, B ªÀÄvÀÄÛ C ºÀÆrPÉUÀ½UÉ (A.B) + C ¤ÃrPÉUÀ¼ÁzÀ ªÀÄÆgÀÄ ºÀÆrPÉ UÉÃmïUÀ¼ÀÄ

5. Consider the following pseudo program segment :

F PɼÀV£À PÀæªÀÄ«¢ü ¨sÁUÀUÀ¼À£ÀÄß ¥ÀjUÀt¹
if (a>b) printf(“a>b”);
else printf(“else part”);
printf(“ a<=b”);
a<=b will be printed if
(A) a < b (B) a > b
(C) a = = b (D) In all cases/ J2Áè ¸ÀAzÀ¨sÀðUÀ¼À°è
Space For Rough Work

A-1 2 Computer Science

6. Match List I with List II and select the correct answer using the codes given below the
lists.
List I List II
P. while loop 1. Executed at least once.
Q. do while loop 2. Are used when it is known that how many times
loop is executed.
R. for loop 3. Are used when we want to loop until certain
condition was met.
S. continue 4. Put the control starting of the loop.
T. break 5. Put the control out of the loop.
Codes :
P Q R S T
(A) 1 2 3 4 5
(B) 2 1 3 4 5
(C) 3 1 2 4 5
(D) 4 1 3 2 5
F PɼÀV£À ¥ÀnÖ I ªÀÄvÀÄÛ ¥ÀnÖ II £ÀÄß ºÉÆA¢¹j ªÀÄvÀÄÛ ¥ÀnÖUÀ¼À PɼÀUÉ PÉÆnÖgÀĪÀ
¸ÀAPÉÃvÀUÀ½AzÀ ¸ÀjAiÀiÁzÀ GvÀÛgÀªÀ£ÀÄß DAiÉÄ̪ÀiÁr.
¥ÀnÖ-I ¥ÀnÖ-II
P. ªÉÊ2ï ®Æ¥ï 1. PÀ¤µÀÖ ¥ÀPÀë MAzÀÄ ¨Áj PÁAiÀÄðUÀvÀUÉƼÀÄîvÀÛzÉ
Q. qÀÄ-ªÉÊ2ï ®Æ¥ï 2. ®Æ¥ïUÀ¼ÀÄ JµÀÄÖ ¨Áj PÁAiÀÄðUÀvÀUÉÆArªÉ JAzÀÄ
w½¢zÁÝUÀ §¼À¸À2ÁUÀÄvÀÛzÉ
R. ¥sÁgï ®Æ¥ï 3. £ÁªÀÅ PÉ®ªÀÅ µÀgÀvÀÄÛUÀ¼À£ÀÄß ¸Á¢ü¸ÀĪÀªÀgÉUÀÆ ®Æ¥ï
ªÀiÁqÀ®Ä EaÒ¹zÁUÀ §¼À¸À2ÁUÀÄvÀÛzÉ
S. ªÀÄÄAzÀĪÀgɸÀÄ 4. ®Æ¥ï£À ¥ÁægÀA¨sÀzÀ°è ¤AiÀÄAvÀæPÀªÀ£ÀÄß Ej¸ÀĪÀÅzÀÄ
T. vÀqÉ 5. ®Æ¥ï£À ºÉÆgÀUÉ ¤AiÀÄAvÀæPÀªÀ£ÀÄß Ej¸ÀĪÀÅzÀÄ
Codes :
P Q R S T
(A) 1 2 3 4 5
(B) 2 1 3 4 5
(C) 3 1 2 4 5
(D) 4 1 3 2 5
Space For Rough Work

Computer Science 3 A-1

7. The function sprintf() works like printf() but operates on
(A) data in a file (B) stderr
(C) stdin (D) string
printf() £ÀAvÉ sprintf() PÉ®¸À ªÀiÁqÀÄvÀÛzÉ. DzÀgÉ ______ gÀ ªÉÄÃ2É PÁAiÀÄð¤ªÀð»¸ÀÄvÀÛzÉ
(A) PÀqÀvÀzÀ°è zÀvÀÛ (´µæ¯æ) (B) stderr
(C) stdin (D) string

8. What is the effect of the following pseudo ‘C’ program code ?

for(int i=1; i<=5; i=i+1/2)
printf(“%d”, i);
it prints
(A) 1, 1.5, 2, 2.5, 3, 3.5, 4, 4.5, 5, 5.5 and stops.
(B) 1, 2, 3, 4, 5 and stops.
(C) 1, 2, 3, 4, 5 and repeats for ever the same sequence.
(D) 1, 1, 1, 1, 1, and repeats for ever the same sequence.
F ªÀÄÄA¢£À C ¸ÀAPÉÃvÀzÀ ¥ÀjuÁªÀĪÉãÀÄ ?
for (int i=1; i<=5; i=i+1/2)
printf(“%d”, i);
(A) EzÀÄ 1, 1.5, 2, 2.5, 3, 3.5, 4, 4.5, 5, 5.5 ªÀÄÄ¢æ¸ÀÄvÀÛzÉ ªÀÄvÀÄÛ ¤°è¸ÀÄvÀÛzÉ
(B) EzÀÄ 1, 2, 3, 4, 5 ªÀÄÄ¢æ¸ÀÄvÀÛzÉ ªÀÄvÀÄÛ ¤°è¸ÀÄvÀÛzÉ
(C) 1, 2, 3, 4, 5 ªÀÄÄ¢æ¸ÀÄvÀÛzÉ ªÀÄvÀÄÛ CzÉà C£ÀÄPÀæªÀĪÀ£ÀÄß ¸ÀzÁ ¥ÀÄ£ÀgÁªÀwð¸ÀÄvÀÛzÉ
(D) EzÀÄ 1, 1, 1, 1, 1 ªÀÄÄ¢æ¸ÀÄvÀÛzÉ ªÀÄvÀÄÛ CzÉà C£ÀÄPÀæªÀĪÀ£ÀÄß ¸ÀzÀ
¥ÀÄ£ÀgÁªÀwð¸ÀÄvÀÛzÉ

9. If the following ‘C’ program (myprog) is run from the command line as
C:>myprog Friday Tuesday Sunday then, what would be the output?
F PɼÀV£À C PÀæªÀÄ«¢ü (myprog) AiÀÄ£ÀÄß DzÉñÀ ¸Á°¤AzÀ C :>myprog Friday Tuesday
Sunday £ÀqɹzÁUÀ ¤ÃrPÉ output K£ÁVgÀÄvÀÛzÉ ?
main(int argc, char *argv[])
{
printf(“%c” ,**++argv);
}
(A) m (B) f
(C) myprog (D) Friday

Space For Rough Work

A-1 4 Computer Science

10. In ‘C’ program, if the condition is missing in ‘for loop’ then
(A) It is assumed to be present and taken to be false.
(B) It is assumed to be present and taken to be true.
(C) It result in a syntax error.
(D) Execution will be terminated abruptly.
C PÀæªÀÄ«¢üAiÀÄ°è ¥sÁgï-®Æ¥ï £À°è ¤§AzsÀ£ÉAiÀÄÄ PÁuÉAiÀiÁVzÀÝgÉ, DUÀ _______
(A) CzÀÄ G¥ÀÜÝvÀ ÀªÁVzÉ JAzÀÄ ¨sÁ«¸À2ÁUÀÄvÀÛzÉ ªÀÄvÀÄÛ vÀ¥ÀÄà JAzÀÄ
¥ÀjUÀt¸ÀÑæUÀÄvÀÛzÉ
(B) CzÀÄ G¥ÀÜÝvÀ ÀªÁVzÉ JAzÀÄ ¨sÁ«¸À2ÁUÀÄvÀÛzÉ ªÀÄvÀÄÛ ¸Àj JAzÀÄ ¥ÀjUÀt¸À2ÁUÀÄvÀÛzÉ
(C) ªÁPÀågÀZÀ£ÉAiÀÄ°è zÉÆõÀ GAmÁUÀÄvÀÛzÉ
(D) PÁAiÀÄð¤ªÀðºÀuÉAiÀÄÄ KPÁKQ PÉÆ£ÉAiÀiÁUÀÄvÀÛzÉ

11. A type of class that allows only one object of it to be created is

(A) Virtual class (B) Abstract class
(C) Singleton class (D) Friend class
PÉêÀ® vÀ£Àß MAzÀÄ D¨ÉÓPïÖ£ÀÄß gÀƦ¸À®Ä C£ÀĪÀÄw¸ÀĪÀ PÁèöå¸ï£À MAzÀÄ «zsÀ
(A) ªÀZÀÄðAiÀÄ2ï PÁèöå¸ï (B) C¨ï¸ÁÖçPïÖ PÁèöå¸ï
(C) ¹AUÀ2ïl£ï PÁèöå¸ï (D) ¥sÉæAqï PÁèöå¸ï

12. Identify the correct statement in the following:

(A) Base class pointer cannot point to derived class.
(B) Derived class pointer cannot point to base class.
(C) Pointer to derived class cannot be created.
(D) Pointer to base class cannot be created.
F PɼÀV£ÀªÀÅUÀ¼À°è ¸ÀjAiÀiÁzÀ ºÉýPÉAiÀÄ£ÀÄß UÀÄgÀÄw¹
(A) ¨Éøï PÁè¸ï ¥Á¬ÄAlgï, rgÉʪïØ PÁè¸ïUÉ ¸ÀÆa¸À2ÁUÀĪÀÅ¢®è
(B) rgÉʪïØ PÁè¸ï ¥Á¬ÄAlgï, ¨Éøï PÁèöå¸ïUÉ ¸ÀÆa¸À2ÁUÀĪÀÅ¢®è
(C) rgÉʪïØ PÁè¸ïUÉ ¥Á¬ÄAlgï C£ÀÄß gÀƦ¸À2ÁUÀĪÀÅ¢®è
(D) ¨Éøï PÁèöå¸ïUÉ ¥Á¬ÄAlgï C£ÀÄß gÀƦ¸À2ÁUÀĪÀÅ¢®è

13. Exception handling is targeted at

(A) Runtime error (B) Compile time error
(C) Logical error (D) Syntax error
JPÉìÇÈåÛ£ï ºÁåArèAUï F PɼÀPÀAqÀ AiÀiÁªÀÅzÀ£ÀÄß UÀÄjAiÀiÁV¸ÀÄvÀÛzÉ ?
(A) gÀ£ïmÉʪÀiï JgÀægï (B) PÀA¥ÉÊ2ï mÉʪÀiï JgÀægï
(C) 2ÁfPÀ2ï JgÀægï (D) ¹AmÁåPïì JgÀægï
Space For Rough Work

Computer Science 5 A-1

14. Which of the following is used to implement the late binding ?
(A) Virtual function (B) Operator function
(C) Const function (D) Static function
PɼÀV£À AiÀiÁªÀ ¥sÀAPÀë£À£ÀÄß 2ÉÃmï ¨ÉÊArAUï C¼ÀªÀr¸À®Ä G¥ÀAiÉÆÃV¸ÀÄvÁÛgÉ ?
(A) ªÀZÀÄåðAiÀÄ2ï ¥sÀAPÀë£ï (B) D¥ÀgÉÃlgï ¥sÀAPÀë£ï
(C) PÁ£ïì÷Ö ¥sÀAPÀë£ï (D) ¸ÁÖöånPï ¥sÀAPÀë£ï

15. To access a class data member using ‘this’ pointer is

PɼÀV£À AiÀiÁªÀÅzÀ£ÀÄß PÁè¸ï qÁl ªÉÄA§gï£ÀÄß CåPÀì¸ïì ªÀiÁqÀ®Ä G¥ÀAiÉÆÃV¸À2ÁUÀĪÀÅzÀÄ ?
(A) this->x (B) this.x
(C) *this.x (D) *this-x

16. Identify the access specifier that is used as a default in a class definition
(A) protected (B) public
(C) private (D) friend
PÁèöå¸ï qɦü£ÉñÀ£ï£À°è r¥sÁ2ïÖ DV §¼À¸À®àqÀĪÀ ƒ’ðÜ
Þ Èó ¸É๥ÉÊAiÀÄgÀ£ÀÄß UÀÄgÀÄw¹
(A) ¥ÉÆæmÉPÉÖqï (B) ¥À©èPï
(C) ¥ÉæöʪÉÃmï (D) ¥sÉæAqï

17. Which of the following C++ statement is true ?

EªÀÅUÀ¼À°è AiÀiÁªÀ C++ ºÉýPÉ ¸ÀjAiÀiÁVzÉ ?
(A) int *p=new int (B) int new=*p
(C) int *new=*p (D) int *p=int new

18. A common property of logic programming languages and functional languages is

(A) Both are procedural languages.
(B) Both are based on Lambda-calculus.
(C) Both are declarative.
(D) Both are Horn- clauses.
vÀPÀð ¥ÉÆæÃUÁæ«ÄAUï ¨sÁµÉUÀ¼ÀÄ ªÀÄvÀÄÛ PÁAiÀÄðPÁj ¨sÁµÉUÀ¼À ¸ÁªÀiÁ£Àå UÀÄt®PÀëtUÀ¼ÁªÀŪÀÅ ?
(A) JgÀqÀÆ PÁAiÀÄð«zsÁ£ÀzÀ ¨sÁµÉUÀ¼ÀÄ
(B) JgÀqÀÆ PÀ®£À±Á¸ÀÛçªÀ£ÀÄß DÁ·j µå ¹zÉ
(C) JgÀqÀÆ WÉÆõÀuÁvÀäPÀªÁVªÉ
(D) JgÀqÀÆ ºÁ£ïð-PÁèÜÜ Èð Èó
Space For Rough Work

A-1 6 Computer Science

19. Which of the following describes the overloading of functions ?
(A) Virtual polymorphism (B) Transient polymorphism
(C) Ad-hoc polymorphism (D) Pseudo polymorphism
NªÀgï 2ÉÆÃrAUï „Ç·Èó Ç·ÒÈå ’åÛÄó C£ÀÄß ’ðâ˜ÿå Ä™ å ²ìåìæÔåíúÁµåê «ªÀj¸ÀÄvÀÛzÉ ?
(A) ªÀZÀÄåðAiÀÄ2ï ¥Á°ªÀiÁ¦üð¸ÀªÀiï
(B) mÁæ¤A
ì iÀÄAmï ¥Á°ªÀiÁ¦üð¸ÀªÀiï
(C) CqïºÉÆÃPï ¥Á°ªÀiÁ¦üð¸ÀªÀiï
(D) ¸ÀÆåqÉÆà ¥Á°ªÀiÁ¦üð¸ÀªÀiï

20. C++ encourages structuring of software as a collection of components that are

(A) Highly cohesive and loosely coupled.
(B) Not highly cohesive but loosely coupled.
(C) Highly cohesive and tightly coupled.
(D) Not highly cohesive but tightly coupled.
DVgÀĪÀ PÁA¥ÉÆãÉAmïUÀ¼À ¸ÀAUÀæºÀuÉAiÀiÁV vÀAvÁæA±ÀzÀ ¸ÀAgÀZÀ£ÉAiÀÄ£ÀÄß, C++ GvÉÛÃf¸ÀÄvÀÛzÉ
(A) ºÉZÀÄÑ ¸ÀAWÀnvÀ ªÀÄvÀÄÛ ¸Àr® eÉÆÃqÀuÉ
(B) ºÉZÀÄÑ ¸ÀAWÀl£É gÀ»vÀ DzÀgÉ ¸Àr® eÉÆÃqÀuÉ
(C) ºÉZÀÄÑ ¸ÀAWÀnvÀ ªÀÄvÀÄÛ ºÉZÀÄÑ ¨sÀzÀævÉAiÀÄ eÉÆÃqÀuÉ
(D) ºÉZÀÄÑ ¸ÀAWÀl£É gÀ»vÀ DzÀgÉ ¨sÀzÀævÉAiÀÄ eÉÆÃqÀuÉ

21. Given a binary tree, whose inorder and preorder traversal are given by
Inorder : EICFBGDJHK
Preorder : BCEIFDGHJK
The post order traversal of the above binary tree is
¨ÉÊ£Àj ªÀÈPÀëzÀ E£ïDqïðgï ºÁUÀÆ ¥ÉÆøïÖ DqÀðgï mÁæöåªÀ¸Àð2ïUÀ¼ÀÄ F ªÀÄÄA¢£ÀAwzÀÝgÉ :
M¼ÀªÀåªÀ¸ÉÜ : EICFBGDJHK
¥ÀƪÀðªÀåªÀ¸ÉÜ : BCEIFDGHJK
F PɼÀV£À AiÀiÁªÀÅzÀÄ ¨ÉÊ£Àj ªÀÈPÀëzÀ ¥ÉÆøïÖ DqÀðgï mÁæöåªÀ¸Àð2ï DVzÉ ?
(A) IEFCGJKHDB (B) IEFCJGKHDB
(C) IEFCGKJHDB (D) IEFCGJKDBM
Space For Rough Work

Computer Science 7 A-1

22. The number of disk access performed by insertion operation in B - tree of height h is
h JvÀÛgÀzÀ B-ªÀÈPÀëzÀ°è ¸ÉÃj¸ÀĪÀ PÁAiÀiÁðZÀgÀuÉ ªÀÄÄSÁAvÀgÀ r¸ïÌ DQì¸ï£ÀÄß JµÀÄÖ ¨Áj
¤ªÀð»¸À2ÁUÀÄvÀÛzÉ ?
(A) O(1) (B) O(h2)
(C) O(h) (D) O(log(h))

23. The efficient data structure to insert/delete a number in a stored set of number is
(A) Queue (B) Linked list
(C) Doubly linked list (D) Binary tree
¸ÀASÉåUÀ¼À£ÀÄß ±ÉÃRj¹zÀ MAzÀÄ UÀtzÀ°è MAzÀÄ ¸ÀASÉåAiÀÄ£ÀÄß ¸ÉÃj¸À®Ä/
vÉUÉzÀĺÁPÀĪÀÅzÀPÁÌV ¸ÀªÀÄ¥ÀðPÀªÁzÀ zÀvÀÛ ¸ÀAgÀZÀ£É AiÀiÁªÀÅzÀÄ ?
(A) PÀÆå (B) eÉÆÃr¹zÀ ¥ÀnÖ
(C) JgÀqÀÄ ¨Áj eÉÆÃr¹zÀ ¥ÀnÖ (D) ¨ÉÊ£Àj ªÀÈPÀë

24. The minimum number of nodes in a binary tree of depth ‘d’ (root is at level o) is
‘d’ D¼ÀzÀ ¨ÉÊ£Àj ªÀÈPÀëzÀ°è£À PÀ¤µÀÖ £ÉÆÃqïUÀ¼À ¸ÀASÉå JµÀÄÖ ?
(A) 2d – 1 (B) 2d+1 – 1
(C) 2d–1 (D) d + 1

25. The postfix expression AB + CD - * can be evaluated by using

(A) Stack (B) Tree
(C) Queue (D) Linked list
F PɼÀV£À AiÀiÁªÀÅzÀ£ÀÄß §¼À¹PÉÆAqÀÄ ¥ÉÆøïÖ¦Pü ïì JPÀì¥ÉæµÀ£ï AB + CD -*£ÀÄß ªÀiË°åÃPÀj¸À§ºÀÄzÀÄ ?
(A) ¸ÁÖöåPï (B) ªÀÈPÀë
(C) PÀÆå (D) eÉÆÃr¹zÀ ¥ÀnÖ

26. The post order traversal of a binary tree is DEBFCA, then the pre - order traversal is
¨ÉÊ£Àj ªÀÈPÀëzÀ ¥ÉÆøïÖ DqÀðgï mÁæªÀ¸Àð2ï DEBFCA DVzÀÝgÉ, ¦æà DqÀðgï mÁæªÀ¸Àð2ï AiÀiÁªÀÅzÀÄ ?
(A) ABFCDE (B) ADBFEC
(C) ABDECF (D) ABCDEF
Space For Rough Work

A-1 8 Computer Science

27. The inorder traversal of the tree will yield a sorted listing of elements of tree in
(A) Binary tree. (B) Binary search tree.
(C) AVL tree. (D) B+ tree.
F PɼÀV£À AiÀiÁªÀÅzÀgÉƼÀUÉ ªÀÈPÀëzÀ E£ïDqÀðgï mÁæöåªÀ¸Àð2ï ªÀÈPÀëzÀ J°ªÉÄAmïUÀ¼ÀÄ
¸ÁmÉðqï ¥ÀnÖAiÀÄ£ÀÄß ¤ÃqÀÄvÀÛzÉ ?
(A) ¨ÉÊ£Àj ªÀÈPÀë (B) ¨ÉÊ£Àj ±ÉÆÃzsÀ£Á ªÀÈPÀë
(C) AVL ªÀÈPÀë (D) B+ ªÀÈPÀë

28. What is the appropriate data structure for representing hierarchical relationship between
the elements ?
(A) Dequeue. (B) Priority Queue.
(C) Tree. (D) Stack.
CA±ÀUÀ¼À £ÀqÀÄ«£À ±ÉæÃtÂPÀÈvÀ ¸ÀA§AzsÀªÀ£ÀÄß ¤gÀƦ¸ÀĪÀÅzÀPÉÌ ¸ÀªÀÄAd¸ÀªÁzÀ zÀvÀÛ ¸ÀAgÀZÀ£É
AiÀiÁªÀÅzÀÄ ?
(A) rPÀÆå (B) DzÀåvÁ PÀÆå
(C) ªÀÈPÀë (D) ¸ÁÖöåPï

29. The minimum number of interchanges needed to convert the array 89, 19, 14, 40, 17, 12,
10, 2, 5, 7, 11, 6, 9, 70 into a heap with the maximum element at the root is
DgÉæà 89, 19, 14, 40, 17, 12, 10, 2, 5, 7, 11, 6, 9, 70 AiÀÄ£ÀÄß ªÀÄÆ®zÀ°è UÀjµÀÖ
CA±ÀzÉÆA¢UÉ MAzÀÄ gÁ²AiÀiÁV ¥ÀjªÀwð¸À®Ä CUÀvÀåªÁVgÀĪÀ CAvÀg﫤AiÀĪÀÄzÀ
PÀ¤µÀ× ¸ÀASÉå AiÀiÁªÀÅzÀÄ ?
(A) 0 (B) 1
(C) 2 (D) 3

30. A full binary tree with (2n + 1) nodes contain

(A) n leaf nodes (B) n non - leaf nodes
(C) (n – 1) leaf nodes (D) (n – 1) non - leaf nodes
(2n + 1)£ÉÆÃqï£À MAzÀÄ ¸ÀA¥ÀÆtð ¨ÉÊ£Àj ªÀÈPÀëªÀÅ F PɼÀV£À AiÀiÁªÀÅzÀ£ÀÄß ºÉÆA¢gÀÄvÀÛzÉ ?
(A) n °Ã¥sï £ÉÆÃqïUÀ¼ÀÄ (B) n £Á£ï °Ã¥sï £ÉÆÃqïUÀ¼ÀÄ
(C) (n – 1) °Ã¥sï £ÉÆÃqïUÀ¼ÀÄ (D) (n – 1) £Á£ï °Ã¥sï £ÉÆÃqïUÀ¼ÀÄ

Space For Rough Work

Computer Science 9 A-1

31. A special software that is used to create a job queue is called
(A) Drive (B) Spooler
(C) Interpreter (D) Linkage editor
eÁ¨ï PÀÆå C£ÀÄß ¸ÀÈf¸À®Ä §¼À¸ÀĪÀ MAzÀÄ «±ÉõÀ vÀAvÁæA±À AiÀiÁªÀÅzÀÄ ?
(A) qÉæöʪï (B) ¸ÀÆà®gï
(C) EAlgï¦ælgï (D) °APÉÃeï Jrlgï

32. Block or Buffer caches are used to

(A) Improve disk performance.
(B) Handle Interrupts.
(C) Increase the capacity of main memory.
(D) Speed up main memory read operations.
¨ÁèPï CxÀªÁ §¥sÀgï PÁå±ïUÀ¼À£ÀÄß AiÀiÁªÀÅzÀPÁÌV §¼À¸À2ÁUÀÄvÀÛzÉ ?
(A) r¸ïÌ ¤ªÀðºÀuÉAiÀÄ£ÀÄß GvÀÛªÀÄUÉƽ¸À®Ä
(B) CqÀZÀuÉUÀ¼À£ÀÄß ¤ªÀð»¸À®Ä
(C) ªÀÄÄRå ¸ÀäøwAiÀÄ ¸ÁªÀÄxÀðåªÀ£ÀÄß ºÉaѸÀÄvÀÛzÉ
(D) ªÀÄÄRå ¸Àäøw M¢zÀ PÁAiÀiÁðZÀgÀuÉAiÀÄ£ÀÄß ZÀÄgÀÄPÀÄUÉƽ¸ÀÄvÀÛzÉ.

33. A relationship between processes such that each has some point (critical section) which
must not be executed while the critical section of another is being executed is known as
(A) Semaphore (B) Mutual execution
(C) Multiprogramming (D) Message passing
¥ÀæwAiÉÆAzÀÆ, ªÀÄvÉÆÛAzÀgÀ QænPÀ2ï «¨sÁUÀªÀ£ÀÄß ¤ªÀð»¸ÀĪÁUÀ, ¤ªÀð»¸À¨ÁgÀzÁzÀ
PÉ®ªÀÅ ¨sÁUÀ (critical section) UÀ¼À£ÀÄß ºÉÆA¢gÀĪÀ ¥ÀæQæAiÉÄUÀ¼À £ÀqÀÄ«£À ¸ÀA§AzsÀªÀ£ÀÄß
K£ÉAzÀÄ PÀgÉAiÀÄ2ÁUÀÄvÀÛzÉ ?
(A) ¸ÉªÀiÁ¥sÉÆÃgï (B) ¥ÀgÀ¸ÀàgÀ §»µÀÌgÀt
(C) §ºÀÄPÀæªÀÄ«¢ü (D) ¸ÀAzÉñÀ gÀªÁ£É

Space For Rough Work

A-1 10 Computer Science

34. Pre - emptive scheduling is the strategy of temporarily suspending a gunning process
(A) Before the CPU time slices expires.
(B) To allow starving process to run.
(C) When it requests I/O.
(D) To avoid collision.
¦æÃ-JAnªï µÉqÀÆå°AUï M0zÀÄ _________ UÀ¤ßAUï ¥ÀæQæAiÉÄAiÀÄ£ÀÄß vÁvÁÌ°PÀªÁV
¸ÀÜVvÀUÉƽ¸ÀĪÀ vÀAvÀæªÁVzÉ.
(A) CPU mÉʪÀiï ¸Éèöʸï CAvÀåªÁUÀĪÀ ªÉÆzÀ®Ä
(B) PÉÆgÀvÉAiÀÄ°ègÀĪÀ ¥ÀæQæAiÉÄAiÀÄ£ÀÄß £ÀqɸÀ®Ä C£ÀĪÀÄw¸ÀĪÀÅzÀÄ
(C) CzÀÄ I/O £ÀÄß PÉÆÃjPÉÆAqÁUÀ
(D) ¸ÀAWÀµÀðtªÀ£ÀÄß vÀqÉAiÀÄ®Ä

35. In round robin CPU scheduling algorithm as the time quantum increases the average turn
around time
(A) Decreases (B) Increases
(C) Remains constant (D) Varies randomly
gËAqï gÁ©£ï ¹¦AiÀÄÄ µÉqÀÆå°AUï D2ÉÆÎjzÀªÀiï£À°è mÉʪÀiï PÁéAlªÀiï ºÉZÁÑzÀAvÉ
¸ÀgÁ¸Àj l£ïð CgËAqï mÉʪÀiï _________
(A) PÀrªÉÄAiÀiÁUÀÄvÀÛzÉ (B) ºÉZÁÑUÀÄvÀÛzÉ
(C) ¹ÜgÀªÁVgÀÄvÀÛzÉ (D) AiÀiÁzÀÈaÒPÀªÁV ªÀåvÁå¸ÀªÁUÀÄvÀÛzÉ.

36. Consider the following page trace:

4, 3, 2, 1, 4 , 3, 5, 4, 3, 2, 1, 5
Percentage of page fault that would occur if, FIFO page replacement algorithm is used
with number of frames for the JOB m = 4
F PɼÀV£À ¥ÉÃeï mÉæøï : 4, 3, 2, 1, 4, 3, 5, 4, 3, 2, 1, 5£ÀÄß ¥ÀjUÀt¹, FIFO ¥ÉÃeï
jÃ¥ÉèøïªÉÄAmï D2ÉÆÎjzÀªÀiï£ÀÄß JOB m = 4UÉ ¥sÉæêÀiïUÀ¼À ¸ÀASÉåUÀ¼ÉÆA¢UÉ
§¼À¹PÉÆAqÀgÉ ¸ÀA¨sÀ«¸À§ºÀÄzÁzÀ ¥ÉÃeï ¥sÁ2ïÖ£À ±ÉÃPÀqÀªÁgÀÄ K£ÁVgÀÄvÀÛzÉ ?
(A) 8 (B) 9
(C) 10 (D) 12
Space For Rough Work

Computer Science 11 A-1

37. If an instruction takes ‘ i ’, microseconds, a page fault takes an additional ‘ j ’
microseconds and on an average a page fault occur every ‘k’ instruments, then the
effective instruction time is
MAzÀÄ ¸ÀÆZÀ£ÉAiÀÄÄ ‘i’ ªÉÄÊPÉÆæ ¸ÉPÉAqïUÀ¼À£ÀÄß vÉUÉzÀÄPÉÆAqÀgÉ MAzÀÄ ¥ÉÃeï ¥sÁ2ïÖ C¢üPÀ
‘j’ ªÉÄÊPÉÆæøÉPÉAqïUÀ¼À£ÀÄß vÉUÉzÀÄPÉƼÀÄîvÀÛzÉ ªÀÄvÀÄÛ MAzÀÄ ¸ÀgÁ¸Àj ¥ÉÃeï ¥sÁ2ïÖUÉ ¥Àæw ‘k’
¸ÀÆZÀ£ÉUÀ¼ÀÄ ¸ÀA¨sÀ«¸ÀÄvÀÛzÉ, DUÀ ¥ÀjuÁªÀiÁvÀäPÀ E£ïìlæPÀë£ï mÉʪÀiï ________ DVgÀÄvÀÛzÉ.
(A) i+j/k (B) i+j*k
(C) (i+j)/k (D) (i+j)*k
38. The octal number to be given along with ‘chmod’ command to make a file readable,
writable and executable to the owner, readable and executable to group and others is
MAzÀÄ PÀqÀvÀªÀ£ÀÄß ªÀiÁ°ÃPÀ¤UÉ NzÀĪÀAvÉ §gÉAiÀÄĪÀAvÉ ªÀÄvÀÄÛ ¤ªÀð»¸ÀĪÀAvÉ ªÀiÁqÀ®Ä
MAzÀÄ UÀÄA¥ÀÄ ªÀÄvÀÄÛ EvÀgÀjUÉ NzÀĪÀAvÉ ¤ªÀð»¸ÀĪÀAvÉ ªÀiÁqÀ®Ä chmod
DzÉñÀzÉÆA¢UÉ PÉÆÃqÀ¨ÉÃPÁÁµå D’å±2ï ¸ÀASÉå AiÀiÁªÀÅzÀÄ ?
(A) 000 (B) 755
(C) 744 (D) 555
39. ________ checks type field in the file’s inode structure.
(A) Shell (B) Kernel
(C) Compiler (D) Assembler
PÀqÀvÀUÀ¼À L£ÉÆÃqï gÀZÀ£ÉAiÀÄ°è mÉÊ¥ï ¦üÃ2ïØ£ÀÄß _________ ¥Àj²Ã°¸ÀÄvÀÛzÉ.
(A) ±É2ï (B) PÀ£Éð2ï
(C) ¸ÀAPÀ®£À (D) ¸ÀAAiÉÆÃdPÀ
40. Which option will be used with ps command to slow the entire command line of the
process being run ?
MAzÀÄ £ÀqÉAiÀÄÄwÛgÀĪÀ ¥ÀæQæAiÉÄAiÀÄ ¸ÀA¥ÀÆtð DzÉñÀ ¸Á®£ÀÄß ¤zsÁ£ÀUÉƽ¸À®Ä ¦J¸ï
DzÉñÀzÉÆA¢UÉ §¼À¸ÀĪÀ DAiÉÄÌAiÀÄÄ AiÀiÁªÀÅzÀÄ ?
(A) – 4 (B) – f
(C) – l (D) +4
41. Many causes of the software crisis can be traced to mythology based on
(A) Management myth (B) Customer myths
(C) Practitioner myths (D) (A) (B) & (C) are true.
vÀAvÁæA±À ©PÀÌnÖ£À C£ÉÃPÀ PÁgÀtUÀ¼À£ÀÄß _______ ªÉÄÃ2É DzsÁjvÀªÁzÀ ¥ÀÄgÁtzÀ°è
PÁt§ºÀÄzÁVzÉ.
(A) ªÀåªÀºÀgÀt ¥ÀÄgÁtUÀ¼ÀÄ (B) UÁæºÀPÀ ¥ÀÄgÁtUÀ¼ÀÄ
(C) ªÀÈwÛUÁgÀ ¥ÀÄgÁtUÀ¼ÀÄ (D) (A) (B) Ôåê¼åê¾ (C) ˜µâ
å ÿåê ÜÈ²å ™
Space For Rough Work

A-1 12 Computer Science

42. _______ is an “umbrella” activity that is applied throughout the software engineering
process.
(A) Debugging (B) Tasking
(C) Designing (D) Software quality assurance
_________ MAzÀÄ vÀAvÁæA±À JAf¤AiÀÄjAUï ¥ÀæQæAiÉÄAiÀÄ GzÀÝPÀÆÌ C£Àé¬Ä¸ÀĪÀ
“CA¨Éæ2Áè” ZÀlĪÀnPÉAiÀiÁVzÉ.
(A) r§VÎAUï (B) ¥ÀjÃPÉë ªÀiÁqÀĪÀÅzÀÄ
(C) «£Áå¸ÀUÉƽ¸ÀĪÀÅzÀÄ (D) vÀAvÁæA±ÀzÀ UÀÄtªÀÄlÖzÀ RavÀvÉ

43. In estimating the software cost the Lines of Code (LOC) and Function Point (FP) are used
to measure what ?
(A) Length of code (B) Size of software
(C) Functionality of s/w (D) Both (A) and (B) are true
vÀAvÁæA±ÀzÀ ªÉZÀѪÀ£ÀÄß CAzÁdÄUÉƽ¸ÀĪÀ°è 2ÉÊ£ïì D¥sï PÉÆÃqï(LOC) ºÁUÀÆ ¥sÀAPÀë£ï
¥Á¬ÄAmï (FP) UÀ¼À£ÀÄß AiÀiÁªÀÅzÀ£ÀÄß C¼ÀvɪÀiÁqÀ®Ä §¼À¸À2ÁUÀÄvÀÛzÉ ?
(A) ¸ÀAPÉÃvÀzÀ GzÀÝ (B) vÀAvÁæA±ÀzÀ UÁvÀæ
(C) s/w £À PÁAiÀÄ𠤪ÀðºÀuÉ (D) (A) ªÀÄvÀÄÛ (B) JgÀqÀÆ ¸Àj
44. What is the equivalence partitioning method that divides the input domain of a program
into classes of the data from which task case can be derived ?
(A) White box testing (B) Black box testing
(C) Orthogonal array testing (D) Stress testing
MAzÀÄ PÀæªÀÄ«¢üAiÀÄ HrPÉ ªÁå¦ÛAiÀÄ£ÀÄß, mÁ¸ïÌ PÉøïUÀ¼À£ÀÄß vÀAiÀiÁj¸À§ºÀÄzÁzÀ zÀvÀÛzÀ
PÁè¸ïUÀ¼À£ÀÄß «AUÀr¸ÀĪÀ FQéªÀ2É£ïì ¥ÁnðµÀ¤AUï «zsÁ£À AiÀiÁªÀÅzÀÄ ?
(A) ªÉÊmï ¨ÁPïì ¥ÀjÃPÉë (B) ¨ÁèöåPï ¨ÁPïì ¥ÀjÃPÉë
(C) DxÁðUÀ£À2ï DgÉà ¥ÀjÃPÉë (D) ¸ÀÖç¸ï ¥ÀjÃPÉë
45. In a function oriented design
(A) Cohesion and coupling are minimised.
(B) Cohesion and coupling are maximised.
(C) Cohesion minimised and coupling are maximised.
(D) Cohesion maximised and coupling are minimised.
MAzÀÄ PÁAiÀiÁð¨sÁgÀ ¸ÀA§A¢üvÀ «£Áå¸ÀzÀ°è _________
(A) ¸ÀAWÀl£É ªÀÄvÀÄÛ eÉÆÃqÀuÉUÀ¼ÀÄ PÀÄUÀÄÎvÀÛªÉ
(B) ¸ÀAWÀl£É ªÀÄvÀÄÛ eÉÆÃqÀuÉUÀ¼ÀÄ »UÀÄÎvÀÛªÉ
(C) ¸ÀAWÀl£ÉAiÀÄÄ PÀÄUÀÄÎvÀÛzÉ ªÀÄvÀÄÛ eÉÆÃqÀuÉUÀ¼ÀÄ »UÀÄÎvÀÛzÉ
(D) ¸ÀAWÀl£ÉAiÀÄÄ »UÀÄÎvÀÛzÉ ªÀÄvÀÄÛ eÉÆÃqÀuÉUÀ¼ÀÄ PÀÄUÀÄÎvÀÛªÉ
Space For Rough Work

Computer Science 13 A-1

46. A process model that removes defects before they can precipitate serious hazards is
(A) Incremental model
(B) Spiral model
(C) Clean room software engineering
(D) Agile model
UÀA©üÃgÀªÁzÀ CqÀôåuÉUÀ¼À£ÀÄßAlĪÀiÁqÀĪÀ ªÉÆzÀ2Éà zÉÆõÀUÀ¼À£ÀÄß vÉUÉzÀĺÁPÀĪÀ ¥ÀæQæAiÀiÁ
ªÀiÁzÀj :
(A) E£ïQÔðêAl2ï ªÀiÁzÀj
(B) ¸ÉàöÊgÀ2ï ªÀiÁzÀj
(C) Qèãï gÀƪÀiï ¸Á¥sïÖªÉÃgï JAf¤AiÀÄjAUï
(D) JeÉÊ2ï ªÀiÁzÀj

47. Software safety is a _________ activity that focuses on the identification and assessment
of potential hazards that may affect software negativity and cause an entire system to fail.
(A) Risk mitigation, monitoring and management
(B) Software quality assurance
(C) Software cost estimation
(D) Defect removal efficiency
vÀAvÁæA±À ¸ÀÄgÀPÀëvÉ, EzÀÄ vÀAvÁæA±À £ÀPÁgÁvÀäPÀvÉ ªÀÄvÀÄÛ MAzÀÄ ¸ÀA¥ÀÆt𠹸ÀÖªÀiï£À
«¥sÀ®ªÁUÀÄ«PÉAiÀÄ ªÉÄÃ2É ¥ÀjuÁªÀÄ ©ÃgÀĪÀ ¸ÀªÀÄxÀð CqÀZÀuÉUÀ¼À UÀÄgÀÄw¸ÀÄ«PÉ ªÀÄvÀÄÛ
ªÀiË°åÃPÀgÀtzÀ ªÉÄÃ2É UÀªÀÄ£À«j¸ÀĪÀ MAzÀÄ ________ ZÀlĪÀnPÉAiÀiÁVzÉ.
(A) j¸ïÌ «ÄnUÉñÀ£ï, ªÀiÁ¤ljAUï, ªÀiÁå£ÉÃeïªÉÄAmï
(B) ¸Á¥sïÖªÉÃgï PÁé°n C¸ÀÄìgÀ£ïì
(C) ¸Á¥sïÖªÉÃgï PÁ¸ïÖ J¹ÖªÉÄñÀ£ï
(D) r¥sÉPïÖ jªÀÄƪÀ2ï J¦ü²AiÀĤì

48. On an average the programmer months(pm) is given by 3.6 * (KLOC)12. If so, a project
requiring one thousand sources instructions will require
3.6 * (KLOC)12 £À ªÀÄÆ®PÀ ¥ÉÆæÃUÁæªÀÄgï ªÀÄAvïì(pm) £ÀÄß ¤ÃqÀ2ÁVzÉ, ºÁUÁzÀgÉ MAzÀÄ
¸Á«gÀ DPÀgÀ ¸ÀÆZÀ£ÉUÀ¼À CªÀ±ÀåPÀvɬÄgÀĪÀ MAzÀÄ ¥ÁæeÉPïÖ _______ £ÀÄß PÉÆÃgÀÄvÀÛzÉ.
(A) 3.6 pm (B) 0.36 pm
(C) 0.0036 pm (D) 7.23 pm

Space For Rough Work

A-1 14 Computer Science

49. A relation of COCOMO model is
F PɼÀV£À AiÀiÁªÀÅzÀÄ COCOMO ªÀiÁzÀjAiÀÄ ¸ÀA§AzsÀªÁVzÉ ?
(A) E=a*(KLOC)6 (B) E=a*(KLOC)5
(C) E=a*(KLOC)7 (D) E=a*(KLOC)3

50. If the number of conditions in a decision table is n, then maximum number of rules
(Column) is possible is
MAzÀÄ ¤tðAiÀÄ ¥ÀnÖAiÀÄ°è µÀgÀvÀÄÛUÀ¼À ¸ÀASÉåAiÀÄÄ n DVzÀÝgÉ, ¤AiÀĪÀÄ(column) UÀ¼À
¸ÀA¨sÀªÀ¤ÃAiÀÄ UÀjµÀÖ ¸ÀASÉåAiÀÄÄ
(A) n (B) 2n
(C) 2n (D) log2n

51. For a database relation R(a,b,c,d), where domain of a,b,c,d include only the atomic values
the functional dependency a
c, b
d holds in the following relation in
a,b,c,d AiÀÄ PÁAiÀÄðPÉëÃvÀæªÀÅ DmÉÆëÄPï ªÀiË®åUÀ¼À£ÀÄß ªÀiÁvÀæ M¼ÀUÉÆArgÀĪÀ zÀvÁÛA±À
¸ÀA§AzsÀ R(a,b,c,d)UÉ, PÁAiÀÄðzÀ CªÀ®A§£É a
c, b
d AiÀÄÄ F PɼÀV£À AiÀiÁªÀÅzÀgÉƼÀUÉ
ºÉÆA¢gÀÄvÀÛzÉ ?
(A) 1NF not in 2NF (B) 2NF not in 3NF
(C) 3NF (D) 1NF

52. B+ tree is preferred to binary tree in database, because

(A) Disk capacity are greater than memory capacities.
(B) Disk access is much lower than memory access.
(C) Disk data transfer rates are much less than memory data transfer rate.
(D) Disk are more reliable than memory.
B+ ªÀÈPÀëPÉÌ ¨ÉÊ£Àj ªÀÈPÀëQÌAvÀ zÀvÁÛA±ÀzÀ°è DzsÀåvɬÄzÉ, KPÉAzÀgÉ :
(A) r¸ïÌ ¸ÁªÀÄxÀåðªÀÅ ªÉĪÀÄj ¸ÁªÀÄxÀåðQÌAvÀ ºÉZÁÑVzÉ
(B) r¸ïÌ DPÉì¸ï EzÀÄ ªÉĪÀÄj DPÉì¸ïVAvÀ ¤zsÁ£ÀªÁVzÉ
(C) r¸ïÌ zÀvÀÛzÀ ªÀUÁðªÀuÉ zÀgÀªÀÅ ªÉĪÀÄj zÀvÀÛ ªÀUÁðªÀuÉAiÀÄ zÀgÀQÌAvÀ §ºÀ¼À
PÀrªÉÄAiÀiÁVzÉ
(D) r¸ïÌUÀ¼ÀÄ ªÉĪÉÆjUÀ½VAvÀ §ºÀ¼ÀµÀÄÖ £ÀA©PÉUÉ CºÀðªÁVgÀÄvÀÛzÉ.

Space For Rough Work

Computer Science 15 A-1

53. Which of the following is true ?
(A) A relation in BCNF is always in 3NF.
(B) A relation in 3CNF is always in BCNF.
(C) BCNF and 3NF are same.
(D) A relation in BCNF is not in 3NF.
F PɼÀV£ÀªÀÅUÀ¼À°è AiÀiÁªÀÅzÀÄ ¸ÀjAiÀiÁVzÉ ?
(A) BCNF £À°è£À ¸ÀA§AzsÀªÀÅ 3NF £À°è AiÀiÁªÁUÀ®Æ EgÀÄvÀÛzÉ
(B) 3CNF £À°è£À ¸ÀA§AzsÀªÀÅ BCNF £À°è AiÀiÁªÁUÀ®Æ EgÀÄvÀÛzÉ
(C) BCNF ªÀÄvÀÄÛ 3NF UÀ¼ÀÄ MAzÉà DVgÀÄvÀÛªÉ
(D) BCNF £À°ègÀĪÀ ¸ÀA§AzsÀªÀÅ 3NF £À°è E®è

54. If in a tree, for every node the height of its left subtree and, right subtree differ almost by
one then the tree is
(A) Binary search tree (B) AVL tree
(C) Threaded tree binary tree (D) Complete binary tree.
MAzÀÄ ªÀÈPÀëzÀ°è ¥Àæw £ÉÆÃqïUÉ JqÀUÀqÉAiÀÄ ªÀÄvÀÄÛ §®UÀqÉAiÀÄ G¥ÀªÀÈPÀëUÀ¼À JvÀÛgÀªÀÅ ¸ÀASÉå
1 gÀµÀÄÖ ªÀåvÁå¸À«zÀÝgÉ, D ªÀÈPÀëªÀÅ
(A) ¨ÉÊ£Àj ¸ÀZïð næà (B) AVL næÃ
(C) vÉæqÉqï næà ¨ÉÊ£Àj næà (D) PÀA¦èÃmï ¨ÉÊ£Àj næÃ

55. How many character per second (7 bits +1 parity) can be transmitted over a 2400 bps line
in case of synchronous data transfer ?
JµÀÄÖ CPÀëgÀUÀ¼À£ÀÄß ¥Àæw ¸ÉPÀArUÉ (7bits + 1 parity)UÉ 2400 bps 2ÉÊ£ï£À°è ¹APÉÆæãÉʸï
zÀvÀÛ ªÀUÁðªÀuÉAiÀÄ°è ªÀUÁð¬Ä¸À§ºÀÄzÀÄ ?
(A) 300 (B) 240
(C) 250 (D) 275

56. Decryption and encryption of data are responsibility of

(A) Physical layer (B) Data link layer
(C) Presentation layer (D) Session layer
rQæ¥Àë£ï ªÀÄvÀÄÛ J£ïQæ¥Àë£ï zÀvÀÛ AiÀiÁªÀÅzÀPÉÌ dªÁ¨ÁÝj ?
(A) ¦üfPÀ2ï 2ÉÃAiÀÄgï (B) qÁmÁ °APï 2ÉÃAiÀÄgï
(C) ¥ÀæeÉAmÉñÀ£ï 2ÉÃAiÀÄgï (D) ¸É±Àê£ï 2ÉÃAiÀÄgï
Space For Rough Work

A-1 16 Computer Science

57. Which of the following are session layer check points ?
(A) Allow just a partition of a file to be resent.
(B) Detect and recover errors.
(C) Control and addition of headers.
(D) Are involved in dialog control.
PɼÀV£À AiÀiÁªÀÅzÀÄ ¸É±Àê£ï2ÉÃAiÀÄgï ZÉPï ¥Á¬ÄAmïìUÀ¼ÁVzÉ ?
(A) PÉêÀ® MAzÀÄ PÀqÀvÀzÀ ¨sÁUÀªÀ£ÀÄß ªÀÄgÀ½ PÀ¼ÀÄ»¸À®Ä C£ÀĪÀÄw¸ÀĪÀÅzÀÄ
(B) vÀ¥Àà£ÀÄß PÀAqÀÄ»rAiÀÄĪÀÅzÀÄ ªÀÄvÀÄÛ ¸Àj ªÀiÁqÀĪÀÅzÀÄ
(C) ºÉqÀgïìUÀ¼À eÉÆÃqÀuÉ ªÀÄvÀÄÛ ¤AiÀÄAvÀæt ªÀiÁqÀĪÀÅzÀÄ
(D) ¸ÀA¨sÁµÀuÉ ¤AiÀÄAvÀætzÉƼÀUÉ M¼ÀUÉƼÀîÑn É ÖgÀÄvÀÛªÉ

58. What is the maximum size of data that the application layer can pass on to the TCP layer ?
(A) Any size (B) 216 bytes
(C) Size of TCP header (D) 1500 bytes
C¦èèPÉõÀ£ï 2ÉÃAiÀÄgï TCP 2ÉÃAiÀÄgïUÉ PÀ¼ÀÄ»¸À§ºÀÄzÁzÀ qÁmÁzÀ UÀjµÀ× UÁvÀæªÀÅ
(A) AiÀiÁªÀÅzÉà UÁvÀæ¢gÀ§ºÀÄzÀÄ
(B) 216 ¨ÉÊmïìUÀ¼ÁVgÀ§ºÀÄzÀÄ
(C) TCP ºÉqÀgï UÁvÀæzÀ¶ÖgÀ§ºÀÄzÀÄ
(D) 1500 ¨ÉÊmïìUÀ¼ÁVgÀ§ºÀÄzÀÄ

59. FDDI stands for

(A) Fibre Distributed Data Interface
(B) Fully Distributed Device Interface
(C) Frequency Data Digital Interface
(D) Fibre Data Device Interconnection
FDDI JAzÀgÉ
(A) ¥sÉʧgï r¹Öç§ÆåmÉqï qÁmÁ EAlgï¥sÉøï
(B) ¥sÀÄ°è r¹Öç§ÆåmÉqï rªÉʸï EAlgï¥sÉøï
(C) ¦üæÃPÉé¤ì qÁmÁ rfl2ï EAlgï¥sÉøï
(D) ¥sÉʧgï qÁmÁ rªÉʸï EAlgïPÀ£ÉPÀë£ï
Space For Rough Work

Computer Science 17 A-1

60. The delay that occur during the playback of a stream is called
(A) Stream delay (B) Play back delay
(C) Filter (D) Event delay
¹ÖçêÀiï£À ¥Éèà ¨ÁåPï ¸ÀAzÀ¨sÀðzÀ°è «¼ÀA§ªÁUÀĪÀÅzÀPÉÌ K£ÉAzÀÄ PÀgÉAiÀÄÄvÁÛgÉ ?
(A) ¹ÖçêÀiï «¼ÀA§ (B) ¥Éèà ¨ÁåPï «¼ÀA§
(C) ¦üѱgï (D) FªÉAmï «¼ÀA§

61. A binary relation R = {(1,1),(2,1),(2,2),(2,3), (2,4), (3,1),(3,2), (3,3), (3,4)} on the set
A = {1,2,3,4} is
(A) reflexive symmetric and transitive
(B) neither reflexive nor irreflexive but transitive
(C) irreflexive anti-symmetric
(D) irreflexive symmetric and transitive.
¨ÉÊ£Àj j2ÉõÀ£ï R={(1,1),(2,1),(2,2),(2,3)(2,4),(3,1),(3,2),(3,3),(3,4)}ªÀÅ ˜µ¸ å A={1,2,3,4}
zÀ ªÉÄÃ2É ªÁåSÁ夹zÁUÀ PɼÀV£À AiÀiÁªÀÅzÀ£ÀÄß vÀȦۥÀr¸ÀÄvÀÛzÉ ?
(A) j¥sÉèQìªï, ¹«ÄnæPï „ÏAqï mÁæ¤ìnªï
(B) j¥sÉèQìªï C®è, Egïj¥sÉèQìªï C®è DzÀgÉ mÁæ¤ìnªï DVgÀÄvÀÛzÉ
(C) Egïj¥sÉèQìªï, DAn ¹«ÄnæPï
(D) Egïj¥sÉèQìªï, ¹«ÄnæPï „ÏAqï mÁæ¤ìnªï

62. The proposition p^(~p v q) is

(A) A tautology (B) A contradiction
(C) Logically equivalent to p^q (D) both (A) and (B) are true
¥Àæw¥ÁzÀ£É p^(~p v q) UÉ PɼÀV£À AiÀiÁªÀÅzÀÄ ¸ÀjAiÀiÁVzÉ ?
(A) mËmÉÆÃ2Áf
(B) PÁAnærPÀë£ï
(C) p^q UÉ 2ÁfPÀ°Ã FQéªÉ2ÉAmï
(D) (A) ªÀÄvÀÄÛ (B) JgÀqÀÆ ¸Àj

63. In propositional logic which of the following is equivalent to p→q ?

¥Àæ¸ÁÛ¦vÀ vÀPÀðzÀ°è F PɼÀV£À AiÀiÁªÀÅzÀÄ p→q ˜µð ¸ÀªÀĪÁVzÉ ?
(A) ~p → q (B) ~ p v q
(C) ~p v ~q (D) p→~q
Space For Rough Work

A-1 18 Computer Science

64. Which of the following is a declaration statement ?
(A) It is beautiful.
(B) He says “It is correct”.
(C) Two may not be an even integer.
(D) I love you.
F PɼÀV£À AiÀiÁªÀÅzÀÄ rPÉègÉõÀ£ï ¸ÉÖÃmïªÉÄAmï DVzÉ ?
(A) Emï E¸ï §Æån¥sÀÄ2ï
(B) »Ã ¸ÉÃÜÈó “Emï E¸ï PÀgÉPïÖ”
(C) lÆ ªÉÄà £Ámï ©Ã D£ï EªÀ£ï EAndgï
(D) L ®ªï AiÀÄÆ

65. (G,*) is an abelian group, then

(A) x=x –1 belongs to G, for any x.
(B) x=x2 belongs to G, for any x.
(C) (x*y)2= x2 * x2 belongs to G, for any x and y.
(D) G is of finite order.
(G,*) ªÀÅ J©°AiÀÄ£ï UÀÆæ¥ï DzÀgÉ
(A) AiÀiÁªÀÅzÉà x UÉ x=x –1 ªÀÅ G AiÀÄ°ègÀÄvÀÛzÉ
(B) AiÀiÁªÀÅzÉà x UÉ x=x2 ªÀÅ G AiÀÄ°ègÀÄvÀÛzÉ
(C) AiÀiÁªÀÅzÉà x ªÀÄvÀÄÛ y UÉ (x*y)2= x2 * x2 ªÀÅ G AiÀÄ°ègÀÄvÀÛzÉ
(D) G ªÀÅ ¥Àj«ÄvÀ PÀæªÀĪÁVgÀÄvÀÛzÉ.

66. How many distinguishable permutation can be generated from a word “BANANA” ?
“BANANA” JA§ ¥ÀzÀ¢AzÀ JµÀÄÖ ¨ÉÃgÉ ¨ÉÃgÉ PÀæªÀÄ eÉÆÃqÀuÉUÀ¼À£ÀÄß GvÀàwÛ¸À§ºÀÄzÀÄ ?
(A) 720 (B) 60
(C) 240 (D) 120

67. The term 2+5+8+…….+(3n-1) is equal to

2+5+8+…….+(3n-1) ÜÈÒ
å ¦ÿðö˜âµå ÿåê …Áµ’å ð” ÜÈÔ
å åêÔæÁµÁ
å µåêÂ
(A) (n2 –1)/2 (B) n(n+1)/2
(C) n(3n+1)/2 (D) n(3n-1)/2

Space For Rough Work

Computer Science 19 A-1

68. The 2-D translation equation in the matrix form P is equal to
ªÀiÁånæPïì gÀZÀ£ÉAiÀÄ°è£À 2-r mÁæ£Àì2ÉõÀ£ï FPÉéõÀ£ï ‘P’ AiÀÄÄ AiÀiÁªÀÅzÀ’ð” ÜÈÔ
å åê ?
(A) P+T (B) P–T
(C) P*T (D) P

69. All the hidden surface algorithms employee image space approach except which one of
the flowing method ?
(A) Back space removal (B) Depth buffer
(C) Scan line (D) Depth sort
J2Áè »qÀ£ï ¸À¥sÉðøï D2ÉÆÎjzsÀªÀiïUÀ¼ÀÄ PɼÀV£À AiÀiÁªÀ «zsÁ£ÀzÀ ºÉÆgÀvÁV EªÉÄÃeï
¸Éàøï C¥ÉÆæÃZÀ£ÀÄß C¼ÀªÀr¸ÀÄvÀÛzÉ ?
(A) ¨ÁåPï ¸Éàøï jªÀÄƪÀ2ï (B) qÉ¥ïÛ §¥sÀgï
(C) ¸ÁÌöå£ï 2ÉÊ£ï (D) qÉ¥ïÛ ¸Ámïð

70. Oblique projection with an angle of 45° to horizontal plane is called as

(A) Cabinait projection (B) Isometric projection
(C) Cavalier projection (D) Diagonal projection
F PɼÀV£À AiÀiÁªÀÅzÀÄ CqÀØ ¸ÀªÀÄvÀ¼ÀPÉÌ 45° PÉÆãÀzÀ C©èPÀÆå (oblique) ¥ÉÆæÃeÉPÀë£ï DVzÉ ?
(A) PÁ婤AiÉÄÃmï ¥ÉÆæeÉPÀë£ï (B) L¸ÉÆêÉÄnæPï ¥ÉÆæeÉPÀë£ï
(C) PÉ«°AiÀÄgï ¥ÉÆæeÉPÀë£ï (D) qÀAiÀiÁUÀ£À2ï ¥ÉÆæeÉPÀë£ï

71. What is the prototype of the default constructor for public class test() ?
public class test() EzÀgÀ°è r¥sÁ2ïÖ PÀ£ïìlæPÀÖgï£À ¥ÉÆæmÉÆÃmÉÊ¥ï AiÀiÁªÀÅzÀÄ ?
(A) test () (B) test (void)
(C) public test () (D) public test (void)

72. Which of the following method belongs to thread class ?

PɼÀV£À AiÀiÁªÀ «zsÁ£ÀªÀÅ xÉæqï PÁè¹UÉ ¸ÀA§A¢ü¹zÉ ?
(A) wait() (B) join()
(C) notify() (D) sleep()
Space For Rough Work

A-1 20 Computer Science

73. What is the priority of the garbage collector thread of the JDK ?
(A) Low priority (B) Highest priority
(C) Median priority (D) Decided at run time
eÉrPÉAiÀÄ UÁgÉâÃeï PÀ2ÉPÀÖgï xÉæqïÄå DzÀåvÉ AiÀiÁªÀÅzÀÄ ?
(A) PÀrªÉÄ DzÀåvÉ (B) ºÉaÑ£À DzÀåvÉ
(C) ªÀÄzsÀåªÀÄ DzÀåvÉ (D) gÀ£ï ªÉüÉAiÀÄ°è ¤UÀ¢ ¥Àr¸ÀĪÀÅzÀÄ

74. Which one of the following method is used to obtain values of invoking object as a long ?
PɼÀV£À AiÀiÁªÀ «zsÁ£ÀÔåÄåêÆ E£ïªÉÇÃQAUï D¨ÉÓPïÖ Då¸ï J 2ÁAUï JA§ÄzÀgÀ
ªÀiË®åªÀ£ÀÄß PÀAqÀÄ»rAiÀÄ®Ä G¥ÀAiÉÆÃV¸ÀÄvÁÛgÉ ?
(A) long value() (B) longlongValue()
(C) Long longvalue() (D) LongLongvalue()

75. Multimedia system require hard real time scheduling to

(A) ensure critical tasks will be serviced within timing deadlines
(B) deliver the media file to the client
(C) minimize the delay
(D) ensure security
K£À£ÀÄß RavÀ ¥Àr¸À®Ä ªÀÄ°Ö«ÄÃrAiÀiÁ ¹¸ÀÖªÀiïUÉ ºÁqïð jÃAiÀÄ2ï mÉʪÀiï µÉqÀÆå°AUï
¨ÉÃPÁUÀÄvÀÛzÉ ?
(A) QænPÀ2ï mÁ¸ïÌUÀ¼À£ÀÄß ¤UÀ¢vÀ ¸ÀªÀÄAiÀÄzÀ°èAiÉÄà ¥ÀÆtðUÉƽ¸ÀĪÀÅzÀÄ
(B) «ÄÃrAiÀiÁ ¥sÉÊ2ï£ÀÄß PÉèöÊAnUÉ ¸ÀgÀ§gÁdÄ ªÀiÁqÀĪÀÅzÀ£ÀÄß
(C) «¼ÀA§ªÀ£ÀÄß PÀrªÉÄ ªÀiÁqÀ®Ä
(D) gÀPÀëuÉAiÀÄ£ÀÄß

76. MIDI stand for ________.

(A) Musical Instrument Digital Interface
(B) Musical Instrument Digital Instruction
(C) MP3 Instrument Digital Interface
(D) Musical Instrument Design Interface
MIDI JAzÀgÉ :
(A) ªÀÄÆå¨PÀ2ï E£ïìlÄæªÉÄAmï rfl2ï EAlgï¥sÉøï
(B) ªÀÄÆå¨PÀ2ï E£ïìlÄæªÉÄAmï rfl2ï E£ïìlæPÀë£ï
(C) MP3 E£ïìlÄæªÉÄAmï rfl2ï EAlgï¥sÉøï
(D) ªÀÄÆå¨PÀ2ï E£ïìlÄæªÉÄAmï r¸ÉÊ£ï EAlgï¥sÉøï
Space For Rough Work

Computer Science 21 A-1

77. Which of the keyword can be used inside any method to refer to the current object?
(A) new (B) delete
(C) finalize (D) this
AiÀiÁªÀÅzÉà ¥ÀzÀÝwAiÉƼÀUÉ PÀgÉAmï D¨ÉÓPïÖ£ÀÄß G2ÉèÃT¸À®Ä AiÀiÁªÀ Qà ªÀqïð
G¥ÀAiÉÆÃV¸ÀÄvÁÛgÉ ?
(A) £ÀÆå (B) r°mï
(C) ¥sÉÊ£À2Éʸï (D) ¢¸ï

78. Which of the following is TRUE only for XML but not for HTML ?
(A) Derived from SGML.
(B) Describes control and layout.
(C) Allows user defined tags.
(D) Restricted only to be used with web browser.
PɼÀV£À AiÀiÁªÀÅzÀÄ JPïìJAJ2ïUÉ ªÀiÁvÀæ ¸ÀjAiÀiÁVzÉ DzÀgÉ ºÉZïnJAJ2ïUÉ
¸ÀA§A¢ü¹gÀĪÀÅ¢®è ?
(A) SGML ¤AzÀ rgÉʪïØ DVzÉ
(B) EzÀÄ PÀAmÉÆæÃ2ï ªÀÄvÀÄÛ 2ÉÃOmïUÀ¼À£ÀÄß «ªÀj¸ÀÄvÀÛzÉ
(C) EzÀÄ AiÀÄÆdgï r¥sÉÊ£Àqï mÁåUïì£ÀÄß C£ÀĪÀÄw¸ÀÄvÀÛzÉ.
(D) EzÀÄ ªÉ¨ï ¨Ëædgï£ÉÆA¢UÉ ªÀiÁvÀæ G¥ÀAiÉÆÃV¸À®Ä ¤§ðA¢ü¸À®ànÖgÀÄvÀÛzÉ.

79. The XML DOM object is

(A) anentity (B) anentity reference
(C) acomment reference (D) acomment data
XML DOM D¨ÉÓPïÖªÀÅ PɼÀV£À AiÀiÁªÀÅzÀÄ ?
(A) JAnn (B) JAnn gÉ¥sÀgÀ£ïì
(C) PÁªÉÄAmï gÉ¥sÀgÉ£ïì (D) PÁªÉÄAmï qÁmÁ

80. Which JavaScript features uses JAR files ?

(A) Stylesheets (B) Object signing
(C) Netcaster channels (D) Image rollovers
eÁgï PÀqÀvÀUÀ¼À£ÀÄß AiÀiÁªÀ eÁªÁ ÜÝ”ø¥ïÖ ¦üÃZÀgïUÀ¼ÀÄ §¼À¹PÉƼÀÄîvÀÛzÉ ?
(A) ¸ÉÖöÊ2ï ²Ãmïì (B) C¨ÉÓPïÖ ¸ÉʤAUï
(C) £ÉmïPÁ¸ÀÖgï ôæÄðÑóÞ (D) EªÉÄÃeï gÉÆÃ2ïMªÀgïì
Space For Rough Work

A-1 22 Computer Science

81. Computing the binomial coefficient nCr is an application of
(A) Divide and conquer techniques
(B) Decrease and conquer techniques
(C) Transform and conquer techniques
(D) Dynamic programming techniques
¨ÉÊ£ÉÆëÄAiÀÄ2ï PÉÆÃJ¦ü²AiÉÄAmï nCr C£ÀÄß PÀAqÀÄ»rAiÀÄĪÀÅzÀÄ ________ C¦èPÉñÀ£ï
DVzÉ.
(A) rªÉÊqï ªÀÄvÀÄÛ PÁ£ÀÌgï vÀAvÀæUÀ¼À
(B) rQæÃ¸ï ªÀÄvÀÄÛ PÁ£ÀÌgï vÀAvÀæUÀ¼À
(C) mÁæ£ïì¥sÁÔåìóð ªÀÄvÀÄÛ PÁ£ÀÌgï vÀAvÀæUÀ¼À
(D) qÉÊ£Á«ÄPï ¥ÉÆæÃUÁæ«ÄAUï vÀAvÀæUÀ¼À

82. The worst case time complexity of the sorting algorithm by using divide- and -conquer is
rªÉÊqï ªÀÄvÀÄÛ PÁ£ÀÌgï ¥ÀzÀÞwAiÀÄ£ÀÄß G¥ÀAiÉÆÃV¹PÉÆAqÀÄ PÀæªÀĪÁV eÉÆÃr¸ÀĪÀ
C2ÉÆÎÃjzsÀªÀiï £À QèÚÈå± ¸ÀªÀÄAiÀÄzÀ vÉÆqÀPÀÄ AiÀiÁªÀÅzÀÄ ?
(A) Ο(n log n) (B) Ο(n3)
(C) Ο(n2 log n) (D) Ο(log n)

83. The application of transform-and-conquer technique is

(A) Merge sort for sorting a list
(B) Gauss Elimination for solving the system of equations
(C) All pairs shortest path
(D) Minimum spanning tree
mÁæ£ïì¥sÁÔåìóð ªÀÄvÀÄÛ PÁ£ÁÌ÷éAiÀÄgï vÀAvÀæzÀ C¦èPÉñÀ£ï
(A) ªÀÄeïð ¸Ámïð ¥sÁgï ¸ÁnðAUï J °¸ïÖ
(B) FPÉéñÀ£ï ¥ÀzÀÞwAiÀÄ£ÀÄß ¥ÀjºÀj¸À®Ä UÁ¸ï J°«Ä£ÉñÀ£ï
(C) D2ï ¥ÉÃgïì ±ÁmÉð¸ïÖ ¥Áxï
(D) ÕêÅÔåêÔåìó ÜÈéðÉ ÅÒ˜µó °Ðé
Space For Rough Work

Computer Science 23 A-1

84. The travelling salesman problem can be solved in
(A) Polynomial time using dynamic programming
(B) Polynomial time using branch and bound techniques
(C) Exponential time using dynamic programming/branch and bound techniques
(D) Exponential time using back tracking
¥ÀæªÁ¹ ªÀiÁgÁlUÁgÀ£À ¸ÀªÀĸÉåAiÀÄ£ÀÄß ¥ÀjºÁgÀ ªÀiÁqÀ®Ä
(A) qÉÊ£Á«ÄPï ¥ÉÆæUÁæ«ÄAUï §¼À¹PÉÆAqÀÄ ¥Á°£Á«ÄAiÀÄ2ï ¸ÀªÀÄAiÀÄ
G¥ÀAiÉÆÃV¹zÁUÀ ¨ÉÃPÁUÀÄvÀÛzÉ
(B) ¨ÁæöåAZï ªÀÄvÀÄÛ ¨ËAqï vÀAvÀæ §¼À¹PÉÆAqÀÄ ¥Á°£Á«ÄAiÀÄ2ï ¸ÀªÀÄAiÀÄ
G¥ÀAiÉÆÃV¹zÁUÀ ¨ÉÃPÁUÀÄvÀÛzÉ
(C) qÉÊ£Á«ÄPï ¥ÉÆæUÁæ«ÄAUï / ¨ÁæöåAZï ªÀÄvÀÄÛ ¨ËAqï ¼åÒ¼åИâ
µå Äÿå åêÆ §¼À¹PÉÆAqÀÄ
J’óÞ¥ÉƣɤìAiÀÄ2ï ¸ÀªÀÄAiÀÄ ¨ÉÃPÁUÀÄvÀÛzÉ
(D) ¨ÁåPï mÁæQAUï §¼À¹PÉÆAqÀÄ J’óÞ¥ÉƣɤìAiÀÄ2ï ¸ÀªÀÄAiÀÄ ¨ÉÃPÁUÀÄvÀÛzÉ

85. Given 0 – 1 knapsack problem and fractional knapsack problem and the following
statements:
S1: 0 – 1 knapsack is efficiently solved by using Greedy algorithm.
S2: Fractional knapsack is efficiently solved using by dynamic programming.
Which of the following is true?
(A) S1 is correct and S2 is not correct
(B) S1 and S2 both are correct
(C) S1 and S2 both are not correct
(D) S1 is not correct and S2 is correct
0–1 knapsack ªÀÄvÀÄÛ fractional knapsack ¸ÀªÀĸÉåUÀ¼À£ÀÄß PÉÆmÁÖUÀ ªÀÄvÀÄÛ PɼÀV£À
ºÉýPÉUÀ¼À£ÀÄß UÀªÀĤ¹zÁUÀ :
S1 : 0 – 1 knapsack C£ÀÄß VæÃqï C2ÉÆÎjzÀªÀiï£À ¸ÀªÀÄ¥ÀðPÀ §¼ÀPɬÄAzÀ ¥ÀjºÀj¸À2ÁVzÉ
S2 : fractional knapsackC£ÀÄß qÉÊ£Á«ÄPï ¥ÉÆæÃUÁæªÀiï£À ¸ÀªÀÄ¥ÀðPÀ §¼ÀPɬÄ0zÀ
¥ÀjºÀjÜÈå2ÁUÀĪÀÅÁµåê. DUÀ F PɼÀV£À AiÀiÁªÀÅzÀÄ ¸ÀjAiÀiÁVzÉ ?
(A) S1 ¸Àj ªÀÄvÀÄÛ S2 vÀ¥ÀÄà
(B) S1 ªÀÄvÀÄÛ S2 JgÀqÀÆ ¸Àj
(C) S1 ªÀÄvÀÄÛ S2 JgÀqÀÆ vÀ¥ÀÄà
(D) S1 vÀ¥ÀÄà ªÀÄvÀÄÛ S2 ¸Àj
Space For Rough Work

A-1 24 Computer Science

86. Bresenham line drawing algorithm is attractive, because it uses
(A) real arithmetic only (B) integer arithmetic only
(C) floating point arithmetic (D) real and integer arithmetic
¨Éæ±À£ïºÁåªÀiï UÉgÉ J¼ÉAiÀÄĪÀ D2ÉÆÎjzÀªÀiï DPÀµÀð’å, Š’ðÒÁµ²
å µð …Áµåê ‡ÇȲå ìðë阙ÜÈåêÔåíúÁµåê
(A) jAiÀÄ2ï CxÀðªÉÄnPï ªÀiÁvÀæ

(B) ¥ÀÆuÁðAPÀ ƒxÀðªÉÄnPï ªÀiÁvÀæ

(C) ¥sÉÆèÃnAUï ¥Á¬ÄAmï ƒxÀðªÉÄnPï
(D) jAiÀÄ2ï ªÀÄvÀÄÛ ¥ÀÆuÁðAPÀ CxÀðªÉÄnPï

87. The Newton–Raphson iteration xn+1 = (xn / 2) + (3 / 2xn) can be used to solve the equation
£ÀÆål£ï-gÁå¥À¸À£ï£À, ElgÉõÀ£ï xn+1 = (xn / 2) + (3 / 2xn) £ÀÄß PɼÀV£À AiÀiÁªÀ ¸À«ÄÃPÀgÀtPÉÌ
¥ÀjºÁgÀ PÀAqÀÄ»rAiÀÄ®Ä G¥ÀAiÉÆÃV¸À§ºÀÄzÀÄ ?
(A) x2 = 3 (B) x3 = 3
(C) x2 = 2 (D) x3 = 2

88. A root of the equation x3 – x – 11 = 0, correct to four decimal using bisection method is
¨ÉʸÉPÀë£ï ¥ÀzÀÞwAiÀÄ£ÀÄß G¥ÀAiÉÆÃV¹ x3 – x – 11 = 0, ¸À«ÄÃPÀgÀtªÀ£ÀÄß ©r¹zÁUÀ
x ªÀÄÆ® ¨É2ÉAiÀÄÄ £Á®ÄÌ zÀ±ÁA±ÀUÀ½UÉ F PɼÀV£À AiÀiÁªÀ MAzÀÄ ¸ÀASÉå ¸ÀjAiÀiÁVgÀÄvÀÛzÉ ?
(A) 2.3737 (B) 2.3838
(C) 2.3736 (D) 2.3837

89. The order of errors in the Simpson’s rule for solving a numerical integration with a step
size h is
¹A¥Àì£ï ¤AiÀĪÀÄzÀ°è ‘h’ UÁvÀæ-ºÀAvÀzÀ £ÀÆåªÀÄjPÀ2ï EAnæUÉæñÀ£ï ¥ÀjºÁgÀ
PÀAqÀÄ»rAiÀÄĪÁUÀ zÉÆõÀUÀ¼À PÀæªÀĪÀÅ PɼÀV£À AiÀiÁªÀÅzÁVgÀÄvÀÛzÉ ?
(A) h (B) h2
(C) h3 (D) h4
Space For Rough Work

Computer Science 25 A-1

90. Match the following :
P. Newton – Raphson 1. Integration
Q. Runge – Kutta 2. Root finding
R. Gauss – Seidal 3. Ordinary Differential Equations
S. Simpson’s Rule 4. Solving the System of Linear equations
P Q R S
(A) 2 3 4 1
(B) 3 2 1 4
(C) 1 4 2 3
(D) 4 1 3 2
F PɼÀV£ÀªÀÅUÀ¼À£ÀÄß ºÉÆA¢¹ §gɬÄj :
P. £ÀÆål£ï-gÁå¥Àì£ï 1. EAnUÉæõÀ£ï
Q. gÀAUÉ-PÀÄmÁÖ 2. ªÀÄÆ® PÀAr»rAiÀÄĪÀÅzÀÄ
R. UÁ¸ï-¹ÃqÀ2ï 3. DjØ£Àj r¥sÀgɤìAiÀÄ2ï FPÉëõÀ£ï
S. ¹AÇÈÄ åÞ óÄå ¤AiÀĪÀÄ 4. °¤AiÀÄgï ¸À«ÄÃPÀgÀtªÀ£ÀÄß ©r¸ÀĪÀÅzÀÄ
P Q R S
(A) 2 3 4 1
(B) 3 2 1 4
(C) 1 4 2 3
(D) 4 1 3 2

91. Which of the following is a data warehouse ?

(A) Can be updated by end users.
(B) Contains numerous naming conventions and formats.
(C) Organized around important subject areas.
(D) Contains only current data.
F PɼÀV£ÀªÀÅUÀ¼À°è AiÀiÁªÀÅzÀÄ zÀvÀÛ ªÉÃgïºË¸ï DVzÉ ?
(A) PÉÆ£ÉAiÀÄ §¼ÀPÉzÁgÀgÀÄ C¥ïqÉmï ªÀiÁqÀ§ºÀÄzÁVzÉ
(B) C£ÉÃPÀ ºÉ¸Àj¸ÀĪÀ DZÀgÀuÉUÀ¼ÀÄ ªÀÄvÀÄÛ PÀæªÀÄ ªÀåªÀ¸ÉÜUÀ¼À£ÀÄß ºÉÆA¢gÀÄvÀÛzÉ
(C) ¥ÀæªÀÄÄR «µÀAiÀÄ PÉëÃvÀæUÀ¼À ¸ÀÄvÀÛ ¸ÀAWÀnvÀUÉÆArgÀÄvÀÛzÉ
(D) PÉêÀ® ¥Àæ¸ÀÄÛvÀ zÀvÀÛªÀ£ÀÄß ªÀiÁvÀæ ºÉÆA¢gÀÄvÀÛzÉ

Space For Rough Work

A-1 26 Computer Science

92. Which of the following is a Fact table ?
(A) completely denormalized (B) partially denormalized
(C) completely normalized (D) partially normalized
F PɼÀV£ÀªÀÅUÀ¼À°è AiÀiÁªÀÅzÀÄ ¥ÁåPïÖ mÉç2ï DVzÉ ?
(A) ¸ÀA¥ÀÆtðªÁV r£ÁgÀä2Éʸï DVgÀÄvÀÛzÉ
(B) ¨sÁUÀ±ÀB r£ÁgÀä2Éʸï DVgÀÄvÀÛzÉ
(C) ¸ÀA¥ÀÆtðªÁV £ÁgÀä2Éʸï DVgÀÄvÀÛzÉ
(D) ¨sÁUÀ±ÀB £ÁgÀä2Éʸï DVgÀÄvÀÛzÉ.

93. The load and index is a process to

(A) reject data from the data warehouse and to create the necessary indexes.
(B) load the data in the data warehouse and to create the necessary indexes.
(C) upgrade the quality of data after it is moved into a data warehouse.
(D) upgrade the quality of data before it is moved into a data warehouse.
2ÉÆÃqï ªÀÄvÀÄÛ EAqÉPïì ¥ÀæQæAiÉÄAiÀÄÄ
(A) qÁmÁ ªÉÃgïºË¸ï¤AzÀ qÁmÁªÀ£ÀÄß wgÀ¸ÀÌj¸ÀĪÀ ºÁUÀÆ CªÀ±ÀåPÀ
EAqÉPïìUÀ¼À£ÀÄß gÀa¸ÀĪÀ ¥ÀæQæAiÉÄ
(B) qÁmÁ ªÉÃgïºË¸ï£À°è qÁmÁªÀ£ÀÄß 2ÉÆÃqï ªÀiÁqÀĪÀ ºÁUÀÆ CªÀ±ÀåPÀ
EAqÉPïìUÀ¼À£ÀÄß gÀa¸ÀĪÀ ¥ÀæQæAiÉÄ
(C) qÁmÁªÀ£ÀÄß, qÁmÁ ªÉÃgïºË¸ï£ÉƼÀUÉ ¸ÉÃj¹zÀ £ÀAvÀgÀ CzÀgÀ UÀÄtªÀÄlÖªÀ£ÀÄß
ªÀ¢üð¸ÀÄvÀÛzÉ.
(D) qÁmÁªÀ£ÀÄß qÁmÁ ªÉÃgïºË¸ï£ÉƼÀUÉ ¸ÉÃj¸ÀĪÀ ªÀÄÄAavÀªÉà CzÀgÀ
UÀÄtªÀÄlÖªÀ£ÀÄß ªÀ¢üð¸ÀÄvÀÛzÉ.

94. In star schema, a type of relationship between a dimension and fact table is
(A) many-to-many (B) one-to-one
(C) one-to-many (D) many-to-one
¸ÁÖgï ¹ÌÃÔåìæzÀ MAzÀÄ qÉʪÉÄ£Àë£ï ªÀÄvÀÄÛ ¥sÁå’ó± mÉç2ï£À £ÀqÀÄ«£À ¸ÀA§AzsÀzÀ «zsÁ£À
AiÀiÁªÀÅzÀÄ ?
(A) ªÉĤ-lÄ-ªÉĤ (B) M£ï-lÄ-M£ï
(C) M£ï-lÄ-ªÉĤ (D) ªÉĤ-lÄ-M£ï

Space For Rough Work

Computer Science 27 A-1

95. Which of the following is Transient data ?
(A) Data in which the changes to existing records cause the previous version of the
records to be eliminated.
(B) Data in which changes to existing records do not cause the previous version of
the records to be eliminated.
(C) Data that are never altered once they have been added.
(D) Data that are never deleted once they have been added.
PɼÀV£ÀªÀÅUÀ¼À°è AiÀiÁªÀÅzÀÄ mÁæöå¤ìAiÀÄAmï qÁmÁ DVzÉ ?
(A) C¹ÜvÀézÀ°ègÀĪÀ gÉPÁ´µó¤UÀ½UÉ §zÀ2ÁV, gÉPÁ´µó¤˜µâ
å ÿå »A¢£À DªÀÈwÛAiÀÄ£ÀÄß
vÉUÉzÀĺÁPÀ®àqÀÄ«PÉUÉ PÁgÀtªÁUÀĪÀ qÁmÁ
(B) C¹ÜvÀézÀ°ègÀĪÀ gÉPÁqïðUÀ½UÉ §zÀ2ÁV, gÉPÁ´µó¤˜µâ
å ÿå »A¢£À DªÀÈwÛAiÀÄ£ÀÄß
vÉUÉzÀĺÁPÀÄ«PÉUÉ PÁgÀtªÁUÀzÀ qÁmÁ
(C) MAzÀÄ ¨Áj ¸ÉÃj¹zÀ £ÀAvÀgÀ JA¢UÀÆ §zÀ2ÁUÀzÀ qÁmÁ
(D) MAzÀÄ ¨Áj ¸ÉÃj¹zÀ £ÀAvÀgÀ JA¢UÀÆ vÉUÉzÀĺÁPÀ®àqÀzÀ qÁmÁ

96. Strategic value of data mining is

(A) time-sensitive (B) work-sensitive
(C) cost- sensitive (D) technical-sensitive
zÀvÀÛ UÀtÂUÁjPÉAiÀÄ PÁAiÀÄðvÀAvÀæ ªÀiË®åªÀÅ F PɼÀV£ÀªÀÅUÀ¼À°è AiÀiÁªÀÅzÁVzÉ ?
(A) ¸ÀªÀÄAiÀÄzÀ ¸ÀÆPÀëöävÉ (B) PÉ®¸ÀzÀ ¸ÀÆPÀëöävÉ
(C) ¨É2ÉAiÀÄ ¸ÀÆPÀëöävÉ (D) vÁAwæPÀ ¸ÀÆPÀëöävÉ

97. The term ____________ refer loosely to the process of semi-automatically analyzing large
databases to find useful pattern.
(A) data analysis (B) data warehouse
(C) data mining (D) knowledge discovery
MAzÀÄ G¥ÀAiÀÄÄPÀÛ ªÀiÁzÀjAiÀÄ£ÀÄß ºÀÄqÀÄPÀĪÀÅzÀPÁÌV ¸É«Ä DmÉÆêÉÄnPÀ° C£Á2ÉʹAUï
2Á¦ÿóð qÁmÁ ¨ÉÃ¸ï ¥ÀæQæAiÉÄAiÀÄ£ÀÄß G2ÉèÃT¸ÀĪÀ ¥ÀzÀ _______
(A) qÁmÁ C£Á°¹¸ï (B) qÁmÁ ªÉÃgïºË¸ï
(C) qÁmÁ ªÉÄʤA˜µó (D) £Á2ÉqïÓ r¸À̪Àj

Space For Rough Work

A-1 28 Computer Science

98. Meta data is used by end user for the purpose of
(A) managing database (B) querying
(C) making decisions (D) structuring database
ªÉÄmÁ zÀvÀÛªÀ£ÀÄß ’ðëÄð²ìåê §¼ÀPÉzÁgÀgÀÄ AiÀiÁªÀ PÁgÀtPÉÌ G¥ÀAiÉÆÃV¸ÀÄvÁÛgÉ ?
(A) zÀvÁÛA±ÀzÀ ¤ªÀðºÀuÉUÉ (B) ¥Àæ²ß¸ÀĪÀ GzÉÝñÀ
(C) ¤tðAiÀÄ ªÀiÁqÀ®Ä (D) zÀvÁÛA±ÀzÀ ¸ÀAgÀZÀ£ÉUÉ

99. A type of classifier that gives accurate classification across a range of application is
(A) Binary split (B) Multiway split
(C) Overfitting (D) Support vector machine
J2Áè C¦èÃPÉõÀ£ïUÀ¼À£ÀÄß ¸ÀjAiÀiÁV «AUÀr¸ÀĪÀ MAzÀÄ §UÉAiÀÄ PÁè¹¥sÉÊAiÀÄgï AiÀiÁªÀÅzÀÄ ?
(A) ¨ÉÊ£Àj ¹à÷èmï (B) ªÀÄ°ÖªÉà ¹à÷èmï
(C) NªÀgïÇ·n
Ý ÖAUï (D) ¸À¥ÉÆÃmïð ªÉPÁÖgï ªÉĶ£ï

100. Data scrubbing is a process of

(A) rejecting data from the data warehouse and to create the necessary indexes.
(B) loading the data in the data warehouse and to create the necessary indexes.
(C) upgrading the quality of data after it is moved into a data warehouse.
(D) upgrading the quality of data before it is moved into a data warehouse.
qÁmÁ ¸ÀÌç©âAUï, F ¥ÀæQæAiÉÄAiÀÄÄ
(A) qÁmÁ ªÉÃgïºË¸ï¤AzÀ qÁmÁªÀ£ÀÄß w²µ¸å ÀÌj¸ÀÄvÀÛzÉ ªÀÄvÀÄÛ CUÀvÀå EAqÉPïìUÀ¼À£ÀÄß
gÀa¸ÀÄvÀÛzÉ.
(B) qÁmÁ ªÉÃgïºË¸ï¤AzÀ qÁmÁªÀ£ÀÄß 2ÉÆÃqï ªÀiÁqÀÄvÀÛzÉ ªÀÄvÀÄÛ CUÀvÀå
EAqÉPïìUÀ¼À£ÀÄß gÀa¸ÀÄvÀÛzÉ.
(C) qÁmÁªÀ£ÀÄß, qÁmÁ ªÉÃgïºË¸ï£ÉƼÀUÉ ¸ÉÃj¹zÀ £ÀAvÀgÀ CzÀgÀ UÀÄtªÀÄlÖªÀ£ÀÄß
ªÀ¢üð¸ÀÄvÀÛzÉ.
(D) qÁmÁªÀ£ÀÄß ªÉÃgïºË¸ï£ÉƼÀUÉ ¸ÉÃj¸ÀĪÀ ªÀÄÄAavÀªÉà CzÀgÀ UÀÄtªÀÄlÖªÀ£ÀÄß
ªÀ¢üð¸ÀÄvÀÛzÉ.
___________
Space For Rough Work

Computer Science 29 A-1

 Space For Rough Work

Space For Rough Work

A-1 30 Computer Science

 Space for Rough Work

Space For Rough Work

Computer Science 31 A-1

 ¸ÀàzsÁðvÀäPÀ ¥ÀjÃPÉë 2016 GFGC
¢£ÁAPÀ «µÀAiÀÄ «µÀAi ÀÄ ¸ÀAPÉÃvÀ
«µÀAiÀÄ ¸ÀªÀÄAiÀÄ
05-03-2016 ˜µ¸
å ’å Õ¦ÿæÄö å 18 ªÀÄ.2.00
ªÀÄ. jAzÀ ¸ÀA.5.00
¸ÀA. gÀ ªÀgÉUÉ
UÀjµÀÖ CAPÀUÀ¼ÀÄ MlÄÖ CªÀ¢ü GvÀÛj¸À®Ä EgÀĪÀ UÀjµÀÖ CªÀ¢ü
200 210 ¤«ÄµÀUÀ¼ÀÄ
¤«ÄµÀUÀ¼ÀÄ 180 ¤«ÄµÀUÀ¼ÀÄ
¤ªÀÄä £ÉÆAzÀt ¸ÀASÉåAiÀÄ£ÀÄß ¨gɬÄj ¥Àæ±ÉߥÀwæPÉAi
ÉAiÀÄ
ÀÄ «ªÀgÀUÀ¼ÀÄ
¥Àæ±ÉߥÀwæPÉAiÀÄ PÀæªÀÄ ¸ÀASÉå Ôåê¼åê¾ ªÀµÀð£ï ¸ÀASÉå

ªÀiÁr
1. £ÉÆAzÀt ¸ÀASÉåAiÀÄ£ÀÄß N.JA.Dgï. GvÀÛgÀ ¥ÀwæPÉAiÀÄ°è §gÉzÀÄ CzÀPÉÌ ¸ÀA§A¢ü¹zÀ ªÀÈvÀÛUÀ¼À£ÀÄß ¸ÀA¥ÀÆtðªÁV vÀÄA©¢ÝÃgÉAzÀÄ
SÁwæ¥Àr¹PÉƽî.
2. PÉÃAzÀæ ¸ÀAPÉÃvÀªÀ£ÀÄß N.JA.Dgï. GvÀÛgÀ ¥ÀwæPÉAiÀÄ°è §gÉzÀÄ CzÀPÉÌ ¸ÀA§A¢ü¹zÀ ªÀÈvÀÛUÀ¼À£ÀÄß ¸ÀA¥ÀÆtðªÁV vÀÄA©¢ÝÃgÉAzÀÄ
SÁwæ¥Àr¹PÉƽî.
3. ¥ÀjÃPÁë «µÀAiÀĪÀ£ÀÄß N.JA.Dgï. GvÀÛgÀ ¥ÀwæPÉAiÀÄ°è §gÉzÀÄ ºÁUÀÄ «µÀAiÀÄzÀ ¸ÀAPÉÃvÀªÀ£ÀÄß §gÉzÀÄ CzÀPÉÌ ¸ÀA§A¢ü¹zÀ ªÀÈvÀÛUÀ¼À£ÀÄß
¸ÀA¥ÀÆtðªÁV vÀÄA©¢ÝÃgÉAzÀÄ SÁwæ¥Àr¹PÉƽî.
4. PÉÆoÀr ªÉÄðéZÁgÀPÀjAzÀ F ¥Àæ±Éß ¥ÀwæPÉAiÀÄ£ÀÄß ¤ªÀÄUÉ 2£Éà ¨ÉGï DzÀ £ÀAvÀgÀ CAzÀgÉ ªÀÄ. 1.55 DzÀ £ÀAvÀgÀ PÉÆqÀGÁUÀĪÀÅzÀÄ.
5. ¥Àæ±Éß ¥ÀwæPÉAiÀÄ PÀæªÀÄ ¸ÀASÉåAiÀÄ£ÀÄß N.JA.Dgï. GvÀÛgÀ ¥ÀwæPÉAiÀÄ°è §gÉAiÀĨÉÃPÀÄ.
6. ¥Àæ±Éß ¥ÀwæPÉAiÀÄ ªÀµÀð£ï ¸ÀASÉå,, N.JA.Dgï. GvÀÛgÀ ¥ÀwæPÉAiÀÄ°è §gÉzÀÄ CzÀPÉÌ ¸ÀA§A¢ü¹zÀ ªÀÈvÀÛUÀ¼À£ÀÄß ¸ÀA¥ÀÆtðªÁV vÀÄA§¨ÉÃPÀÄ.
7. N.JA.Dgï. GvÀÛgÀ ¥ÀwæPÉAiÀÄ PɼÀ¨sÁUÀzÀ ¤UÀ¢vÀ eÁUÀz°è PÀqÁØAiÀĪÁV ¸À» ªÀiÁqÀ¨ÉÃPÀÄ.
ªÀiÁqÀ¨ÉÃr
1. N.JA.Dgï. GvÀÛgÀ ¥ÀwæPÉAiÀÄ°è ªÀÄÄ¢ævÀªÁVgÀĪÀ mÉÊ«ÄAUï ªÀiÁPÀð£ÀÄß wzÀݨÁgÀzÀÄ / ºÁ¼ÀĪÀiÁqÀ¨ÁgÀzÀÄ / C½¸À¨ÁgÀzÀÄ.
2. ªÀÄÆgÀ£Éà ¨ÉGï ªÀÄ. 2.00 PÉÌ DUÀÄvÀÛzÉ. C°èAiÀĪÀgÉUÀÆ,
• ¥Àæ±Éß ¥ÀwæPÉAiÀÄ §®¨sÁUÀzÀ°ègÀĪÀ ¦£ï CxÀªÁ ¹ÃGï C£ÀÄß vÉUÉAiÀĨÁgÀzÀÄ.
• ¥Àæ±Éß ¥ÀwæPÉAiÀÄ M¼ÀUÀqÉ EgÀĪÀ ¥Àæ±ÉßUÀ¼À£ÀÄß £ÉÆÃqÀ®Ä ¥ÀæAiÀÄw߸À¨ÁgÀzÀÄ.
• N.JA.Dgï. GvÀÛgÀ ¥ÀwæPÉAiÀÄ°è GvÀÛj¸À®Ä ¥ÁægÀA©ü¸¨ÁgÀzÀÄ.
C¨sÀåyðUÀ½UÉ ªÀÄÄRå ¸ÀÆZÀ£ÉUÀ¼ÀÄ
1. ¥Àæ±Éß ¥ÀwæPÉAiÀÄ°è MlÄÖ 100 ¥Àæ±ÉßUÀ½zÀÄÝ, ¥Àæw ¥Àæ±ÉßAiÀÄÄ MAzÀÄ ºÉýPÉAiÀÄ£ÀÄß M¼ÀUÉÆArzÀÄÝ ªÀÄvÀÄÛ 4 §ºÀÄ DAiÉÄÌ GvÀÛgÀUÀ¼ÀÄ EgÀÄvÀÛªÉ.
2. ªÀÄÆgÀ£Éà ¨ÉGï CAzgÉ ªÀÄ. 2.00 gÀ £ÀAvÀgÀ ¥Àæ±Éß ¥ÀwæPÉAiÀÄ §®¨sÁUÀzÀ°ègÀĪÀ ¦£ï / ¹ÃGï vÉUÉzÀÄ F ¥Àæ±Éé ¥ÀwæPÉAiÀÄ°è AiÀiÁªÀÅzÉÃ
¥ÀÄlUÀ¼ÀÄ ªÀÄÄ¢ævÀªÁV®èzÉà EgÀĪÀÅzÀÄ PÀAqÀÄ §AzÀ°è CxÀªÁ ºÀjzÀÄ ºÉÆÃVzÀÝ°è CxÀªÁ AiÀiÁªÀÅzÉà LlAUÀ¼ÀÄ ©lÄÖºÉÆÃVzÀÝ°è,
CzÀ£ÀÄß RavÀ¥Àr¹PÉÆAqÀÄ, F jÃw DVzÀÝgÉ ¥Àæ±ÉߥÀwæPÉAiÀÄ£ÀÄß §zÀGÁ¬Ä¹PÉƼÀÄîªÀÅzÀÄ £ÀAvÀgÀ N.JA.Dgï. GvÀÛgÀ ¥ÀwæPÉAiÀÄ°è
GvÀÛj¸À®Ä ¥ÁægÀA©ü¸ÀĪÀÅzÀÄ.
3. ªÀÄÄA¢£À 180 ¤«ÄµÀUÀ¼À°è
• ¥Àæw ¥Àæ±ÉßAiÀÄ£ÀÄß JZÀÑjPɬÄAzÀ N¢.
• ¥Àæw ¥Àæ±ÉßAiÀÄ PɼÀUÉ PÉÆnÖgÀĪÀ £Á®ÄÌ §ºÀÄ DAiÉÄÌAiÀÄ GvÀÛgÀUÀ¼À°è ¸ÀjAiÀiÁzÀ GvÀÛgÀªÀ£ÀÄß DAiÉÄÌ ªÀiÁr.
• ¥Àæ±Éß ¥ÀwæPÉAiÀÄ°è£À ¥Àæ±ÉßUÉ C£ÀÄUÀÄtªÁVgÀĪÀ ¸Àj GvÀÛgÀªÀ£ÀÄß N.JA.Dgï. GvÀÛgÀ ¥ÀwæPÉAiÀÄ°è CzÉà PÀæªÀÄ ¸ÀASÉåAiÀÄ ªÀÄÄAzÉ
¤ÃrgÀĪÀ ¸ÀA§A¢ü¹zÀ ªÀÈvÀÛªÀ£ÀÄß ¤Ã° CxÀªÁ PÀ¥ÀÄà ±Á¬ÄAiÀÄ ¨ÁGï ¥Á¬ÄAmï ¥É£ï¤AzÀ ¸ÀA¥ÀÆtðªÁV vÀÄA§ÄªÀÅzÀÄ.
N.JA.Dgï. GvÀÛgÀ ¥ÀwæPÉAiÀÄ°ègÀĪÀ ªÀÈvÀÛUÀ¼À£ÀÄß vÀÄA§ÄªÀ ¸ÀjAiÀiÁzÀ «zsÁ£À : A B C D
4. F N.JA.Dgï. GvÀÛgÀ ¥ÀwæPÉAiÀÄ£ÀÄß ¸ÁÌöå£ï ªÀiÁqÀĪÀ ¸ÁÌöå£gï §ºÀ¼À ¸ÀÆPÀëöäªÁVzÀÄÝ ¸ÀtÚ UÀÄgÀÄvÀ£ÀÄß ¸ÀºÀ zÁR°¸ÀÄvÀÛzÉ. DzÀÝjAzÀ
N.JA.Dgï. GvÀÛgÀ ¥ÀwæPÉAiÀÄ°è GvÀÛj¸ÀĪÁUÀ JZÀÑjPÉ ªÀ»¹.
5. ¥Àæ±Éß ¥ÀwæPÉAiÀÄ°è PÉÆnÖgÀĪÀ SÁ° eÁUÀªÀ£ÀÄß gÀ¥sï PÉ®¸ÀPÉÌ G¥ÀAiÉÆÃV¹. N.JA.Dgï. GvÀÛgÀ ¥ÀwæPÉAiÀÄ£ÀÄß EzÀPÉÌ G¥ÀAiÉÆÃV¸À¨ÉÃr.
6. PÉÆ£ÉAiÀÄ ¨ÉGï CAzÀgÉ ¸ÀA. 5.00 DzÀ £ÀAvÀgÀ GvÀÛj¸ÀĪÀÅzÀ£ÀÄß ¤°è¹. ¤ªÀÄä JqUÉÊ ºÉ§âgÀ¼À UÀÄgÀÄvÀ£ÀÄß ¤UÀ¢vÀ eÁUÀzÀ°è ºÁQ.
7. N.JA.Dgï. GvÀÛgÀ ¥ÀwæPÉAiÀÄ£ÀÄß PÉÆoÀr ªÉÄðéZÁgÀPÀjUÉ AiÀÄxÁ¹ÜwAiÀÄ°è ¤Ãrj.
8. PÉÆoÀr ªÉÄðéZÁgÀPÀgÀÄ, ªÉÄÃGÁãUÀzÀ ºÁ¼ÉAiÀÄ£ÀÄß ¥ÀævÉåÃQ¹ vÀ£Àß ªÀ±ÀzÀ°è ElÄÖPÉÆAqÀÄ vÀ¼À§¢AiÀÄ AiÀÄxÁ¥ÀæwAiÀÄ£ÀÄß C¨sÀåyðUÀ½UÉ
¸ÀéAiÀÄA ªÀiË®åªÀiÁ¥À£ÀPÁÌV ªÀÄ£ÉUÉ PÉÆAqÉÆAiÀÄå®Ä PÉÆqÀÄvÁÛgÉ.
9. GvÀÛgÀ ¥ÀwæPÉAiÀÄ £ÀPÀ®£ÀÄß MAzÀÄ ªÀµÀð PÁ® ¸ÀÄgÀQëvÀªÁV Er.
10. PÀ£ÀßqÀ DªÀÈwÛAiÀÄ ¥Àæ±ÉßUÀ¼À°è GvÀÛj¸ÀĪÀ C¨sÀåyðUÀ½UÉ PÀ£ÀßqÀzÀ°è ªÀÄÄ¢ævÀªÁVgÀĪÀ ¥Àæ±ÉßUÀ¼À §UÉÎ K£ÁzÀgÀÆ ¸ÀAzÉúÀ«zÀÝ°è
EAVèõï DªÀÈwÛAiÀÄ ¥Àæ±ÉߥÀwæPÉAiÀÄ£ÀÄß £ÉÆÃqÀ§ºÀÄzÀÄ. 18