Scribd
Upload
73 views2 pages

Css Computer Science 2021

This document contains instructions and questions for a competitive examination for recruitment to BS-17 level posts in the federal government of Pakistan. It is divided into two parts - Part I contains 30 multiple choice questions to be completed in 30 minutes, and Part II contains 4 long-form questions to be answered in the remaining time. Candidates must attempt only 2 questions from each of the 2 sections in Part II. The questions cover topics like office productivity tools, computer crimes, types of computers, programming, data structures, algorithms, grammars and aspects of object-oriented programming.

Uploaded by

Hamza Khan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
73 views2 pages

Css Computer Science 2021

This document contains instructions and questions for a competitive examination for recruitment to BS-17 level posts in the federal government of Pakistan. It is divided into two parts - Part I contains 30 multiple choice questions to be completed in 30 minutes, and Part II contains 4 long-form questions to be answered in the remaining time. Candidates must attempt only 2 questions from each of the 2 sections in Part II. The questions cover topics like office productivity tools, computer crimes, types of computers, programming, data structures, algorithms, grammars and aspects of object-oriented programming.

Uploaded by

Hamza Khan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

FEDERAL PUBLIC SERVICE COMMISSION Roll Number

COMPETITIVE EXAMINATION-2021 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-A
Q. No. 2. (a) What are office productivity tools? Explain uses of any two productivity tools in your (7)
home or workplace.
(b) Write a detailed note on computer crimes and ethical challenges. (7)
(c) What are the different types of computers? Explain the benefits of miniaturization. (6)

Q. No. 3. (a) Describe any two of the following briefly: ISP, HTML, SSD, Cloud Computing. (6)
(b) Write a program that should output the factors of the number passed as input – one factor on (5)
each line. Factors of a number, say x, are those whole numbers which can be multiplied
with other whole numbers to get x.
(c) What are IDEs? How do they help in software development? List the IDEs you have ever (5)
used.
(d) Write a program in C/C++ to convert a decimal number to hexadecimal. (4)

Q. No. 4. (a) Explain object oriented programming paradigm. Write a detailed note on any two of the (8)
principles of object oriented programming paradigm.
(b) Why do we need interfaces in OOP? How does it help in achieving abstraction? (6)
(c) What do you mean by runtime and compile time errors? (6)

SECTION-B
Q. No. 5. (a) What is a tree in data structure? Describe its types with the help of examples. (8)
(b) What is pass by value and pass by reference? Can we pass an object as a parameter to (6)
call a method in java?
(c) Convert following infix notation to prefix (6)
(i) (30+23)*(43-21)/(84+7)
(ii) 2*(1+(4*(2+1)+3))

Q. No. 6. (a) Convert following NFA to DFA: (8)

(b) Differentiate between overloading and overriding with the help of an example. (6)

(c) What is recursion in data structures? Explain three conditions of a recursive function with the (6)
help of an example.
Page 1 of 2
COMPUTER SCIENCE, PAPER-I
Q. No. 7. (a) Write detailed notes on any TWO of the following: (8)
i. PERT chart ii. Unified Modeling Language iii. AVL Trees

(b) What is a Software Process Model? Explain the Spiral model in detail. (7)

(c) What do you mean by software quality? List at least five quality attributes. (5)

Q. No. 8. (a) Consider the grammar (4)


S → cAd
A→ ab|a
construct a top-down parse tree for the input string w = cad

(b) Is the above given grammar ambiguous or unambiguous? Justify your answer. (4)

(c) Write similarities and differences of CFG and regular expression. (4)

(d) Design grammar for the following language: (4)


“The set of all strings of 0s and 1s such that every 0 is immediately followed by at least
one 1”.
(4)
(e) Write a note on Aspect Oriented Programming

**********

Page 2 of 2

You might also like