SUBJECT NAME: FUNDAMENTALS OF DATA STRUCTURES

NON LINEAR DATA STRUCTURES – GRAPHS

1. Which of the following statements for a simple graph is correct?

a) Every path is a trail

b) Every trail is a path

c) Every trail is a path as well as every path is a trail

d) Path and trail have no relation

Answer: a

2. In the given graph identify the cut vertices.

a) B and E

b) C and D

c) A and E

Answer: d

3. For the given graph(G), which of the following statements is true?

a) G is a complete graph

b) G is not a connected graph

c) The vertex connectivity of the graph is 2

Answer: c

4. 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

5. The given Graph is regular.

a) True
b) False

Answer: a

6. A connected planar graph having 6 vertices, 7 edges contains regions.

a) 15

b) 3

c) 1

d) 11

Answer: b

7. If a simple graph G, contains n vertices and m edges, the number of edges in the Graph
G'(Complement of G) is

a) (n*n-n-2*m)/2

b) (n*n+n+2*m)/2

c) (n*n-n-2*m)/2

d) (n*n-n+2*m)/2

Answer: a

8. Which of the following properties does a simple graph not hold?

a) Must be connected

b) Must be unweighted

c) Must have no loops or multiple edges

d) Must have no multiple edges

Answer: a

9. What is the maximum number of edges in a bipartite graph having 10 vertices?

a) 24
b) 21

c) 25

d) 16

Answer: c
10. Which of the following is true?

a) A graph may contain no edges and many vertices

b) A graph may contain many edges and no vertices

c) A graph may contain no edges and no vertices

d) A graph may contain no vertices and many edges

Answer: b

11. For a given graph G having v vertices and e edges which is connected and has no cycles, which of
the following statements is true?

a) v=e

b) v = e+1

c) v + 1 = e

d) v = e-1

Answer: b

12. For which of the following combinations of the degrees of vertices would the connected graph be
eulerian?

a) 1,2,3

b) 2,3,4

c) 2,4,5

d) 1,3,5

Answer: a

13. A graph with all vertices having equal degree is known as a

a) Multi Graph

b) Regular Graph

c) Simple Graph
d) Complete Graph

Answer: b

14. Which of the following ways can be used to represent a graph?

a) Adjacency List and Adjacency Matrix

c) Adjacency List, Adjacency Matrix as well as Incidence Matrix

d) No way to represent

Answer: c

15. The number of possible undirected graphs which may have self loops but no multiple edges and
have n vertices is

a) 2((n*(n-1))/2)

b) 2((n*(n+1))/2)

c) 2((n-1)*(n-1))/2)

d) 2((n*n)/2)

Answer: d

16. Given a plane graph, G having 2 connected component, having 6 vertices, 7 edges and 4 regions.
What will be the number of connected components?

a) 1

b) 2

c) 3

d) 4

Answer: b

17. Number of vertices with odd degrees in a graph having a eulerian walk is

a) 0

b) Can’t be predicted

c) 2

d) either 0 or 2

Answer: d

18. How many of the following statements are correct?

i) All cyclic graphs are complete graphs.

ii) All complete graphs are cyclic graphs.

iii) All paths are bipartite.

Answer: b

19. What is the number of vertices of degree 2 in a path graph having n vertices,here n>2.

a) n-2

b) n

c) 2

d) 0

Answer: a

20. Which of the following graphs are isomorphic to each other?

a) fig 1 and fig 2

b) fig 2 and fig 3

c) fig 1 and fig 3

Answer: d

21. In the given graph which edge should be removed to make it a Bipartite Graph?

a) A-C

b) B-E

c) C-D

Answer: a

22. What would the time complexity to check if an undirected graph with V vertices and E edges is
Bipartite or not given its adjacency matrix?

a) O(E*E)

b) O(V*V)O(E)

c) O(V)

Answer: b
23. Which of the following is not a topological sorting of the given graph?

a) A B C D E F

b) A B F E D C

c) A B E C F D

Answer: d

24. With V(greater than 1) vertices, how many edges at most can a Directed Acyclic Graph possess?

a) (V*(V-1))/2

b) (V*(V+1))/2

c) (V+1)C2

d) (V-1)C2

Answer: a

25. The topological sorting of any DAG can be done in time.

a) cubic

b) quadratic

