Computer Science Study Materials for Competitive Exams

Sample Questions, Previous Year Solved Papers, Study Materials For Competitive Examinations Like UGC NET, SET And GATE Computer Science.

Wednesday, 11 October 2017

Kerala SET Computer Science Paper II 2010 - Part 5

81.       A Report can be based on a
(A) Table but not a view
(B) View but not a table
(C) Table or a view
(D) All of the above
Answer: C
82.       What is the environment variable that contains a list of directories where Java looks for classes referenced in a program?
(A) PATHCLASS
(B) SEARCHPATH
(C) PATH
(D) CLASSPATH
Answer: D
83.       Garbage collector in Java frees the programmer from worrying about
(A) Memory leaks
(B) Dangling references
(C) Creating new objects
(D) Recursion
Answer: A,B
84.       Which of the following does not have a super class in Java?
(A) System
(B) Object
(C) Lang
(D) Exception
Answer: B
85.       In Java the constants that cannot be changed are declared using the keyword
(A) Final
(B) Static
(C) Abstract
(D) Immutable
Answer: A
86.       Let L denote the language generated by grammar S->0S0|00 which of the following is true?
(A) L=0+
(B) L is regular but not 0+
(C) L is context free but not regular
(D) L is not context free
Answer: B
87.       Which of the following can be used to generate HTML documentation from a Java source code?
(A) Javadoc
(B) JavaHtmlDoc
(C) Javac
(D) Jar
Answer: A
88.       The number of tokens in the following C statement printf(“i=%d, &i=%x”, i, &i ); is
(A) 3
(B) 26
(C) 10
(D) 21
Answer: C
89.       Which of the following method is invoked by the garbage collector in Java?
(A) Final
(B) Constructor
(C) Finally
(D) Finalize
Answer: D
90.    The java compiler generates
(A) Assembly language
(B) Machine language
(C) P-code
(D) Byte code
Answer: D
91.    Which of the following is true about pass by reference in C++
1. Copy of variables are not created
2. Share the same address space
3. A mechanism to use the memory effectively
(A) 1 and 2 only
(B) 2 only
(C) 1 and 3 only
(D) 1, 2 & 3
Answer: D
92.    The maximum number of binary trees that can be formed with three unlabelled nodes is
(A) 1
(B) 5
(C) 4
(D) 3
Answer: B
93.    Which of the following is a top-down parser?
(A) Recursive descent parser
(B) Operator precedence parser
(C) An LR(k) parser
(D) An LALR(k) parser
Answer: A
94.    Which of the following uses UDP as the transport protocol?
(A) HTTP
(B) Telnet
(C) DNS
(D) SMTP
Answer: C
95.    In Ethernet, when Manchestor encoding is used the bit rate is
(A) Half the baud rate
(B) Twice the baud rate
(C) Same as the baud rate
(D) None of these
Answer: A
96.    The inorder and preorder traversal of a binary tree are
d b e a f c g and a b e c f g respectively
The postorder traversal of the binary tree is
(A) d e b f g c a
(B) e d b g f c a
(C) e d b f g c a
(D) d e f g b c a
Answer: A
97.    The address of a Class B host is to be split into subnets with a 6- bit subnet number. What is the maximum number of subnets and the maximum number of hosts in each subnet?
(A) 62 subnets and 262142 hosts               
(B) 64 subnets and 262142 hosts
(C) 62 subnets and 1022 hosts                   
(D) 64 subnets and 1024 hosts
Answer: C
98.    Which of the following algorithms have the lowest worst case complexity?
(A) Merge sort
(B) Bubble sort
(C) Quick sort
(D) Selection sort
Answer: A
99.    A machine took 200 seconds to sort 200 names, using bubble sort. In 800 seconds it can approximately sort
(A) 400 names
(B) 800 names
(C) 750 names
(D) 600 names
Answer: A
100.    A multi-user, multi processing operating system cannot be implemented on hardware that does not support
(A) Address translation
(B) DMA for disk transfer
(C) Privileged and non-privileged modes of CPU execution
(D) Demand paging
Answer: C


No comments:

Post a Comment