Answer:
Algorithm for the above problem:
- Take a string from the user input.
- store the input string on any variable.
- Reverse the string and store it on the other variable.
- Compare both strings (character by character) using any loop.
- If all the character of the string matched then print that the "Input string is a palindrome".
- Otherwise, print "The inputted string is not a palindrome."
Output:
- If the user inputs "ababa", then it prints that the "Input string is palindrome"
- If the user inputs "ababaff", then it prints that the "Input string is not palindrome"
Explanation:
- The above-defined line is a set of an algorithm to check the number is palindrome or not.
- It is defined in English because the algorithm is a finite set of instructions written in any language used to solve the problem.
- The above algorithm takes input from the user, compare that string with its reverse and print palindrome, if the match is found.
Primary because it is non-volatile storage
Answer:
SONET was the only one on the list created near the 1980s (1985)
Good luck!
<em>~Awwsome</em>
Answer:
6 address lines
Explanation:
The computation of the number of address lines needed is shown below:
Given that
Total memory = 64MB
= 
=
Also we know that in 1MB RAM the number of chips is 6
So, the number of address lines is 
i..e 26 address lines
And, the size of one chip is equivalent to 1 MB i.e. 
For a single 1MB chips of RAM, the number of address lines is
Therefore 6 address lines needed
Answer:
A linear search is one that scans every record/file until it discovers the value being searched for.
Binary search, on the other hand, is also known as <em>Logarithmic search</em>. It is used to locate the position of a value inside an array that has already been sorted.
The linear search will return the lowest value faster than the binary search when small arrays are involved.
This will only be feasible when the array is sorted prior.
Cheers!
