java list quiz

In Doubly liked list ,number of pointers affected by an insertion operation will be

Which of the following is false about a doubly linked list?

• We can navigate in both the directions

• It requires more space than a singly linked list

• The insertion and deletion of a node take a bit longer

• Implementing a doubly linked list is easier than singly linked list

What differentiates a circular linked list from a normal linked list?

• You cannot have the ‘next’ pointer point to null in a circular linked list

• It is faster to traverse the circular linked list

• You may or may not have the ‘next’ pointer point to null in a circular linked list

• Head node is known in circular linked list

What is the time complexity of searching for an element in a circular linked list?

• O(n)

• O(1)

• O(logn)

• O(nlogn)

Which of the following is false about a circular linked list?

• Every node has a successor

• Time complexity of inserting a new node at the head of the list is O(1)

• Time complexity for deleting the last node is O(n)

• We can traverse the whole circular linked list by starting from any point

Consider a small circular linked list. How to detect the presence of cycles in this list effectively?

• Keep one node as head and traverse another temp node till the end to check if its ‘next points to head

• Have fast and slow pointers with the fast pointer advancing two nodes at a time and slow pointer advancing by one node at a time

• Cannot determine, you have to pre-define if the list contains cycles

• Circular linked list itself represents a cycle. So no new cycles cannot be generated

In circular linked list ,number of pointers affected by an insertion operation?

In circular linked list ,we come back to the same node within time complexity?

• O(n)

• O(logn)

• O(1)

• O(nlogn)

Which data structure is used for balancing of symbols?

• stack

• queue

• linked list

• tree

Consider a situation where a client receives packets from a server. There may be differences in speed of the client and the server. Which data structure is best suited for synchronization?

• queue

• stack

• Priority queue

• Circular linked list