CSS past papers · 2019

CSS 2019 Computer Science Combined Papers Past Paper

Download and review the CSS 2019 Computer Science Combined Papers Past Paper on CSS Vista, with archive details, related papers and a direct PDF link for examination preparation.

Paper details

Examination
CSS
Year
2019
Subject
Computer Science
Paper
Combined Papers
Subject type
Optional
Mode
Subjective

Browse the complete CSS Vista past-paper archive.

Questions recorded from this paper

These 12 question wordings are transcribed from CSS Vista’s structured Computer Science past-paper record for CSS 2019.

  1. Q3 · Introduction to Computing(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) (20)
  2. Q5 · Information Security/Privacy(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 (5) (20) represents an image internally? Name different algorithms used to extract features from images.
  3. Q4 · Object Oriented Paradigm(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 (10) (20) paradigm.
  4. Q6 · Genetic Algorithms(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 (5) (20) minimum spanning tree using Kruskal’s algorithm.
  5. Q7 · Aspect-Oriented Software Engineering(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) (20)
  6. Q2 · Compiler Construction(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) (20)
  7. Q8 · Loop optimization(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 (5) (20) optimization.
  8. Q2 · Parallelism(a) Compare the main features of CISC and RISC architectures. Which type (8) of architecture is suitable for pipelining? (b) Demonstrate use of superscalar approach to achieve instruction level parallelism (6) using a suitable example. (c) List all basic functions of buses in the context of computer architecture. (6) (20)
  9. Q5 · Computer Communications & Networks(a) Demonstrate various types of multiplexing techniques in the context of (8) computer networks using suitable examples. (b) Show step by step procedure to find MAC address of a node in a network (6) using Address Resolution Protocol. (c) For transmission of voice signal in real time over the network, select a (6) (20) suitable switching technique. Justify your answer using an example.
  10. Q3 · IPv6(a) Show field by field comparison for IPv4 and IPv6 packets. (8) (b) Explain the following routing techniques using suitable examples. (6) (i) Link State Routing (ii) Distance Vector Routing (c) Show step by step procedure of error detection using cyclic redundancy (6) (20) check method for a 7 bit code block “1001001”. Assume appropriate generator polynomial.
  11. Q4 · Database Systems(a) Demonstrate step by step procedure for process swapping between main (8) memory and secondary memory. (b) Show flow chart of a process scheduling mechanism using various (6) queues. (c) Explain the difference between Sequential Access and Indexed Sequential (6) (20) Access in the context of file access using a suitable example
  12. Q8 · ER Model(a) Demonstrate the use of ER Model in database designing process using an (8) example. (b) Describe an appropriate security scheme for a database maintained by a (6) bank. Justify your answer using an example. (c) Explain the difference between top-down and bottom-up approaches in (6) (20) the context of distributed database design using a suitable example.

Topic-wise Computer Science past-paper analysis.