gs gs121 Abstract Data Types - Circular Linked Lists - Quiz No.1
gs gs121 Data Structures and Algorithms Quiz
This quiz belongs to book/course code gs gs121 Data Structures and Algorithms of gs organization. We have 169 quizzes available related to the book/course Data Structures and Algorithms. This quiz has a total of 10 multiple choice questions (MCQs) to prepare and belongs to topic Abstract Data Types. NVAEducation wants its users to help them learn in an easy way. For that purpose, you are free to prepare online MCQs and quizzes.
NVAEducation also facilitates users to contribute in online competitions with other students to make a challenging situation to learn in a creative way. You can create one to one, and group competition on an topic of a book/course code. Also on NVAEducation you can get certifications by passing the online quiz test.
Question 1: 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
In a circular linked list, each node points to the previous node instead of the next node
Head node is known in circular linked list
Question 2: How do you count the number of elements in the circular linked list?
public int length(Node head) { int length = 0; if( head == null) return 0; Node temp = head.getNext(); while(temp != head) { temp = temp.getNext(); length++; } return length; } public int length(Node head) { int length = 0; if( head == null) return 0; Node temp = head.getNext(); while(temp != null) { temp = temp.getNext(); length++; } return length; } public int length(Node head) { int length = 0; if( head == null) return 0; Node temp = head.getNext(); while(temp != head && temp != null) { temp = head.getNext(); length++; } return length; } public int length(Node head) { int length = 0; if( head == null) return 0; Node temp = head.getNext(); while(temp != head && temp == null) { temp = head.getNext(); length++; } return length; }
Question 3: What is the functionality of the following piece of code? Select the most appropriate.
public void function(int data) { int flag = 0; if( head != null) { Node temp = head.getNext(); while((temp != head) && (!(temp.getItem() == data))) { temp = temp.getNext(); flag = 1; break; } } if(flag) System.out.println("success"); else System.out.println("fail"); }
Print success if a particular element is not found
Print fail if a particular element is not found
Print success if a particular element is equal to 1
Print fail if the list is empty
Question 4: What is the time complexity of searching for an element in a circular linked list?
O(n)
O(nlogn)
O(1)
O(n2)
Question 5: Which of the following application makes use of a circular linked list?
Undo operation in a text editor
Recursive function calls
Allocating CPU to resources
Implement Hash Tables
Question 6: Choose the code snippet which inserts a node to the head of the list?
public void insertHead(int data) { Node temp = new Node(data); Node cur = head; while(cur.getNext() != head) cur = cur.getNext() if(head == null) { head = temp; head.setNext(head); } else { temp.setNext(head); head = temp; cur.setNext(temp); } size++; } public void insertHead(int data) { Node temp = new Node(data); while(cur != head) cur = cur.getNext() if(head == null) { head = temp; head.setNext(head); } else { temp.setNext(head.getNext()); cur.setNext(temp); } size++; } public void insertHead(int data) { Node temp = new Node(data); if(head == null) { head = temp; head.setNext(head); } else { temp.setNext(head.getNext()); head = temp; } size++; } public void insertHead(int data) { Node temp = new Node(data); if(head == null) { head = temp; head.setNext(head.getNext()); } else { temp.setNext(head.getNext()); head = temp; } size++; }
Question 7: What is the functionality of the following code? Choose the most appropriate answer.
public int function() { if(head == null) return Integer.MIN_VALUE; int var; Node temp = head; while(temp.getNext() != head) temp = temp.getNext(); if(temp == head) { var = head.getItem(); head = null; return var; } temp.setNext(head.getNext()); var = head.getItem(); head = head.getNext(); return var; }
Return data from the end of the list
Returns the data and deletes the node at the end of the list
Returns the data from the beginning of the list
Returns the data and deletes the node from the beginning of the list
Question 8: What is the functionality of the following code? Choose the most appropriate answer.
public int function() { if(head == null) return Integer.MIN_VALUE; int var; Node temp = head; Node cur; while(temp.getNext() != head) { cur = temp; temp = temp.getNext(); } if(temp == head) { var = head.getItem(); head = null; return var; } var = temp.getItem(); cur.setNext(head); return var; }
Return data from the end of the list
Returns the data and deletes the node at the end of the list
Returns the data from the beginning of the list
Returns the data and deletes the node from the beginning of the list
Question 9: 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
Question 10: 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
Online Quizzes of gs121 Data Structures and Algorithms
Binary Trees - Binary Search Tree - Quiz No.1
gs gs121
Data Structures and Algorithms Online Quizzes
Binary Trees - Binary Search Tree - Quiz No.2
gs gs121
Data Structures and Algorithms Online Quizzes
Binary Trees - Preorder Traversal - Quiz No.1
gs gs121
Data Structures and Algorithms Online Quizzes
