<?xml version="1.0" encoding="UTF-8"?>        <rss version="2.0"
             xmlns:atom="http://www.w3.org/2005/Atom"
             xmlns:dc="http://purl.org/dc/elements/1.1/"
             xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
             xmlns:admin="http://webns.net/mvcb/"
             xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
             xmlns:content="http://purl.org/rss/1.0/modules/content/">
        <channel>
            <title>
									CSS Computer Science Paper 2017 - Computer Science				            </title>
            <link>https://cssforum.net/group-i-papers-computer-science/css-computer-science-paper-2017/</link>
            <description>CSS Forum Discussion Board</description>
            <language>en-US</language>
            <lastBuildDate>Sat, 15 Aug 2026 11:27:26 +0000</lastBuildDate>
            <generator>wpForo</generator>
            <ttl>60</ttl>
							                    <item>
                        <title>CSS Computer Science Paper 2017</title>
                        <link>https://cssforum.net/group-i-papers-computer-science/css-computer-science-paper-2017/#post-81334</link>
                        <pubDate>Sat, 15 Aug 2026 10:21:48 +0000</pubDate>
                        <description><![CDATA[FEDERAL PUBLIC SERVICE COMMISSIONCOMPETITIVE EXAMINATION FOR RECRUITMENT TO POSTSIN BPS-17 UNDER THE FEDERAL GOVERNMENT, 2017
 
 

COMPUTER SCIENCE, PAPER-I
TIME ALLOWED: THREE HOURSPAR...]]></description>
                        <content:encoded><![CDATA[<div style="text-align: center"><span style="font-size: 14pt"><strong>FEDERAL PUBLIC SERVICE COMMISSION</strong></span><br /><span style="font-size: 14pt"><strong>COMPETITIVE EXAMINATION FOR RECRUITMENT TO POSTS</strong></span><br /><span style="font-size: 14pt"><strong>IN BPS-17 UNDER THE FEDERAL GOVERNMENT, 2017</strong></span></div>
<div> </div>
<div style="text-align: left"> </div>
<div>
<p class="PDq2pG_selectionAnchorContainer" style="text-align: center" data-start="186" data-end="215"><span style="font-size: 14pt"><strong data-start="186" data-end="215">COMPUTER SCIENCE, PAPER-I</strong></span><span class="PDq2pG_selectionAnchor" aria-hidden="true"></span></p>
<p data-start="217" data-end="358"><strong data-start="217" data-end="246">TIME ALLOWED: THREE HOURS</strong><br data-start="246" data-end="249" /><strong data-start="249" data-end="286">PART-I (MCQS): MAXIMUM 30 MINUTES</strong><br data-start="286" data-end="289" /><strong data-start="289" data-end="325">PART-I (MCQS) MAXIMUM MARKS = 20</strong><br data-start="325" data-end="328" /><strong data-start="328" data-end="358">PART-II MAXIMUM MARKS = 80</strong></p>
<p data-start="360" data-end="369"><strong data-start="360" data-end="369">NOTE:</strong></p>
<p data-start="371" data-end="430">(i) Part-II is to be attempted on the separate Answer Book.</p>
<p data-start="432" data-end="523">(ii) Attempt ONLY FOUR questions from PART-II by selecting TWO questions from EACH SECTION.</p>
<p data-start="525" data-end="633">(iii) All the parts (if any) of each Question must be attempted at one place instead of at different places.</p>
<p data-start="635" data-end="728">(iv) Candidate must write Q. No. in the Answer Book in accordance with Q. No. in the Q.Paper.</p>
<p data-start="730" data-end="834">(v) No Page/Space be left blank between the answers. All the blank pages of Answer Book must be crossed.</p>
<p data-start="836" data-end="932">(vi) Extra attempt of any question or any part of the attempted question will not be considered.</p>
<h3 style="text-align: center" data-section-id="spyozg" data-start="934" data-end="945"><span style="font-size: 14pt">PART-II</span></h3>
<h3 style="text-align: center" data-section-id="9i2097" data-start="947" data-end="960"><span style="font-size: 14pt">SECTION-I</span></h3>
<p data-start="962" data-end="971"><strong data-start="962" data-end="971">Q. 2.</strong></p>
<p data-start="973" data-end="1201"><strong data-start="973" data-end="980">(a)</strong> The internet era has given rise to the problem of cybercrimes. Given the need to maintain privacy which is an ethical responsibility of the government, what technical means would you suggest to curb this problem? <strong data-start="1194" data-end="1201">(8)</strong></p>
<p data-start="1203" data-end="1364"><strong data-start="1203" data-end="1210">(b)</strong> Describe the difference between Harvard and Von-Neumann architectures of computers. Also discuss their traits in the light of their capabilities. <strong data-start="1357" data-end="1364">(6)</strong></p>
<p data-start="1366" data-end="1612"><strong data-start="1366" data-end="1373">(c)</strong> Virtual memory is used by the computer to support the running of heavy applications. Describe the functioning of virtual memory in the computer. Also comment on the management of virtual and physical memory by an operating system. <strong data-start="1605" data-end="1612">(6)</strong></p>
<p data-start="1614" data-end="1623"><strong data-start="1614" data-end="1623">Q. 3.</strong></p>
<p data-start="1625" data-end="1891"><strong data-start="1625" data-end="1632">(a)</strong> Three types of languages exist for use in programming of computers, Machine, Low Level and High Level languages. Elucidate on these three types, giving details of the conversion process between Low Level and High Level language into Machine language. <strong data-start="1884" data-end="1891">(8)</strong></p>
<p data-start="1893" data-end="2197"><strong data-start="1893" data-end="1900">(b)</strong> Write a function that calculates the quadratic equation in . You may use the math library for this purpose. The program should ask the user to enter values of a, b and c and should print the result. A sample execution of the program is shown below:</p>
<p data-start="2199" data-end="2264">Enter value of a: 1<br data-start="2218" data-end="2221" />Enter value of b: 2<br data-start="2240" data-end="2243" />Enter value of c: 1</p>
<p data-start="2266" data-end="2300">The values of x are -1, -1 <strong data-start="2293" data-end="2300">(6)</strong></p>
<p data-start="2302" data-end="2844"><strong data-start="2302" data-end="2309">(c)</strong> Consider that you are required to create a program for a supermarket checkout machine. The machine has a database of the items available in the supermarket which consists of the items name, code and price. Make a program that requires the cashier (user) to enter the code or name of the product and the quantity that has been bought. It should allow for multiple entries to be made. Once all the entries have been made. The program prints the total amount to be charged on the screen. A sample execution of the program is shown below:</p>
<p data-start="2846" data-end="2965">Enter product name or code: 1<br data-start="2875" data-end="2878" />Enter quantity: 1<br data-start="2895" data-end="2898" />Do you have more products to add (Y/N): N<br data-start="2939" data-end="2942" />The total amount is 500</p>
<p data-start="2967" data-end="3021">You may construct the database as a structure. <strong data-start="3014" data-end="3021">(6)</strong></p>
<p data-start="3023" data-end="3032"><strong data-start="3023" data-end="3032">Q. 4.</strong></p>
<p data-start="3034" data-end="3281"><strong data-start="3034" data-end="3041">(a)</strong> What factors should be considered when choosing particularly between evolutionary and incremental models? Elucidate the characteristics of Rapid Application Development, Joint Application Development and Agile Software Engineering. <strong data-start="3274" data-end="3281">(8)</strong></p>
<p data-start="3283" data-end="3429"><strong data-start="3283" data-end="3290">(b)</strong> Differentiate between Software Validation and Verification. Discuss some of the techniques used for empirical software evaluation. <strong data-start="3422" data-end="3429">(6)</strong></p>
<p data-start="3431" data-end="3593"><strong data-start="3431" data-end="3438">(c)</strong> Discuss the importance of Requirements Engineering in the success of a software project. Explain in detail the process of ‘Requirements Sign-off’. <strong data-start="3586" data-end="3593">(6)</strong></p>
<p data-start="3595" data-end="3604"><strong data-start="3595" data-end="3604">Q. 5.</strong></p>
<p data-start="3606" data-end="3788"><strong data-start="3606" data-end="3613">(a)</strong> Draw and build a Red-black tree for the following keys (50, 60, 70, 80, 90) and (50, 40, 30, 20, 10). Would a binary tree be suitable for the insertion of these keys? <strong data-start="3781" data-end="3788">(8)</strong></p>
<p data-start="3790" data-end="3935"><strong data-start="3790" data-end="3797">(b)</strong> Hash tables enable for fast insertion and searching within the database. Describe the process of hashing with a suitable example. <strong data-start="3928" data-end="3935">(6)</strong></p>
<p data-start="3937" data-end="4105"><strong data-start="3937" data-end="3944">(c)</strong> Describe the process of Bubble Sorting. Write down the output after each pass of the Bubble Sort algorithm for sorting the sequence (3, 8, 2, 6, 1, 10). <strong data-start="4098" data-end="4105">(6)</strong></p>
<h3 style="text-align: center" data-section-id="tfe0ki" data-start="4107" data-end="4121">SECTION-II</h3>
<p data-start="4123" data-end="4132"><strong data-start="4123" data-end="4132">Q. 6.</strong></p>
<p data-start="4134" data-end="4409"><strong data-start="4134" data-end="4141">(a)</strong> The design methodologies of programs can have multiple approaches including the Big Bang, Code and Fix, Water Fall and the Spiral Model. Consider a test application and describe the development of the application while following each of these four approaches. <strong data-start="4402" data-end="4409">(8)</strong></p>
<p data-start="4411" data-end="4536"><strong data-start="4411" data-end="4418">(b)</strong> Discuss the design issues of Task Partitioning and Task Allocation in Distributed Software Engineering tasks. <strong data-start="4529" data-end="4536">(6)</strong></p>
<p data-start="4538" data-end="4710"><strong data-start="4538" data-end="4545">(c)</strong> Explain the importance of Design Patterns under the umbrella of Agile software design and programming. Explain Software Testing and different methodologies. <strong data-start="4703" data-end="4710">(6)</strong></p>
<p data-start="4712" data-end="4721"><strong data-start="4712" data-end="4721">Q. 7.</strong></p>
<p data-start="4723" data-end="4849"><strong data-start="4723" data-end="4730">(a)</strong> The handling of syntax errors involves the use of parser and the lexical analyzer. Comment on its functioning. <strong data-start="4842" data-end="4849">(8)</strong></p>
<p data-start="4851" data-end="4967"><strong data-start="4851" data-end="4858">(b)</strong> Using a suitable example, compare the operation of a top-down and a bottom-up Parser based compiler. <strong data-start="4960" data-end="4967">(6)</strong></p>
<p data-start="4969" data-end="5121"><strong data-start="4969" data-end="4976">(c)</strong> Explain the two different methods of code optimization that is Loop optimization and Peephole optimization by giving a suitable example. <strong data-start="5114" data-end="5121">(6)</strong></p>
<p data-start="5123" data-end="5132"><strong data-start="5123" data-end="5132">Q. 8.</strong></p>
<p data-start="5134" data-end="5198">Write short notes on <strong data-start="5155" data-end="5167">any FOUR</strong> of the following: <strong data-start="5186" data-end="5198">(5 each)</strong></p>
<p data-start="5200" data-end="5269"><strong data-start="5200" data-end="5207">(a)</strong> Global, Local and shared variables for nested function access</p>
<p data-start="5271" data-end="5321"><strong data-start="5271" data-end="5278">(b)</strong> Protecting IP rights in the digital domain</p>
<p data-start="5323" data-end="5393"><strong data-start="5323" data-end="5330">(c)</strong> Parallel processing and the use of pipelining for this purpose</p>
<p data-start="5395" data-end="5447"><strong data-start="5395" data-end="5402">(d)</strong> Resource allocation during runtime processes</p>
<p data-start="5449" data-end="5485"><strong data-start="5449" data-end="5456">(e)</strong> Intermediate Code Generation</p>
<p data-start="5487" data-end="5524"><strong data-start="5487" data-end="5494">(f)</strong> Searching Algorithms <strong data-start="5516" data-end="5524">(20)</strong></p>
<h2 style="text-align: center" data-section-id="1479z9u" data-start="5547" data-end="5587"><span style="font-size: 14pt">COMPUTER SCIENCE, PAPER-II — CSS 2017</span></h2>
<p style="text-align: center" data-start="5589" data-end="5732"><span style="font-size: 14pt"><strong data-start="5589" data-end="5626">FEDERAL PUBLIC SERVICE COMMISSION</strong></span><br data-start="5626" data-end="5629" /><span style="font-size: 14pt"><strong data-start="5629" data-end="5663">COMPETITIVE EXAMINATION – 2017</strong></span><br data-start="5663" data-end="5666" /><span style="font-size: 14pt"><strong data-start="5666" data-end="5732">FOR RECRUITMENT TO POSTS IN BS-17 UNDER THE FEDERAL GOVERNMENT</strong></span></p>
<p data-start="5734" data-end="5764"><strong data-start="5734" data-end="5764">COMPUTER SCIENCE, PAPER-II</strong></p>
<p data-start="5766" data-end="5907"><strong data-start="5766" data-end="5795">TIME ALLOWED: THREE HOURS</strong><br data-start="5795" data-end="5798" /><strong data-start="5798" data-end="5835">PART-I (MCQS): MAXIMUM 30 MINUTES</strong><br data-start="5835" data-end="5838" /><strong data-start="5838" data-end="5874">PART-I (MCQS) MAXIMUM MARKS = 20</strong><br data-start="5874" data-end="5877" /><strong data-start="5877" data-end="5907">PART-II MAXIMUM MARKS = 80</strong></p>
<p data-start="5909" data-end="5918"><strong data-start="5909" data-end="5918">NOTE:</strong></p>
<p data-start="5920" data-end="5979">(i) Part-II is to be attempted on the separate Answer Book.</p>
<p data-start="5981" data-end="6105">(ii) Attempt ONLY FOUR questions from PART-II by selecting TWO questions from EACH SECTION. ALL questions carry EQUAL marks.</p>
<p data-start="6107" data-end="6215">(iii) All the parts (if any) of each Question must be attempted at one place instead of at different places.</p>
<p data-start="6217" data-end="6310">(iv) Candidate must write Q. No. in the Answer Book in accordance with Q. No. in the Q.Paper.</p>
<p data-start="6312" data-end="6416">(v) No Page/Space be left blank between the answers. All the blank pages of Answer Book must be crossed.</p>
<p data-start="6418" data-end="6514">(vi) Extra attempt of any question or any part of the attempted question will not be considered.</p>
<h3 style="text-align: center" data-section-id="spyozg" data-start="6516" data-end="6527"><span style="font-size: 14pt">PART-II</span></h3>
<h3 style="text-align: center" data-section-id="9i208z" data-start="6529" data-end="6542"><span style="font-size: 14pt">SECTION-A</span></h3>
<p data-start="6544" data-end="6553"><strong data-start="6544" data-end="6553">Q. 2.</strong></p>
<p data-start="6555" data-end="6612"><strong data-start="6555" data-end="6562">(a)</strong> Discuss the following methods of storage systems:</p>
<p data-start="6614" data-end="6668"><strong data-start="6614" data-end="6621">(i)</strong> Direct Access<br data-start="6635" data-end="6638" /><strong data-start="6638" data-end="6646">(ii)</strong> Random Access <strong data-start="6661" data-end="6668">(8)</strong></p>
<p data-start="6670" data-end="6810"><strong data-start="6670" data-end="6677">(b)</strong> If clock speed reaches its maximum then what are the two methods to increase the performance of a computer? Briefly explain. <strong data-start="6803" data-end="6810">(6)</strong></p>
<p data-start="6812" data-end="6896"><strong data-start="6812" data-end="6819">(c)</strong> Draw and explain instruction execution state diagram with interrupt. <strong data-start="6889" data-end="6896">(6)</strong></p>
<p data-start="6898" data-end="6907"><strong data-start="6898" data-end="6907">Q. 3.</strong></p>
<p data-start="6909" data-end="6957"><strong data-start="6909" data-end="6916">(a)</strong> Explain the following network protocols:</p>
<p data-start="6959" data-end="7010"><strong data-start="6959" data-end="6966">(i)</strong> HTTP and SIP<br data-start="6979" data-end="6982" /><strong data-start="6982" data-end="6990">(ii)</strong> TCP and UDP <strong data-start="7003" data-end="7010">(8)</strong></p>
<p data-start="7012" data-end="7180"><strong data-start="7012" data-end="7019">(b)</strong> What is the transmission time of a packet sent by a station if the length of the packet is 1 million bytes and the bandwidth of the channel is 200 Kbps? <strong data-start="7173" data-end="7180">(6)</strong></p>
<p data-start="7182" data-end="7332"><strong data-start="7182" data-end="7189">(c)</strong> Given the IP address 10.5.118.3 and the network mask 255.255.240.0, what are the assignable IP addresses and broadcast in this subnet? <strong data-start="7325" data-end="7332">(6)</strong></p>
<p data-start="7334" data-end="7343"><strong data-start="7334" data-end="7343">Q. 4.</strong></p>
<p data-start="7345" data-end="7452"><strong data-start="7345" data-end="7352">(a)</strong> What are differences between Optimal &amp; LRU (Least Recently Used) page Replacement Policies? <strong data-start="7445" data-end="7452">(8)</strong></p>
<p data-start="7454" data-end="7575"><strong data-start="7454" data-end="7461">(b)</strong> Discuss the four necessary conditions for deadlock to occur. How can we deny any two of these conditions? <strong data-start="7568" data-end="7575">(6)</strong></p>
<p data-start="7577" data-end="7789"><strong data-start="7577" data-end="7584">(c)</strong> Consider three processes given in the table. Find average waiting time and average turnaround (completion) time when these processes are scheduled using Round-Robin scheduling using time quantum (TQ) = 4.</p>
<div class="group TyagGW_tableContainer">
<div class="TyagGW_tableWrapper flex flex-col-reverse w-fit">
<table class="w-fit min-w-(--thread-content-width)" data-start="7791" data-end="7860">
<thead data-start="7791" data-end="7814">
<tr data-start="7791" data-end="7814">
<th class="last:pe-10" data-start="7791" data-end="7801" data-col-size="sm">Process</th>
<th class="last:pe-10" data-start="7801" data-end="7814" data-col-size="sm">CPU Burst</th>
</tr>
</thead>
<tbody data-start="7826" data-end="7860">
<tr data-start="7826" data-end="7837">
<td data-start="7826" data-end="7831" data-col-size="sm">P1</td>
<td data-start="7831" data-end="7837" data-col-size="sm">24</td>
</tr>
<tr data-start="7838" data-end="7848">
<td data-start="7838" data-end="7843" data-col-size="sm">P2</td>
<td data-start="7843" data-end="7848" data-col-size="sm">7</td>
</tr>
<tr data-start="7849" data-end="7860">
<td data-start="7849" data-end="7854" data-col-size="sm">P3</td>
<td data-start="7854" data-end="7860" data-col-size="sm">10</td>
</tr>
</tbody>
</table>
</div>
</div>
<p data-start="7862" data-end="7869"><strong data-start="7862" data-end="7869">(6)</strong></p>
<p data-start="7871" data-end="7880"><strong data-start="7871" data-end="7880">Q. 5.</strong></p>
<p data-start="7882" data-end="7966"><strong data-start="7882" data-end="7889">(a)</strong> Explain the functionality and purposes of following registers with diagrams:</p>
<p data-start="7968" data-end="8091"><strong data-start="7968" data-end="7975">(i)</strong> Memory Address Register (MAR)<br data-start="8005" data-end="8008" /><strong data-start="8008" data-end="8016">(ii)</strong> Memory Buffer Register (MBR)<br data-start="8045" data-end="8048" /><strong data-start="8048" data-end="8057">(iii)</strong> Instruction Register (IR) <strong data-start="8084" data-end="8091">(8)</strong></p>
<p data-start="8093" data-end="8165"><strong data-start="8093" data-end="8100">(b)</strong> Discuss the functionality of Ethernet LAN and its types. <strong data-start="8158" data-end="8165">(6)</strong></p>
<p data-start="8167" data-end="8211"><strong data-start="8167" data-end="8174">(c)</strong> What happens in the following cases?</p>
<p data-start="8213" data-end="8278"><strong data-start="8213" data-end="8220">(i)</strong> If the job size is kept very low in time sharing systems.</p>
<p data-start="8280" data-end="8360"><strong data-start="8280" data-end="8288">(ii)</strong> If the page size is kept very small in paged memory management. <strong data-start="8353" data-end="8360">(6)</strong></p>
<h3 data-section-id="9i208w" data-start="8362" data-end="8375">SECTION-B</h3>
<p data-start="8377" data-end="8386"><strong data-start="8377" data-end="8386">Q. 6.</strong></p>
<p data-start="8388" data-end="8468"><strong data-start="8388" data-end="8395">(a)</strong> What is Normalization? Discuss 1NF, 2NF and 3NF with example(s). <strong data-start="8461" data-end="8468">(8)</strong></p>
<p data-start="8470" data-end="8513"><strong data-start="8470" data-end="8477">(b)</strong> Write short notes on the following:</p>
<p data-start="8515" data-end="8594"><strong data-start="8515" data-end="8522">(i)</strong> Data<br data-start="8527" data-end="8530" /><strong data-start="8530" data-end="8538">(ii)</strong> Database<br data-start="8547" data-end="8550" /><strong data-start="8550" data-end="8559">(iii)</strong> Database Management System <strong data-start="8587" data-end="8594">(6)</strong></p>
<p data-start="8596" data-end="8680"><strong data-start="8596" data-end="8603">(c)</strong> Differentiate between Centralized Database and Distributed Database. <strong data-start="8673" data-end="8680">(6)</strong></p>
<p data-start="8682" data-end="8691"><strong data-start="8682" data-end="8691">Q. 7.</strong></p>
<p data-start="8693" data-end="8821"><strong data-start="8693" data-end="8700">(a)</strong> Define image histogram. What is meant by histogram equalization? Explain their applications in image processing. <strong data-start="8814" data-end="8821">(8)</strong></p>
<p data-start="8823" data-end="8955"><strong data-start="8823" data-end="8830">(b)</strong> Find the storage in bytes required to store a 256 × 200 colored image using RGB color model with 24 bit color depth. <strong data-start="8948" data-end="8955">(6)</strong></p>
<p data-start="8957" data-end="9015"><strong data-start="8957" data-end="8964">(c)</strong> Briefly explain Geometric Transformations. <strong data-start="9008" data-end="9015">(6)</strong></p>
<p data-start="9017" data-end="9026"><strong data-start="9017" data-end="9026">Q. 8.</strong></p>
<p data-start="9028" data-end="9071"><strong data-start="9028" data-end="9035">(a)</strong> Explain the following web concepts:</p>
<p data-start="9073" data-end="9120"><strong data-start="9073" data-end="9080">(i)</strong> localStorage and sessionStorage objects</p>
<p data-start="9122" data-end="9157"><strong data-start="9122" data-end="9130">(ii)</strong> Application cache in HTML5</p>
<p data-start="9159" data-end="9182"><strong data-start="9159" data-end="9168">(iii)</strong> Manifest file</p>
<p data-start="9184" data-end="9211"><strong data-start="9184" data-end="9192">(iv)</strong> Web Worker <strong data-start="9204" data-end="9211">(8)</strong></p>
<p data-start="9213" data-end="9290"><strong data-start="9213" data-end="9220">(b)</strong> What is SVG? What are the advantages of SVG over JPEG or GIF? <strong data-start="9283" data-end="9290">(6)</strong></p>
<p data-start="9292" data-end="9356"><strong data-start="9292" data-end="9299">(c)</strong> Explain Non Breaking space in HTML with example. <strong data-start="9349" data-end="9356">(6)</strong></p>
<hr />
<p data-start="9292" data-end="9356"><strong><span style="font-size: 14pt"><a href="https://hostnezt.com/cssfiles/csspastpapers/computer/Computer%20Science%202017.pdf" target="_blank" rel="noopener">DOWNLOAD NOW </a></span></strong></p>
</div>]]></content:encoded>
						                            <category domain="https://cssforum.net/group-i-papers-computer-science/">Computer Science</category>                        <dc:creator>zarnishayat</dc:creator>
                        <guid isPermaLink="true">https://cssforum.net/group-i-papers-computer-science/css-computer-science-paper-2017/#post-81334</guid>
                    </item>
							        </channel>
        </rss>
		