--%>

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 : Define Uniform Resource Locator Uniform

    Uniform Resource Locator: It is a Uniform Resource Locator (abbreviated as URL) expands the concept of file access from a wholly local context to one in which the resources are named uniformly, irrespective of where they may be physically situated. A

  • Q : Difference between collection and arrays

    Write the difference between collection and arrays?

  • Q : Libraries involved in Windows

    Explain the important libraries involved in Windows programming?

  • Q : What is an Instruction set Instruction

    Instruction set: The set of instructions which characterize a specific Central Processing Unit. The programs written in the instruction set of one type of CPU can’t usually be run on any other kind of CPU.

  • Q : Explain Structured programming

    Structured programming: It is a style of programming generally related with languages like FORTRAN, C, Pascal and so forth. Employing structured programming methods, a problem is frequently resolved employing a divide and conquer approach like stepwis

  • Q : When does a name clash take place in

    When does a name clash take place in programming?

  • Q : Explain Primitive Type Abstractions

    Primitive Type Abstractions: An effective way to reduce the state space of a program is to replace the primitive types with the corresponding abstractions that encapsulate all the possible operations that are performed on these types.

    Q : Describe Last in-first out Last in,

    Last in, first out: It is the LIFO semantics of a stack data structure. Items are eliminated in the opposite order to which it arrived in the stack; therefore newer items are always eliminated before older ones.

  • Q : What are good examples of XHTML

    What are the good examples of XHTML elements along with contents?