Computer Operator Mcqs Etea Past Papers

Computer Operator Mcqs Etea Past Papers

Computer Operator Mcqs Etea

-Multiple Choice Questions:

Q. The Complexity of binary search algorithm is
(a) O(log n)
(b) O(n)
(c) O(n log n)
(d) O(n2)

View Answer
(a) O(log n)

Q. Breadth first search is used in
(a) Binary tree
(b) Stacks
(c) Graphs
(d) Queues

View Answer
(c) Graphs

Q. A linked list whose last node points back to the list instead of containing the null pointer
(a) Circular list
(b) Linked list
(c) Circular doubly linked list
(d) Doubly linked list

View Answer
(a) Circular list

Q. Which among the following belongs to the category of a Pre-order Traversal?
(a) Root -> Left Sub Tree -> Right Sub Tree
(b) Root -> Right Sub Tree -> Left Sub Tree
(c) Right Sub Tree -> Left Sub Tree -> Root
(d) left Sub Tree -> right Sub Tree -> Root

View Answer
(a) Root -> Left Sub Tree -> Right Sub Tree

Q. Which of the following is the fastest sorting algorithm to sort lists?
(a) Insertion Sort
(b) Merge Sort
(c) Quick Sort
(d) Bubble sort

View Answer
(c) Quick Sort

 

Pages ( 1 of 8 ): 1 23 ... 8Next »