FEDERAL PUBLIC SERVICE COMMISSION
COMPETITIVE EXAMINATION FOR RECRUITMENT TO POSTS
IN BPS – 17 UNDER THE FEDERAL GOVERNMENT, 2002.
TIME ALLOWED: THREE HOURS MAXIMUM MARKS:100
NOTE: 1. Attempt FIVE questions in all, including question No. 8 which is COMPULSORY. Select at least ONE question from EACH of the SECTIONS A, B and C. All questions carry EQUAL marks.
- Illustrate your answers with diagram and sketches where necessary.
Answers should be to the point. Avoid unnecessary details but record facts and any assumptions made.
SECTION – A
- (a) Differentiate between CISC and RISC computer architectures and in this context, describe the architectures of a Stack Machine?
(b) Define a process and process control block. Draw a 5-state model for the process state transition and explain it.
(a) Define a parallel computer and describe the Flynn’s Taxonomy to characterize the various parallel computer architectures.
(b) Differentiate between the paging and segmentation. And describe the working of Page-Fault Frequency Algorithm.
(a) Describe the TCP/IP and explain the concept of TCP/IP ports. Also describe the functionality of at least two well-known protocol ports.
(b) What is the OSI model? Name various OSI layers and briefly describe their functionality.
SECTION – B
- (a) Write an algorithm to construct the binary tree with given preorder and inorder sequence? Prove that every binary tree is uniquely defined by its preorder and inorder sequence?
(b) Provide five examples of software development projects that would be amenable to prototyping, name two or three applications that would be more difficult to prototype?
(a) Briefly construct various Software Development Life Cycle models and their effectiveness in appropriate situations.
(b) Write notes on:
(i) Parameter Passing in C++
(ii) C++ operator associations and order of precedence
(iii) C++ structures and classes
SECTION – C
- (a) Describe the Bresenham’s Line algorithm for raster devices and implement it in C++
(b) Differentiate between DDL, DML, DCL and give examples.
(a) Consider the following relations and identify the highest normal form of each as given, stating any assumption that you need to make.
1) WORK 1 (EMPID, EMPNAME, DATE, HIRED, JOB_TITLE, JOB_LEVEL)
2) WORK 2 (EMPID, EMPNAME, JOB_TITLE, RATING_DATE, RATER_NAME, RATING)
3) WORK 3 (EMPID, EMPNAME, PROJECT#, PROJECT_NAME, PROJ_BUDJET, EMP_MANAGER, HOURS_ASSIGNED)
4) WORK 4 (EMPID, EMPNAME, SCHOOL_ATTEND, DEGREE, GRADUATION_DATE)
5) WORK 5 (EMPID, EMPNAME, SOCIAL_SECURITY_NUMBER, DEPENDENT_NAME, DEPENDENT_ADDRESS, RELATION_TO_EMP)
(b) What are scripting languages? Display the user name and password of the user using Perl on the same page, using both Get and Post form?
- (A) Write only True or False in the Answer Book. Do not reproduce the questions.
(1) The terms “type cast” and “type conversion” have different semantics i.e. they have different effects on the program execution.
(2) Alignment restrictions of modern RISC-architectures forces compilers to occasionally introduce “holes” and “padding” for record structures to ensure efficient access of record elements.
(3) In a language with garbage collection, the programmer need not worry about heap memory management.
(4) In order to execute a program by interpretive execution, the interpreter needs to execute on the system on which the program is to be run.
(5) A GUI is a Graphical Utility Interface.
(6) The study of algorithms began in the 1900s when electronic computers began to be used.
(7) A bus is a part of the computer that decides if a value should be stored as an integer or floating point.
(8) Peripheral devices handle the coordination of a computer’s activities.
(9) Get method in HTML forms is used for debugging.
(10) “Pine” is an example of e-mail utility.
(B) Please choose the most appropriate answer from the given set of answers.
(11) State Transition Diagram gives information of
(a) Prototype Model (b) RAD Model (c) Spiral Model (d) None of these
(12) The concept of meaning represented by an algorithm is known as its:
(a) Control Structure (b) Sequence (c) Semantics (d) Syntax
(13) Each cell of memory is numbered and that number is referred to as the cell’s
(a) Block (b) Identity (c) Address (d) Size
(14) Main memory is called RAM because
(a) It is volatile, like a ram’s temper. (b) The computer starts at address 0 and reads every byte until it reaches the correct address. (c) It can Read all memory (d) The memory is accessible randomly
(15) To use internet, the computer must have
(a) Telephone (b) Modem (c) ISP Connection (d) All of the above
(C) Give short answers to the following questions.
(16) Functions of an O.S.
(17) Object Oriented Programming
(18) Normalization & BCNF
(19) Graphs & Trees
(20) Server Side Scripting Languages