1. Consider a simple connected graph G with n vertices and n edges(n>2).

Then which
of the following statements are TRUE ?
a. G has at least one cycle
b. G has no cycles
c. The graph obtained by removing any edge from G is not connected
d. G has at least one cycle and the graph obtained by removing any edge from G is
not connected.
2. The number of distinct simple graphs with up to three nodes is…........
a. 9 c. 7
b. 10 d. 15
3. Consider the graph G where V(G)={A,B,C,D} and E(G)=[{A,B},{B,C},{C,D}]. The
degree of each vertices A,B,C,D respectively in G are…..
a. 1,2,3,2
b. 1,3,2,2
c. 1,1,1,1
d. 1,2,2,3
4. maximum number of edges in a n-node undirected graph without self loops is….......
a.
b.
c.
d.
5. let G be a graph with 100 vertices numbered 1 to 100. Two vertices i and j are
adjacent if |i-j|=8 or |i-j|=12. The number of connected components in G is…......
a. 8
b. 12
c. 25
d. 4
6. A graph in which all nodes are of equal degree is known as…....
a. Complete graph
b. Multi graph
c. Non regular graph
d. Regular graph
7. The minimum number of spanning trees in a connected graph with “n” nodes is…..
a. N-1
b. n/2
c. 2
d. 1
8. The minimum number of edges in a connected cyclic graph on ‘n’ vertices is…....
a. n-1
b. n
c. n+1
d. None of these
9. The minimum number of colours required to colour the vertices of a cycle with “n”
nodes in such a way that no two adjacent nodes have the same colour is….......
a. n-2[n/2]+2
b. 4
 c. 3
d. 2

10. Two main measures for the efficiency of an algorithm are

a. Processor and memory
b. Complexity and capacity
c. Time and space
d. Data and space

12. The time factor when determining the efficiency of algorithm is measured by
a. Counting microseconds
b. Counting the number of key operations
c. Counting the number of statements
d. Counting the kilobytes of algorithm

13. The space factor when determining the efficiency of algorithm is measured by
a. Counting the maximum memory needed by the algorithm
b. Counting the minimum memory needed by the algorithm
c. Counting the average memory needed by the algorithm
d. Counting the maximum disk space needed by the algorithm

14. Which of the following case does not exist in complexity theory
a. Best case
b. Worst case
c. Average case
d. Null case

15. The Worst case occur in linear search algorithm when

a. Item is somewhere in the middle of the array
b. Item is not in the array at all
c. Item is the last element in the array
d. Item is the last element in the array or is not there at all

16. The Average case occur in linear search algorithm

a. When Item is somewhere in the middle of the array
b. When Item is not in the array at all
c. When Item is the last element in the array
d. When Item is the last element in the array or is not there at all

17. The complexity of the average case of an algorithm is

a. Much more complicated to analyze than that of worst case
b. Much more simpler to analyze than that of worst case
c. Sometimes more complicated and some other times simpler than that of worst case
d. None or above
18. The complexity of linear search algorithm is
a. O(n)
b. O(log n)
c. O(n2)
d. O(n log n)

19. The complexity of Binary search algorithm is

a. O(n)
b. O(log n )
c. O(n2)
d. O(n log n)

20. The complexity of Bubble sort algorithm is

a. O(n)
b. O(log n)
c. O(n2)
d. O(n log n)

21. The complexity of merge sort algorithm is

a. O(n)
b. O(log n)
c. O(n2)
d. O(n log n)

22. The indirect change of the values of a variable in one module by another module is called
a. internal change
b. inter-module change
c. side effect
d. side-module update

23. Which of the following data structure is not linear data structure?
a. Arrays
b. Linked lists
c. Both of above
d. None of above

24. Which of the following data structure is linear data structure?

a. Trees
b. Graphs
c. Arrays
d. None of above

25. The operation of processing each element in the list is known as

a. Sorting
b. Merging
c. Inserting
d. Traversal

26. Finding the location of the element with a given value is:
a. Traversal
b. Search
c. Sort
d. None of above

27. Arrays are best data structures

a. for relatively permanent collections of data
b. for the size of the structure and the data in the structure are constantly changing
c. for both of above situation
d. for none of above situation

28. Linked lists are best suited

a. for relatively permanent collections of data
b. for the size of the structure and the data in the structure are constantly changing
c. for both of above situation
d. for none of above situation

29. Each array declaration need not give, implicitly or explicitly, the information about
a. the name of array
b. the data type of array
c. the first data from the set to be stored
d. the index set of the array

30. The elements of an array are stored successively in memory cells because
a. by this way computer can keep track only the address of the first element and the
addresses of other elements can be calculated
b. the architecture of computer memory does not allow arrays to store other than serially
c. both of above
d. none of above

31. which graphs represents the concept of looping?

a. Simple graph
b. Multigraph
c. Pseudograph
d. All of above
32. how many edges are there in a graph with 10 vertices each of degree 6?
a. 20
b. 25
c. 30
d. 35
33. Handshaking theorem shows a relationship of
a. total no of vertices and edges
b. adjacent relationship in graph
c. incidence relationship in graph
 d. no of vertices, no of edges and degree of vertices
