DS(Part2)-After

__________ is a collection of elements used to store the same type of data.

• Array

• Switch

• Loop

• Case

It use pointer to link nodes.

• Variable

• Linked-List

• Pointer

• Trees

• Linked-List

• Circular Linked List

• Doubly Circular Linked List

• Doubly Linked List

In ___________ type of linked lists we can traverse in both the directions.

• Singly Linked List

• Circular Linked List

• 1-D Linked List

• Doubly Linked List

_____________ is a data structure in which every individual node consists of INFO to store data and LINK to store the address of the next node.

• Queue

• Stack

• Singly Linked List

• Circular Queue

It is used to implement an associative array, a structure that can map keys to values.

• Linked List

• Hashing

• Trees

• Array

It is a linear data structure that stores a collection of elements. Operates on first in first out (FIFO) algorithm.

• Stack

• Data Structure

• Queue

• Array

True or false: Data structures are not a crucial part in data management.

• True

• False

push() and pop() functions are found in.......

• Stacks

• Trees

• Queues

• Lists

When linked lists are used as stacks, what kind of behaviour is implemented?

• First-In First-Out, or FIFO

• First-In Last-Out, or FILO

• Last-In Last-Out, or LILO

• Last-In First-Out, or LIFO