Page 126 - TP_Prime_v2.2_Class_6
P. 126

c.  A flowchart is a graphical representation of a/an ____________.

                          (i)  Program                                  (ii)  Algorithm

                          (iii)  Symbol                                 (iv)  Sequence

                      d.  Which of the following languages is understood by the computer?


                          (i)  Assembly language                        (ii)  Machine language
           Prime (Ver. 2.2)-VI     e.  Which of the following is the third generation language?
                                                                        (iv)
                          (iii)  High-level language
                                                                             4GL



                                                                        (ii)  Machine language
                          (i)  High-level language
                          (iii)  Assembly language
                                                                        (iv)  Low-level language

                       f.   There are ____________ types of language translators.

          124             (i)  1                                        (ii)  2


                          (iii)  3                                      (iv)  4

                  2.  Write ‘T’ for true and ‘F’ for false.

                      a.  C++ language is an example of fourth generation language.                   ____________


                      b.   In flowcharts, decision box is used to show the branches in the

                         process flow.                                                                ____________

                      c.  Only one flow line should come out of a process symbol.                     ____________


                      d.  Assembly language is a first generation language.                           ____________

                      e.  High-level languages are machine independent.                               ____________



                    Evaluation Time


                  1.  Fill in the blanks using the hints given below:


                                   Connectors,   Finiteness,   Instructions,   Natural,    Programming

                      a.  Prolog is the example of ___________ language.

                      b.  The ___________ are usually labelled in pairs to show matching jump points.

                      c.  ___________ stops after a finite number of instructions are executed.
   121   122   123   124   125   126   127   128   129   130   131