Data Structures and Algorithms

Yes, this is the correct answer.

Data hierarchy proceeds from smallest to largest: a character is the smallest unit, characters form a field (single data item), fields combine to make a record (complete set of related fields), records are stored in files, and files organize into databases. This is the fundamental organization structure in database systems.

This data structure is used to implement stack in a computer.

This sorting algorithm is based on divide-and-conquer method. It divides the list into two subsets.

If Top = MAX-1, then it means that the stack is full of elements or stack overflow.

This property of list structure states that the maximum level attributed to any element is within the list or within any sublist in the list.

This list is used to insert a new node into a queue.

This form of traversing is the one in which the left subtree of a tree is traversed first, then the root node and finally the right subtree are traversed.

This type of linked list is the one where the null pointer in the last node is replaced with the address of the first node.

A stack is a particular kind of abstract data type or collection in which the principal (or only) operations on the collection are the addition of an entity to the collection, known as push and removal of an entity, known as pop. The relation between the push and pop operations is such that the stack is a Last-In-First-Out (LIFO) data structure. It is the best data for checking the balancing of parenthesis.

 Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. It is a sequential technique.

Reusability is the likelihood that a segment of source code can be used again to add new functionalities with slight or no modification

If we declare an array, we have all permissions to initialize the elements to some value. We can initialize any element with any value. So, option 5 is correct.

According to the rules of an array, element number is used for calling each element and all elements share the same name. Therefore, statements (1) and (2) are true. We can also modify each element separately. So, statement (3) is incorrect. Hence, option (4) is correct.

The data type “long double” needs 10 bytes to store an element, and array elements are stored in sequential memory address. If 5^th element address is 2008, then 1^st element will be at address 2008-10-10-10-10 Or 2008 - 40 = 1968. Hence, option (1) is correct.