Congratulations - you have completed *Data Structure*.

You scored %%SCORE%% out of %%TOTAL%%.

Your performance has been rated as %%RATING%%

Your answers are highlighted below.

Question 1 |

In Linked list implementation, a node carries information regarding _______.

Data | |

Link | |

Data and Link |

Question 2 |

A linked list in which the last node of Linked list points to the first is called a _________.

Circular Linked List | |

Doubly Linked List | |

Singly Linked List | |

None of these |

Question 3 |

A doubly linked list performs traversal in _________.

Either direction | |

Any direction | |

Circular direction |

Question 4 |

Linked list data structure usage offers considerable saving in

Space utilization & computational time. | |

Computational time | |

Space utilization |

Question 5 |

Consider linked list is used to implement the Stack then which of the following node is considered as Top of the Stack ?

Any Node | |

Last Node | |

First Node | |

Middle Node |

Once you are finished, click the button below. Any items you have not completed will be marked incorrect.

**Pages:** 1 | 2 |