FEDERAL PUBLIC SERVICE COMMISSION

Roll Number
COMPETITIVE EXAMINATION - 2017
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.
(iii) All the parts (if any) of each Question must be attempted at one place instead of at different places.
(iv) Candidate must 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 attempted question will not be considered.

PART-II
SECTION-I
Q. 2. (a) The internet era has given rise to the problem of cybercrimes. Given the need to maintain (8)
privacy which is an ethical responsibility of the government, what technical means would you
suggest to curb this problem?

(b) Describe the difference between Harvard and Von-Neumann architectures of computers.
(6)
Also discuss their traits in the light of their capabilities.

(c) Virtual memory is used by the computer to support the running of heavy applications.
Describe the functioning of virtual memory in the computer. Also comment on the management (6)
of virtual and physical memory by an operating system.

Q. 3. (a) Three types of languages exist for use in programming of computers, Machine, Low (8)
Level and High Level languages. Elucidate on these three types, giving details of the
conversion process between Low Level and High Level language into Machine language.

(b) Write a function that calculates the quadratic equation in . You may use the
(6)
math library for this purpose. The program should ask the user to enter values of a, b and c and
should print the result. A sample execution of the program is shown below:
Enter value of a: 1
Enter value of b: 2
Enter value of c: 1
The values of x are -1, -1

(c) Consider that you are required to create a program for a supermarket checkout machine. The
machine has a database of the items available in the supermarket which consists of the
items name, code and price. Make a program that requires the cashier (user) to enter the
code or name of the product and the quantity that has been bought. It should allow for multiple (6)
entries to be made. Once all the entries have been made. The program prints the total
amount to be charged on the screen. A sample execution is shown below:
Enter product name or code: 1
Enter quantity: 1
Do you have more products to add (Y/N): N
The total amount is 500
You may construct the database as a structure.

Q.4. (a) What factors should be considered when choosing particularly between evolutionary and (8)
incremental models? Elucidate the characteristics of Rapid Application Development, Joint
Application Development and Agile Software Engineering.

(b) Differentiate between Software Validation and Verification. Discuss some of the (6)
techniques used for empirical software evaluation.

(c) Discuss the importance of Requirements Engineering in the success of a software (6)
project. Explain in detail the process of ‘Requirements Sign-off’.

Page 1 of 2
COMPUTER SCIENCE, PAPER-I

Q. 5. (a) Draw and build a Red-black tree for the following keys (50, 60, 70, 80, 90) and (50, 40, 30, 20, 10). (8)
Would a binary tree be suitable for the insertion of these keys?

(b) Hash tables enable for fast insertion and searching within the database. Describe the process of (6)
hashing with a suitable example.

(c) Describe the process of Bubble Sorting. Write down the output after each pass of the Bubble
Sort algorithm for sorting the sequence (3, 8, 2, 6, 1, 10). (6)

SECTION-II
Q. 6. (a) The design methodologies of programs can have multiple approaches including the Big (8)
Bang, Code and Fix, Water Fall and the Spiral Model. Consider a test application and
describe the development of the application while following each of these four
approaches.

(b) Discuss the design issues of Task Partitioning and Task Allocation in Distributed Software (6)
Engineering tasks.

(c) Explain the importance of Design Patterns under the umbrella of Agile software design and (6)
programming. Explain Software Testing and different methodologies.

Q. 7. (a) The handling of syntax errors involves the use of parser and the lexical analyzer. Comment (8)
on its functioning.

(b) Using a suitable example, compare the operation of a top-down and a bottom-up Parser (6)
based compiler.

(c) Explain the two different methods of code optimization that is Loop optimization and (6)
Peephole optimization by giving a suitable example.

Q. 8. Write short notes on any FOUR of the following: (5 each) (20)

(a) Global, Local and shared variables for nested function access
(b) Protecting IP rights in the digital domain
(c) Parallel processing and the use of pipelining for this purpose
(d) Resource allocation during runtime processes
(e) Intermediate Code Generation
(f) Searching Algorithms
***************

Page 2 of 2
 FEDERAL PUBLIC SERVICE COMMISSION
Roll Number
COMPETITIVE EXAMINATION – 2017, 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) Candidate must 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 attempted question will not be considered.
PART-II
SECTION-A
Q. 2. (a) Discuss the following methods of storage systems: (8)
(i) Direct Access (ii) Random Access

(b) If clock speed reaches its maximum then what are the two methods to increase the (6)
performance of a computer? Briefly explain.

(c) Draw and explain instruction execution state diagram with interrupt. (6)

Q. 3. (a) Explain the following network protocols: (8)

(i) HTTP and SIP (ii) TCP and UDP
(6)
(b) What is the transmission time of a packet sent by a station if the length of the packet is 1
million bytes and the bandwidth of the channel is 200 Kbps?
(6)
(c) Given the IP address 10.5.118.3 and the network mask 255.255.240.0, what are the
assignable IP addresses and broadcast in this subnet?
Q. 4. (a) What are differences between Optimal & LRU (Least Recently Used) page Replacement (8)
Policies?

(b) Discuss the four necessary conditions for deadlock to occur. How can we deny any two (6)
of these conditions?

(c) Consider three processes given in the table. Find average waiting time and average (6)
turnaround (completion) time when these processes are scheduled using Round-Robin
scheduling using time quantum (TQ) = 4.

Process CPU Burst

P1 24
P2 7
P3 10

Q. 5. (a) Explain the functionality and purposes of following registers with diagrams: (8)
(i) Memory Address Register (MAR)
(ii) Memory Buffer Register (MBR)
(iii) Instruction Register (IR)
(b) Discuss the functionality of Ethernet LAN and its types. (6)
(c) What happens in the following cases?
(i) If the job size is kept very low in time sharing systems. (6)
(ii) If the page size is kept very small in paged memory management.
Page 1 of 2
COMPUTER SCIENCE, PAPER-II

SECTION-B
Q. 6. (a) What is Normalization? Discuss 1NF, 2NF and 3NF with example(s). (8)

(b) Write short notes on the following: (6)

(i) Data (ii) Database (iii) Database Management System

(c) Differentiate between Centralized Database and Distributed Database. (6)

Q. 7. (a) Define image histogram. What is meant by histogram equalization? Explain their (8)
applications in image processing.
(6)
(b) Find the storage in bytes required to store a 256 x 200 colored image using RGB color
model with 24 bit color depth.
(6)
(c) Briefly explain Geometric Transformations.

Q. 8. (a) Explain the following web concepts: (8)

(i) localStorage and sessionStorage objects
(ii) Application cache in HTML5
(iii) Manifest file
(iv) Web Worker

(6)
(b) What is SVG? What are the advantages of SVG over JPEG or GIF?
(6)
(c) Explain Non Breaking space in HTML with example.

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

Page 2 of 2