Exam 13: Pointers and Linked Lists

If you write a linked list class,then you should implement the destructor,copy constructor,and the assignment operator

If you push the following numbers onto an integer stack,what item is on the top of the stack? 1,4,8,16)

The function used to put data into a stack is typically called _______.

There is no need for error checking when pushing a stack.

Dynamically allocated memory that is no longer pointed to by any pointer variable causes a ______________.

The pointer in a node points to

To add an item to a stack,we call the ______ function

Most applications that use a stack will store a struct or class object on the stack.

If you need to insert an element in the front of a list with N nodes and move the other elements back one place),how many nodes do you have to move?

When would you use a linked list over an array or a dynamic array?

In a linked list as defined in the text,the pointer in the last node in the list should always point to _________.

The arrow operator ->)specifies

The arrow operator ->)combines the actions of which two operators?

A stack is a first-in-first-out data structure.

There is no need for error checking when popping a stack.

Apart from constructors,the operations for a stack listed in the text are ____________,_____________,and _______________,

Which of the following loops correctly uses iter as an iterator to move through the nodes of the linked list? NodePtr iter; //a pointer to a node

The number of possible nodes in a linked list is __________

Data is removed at the back of the queue.

A queue is first-in-first-out data structure.