CS 173 Lecture 7: Proving one to one

Part (c) [1 MARK List [6, 5, 2, 3, 7, 1, 4] is being sorted using insertion sort. Fill in the blanks to show the list after the next two passes. After one pass: After two passes: [6, 5, 2, 3, 7, 1, 4] [5, 6, 2, 3, 7, 1, 4] After three passes: After four passes:

7. Consider the Node class in the appendix. The following code Nodell myNodes = new Node [10]; for ( int i = 0; i < myNodes.length - 1; i++) { myNodes[i] = new Node (i); myNodes[i].setNext (myNodes [i+1]); will produce an array of 10 Node objects. Each Node will have its next attribute pointing to the next Node in the array (except for the last one, which has next = null). (A) FALSE (B) TRUE

When is it sufficient to use a list to organize data?

1. When the data is simple and can be organized in one table
2. When more than one person needs to access the data
3. When data needs to be organized into two or more tables
4. All of the above