data structures and algorithms

Consider the following definition in c programming language.

struct node

{

int data;

struct node next;

}

typedef struct node NODE;

NODE ptr;

Which of the following c code is used to create new node?

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

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

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

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

What is the correct way to access the data field of a node in the linked list defined above?

• ptr->data;

• ptr.data;

• *ptr.data;

• data.ptr;

Which of the following statements correctly frees the memory allocated for a node?

• free(ptr);

• delete ptr;

• ptr = NULL;

• dispose(ptr);

In the context of the given struct, what does the 'next' pointer represent?

• It points to the previous node.

• It points to the next node in the linked list.

• It is a null pointer.

• It stores the size of the node.

Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head pointer only. Given the representation, which of the following operation can be implemented in O(1) time?

i) Insertion at the front of the linked list ii) Insertion at the end of the linked list iii) Deletion of the front node of the linked list iv) Deletion of the last node of the linked list

• I and II

• I and III

• I, II and III

• I, II and IV

What does the following code perform ?

void function(struct Node* head)

{

while (head != NULL)

{

printf("%d -> ", head->data);

head = head->next;

}

printf("NULL\n");

}

• Deleting a node

• Printing the link list elements

• Searching an element in link list

• none

What is the output of the following code snippet?

void function(struct Node* head) {

if (head == NULL) return;

function(head->next);

printf("%d ", head->data);

}

• Elements in reverse order

• Elements in original order

• Only the first element

• None of the above

Which of the following statements correctly initializes a linked list?

• struct Node* head = NULL;

• struct Node head = NULL;

• Node* head = (Node*)malloc(sizeof(Node));

• Node head = (Node)malloc(sizeof(Node));

In a doubly linked list, what does the 'prev' pointer represent?

• It points to the next node in the list.

• It points to the previous node in the list.

• It is a null pointer.

• It stores the size of the node.

Pushing an element into stack already having five elements and stack size of 5, then stack becomes ___________

• Overflow

• Crash

• Underflow

• User flow