This Forum has been archived there is no more new posts or threads ... use this link to report any abusive content
==> Report abusive content in this page <==
Post Reply 
 
Thread Rating:
  • 0 Votes - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
java programs to prove to my teacher that i know java well? AP computer science?
05-08-2013, 02:26 AM
Post: #1
java programs to prove to my teacher that i know java well? AP computer science?
Hi, I am a freshman in high school and am extremely good at programming (I think.. i could be full of myself). Anyway i need to show some java programs to my teacher, because that's whats they use in our school for programming. some programs i have created already include a minecraft mod downloader, a music uploader and streamer, a facebook gui, a graphical card game, and a very basic 3d renderer app. I am not sure what my teacher exactly wants, maybe some extremely complicated program like a png file manipulator? Any ideas??

Ads

Find all posts by this user
Quote this message in a reply
05-08-2013, 02:28 AM
Post: #2
 
You are full of yourself, indeed.

What are: stacks, lists, link lists, recursion, tree, queue, scale back a bit, to Java itself, bytecode, native code, enumeration, iterator, template?

If you can produce a fractal generator into PNG I am impressed.

Ads

Find all posts by this user
Quote this message in a reply
05-08-2013, 02:30 AM
Post: #3
 
Learn reflection (java feature) and write a virus Tongue

Honestly, some sort of image filter like Photoshop uses takes a lot of data manipulation, so something that might be acceptable.
Find all posts by this user
Quote this message in a reply
05-08-2013, 02:47 AM
Post: #4
 
I think that you should be a good coder, following Java's coding conventions and producing good object-oriented code where the classes have a good separation of concerns.

It is part of the AP computer science curriculum to understand data-structeds, such as linked-lists, stacks, queues, trees, array, and algorithms such as sorting. You should be able to calculate big-O time order complexity such as O(n), O(log(n)), O(nlog(n)) etc given an algorithm you should be able to calculate the big-O for it.

It would be great if you knew a little about design patterns such as model-view-controller (MVC).

It would be great if you could create Java apps with good GUI using Swing.
Find all posts by this user
Quote this message in a reply
Post Reply 


Forum Jump:


User(s) browsing this thread: 1 Guest(s)