Page 323 - computer science (868) class 11
P. 323

MIND DRILL





                      Solved Questions



                 A.  Tick ( ) the correct answer:
                    1.  To deal with multiple data together, we use the concept of ………………… .
                       a.  Loops                                       b.  Arrays
                       c.  Strings                                     d.  None of these
                    2.  When two or more elements, arranged row-wise, contain separate subscript values indicating the position of each element, then
                       it is known as ………………… .
                       a.  Single-dimensional Array                    b.  Double-dimensional array
                       c.  String                                      d.  None of these
                    3.  Which of the following is an example of a static declaration of an array?
                       a.  int ar={2,3,4,5,6};                         b.  String ar[ ] = {"India", KOlkata", New Delhi");
                       c.  char ch={'a','2',':', '4'};                 d.  All of the above
                    4.  What do you need while inputting data in an array from the user?
                       a.  InputStreamReader                           b.  Scanner class
                       c.  Both a and b                                d.  None of these
                    5.  Which of the following properties is used to find the length of an array?
                       a.  len                                         b.  length
                       c.  length()                                    d.  None of these
                    6.  "It is used to determine whether an element is present in the array or not." What is the given statement referring to?
                       a.  Merging                                     b.  Insertion
                       c.  Searching                                   d.  None of these
                    7.  Which type of searching technique requires the sorted data?
                       a.  Binary search                               b.  Linear search
                       c.  Both a and b                                d.  None of these
                    8.  Which of the following is the fastest searching technique?
                       a.  Bubble sort                                 b.  Selection sort
                       c.  Insertion sort                              d.  None of these
                    9.  In which sorting technique, the smallest element is searched and interchanged with the first element?
                       a.  Bubble sort                                 b.  Selection sort
                       c.  Insertion sort                              d.  None of these
                   10.  Which of the following arrays contains a combination of rows and columns?
                       a.  Single dimensional array                    b.  Double dimensional array
                       c.  Both a and b                                d.  None of these


                  Answers
                    1.  b      2.  a     3.  d     4.  c    5.  b     6.  c     7.  a     8.  c     9.  b     10.  b


                 B.  Fill in the blanks:
                    1.  ………………… technique compares the element with the next element and swaps if the given condition matches.
                    2.  ………………… contains multiple rows and multiple columns.
                    3.  Execution is ………………… in binary search with respect to linear search.
                    4.  Finding an element in the array is called ………………… .
                    5.  ………………… is a technique of adding an element to the array.
                    6.  ………………… is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half.



                                                                                                                       321
                                                                                                              Arrays   321
   318   319   320   321   322   323   324   325   326   327   328