Data Structure Important Questions and Answers Pdf - 1

Question: 1

What is a strictly triangular array?

It is an upper triangular array or a lower triangular array in which the elements on the diagonal all have value zero.

Question: 2

What is an inverted file organization?

It is a multi-key file organization technique that uses inversion indices.

Question: 3

What is an adjacency list?

It is an array of pointers to linked lists, one for each vertex of the graph.

For each vertex, its linked list contains all the vertices that are adjacent to it.

The vertices in the linked list are stored in an arbitrary order.

Question: 4

What is a critical path?

It is the longest path in the activity graph.

Question: 5

What is a simple exchange sort?

It is one of the families of exchange sorts where pairs of key values of adjacent records (items) are compared and exchanged if they are not in proper relative positions.