A variation of linked list is circular linked list, in which...

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

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

How do you calculate the pointer difference in a memory efficient double linked list?

head xor tail

pointer to previous node xor pointer to next node

pointer to previous node

pointer to next node

Discussion

MCQ

A linked list contains a list pointer variable _____that stores the address of the first node of the list.

Start

Empty list

Discussion

MCQ

In a circular linked list

Components are all linked together in some sequential manner.

There is no beginning and no end.

Components are arranged hierarchically.

Forward and backward traversal within the list is permitted.

Discussion

MCQ

Given 10,8,6,7,9
swap the above numbers such that finally you got 6,7,8,9,10
so now reverse 10
9,7,6,8,10
now reverse 9
8,6,7,9,10
7,6,8,9,10
6,7,8,9,10
at this point 6 is ahead so no more reversing can be done so stop.
To implement above algorithm which datastructure is better and why ?

linked list. because we can swap elements easily

arrays. because we can swap elements easily

xor linked list. because there is no overhead of pointers and so memory is saved

doubly linked list. because you can traverse back and forth

Discussion

MCQ

Consider the below representation and predict what will be printed on the screen by following statement ?start->next->data

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

Access the

None of these

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