FEDERAL PUBLIC SERVICE COMMISSION Bal Niet COMPETITIVE EXAMINATIO. of Numer FOR RECRUITMENT TO POSTS IN BS-17 UNDER THE FEDERAL GOVERNMENT COMPUTER SCIENCE, PAPER-I TIME ALLOWED: THREE HOURS PART-I (MCQS) MAXIMUM MARK! PART-I(MCQS): MAXIMUM 30 MINUTES PART-IL MAXIMUM MARKS = 80 NOTE: (i) Part-I isto be attempied on the separate Answer Book. Avempt ONLY FOUR questions from PART-II, ALL questions carry EQUAL marks, All the parts (ifany) of each Question must be attempted at one place instead of at different places, Candidate must write Q. No. in the Answer Book in accordance with Q. No, in the Q.Paper () No Page/Space be left blank between the answers. All the blank pages of Answer Book musi be crossed. (vi) Extra attempt of any question or any part of the attempted question will not be considered. PART-II Q.2. (a) Write a detailed not on any 03 Super Computer Technologies being used in the world. List key (20) Qa. characteristies in each ease, (b) What performance metrics are used to’analyze the eapacity of Super Computer? Discuss. (©) Discuss the role of Web Crawling. Indexing & Searching operations for a search Engine (a) How does dynamic memory allocation is managed programmatically ina C++ program? (20) Clarify yours understand through a viable program. (b) Write a note on the use of overloaded opezations, Discuss with’examples (©) What is bit twiddling Give brief description. (a) What in Polymorphism? Explain Ad-Hoe Polymorphism, Parametric Polymorphism & (20) ibtyping with suitable coding examples (b) Discuss Late Binding with a short programm, (c) Differentiate between Abstraction & Encapsulation: SECTION-B (a) For analyzingam Algorithm theoretically & asymptotically, give a detailed not on Input size, (20) unit of time & Ofer of growth, Support your answer with appropriate mathematical equations (b) Briefly describe the four types of analysis we may perform to evaluate the asymptotic behaviours of an algorithm. (e) Evaluate order of growth of the functions given below. Compare & write down which one has higher, same or lower order of growth than the other one: Page 1 of 2 ~.; aa STUDY RIVER INSTITUTE re) 0310 171 3000 Join us for CSS, PMS & One-Paper Preparation 9315 777 3680 www.studyriver.comPUT! ICE. PER: 1 n(v+ 1) and 2000n? I, 100n? and o.01n3 Wl. Log? nand Inn Ww. 2""l and 2” Vv. (n= Dland n! Q.6. (a) Discuss the architecture of aspect-oriented system, (20) (b) Briefly discuss the motivation for aspect-oriented programming, (0) Briefly describe 05 agile software development frameworks. Q.7. (a) Describe and draw a finite automaton to recognize the regular language of all strings that (20) contain the string ‘001 ’as a substring. (b) Consider the following state diagram and extract the standard information, i.e. Q, 5. qo, Fand 8 (e) How would you optimize a loop? Describe the techniques briefly. QB. (a) Discuss the role of Syntax Trce injrepresenting formal text structure. Dévelopa Syntax Tree (20) structure for the following piece of code: White b 20 ifa>b a=a—b; else b=b-a; \ return a; {b) Describe your understanding on Constant Folding using a brief pscudo code. (c) What is an Optitnization problem? What are its 02 general categories? Write down mathematical representation of a standard optimization problem ese sseesesesesese se Page 2 of 2 STUDY RIVER INSTITUTE re) 0310 171 3000 Join us for CSS, PMS & One-Paper Preparation 0315 777 3680 www.studyriver.comFEDERAL PUBLIC SERVICE COMMISSION COMPETITIVE EXAMINATION — 2023 Roll Number FOR RECRUITMENT TO POSTS IN BS-17 UNDER THE FEDERAL GOVERNMENT COMPUTER SCIENCE, PAP! THREE HOURS MAXIMUM 30 MINUTES 1s t0 be attempted on the separate Answer Book. Attempt ONLY FOUR questions from PART-II, ALL questions camry EQUAL marks, All the parts (if any) of each Question musi be attempted at one place instead of at different places. Candidate must write Q. No, in the Answer Book in accordance with Q. No. in the Q.Paper. (¥) 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-IT SECTION-A (a) Suggest reasons why RAMS traditionally havé been organized as only one bit per chip whereas (20) ROMs are usually organized with multiple bits per chip. (7) (b) Consider a dynamic RAM that must be given a reffesh cycle 64 times per ns? Asch refresh operation requires $O'ns; a’memory eyele requires 150 ns, What pei reat of the memory’s total operating time must be given to refieshes? (7) 4 (c) In the context of RALD, what is the'distinetion parallel access anc independent access? (6) Q3. (a) The CPU in a router ean process 2 million packets/sec-The load offered to it is 5 million (20) packets/sce. Ifa route from source to destination contains 10 routers. How much time is spent being queued and serviced by the CPUs? (7) ~~ (b) An IP datagram using the strict source «outing option has to be fragmented. Do you think the option is copied into each fragment, Or is itsulficient to just put it in the first fragment? Explain your answer. (7) (c) Give two examples of computer applications forwhich connection-oriented service is appropriate and also give two-egamples for which connection-less service is best. (6) Qu. (a) A 32-bit compitter has two selector channels and one multiplexor channel, Each selector channel (20) Supports two magnetic disk and two magnetic tape units. The multiplexor channel has two line printers, two card readets, and ten VDT’ terminal connected to it, Assume the following transfer rates. (12) Disk drive 800 Kbytes/s Magnetic tape drive 200 Kbytes Line printer 6.6 Kbytes/s Card Reader 1.2 Kbytes!s VDT | Kbytes/s Estimate the maximum aggregate I/O transfer rate in this system. ~.; aa STUDY RIVER INSTITUTE re) 0310 171 3000 Join us for CSS, PMS & One-Paper Preparation 0315 777 3680 www.studyriver.comCOMPUTER SCIENCE, PAPER-II (b) Consider a program that access a singly /O device and compare un-butfered 1/O to the use of a buffer, Show that the use of buffer can reduce the running time by at most a factor of two. (8) (a) An /O -bound program is one that, if run alone, would spend more time waiting for VO than (20) using the process. A processor-bound program is the opposite. Suppose a short term scheduling algorithm favors those programs that have used little processor time in the recent past. Explain why this algorithm favors /O bound programs and yet does not permanently deny processor time to processor-bound programs? (10) (b) Suppose that instead of using 16-bits for the network part of a class B address originally, 20 bits had been used. How many class B networks would there have been? (5) (©) What is the distinetion between instruction-level parallelism and ma SECTION-B Q6. (a) Explain the following different SELECT statement search conditions with examples using any (20) database schema of your choice: (12) 1, Compound Comparison 2. Range search condition (BETWEEN/NO? BETWEEN) 3, Set membership search condition (IN/NOT IN) 4, Pattern match search condition (LIKE/NOT LIKE) (b) Explain ACID property of a'transaction. (4) (©) Explain Transitive dependency using any example. (4) Q.7. (a) A common measure of transmission for digital data is the baud rateydefined/asithe number of (20) bits transmitted per second, transmission is accomplished in packets Gonsisting of a start bit, a byte (8 bits) of information, anda stop bit. Using these facts, answer the following: (10) ‘+ How many minutes would it take to transmit 2 1024 x 1024 image with 256 intensity levels using a 56k baud modem? ‘What would the time be at 750K" baud are representative speed of a phone DSL (Digital subscriber line) connection? (b) What effeet would setting to zero the lower-order bit planes have on the histogram of an image in general? (8) (c) What would be the effect on the histogram if we set to zero the higher order bit planes instead? 6) Q8. (a) How SEO improves your website traffic? Explain with proper reasons and coding examples. (8) (20) (b) Suppose your web team is going to make a contract with the customer and you need to estimate the cost of application development. What pricing factors you consider to estimate the cost? (8) (©) Write the jQuery code to slide elements up and down, Use HTML, CSS, and jQuery. (4) teeaeeeinekae sm? (3) Page 2 of 2 STUDY RIVER INSTITUTE re) 0310 171 3000 Join us for CSS, PMS & One-Paper Preparation 0315 777 3680 www.studyriver.com