0% found this document useful (0 votes)
27 views

Computer Science 2019

This document contains past papers for the subject of Computer Science from the year 2019 administered by the Federal Public Service Commission of Pakistan. It provides information about where to find solved past papers, date sheets, online preparation resources, topper's notes and recommended books for the CSS exam. The paper contains 8 questions covering topics in computer networks, operating systems, databases, algorithms and more. It tests the candidate's knowledge of computer science principles and their ability to solve problems.

Uploaded by

Umair Shabbir
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
27 views

Computer Science 2019

This document contains past papers for the subject of Computer Science from the year 2019 administered by the Federal Public Service Commission of Pakistan. It provides information about where to find solved past papers, date sheets, online preparation resources, topper's notes and recommended books for the CSS exam. The paper contains 8 questions covering topics in computer networks, operating systems, databases, algorithms and more. It tests the candidate's knowledge of computer science principles and their ability to solve problems.

Uploaded by

Umair Shabbir
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

CSS Past Papers

Subject: Computer Science


Year: 2019

For CSS Solved Past Papers, Date Sheet, Online


Preparation, Toppers Notes and FPSC
recommended Books visit our website or call us:
CSSAspirants.Pk
0336 0535622
FEDERAL PUBLIC SERVICE COMMISSION Roll Number
COMPETITIVE EXAMINATION-2019
FOR RECRUITMENT TO POSTS IN BS-17
UNDER THE FEDERAL GOVERNMENT

COMPUTER SCIENCE, PAPER-I


TIME ALLOWED: THREE HOURS PART-I (MCQS) MAXIMUM MARKS = 20
PART-I(MCQS): MAXIMUM 30 MINUTES PART-II MAXIMUM MARKS = 80
NOTE: (i) Part-II is to be attempted on the separate Answer Book.
(ii) Attempt ONLY FOUR questions from PART-II by selecting TWO questions from EACH
SECTION. ALL questions carry EQUAL marks.
(iii) All the parts (if any) of each Question must be attempted at one place instead of at different
places.
(iv) Write Q. No. in the Answer Book in accordance with Q. No. in the Q.Paper.
(v) No Page/Space be left blank between the answers. All the blank pages of Answer Book must
be crossed.
(vi) Extra attempt of any question or any part of the question will not be considered.

PART – II
SECTION – I
Q. 2. (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)

Q. 3. (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)

Q. 4. (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.

Q. 5. (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.
Page 1 of 2
COMPUTER SCIENCE, PAPER-I
SECTION-B

Q. 6. (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.

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

Q. 8. (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.

*******

Page 2 of 2
FEDERAL PUBLIC SERVICE COMMISSION Roll Number
COMPETITIVE EXAMINATION-2019
FOR RECRUITMENT TO POSTS IN BS-17
UNDER THE FEDERAL GOVERNMENT

COMPUTER SCIENCE, PAPER-II


TIME ALLOWED: THREE HOURS PART-I (MCQS) MAXIMUM MARKS = 20
PART-I(MCQS): MAXIMUM 30 MINUTES PART-II MAXIMUM MARKS = 80
NOTE: (i) Part-II is to be attempted on the separate Answer Book.
(ii) Attempt ONLY FOUR questions from PART-II by selecting TWO questions from EACH
SECTION. ALL questions carry EQUAL marks.
(iii) All the parts (if any) of each Question must be attempted at one place instead of at different
places.
(iv) Write Q. No. in the Answer Book in accordance with Q. No. in the Q.Paper.
(v) No Page/Space be left blank between the answers. All the blank pages of Answer Book must
be crossed.
(vi) Extra attempt of any question or any part of the question will not be considered.

PART – II
SECTION-A

Q. No. 2. (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)

Q. No. 3. (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.

Q. No. 4. (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

Q. No. 5. (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.

SECTION-B
Q. No. 6. (a) Analyze the following noise models in the context of digital image (8)
processing.
(i) Gaussian Noise Model
(ii) Uniform Noise Model
(b) Compare RGB and HSI color models in the context of digital image (6)
processing.
(c) Describe step by step process of application of compression based (6) (20)
technique for image segmentation.

Page 1 of 2
COMPUTER SCIENCE, PAPER-II

Q. No. 7. (a) A Medium advertising company is reviewing its IT requirements and is (8)
considering using a Cloud solution for web applications as opposed to
investing in existing infrastructure. Is this an appropriate strategy? Justify
your answer using an example.
(b) Describe briefly the role of validation in requirement engineering (6)
process. (6) (20)
(c) Explain the difference between functional and non-functional requirement
in the context of web engineering using a suitable example.

Q. No. 8. (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.

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

Page 2 of 2

You might also like