Data Structures and Algorithms in Java[1].pdf - Fulvio Frisone

Projects
P-3.1
Write a Java program for a matrix class that can add and multiply arbitrary twodimensional
arrays of integers.
P-3.2
Perform the previous project, but use generic types so that the matrices involved
can contain arbitrary number types.
P-3.3
Write a class that maintains the top 10 scores for a game application,
implementing the add and remove methods of Section 3.1.1, but using a
singly linked list instead of an array.
P-3.4
Perform the previous project, but use a doubly linked list. Moreover, your
implementation of remove(i) should make the fewest number of pointer hops
to get to the game entry at index i.
P-3.5
Perform the previous project, but use a linked list that is both circularly linked
and doubly linked.
P-3.6
Write a program for solving summation puzzles by enumerating and testing all
possible configurations. Using your program, solve the three puzzles given in
Section 3.5.3.
P-3.7
Write a program that can perform encryption and decryption using an arbitrary
substitution cipher. In this case, the encryption array is a random shuffling of
the letters in the alphabet. Your program should generate a random encryption
array, its corresponding decryption array, and use these to encode and decode a
message.
P-3.8
Write a program that can perform the Caesar cipher for English messages that
include both upper and lowercase characters.
210