### questions

Title
###### It exports a set of operations

It exports a set of operations

1. true, false
2. false, true
3. true, true
4. false, false
###### A graph is said to be complete if there is no edge between every pair of vertices

A graph is said to be complete if there is no edge between every pair of vertices.

1. true, false, true
2. true, true, false
3. true, true, true
4. false, true, true
###### Space Complexity iii) Is the strategy guaranteed to find the solution when there in one

Space Complexity iii) Is the strategy guaranteed to find the solution when there in one.

1. a-iii, b-ii, c-i
2. a-i, b-ii, c-iii
3. a-iii, b-i, c-ii
4. a-i, b-iii, c-ii
###### The time complexity of binary search is O(logn)

The time complexity of binary search is O(logn).

1. true, false
2. false, true
3. false, false
4. true, true
###### A graph is said to be complete if there is an edge between every pair of vertices

A graph is said to be complete if there is an edge between every pair of vertices.

1. true, true
2. false, true
3. false, false
4. true, false
###### To find the predecessor, it is required to traverse the list from the first node in case of singly linked list

To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.

1. i-only
2. ii-only
3. both i and ii
4. none of both
###### Nodes that are not root and not leaf are called as internal nodes

Nodes that are not root and not leaf are called as internal nodes.

1. true, true
2. true, false
3. false, true
4. false, false
###### A node is child node if out degree is one

A node is child node if out degree is one.

1. true, true
2. true, false
3. false, true
4. false, false
###### Insertion b) Deletion c) Retrieval d) Traversal

Insertion b) Deletion c) Retrieval d) Traversal

1. only a,b and c
2. only a and b
3. all of the above
4. none of the above
###### In strictly binary tree, the out-degree of every node is either o or 2

In strictly binary tree, the out-degree of every node is either o or 2.

1. true, false
2. false, true
3. true, true
4. false, false
###### The complexity of the average case of an algorithm is

The complexity of the average case of an algorithm is

1. much more complicated to analyze than that of worst case
2. much more simpler to analyze than that of worst case
3. sometimes more complicated and some other times simpler than that of worst case
4. none or above
###### The Average case occur in linear search algorithm

The Average case occur in linear search algorithm

1. when item is somewhere in the middle of the array
2. when item is not in the array at all
3. when item is the last element in the array
4. when item is the last element in the array or is not there at all
###### Which of the following case does not exist in complexity theory

Which of the following case does not exist in complexity theory

1. best case
2. worst case
3. average case
4. null case
###### The space factor when determining the efficiency of algorithm is measured by

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

1. counting the maximum memory needed by the algorithm
2. counting the minimum memory needed by the algorithm
3. counting the average memory needed by the algorithm
4. counting the maximum disk space needed by the algorithm
###### The time factor when determining the efficiency of algorithm is measured by

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

1. counting microseconds
2. counting the number of key operations
3. counting the number of statements
4. counting the kilobytes of algorithm
###### Two main measures for the efficiency of an algorithm are

Two main measures for the efficiency of an algorithm are

1. processor and memory
2. complexity and capacity
3. time and space
4. data and space
###### Computers are used for processing numerical data called _______ data

Computers are used for processing numerical data called _______ data.

1. float
2. local
3. character
4. non-local
###### Each programming language contains a ______ set that is used to communicate with the computer

Each programming language contains a ______ set that is used to communicate with the computer.

1. character
2. integer
3. float
4. numeric
###### Finite sequence S of zero or more characters is called _______

Finite sequence S of zero or more characters is called _______.

1. array
2. list
3. string
4. block
###### String with zero characters is called ________ string

String with zero characters is called ________ string.

1. null
2. binary
3. totalled
4. list

MCQs

Views