CS301P Solved Quiz by Sahirullah

CS301P - Data Structures (Practical)

Solved by: Sahirullah | | info.sahirweb

1. When the call to remove a node is made, a node which is being pointed by ______ will be deleted.

Current node

Null node Last Current node head node

2. Removing an element from the end of stack using a linked list takes _______ time than removing an element from the start. Equal No

More

Less

Q3. Which of the following linked list method moves the pointer forward?

remove () add () start ()

next ()

Q4. In stack, which node will be considered as the Top of stack?

Last node

First node

Any node Middle node

Q5. Which type of linked list has two Null pointers?

Circularly linked list singly linked list

doubly linked list

None of the given options

CS301P Solved Quiz • Sahirullah