34. vertices (a,b) are said to be adjacent if :
a. a is connected to b with an edge
b. a is connected to b with multiple edges
c. a and b are the same verted
d. both a and b
35. The in-degree of the vertex ‘v’ means:
a. number of vertices adjacent to v
b. number of vertices adjacent from v
c. none edge outgoing from v
d. all of above
36. in undirected graph, A loop vertex contributes degree….
a. 1
b. 2
c. 0
d. 1 or 2
37. Circuit in a graph is :
a.closed path, that starts and ends at the same vertex.
b. must have all the edges inside the path
c. must have all the vertices inside the path
d. not a connected path
38. if a graph G={(a.b), (a,b)}, then it:
a. is a bi-partite graph
b. is not a bi-partite graph
c. may or maynot be a bi-partite graph
d. none of above
39. an euler path is a path using every ………..of the graph exactly once.
a. vertices
b. edges
c. vertices and edges
d. all of above
40. a Hamilton path is a path using every ………..of the graph exactly once.
a. vertices
b. edges
c. vertices and edges
d. all of above
41. Planar graph gives the idea about:
a. edges looped
b. edges incident
c. edge crossing
d. degree of edge
42. Euler formula for planar graph is the relationship:
a. r=e-v+2
b. r=e+v-2
c. r=e-v-2
d. r=e+v+2
43. chromatic number is:
a. maximum number of colors assigned to edges in graph coloring
b. maximum number of colors assigned to vertices in graph coloring
c. minimum number of colors assigned to edges in graph coloring
d. minimum number of colors assigned to vertices in graph coloring
44. The chromatic number of a planar graph is:
a. <=4
b. < 4
c. > 4
d. >=4
45. A tree must be:
a. a connected graph
b. a simple graph
c. a connected graph
d. all of above
46. the arity of a tree means:
a. maximum number of leaves in the tree
b. maximum number of child of internal vertices in a tree
c. total number of siblings in a tree
d. total number of internal vertices in the tree
47. A full M-ary tree with i internal vertices and total n vertices contains:
a. n= m * i + 1
b. n= m * i - 1
c. n= m + i + 1
d. n= m - i + 1
48. the minimum height of the binary tree having 7 vertices is:
a.4
b. 3
c. 5
d. 6
49. A minimal spanning tree in a connected weighted graph is a spanning tree that has ………
of its edges.
a. gratest possible sum of weights
b. smallest possible sum of weights
c.highest weight in the graph
d. lowest weight in the graph
50. which one is the tree traversal algorithm used:
a. Pre-order traversal
b. post-order traversal
c. In-order traversal
d. all of above
51. Two graphs are isomorphic iff:
a. they have same number of vertices.
b. they have same number of edges.
c. Degree of corresponding vertices are same.
d. all of above
52. A graph is not connected means:
a. there are more than one connected components
b. there is a unique connected component
c. no matter about connected component
d. none of above
53. A graph is ………………..connected if there is a directed path between every pair of
vertices.
a. weakly connected
b. strongly connected
c. part is weakly connected and part is strongly connected
d. none of above
54. The house and utility problem is a:
a. planar graph
b. non-planar graph
c. Euler graph
d. Hamilton graph
55. Concept of Graph Coloring can be best applicable in:
a. Map Coloring
b. finding eulerian path
c. finding Hamilton path
d. finding the circuit in a graph
56. Spanning tree of a graph is a subgraph that is a tree containing every…….
a. edges
b. vertex
c. circuit
d. path
57. Prim’s algorithm is for:
a. finding minimal spanning tree
b. finding all the circuits in a tree
c. finding total number of degree of all vertices
d. finding Hamilton path
58. the pre-order traversal visits in the order:
a. root, left and right
b. root, right and left
c. left, right and root
d. left, root and right.
59. the post-order traversal visits in the order:
a. root, left and right
b. root, right and left
c. left, right and root
d. left, root and right.
60. the in-order traversal visits in the order:
a. root, left and right
b. root, right and left
c. left, right and root
d. left, root and right.
61. Depth first search uses:
a. stack
b. queue
c. both stack and queue
d. neither stack and queue
62.Breadth first search uses:
a. stack
b. queue
c. both stack and queue
d. neither stack and queue
63. Dijkstra’s algorithm finds the length of:
a. shortest path between two vertices in a connected simple undirected graph
b. unique path between two vertices in a connected simple undirected graph
c. longest path between two vertices in a connected simple undirected graph
d. Every path between two vertices in a connected simple undirected graph
64. Dijkstra’s algorithm uses ….operations to find the length of the shortest path between two vertices
in a connected simple undirected weighted graph:
a. O (n2 )
b. O (log n2 )
c. O (n log n2 )
d. O (n log n )
65. Huffman algorithm is a :
a. fixed length encoding
b. unique length encoding
c. variable length encoding
d. sublength encoding