<?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 2023 - Computer Science				            </title>
            <link>https://cssforum.net/group-i-papers-computer-science/css-computer-science-paper-2023/</link>
            <description>CSS Forum Discussion Board</description>
            <language>en-US</language>
            <lastBuildDate>Sat, 15 Aug 2026 13:00:47 +0000</lastBuildDate>
            <generator>wpForo</generator>
            <ttl>60</ttl>
							                    <item>
                        <title>CSS Computer Science Paper 2023</title>
                        <link>https://cssforum.net/group-i-papers-computer-science/css-computer-science-paper-2023/#post-81355</link>
                        <pubDate>Sat, 15 Aug 2026 11:59:28 +0000</pubDate>
                        <description><![CDATA[FEDERAL PUBLIC SERVICE COMMISSIONCOMPETITIVE EXAMINATION FOR RECRUITMENT TO POSTSIN BPS-17 UNDER THE FEDERAL GOVERNMENT, 2023
COMPUTER SCIENCE, PAPER-II
TIME ALLOWED: THREE HOURS
PART-I (...]]></description>
                        <content:encoded><![CDATA[<p 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, 2023</strong></span></p>
<p class="PDq2pG_selectionAnchorContainer" style="text-align: center" data-start="445" data-end="475"><span style="font-size: 14pt"><strong data-start="445" data-end="475">COMPUTER SCIENCE, PAPER-II</strong></span><span class="PDq2pG_selectionAnchor" aria-hidden="true"></span></p>
<p data-start="477" data-end="506"><strong data-start="477" data-end="506">TIME ALLOWED: THREE HOURS</strong></p>
<p data-start="508" data-end="545"><strong data-start="508" data-end="545">PART-I (MCQS): MAXIMUM 30 MINUTES</strong></p>
<p data-start="547" data-end="583"><strong data-start="547" data-end="583">PART-I (MCQS) MAXIMUM MARKS = 20</strong></p>
<p data-start="585" data-end="615"><strong data-start="585" data-end="615">PART-II MAXIMUM MARKS = 80</strong></p>
<h3 data-section-id="ynfaae" data-start="617" data-end="625">NOTE</h3>
<p data-start="627" data-end="686">(i) Part-II is to be attempted on the separate Answer Book.</p>
<p data-start="688" data-end="820">(ii) Attempt <strong data-start="701" data-end="724">ONLY FOUR questions</strong> from PART-II by selecting <strong data-start="751" data-end="786">TWO questions from EACH SECTION</strong>. All questions carry equal marks.</p>
<p data-start="822" data-end="917">(iii) All parts of each question must be attempted at one place instead of at different places.</p>
<p data-start="919" data-end="1039">(iv) Candidate must write the question number in the Answer Book according to the question number in the question paper.</p>
<p data-start="1041" data-end="1155">(v) No page or space should be left blank between the answers. All blank pages of the Answer Book must be crossed.</p>
<p data-start="1157" data-end="1290">(vi) Extra attempt of any question or any part of an attempted question will not be considered. <span class="contents" data-content-reference-start="1233" data-content-reference-end="1250"><span class="" data-state="closed"></span></span></p>
<div style="text-align: center" data-section-id="1yvqorg" data-start="1292" data-end="1301"><strong><span style="font-size: 14pt">PART-II</span></strong></div>
<div style="text-align: center" data-section-id="brfn28" data-start="1303" data-end="1315"><strong><span style="font-size: 14pt">SECTION-A</span></strong></div>
<h3 data-section-id="ynro23" data-start="1317" data-end="1325">Q. 2</h3>
<p data-start="1327" data-end="1501"><strong data-start="1327" data-end="1334">(a)</strong> Suggest reasons why <strong data-start="1355" data-end="1363">RAMs</strong> have traditionally been organized as only one bit per chip, whereas <strong data-start="1432" data-end="1440">ROMs</strong> are generally organized with multiple bits per chip. <strong data-start="1494" data-end="1501">(7)</strong></p>
<p data-start="1503" data-end="1679"><strong data-start="1503" data-end="1510">(b)</strong> Consider a dynamic RAM that requires a refresh cycle <strong data-start="1564" data-end="1592">64 times per millisecond</strong>. Each refresh operation requires <strong data-start="1626" data-end="1636">150 ns</strong>, while a memory cycle requires <strong data-start="1668" data-end="1678">250 ns</strong>.</p>
<p data-start="1681" data-end="1794">Calculate what <strong data-start="1696" data-end="1747">percentage of the memory's total operating time</strong> must be devoted to refresh operations. <strong data-start="1787" data-end="1794">(7)</strong></p>
<p data-start="1796" data-end="1864"><strong data-start="1796" data-end="1803">(c)</strong> In the context of <strong data-start="1822" data-end="1830">RAID</strong>, explain the distinction between:</p>
<ul data-start="1866" data-end="1904">
<li data-section-id="ha5hjb" data-start="1866" data-end="1883">Parallel access</li>
<li data-section-id="142kpii" data-start="1884" data-end="1904">Independent access</li>
</ul>
<p data-start="1906" data-end="1951"><strong data-start="1906" data-end="1913">(6)</strong> <span class="contents" data-content-reference-start="1874" data-content-reference-end="1891"><span class="" data-state="closed"></span></span></p>
<h3 data-section-id="ynro22" data-start="1953" data-end="1961">Q. 3</h3>
<p data-start="1963" data-end="2230"><strong data-start="1963" data-end="1970">(a)</strong> The CPU of a router can process <strong data-start="2003" data-end="2035">2 million packets per second</strong>, while the offered load is <strong data-start="2063" data-end="2097">1.5 million packets per second</strong>. If a route from source to destination contains <strong data-start="2146" data-end="2160">10 routers</strong>, calculate the total time spent in queuing and CPU servicing. <strong data-start="2223" data-end="2230">(7)</strong></p>
<p data-start="2232" data-end="2319"><strong data-start="2232" data-end="2239">(b)</strong> An IP datagram using the <strong data-start="2265" data-end="2297">strict source-routing option</strong> has to be fragmented.</p>
<p data-start="2321" data-end="2444">Should the source-routing option be copied into every fragment, or is it sufficient to place it only in the first fragment?</p>
<p data-start="2446" data-end="2474">Explain your answer. <strong data-start="2467" data-end="2474">(7)</strong></p>
<p data-start="2476" data-end="2489"><strong data-start="2476" data-end="2483">(c)</strong> Give:</p>
<ul data-start="2491" data-end="2650">
<li data-section-id="om8wfe" data-start="2491" data-end="2584">Two examples of computer applications where <strong data-start="2537" data-end="2568">connection-oriented service</strong> is appropriate.</li>
<li data-section-id="a164tc" data-start="2585" data-end="2650">Two examples where <strong data-start="2606" data-end="2632">connectionless service</strong> is more suitable.</li>
</ul>
<p data-start="2652" data-end="2697"><strong data-start="2652" data-end="2659">(6)</strong> <span class="contents" data-content-reference-start="2600" data-content-reference-end="2617"><span class="" data-state="closed"></span></span></p>
<h3 data-section-id="ynro25" data-start="2699" data-end="2707">Q. 4</h3>
<p data-start="2709" data-end="2797"><strong data-start="2709" data-end="2716">(a)</strong> A 32-bit computer has <strong data-start="2739" data-end="2764">two selector channels</strong> and <strong data-start="2769" data-end="2796">one multiplexor channel</strong>.</p>
<p data-start="2799" data-end="2830">Each selector channel supports:</p>
<ul data-start="2832" data-end="2883">
<li data-section-id="jpefju" data-start="2832" data-end="2857">Two magnetic disk units</li>
<li data-section-id="o2kcen" data-start="2858" data-end="2883">Two magnetic tape units</li>
</ul>
<p data-start="2885" data-end="2913">The multiplexor channel has:</p>
<ul data-start="2915" data-end="2973">
<li data-section-id="uzlx6n" data-start="2915" data-end="2934">Two line printers</li>
<li data-section-id="1dub3dy" data-start="2935" data-end="2953">Two card readers</li>
<li data-section-id="1u0933a" data-start="2954" data-end="2973">Ten VDT terminals</li>
</ul>
<p data-start="2975" data-end="3006">The assumed transfer rates are:</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="3008" data-end="3197">
<thead data-start="3008" data-end="3034">
<tr data-start="3008" data-end="3034">
<th class="last:pe-10" data-start="3008" data-end="3017" data-col-size="sm">Device</th>
<th class="last:pe-10" data-start="3017" data-end="3034" data-col-size="sm">Transfer Rate</th>
</tr>
</thead>
<tbody data-start="3046" data-end="3197">
<tr data-start="3046" data-end="3075">
<td data-start="3046" data-end="3059" data-col-size="sm">Disk drive</td>
<td data-start="3059" data-end="3075" data-col-size="sm">800 Kbytes/s</td>
</tr>
<tr data-start="3076" data-end="3114">
<td data-start="3076" data-end="3098" data-col-size="sm">Magnetic tape drive</td>
<td data-start="3098" data-end="3114" data-col-size="sm">200 Kbytes/s</td>
</tr>
<tr data-start="3115" data-end="3146">
<td data-start="3115" data-end="3130" data-col-size="sm">Line printer</td>
<td data-start="3130" data-end="3146" data-col-size="sm">6.6 Kbytes/s</td>
</tr>
<tr data-start="3147" data-end="3177">
<td data-start="3147" data-end="3161" data-col-size="sm">Card reader</td>
<td data-start="3161" data-end="3177" data-col-size="sm">1.2 Kbytes/s</td>
</tr>
<tr data-start="3178" data-end="3197">
<td data-start="3178" data-end="3184" data-col-size="sm">VDT</td>
<td data-start="3184" data-end="3197" data-col-size="sm">1 Kbyte/s</td>
</tr>
</tbody>
</table>
</div>
</div>
<p data-start="3199" data-end="3275">Estimate the <strong data-start="3212" data-end="3251">maximum aggregate I/O transfer rate</strong> of the system. <strong data-start="3267" data-end="3275">(12)</strong></p>
<p data-start="3277" data-end="3395"><strong data-start="3277" data-end="3284">(b)</strong> Consider a program that accesses a single I/O device. Compare <strong data-start="3347" data-end="3365">unbuffered I/O</strong> with the use of a <strong data-start="3384" data-end="3394">buffer</strong>.</p>
<p data-start="3397" data-end="3523">Show that using a buffer can reduce the running time by at most a factor of two. <strong data-start="3478" data-end="3485">(8)</strong> <span class="contents" data-content-reference-start="3406" data-content-reference-end="3423"><span class="" data-state="closed"></span></span></p>
<h3 data-section-id="ynro24" data-start="3525" data-end="3533">Q. 5</h3>
<p data-start="3535" data-end="3716"><strong data-start="3535" data-end="3542">(a)</strong> An <strong data-start="3546" data-end="3567">I/O-bound program</strong> spends more time waiting for I/O than using the processor when running alone, whereas a <strong data-start="3656" data-end="3683">processor-bound program</strong> has the opposite characteristic.</p>
<p data-start="3718" data-end="3832">Suppose a short-term scheduling algorithm favors programs that have used little processor time in the recent past.</p>
<p data-start="3834" data-end="3994">Explain why this algorithm favors <strong data-start="3868" data-end="3890">I/O-bound programs</strong>, while still ensuring that processor-bound programs are not permanently denied processor time. <strong data-start="3986" data-end="3994">(10)</strong></p>
<p data-start="3996" data-end="4147"><strong data-start="3996" data-end="4003">(b)</strong> Originally, a Class B address used <strong data-start="4039" data-end="4074">16 bits for the network portion</strong>. Suppose instead that <strong data-start="4097" data-end="4108">20 bits</strong> had been used for the network portion.</p>
<p data-start="4149" data-end="4205">How many Class B networks would there have been? <strong data-start="4198" data-end="4205">(5)</strong></p>
<p data-start="4207" data-end="4247"><strong data-start="4207" data-end="4214">(c)</strong> Explain the distinction between:</p>
<ul data-start="4249" data-end="4302">
<li data-section-id="1af8z3r" data-start="4249" data-end="4280">Instruction-level parallelism</li>
<li data-section-id="2s3xtd" data-start="4281" data-end="4302">Machine parallelism</li>
</ul>
<p data-start="4304" data-end="4349"><strong data-start="4304" data-end="4311">(5)</strong> <span class="contents" data-content-reference-start="4212" data-content-reference-end="4229"><span class="" data-state="closed"></span></span></p>
<h1 style="text-align: center" data-section-id="1ap2z34" data-start="4351" data-end="4362"><span style="font-size: 14pt">SECTION-B</span></h1>
<h3 data-section-id="ynro27" data-start="4364" data-end="4372">Q. 6</h3>
<p data-start="4374" data-end="4499"><strong data-start="4374" data-end="4381">(a)</strong> Explain the following <strong data-start="4404" data-end="4442">SELECT statement search conditions</strong> with examples, using any database schema of your choice:</p>
<ol data-start="4501" data-end="4700">
<li data-section-id="1m3inb3" data-start="4501" data-end="4540">Compound comparison search condition</li>
<li data-section-id="yb61w5" data-start="4541" data-end="4592">Range search condition — <code data-start="4569" data-end="4592">BETWEEN / NOT BETWEEN</code></li>
<li data-section-id="i0j0cb" data-start="4593" data-end="4643">Set membership search condition — <code data-start="4630" data-end="4643">IN / NOT IN</code></li>
<li data-section-id="zhwl3" data-start="4644" data-end="4700">Pattern matching search condition — <code data-start="4683" data-end="4700">LIKE / NOT LIKE</code></li>
</ol>
<p data-start="4702" data-end="4710"><strong data-start="4702" data-end="4710">(12)</strong></p>
<p data-start="4712" data-end="4786"><strong data-start="4712" data-end="4719">(b)</strong> Explain the <strong data-start="4732" data-end="4751">ACID properties</strong> of a database transaction. <strong data-start="4779" data-end="4786">(4)</strong></p>
<p data-start="4788" data-end="4900"><strong data-start="4788" data-end="4795">(c)</strong> Explain <strong data-start="4804" data-end="4829">transitive dependency</strong> with a suitable example. <strong data-start="4855" data-end="4862">(4)</strong> <span class="contents" data-content-reference-start="4743" data-content-reference-end="4760"><span class="" data-state="closed"></span></span></p>
<h3 data-section-id="ynro26" data-start="4902" data-end="4910">Q. 7</h3>
<p data-start="4912" data-end="5082"><strong data-start="4912" data-end="4919">(a)</strong> A common measure of digital-data transmission is the <strong data-start="4973" data-end="4986">baud rate</strong>, defined here as the number of bits transmitted per second. Transmission generally consists of:</p>
<ul data-start="5084" data-end="5149">
<li data-section-id="6h39v" data-start="5084" data-end="5099">One start bit</li>
<li data-section-id="16yw3g6" data-start="5100" data-end="5134">One byte (8 bits) of information</li>
<li data-section-id="1uvp7sb" data-start="5135" data-end="5149">One stop bit</li>
</ul>
<p data-start="5151" data-end="5180">Using these facts, calculate:</p>
<p data-start="5182" data-end="5314"><strong data-start="5182" data-end="5189">(i)</strong> How many minutes would be required to transmit a <strong data-start="5239" data-end="5286">1024 × 1024 image with 256 intensity levels</strong> using a <strong data-start="5295" data-end="5313">56K baud modem</strong>?</p>
<p data-start="5316" data-end="5420"><strong data-start="5316" data-end="5324">(ii)</strong> What would the transmission time be at <strong data-start="5364" data-end="5377">750K baud</strong>, representative of a phone DSL connection?</p>
<p data-start="5422" data-end="5430"><strong data-start="5422" data-end="5430">(10)</strong></p>
<p data-start="5432" data-end="5550"><strong data-start="5432" data-end="5439">(b)</strong> What effect would setting the <strong data-start="5470" data-end="5504">lower-order bit planes to zero</strong> generally have on an image histogram? <strong data-start="5543" data-end="5550">(5)</strong></p>
<p data-start="5552" data-end="5700"><strong data-start="5552" data-end="5559">(c)</strong> What would be the effect on the histogram if the <strong data-start="5609" data-end="5653">higher-order bit planes were set to zero</strong>? <strong data-start="5655" data-end="5662">(5)</strong> <span class="contents" data-content-reference-start="5523" data-content-reference-end="5540"><span class="" data-state="closed"></span></span></p>
<h3 data-section-id="ynro1t" data-start="5702" data-end="5710">Q. 8</h3>
<p data-start="5712" data-end="5794"><strong data-start="5712" data-end="5719">(a)</strong> Explain how <strong data-start="5732" data-end="5768">Search Engine Optimization (SEO)</strong> improves website traffic.</p>
<p data-start="5796" data-end="5856">Provide proper reasons and suitable coding examples. <strong data-start="5849" data-end="5856">(8)</strong></p>
<p data-start="5858" data-end="6003"><strong data-start="5858" data-end="5865">(b)</strong> Suppose a web development team is going to make a contract with a customer and needs to estimate the <strong data-start="5967" data-end="6002">cost of application development</strong>.</p>
<p data-start="6005" data-end="6104">Discuss the pricing factors that should be considered when estimating the development cost. <strong data-start="6097" data-end="6104">(8)</strong></p>
<p data-start="6106" data-end="6166"><strong data-start="6106" data-end="6113">(c)</strong> Write <strong data-start="6120" data-end="6135">jQuery code</strong> to slide elements up and down.</p>
<hr />
<p data-start="6106" data-end="6166"><span style="font-size: 14pt"><strong><a href="https://hostnezt.com/cssfiles/csspastpapers/computer/Computer%20Science%202023.pdf" target="_blank" rel="noopener">DOWNLOAD NOW</a></strong></span></p>]]></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-2023/#post-81355</guid>
                    </item>
							        </channel>
        </rss>
		