Title  

It exports a set of operationsIt exports a set of operations
The answer is:
C. true, true


A graph is said to be complete if there is no edge between every pair of verticesA graph is said to be complete if there is no edge between every pair of vertices.
The answer is:
A. true, false, true


Space Complexity iii) Is the strategy guaranteed to find the solution when there in oneSpace Complexity iii) Is the strategy guaranteed to find the solution when there in one.
The answer is:
C. aiii, bi, cii


The time complexity of binary search is O(logn)The time complexity of binary search is O(logn).
The answer is:
D. true, true


A graph is said to be complete if there is an edge between every pair of verticesA graph is said to be complete if there is an edge between every pair of vertices.
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 listTo find the predecessor, it is required to traverse the list from the first node in case of singly linked list.
The answer is:
C. both i and ii


Nodes that are not root and not leaf are called as internal nodesNodes that are not root and not leaf are called as internal nodes.
The answer is:
C. false, true


A node is child node if out degree is oneA node is child node if out degree is one.
The answer is:
B. true, false


Insertion b) Deletion c) Retrieval d) TraversalInsertion b) Deletion c) Retrieval d) Traversal
The answer is:
D. none of the above


In strictly binary tree, the outdegree of every node is either o or 2In strictly binary tree, the outdegree of every node is either o or 2.
The answer is:
C. true, true


The complexity of the average case of an algorithm isThe complexity of the average case of an algorithm is
The answer is:
A. much more complicated to analyze than that of worst case


The Average case occur in linear search algorithmThe Average case occur in linear search algorithm
The answer is:
A. when item is somewhere in the middle of the array


Which of the following case does not exist in complexity theoryWhich of the following case does not exist in complexity theory
The answer is:
D. null case


The space factor when determining the efficiency of algorithm is measured byThe space factor when determining the efficiency of algorithm is measured by
The answer is:
A. counting the maximum memory needed by the algorithm


The time factor when determining the efficiency of algorithm is measured byThe time factor when determining the efficiency of algorithm is measured by
The answer is:
B. counting the number of key operations


Two main measures for the efficiency of an algorithm areTwo main measures for the efficiency of an algorithm are
The answer is:
C. time and space


Computers are used for processing numerical data called _______ dataComputers are used for processing numerical data called _______ data.
The answer is:
C. character


Each programming language contains a ______ set that is used to communicate with the computerEach programming language contains a ______ set that is used to communicate with the computer.
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 _______.
The answer is:
C. string


String with zero characters is called ________ stringString with zero characters is called ________ string.
The answer is:
A. null

MCQs
Views
Best Answers
Points