Data Structures_Topic 2_Formative 1

A node in Linked List consists of .....................

• Data and Pointer

• Data and Index

• Pointer and Index

• Node and pointer

Which of the following statement is NOT characteristic of Linked List?

• Elements can be stored anywhere in the

  memory.

• There is no size and the data is unlimited.

• Dynamic data structure.

• Elements are stored in

  contiguous memory location.

Define characteristic of Linked List.

• Static of memory allocation .

• Insertion and deletion are faster.

• Searching and access are faster.

• Less memory occupied.

Which of the following is NOT type of Linked List.

• Single Linked List.

• Single Double Circular Linked List.

• Double Linked List.

• Circular Double Linked List.

Traversed only in one direction because each node contains

only next pointer.

• Single

  linked list.

• Double

  linked list.

• Circular

  linked list.

• Circular

  double

  linked list.

A node contains a pointer to the previous as well as the

next node in the sequence.

• Single

  linked list.

• Double

  linked list.

• Circular

  linked list.

• Circular

  double

  linked list.

All nodes are linked to form a circle .

• Single

  linked list.

• Double

  linked list.

• Circular

  linked list.

• Circular

  double

  linked list.

All nodes are linked to form a two (2) circles .

• Single

  linked list.

• Double

  linked list.

• Circular

  linked list.

• Circular

  double

  linked list.

Figure refers to ......................................

• Single

  linked list.

• Double

  linked list.

• Circular

  linked list.

• Circular

  double

  linked list.

Figure refers to ...........................................

• Single

  linked list.

• Double

  linked list.

• Circular

  linked list.

• Circular

  double

  linked list.