## Help authour, Buy PDF Ebook
>>>**Click Here**<<<

## Data Structure Questions and Answers-Singly Linked List Operations

Question 1 |

A linear collection of data elements where the linear node is given by means of pointer is called?

Linked list | |

Node list | |

Primitive list | |

None of the mentioned |

**Public administration Questions answers**

Question 2 |

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 |

**EVS Questions answers**

Question 3 |

In linked list each node contain minimum of two fields. One field is data field to store the data second field is?

Pointer to character | |

Pointer to integer | |

Pointer to node | |

Node |

**Current affairs Questions answers**

Question 4 |

What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?

O(1) | |

O(n) | |

θ(n) | |

θ(1) |

**Geography Questions answers**

Question 5 |

What would be the asymptotic time complexity to add an element in the linked list?

O(1) | |

O(n) | |

O(n ^{2}) | |

None of the mentioned |

**Puzzles Questions answers**

There are 5 questions to complete.