Data Structure and Algorithms (DSA) Solved MCQs

1.

It exports a set of operations

A. true, false
B. false, true
C. true, true
D. false, false
Answer» C. true, true
2.

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

A. true, false, true
B. true, true, false
C. true, true, true
D. false, true, true
Answer» B. true, true, false
3.

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

A. a-iii, b-ii, c-i
B. a-i, b-ii, c-iii
C. a-iii, b-i, c-ii
D. a-i, b-iii, c-ii
Answer» C. a-iii, b-i, c-ii
4.

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

A. true, false
B. false, true
C. false, false
D. true, true
Answer» D. true, true
5.

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

A. true, true
B. false, true
C. false, false
D. true, false
Answer» A. true, true
6.

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

A. i-only
B. ii-only
C. both i and ii
D. none of both
Answer» C. both i and ii
7.

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

A. true, true
B. true, false
C. false, true
D. false, false
Answer» C. false, true
8.

A node is child node if out degree is one.

A. true, true
B. true, false
C. false, true
D. false, false
Answer» B. true, false
9.

Insertion b) Deletion c) Retrieval d) Traversal

A. only a,b and c
B. only a and b
C. all of the above
D. none of the above
Answer» D. none of the above
10.

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

A. true, false
B. false, true
C. true, true
D. false, false
Answer» C. true, true
11.

The complexity of the average case of an algorithm is

A. much more complicated to analyze than that of worst case
B. much more simpler to analyze than that of worst case
C. sometimes more complicated and some other times simpler than that of worst case
D. none or above
Answer» A. much more complicated to analyze than that of worst case
12.

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
D. when item is the last element in the array or is not there at all
Answer» A. when item is somewhere in the middle of the array
13.

Which of the following case does not exist in complexity theory

A. best case
B. worst case
C. average case
D. null case
Answer» D. null case
14.

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
Answer» A. counting the maximum memory needed by the algorithm
15.

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
Answer» B. counting the number of key operations
16.

Two main measures for the efficiency of an algorithm are

A. processor and memory
B. complexity and capacity
C. time and space
D. data and space
Answer» C. time and space
17.

Computers are used for processing numerical data called _______ data.

A. float
B. local
C. character
D. non-local
Answer» C. character
18.

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

A. character
B. integer
C. float
D. numeric
Answer» A. character
19.

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

A. array
B. list
C. string
D. block
Answer» C. string
20.

String with zero characters is called ________ string.

A. null
B. binary
C. totalled
D. list
Answer» A. null
21.

A computer which can access an individual byte is called a ________ machine.

A. memory addressable
B. byte addressable
C. bit
D. byte
Answer» B. byte addressable
22.

Groups of consecutive elements in a string, such as words, phrases and sentences are called ________.

A. main strings
B. substring
C. index
D. block
Answer» B. substring
23.

The number of characters in a string is called its ______.

A. length
B. breath
C. width
D. none
Answer» C. width
24.

_________ operation of word processing involves replacing one string in the text by another.

A. insertion
B. deletion
C. searching
D. replacement
Answer» D. replacement
25.

________ is the problem of deciding whether or not a given String pattern P appears in a text T.

A. pattern matching
B. searching
C. sorting
D. deletion
Answer» A. pattern matching
Tags
Question and answers in Data Structure and Algorithms (DSA), Data Structure and Algorithms (DSA) multiple choice questions and answers, Data Structure and Algorithms (DSA) Important MCQs, Solved MCQs for Data Structure and Algorithms (DSA), Data Structure and Algorithms (DSA) MCQs with answers PDF download

We need your help!

We're developing a website for study materials for students.
We would love to hear your answers to some of the questions.

Take Survey