KRHS Internet Lesson

Teacher Name:Mr Rung                          Date of Lesson: April/May

Course Name: C++                    Lesson Name: Chap 16.4

Student Name

Password

Objective
To complete the workbook exercises.

Primary Focus
Answer the workbook questions below.

Site Links
Course Home Page

Additional Resources

Site Links

Question #1

Doubly-linked lists required less complicated programming code than singly-linked lists.

True         False

Question #2

An extra pointer in each node that points to the previous node allows traversal in each direction of a doubly-linked list.

True         False

Question #3

The first node created in a circularly-linked list must always serve as the head of the list.

True         False

Question #4

A circularly-linked list is like a singly-linked list with one exception-the last node's next pointer points to the beginning of the list.

True         False

Question #5

Each node in a circularly-linked list has a null pointer.

True         False