Data Structure Technical Interview Questions with Answers - 1

Question: 1

What is a cascade merge?

It is a merge technique that uses a decreasing number of input devices at each phase of a pass, temporarily retiring intermediate output files to be input at the start of the next phase.

Question: 2

What is a pre-order traversal?

It is a method of visiting all the nodes of a binary tree, recursively defined by first visiting the root, then traversing the left sub tree in pre-order, then traversing the right sub tree in pre-order.

Question: 3

What is a B* -tree?

A B* -tree is a special case of B-tree in which each node is at least two- thirds full instead of at least one- half full.

Question: 4

What is division-remainder hashing?

It is an address resolution-calculation technique whereby an appropriate number divides the key value and the remainder is used as the record’s relative address.

Question: 5

What is a primary key?

It is the main key field of a multi-key file. In an alternate-key indexed sequential file, the field for which direct and sequential access are supported.