Question 1

What C++11 keyword can you use instead of NULL to distinguish between the null value and the number 0?

Accepted Answer

nullptr

Question 2

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

Accepted Answer

A) True 
 B)False  False

Question 3

What happens if you have two lists list1, list2), no assignment operator in your class, and attempt to execute the following statement?
List1 = list2;

Accepted Answer

A)  you have a syntax error 
B)  you get a complete and identical copy of list2 into list1 
C)  list1 and lsit2 now name the same list 
D)  no problem 
A)  you have a syntax error 
B)  you get a complete and identical copy of list2 into list1 
C)  list1 and lsit2 now name the same list 
D)  no problem C

Question 4

Given the following stack declaration, which of the following function definitions would correctly implement the destructor?
Struct StackFrame
{
Char data;
StackFrame *link;
};
Typedef StackFrame* StackFramePtr;
Class Stack
{
Public:
Stack );
Stackconst Stack& a_stack);
~Stack );
Void pushchar the_symbol);
Char pop );
Bool empty ) const;
Private:
StackFramePtr top;
};

Accepted Answer

A)  top=NULL; 
B)  char next;
While ! empty ))
Next = pop );//pop calls delete. 
C)  char next;
While!empty ))
Next = push); 
D)  none of the above 
A)  top=NULL; 
B)  char next;
While ! empty ))
Next = pop );//pop calls delete. 
C)  char next;
While!empty ))
Next = push); 
D)  none of the above

Question 5

The arrow operator ->) specifies

Accepted Answer

A)  a member of a struct or class that is pointed to by a pointer variable 
B)  the pointer member only of a struct or a class that is pointed to by a pointer variable 
C)  less than or equal 
D)  is known as NULL 
A)  a member of a struct or class that is pointed to by a pointer variable 
B)  the pointer member only of a struct or a class that is pointed to by a pointer variable 
C)  less than or equal 
D)  is known as NULL

Question 6

Given a linked list using the code from the book), which of the following sets of statements would implement a function to return the last item in the list?

Accepted Answer

A)  NodePtr here;
Here=head;
Whilehere->link != NULL)
{
Here = here ->link;
}
Return here->data; 
B)  NodePtr here;
Here=head->link;
Whilehere != NULL)
{
Here = here ->link;
}
Return here->data; 
C)  NodePtr here;
Whilehere->link != NULL)
{
Here = here ->link;
}
Return here->data; 
D)  NodePtr here;
Here=head;
Whilehere->link != NULL)
{
Here = here ->link;
} 
A)  NodePtr here;
Here=head;
Whilehere->link != NULL)
{
Here = here ->link;
}
Return here->data; 
B)  NodePtr here;
Here=head->link;
Whilehere != NULL)
{
Here = here ->link;
}
Return here->data; 
C)  NodePtr here;
Whilehere->link != NULL)
{
Here = here ->link;
}
Return here->data; 
D)  NodePtr here;
Here=head;
Whilehere->link != NULL)
{
Here = here ->link;
}

Question 7

The constant NULL can be assigned only to pointers that point to numbers

Accepted Answer

A) True 
 B)False

Question 8

If you want to make your linked list a class, you must also include the _____.

Accepted Answer

big three copy const

Question 9

Given a linked list using the code from the book) and assuming there are at least two nodes in the list, which of the following sets of statements would implement a function to return and remove the last item in the list?

Accepted Answer

A)  NodePtr here;
Here=head;
Whilehere->link != NULL)
{
Here = here ->link;
}
Return here->data;
Delete here; 
B)  NodePtr here;
Here=head;
Whilehere->link != NULL)
{
Here = here ->link;
}
Delete here;
Return here->data; 
C)  int tmp;
NodePtr here, there;
Here=head;
Whilehere->link != NULL)
{
There = here;
Here = here ->link;
}
There->link = NULL;
Tmp=here->data;
Delete here;
Return tmp; 
D)  int tmp;
NodePtr here, there;
Here=head;
Whilehere->link != NULL)
{
There = here;
Here = here ->link;
}
There->link = NULL;
Tmp=here->data;
Return tmp;
Delete here; 
A)  NodePtr here;
Here=head;
Whilehere->link != NULL)
{
Here = here ->link;
}
Return here->data;
Delete here; 
B)  NodePtr here;
Here=head;
Whilehere->link != NULL)
{
Here = here ->link;
}
Delete here;
Return here->data; 
C)  int tmp;
NodePtr here, there;
Here=head;
Whilehere->link != NULL)
{
There = here;
Here = here ->link;
}
There->link = NULL;
Tmp=here->data;
Delete here;
Return tmp; 
D)  int tmp;
NodePtr here, there;
Here=head;
Whilehere->link != NULL)
{
There = here;
Here = here ->link;
}
There->link = NULL;
Tmp=here->data;
Return tmp;
Delete here;

