The advantage of using linked lists over arrays is that . . . . . . . .

Which of the following statements are true? i) practical application of XOR linked lists are in environments with limited space requirements, such as embedded devices. ii)xor lists are not suitable because most garbage collectors will fail to work properly with classes or structures that don’t contain literal pointers iii)in order to calculate the address of the next node you need to remember the address of the previous node iv)xor lists are much efficient than single, doubly linked lists and arrays

A

i, ii, iii, iv

B

i, ii, iii

C

i, ii

D

i

The advantage of using linked lists over arrays is that ________

A

Linked list is an example of linear data structure

B

Insertion and deletion of an element can be done at any position in a linked list

C

Linked list can be used to store a collection of homogenous and heterogeneous data types

D

The size of a linked list is fixed

Simplify : $${{{5 \over 3} \times {7 \over {51}}{\text{ of }}{{17} \over 5} - {1 \over 3}} \over {{2 \over 9} \times {5 \over 7}{\text{ of }}{{28} \over 5} - {2 \over 3}}}$$

A

$$\frac{1}{2}$$

B

4

C

2

D

$$\frac{1}{4}$$

If the elements in two arrays are related by their subscripts, the arrays are called as ________________ arrays.

A

associated

B

coupled

C

matching

D

parallel

If the elements in two arrays are related by their subscripts, the arrays are called as . . . . . . . . arrays.

A

associated

B

coupled

C

matching

D

parallel

Two or more arrays whose elements are related by their position (subscript) in the arrays are called _____ arrays

A

horizontal

B

paired

C

parallel

D

vertical

Merge sort is preferred for arrays over linked lists.

A

true

B

false

Which of the following is/are advantage(s) of Sequence Container arrays over C-like arrays?

A

Sequence Container arrays store its size within itself whereas C-like arrays do not

B

Sequence Container arrays are more efficient

C

Sequence Container arrays have no array decay problem whereas C-like arrays do have

D

All of the mentioned

What is the advantage of using a doubly linked list for chaining over singly linked list?

A

it takes less memory

B

it is easy to implement

C

it makes the process of insertion and deletion faster

D

it causes less collisions

What is the advantage of using linked list over the doubly linked list for chaining?

A

it takes less memory

B

it causes more collisions

C

it makes the process of insertion and deletion faster

D

it causes less collisions

The advantage of using linked lists over arrays is that . . . . . . . .

Related Questions