23MA101 MATHEMATICS I QUIZ

1. 1. Use Euclid's algorithm to find GCD of 1385 and 155

• 50

• 5

• 125

• 300

2. 2. If the HCF of 65 and 117 is expressible in the form 65m-117, then the value of m is

• 4

• 2

• 1

• 3

3. 3. Fundamental theorem of arithmetic states that Every integer n>1 can be expressed as

(a)  

4. 4. Which of the following defines Euclid's Lemma

• a=bq+r, 0<r<b

• a=br+q, 0<r<b

• a=bq, 0<r<b

• a=bq-r

5.In a simple graph, the number of edges is equal to twice the sum of the degrees of the vertices is called the (a)   theorem.

6.Which of the following is true?

• A graph may contain no edges and many vertices

• A graph may contain many edges and no vertices

• A graph may contain no edges and no vertices

• A graph may contain no vertices and many edges

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

• 1,2,3

• 2,3,4

• 2,4,5
  

• 1,3,5

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

• Must be connected
  

• Must be unweighted
  

• Must have no loops or multiple edges
  

• Must have no multiple edges

9.Dijkstra’s Algorithm will work for both negative and positive weights?

• True

• False

10.The number of elements in the adjacency matrix of a graph having 7 vertices is _________

• 7

• 14

• 21

• 49