PLEASE ANSWER ALL QUESTIONS Question 1 of 13 When we attempt to delete an item i

Question

PLEASE ANSWER ALL QUESTIONS

Question 1 of 13

When we attempt to delete an item in a list, it is possible that we do not find that item in the list, in which case we cannot delete it.

Question 2 of 13

Unless we run out of memory, we can always insert in a linked list.

Question 3 of 13

In an empty list, head is null

Question 4 of 13

When we delete the first node in a list, we always set head to null.

Question 5 of 13

When we successfully delete an item from a list, the number of items in a list decreases by 1.

Question 6 of 13

Question 7 of 13

1.0 Points

Question 8 of 13

1.0 Points

Question 9 of 13

1.0 Points

Question 10 of 13

1.0 Points

A. Has fixed size

B. Can grow and shrink as items are added or deleted

C. Can grow but not shrink, i.e., items can be added but not deleted

D. Can shrink but not grow, i.e., items can be deleted but not added

Question 11 of 13

1.0 Points

A. 2 attributes: data and the location of the next node

B. 1 attribute only: data

C. 1 attribute only: the location of the next node

Question 12 of 13

When testing the delete method of a linked list, what scenarios do we want to test?

A. Attempt to delete an item not in the list

B. Delete the first item in the list

C. Delete an item in the middle of a list

D. All of the above

Question 13 of 13

A. Insert in an empty list (only)

B. Insert in an empty list and a non-empty list

C. Insert in a non-empty list( only)

D. There is no need to test if we think the method is properly coded

Question 1 of 16

Question 2 of 16

Question 3 of 16

Question 4 of 16

A. javax.swing

B. java.swing

C. java.awt

D. javax.awt

E. java.graphics

Question 5 of 16

A. init

B. main

C. paint

D. exit

E. applet

Question 6 of 16

Question 7 of 16

Question 8 of 16

Question 9 of 16

the upper right corner

the upper left corner

the lower right corner

the lower left corner

E. the center of the window

Question 10 of 16

The x and y coordinates of the top left corner of the rectangle being drawn

B. The x and y coordinates of the bottom right corner of the rectangle being drawn

C. The x and y coordinates of the top right corner of the rectangle being drawn

D. the width and height of the rectangle being drawn

E. the height and the width of the rectangle being drawn

Question 11 of 16

The x and y coordinates of the top left corner of the rectangle being drawn

B. The x and y coordinates of the bottom right corner of the rectangle being drawn

C. The x and y coordinates of the top right corner of the rectangle being drawn

D. the width and the height of the rectangle being drawn

E. the height and the width of the rectangle being drawn

Question 12 of 16

Question 13 of 16

Question 14 of 16

0,255,0

B. 255,0,0

C. 0,255,0

D. 0,0,0

E. 255,255,255

Question 15 of 16

255,0,0

255,200,0

255,0,200

0,0,0

E. 255,255,255

Question 16 of 16

A. 255

B. 3

C. around 16 million

D. around 1,000

E. around 65,000

True False

Explanation / Answer

I'm here providing you the solution for the first 5 questions of the given 13 questions

1.) True. It is possible that we may not find the element for which we are searching to delete.

2.) True. Since linked list is allocated dynamically and it uses pointer to point each other.

3.) True. In empty list, head is initialized to NULL.

4.) False. Whenever we delete the first element of the list, we always point the head to the next element to next element before deleting the first element.

5.) True. If we delete an item from list, the no. of items in a list is decreased by 1.

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.