Category Archives: Computer Ques

Part 4 Compter Fundamentals

Marks: 2.00

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

Choose one answer.

Question 42

Marks: 2.00

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

Choose one answer.

Question 43

Marks: 2.00

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

Choose one answer.

Question 44

Marks: 2.00

Binary search algorithm can not be applied to

Choose one answer.

Question 45

Marks: 2.00

An isolated vertex is a vertex whose degree is

Choose one answer.

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

Choose one answer.

Question 27

Marks: 1.00

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

Choose one answer.

Question 28

Marks: 1.00

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

Choose one answer.

Question 29

Marks: 1.00

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

Choose one answer.

Question 30

Marks: 1.00

The Worst case occur in linear search algorithm when

Choose one answer.

Part 2 Compter Fundamentals of Algorithms Solved MCQs from Quiz

Marks: 1.00

The Average case occur in linear search algorithm

Choose one answer.

Question 22

Marks: 1.00

The depth of a complete binary tree is given by

Choose one answer.

Question 23

Marks: 1.00

The depth of a complete binary tree is given by

Choose one answer.

Question 24

Marks: 1.00

The difference between linear array and a record is

Choose one answer.

Question 25

Marks: 1.00

The elements of an array are stored successively in memory cells because

Choose one answer.