Exam 17: Linked Data Structures

The link field in the last node in a linked list has a special value stored in it.What is it? It has a special name.What is the special name? Why is this done?

Given the type definitions: const int STRING_SIZE = 20; struct ListNode { $\quad$ char item[STRING_SIZE]; $\quad$ int count; $\quad$ ListNode * link; }; What is the output produced by the following code? (As always,you are to assume that the code is embedded in a correct and complete program. ListNode * head = new ListNode; strcpy( head->item,"Stop Light"); head->count = 10; cout << (*head).item << endl; cout << head->item << endl; cout << (*head).count << endl; cout << head->number << endl;

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

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

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

Removing data from a stack is called popping the stack.

A tree is a recursive structure.

Given the structure definition: const int STRING_SIZE = 20; struct ListNode { $\quad$ char item[STRING_SIZE]; $\quad$ int count; $\quad$ ListNode *link; }; ListNode *head = new ListNode; Give code to assign the string "Wilbur's brother Orville" to the member item of the variable to which head points.Hint: you need a function declared in cstring.

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.

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