adplus-dvertising
frame-decoration

Question

If a list contains no elements it is said to be

a.

Hollow

b.

Empty

c.

Finite

d.

Infinite

Answer: (b).Empty

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. If a list contains no elements it is said to be

Similar Questions

Discover Related MCQs

Q. In a linked list array, objects are referred to as

Q. Linked list uses

Q. Number of elements stored in any list is called its

Q. Standard approach for implementation of a list is/are of

Q. An ordered sequence of data items are known to be

Q. First link node of list is accessed from a pointer named

Q. A linked list is made up of a set of objects known as

Q. Definition of a list is to be

Q. Beginnning of any list is called its

Q. Key design decision embodied in this ADT is support for concept of a

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

Q. End of any list is called its

Q. Important concept related to lists is of

Q. Which of the following is false about a doubly linked list?

Q. What is a memory efficient double linked list?

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

Q. What is the time complexity of inserting a node in a doubly linked list?

Q. Consider the 2-level skip list. How to access 38?

Q. Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head pointer only.
Given the representation, which of the following operation can be implemented in O(1) time?

i) Insertion at the front of the linked list

ii) Insertion at the end of the linked list

iii) Deletion of the front node of the linked list

iv) Deletion of the last node of the linked list

Q. In linked list each node contain minimum of two fields. One field is data field to store the data second field is?