assessment 1

What is the return value of malloc ()?

• 0

• NULL

• starting address

• none of abive

difference between static and dynamic memory

Which of the following information is stored in a doubly-linked list’s nodes?

• value of the node

• address of next node

• address of previous node

• all the above

. 

Insertion of an element at the ends of a linked list requires the modification of how many pointers?

• 2

• 1

• 3

• 4

Which type of linked list stores the address of the head node in the next pointer of the last node?

• singly linked list

• double linked list

• circular linked list

• Hashed list

Polynomial addition can be implemented using which of the following data structure?

In which type of linked lists traversals can be performed in both directions?

• Singly Linked Lists

• Doubly Linked Lists

• Circular Linked Lists

• None of the above

A linked list in which none of the nodes contains a NULL pointer is?

• Singly Linked List

• Doubly Linked List

• Circular Linked List

• None of the above

The type of pointer used to point to the address of the next element in a linked list?

• Pointer to character

• Pointer to integer

• Pointer to node

• None of the above

• ptr=(NODE*)malloc(sizeof(NODE));

• ptr=(NODE*)malloc(NODE);

• ptr=(NODE*)malloc(sizeof(NODE*));

• ptr=(NODE)malloc(sizeof(NODE));