The heap is represented in the _______ data structure?
a) Priority queue b) Stack c) Both a and b d) None of these.
An empty heap is said to be in a state of ________.
a) Underflow b) Overflow c) Empty d) Full
Insertion into a heap can be done in ________ time.
a) O(n) b) O(logN) c) O(2n) d) O(n2)
Heap and ________ are considered to be synonyms of each other.
a) Priority queue b) Stack c) Queue d) None of these
The accessing of location of elements in a heap is _______.
a) Distinct b) Random c) Optional d) None of these
A complete binary tree can be stored as an array using _______ traversal.
a) Level-order b) High order c) Tree order d) None of these.
________ is defined as the shortest distance between source and destination.
a) Shortest path b) Longest path c) Both a and b d) None of the above
Prim’s algorithm follows a _______ approach to find a minimum spanning tree.
a) Divide and conquer. b) Greedy c) Divide d) Rotation
A connected sub graph that connects all the vertices of the original connected graph is called _______.
a) The spanning tree b) Cyclic graph c) Acyclic graph d) None of these.
Travelling salesman problem is an example of _________.
a) NP_Soft problem b) NP_Hard problem c) Both a and b d) None of these.
Dynamic programming reduces ___________.
a) Redundancy b) Robust c) Reliability d) None of these
A graph with numbers assigned to its edges is ______.
a) Weighted graph b) Unweighted graph c) Directed graph d) Undirected graph
In undirected graph adjacency matrix is _______.
a) Asymmetric b) Symmetric c) Distinct d) Vary
A ______ is a path that starts and ends at the same point.
a) Cycle b) Root c) Tree d) Sub tree
A simple path is a path such that all vertices are _____.
a) Vary b) Distinct c) Stable d) None of these.
The degree of a vertices is the number of _______ to that vertex.
a) Edges b) Cycles c) Both a and b d) None of these