c) linear

d) logarithmic

Answer: c

26. If there are more than 1 topological sorting of a DAG is possible, which of the following is true.

a) Many Hamiltonian paths are possible

b) No Hamiltonian path is possible

c) Exactly 1 Hamiltonian path is possible

d) Given information is insufficient to comment anything

Answer: b
27. What sequence would the BFS traversal of the given graph yield?

a) A F D B C E

b) C B A F E D

c) A B D C E F

Answer: c
28. a) 0 2 3 1 4

b) 0 3 2 4 1

c) 0 2 3 4 1

d) 0 3 2 1 4

Answer: b

29. Which of the given statement is true?

a) All the Cyclic Directed Graphs have topological sortings

b) All the Acyclic Directed Graphs have topological sortings

c) All Directed Graphs have topological sortings

d) All the cyclic directed graphs hace non topological sortings

Answer: d

30. What is the value of the sum of the minimum in-degree and maximum out-degree of an Directed
Acyclic Graph?

a) Depends on a Graph

b) Will always be zero

c) Will always be greater than zero

d) May be zero or greater than zero

Answer: b

SEARCHING, SORTING AND HASHING TECHNIQUES

a) When the list has only a few elements

b) When performing a single search in an unordered list

c) Used all the time

d) When the list has only a few elements and When performing a single search in an unordered list

Answer: d

2. What is the best case for linear search?

a) O(nlogn)
b) O(logn)

c) O(n)

d) O(1)

Answer: d

3. What is the worst case for linear search?

a) O(nlogn)

b) O(logn)

c) O(n)

d) O(1)

Answer: c

4. What is the best case and worst case complexity of ordered linear search?

a) O(nlogn), O(logn)

b) O(logn), O(nlogn)
c) O(n), O(1)

d) O(1), O(n)

Answer: d

5. a) Print the duplicate elements in the array

b) Print the element with maximum frequency

c) Print the unique elements in the array

d) Prints the element with minimum frequnecy

Answer: a

6. Which of the following is a disadvantage of linear search?

a) Requires more space

b) Greater time complexities compared to other searching algorithms

c) Not easy to understand

d) Not easy to implement

Answer: b

7. What is the advantage of recursive approach than an iterative approach?

a) Consumes less memory

b) Less code and easy to implement

d) More code has to be written

Answer: b

8. Given an input arr = {2,5,7,99,899}; key = 899; What is the level of recursion?

a) 5

b) 2

c) 3

d) 4

Answer: c
9. Given an array arr = {45,77,89,90,94,99,100} and key = 99; what are the mid values(corresponding
array elements) in the first and second levels of recursion?

a) 90 and 99

b) 90 and 94

c) 89 and 99

d) 89 and 94

Answer: a

10. What is the worst case complexity of binary search using recursion?

a) O(nlogn)

b) O(logn)

c) O(n)

d) O(n2)

Answer: b

11. What is the average case time complexity of binary search using recursion?

a) O(nlogn)

b) O(logn)

c) O(n)

d) O(n2)

Answer: b

12. Which of the following is not an application of binary search?

a) To find the lower/upper bound in an ordered sequence

c) Debugging

d) To search in unordered list

Answer: d

13. Binary Search can be categorized into which of the following?

a) Brute Force technique

c) Greedy algorithm

d) Dynamic programming

Answer: b

14. Given an array arr = {5,6,77,88,99} and key = 88; How many iterations are done until the element
is found?

a) 1

b) 3

c) 4

d) 2

Answer: d

15. Given an array arr = {45,77,89,90,94,99,100} and key = 100; What are the mid
values(corresponding array elements) generated in the first and second iterations?

a) 90 and 99

b) 90 and 100

c) 89 and 94

d) 94 and 99

Answer: a

16. What is the time complexity of binary search with iteration?

a) O(nlogn)

b) O(logn)

c) O(n)

d) O(n2)

Answer: b
17. What is an external sorting algorithm?

a) Algorithm that uses tape or disk during the sort

b) Algorithm that uses main memory during the sort

c) Algorithm that involves swapping

d) Algorithm that are considered ‘in place’

Answer: a

18. What is an internal sorting algorithm?

a) Algorithm that uses tape or disk during the sort

b) Algorithm that uses main memory during the sort

c) Algorithm that involves swapping

