Skip to content
All Computer Science Paper I papers

CSS past paper

CSS Computer Science Paper I Past Paper 2021

CSS Computer Science Paper I 2021 carries 100 marks over 3 hours. It has 7 questions.

Marks
100
Time
3 hours
Questions
7

How to attempt: Attempt ONLY FOUR questions from PART-II, by selecting TWO questions from EACH SECTION. ALL questions carry EQUAL marks.

Questions

Question 1 (Part I) is the paper's MCQs, which are not reproduced here.

SECTION-A

  1. Q. 2
    • (a)
      What are office productivity tools? Explain uses of any two productivity tools in your home or workplace.
      (7)
    • (b)
      Write a detailed note on computer crimes and ethical challenges.
      (7)
    • (c)
      What are the different types of computers? Explain the benefits of miniaturization.
      (6)
  2. Q. 3
    • (a)
      Describe any two of the following briefly: ISP, HTML, SSD, Cloud Computing.
      (6)
    • (b)
      Write a program that should output the factors of the number passed as input – one factor on each line. Factors of a number, say x, are those whole numbers which can be multiplied with other whole numbers to get x.
      (5)
    • (c)
      What are IDEs? How do they help in software development? List the IDEs you have ever used.
      (5)
    • (d)
      Write a program in C/C++ to convert a decimal number to hexadecimal.
      (4)
  3. Q. 4
    • (a)
      Explain object oriented programming paradigm. Write a detailed note on any two of the principles of object oriented programming paradigm.
      (8)
    • (b)
      Why do we need interfaces in OOP? How does it help in achieving abstraction?
      (6)
    • (c)
      What do you mean by runtime and compile time errors?
      (6)

SECTION-B

  1. Q. 5
    • (a)
      What is a tree in data structure? Describe its types with the help of examples.
      (8)
    • (b)
      What is pass by value and pass by reference? Can we pass an object as a parameter to call a method in java?
      (6)
    • (c)
      Convert following infix notation to prefix
      (6)
      • (i)
        (30+23)*(43-21)/(84+7)
      • (ii)
        2*(1+(4*(2+1)+3))
  2. Q. 6
    • (a)
      Convert following NFA to DFA:
      (8)
      NFA with states q0 (start), q1 and q2 (accepting, double circle): q0 loops on 0, goes to q1 on 1 and to q2 on 1; q1 loops on 0 and goes to q2 on 0,1; q2 goes to q1 on 0,1 and to q0 on 0.
    • (b)
      Differentiate between overloading and overriding with the help of an example.
      (6)
    • (c)
      What is recursion in data structures? Explain three conditions of a recursive function with the help of an example.
      (6)
  3. Q. 7
    • (a)
      Write detailed notes on any TWO of the following:
      (8)
      • (i)
        PERT chart
      • (ii)
        Unified Modeling Language
      • (iii)
        AVL Trees
    • (b)
      What is a Software Process Model? Explain the Spiral model in detail.
      (7)
    • (c)
      What do you mean by software quality? List at least five quality attributes.
      (5)
  4. Q. 8
    • (a)
      Consider the grammar
      (4)
      S → cAd
      A → a b | a

      construct a top-down parse tree for the input string w = cad

    • (b)
      Is the above given grammar ambiguous or unambiguous? Justify your answer.
      (4)
    • (c)
      Write similarities and differences of CFG and regular expression.
      (4)
    • (d)
      Design grammar for the following language: “The set of all strings of 0s and 1s such that every 0 is immediately followed by at least one 1”.
      (4)
    • (e)
      Write a note on Aspect Oriented Programming
      (4)
  1. Part-II is to be attempted on the separate Answer Book.
  2. Attempt ONLY FOUR questions from PART-II, by selecting TWO questions from EACH SECTION. ALL questions carry EQUAL marks.
  3. All the parts (if any) of each Question must be attempted at one place instead of at different places.
  4. Write Q. No. in the Answer Book in accordance with Q. No. in the Q.Paper.
  5. No Page/Space be left blank between the answers. All the blank pages of Answer Book must be crossed.
  6. Extra attempt of any question or any part of the question will not be considered.