Advanced IOS Data Structure and Algorithm Interview Questions - 1

Question: 1

What is an AVL Tree?

It is a height-balanced binary tree where for each node R, the height of the left sub tree of R and height of the right sub tree R differ by at most 1.

Question: 2

What is a linked list?

It is a data structure in which the ordering of nodes is indicated by the use of direct or indirect pointers rather than by physically sequentially.

Question: 3

What is a multi graph?

It is a graph that is not simple, i.e., graph has at least one loop or there is at least one pair of nodes such that there are two or more edges connecting them.

Question: 4

What is a subprogram/module?

It is a program carrying out a particular function and which can be called by another program known as the calling program. A subprogram needs to be placed only once in memory and can be called by the main program or other subprogram as many times as the programmer wants. Also known by various names as function, subroutine or procedure.

Question: 5

What is a demand buffering?

It is a buffer management technique whereby data are read into a buffer only when they are actually requested by a program.