What is strong-typing versus weak-typing, Computer Engineering

Assignment Help:

What is strong-typing versus weak-typing? Which is preferred? Why?

Strong type is checking the types of variables as early as possible, usually at compile time. Whereas weak typing is delaying checking the types of the system as late as possible, usually to run-time. Which is preferred depends on what you want. For scripts & quick stuff you'll usually require weak typing, because you require to write as much less (is this correct way to use Ensign?) code as possible. In big programs, strong typing can decrease errors at compile it.

 


Related Discussions:- What is strong-typing versus weak-typing

Test, what persistance shouold i use

what persistance shouold i use

Explain the different fields of an instructions, Explain the significance o...

Explain the significance of different fields of an instruction An instruction is a command given to a computer to perform a particular operation on some given data and the form

Define cpu scheduling, Define CPU scheduling. CPU scheduling is the met...

Define CPU scheduling. CPU scheduling is the method of switching the CPU among various processes. CPU scheduling is the basis of multiprogrammed operating systems. By switching

What is loadrunner, LoadRunner works by making virtual users who take the p...

LoadRunner works by making virtual users who take the place of real users operating client software, such as sending requests using the HTTP protocol to IIS or Apache web servers.

Illustrates about metal fix, Illustrates about Metal Fix. A Metal Fix i...

Illustrates about Metal Fix. A Metal Fix implies that only the upper metal interconnects layers are influenced. Connections may be made or broken, but new cells may not be adde

Benefits of having densely packed integrated circuits, What are benefits of...

What are benefits of having densely packed Integrated Circuits? These are stated below: Reliability: The integrated circuit interconnections are in fact more reliable

Explain complete binary tree, Complete Binary tree A complete binary tr...

Complete Binary tree A complete binary tree can be described as a binary tree whose non leaf nodes have nonempty left and right sub tree and all leaves are at the similar level

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