Question 1

In the following search function for a linked list using the Node and NodePtr as defined in the text), why is there code to check if here is NULL?
NodePtr searchNodePtr head, int target)
{
NodePtr here = head;
Ifhere == NULL)
{
Return NULL;
}
Else
{
While here->data != target && here->link != NULL)
{
Here = here->link;
}
Ifhere->data == target)
{
Return here;
}
Else
{
Return NULL;
}
}
}

Accepted Answer

A)  the list may be empty 
B)  the list may be full 
C)  there is no reason for that code to be there 
D)  A and B

Question 2

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

Accepted Answer

A) True 
 B)False

Question 3

*head.item is the same as *head).item

Accepted Answer

A) True 
 B)False

Question 4

A _______ is a list constructed using pointers.

Accepted Answer

The answer of A _______ is a list constructed using...

Question 5

The last node in a linked list as defined in the text should always point back to the head of the list.

Accepted Answer

A) True 
 B)False

Question 6

The stack can be compared to a line of people at a bank, where the first person in line is the first person served.

Accepted Answer

A) True 
 B)False

Question 7

The first node in a linked list is generally named _________

Accepted Answer

The answer of The first node in a linked list...

Question 8

Data is removed at the back of the queue.

Accepted Answer

A) True 
 B)False

Question 9

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

Accepted Answer

The answer of In a linked list as defined in...

Question 10

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

Accepted Answer

The answer of The function used to put data into...

Question 11

A linked list is not fixed in size.

Accepted Answer

A) True 
 B)False

Question 12

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

Accepted Answer

The answer of The arrow operator ->) combines the actions...

Question 13

If you need to access the last element of a linked list with N nodes in it, how many comparisons do you need to make to find the last element?

Accepted Answer

A)  0 
B)  1 
C)  N-1 
D)  N

Question 14

You can directly access the nth node of a linked list

Accepted Answer

A) True 
 B)False

Question 15

A stack exhibits ______________ behavior

Accepted Answer

A)  last-in/ first-out 
B)  last-in/last-out 
C)  first-in/first-out 
D)  none of the above

Question 16

A _________ is a struct or class object that has one or more member variables that are pointer variables.

Accepted Answer

The answer of A _________ is a struct or class...

Question 17

The stack exhibits last-in/first-out behavior

Accepted Answer

A) True 
 B)False

Question 18

A stack can be implemented using a __________.

Accepted Answer

The answer of A stack can be implemented using a...

Question 19

What is wrong with the following definition of headInsert?
Struct Node
{
Int item;
Node* link;
};
Typedef Node* NodePtr;
Void headInsertNodePtr& head, int data)
{
NodePtr tmp = new Node;
Tmp->item = data;
Head->next = tmp;
Tmp->next = head->next;
}
NodePtr head;
HeadInserthead, 4);

Accepted Answer

A)  head->next is pointing to NULL 
B)  if there were any nodes following head they are now lost. 
C)  nothing is wrong. 
D)  tmp should be declared to be a Node not a NodePtr

Question 20

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?

Accepted Answer

A)  0 
B)  1 
C)  N-1 
D)  N

Exam 13: Pointers and Linked Lists

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

head.item is the same as head).item

A _______ is a list constructed using pointers.

The last node in a linked list as defined in the text should always point back to the head of the list.

The stack can be compared to a line of people at a bank, where the first person in line is the first person served.

The first node in a linked list is generally named _________

Data is removed at the back of the queue.

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

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

A linked list is not fixed in size.

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

If you need to access the last element of a linked list with N nodes in it, how many comparisons do you need to make to find the last element?

You can directly access the nth node of a linked list

A stack exhibits ______________ behavior

A _________ is a struct or class object that has one or more member variables that are pointer variables.

The stack exhibits last-in/first-out behavior

A stack can be implemented using a __________.

What is wrong with the following definition of headInsert? Struct Node { Int item; Node* link; }; Typedef Node* NodePtr; Void headInsertNodePtr& head, int data) { NodePtr tmp = new Node; Tmp->item = data; Head->next = tmp; Tmp->next = head->next; } NodePtr head; HeadInserthead, 4) ;

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?