Data Structures

Question 1

Arrays

Answer 1

A data structure consisting of a collection of elements (values or variables), each identified by at least one array index or key.

Question 2

Stacks

Answer 2

A linear data structure which follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out).

Question 3

Queues

Answer 3

A linear structure which follows a particular order in which the operations are performed. The order is First In First Out (FIFO).

Question 4

Linked Lists

Answer 4

A linear collection of data elements whose order is not given by their physical placement in memory. Instead, each element points to the next. It is a data structure consisting of a collection of nodes which together represent a sequence.

Question 5

Trees

Answer 5

A nonlinear data structure. A tree can be empty with no nodes or a tree is a structure consisting of one node called the root and zero or one or more subtrees.

Question 6

Graphs

Answer 6

A set of nodes that are connected to each other in the form of a network. Nodes are also called vertices. A pair(x,y) is called an edge, which indicates that vertex x is connected to vertex y.

Question 7

Tries

Answer 7

A special data structure used to store strings that can be visualized like a graph. It consists of nodes and edges. Each node consists of at max 26 children and edges connect each parent node to its children. These 26 pointers are nothing but pointers for each of the 26 letters of the English alphabet A separate edge is maintained for every edge.

Question 8

Hash Tables

Answer 8

A data structure which stores data in an associative manner. In a hash table, data is stored in an array format, where each data value has its own unique index value.