Result of 12-7

• 10
• 7
• 5
• 17
• 5

Result of 12 + 10 =

• 10
• 22
• 2
• 12
• 22

Result of 12 - 10 =

• 10
• 22
• 2
• 12
• 2

Result of 20 - 10 =

• 10
• 22
• 2
• 12
• 10

What is output of below program? #include int main() { int x=10; printf("x=%d",x); return 0; }

• 10
• x
• x=10
• Error
• x=10

Removal of single edge from a graph will make graph disconnected then this edge is called

• Cut edge set
• edge connectivity
• Cut edge
• Cut vertex
• Cut edge

Removal of set of edge from a graph will make graph disconnected then this set of edges is called

• Cut edge set
• edge connectivity
• Cut edge
• Cut vertex
• Cut edge set

Removal of minimum no. of edge from a graph will make graph as disconnected then this minimum edges is called

• Cut edge set
• edge connectivity
• Cut edge
• Cut vertex
• edge connectivity

Cut Edge is also known as

• Cut set
• edge connectivity
• Cut Vertex
• Bridge
• Bridge

Which of the following notation is used for edge connectivity?

• K(G)
• λ(G)
• Both
• None of the above
• λ(G)