Answer Posted / Hridesh Kumar

A spanning tree is a subset of a connected graph that contains all its vertices but no cycles. A minimum spanning tree (MST) is a spanning tree with the minimum possible total edge weight. Yes, the MST of a graph does give the shortest path between any two nodes, as it is constructed by finding and adding edges with the smallest weights until a tree is formed.

For the following COBOL code, draw the Binary tree? 01 STUDENT_REC. 02 NAME. 03 FIRST_NAME PIC X(10). 03 LAST_NAME PIC X(10). 02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX.

1395

Write a program for Sorting an Array. Which sorting will you prefer?

1040

“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?

1284

What sort of serious problems have you experienced, and how have you handled them?

1025

Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)

1501

Can you declare an array without assigning the size of an array?

1210