Data Structure and Algorithms (DSA) solved MCQs

Title
It exports a set of operations It exports a set of operations true, false false, true true, true false, false discuss The answer is: C. true, true
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. true, false, true true, true, false true, true, true false, true, true discuss The answer is: A. true, false, 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. a-iii, b-ii, c-i a-i, b-ii, c-iii a-iii, b-i, c-ii a-i, b-iii, c-ii discuss The answer is: C. a-iii, b-i, c-ii
The time complexity of binary search is O(logn) The time complexity of binary search is O(logn). true, false false, true false, false true, true discuss The answer is: D. 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. true, true false, true false, false true, false discuss The answer is: A. true, true
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. i-only ii-only both i and ii none of both discuss The answer is: C. both i and ii
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. true, true true, false false, true false, false discuss The answer is: C. false, true
A node is child node if out degree is one A node is child node if out degree is one. true, true true, false false, true false, false discuss The answer is: B. true, false
Insertion b) Deletion c) Retrieval d) Traversal Insertion b) Deletion c) Retrieval d) Traversal only a,b and c only a and b all of the above none of the above discuss The answer is: D. 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. true, false false, true true, true false, false discuss The answer is: C. true, true
The complexity of the average case of an algorithm is The complexity of the average case of an algorithm is much more complicated to analyze than that of worst case much more simpler to analyze than that of worst case sometimes more complicated and some other times simpler than that of worst case none or above discuss The answer is: A. much more complicated to analyze than that of worst case
The Average case occur in linear search algorithm The Average case occur in linear search algorithm when item is somewhere in the middle of the array when item is not in the array at all when item is the last element in the array when item is the last element in the array or is not there at all discuss The answer is: A. when item is somewhere in the middle of the array
Which of the following case does not exist in complexity theory Which of the following case does not exist in complexity theory best case worst case average case null case discuss The answer is: D. 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 counting the maximum memory needed by the algorithm counting the minimum memory needed by the algorithm counting the average memory needed by the algorithm counting the maximum disk space needed by the algorithm discuss The answer is: A. counting the maximum memory 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 counting microseconds counting the number of key operations counting the number of statements counting the kilobytes of algorithm discuss The answer is: B. counting the number of key operations
Two main measures for the efficiency of an algorithm are Two main measures for the efficiency of an algorithm are processor and memory complexity and capacity time and space data and space discuss The answer is: C. time and space
Computers are used for processing numerical data called _______ data Computers are used for processing numerical data called _______ data. float local character non-local discuss The answer is: C. character
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. character integer float numeric discuss The answer is: A. character
Finite sequence S of zero or more characters is called _______ Finite sequence S of zero or more characters is called _______. array list string block discuss The answer is: C. string
String with zero characters is called ________ string String with zero characters is called ________ string. null binary totalled list discuss The answer is: A. null

Title