A connected planar graph having 6 vertices, 7 edges contains _____________ regions.
a) 15 b) 3 c) 1 d) 11
What is the number of edges present in a complete graph having n vertices?
a) (n*(n+1))/2 b) (n*(n-1))/2 c) N d) Information given is insufficient
For an undirected graph G with n vertices and e edges, the sum of the degrees of each vertex is
a) ne b) 2n c) 2e d) e^n
In Breadth First Search of Graph, which of the following data structure is used?
a) Stack. b) Queue. c) Linked List. d) None of these.
An adjacency matrix representation of a graph cannot contain information of :
a) Nodes b) Edges c) Direction of edges d) Parallel edges
Worst case of bubble sort algorithm is nothing but _______.
a) Inverse sorting b) Direct sorting c) Both a and b d) None of these
Running time for both best case and worst case of bubble sort algorithm are _____.
a) Different b) Same c) May be same d) None of these
Bubble sort is also called as ________.
a) Comparison sort b) Direct sort c) Insertion sort d) None of these
Running time of bubble sort algorithm is _____.
a) O(n) b) O(n2) c) O(3n) d) None of these.
Bubble sort follows which method?
a) Exchanging method b) Direct method c) Both a and b d) None of these
The best, average and worst case time complexities of the selection sort.
a) O(n2) b) O(n) c) O(2n) d) None of these.
Selection sort ______ smallest element with the value in the first position.
a) Unswap b) Swaps c) Search d) Rotation
_______ finds the minimum.
a) Selection sort b) Insertion sort c) Both a and b d) None of these.
In selection sort scan the array to find its ____ and swap it with the first element.
a) Largest element b) Smallest element c) Both a and b d) None of these.
Brute force is a ______.
a) Straight forward approach b) Straight backward approach c) Both a and b d) None of these
Which of the following sorting algorithm is of divide and conquer type?
a) Bubble sort b) Insertion sort c) Quick sort d) Merge sort