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: -Implement stack using a singly linked list that supports the basic operations of stack data structure such as push(), pop(), top(), isEmpty(), and follows the last in first out order(LIFO).
Detailed explanation-2: -Applications of Singly Linked List : The singly linked list is used to implement stack and queue.
Detailed explanation-3: -Stack is a linear data structure that follows the Last in, First Out Principle (LIFO). Stack can be represented using nodes of a linked list. Stack supports operations such as push, pop, size, peek, and is Empty. Elements can be pushed or popped from one end only.
Detailed explanation-4: -Which of the following is true about linked list implementation of stack? (A) In push operation, if new nodes are inserted at the beginning of linked list, then in pop operation, nodes must be removed from end.
Detailed explanation-5: -Explanation: To implement file system, for separate chaining in hash-tables and to implement non-binary trees linked lists are used.