New ! Computer Science MCQ Practise Tests



12th Standard English Medium Computer Science Subject Creative 1 Mark Questions with Solution Part - I

12th Standard

    Reg.No. :
  •  
  •  
  •  
  •  
  •  
  •  

Computer Science

Time : 01:00:00 Hrs
Total Marks : 25

    1 Marks

    25 x 1 = 25
  1. The function definition is introduced by the keyword

    (a)

    def

    (b)

    rec

    (c)

    let

    (d)

    infer

  2. A function definition which call itself is called

    (a)

    user defined function

    (b)

    built-in function

    (c)

    derived function

    (d)

    recursive function

  3. Explicitly_________the types can help with debugging.

    (a)

    defining

    (b)

    annotating

    (c)

    informing

    (d)

    computing

  4. Evaluation of__________ functions does not cause any side effects to its output?

    (a)

    Impure

    (b)

    pure

    (c)

    Recursive

    (d)

    built-in

  5. Which of the following provides modularity?

    (a)

    Datatypes

    (b)

    Subroutines

    (c)

    Classes

    (d)

    Abstraction

  6. The process of providing only the essentials and hiding the details is known as

    (a)

    Functions

    (b)

    Abstraction

    (c)

    Encapsulation

    (d)

    Pairs

  7. How many ways to implement an ADT?

    (a)

    Only one

    (b)

    Two

    (c)

    Three

    (d)

    Many

  8. How many parts are the!"ein the program?

    (a)

    2

    (b)

    3

    (c)

    4

    (d)

    Many

  9. Which of the following is contracted by placing expressions within square brackets separated by commas?

    (a)

    List

    (b)

    Tuple

    (c)

    Set

    (d)

    Dictionary

  10. Color = ('red', 'green, 'blue') is an example of

    (a)

    Dictionary

    (b)

    List

    (c)

    Set

    (d)

    Tuple

  11. Which of the following defines a data abstraction by grouping related data items?

    (a)

    List

    (b)

    Pair

    (c)

    Class

    (d)

    Tuple

  12. The basic idea of ________ is to structure programs so that they operate on abstract dat(a)

    (a)

    Encapsulation

    (b)

    Polymorphism

    (c)

    Data type

    (d)

    Data Abstraction

  13. How many variables can be mapped to the same instance?

    (a)

    2

    (b)

    3

    (c)

    4

    (d)

    Multiple

  14. Which of the following rule is used to decide the order in which the scopes are to be searched for scope resolution?

    (a)

    LEGB

    (b)

    LGEB

    (c)

    LBEG

    (d)

    LGBE

  15. Choose the type of scope for a variable '9! defined in the following program.
    Disp ( ):
    a:=7
    Print a
    Disp ( )

    (a)

    Global

    (b)

    Enclosed

    (c)

    Local

    (d)

    Built-in

  16. Which of the following can ease the job of programming and debugging the program?

    (a)

    Statements

    (b)

    Interaction

    (c)

    Modules

    (d)

    Scopes

  17. The example of modules are

    (a)

    Procedures

    (b)

    Subroutines

    (c)

    Functions

    (d)

    All of these

  18. The arrangement of private instance variables and public methods ensure the principle of

    (a)

    Inheritance

    (b)

    Polymorphism

    (c)

    Encapsulation

    (d)

    Abstraction

  19. The scope of a_______ is that part of the code where it is visible

    (a)

    Keyword

    (b)

    Variable

    (c)

    Function

    (d)

    Operator

  20. Which of the following is not an example of data structures?

    (a)

    Control statement

    (b)

    Structure

    (c)

    List

    (d)

    Dictionary

  21. Which characteristics of an algorithm should be generic, independent of any programming language?

    (a)

    Independent

    (b)

    Portable

    (c)

    Feasibility

    (d)

    Unambiguous

  22. The amount of memory required to run an algorithm completion is known by

    (a)

    Efficiency of an algorithm

    (b)

    Performance analysis of an algorithm

    (c)

    Space complexity of an algorithm

    (d)

    Time complexity of an algorithm

  23. Which of the following is not a factor use a to measure the time efficiency of an algorithm?

    (a)

    Speed of the machine

    (b)

    Operating system

    (c)

    Designing algorithm

    (d)

    Programming language

  24. O(n) is an example of

    (a)

    best case

    (b)

    Average case

    (c)

    worst case

    (d)

    Null case

  25. Which of the following sorting algorithm is too slow and less efficient?

    (a)

    Bubble

    (b)

    Selection

    (c)

    Quick

    (d)

    Merge

*****************************************

Reviews & Comments about 12th Standard English Medium Computer Science Subject Creative 1 Mark Questions with Solution Part - I updated Creative Questions

Write your Comment