I might have made this sound more complicated than it actually is.
The user inputs a row and column number as the Knight's position, and the program needs to print all the possible landing coordinates (8 being the highest possible outcome, according to the exercise) for the Knight when performing a single move, which in the Knight's case is moving two squares horizontally and one square vertically, or the other way around.
After printing, the program ends.
For example, if the user inputs 5(r), 7(c)
The program should print
3 8
3 6
4 5
6 5
7 6
7 8
and does nothing more
I'm sure when I actually sit down to write it, it won't be as easy as I'm imagining, but the toughest part I can think of right now is not going outside the boundaries of the array when checking for possible outcomes
As for how far I'm in OOP, I'm mostly using this video tutorial for now from
caveofprogramming and I've reached 'String Builder and String Formatting', but since this is only the second exercise I'm pretty sure it should be doable, unless I'm oversimplifying this in my mind
The description for the course (It was written in Hebrew but Google Translate did a pretty good job with a few corrections):
Topics of the course
Part a
- Introduction and basics of Java language
- Object Oriented Programming: Using given classes and writing classes
- Flow control (conditional sentences and loops)
- Arrays
Part II
- OOP expansion - inheritance, variables and static methods, overloading, packages, polymorphism and interfaces
- Complexity of algorithms, algorithms for sorting and searching
- Recursion
- Linked lists
- Stacks and queues, trees and binary trees
- Computability in a nutshell
The course is roughly 3 months long and this seems pretty extensive, so I've decided to start early