What are the time complexities of finding 8th element from beginning a – McqOptions

MCQOPTIONS

1.	What are the time complexities of finding 8th element from beginning and 8th element from end in a singly linked list? Let n be the number of nodes in linked list, you may assume that n>8.
A.	O(n) and O(n)
B.	O(1) and O(1)
C.	O(n) and O(1)
D.	O(1) and O(n)
Answer» E.

Discussion

No Comment Found

Related MCQs

What’s wrong with this code which returns xor of two nodes address ?
How would you delete a node in the singly linked list? The position to be deleted is given.
Which of the following piece of code has the functionality of counting the number of elements in the list?
How do you insert an element at the beginning of the list?
What is the functionality of the following piece of code? Select the most appropriate
How do you count the number of elements in the circular linked list?
What is the output of following function for start pointing to first node of following linked list?
What does the following function do for a given Linked List with first node as head?
The following function reverse() is supposed to reverse a singly linked list. There is one line missing at the end of the function.What should be added in place of “/*ADD A STATEMENT HERE*/”, so that the function correctly reverses a linked list.
The following C function takes a single-linked list of integers as a parameter and rearranges the elements of the list.The function is called with the list containing the integers 1, 2, 3, 4, 5, 6, 7 in the given order. What will be the contents of the list after the function completes execution?