Question 1

Here is a diagram of a three node linked list with a head pointer and a node to be inserted.Show all steps necessary to delete the second node,pointed to by discard_me.You may assume the necessary search for the node to be deleted is done and the pointer discard_me is already positioned.
You are to make clear the sequence of steps by either numbering the steps,or by making several copies of this drawing,with one change per drawing,numbered to show the sequence.
You may assume that a search routine taking a head pointer and data arguments has been defined for you.
Give code and the drawing to make clear what you are doing.
NodePtr discard_me;
NodePtr temp_ptr;

Accepted Answer

The answer of Here is a diagram of a three...

Question 2

Given the type definitions:
const int STRING_SIZE = 20;
struct ListNode
{
char item[STRING_SIZE];
int count;
ListNode *link;
};
ListNode *head = new ListNode;
Give a typedef statement that hides the pointer operator *.Call the new type identifier NodePtr.

Accepted Answer

The answer of Given the type definitions:
const int STRING_SIZE =...

Question 3

A linked list is normally specified by giving a pointer pointing to the first node of a list.An empty list has no nodes at all.What is the value of a head pointer for an empty list?

Accepted Answer

The answer of A linked list is normally specified by...

Question 4

Here is a diagram of a three node linked list with a head pointer and a node to be inserted.Show all steps necessary to insert the node pointed to by temp between the second and third nodes,including the search for the node prior to insertion.You are to make clear the sequence of steps by either numbering the steps,or by making several copies of this drawing,with one change per drawing,numbered to show the sequence.You may assume a search routine taking a head node and data has been defined for you.
Give code and the drawing to make clear what you are doing.

Accepted Answer

The answer of Here is a diagram of a three...

Question 5

Given the doubly linked list in the diagram below,give the code to delete the second node in the list with the number 31.Assume each entry in the list is a node of class Node with a public next and prev member variable.

Accepted Answer

The answer of Given the doubly linked list in the...

Question 6

Describe why a very large hash table will likely increase the performance (i.e.faster additions and lookup)at the expense of wasting memory,and vice versa,why a small hash table will use less memory but result in a decrease in performance.

Accepted Answer

The answer of Describe why a very large hash table...

Question 7

Name the stack operations as implemented in the text.Tell what each does.

Accepted Answer

The answer of Name the stack operations as implemented in...

Question 8

Suppose you have the following struct definition and typedef statements in your program:
struct N
{
double d;
N *next;
};
typedef N* node_ptr;
node_ptr head,p1,p2;
Now suppose further that p1 points to a node of type N in the middle of a linked list (neither the first nor the last node).Write code that deletes the node after the node p1 points to in the linked list.After the code is executed,the linked list should be the same,excepting the specified node is missing.

Accepted Answer

The answer of Suppose you have the following struct definition...

Question 9

Why can a raw pointer be used as an iterator for an array,but not for a list?

Accepted Answer

The answer of Why can a raw pointer be used...

Question 10

Give pseudocode for inserting a node in front of the head node in a linked list.

Accepted Answer

The answer of Give pseudocode for inserting a node in...

Quiz 17: Linked Data Structures

Given the type definitions: const int STRING_SIZE = 20; struct ListNode { char item[STRING_SIZE]; int count; ListNode link; }; ListNode head = new ListNode; Give a typedef statement that hides the pointer operator *.Call the new type identifier NodePtr.

A linked list is normally specified by giving a pointer pointing to the first node of a list.An empty list has no nodes at all.What is the value of a head pointer for an empty list?

Given the doubly linked list in the diagram below,give the code to delete the second node in the list with the number 31.Assume each entry in the list is a node of class Node with a public next and prev member variable.

Describe why a very large hash table will likely increase the performance (i.e.faster additions and lookup)at the expense of wasting memory,and vice versa,why a small hash table will use less memory but result in a decrease in performance.

Name the stack operations as implemented in the text.Tell what each does.

Why can a raw pointer be used as an iterator for an array,but not for a list?

Give pseudocode for inserting a node in front of the head node in a linked list.

Quiz 17: Linked Data Structures

Given the type definitions: const int STRING_SIZE = 20; struct ListNode { char item[STRING_SIZE]; int count; ListNode *link; }; ListNode *head = new ListNode; Give a typedef statement that hides the pointer operator *.Call the new type identifier NodePtr.

A linked list is normally specified by giving a pointer pointing to the first node of a list.An empty list has no nodes at all.What is the value of a head pointer for an empty list?

Given the doubly linked list in the diagram below,give the code to delete the second node in the list with the number 31.Assume each entry in the list is a node of class Node with a public next and prev member variable.

Describe why a very large hash table will likely increase the performance (i.e.faster additions and lookup)at the expense of wasting memory,and vice versa,why a small hash table will use less memory but result in a decrease in performance.

Name the stack operations as implemented in the text.Tell what each does.

Why can a raw pointer be used as an iterator for an array,but not for a list?

Give pseudocode for inserting a node in front of the head node in a linked list.

Given the type definitions: const int STRING_SIZE = 20; struct ListNode { char item[STRING_SIZE]; int count; ListNode link; }; ListNode head = new ListNode; Give a typedef statement that hides the pointer operator *.Call the new type identifier NodePtr.