COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
moving pages forward and backward in browser
|
|
|
Giving chance to each player in a multi player game
|
|
|
Implementing Stack
|
|
|
None of the above
|
Detailed explanation-1: -Circular Linked Lists can be used to manage the computing resources of the computer. Data structures such as stacks and queues are implemented with the help of the circular linked lists. Circular Linked List is also used in the implementation of advanced data structures such as a Fibonacci Heap.
Detailed explanation-2: -A simple example is keeping track of whose turn it is in a multi-player board game. Put all the players in a circular linked list. After a player takes his turn, advance to the next player in the list. This will cause the program to cycle indefinitely among the players.
Detailed explanation-3: -Answer: D) Explanation: Circular Linked List stores the pointer of the head node in the next pointer of the last node.
Detailed explanation-4: -Circular Linked Lists is the basic idea for the round robin scheduling algorithm.