Computer Applications Concept Notes for Class 10: Chapter 09 Arrays
Access comprehensive revision notes for Chapter 09 Arrays using the ICSE Class 10 Computer Applications Chapter 09 Arrays Notes and Important Questions with Answers. Designed to align with the 2026-27 academic syllabus for Class 10 Computer Applications, these concept summaries help students streamline their exam preparation and review complex topics efficiently.
Download Chapter 09 Arrays Revision Notes PDF
Navigate directly to the revision notes for Chapter 09 Arrays using the digital viewer below. Each summary is structured to highlight high-weightage sections, allowing students to instantly access critical definitions and focus on core exam topics.
These ICSE Class 10 Computer Applications notes on Arrays cover key terms with 39 solved questions. They explain one-dimensional arrays, subscripts, memory size, string methods, bubble sort and selection sort, and linear and binary search, with complete Java programs.
Important Terms and Definitions
1. An array is a collection of same data type variables which are referenced by a common name.
2. An array is an object.
3. The declaration does not create the object. It only creates a reference.
4. The declaration of an array specifies its data type, name and size.
5. An array may be one, two or multidimensional.
6. The first element of an array is assumed to have zero index.
7. One dimensional single subscripted variables A[0], A[1], A[2] ... A[10] can represent 11 elements in 11 storage locations.
8. int A[I], for I = 0, 1, 2, ... 10, stands for a single subscripted variable, where I is the subscript. It represents a one dimensional array.
9. Array represents a number of related data of similar type, arranged in a sequence.
10. In A[N], N is the single subscript.
11. In an array, ranks of elements are given by natural numbers 1, 2, 3 ... But their index subscripts are whole numbers 0, 1, 2 ......
12. After creating an array, its size cannot be altered.
13. An array can be initialized, providing list of values of the elements, at the time of declaration.
14. A character array is an array object, whose elements, are of character type.
15. A string object is an instance of the String class.
16. In order to retrieve any particular array element with a specific rank, array name along with the subscript of the element are to be given.
17. An array may be created with a size larger than the number of values stored initially. The elements not assigned any value hold the default value of the data type.
18. Sorting is arranging number data in ascending or descending order.
19. When an array of integers is created, it is automatically filled with default initial values 0.
20. The character data are sorted in alphabetic order.
21. Among the various sorting technique, selection sort and bubble sort are popular.
22. In selection sort, successive rounds are executed to select the element which is smallest for ascending order and largest for descending order. The selected element is placed in their sorted position, in a sequence.
23. In bubble sort, the array is scanned sequentially, a number of times. In each iteration, every consecutive pairs of element are compared and interchanged, as long as permissible, to bring them to form a sequence in ascending or descending order.
24. Searching is a process to ascertain whether a particular element is present in an array or not.
25. Linear search and Binary search are two common searching techniques.
26. In linear search, the given element is compared one by one with each element of the given array until either the element is located or the end of the array is reached.
27. Binary search method may be adopted only in a sorted array.
28. In binary search, the array is repeatedly divided into halves and the search is undertaken in one half which is likely to contain the item searched for. The searched item will be equal to or less than or greater than the middle most element of the array or its half and so on.
29. The binary search technique is much faster than linear search, as half of the array is eliminated after every round of the search.
30. In one dimensional array, number of bytes required to store the element in the memory = size of the type of data * size of the array.
For example, int N[] = new int[5]; will require 4 × 5 = 20 bytes of storing place, as each of the int data type requires 4 bytes (32 bits) and N contains 5 elements.
31. An array is a static data structure, as the number of elements that it can contain is fixed at the time of its creation.
32. A runtime error is caused when an attempt is made to access array elements beyond the bounds.
33. int Marks[10] = {92, 27, 45, ..., 67}; is illegal, because the size cannot be given in the declaration.
34. int Day[ ] = {31, 28, 31, ..., 31}; is legal.
This is called direct initialization in which declaration and initialization are combined in a form.
35. System.arraycopy ( ) of the System class, allows to copy one existing array on another.
36. Both int arr[ ] and int[ ] arr are valid declarations.
Questions with Answers
Question 1. How to identify some array as to be one dimensional?
Answer:
When array elements are specified by one subscript e.g. int arr[ ] = new int[15];
Answer:
byte B[ ][ ] = new byte[6][5];
Two subscripts are used.
Question 3. What is the use of the subscript in an array?
Answer:
A subscript indicates the position of an element in an array. The individual array elements of the array are referred by the subscript.
Question 4. Which element is array[5]?
Answer:
6th element.
Question 5. What are legal subscripts of an array containing n elements?
Answer:
0 to n - 1.
Question 6. What is the size in the memory required to store 15 elements of A[14] containing
(i) short integer type data?
(ii) long type data?
(iii) character type data?
Answer:
(i) 2 bytes × 15 = 30 bytes
(ii) 8 bytes × 15 = 120 bytes
(iii) 2 bytes × 15 = 30 bytes
char grade[ ] = new char[9];
Answer:
grade[0], grade[1], ... grade[8]
double p[ ]; p = new double[10];be combined into a single statement?
Answer:
double p[ ] = new double[10];
Question 9. If double age[ ] = {17, 15, 18, 16, 17}, then write the value of (i) age[0] (ii) age[2].
Answer:
(i) 17.0
(ii) 18.0
Question 10. If String vowels[ ] = {"A", "E", "I", "O", "U"}, then
(i) How many elements are there in the array?
(ii) What is the value of vowels[2]?
(iii) What is the variable name of "O"?
Answer:
(i) 5
(ii) "I"
(iii) vowels[3]
double arr[ ] = new double[21];
for (int i = 0; i <= 20; i++)
{
arr[i] = Math.pow (i, 3);
}Write the values of (i) arr[0] (ii) arr[2], (iii) arr[9].Answer:
(i) 0.0
(ii) 8.0
(iii) 729.0
Question 12. When an attempt was made to find A[x] in int A[ ] = {2, 5, 8, 11, 16}, an error message java.lang.ArrayIndexOutOfBoundsException: x etc. was given. What is the maximum value of int x for which there is no error?
Answer:
The array has 5 elements, so the legal subscripts are 0 to 4. The maximum value of x without error is 4; the error message appears when x is 5 or more (or negative).
Question 13. How is a particular array element accessed?
Answer:
By using an index number as subscript.
Question 14. How many characters are there in the string "Brave Hearts"?
Answer:
12 (11 letters and 1 blank space).
Question 15. Write two objectives of using arrays.
Answer:
(i) A number of elements are declared in a short form using subscript.
(ii) The data elements are stored in the memory in successive index positions.
Question 16. What is an array?
Answer:
An array is an object that stores a fixed number of values of the same data type under a common name.
String S = ["A", "E", "I", "O", "U"];
Answer:
String S[ ] = {"A", "E", "I", "O", "U"};
Answer:
String str[ ] = new String[10];
Each element holds null until a string is stored in it.
Question 19. What is the use of arraycopy ( ) method?
Answer:
To copy one array into another.
Answer:
boolean val[ ] = {true, false, true, false, true, false};
Question 21. If array[ ] = {1, 9, 8, 5, 2};
(i) What is array.length?
(ii) What is array[2]?
Answer:
(i) 5
(ii) 8
Question 22. Differentiate between toLowerCase ( ) and toUpperCase ( ) methods.
Answer:
toLowerCase ( ) converts all characters of a string to lower case letters.
toUpperCase ( ) converts all characters of a string to upper case letters.
Question 23. If String X = "Computer"; String Y = "Applications"; what do the following functions return?
(a) System.out.println (X.substring (1, 5));
(b) System.out.println (X.indexOf (X.charAt (4)));
(c) System.out.println (Y + X.substring (5));
(d) System.out.println (X.equals (Y));
Answer:
(a) ompu
(b) 4
(c) Applicationster
(d) false
Question 24. What do the following functions return for: String x = "hello"; String y = "World";
(a) System.out.println (x + y);
(b) System.out.println (x.length ( ));
(c) System.out.println (x.charAt (3));
(d) System.out.println (x.equals (y));
Answer:
(a) helloWorld
(b) 5
(c) l
(d) false
(a)
System.out.println ("four" + 4 + 2);
System.out.println ("four" + (2 + 2));(b)String S1 = "Hi"; String S2 = "Hi"; String S3 = "there"; String S4 = "Hi"; System.out.println (S1 + " equals " + S2 + " -> " + S1.equals (S2)); System.out.println (S1 + " equals " + S3 + " -> " + S1.equals (S3)); System.out.println (S1 + " equals " + S4 + " -> " + S1.equals (S4)); System.out.println (S1 + " equalsIgnoreCase " + S4 + " -> " + S1.equalsIgnoreCase (S4));
Answer:
(a) four42
four4
(b) Hi equals Hi -> true
Hi equals there -> false
Hi equals Hi -> true
Hi equalsIgnoreCase Hi -> true
S4 also holds "Hi", so S1.equals (S4) is true.
Question 26. Which element is num[9] of the array num?
Answer:
10th
String S = new String ("xyz");
System.out.println (S.toUpperCase ( ));Answer:
XYZ
Question 28. Write a Java statement to input the following from the user using the keyboard:
(a) Character
(b) String
Answer:
(a) char ch = (char) br.read ( );
(b) String str = br.readLine ( );
// br is a BufferedReader class object
Question 29. Write a statement for each of the following:
(a) Store a number 275 as a string.
(b) Convert the string to a numeric value.
(c) Add it to the existing total of 1000 to update the total.
Answer:
(a) String str = "275";
(b) int i = Integer.parseInt (str);
(c) total = 1000 + i;
int n[ ] = (1, 3, 5, 7, 9);
for (int i = 0; i < 5; i++)
System.out.println ("n [" + i + "] =" + n (i));Answer:
int n[ ] = {1, 3, 5, 7, 9};
for (int i = 0; i < 5; i++)
System.out.println ("n[" + i + "] =" + n[i]);The values of an array are enclosed in curly brackets { }, and an element is accessed with square brackets [ ], not round brackets.
Question 31. Differentiate between Binary search and Linear search.
Answer:
In linear search, every element of the array is compared with the search item, one by one successively till the searched item is found or the end of the array is reached. Linear search may be conducted in a sorted or unsorted array.
In binary search, the array must be sorted. The middle most element is compared with the search element. The search is conducted in one half array. The search field is segmented to halves in every subsequent attempt. The process is continued till either search item is found or there is no element left. The binary search is faster than linear search.
| Name | Marks |
|---|---|
| ... | ... |
| ... | ... |
| ... | ... |
(a) The average marks (Average marks = \( \frac{\text{Total marks}}{100} \))
(b) The highest marks in the subject and the name of the student.
Answer:
import java.io.*;
class students {
public void analysis ( ) throws IOException
{
int marks[ ] = new int[100];
String names[ ] = new String[100];
BufferedReader br = new BufferedReader (new InputStreamReader (System.in));
for (int i = 0; i < 100; i++)
{
System.out.println ("Enter name of student");
names[i] = br.readLine ( );
System.out.println ("Enter his marks");
marks[i] = Integer.parseInt (br.readLine ( ));
}
double avg;
int high = marks[0], pos = 0, sum = 0;
for (int i = 0; i < 100; i++)
{
sum += marks[i];
if (marks[i] > high)
{
high = marks[i];
pos = i;
}
}
avg = sum / 100.0;
System.out.println ("Average marks of the class = " + avg);
System.out.println ("Highest marks = " + high);
System.out.println ("Student who got highest = " + names[pos]);
}
}
Answer:
class bubbleSort {
public void bubble ( )
{
int arr[ ] = {5, 3, 8, 4, 9, 2, 1, 12, 98, 16};
for (int i = 0; i < arr.length - 1; i++)
{
for (int j = 0; j < arr.length - 1 - i; j++)
{
if (arr[j] > arr[j + 1])
{
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
for (int i = 0; i < arr.length; i++)
System.out.println (arr[i]);
}
}Output: 1 2 3 4 5 8 9 12 16 98 (one value on each line).
Answer:
import java.io.*;
class numbers {
public void selectionSort ( ) throws IOException
{
BufferedReader br = new BufferedReader (new InputStreamReader (System.in));
int values[ ] = new int[25];
int pos, temp, min;
for (int i = 0; i < 25; i++)
{
System.out.println ("Enter a value");
values[i] = Integer.parseInt (br.readLine ( ));
}
for (int i = 0; i < 24; i++)
{
min = values[i];
pos = i;
for (int j = i + 1; j < 25; j++)
{
if (values[j] < min)
{
min = values[j];
pos = j;
}
}
temp = values[pos];
values[pos] = values[i];
values[i] = temp;
}
System.out.println ("List in ascending order");
for (int i = 0; i < 25; i++)
System.out.println (values[i]);
}
}
For example, if S = "India is my country" then the output should be 7.
Answer:
class longestWord {
public void find (String sentence)
{
sentence = sentence + " ";
int l = sentence.length ( );
String word = "";
int max = 0;
for (int i = 0; i < l; i++)
{
char x = sentence.charAt (i);
if (x != ' ')
word = word + x;
else
{
if (word.length ( ) > max)
max = word.length ( );
word = "";
}
}
System.out.println ("The length of the longest word in the sentence is " + max);
}
}
Example:
INPUT: Enter sentence: the quick brown fox jumps over the lazy dog. Enter search word: the OUTPUT: Searched word occurs : 2 times
Answer:
class WordSearch {
public void search (String sentence, String searchWord)
{
sentence = sentence + " ";
int len = sentence.length ( );
String word = "";
int counter = 0;
char ch;
for (int i = 0; i < len; i++)
{
ch = sentence.charAt (i);
if (ch != ' ')
word = word + ch;
else
{
if (word.equals (searchWord))
counter++;
word = "";
}
}
if (counter > 0)
System.out.println ("Searched word occurs : " + counter + " times");
else
System.out.println ("word not present");
}
}
INPUT: Delhi, Bangalore, Agra, Mumbai, Kolkata
OUTPUT: Agra, Bangalore, Delhi, Kolkata, Mumbai
Answer:
class sorting {
public void sortCities ( )
{
String city[ ] = {"Delhi", "Bangalore", "Agra", "Mumbai", "Kolkata"};
int len = city.length;
String temp;
for (int i = 0; i < len - 1; i++)
{
for (int j = 0; j < len - 1 - i; j++)
{
if (city[j].compareTo (city[j + 1]) > 0)
{
temp = city[j];
city[j] = city[j + 1];
city[j + 1] = temp;
}
}
}
System.out.println ("Names in alphabetical order are");
for (int i = 0; i < len; i++)
System.out.println (city[i]);
}
}
Answer:
class searchName {
public void check (String name)
{
String names[ ] = {"Ankur", "Chitra", "Manab", "Ranjit", "Sovan"};
long phoneNos[ ] = {43457410L, 44039181L, 46825311L, 47411941L, 46854341L};
boolean flag = false;
for (int i = 0; i < names.length; i++)
{
if (names[i].compareTo (name) == 0)
{
System.out.println ("Search successful");
System.out.println (names[i] + " " + phoneNos[i]);
flag = true;
break;
}
}
if (flag == false)
System.out.println ("Search unsuccessful, Name not enlisted");
}
}
Answer:
An array is a group or collection of values of a similar data type.
int a[ ] = new int[10];
Free study material for Computer Application
Download ICSE Revision Notes: Class 10 Computer Applications Chapter 09 Arrays
Download Chapter Summary: Class 10 Computer Applications Chapter 09 Arrays
Review targeted chapter notes for Class 10 Computer Applications Chapter 09 Arrays. Built according to official ICSE guidelines, these summaries highlight high-yield topics frequently tested in school evaluations.
Concept Clarification for Chapter 09 Arrays
Cross-reference your comprehension with comprehensive NCERT solutions for Class 10 to ensure absolute clarity across all sub-topics in this chapter.
Additional Study Resources for Class 10 Computer Applications
Follow up your revision by attempting the interactive online Computer Applications MCQ test and practice worksheets for this chapter to verify your mastery. All platform resources are free to access.
FAQs
You can download the teacher prepared revision notes for ICSE Class 10 Computer Applications Chapter 09 Arrays Notes and Important Questions with Answers from StudiesToday.com. These notes are designed as per 2026-27 academic session to help Class 10 students get the best study material for Computer Applications.
Yes, our ICSE Class 10 Computer Applications Chapter 09 Arrays Notes and Important Questions with Answers include 50% competency-based questions with focus on core logic, keyword definitions, and the practical application of Computer Applications principles which is important for getting more marks in 2027 ICSE exams.
Yes, our ICSE Class 10 Computer Applications Chapter 09 Arrays Notes and Important Questions with Answers provide a detailed, topic wise breakdown of the chapter. Fundamental definitions, complex numerical formulas and all topics of ICSE syllabus in Class 10 is covered.
These notes for Computer Applications are organized into bullet points and easy-to-read charts. By using ICSE Class 10 Computer Applications Chapter 09 Arrays Notes and Important Questions with Answers, Class 10 students fast revise formulas, key definitions before the exams.
No, all study resources on StudiesToday, including ICSE Class 10 Computer Applications Chapter 09 Arrays Notes and Important Questions with Answers, are available for immediate free download. Class 10 Computer Applications study material is available in PDF and can be downloaded on mobile.