Download CSS Computer Science
Past Paper 2015 pdf
FEDERAL PUBLIC SERVICE COMMISSION
COMPETITIVE EXAMINATION FOR RECRUITMENT TO PIN BS-17
UNDER THE FEDERAL GOVERNMENT
CSS Past Paper Computer Science 2015
On this page, we have listed all new CSS Computer Science Past Paper 2015 in PDF format. To Download CSS Past Papers just click on the link. Here on our website, you can get all subject Pdf Notes and Past Papers. You can also download NTS Test Preparation Books.CSS Past Papers PDF format is great information for you. Here on our website, you can get Computer Science CSS and CSS Solved Past Papers in PDF format Soon.
CSS Computer Science Past Paper 2015 Download
 |
| css past papers Computer Science |
Computer Science CSS 2015 Past Paper Download
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. 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 the Answer Book must be crossed.
(vi) An extra attempt of any
question or any part of the attempted question will not be considered.
(vii) Use of Calculator is
allowed.
PART-II
SECTION-A
Q. 2. (a) Why Registers are used in CPU operations?
Define the purposes of MAR, IR and Program Counter.
(b) Give a scheme for Deadlock Prevention.
(c) Elaborate the concept
of IPV6. Explain its advantages over IPV4.
Q. 3. (a) Explain the functionality of the seven layers
of the OSI reference model and map with the TCP/IP protocol suite.
(b) Discuss the Instruction Execution Cycle.
(c) Briefly explain Paging and Segmentation with diagrams.
SECTION-B
Q. 4. (a) Explain the functionality of the Hash Table.
Supposing that the table size is 100, give steps to insert data 112, 2023, and 3001
into the Hash Table and then search 2023 from the Hash Table.
(b) What is the
difference between Function Overloading and Function Overriding? Explain your answer
by giving an example syntax for each one.
(c) Write short notes on; the following:
I. UNSECASE Diagram II. Activity Diagram
Q. 5. (a) Write down the difference between:
I. Data Hiding and Encapsulation II.
Constructor and Copy Constructor
(b) Build and draw a
Binary Search Tree for the following input data 25, 11, 75.
SECTION-C
Q. 6. (a) Write down notes
on the following:
I. CRT Display
Devices II. LCD Display Devices
(b) What is CSS? How many
ways are there to link CSS and XHTML?
(c) Write notes on the following:
I. 3NF II. BCNF
Q. 7. (a) Differentiate between the following by
giving their respective definitions and concepts:
I. Equvi Join II. Outer Join III.
Natural Join
(b) What are different web
Architectures? Explain their Advantages and Disadvantages.
(c) Write down the Incremental Algorithm for Line drawing from
p0, (x0,y0)pl(x1,y1) where x1x0 anddxdy
You May Also Like That:
Post a Comment