Why java is called machine independent, Computer Engineering

Assignment Help:

Why Java is called Machine Independent?

While a java program is compiled this is not converted in an executable code. Rather, this is converted in a byte code. Byte code is highly optimized set of instructions designed to be executed through java run time system termed as java Virtual Machine (i.e. JVM). Translating a program in byte code assists make this much easier to run a program on variety of environments. Only JVM requires to be implemented for all platforms. Interpreters for different plat forms can interpret similar byte code.


Related Discussions:- Why java is called machine independent

Mac and llc, how can we improve the way LLC and MAC are used for LAN operat...

how can we improve the way LLC and MAC are used for LAN operation.?

What is a single stage network, In a single stage network: (A) ...

In a single stage network: (A)  There is no redundancy (B)  There is redundancy (C)  Alternative cross points are available (D)  Alt

Interrupt signal interconnection network (isin), Interrupt Signal Interconn...

Interrupt Signal Interconnection Network (ISIN): When a processor wish to transmit an interruption to another processor, then this interrupt initially goes to ISIN, by which it

What is time out mechanism, What is time out mechanism. If one unit is ...

What is time out mechanism. If one unit is faulty the data transfer will not be done. Such an error can be detected using time out mechanism which makes an alarm if the data tr

Define optimistic synchronization, Q. Define Optimistic Synchronization? ...

Q. Define Optimistic Synchronization? Optimistic Synchronization: This method too updates atom by requester process however sole access is granted after atomic operation by abo

Draw the circuit diagram of a Master-Slave J-K flip-flop, Draw the circuit ...

Draw the circuit diagram of a Master-slave J-K flip-flop using NAND gates. What is race around condition? How is it eliminated in a Master-slave J-K flip-flop? Ans. Using NA

Explain non-pre-emptive algorithms, Explain non-pre-emptive algorithms?   ...

Explain non-pre-emptive algorithms?   Non preemptive algorithms: In this algorithm a job is provided to CPU for execution as long as the job is non-completed the CPU cannot

Find blocking probably in 100-line strowger switching system, Calculate the...

Calculate the blocking probably Pb in 100 line strowger switching system where 10 calls are in progress and 11th one arrives, probably that there is a call in a given decade = 1/10

Generates sequence code, The basic project will have each group generate a ...

The basic project will have each group generate a sequence of 1's and 0's using  the Motorola 688HC11 board to turn ON and then turn OFF the TV set installed in ATRC 306. Each tele

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd