MCQ Quiz - Data Structures - Circular Linked Lists
* Required
Name:
*
Your answer
Full Address (with City, State, Country):
*
Your answer
Organization Name:
*
Your answer
Email-Id:
*
Your answer
MCQ Quiz Section
1) In a circular linked list, the pointer of which of the following nodes points to null?
first node
last node
can be any of the nodes
None of these
2) In a circular linked list, the pointer of the last node points to
first node
null
second last node
None of these
3) You are given the head pointer of a circular linked list of size n.You then start tranversing the linked list and stop when you encounter null pointer.How many nodes would you have covered?
n-1 nodes
n nodes
it can be any number between 1 to n nodes
None of these
4) Which of the following things are best represented by circular linked lists?
a given set of integers which need to be sorted
vertices of a polygon
names of students according to roll numbers
None of these
5) Your friend, while programming, accidentally changed the location of the head pointer of circular linked list to a different node(different from first node).He now asks you to find the initial location of the head pointer.You can find it in
Θ(1) time
Θ(n) time
it cannot be found out
time will be too small to even calculate
6) In a circular linked list of size n,you are given the address of the last node.What will be the time required to access the data stored in the second last node?
Θ(n) time
Θ(1) time
Θ(log n) time
it cannot be found out
7) Which of the following problems can occur with circular linked list?
not dynamic data structure
infinite loop
cannot insert in Θ(1) time
None of these
8) Which of the following statements are true?
there is no null pointer in circular linked list
in circular linked list, from every node we can reach every other node
All of the above
None of the above
9) To convert a simple linked list into a cicular linked list,we need to
make the head pointer point to the last node and then reverse the list
make the last node point to the first node
arrange the nodes of the list in a circle in the computer memory
anyone of the above methods can be used
10) After converting a simple linked list of size n into a cicular linked list,it will take
Θ(1) time to move from first node to last node and Θ(n) time to move from last node to first node
Θ(n) time to move from first node to last node and Θ(n) time to move from last node to first node
Θ(1) time to move from first node to last node and Θ(1) time to move from last node to first node
Θ(n) time to move from first node to last node and Θ(1) time to move from last node to first node
Submit
Never submit passwords through Google Forms.
Forms
This content is neither created nor endorsed by Google.
Terms of Service