Sorting, Searching, and Merging - Advanced Topics in Java: Core Concepts in Data Structures - page 27

points for a question are awarded as follows—correct answer: 4 points; wrong answer:
-1 point; no answer: 0 points.
Write a program to process the data and print a report consisting of candidate number and
the total points obtained by the candidate, in ascending order by candidate number . at the
end, print the average number of points gained by the candidates.
8. A is an array sorted in descending order. B is an array sorted in descending order. Merge A and
B into C so that C is in descending order.
9. A is an array sorted in descending order. B is an array sorted in descending order. Merge A and
B into C so that C is in ascending order.
10. A is an array sorted in ascending order. B is an array sorted in descending order. Merge A and
B into C so that C is in ascending order.
11. an array a contains integers that first increase in value and then decrease in value. here's an
example:
it is unknown at which point the numbers start to decrease. Write efficient code to code to
copy the numbers in a to another array B so that B is sorted in ascending order. Your code
must take advantage of the way the numbers are arranged in a.
12. two words are anagrams if one word can be formed by rearranging all the letters of the
other word, for example: section, notices. Write a program to read two words and determine
whether they are anagrams.
Write another program to read a list of words and find all sets of words such that words
within a set are anagrams of each other.