Variation 1<\/strong>: The same rules apply for the number 0 as was for the positive integers.<\/p>\nVariation 2:\u00a0<\/strong>All occurrences of the number 0 will be removed. The resulting array may be shorter.<\/p>\nVariation 3:\u00a0<\/strong>All occurrences of 0 will be pushed to the end of the array<\/p>\n<\/span>Algorithm 4: Sorting facility<\/span><\/h3>\n\n- The company has 2 small warehouses (warehouse A and B) and a larger sorting facility that they operate in. The packages arrive in the smaller warehouses and are then sent over to the sorting facility.<\/li>\n
- All packages are given as integers, which represent the weight in kilograms.<\/li>\n
- All packages are put together when they arrive in the sorting facility. Once there, they are sorted in a way that when they exit, the heaviest packages leave first.<\/li>\n
- Example:\n
\n- Warehouse A: 7, 59, 1, 93, 15, 27, 48, 6<\/li>\n
- Warehouse B: 9, 3, 1, 94<\/li>\n
- Exit order from sorting facility: 94, 93, 59, 48, 27, 15, 9, 7, 6, 3, 1, 1<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n
<\/span>Algorithm 5: Package ratios<\/span><\/h3>\n\n- Read product weights and tracking numbers from a file<\/li>\n
- Find and output the extreme values (the heaviest and lightest package), followed by the list of packages and their ratios to the extremums.\u00a0 The list must include tracking codes alongside ratios.<\/li>\n
- Example:\n
\n- Weights: 6, 7, 2, 10, 4<\/li>\n
- Tracking codes: EE790A1, EE001A1, EE117CA, EE000A2, EE01010<\/li>\n
- Extreme values: minimum 2 kg, maximum 10 kg<\/li>\n
- Package EE790A1 ratios are 3.0 and 0.6
\nPackage EE001A1 ratios are 3.5 and 0.7
\nPackage EE117CA ratios are 1.0 and 0.2
\nEtc.<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<\/span>Algorithm 6: Finding the lowest possible number base<\/span><\/h3>\n\n- User enters 4-character strings from the keyboard<\/li>\n
- Find the lowest possible number base from the selection: base-2, base-16. The ones that don’t match any possible number bases from the list must also be displayed separately.<\/li>\n
- Example: 0110, AZY1, 001F, 0101, 0Y24<\/li>\n<\/ul>\n
<\/span>Algorithm 7: Converting decimal numbers to the desired number system<\/span><\/h3>\n\n- User enters decimal integers from the keyboard until they insert the number 0, which terminates the input.<\/li>\n
- User will enter the desired new number base from the keyboard.<\/li>\n
- All numbers will be converted to the new base and printed alongside the original input.<\/li>\n<\/ul>\n
<\/span>Algorithm 8: Converting binary numbers<\/span><\/h3>\n\n- Binary numbers are read from the file. One number is 4 bytes long.<\/li>\n
- All read numbers will be converted to hexadecimal.<\/li>\n
- The results are printed into a new file. They are printed side-by-side with the binary numbers, one pair per line.<\/li>\n<\/ul>\n
<\/span>Algorithm 9: Date validation<\/span><\/h3>\n\n- 8-digit integers are read from a file. Each of them represents a date.<\/li>\n
- The dates are based on the Gregorian calendar.<\/li>\n
- Validate and output which of the dates exist and which do not.<\/li>\n
- Make sure to check for leap years!<\/li>\n
- Example: 27041998, 29022003, 58042013, 04132013<\/li>\n<\/ul>\n