KofiNketiaAckaahGyasi_CSCI2380_03Pre2

What kind of data structures are the nodes used in linked lists?

• Arrays

• Stacks

• Divided Box

• Classes

Which of the following is not an attribute of a singly linked list?

• A node class

• A head pointer

• A count variable

• A next pointer

Which of the following is an example of dynamic memory allocation?

• long int x = &num

• Node *ptr = new Node();

• int array[] ={4,7,3};

Which of the following can be example of a function of a linked list that uses a pointer as an argument?

• myLL.pushback(5);

• void myLL.insert(Node * ptr)

• myLL.deletefront();

A linked list that works as ONLY a stack should not have which function

• push_back()

• pop_front()

• pop_back()

• traverse()

Which of the following is not defined as part of a linked list

• head

• tail

• pointer1

• count

The head may point to .... (MULTIPLE CHOICE)

• first node in the linked list

• first string in the linked list

• nullptr

• the tail pointer

Which of the following signifies the end of a linked list? (MULTIPLE CHOICE)

• head = tail;

• tail = nullptr;

• head = nullptr;

• count = 0;

What does the following class definition signify?

class node{

double info;

node * next;

node * prev;

}

• Dynamic arrays

• Singly linked lists

• Doubly linked lists

• Stacks

Head in a linked list is a

• pointer in the linked list class

• pointer in the node class

• first node