QUIZ 2 Linked List

Complete the sentence below. The length of linked list is depends on .

• Number of nodes

• Number of head

• Number of tail

• Number of arrow

Choose the BEST answer to describe a doubly linked list

• A. A linked list in which each node has pointer to its successor.

• B. A linked list in which each node has pointer to its predecessor.

• C. A linked list in which each node has pointer to both its successor and its predecessor

• D. A linked list which the last node’s link point to the first node of the list.

Choose two components of the Array

• Data Type

• Name

• Counter

• Fixed

Complete the sentence below. Linked list is a data structure used for collecting a sequence of objects, which allows efficient additional, removal and retrieval

• A. from any position

• B. only from the head

• C. only from the tail

• D. only in the front

Choose the RIGHT declaration of an array, which is named hpnm, data type is floating number and have 5 data.

• A. float hpnm[] = 4;

• B. float hpnm[4];

• C. int hpnm[5];

• D. float hpnm[5];

Select two items are not a NODE elements

• A. Data

• B. Pointer

• C. data type

• D. tail

Choose the linked list referred based on figure below

• A. Singly linked list

• B. Doubly linked list

• C. Circular linked list

• D. Multiple linked list

Choose the example of implementation linked list in real life

• A. A stack of plates in the cafetaria

• B. User queue up to scan my Sejahtera

• C. Cars stuck in traffic jam

• D. People will be hike the mountain using connected roop

Choose the advantage of linked list over an array

• A. New elements can be stored anywhere and a reference is created for the new element using pointers.

• B. Random accessing is not possible in linked lists. The elements will have to be accessed sequentially.

• C. Memory is allocated during the compile time

• D. Size of the linked list must be specified at the time of declaration/initialization.

1.        Select the BEST answer based on operation below.

DeleteNode(2)

• Second node will be deleted

• Node at index 2 will be deleted

• Node will be added at index 2

• Node at index 1 will be deleted