Question Discussion & Solution

MCQ

Can we read a data item at any location of a list within a constant time (i.e. O(1))?

Yes

Yes, only if the list is implemented by pointers (i.e. linked-list)

Yes, only if the list is implemented by an array

No, we need O(n) computation steps no matter what kind of implementation is used

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Linked list data structure offers considerable saving in

Computational Time

Space Utilization

Space Utilization and Computational Time

None of the mentioned

Discussion

MCQ

The time required to delete a node x from a doubly linked list having n nodes is

O (n)

O (log n)

O (1)

O (n log n)

Discussion

MCQ

Consider the following doubly linked list: head-1-2-3-4-5-tail. What will be the list after performing the given sequence of operations?

	Node temp = new Node(6,head,head.getNext());
	Node temp1 = new Node(0,tail.getPrev(),tail);
	head.setNext(temp);
	temp.getNext().setPrev(temp);
	tail.setPrev(temp1);
	temp1.getPrev().setNext(temp1);

head-0-1-2-3-4-5-6-tail

head-1-2-3-4-5-6-tail

head-6-1-2-3-4-5-0-tail

head-0-1-2-3-4-5-tail

Discussion

MCQ

Consider the following linked list and linked list representation.

what will be the value of following statement ?start->next->next->next->data

struct node {
      int data;
      struct node *next;
}*start = NULL;

Discussion

MCQ

In Circular Linked List insertion of a node involves the modification of ____ links.

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