On which principle does stack work?

Which is not an area of applications of Data Structure?

 A procedure that calls itself is called

On which principle does stack work?

Which one of the below mentioned is a linear data structure

Removing an element from the stack is called?

removing an element from the empty stack  called as 

Inserting an element in the stack is called as

 The minimum number of edges required to create a cyclic graph of n vertices is

What differentiates a circular linked list from a normal linked list?

Which of the below given sorting techniques has highest best-case runtime complexity