Kerala PSC Previous Years Question Paper & Answer
Page:16
Below are the scanned copy of Kerala Public Service Commission (KPSC) Question Paper with answer keys of Exam Name ' Instructor Gr I (Engineering Colleges) in Information Technology & Computer Engineering' And exam conducted in the year 2022. And Question paper code was '091/2022'. Medium of question paper was in Malayalam or English . Booklet Alphacode was 'A'. Answer keys are given at the bottom, but we suggest you to try answering the questions yourself and compare the key along wih to check your performance. Because we would like you to do and practice by yourself.
091/22
68.
69.
70.
71.
What will be the output of the following program ?
class Base {
public static void display( ) {
System.out.print(“l am Base”);
}
}
class Derived extends Base {
public static void display( ) {
super.display( );
System.out.print(‘l am Derived”) ;
}
}
public class Test3 {
public static void main (String[] args) {
Base b = new Derived();
b.display();
}
| ലന Base
| am Derived
| am Base | am Derived
D) Compilation Error
The pre-order traversal of a binary search tree is given by 11, 7, 5, 1, 6, 8, 9, 15, 14, 18,
16, 19. Then the post-order traversal of this tree is
A) 1, 5, 6, 7, 8, 9, 11, 14, 15, 16, 18, 19
8) 1, 6, 5, 9, 8, 7, 14, 16, 19, 18, 15, 11
C) 6, 3, 5, 7, 8, 9, 19, 16, 18, 14, 15, 11
0) 6, 5, 1, 9, 8, 7, 14, 15, 16, 19, 18, 11
An unordered list contains m distinct elements. The number of comparisons to find an
element in this list that is neither maximum nor minimum is
A) O(m) B) O(log m) C) O(log(log m)) 0) 00)
Level order traversal of a rooted tree canbe done by starting from the root and performing
which of the following ?
A) Preorder traversal B) Depth first search
C) Postorder traversal D) Breadth first search
-16-