Answer:
Following are the solution to the given choices:
Explanation:
Given:
double currentBalance[91];//defining a double array
In point a:
The name of the array is= currentBalance.
In point b:
91 double values could be saved in the array. It requires 8bytes to hold a double that if the array size is 91*8 = 728
In point c:
Each element's data type is double.
In point d:
The array index range of values is between 0 and 90 (every array index starts from 0 and ends in N-1, here N=91).
In point e:
To access first element use currentBalance[0], for middle currentBalance[91/2] , for last currentBalance[90]
Answer:
Non-repudiation is the assurance that someone cannot deny the validity of something. Non-repudiation is a legal concept that is widely used in information security and refers to a service, which provides proof of the origin of data and the integrity of the data
Explanation:
Answer:
Radius = 14 cm = 0.00014 km
Circumference = 2πr = 2 × 22/7 × 14/100000 = 0.00088 km
As it went thousand times , distance covered = 0.00088 × 1000 = 0.88 km
Answer:
Finding kth element is more efficient in a doubly-linked list when compared to a singly-linked list
Explanation:
Assuming that both lists have firs_t and last_ pointers.
For a singly-linked list ; when locating a kth element, you have iterate through a number of k-1 elements which means that locating an element will be done only in one ( 1 ) direction
For a Doubly-linked list : To locate the Kth element can be done from two ( directions ) i.e. if the Kth element can found either by traversing the number of elements before it or after it . This makes finding the Kth element faster because the shortest route can be taken.
<em>Finding kth element is more efficient in a doubly-linked list when compared to a singly-linked list </em>
