CS46A Introduction to Programming—Online Section

Spring 2014 | Cay S. Horstmann | Department of Computer Science | San Jose State University

Week 9

Videos: Introduction Solutions to Homework 8a | 8b | 8c

Work through Udacity videos Lesson 6.2.

Read Sections 6.4, 6.5, 6.7, 6.8, 6.9 of the textbook.

Take the quizzes on Monday and Thursday.

Turn in the draft of Homework 9 on Wednesday and the final version on Sunday.

Work through Lab 8 and join a Webex session if you have a question and when you are ready show off your work.

Week 8 homework solutions are here.

Homework

BlueJ projects are here.

Part A. Write a program that prints all letters that occur a single time in a string. For example, if the string is Mississippi, print M, and if it is Missouri, print Mour. Draft: Only print whether the first two letters are unique.
code-check for draft | final
Part B. Write a program that prints all nonempty substrings of a string, in decreasing length, starting with the substrings at the front of the string. For example, if the string is "Fred", you print
```
Fred
Fre
red
Fr
re
ed
F
r
e
d    
```
Draft: Just print the strings of length 3.
code-check for draft | final
Part C. Write a program that, given a string, displays the string in hieroglyphs. Simply use the images a.gif ... z.gif in the project and position them next to each other in the order given by the input string. Turn all letters into lowercase and skip anything that's not between a and z. However, for a space, put a blank of 20 pixels.

Draft: Make it work for strings consisting of two lowercase letters.

code-check for draft | final

Note: This isn’t actually how the Egyptian alphabet works. If you care about the details, check out the Wikipedia page. (To see the hieroglyphs in the code chart, run sudo apt-get install ttf-ancient-fonts in Lubuntu.)