Member of Technical Staff

Segmentation is a memory management technique in which the memory is divided into the variable size parts. Each part is known as a segment which can be allocated to a process. The details about each segment are stored in a table called a segment table. Segment table is stored in one (or many) of the segments.

Segment table contains mainly two information about segment:
Base: It is the base address of the segment
Limit: It is the length of the segment.

Advantage –

Easy to implement a buddy system
Allocates block of correct size
It is easy to merge adjacent holes
Fast to allocate memory and de-allocating memory

Disadvantage –

It requires all allocation unit to be powers of two
It leads to internal fragmentation

A page fault is an interruption that occurs when a software program attempts to access a memory block not currently stored in the system's RAM. This exception tells the operating system to find the block in virtual memory so it can be sent from a device's storage (SSD or HD) to RAM.

Our ultimate aim is to move disk n from source to destination and then put all other (n-1) disks onto it. We can imagine to apply the same in a recursive way for all given set of disks.
Steps −

Step 1 − Move n-1 disks from source to aux
Step 2 − Move nth disk from source to dest
Step 3 − Move n-1 disks from aux to dest
A recursive algorithm for Tower of Hanoi can be driven as follows −

START
Procedure Hanoi(disk, source, dest, aux)

IF disk == 1, THEN
move disk from source to dest 
ELSE
Hanoi(disk - 1, source, aux, dest) // Step 1
move disk from source to dest // Step 2
Hanoi(disk - 1, aux, dest, source) // Step 3
END IF

END Procedure
STOP

A min-heap is a binary tree such that:
1. The data contained in each node is less than (or equal to) the data in that node’s children.
2. The binary tree is complete

The C++ Standard Library consists of a container named priority_queue. A priority queue is technically a max-heap but it can be used to implement a min-heap by tweaking its constructor.

priority_queue
The parameter comparison is used to order the heap. It may be a function pointer or function object capable of comparisons and must have two arguments.
The container object is by default a vector.

In Java, a min heap can be implemented using Priority Queue. 
PriorityQueue minHeap = new PriorityQueue();

Tip 1: Tips: Be confident. Whenever you are asked a question, be bold and ask out if you have a doubt. be genuine and get involved. Just don't be quiet.
Tip 2 : The cross questioning can go intense some time, think before you speak.
Tip 3 : Be open minded and answer whatever you are thinking, in these rounds I feel it is important to have opinion.