Question 10

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

Accepted Answer

A)  pop 
B)  top 
C)  push 
D)  empty 
A)  pop 
B)  top 
C)  push 
D)  empty

Question 11

In a node type named MyNode, which of the following correctly declares a pointer to a node of that type?

Accepted Answer

A)  MyNode* ptr; 
B)  MyNode ptr; 
C)  ptr myNode*; 
D)  MyNode.data* ptr; 
A)  MyNode* ptr; 
B)  MyNode ptr; 
C)  ptr myNode*; 
D)  MyNode.data* ptr;

Question 12

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

Accepted Answer

The answer of Dynamically allocated memory that is no longer...

Question 13

A stack is a specialized type of list

Accepted Answer

A) True 
 B)False

Question 14

If head is a NodePtr pointer variable, write the code to make head point to new node of type Node.

Accepted Answer

The answer of If head is a NodePtr pointer variable,...

Question 15

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

Accepted Answer

A) True 
 B)False

Question 16

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

Accepted Answer

A) True 
 B)False

Question 17

The number of possible nodes in a linked list is __________

Accepted Answer

determined

Question 18

Data is removed from a stack in the _____ _______ it was entered.

Accepted Answer

A)  same order 
B)  reverse order 
C)  alternating order 
D)  sorted order 
A)  same order 
B)  reverse order 
C)  alternating order 
D)  sorted order

Question 19

Data is inserted into a queue at the back.

Accepted Answer

A) True 
 B)False

Question 20

The linked list is always the most efficient storage mechanism for storing many pieces of data.

Accepted Answer

A) True 
 B)False

What C++11 keyword can you use instead of NULL to distinguish between the null value and the number 0?

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

What happens if you have two lists list1, list2), no assignment operator in your class, and attempt to execute the following statement? List1 = list2;

The arrow operator ->) specifies

Given a linked list using the code from the book), which of the following sets of statements would implement a function to return the last item in the list?

The constant NULL can be assigned only to pointers that point to numbers

If you want to make your linked list a class, you must also include the _____.

Given a linked list using the code from the book) and assuming there are at least two nodes in the list, which of the following sets of statements would implement a function to return and remove the last item in the list?

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

In a node type named MyNode, which of the following correctly declares a pointer to a node of that type?

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

A stack is a specialized type of list

If head is a NodePtr pointer variable, write the code to make head point to new node of type Node.

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

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

The number of possible nodes in a linked list is __________

Data is removed from a stack in the _ ___ it was entered.

Data is inserted into a queue at the back.

The linked list is always the most efficient storage mechanism for storing many pieces of data.

Introduction to Computer and C++ Programming

C++ Basics

More Flow of Control

Procedural Abstraction and Functions That Return a Value

Functions for All Sub Tasks

Io Streams As an Introduction to Objects and Classes

Arrays

Strings and Vectors

Pointers and Dynamic Arrays

Defining Classes

Friends, Overloaded Operators, and Arrays in Classes

Separate Compilation and Namespaces

Recursion

Inheritance

Exception Handling

Templates

Standard Template Library

Filters

Exam 13: Pointers and Linked Lists

What C++11 keyword can you use instead of NULL to distinguish between the null value and the number 0?

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

What happens if you have two lists list1, list2), no assignment operator in your class, and attempt to execute the following statement? List1 = list2;

The arrow operator ->) specifies

Given a linked list using the code from the book), which of the following sets of statements would implement a function to return the last item in the list?

The constant NULL can be assigned only to pointers that point to numbers

If you want to make your linked list a class, you must also include the _____.

Given a linked list using the code from the book) and assuming there are at least two nodes in the list, which of the following sets of statements would implement a function to return and remove the last item in the list?

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

In a node type named MyNode, which of the following correctly declares a pointer to a node of that type?

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

A stack is a specialized type of list

If head is a NodePtr pointer variable, write the code to make head point to new node of type Node.

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

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

The number of possible nodes in a linked list is __________

Data is removed from a stack in the _____ _______ it was entered.

Data is inserted into a queue at the back.

The linked list is always the most efficient storage mechanism for storing many pieces of data.

Introduction to Computer and C++ Programming

C++ Basics

More Flow of Control

Procedural Abstraction and Functions That Return a Value

Functions for All Sub Tasks

Io Streams As an Introduction to Objects and Classes

Arrays

Strings and Vectors

Pointers and Dynamic Arrays

Defining Classes

Friends, Overloaded Operators, and Arrays in Classes

Separate Compilation and Namespaces

Recursion

Inheritance

Exception Handling

Templates

Standard Template Library

Filters

Data is removed from a stack in the _ ___ it was entered.