A linked data structure where the nodes have two pointers, one to the previous node, and one to the next node, is known as a(n)...

An example of a single pass language is

Which is the correct order of complexity, from fastest growing to slowest growing:

Which of the following is NOT a main computer system component?

4 bits make ________?

Which of the following sorting algorithms has the lowest worst-case complexity?

The process by which program code is converted into machine language is called ________.

The pointer is indicating the _____.

The ideal type of loop to use if you want a user to enter exactly 20 values is a(n) ________ loop.

The first step in using the string class is to #include the ________ header file.

The concept of a class is useful because of its ____.