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

MCQ

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)

None of the mentioned

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

What is the functionality of the following code?

public void function(Node node)
{
	if(size == 0)
		head = node;
	else
	{
		Node temp,cur;
		for(cur = head; (temp = cur.getNext())!=null; cur = temp);
		cur.setNext(node);
	}
	size++;
}

Inserting a node at the beginning of the list

Deleting a node at the beginning of the list

Inserting a node at the end of the list

Deleting a node at the end of the list

Discussion

MCQ

A pointer that is used to keep last link of list is called

Head

Initiator

Tail

Terminator

Discussion

MCQ

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;
}

Discussion

MCQ

Which of the following operations is performed more efficiently by doubly linked list than by singly linked list?

Deleting a node whose location in given

Searching of an unsorted list for a given item

Inverting a node after the node with given location

Traversing a list to process each node

Discussion

MCQ

What is a memory efficient double linked list?

Each node has only one pointer to traverse the list back and forth

The list has breakpoints for faster traversal

An auxiliary singly linked list acts as a helper list to traverse through the doubly linked list

None of the mentioned

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics