--%>

Explain One Dimensional array

One Dimensional array:
1) An array is a continuous memory location having similar kind of data in a single row or single column. Declaration in c++ is as under:

const int size = 20;
int a[size] or int a[20].

The elements of array accessed with the assist of an index. For illustration: for(i=0; i<20; i++) cout << a[i];

2) String (Array of characters): Stated in c++ as one dimensional array of characters as char s[80]= “Object oriented programming”;

   Related Questions in Programming Languages

  • Q : Define Class Class : It is a

    Class: It is a programming language concept which permits data and techniques to be grouped altogether. The class concept is basic to the notion of an object-oriented programming language. Methods of a class define the set of permitte

  • 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 : Define the term RGB Color Model Define

    Define the term RGB Color Model: It is a color model based on representing a color as three components: green, red, and blue.

  • Q : State the term Standard Generalized

    State the term Standard Generalized Markup Language?

  • Q : What are the difference between XSLT

    What are the difference between XSLT and XPath?

  • Q : Explain Throw statement Throw statement

    Throw statement: It is a statement employed to throw an exception. For example:     throw new IndexOutOfBoundsException(i+" is too large.");

  • Q : Intermediate language concept Describe

    Describe the term Intermediate language? Illustrate in brief.

  • Q : Define HyperText Markup Language

    HyperText Markup Language: The HyperText Markup Language (abbreviated as HTML) is a simple presentation language employed to markup the content of the Web pages. Its tags appear frequently in pairs to mark sections of text which must be represented in

  • Q : Reading Algorithms Assignment 1:

    Assignment 1: Algorithms Rules: See the Assignment Rules file on the class Moodle site. 1 Reading Algorithms (20 points) Input: A nonempty string of characters S1S2 . . . Sn, and a positive integer n giving the number of characters in the string. Output: See t

  • Q : Define Finite State Machines Finite

    Finite State Machines : A Finite State Machine (FSM) is one of the most suitable models for formal checks, especially for concurrent systems. However, FSMs can have problems with inheritance (the state model can change in derived classes) if state asp