Part 4 Compter Fundamentals

Marks: 2.00

A binary tree whose every node has either zero or two children is called

 a. a. Complete binary tree b. b. Binary search tree c. c.   Extended binary tree d. d. None of above

Question 42

Marks: 2.00

A data structure where elements can be added or removed at either end but not in the middle

 a. a. Linked lists b. b. Stacks c. c. Queues d. d. Deque

Question 43

Marks: 2.00

A graph that contains every possible edge between all the vertices is called

 a. Complete graph b. Simple graph c. null graph d. None of these

Question 44

Marks: 2.00

Binary search algorithm can not be applied to

 a. a. sorted linked list b. b. sorted binary trees c. c. sorted linear array d. d. pointer array

Question 45

Marks: 2.00

An isolated vertex is a vertex whose degree is

 a. 3 b. 2 c. 1 d. 0

Part 3 Computer Fundamentals of Algorithms Solved MCQs

Marks: 1.00

The indirect change of the values of a variable in one module by another module is called

 a. internal change b. inter-module change c. side effect d. side-module update

Question 27

Marks: 1.00

The space factor when determining the efficiency of algorithm is measured by

 a. Counting the maximum memory needed by the algorithm b. Counting the minimum memory needed by the algorithm c. Counting the average memory needed by the algorithm d. Counting the maximum disk space needed by the algorithm

Question 28

Marks: 1.00

The time factor when determining the efficiency of algorithm is measured by

 a. Counting microseconds b. Counting the number of key operations c. Counting the number of statements d. Counting the kilobytes of algorithm

Question 29

Marks: 1.00

The time factor when determining the efficiency of algorithm is measured by

 a. Counting microseconds b. Counting the number of key operations c. Counting the number of statements d. Counting the kilobytes of algorithm

Question 30

Marks: 1.00

The Worst case occur in linear search algorithm when

 a. Item is somewhere in the middle of the array b. Item is not in the array at all c. Item is the last element in the array d. Item is the last element in the array or is not there at all

Part 2 Compter Fundamentals of Algorithms Solved MCQs from Quiz

Marks: 1.00

The Average case occur in linear search algorithm

 a. When Item is somewhere in the middle of the array b. When Item is not in the array at all c. When Item is the last element in the array or is not there at all d. None of these

Question 22

Marks: 1.00

The depth of a complete binary tree is given by

 a. a. Dn = n log2n b. b. Dn = n log2n+1 c. c.   Dn = log2n d. d. Dn = log2n+1

Question 23

Marks: 1.00

The depth of a complete binary tree is given by

 a. Dn = n log2n b.  Dn = n log2n+1 c. Dn = log2n d. Dn = log2n+1

Question 24

Marks: 1.00

The difference between linear array and a record is