What is the interface implemented by an iterator object itself?

LinkedList can NOT be of generic type <T>

How does the call stack work in relation to recursive functions?

What is the time complexity of pop() operation in a stack?

___________ is a mathematical notation that describes the limiting

behavior of a function when the argument tends towards a particular value or

infinity.

What will

be the output of the following code:

int factorial(int n) {

   if(n

== 0)

return 1;

   else

return n * factorial(n-1);

}

int main() {

   int

number = 5;

   cout<<factorial(number);

   return

0;

}

What is the time complexity of deleting an element from a singly linked list?

What will Repeat(82, 3) return from the following method declaration?

public static int Repeat(int i, int j){

   if (i==0)

      return 0;

   else

      return Repeat(i/j, j)+1;

}