--%>

Explain Imperative programming

Imperative programming: The style of programming generally related with languages such as FORTRAN, C, Pascal and so forth. Imperative programming is differentiated from functional programming in that the previous is strongly tied to the idea of variables and memory locations. The variable is related with a memory location and the contents of that memory location might be modified, through the variable, over the course of time. The meaning or consequence of a program fragment at a particular point can only be understood by reference to the current contents of the set of relevant variables, consequently. In contrary, functional programs do not permit the contents of a variable to be modified once set (that is, in simplified terms), therefore making them simpler to reason about. While languages like Java and C++ and are too imperative programming languages, firmly speaking, they are more generally termed to as object-oriented programming languages.

   Related Questions in Programming Languages

  • Q : Features and advantages of UNIX Specify

    Specify the features and advantages of the UNIX?

  • Q : Define the term Mutual recursion Define

    Define the term Mutual recursion: Recursion which outcomes from two methods calling one other recursively.

  • Q : Define Static nested class Static

    Static nested class: It is a nested class with static reserved word in its header. Dissimilar inner classes, objects of static nested classes contain no enclosing object. They are as well termed as nested top-level classes.

  • Q : Define the term Swizzling Define the

    Define the term Swizzling: It is the process of recursively writing the contents of an object through object serialization.

  • Q : Explain the term packing life cycle

    Explain the term packing life cycle.

  • Q : Explain features of XSLT programmer Do

    Do you feel that you are a good Extensible Style Sheet Language Transformations programmer?

  • Q : Explain Java Virtual Machine Java

    Java Virtual Machine (JVM): It is an idealized machine whose instruction set comprises of bytecodes. Java program is compiled to an equal bytecode form and performed on an interpreter that implements the JVM.

  • Q : Type promotion rule Q. Explain type

    Q. Explain type conversion rules for basic data types in java. Ans. Type promotion rule: Java automatically each bits or short operant to int when evaluating an expression. As usual as the automatic promotion

  • Q : Explain Multiple inheritance Multiple

    Multiple inheritance: The capability of a class or interface to expand more than one interface or class. In Java, multiple inheritance is only accessible in the circumstances which are shown below: An interf

  • Q : What is an Infinite recursion Infinite

    Infinite recursion: Recursion which does not finish. This can effect from any of direct recursion, indirect recursion or the mutual recursion. It is generally the outcome of a logical error, and can consequence in stack overflow.