Data Structures and Algorithms MCQs (Chapterwise Multiple Choice Questions)

Worst case for a binary search tree is

O(n^2)

O(n)

O(2n)

O(log n)

O(n * log n)

Answer & Explanation

Correct Answer: O(n)

Note: This Question is unanswered, help us to find answer for this one

Which of the following points is/are true about Linked List data structure when it is compared with array

Arrays have better cache locality that can make them better in terms of performance.

It is easy to insert and delete elements in Linked List

Random access is not allowed in a typical implementation of Linked Lists

The size of array has to be pre-decided, linked lists can change their size any time.

All of the above

Answer & Explanation

Correct Answer: All of the above

Note: This Question is unanswered, help us to find answer for this one

Which is the best possible complexity to sort an array?

O(NlogN)

O(N*N)

O(1)

O(logN)

O(N)

Answer & Explanation

Correct Answer: O(NlogN)

Note: This Question is unanswered, help us to find answer for this one

What is the worst-case time complexity of the simple Ford-Fulkerson algorithm for finding the maximum flow in a graph given a source and a sink, and all integer capacities on edges? Assume the graph G = (V,E) has a finite, integer maximum flow value of f.

O(|E|^2|V|)

O(|V|)

O(|E|f)

O(|E||V|)

O(|E|)

Answer & Explanation

Correct Answer: O(|E|f)

Note: This Question is unanswered, help us to find answer for this one

A circuit which is a connected graph and which includes every vertex of the graph is known as_____.

Euler

Unicursal

Hamiltonian

Clique

Answer & Explanation

Correct Answer: Hamiltonian

Note: This Question is unanswered, help us to find answer for this one

Consider a hashing function that resolves collision by quadratic probing. Assume that the address space is indexed from 1 to 8. If a collision occurs at position 4, the location which will never be probed is:

4

5

8

2

Answer & Explanation

Correct Answer: 2

Note: This Question is unanswered, help us to find answer for this one

A(n) ____ control is any type of input mechanism on a form.

Variable.

Input.

Parameter.

Form. Correct

Answer & Explanation

Correct Answer: Input.

Note: This Question is unanswered, help us to find answer for this one

Collision resolution is not required if a hash function is perfect

True

False

Answer & Explanation

Correct Answer: True

Note: This Question is unanswered, help us to find answer for this one

Can a binary tree be implemented using an array?

Yes

No

Answer & Explanation

Correct Answer: Yes

Note: This Question is unanswered, help us to find answer for this one

Which is an ordered collection of elements in which insertions are restricted to the rear end and deletions are restricted to the front end?

Stack

Binary tree

Queue

Array

Answer & Explanation

Correct Answer: Queue

Note: This Question is unanswered, help us to find answer for this one

Data Structures And Algorithms Quick Quiz

Poor Results!

You need a lot of improvement.

Just don't give up!

Correct Answers: 0/10

Start Practicing with our MCQs given below.

MCQ on Basic Data Structures and Algorithms	MCQ on Data Management
MCQ on Data Transmission	MCQ on Transmission Control Protocol
General Data Structures And Algorithms MCQs

Data Structures And Algorithms MCQ

Data Structures And Algorithms Quick Quiz

Worst case for a binary search tree is

Which of the following points is/are true about Linked List data structure when it is compared with array

Which is the best possible complexity to sort an array?

What is the worst-case time complexity of the simple Ford-Fulkerson algorithm for finding the maximum flow in a graph given a source and a sink, and all integer capacities on edges? Assume the graph G = (V,E) has a finite, integer maximum flow value of f.

A circuit which is a connected graph and which includes every vertex of the graph is known as_____.

Consider a hashing function that resolves collision by quadratic probing. Assume that the address space is indexed from 1 to 8. If a collision occurs at position 4, the location which will never be probed is:

A(n) ____ control is any type of input mechanism on a form.

Collision resolution is not required if a hash function is perfect

Can a binary tree be implemented using an array?

Which is an ordered collection of elements in which insertions are restricted to the rear end and deletions are restricted to the front end?