Friday, 7 October 2016

Computer Operator - KIRTADS Solved Paper (132/2015) - Part 5

41.       The average time required to perform a successful sequential search for an element in a array with n elements:
(A) n/2                (B) (n+1)/2
(C) (n-1)/2         (D) 2n
Answer: B
42.       Each node in a tree has a value greater than all values in the left subtree and has a value less than all values in the right subtree. Then the tree is:
(A) Binary search tree             (B) Complete tree
(C) Balanced tree                    (D) Threaded tree
Answer: A
43.       The sort method that switches the adjacent elements, if needed after comparison is:
(A) Heap sort                (B) Quick sort
(C) Insertion sort          (D) Bubble sort
Answer: D
44.       Minimum number of queues needed to implement the priority queue is:
(A) 1       (B) 2
(C) 3       (D) 4
Answer: B
45.       After a sequence of steps in an algorithm, a linked list reaches the following step, START=NULL
Then the situation is,
(A) overflow                  (B) underflow
(C) initialisation                       (D) saturation
Answer: B

46.       The result of following expression in polish notation is
4 3 2 + * 8 4 /-
(A) 13                 (B) 12
(C) 18                 (D) 34
Answer: C
47.       The data structure that can implement a recursive procedure is:
(A) Tree             (B) Linked List
(C) Queue         (D) Stack
Answer: D
48.       For a sorted linked list of length n, the worst case time required to search a given element is:
(A) O(n)             (B) O(2n)
(C) O(log2 n)     (D) O(log2 2n)
Answer: A
49.       The characteristic of the elements that is maximum utilized in binary search is:
(A) Length of the list   (B) Number of elements in the list
(C) Order of the list      (D) Highest value in the list
Answer: C
50.    For a binary tree with nine nodes, the result of inorder traversal is: D B A G E C H F I. And that of postorder traversal is: D B G E H I F C A. Then the result of preorder traversal is:
(A) A B D C E G F H I
(B) A B D E C F G H I
(C) A D B C E F G H I
(D) A D B E F C G H I
Answer: A


Post a Comment