## Monday Morning Video

Remember to really focus on OBJECTS first. I want you to learn some Java programming but you really need to get on the “object think” focus of this course. Most of you are doing well at this but it is a flip in your thinking.

Skip to content
# Author: Ken Bauer

# Mondays – Week 07

## Monday Morning Video

# Mondays – Week 06

## Monday Morning Video

# Mondays – Week 05

## Monday Morning Video

# Partial Exam #1

## Two Questions

# Mondays – Week 04

~~Monday~~ Thursday Morning Video

# WSQ09 – The Movies

## Background

## What to Do

## What to Submit

# WSQ08 – Yo Soy 196

## Background

## What to Do

## Details

## What to Submit

# WSQ07 – Babylonian Method

## Background

## What to Do

## What to Submit

# WSQ06 – Greatest Common Divisor

## Java Programming

## Background

## What to Do

## What to Submit

And of course, leave any questions here as well as asking those questions on Twitter with the hashtag #TC201 so we all see your question posted there.

# Mondays – Week Three

## Topics

## Video

Object-Oriented Programming

Remember to really focus on OBJECTS first. I want you to learn some Java programming but you really need to get on the “object think” focus of this course. Most of you are doing well at this but it is a flip in your thinking.

Reminder that the “expected” point to be at the end of Partial#1 (February 19) is #WSQ08. See the video for more details and what that means.

Reminder that the “expected” point to be at the end of Partial#1 (February 19) is #WSQ08. See the video for more details and what that means.

Yes, just two. But the first one is rather large and the second one is deeper.

Reminder that the “expected” point to be at the end of Partial#1 (February 19) is #WSQ08. See the video for more details and what that means.

In this assignment we should be into more classes to implement the program. You will want to check out the Java Collections Framework since this looks like the Dictionary you probably used in Python. In this case the key will be a string (the movie title) and the value with be a list (or set perhaps) of strings (actor names).

The details of the assignment can be found at the following URL, I should pull some of that description over here (note that the material on the authors’ page is indeed Creative Commons license CC-BY 3.0 as is mine) . *NOTE* that these assignments are based on Python2 syntax in case you want to run this in Python. Of course your solution will be with Java using object-oriented programming.

http://www.cse.msu.edu/~cse231/PracticeOfComputingUsingPython/06_Dictionaries/Movies/

The authors’ page is also a good source for more Python programming assignments http://www.cse.msu.edu/~cse231/PracticeOfComputingUsingPython/

As usual, create a blog post explaining what you did, where you found resources (books, videos, web pages, friends) to help you solve this. Remember to put the tag #WSQ09 on your post so our blog hub picks that up.

You should include your code as a link to GitHub.

And of course, leave any questions here as well as asking those questions on Twitter with the hashtag #TC201 so we all see your question posted there.

Lychrel numbers are natural numbers that do not form a palindrome after successive additions to their inverse. See details on Wikipedia: http://en.wikipedia.org/wiki/Lychrel_number

Your jobs is to create a program that asks the user for two pieces of data:

- The lower bound of the sequence
- The upper bound of the sequence

Then you check the values from the lower bound (inclusive) to the upper bound (inclusive) and make a report of them. During the analysis of each number, if a Lychrel number is found it should be reported immediately with something like “Found a Lychrel number: 196”

Again, think OBJECT-oriented programming in Java!

The report must show:

- The range of numbers analysed (lower to upper bound)
- The number of natural palindromes (no addition to inverse needed)
- The number of non-Lycherels encountered (become palindromes)
- The number of Lycherel number candidates (that did not converge to palindrome)

Since you will not be able to prove that a number is Lycherel (since you cannot computer forever to check), our definition for a Lycherel candidate will be if a number does not converge after 30 iterations of applying the addition to the inverse.

As usual, create a blog post explaining what you did, where you found resources (books, videos, web pages, friends) to help you solve this. Remember to put the tag #WSQ08 on your post so our blog hub picks that up.

You should include your code as a link to GitHub. You really should start using your GitHub repository now. If you need help on that, just ask Ken or your classmates.

And of course, leave any questions here as well as asking those questions on Twitter with the hashtag #TC201 so we all see your question posted there.

In this assignment you will write a program to calculate the square root of a number using the Babylonian method. You can search for that method, it will be easy to find.

Again, this is Java and object-oriented programming. Don’t lean on your imperative roots but think objects and messages here.

As usual, create a blog post explaining what you did, where you found resources (books, videos, web pages, friends) to help you solve this. Remember to put the tag #WSQ07 on your post so our blog hub picks that up.

You should include your code as a link to GitHub.

And of course, leave any questions here as well as asking those questions on Twitter with the hashtag #TC201 so we all see your question posted there.

Okay, a simple one to start and many of you already did this in Python. The trick here should be to implement this with message calls, not a simple iterative solution. You should be asking the number, “hey, what is the greatest common divisor you have in common with this one I am passing you as a parameter?”

In this assignment you will write a program to calculate the greatest common denominator of two positive integers using Euclid’s algorithm.

Okay, a simple one to start and many of you already did this in Python, now to do this in Java with objects. The trick here should be to implement this with message calls, not a simple iterative solution. You should be asking the number, “hey, what is the greatest common divisor you have in common with this one I am passing you as a parameter?”

As usual, create a blog post explaining what you did, where you found resources (books, videos, web pages, friends) to help you solve this. Remember to put the tag #WSQ06 on your post so our blog hub picks that up.

You should include your code as a link to GitHub.

Our topics of the week are abstraction and encapsulation.

This weeks video from Ken: