Which of the following statements are correct with respect t...

MCQ

Which of the following statements are correct with respect to Singly Linked List(SLL) and Doubly Linked List(DLL)?

Complexity of Insertion and Deletion at known position is O(n) in SLL and O(1) in DLL

SLL uses lesser memory per node than DLL

DLL has more searching power than SLL

All 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 space complexity for deleting a linked list?

O(1)

O(n)

Either O(1) or O(n)

O(logn)

Discussion

MCQ

A variation of linked list is circular linked list, in which the last node in the list points to first node of the list. One problem with this type of list is?

It waste memory space since the pointer head already points to the first node and thus the list node does not need to point to the first node.

It is not possible to add a node at the end of the list.

It is difficult to traverse the list as the pointer of the last node is now not NULL

All of above

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

What does creating a node mean?

Defining its structure

Allocating memory to it

Initialization

All of the above

Discussion

MCQ

The time required to search an element in a linked list of length n is

O(1)

O(n)

0 (n2)

O(log2

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