CSS Computer Science Past Paper 2019

    Optional · 80 marks · three hours

    WhatsApp

    Original FPSC paper

    Download

    Instructions specific to this paper

    • Attempt ONLY FOUR questions from PART-II by selecting TWO questions from EACH
    • Attempt ONLY FOUR questions from PART-II by selecting TWO questions from EACH

    Questions

    1. Q. 220 marks

      (a) Give a detailed note on a revised BSD 3-clause license. Also name 5 softwares using (10) this license. (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. 320 marks

      (a) See the following C++ program to declare whether an input number is a prime (10) number or not. Identify the logical errors in the given program (if any). Give your correct statement(s) exactly at the same line number. 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. 410 marks

      (a) How do the OOP paradigm can be associated with the real-world problems? Explain. (b) Discuss critical reasons given by the professionals for not supporting the OOP (10) (20) paradigm.

    4. Q. 510 marks

      (a) Discuss the security issues associated with the cloud computing. (b) What is bit twiddling? Give brief description. (5) (c) An image is a representation of some information. Discuss how does a computer (5) (20) represents an image internally? Name different algorithms used to extract features from images.

    5. Q. 610 marks

      (a) Discuss the limitations of genetic algorithms. (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 (5) (20) minimum spanning tree using Kruskal’s algorithm.

    6. Q. 720 marks

      (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)

    7. Q. 810 marks

      (a) Write down the major steps involved in code generation. (b) How would you optimize a loop? Describe the techniques briefly. (5) (c) Differentiate machine-dependent optimization and machine-independent (5) (20) optimization.

    Standard FPSC instructions

    Printed on this and every CSS paper.

    • Part-II is to be attempted on the separate Answer Book.
    • All the parts (if any) of each question must be attempted at one place instead of at different places.
    • Write Q. No. in the Answer Book in accordance with Q. No. in the question paper.
    • No page/space be left blank between the answers. All the blank pages of the Answer Book must be crossed.
    • Extra attempt of any question or any part of the attempted question will not be considered.

    New papers and past-paper breakdowns, as they drop

    We post CSS and PMS prep every day to 40,000+ aspirants.