Rupa Pandit solutions for कम्प्युटर एपलीकेशंस [इंग्रजी] इयत्ता १० आयसीएसई chapter 7B - Arrays - Sort & Search [Latest edition]

A pre-sorted array is necessary for:

Which statement is false?

Which statement is true?

Binary search looks for the element to search in position:

Write an algorithm for the binary search method. Explain algorithm with a suitable example.

write difference between Linear Search and Binary Search.

Define the procedure of bubble sort with an example.

What is linear search?

The following code may contain some errors. Identify the errors, modify the program by underlining the changes made, and write the aim of the program.

import java.io.*;
import java.util.Scanner; 
class clPaperA
{
    void fnLinkA()
    {
        Scanner sc = new Scanner(System.in);
        System.out.print(" Enter the number of elements :");
        int n = sc.nextInt();
        int LA[ ] = new int [n];        
        for(start = 0; start < n; start++)
        {
            max = LA[start];
            position = start;
            for(range = start + 1; range < n; range++)
            {
                if(max > LA[range])
                {
                    max = LA[range];
                    position = range;
               {
            }
        }            
        tmp = LA[start]; //swapping
        LA[start] = LA[position];
        LA[position] = tmp;
        System.out.println(" The elements in Ascending Order ...");
        for(r = 0; r < n; r++)
        {
            System.out.print(LA[r] + " ");
        }
    }
}

The following code may contain some errors. Identify the errors, modify the program by underlining the changes made, and write the aim of the program.

import java.io.*;
class clPaperB
{
    int TY[];
    clPaperB(int n)
    {
       TY = new int [n];
    {
    void fnInputB()
    {
      Scanner sc = new Scanner(System.in);
      int s = TY.length;
      for(int j = 0; j <= s − 1; j++)
      {
          System.out.print("Enter value for cell num " + j +" : ");
          TY[j] = sc.nextInt();
      }
    }
    void fnWorkB()
    {
      for(int p = 0; p<=s; p++)
      {
       for(int q = 0; q<=sp; p++)
       {
           if(TY[q+1]> TY[q])
           {
              tmp = TY[p];
              TY[p] = TY[p +1];
              TY[p + 1] = tmp;
            }
        }
      }
    }
    void fnShow()
    {
       System.out.println(" The elements in Descending Order ...")
       for(int j = 0; j<=s - 1; j++)
       System.out.print(" TY[j] ");
    }
}

The following code may contain some errors. Identify the errors, modify the program by underlining the changes made, and write the aim of the program.

int RA[ ] = {42, 51, 75, 95, 86, 84, 62};
boolean fnLinearSearch(int val)
{
    for(int p = RA.length;p >=0; p--)
    {
        if(RA[p] = val)
        {
           break;
        }
    }
    if(p >= 0)
    return true;
    return false;
}

The following code may contain some errors. Identify the errors, modify the program by underlining the changes made, and write the aim of the program.

int SA[ ] = {79, 58, 42, 61, 79, 66, 34, 62, 94, 73};
int n = SA.length;
void fnBinarySearch(int val)
{
    while(min <= max)
    {
       mid = low + high/2;
       System.out.print("\n Element at mid " + mid + "“ IS " + SA[mid]);
       if(SA[mid]=val)
       {
          found = true;
          break;
       }
       else if(SA [mid] < val)
       {       
          high = mid -1;
       }
       else 
       {
          low = mid + 1;
       }
    }
    if(found=true)
       System.out.print("\n Element" + val + “ IS Present.");
    else
       System.out.print("\n Element " + val + " IS NOT Present.");
} //closing binary search

Write a program for the following.

Create a string array ST[ ] to assign the following color names. Arrange the names in ascending order using Bubble Sort -Violet, Indigo, Blue, Green, Yellow, Orange, Red.

[Hint: (StringArray[p].compareTo(StringArray[p + 1]) > 0)indicates a swap is needed]

Write a program for the following.

Create a String array SB[ ] to assign the following subject names. Arrange the names in descending order using Selection Sort:

Hindi, English, Mathematics, History, Civics, Geography, Science, Music, Art, Fitness.

Write a program for the following.

Create a String array SP[ ] of size 10. Input names of Indian Heritage Sites. Arrange the names in ascending order of their string-length.

Write a program for the following.

Create a String array WR[ ] and an integer array WL[], both of size 10. Input/Store names of World Rivers. Arrange the River Names in ascending order of their lengths.

Write a program for the following.

Create a String array FC[ ] and a numeric array FP[ ] of size 10, to store the names of 10 Food Crops and their annual production in corresponding cells. Sort the arrays in ascending order of their annual production. [Apply Selection Sort].[Suggestion : Take data from Geography Textbook].