d) Algorithm that are considered ‘in place’

Answer: b

19. What is the worst case complexity of bubble sort?

a) O(nlogn)

b) O(logn)

c) O(n)

d) O(n2)

Answer: d

20. What is the average case complexity of bubble sort?

a) O(nlogn)

b) O(logn)

c) O(n)

d) O(n2)

Answer: d

21. Which of the following is not an advantage of optimised bubble sort over other sorting techniques
in case of sorted elements?

a) It is faster

b) Consumes less memory

c) Detects whether the input is already sorted

Answer: c

22. The given array is arr = {1, 2, 4, 3}. Bubble sort is used to sort the array elements. How many
iterations will be done to sort the array?

a) 4

b) 2

c) 1

d) 0

Answer: a

23. What is the best case efficiency of bubble sort in the improvised version?

a) O(nlogn)

b) O(logn)

c) O(n)

d) O(n2)

Answer: c

24. The given array is arr = {1,2,4,3}. Bubble sort is used to sort the array elements. How many
iterations will be done to sort the array with improvised version?

a) 4

b) 2

c) 1

d) 0

Answer: b

25. What is an in-place sorting algorithm?

a) It needs O(1) or O(logn) memory to create auxiliary locations

b) The input is already sorted and in-place

c) It requires additional storage

d) It requires additional space

Answer: a
26. In the following scenarios, when will you use selection sort?
a) The input is already sorted

b) A large file has to be sorted

c) Large values need to be sorted with small keys

d) Small values need to be sorted with large keys

Answer: c

27. What is the worst case complexity of selection sort?

a) O(nlogn)

b) O(logn)

c) O(n)

d) O(n2)

Answer: d

28. What is the advantage of selection sort over other sorting techniques?

a) It requires no additional storage space

b) It is scalable

c) It works best for inputs which are already sorted

d) It is faster than any other sorting technique

Answer: a

29. What is the average case complexity of selection sort?

a) O(nlogn)

b) O(logn)

c) O(n)

d) O(n2)

Answer: d

30. What is the disadvantage of selection sort?

a) It requires auxiliary memory

b) It is not scalable

c) It can be used for small keys

Answer: b

31. The given array is arr = {3,4,5,2,1}. The number of iterations in bubble sort and selection sort
respectively are,

a) 5 and 4

b) 4 and 5

c) 2 and 4

d) 2 and 5

Answer: a

32. The given array is arr = {1,2,3,4,5}. (bubble sort is implemented with a flag variable)The number
of iterations in selection sort and bubble sort respectively are,

a) 5 and 4

b) 1 and 4

c) 0 and 4

d) 4 and 1

Answer: d

33. What is the best case complexity of selection sort?

a) O(nlogn)

b) O(logn)

c) O(n)

d) O(n2)

Answer: d

34. Shell sort is also known as

a) diminishing decrement sort

b) diminishing increment sort

c) partition exchange sort

d) diminishing insertion sort

Answer: b

35. Statement 1: Shell sort is a stable sorting algorithm.

Statement 2: Shell sort is an in-place sorting algorithm.

b) Statement 2 is true but statement 1 is false

c) Statement 2 is false but statement 1 is true

Answer: b

36. Shell sort is applied on the elements 27 59 49 37 15 90 81 39 and the chosen decreasing sequence of
increments is (5,3,1). The result after the first iteration will be

a) 27 59 49 37 15 90 81 39

b) 27 59 37 49 15 90 81 39

c) 27 59 39 37 15 90 81 49

d) 15 59 49 37 27 90 81 39

Answer: c

37. Which condition will correctly implement the while loop?

a) k >= j && y < elements[k- span]

b) k >= span || y < elements[k + span]

c) k >= j || y < elements[k + span]

d) k >= span && y < elements[k- span]

Answer: d

38. Shell sort is an improvement on

a) insertion sort

b) selection sort

c) binary tree sort

d) quick sort

Answer: a

39. An array that is first 7-sorted, then 5-sorted becomes

b) 5-ordered

c) both 2-ordered and 5-ordered

d) both 7-ordered and 5-ordered

Answer: d
40. If Hibbard increments (h1= 1, h2= 3, h3= 7, …, hk = 2k–1) are used in a Shell sort implementation,
then the best case time complexity will be
a) O(nlogn)

