Associate Software Engineer

Aptitude (10 questions)
Reasoning (20 questions)
Technical questions (10 questions)
Pseudo code (5 questions)
English comprehensive ( 5 questions)

Number Of MCQs - 50

A minimum spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices without any cycles and with the minimum possible total edge weight.

A spanning tree’s weight is the sum of the weights of each edge in the spanning tree.

You have been given a connected undirected weighted graph having 'n' vertices, from 1 to 'n', and 'm' edges.

You are given an array 'edges' of size 'm', containing the details of the edges of the graph.

Each element of 'edges' contains three integers, the two vertices that are being connected and the weight of the edge.

Find the weight of the minimum spanning tree of the given graph.

Example :

Input: 'n' = 5, 'm' = 6
'edges' = [[1, 2, 6], [2, 3, 5], [3, 4, 4], [1, 4, 1], [1, 3, 2], [3, 5, 3]]

Output: 11

Explanation: The given graph is:

The minimum spanning tree of the graph is:

And its weight is 1 + 2 + 5 + 3 = 11.

What is SQL?

Explicit cursor, create table using SQL command.