Skip to content
MockCSS
All Computer Science Paper I papers

CSS past paper

CSS Computer Science Paper I Past Paper 2019

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

Marks
100
Time
3 hours
Questions
7

Years

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 – I

  1. Q. 2
    (20)
    • (a)
      Give a detailed note on a revised BSD 3-clause license. Also name 5 softwares using this license.
      (10)
    • (b)
      How do artificial intelligence may facilitate us in improving cyber security?
      (5)
    • (c)
      What are the main parts and phases of a computer virus program?
      (5)
  2. Q. 3
    (20)
    • (a)
      See the following C++ program to declare whether an input number is a prime number or not. Identify the logical errors in the given program (if any). Give your correct statement(s) exactly at the same line number.
      (10)
      1.    n, i;
2.   bool is Prime = false;
3.   cout<< "Enter a positive integer: ";
4.   cin>> n;
5.   for(i = 1; i< n / 2; ++i)
6.   {
7.   if(n /i == 0)
8.   {
9.   is Prime = false;
10.  break;
11.  }
12.  }
13.  if (is Prime)
14.  cout<< "This is a prime number";
15.  else
16.  cout<< "This is not a prime number";
    • (b)
      What is the difference between call by value and call by reference?
      (5)
    • (c)
      What is the role of preprocessor directives? Give three examples in C++.
      (5)
  3. Q. 4
    (20)
    • (a)
      How do the OOP paradigm can be associated with the real-world problems? Explain.
      (10)
    • (b)
      Discuss critical reasons given by the professionals for not supporting the OOP paradigm.
      (10)
  4. Q. 5
    (20)
    • (a)
      Discuss the security issues associated with the cloud computing.
      (10)
    • (b)
      What is bit twiddling? Give brief description.
      (5)
    • (c)
      An image is a representation of some information. Discuss how does a computer represents an image internally? Name different algorithms used to extract features from images.
      (5)

SECTION-B

  1. Q. 6
    (20)
    • (a)
      Discuss the limitations of genetic algorithms.
      (10)
    • (b)
      What is AVL tree? Under what condition, a binary tree becomes AVL tree?
      (5)
    • (c)
      Consider the following graph. Find out the sequence of edges added to the minimum spanning tree using Kruskal’s algorithm.
      (5)
      Undirected weighted graph on vertices a to g with edges a-b 5, a-c 3, b-c 4, b-d 6, b-e 2, c-d 5, c-f 6, d-e 6, d-f 6, e-f 3, e-g 5 and f-g 4.
  2. Q. 7
    (20)
    • (a)
      Discuss the architecture of aspect-oriented system.
      (10)
    • (b)
      Briefly discuss the motivation for aspect-oriented programming.
      (5)
    • (c)
      What is the significance of quantification and obliviousness?
      (5)
  3. Q. 8
    (20)
    • (a)
      Write down the major steps involved in code generation.
      (10)
    • (b)
      How would you optimize a loop? Describe the techniques briefly.
      (5)
    • (c)
      Differentiate machine-dependent optimization and machine-independent optimization.
      (5)
  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.