Answer by rowlfe
The lowest level is machine language, where you literally store ones and zeros in memory and execute the program one step at a time with NO interpretation of any kind. From there you add levels of interpretation. Assembly language is one step up from machine language, where you use mnemonics that are key words for binary machine language so you do not have to remember the individual binary op codes. The “assembler” converts the mnemonics into binary which is then stored and executed. Then you get into high level languages, where you use a set of keywords which represent groups of actions. No longer is there a direct relationship to machine language, but a keyword represents a whole group of lower level routines. It makes it much easier for the programmer to use a keyword then to use assembler. There are a LOT of high level languages out there. Each works in one or two ways, by interpreting the keywords as they are stored, or by compiling the high level into low level and storing the low level. Interpreted languages are slow relative to compiled. The problem with a high level language is “program bloat”. The high level routines are made up of a number of lower level routines, which not all are used efficiently. The most efficient is machine language, with the next most being assembler since that compiles to machine language.

Give your answer to this question below!

Answer by Walter M
Obviously nobody knows, you can look at charts such as these ones: http://langpop.com/ but in reality its not like its on the census form your country makes you do every 5 or so years. If I had do guess it would be Java, or ActionScript.

Know better? Leave your own answer in the comments!

Best answer:

Answer by Duh!
Yes, Python and Java are both useful skills to have. Even though used less frequently, it can help you quickly script stuff where others are still struggling. Also learn C/C++ of course.

Know better? Leave your own answer in the comments!

Best answer:

Answer by Bill
In Object orientated the risk of running out of Variable names is smaller, as well as the risk of using the same one twice without realizing it.

Add your own answer in the comments!

Got any suggestions?

And Two:
is Object Oriented still the latest thing? Is there anything later or better?
change the above to read:
I want to know how to parse a problem into a program.
Thanks for the ‘good luck, but that answer will not make it.

Best answer:

Answer by Steven
good luck man.

Know better? Leave your own answer in the comments!

I would like to become a programmer. What would be the most useful thing to learn right now? I would be teaching myself on the weekends. I’ve heard Ruby is very popular right now, but Java seems to have the most resources out there. Any tips?

Best answer:

Answer by Bona
If you already know HTML, maybe JavaScript, Php and the basics Sql.
With that, you can make whatever you want on the web.

Give your answer to this question below!

3 high-level programming languages?
3 structured programming languages?
3 procedural programming languages?

Best answer:

Answer by Daniel
Which ones do you know already?

Add your own answer in the comments!

Best answer:

Answer by melted cheese
You can also learn math, statistics, biology, chemistry, politics, and business at home.

What do you think? Answer below!

Best answer:

Answer by Brandon W
I would use Dreamweaver with PHP code.

Know better? Leave your own answer in the comments!

Best answer:

Answer by Syed Mujahid Hussain
Bulk file access is a read access to a large number of files in a file system. Example applications that use bulk file access extensively are anti-virus (AV) scanner, file-level data back-up agent, file system de-fragmentation tool, etc. This paper describes the design, implementation, and evaluation of an optimization to modern file systems that is designed to improve the read efficiency of bulk file accesses. The resulting scheme, called DAFT (Disk
geometry-Aware File system Traversal), provides a bulk file access application with individual files while fetching these files into memory in a way that respects the disk geometry and thus is as efficient as it can be. We have successfully implemented a fully operational DAFT prototype, and tested it with commercial AV scanners and data back-up agents. Empirical measurements on this prototype demonstrate that it can reduce the elapsed time of enumerating all files in a file system by a factor of 5 to 15 for both fragmented and non-fragmented file systems on fast and slow disks.

What do you think? Answer below!