Cloud Engineer

You have been given a graph consisting of ‘N’ vertices numbered from 1 to ‘N’. The graph has ‘M’ edges. In an operation, you can shift an edge between two directly connected vertices to between pair of disconnected vertices to make them directly connected. Return the minimum number of operations to make the graph connected. If it is not possible to make graph connected return -1.

Example:

Let’s say ‘N’ is 4 and ‘M' is 3. The 3 edges are (1,2), (2,3) and (1,3). Then our graph will look as follows:-

To make the graph connected we can shift the edge between (1,3) to (1,4). This operation will make the graph connected. There are multiple ways in which we can make graph connected. So, in this case, we can make graph connected in just one operation.

Note:

1. A connected graph is a graph that is connected in the sense of a topological space, i.e., there is a path from any vertex to any other vertex in the graph.

2. There are no repeated edges and self-loops in the graph.

3. You do not need to print anything; it has already been taken care of. Just implement the function.

You are given a connected undirected unweighted graph of ‘N’ nodes and ‘M’ edges, such that there is only one undirected edge between any two nodes and no self-loop. Your task is to find the length of the shortest path that visits all ‘N’ nodes at least once.

Note :

1) Here length of the path refers to the number of edges in that path.
2) You can start and stop at any node.
3) You can visit any node 0 or more times.
4) You can use any given edge 0 or more times.

A man drove his Innova car all the way from Shimla to Delhi only to discover at the end of the trip that he had a punctured tyre from the very start. Yet his Innova car was not at all affected by it? How is this possible?

…………… refers to the collection of information pertinent to systems Project.
A) Data transfer
B) Data gathering
C) Data Embedding
D) Data Request

You are stuck in a room with two doors- One right and one wrong. Both these doors are safeguarded by two guards, one in front of each door. The right door will lead you to your freedom and the wrong door will lead you to prison forever. However, you can ask both guards one question each. One guard always tells the truth, and the other guard always tells lies, but you don’t know which is which. What question should you ask to find the right door?

A race track has five lanes. You are to find the 3 fastest horses out of a total of 25. How many races would have to be conducted to find the three fastest horses?

- Tell me about yourself? 

- Where you wants to see in HCL? 

- What excites you in HCL and what you know about HCL? 

- Salary Discussion