Data Structures and Algorithms Quiz

What is an array?

• A linear collection of data elements with random access

• A linear collection of data elements with consecutive storage

• A dynamic data structure with elements stored in random locations

• A collection of linked nodes with consecutive storage

How is memory allocated for a node in a linked list using malloc?

• malloc(sizeof(struct node))

• malloc(sizeof(struct node*)

• malloc(sizeof(struct node) + sizeof(struct node*)

• malloc(sizeof(struct node*) + sizeof(struct node)

What is the purpose of the head pointer in a linked list?

• To point to the last node in the list

• To track the first element in the linked list

• To store the size of the linked list

• To allow random access of data in the linked list

Which type of linked list allows elements to be added or removed from the middle of the list?

• Singly Linked List

• Doubly Linked List

• Circular Linked List

• All of the above

What is a memory leak in dynamic memory allocation?

• Allocating memory without using malloc

• Not deallocating memory using free

• Allocating too much memory using malloc

• Deallocating memory multiple times using free

Which function is used to deallocate memory in dynamic memory allocation?

• release()

• deallocate()

• free()

• clear()

What is the main advantage of a linked list over an array?

• Random access of elements

• Efficient memory usage

• Fixed size

• Limited insertion and deletion operations

Which type of linked list is both singly linked and doubly linked?

• Singly Linked List

• Doubly Linked List

• Circular Linked List

• All of the above

How is a new node inserted at the beginning of a singly linked list?

• Update the next pointer of the new node to point to the current head of the list

• Set the head pointer of the linked list to point to the newly created node.

• Allocate space for the new node with malloc

• All of the above

In a singly linked list, how is the insertion at the end performed when there is at least one node in the list?

• temp->next = ptr; ptr->next = NULL;

• ptr->next = temp; temp->next = NULL;

• temp = ptr; ptr->next = NULL;

• temp->next = NULL; ptr->next = temp;