Data Structures and Algorithms Question Bank with Answers Pdf - 2

Question: 6

What is a minimum spanning tree?

It is a spanning tree that has a minimum cost among all spanning trees. It may happen that more than one spanning tree has a minimum cost.

Question: 7

What is an infix notation?

It is a method of representing an arithmetic expression whereby a binary operator appears between its operands.

Question: 8

What is an adjacency matrix?

It is a square matrix where its element aij=1 if there is an edge from vertex i to vertex j. For a weighted graph, the element aij=wij, where wij is the weight of an edge from vertex i to vertex j.

Question: 9

What is the weight of a tree?

It is the number of leaf nodes in a tree.

Question: 10

What is multi-list file organization?

It is a multi-key file organization technique that maintains an index for every key.

The index contains all values that the key has in the data file and a pointer to a linked to a linked list of data records with that key value.