b) O(n)

c) O(n2)

d) O(logn)

Answer: a

41. Records R1, R2, R3,.. RN with keys K1, K2, K3,.. KN are said to be h-ordered, if

a) Ki <= Ki+h for 1<= i*h <= N

b) Kh <= Ki+h for 1<= i <= N

c) Ki <= Kh for 1<= i <= h

d) Ki <= Ki+h for 1<= i <= N-h

Answer: d

42. Which of the following is true?

a) Shell sort’s passes completely sort the elements before going on to the next-smallest gap while Comb
sort’s passes do not completely sort the elements

b) Shell sort’s passes do not completely sort the elements before going on to the next-smallest gap like in
Comb sort

c) Comb sort’s passes completely sort the elements before going on to the next-smallest gap like in Shell sort

d) Shell sort’s passes do not completely sort the elements before going on to the next-smallest gap while
Comb sort’s passes completely sort the elements

Answer: a

43. Which of the following is the distribution sort?

a) Heap sort
b) Smooth sort

c) Quick sort

d) LSD radix sort

Answer: d

44. What is the worst case time complexity of LSD radix sort?

a) O(nlogn)

b) O(wn)
c) O(n)

d) O(n + w)

Answer: b

45. LSD radix sort requires passes to sort N elements.

a) (w/logR)

b) N(w/logR)

c) (w/log(RN))

d) (wN/log(N))

Answer: a

46. Which of the following is false?

a) LSD radix sort is an integer sorting algorithm

b) LSD radix sort is a comparison sorting algorithm

c) LSD radix sort is a distribution sort

d) LSD radix sort uses bucket sort

Answer: b

47. Which of the following sorting algorithm is stable?

a) Heap sort

b) Selection sort

c) In-place MSD radix sort

d) LSD radix sort

48. Which of the following should be used to sort a huge database on a fixed-length key field?

a) Insertion sort

b) Merge sort

c) LSD radix sort

d) Quick sort

Answer: c

49. Which of the following is a combination of LSD and MSD radix sorts?

a) Forward radix sort

c) Trie base radix sort

d) Flash sort

Answer: a

50. Which of the following is true for the LSD radix sort?

a) works best for variable length strings

b) accesses memory randomly

c) inner loop has less instructions

d) sorts the keys in left-to-right order

Answer: b

51. Which scheme uses a randomization approach?

a) hashing by division

b) hashing by multiplication

c) universal hashing

d) open addressing

Answer: c

52. Which hash function satisfies the condition of simple uniform hashing?
a) h(k) = lowerbound(km)

b) h(k)= upperbound(mk)

c) h(k)= lowerbound(k)

d) h(k)= upperbound(k)

Answer: a

53. a) 14963

b) 14392

c) 12784

d) 14452

Answer: d

54. What is the hash function used in the division method?

a) h(k) = k/m
b) h(k) = k mod m

c) h(k) = m/k

d) h(k) = m mod k

Answer: b

55. What can be the value of m in the division method?

a) Any prime number

b) Any even number

c) 2p – 1

d) 2p

Answer: a

56. Which scheme provides good performance?

a) open addressing

b) universal hashing

c) hashing by division

d) hashing by multiplication
Answer: b

57. Using division method, in a given hash table of size 157, the key of value 172 be placed at position

a) 19

b) 72

c) 15

d) 17

Answer: c

58. How many steps are involved in creating a hash function using a multiplication method?

a) 1

b) 4

c) 3

d) 2

Answer: d

59. What is the hash function used in multiplication method?

b) h(k) = ceil( m(kA mod 1))

c) h(k) = floor(kA mod m)

d) h(k) = ceil( kA mod m)

Answer: a

60. What is the advantage of the multiplication method?

a) only 2 steps are involved

b) using constant

c) value of m not critical

d) simple multiplication

Answer: c
61. What is the table size when the value of p is 7 in multiplication method of creating hash functions?

a) 14

b) 128

c) 49

d) 127

Answer: b

62. What is the value of h(k) for the key 123456?

Given: p=14, s=2654435769, w=32

a) 123

b) 456

c) 70

Answer: d

63. What is the average retrieval time when n keys hash to the same slot?

a) Theta(n)

b) Theta(n2)

c) Theta(nlog n)

d) Big-Oh(n2)

Answer: a