Computer Science CSS Paper 2005

FEDERAL PUBLIC SERVICE COMMISSION
COMPETITIVE EXAMINATION FOR RECRUITMENT TO POSTS
IN BPS – 17 UNDER THE FEDERAL GOVERNMENT, 2005.
COMPUTER SCIENCE
TIME ALLOWED: THREE HOURS MAXIMUM MARKS:100

NOTE: Attempt FIVE questions in all, including Question no 8 which is compulsory.
Select at least ONE question from each section. All question carry equal marks.

SECTION I
1. a) What is decentralized processing? Also explain distributed data processing.
b) How would shared memory be used to communicate data between two processes?
2. a) Explain different methods for processing of data files?
b) What are network protocols? Explain any two common LAN protocols?
3. a) Explain any three widely used media for wireless communication.
b) What is pipelining? Hence also explain the strategy of parallel processing.

SECTION II

1. a) Explain the term Information Hiding. Also differentiate between Top-down design and Bottom-up design.
   b) Discuss briefly the main characteristics of object oriented programming.

5 . a) Show that by removing at most O(lg n) edges, we can partition the vertices of any n-vertex tree into two sets A and B such that |A|=[n/2] and |B|=[n/2].
b) Give an efficient algorithm to determine if an undirected graph is bipartite.

SECTION III

1. a) Differentiate between an operational database and a warehouse. What types of applications does each serve?
   b) What is the difference between a data entity in second normal form (2NF) and third normal form (3NF)? Give an example of an entity in 2NF and show its conversion to 3NF.

2. a) What is client side programming?
   b) What are the tools to develop website fast and viewable?

COMPULSORY QUESTION

1. (A) For whom the following abbreviations stand for
   (i) DNS(ii) CMOS (iii) OSI (iv) CASE (v) DDE
   (B) Fill in the blanks with the most suitable options for the following statements:
   (i) A data path to transfer data is called…………………
   (ii) What is combination of I-time and E-time called………………………..
   (iii) The process of applying a formula to a key is called……………….
   (iv) Distortion in the received signals is called………………………
   (v) DMA is a technique to transfer data between memory and ……………..

(C) Write “TRUE” or “FALSE”
(i) RISC technology used fewer instructions then traditional computers.
(ii) Direct file organization is combination of sequential and indexed file organization.
(iii) Fax is a connection of similar networks.
(iv) Let G=(V,E) be an undirected graph when G is a free tree.
(v) An entity instance is a single occurrence of an entity

(D) Write short answers to the following
(i) Prototyping. (ii) FAT (iii) Virtual memory (iv) Deadlock (v) Abstraction