Data Structures

Question 1

Explain a queue data structure

Answer 1

A queue is a simple data structure that allows elements to be inserted from one end, called the rear (also called tail), and deleted from the other end, called the front (also called head).
This behavior is called FIFO (First in First Out). A very important concept is that a queue deletes only the oldest added element.

Question 2

What are the 5 ways to identify this

Answer 2

Global reference ('this' not enclosed in a function refers to the global object)
Free function invocation (functionName() - binds 'this' to the global object)
Using .call() or .apply() (fn.call(target) binds to the first arg passed to either function)
Method invocation (target.methodName() - binds to whatever someObject refers to at call time)
Construction Mode (new functionName() - binds to the new object instantiated)