Explore topic-wise InterviewSolutions in .

Array is classified as one dimensional, two dimensional and multidimensional arrays.

The data structure is classified as primitive data structures and non-primitive data structures.

The examples for linear data structures are stack, queues and linked lists.

The TREES and GRAPH are non-linear data structures.

Data structure is a systematic way of organising, storing and accessing data.

The sorting is the process of arranging the array elements in ascending or in descending order.

The first element index number in an array is 0.

It is the process of adding a data element into the existing set of data elements.

It is the process of accessing each and every data element only once for some task.

The array elements are referred by subscript or index of an array.

It is the process of combining more than one set of similar data elements into one set of elements.

A queue is a non-primitive data structure where an item is inserted at one end and removed from the other end.

A is an array
N is number of elements (size)
Element is a deleted data element
Pos is the location of the element to be deleted.
Deletion (A, N, Pos)
Step 1: Element = A [Pos]
Step 2: for i = Pos to N-1 repeat step 3
Step 3: A[ i ] = A[i+1]
End for
Step 4: N = N -1

The data structure whose relationship between data elements is by means of links is linked lists.

Step 1: if FIRST = NULL then
Print “Linked list is empty”
Exit
End of if
Step 2: if FIRST → LINK= NULL then
Return FIRST → data
FIRST = NULL
Else
P2 = FIRST
While P2 → LINK not equal to NULL
P1 = P2
P2 =P2 → UNK
End while
STEP 4: Return p2 → data
STEP 5: P1 → LINK = NULL
STEP 6: EXIT.

Step 1: if AVAIL = NULL then
Print ” Availability stack is empty”
Else
NEW_NODE = AVAIL
AVAIL = AVAIL → LINK
Step 2: if FIRST = NULL then
NEW_NODE → INFO = ELEMENT
NEW_NODE → LINK = NULL
FIRST = NEW_NODE
Else
NEW_NODE → INFO = ELEMENT
NEW_NODE → LINK = FIRST
FIRST = NEW_NODE
Step 3: return

A linked list maintains the memory location of each item in the list by using a series of ‘pointers’ within the data structure.

Every node of a singly-linked list contains the following information:

• Data element (user’s data);
• A link to the next element (auxiliary data).

A number of pointers are required, these are:

1. The start pointer’ points to the first node in the list.
2. The last node in the list has a ‘null pointer’ (which is an empty pointer)
3. Each node has a pointer providing the location of the next node in the list.

Linked list is a data structure in which each element is dynamically allocated and in which elements point to each other to define a linear relationship.

A queue is a non-primitive data structure where an item is inserted at one end and removed from the other end.
The queue(), enqueue(item), dequeue(), is Empty() and size() are the operations that can be performed on queues.

A stack is an ordered collection of items in which data item may be inserted and deleted at one end.
The stack(), push(item), pop(), peek(), isEmpty() and size() are the operations that can be performed on stacks.

The various operations performed on arrays are traversing, searching, sorting, insertion, deletion, and merging.

Length of the array = UB - LB + 1
where
UB is the largest index or upper bound index number
LB is the smallest index or lower bound index number.

The types of linked lists are Singly linked list, Doubly linked list and a circular linked list.

Lists are a way to store many different values under a single variable. Every item in this list is numbered with an index.

The data structure queue is called FIFO(First In First Out) which means first inserted data item is removed first.

Array is a collection of similar elements that share a common name. It is a structured data type and allocates memory contiguously.

The data structure stack is called LIFO(Last In First Out) which means the last inserted data item is removed first.

The FIFO list is the other name of the queue.

The data structure which is called LIFO list is stacks.

The data structures that are directly operated upon by machine-level instructions.

The non-primitive data structures derived from primitive data types are more complex.

The two examples for primitive data structures are int and float data.

Row major order method formula
LOC(rowidx, colidx) = BaseAddress + W ( colsize * rowidx + colidx)
Column major order method formula
LOC(rowidx, colidx) = BaseAddress + W (rowidx + rowsize * colidx)

In row-major ordering, every row of the 2-dimensional array is stored one after the other in the memory. In column-major ordering, every column of the two-dimensional array is stored one after the other in the memory.

The variable FRONT is used to identify the position of the first element in the queue, and variable REAR is used to identify the position of the last element of the queue.

The expression is a combination of operators and operators. The different methods are infix, prefix and postfix expressions.

Prefix expression –  +AB
Postfix expression –   AB +

The linear search method doesn’t require the list should be in order.

The disadvantage of the linear search method is time-consuming (slow in searching).

The binary search method requires the list of elements should be in order.

The binary search method is very fast.

The formula to calculate mid element index number in the binary search method is
Mid-element-index = (low + high)/2
Where low is beginning index number and high is the last index number of an array.

It is the number of ancestors of a node excluding itself i.e., the length of the path to its root.

The degree of the tree is the total number of its children i.e the total number nodes that originate from it. The leaf of the tree does not have any child so its degree is zero.

The formula is
Size of the array = UB - LB + 1
Where UB is Upper bound, LB is lower bound

The base address in memory representation of an array is the memory address of the first element of an array.