Java Data Structure and Algorithms Interview Questions and Answers Pdf - 1

Question: 1

What is a B-tree?

A B-tree is a special case of m-way search tree in which each non-root and non-leaf node have between [1/(2m)] and m sub trees, the root has either zero or at least two sub trees, and all leaf nodes are on the same level.

Question: 2

What is a binary search tree?

It is a binary tree where for each node R, all keys in the left sub tree of R are less than the key value of node R and all keys in the right sub tree of R are greater than the key value of node R.

Question: 3

What is a path?

A path in a graph is a sequence of edges from one vertex to another vertex.

Question: 4

What is syntax?

Syntax represents grammar rules for the formation of the allowable strings of a vocabulary.

Question: 5

What is a group item?

It is a field/item that is decomposable into component elementary and/or group items.

Error Report!

Related Questions