<?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 2026 - Computer Science				            </title>
            <link>https://cssforum.net/group-i-papers-computer-science/css-computer-science-paper-2026/</link>
            <description>CSS Forum Discussion Board</description>
            <language>en-US</language>
            <lastBuildDate>Sat, 15 Aug 2026 13:23:07 +0000</lastBuildDate>
            <generator>wpForo</generator>
            <ttl>60</ttl>
							                    <item>
                        <title>CSS Computer Science Paper 2026</title>
                        <link>https://cssforum.net/group-i-papers-computer-science/css-computer-science-paper-2026/#post-81358</link>
                        <pubDate>Sat, 15 Aug 2026 12:20:52 +0000</pubDate>
                        <description><![CDATA[FEDERAL PUBLIC SERVICE COMMISSIONCOMPETITIVE EXAMINATION FOR RECRUITMENT TO POSTSIN BPS-17 UNDER THE FEDERAL GOVERNMENT, 2026
COMPUTER SCIENCE, PAPER-I
TIME ALLOWED: THREE HOURS
PART-I (M...]]></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, 2026</strong></span></p>
<p class="PDq2pG_selectionAnchorContainer" style="text-align: center" data-start="484" data-end="513"><span style="font-size: 14pt"><strong data-start="484" data-end="513">COMPUTER SCIENCE, PAPER-I</strong></span><span class="PDq2pG_selectionAnchor" aria-hidden="true"></span></p>
<p data-start="515" data-end="544"><strong data-start="515" data-end="544">TIME ALLOWED: THREE HOURS</strong></p>
<p data-start="546" data-end="583"><strong data-start="546" data-end="583">PART-I (MCQS): MAXIMUM 30 MINUTES</strong></p>
<p data-start="585" data-end="620"><strong data-start="585" data-end="620">PART-I (MCQS) MAXIMUM MARKS: 20</strong></p>
<p data-start="622" data-end="651"><strong data-start="622" data-end="651">PART-II MAXIMUM MARKS: 80</strong></p>
<h2 style="text-align: center" data-section-id="1mhanv2" data-start="653" data-end="669"><span style="font-size: 14pt">PART-I — MCQs</span></h2>
<p data-start="671" data-end="725"><strong data-start="671" data-end="725">Q. 1. Select the best option/answer. (20 × 1 = 20)</strong></p>
<ol data-start="727" data-end="2590">
<li data-section-id="1j1lcnd" data-start="727" data-end="959">
<p data-start="730" data-end="834">A company wants to upgrade its storage media for the fastest possible data access. Which option is best?</p>
<p data-start="839" data-end="959"><strong data-start="839" data-end="846">(A)</strong> Hard Disk Drive (HDD)<br data-start="868" data-end="871" /><strong data-start="874" data-end="881">(B)</strong> Optical Drive<br data-start="895" data-end="898" /><strong data-start="901" data-end="908">(C)</strong> Solid State Drive (SSD)<br data-start="932" data-end="935" /><strong data-start="938" data-end="945">(D)</strong> None of these</p>
</li>
<li data-section-id="9vsckz" data-start="961" data-end="1173">
<p data-start="964" data-end="1066">A programmer is developing software and needs to consider ethical challenges. What is a major concern?</p>
<p data-start="1071" data-end="1173"><strong data-start="1071" data-end="1078">(A)</strong> Data encryption<br data-start="1094" data-end="1097" /><strong data-start="1100" data-end="1107">(B)</strong> Plagiarism<br data-start="1118" data-end="1121" /><strong data-start="1124" data-end="1131">(C)</strong> User interface<br data-start="1146" data-end="1149" /><strong data-start="1152" data-end="1159">(D)</strong> None of these</p>
</li>
<li data-section-id="tqn3i" data-start="1175" data-end="1338">
<p data-start="1178" data-end="1248">A programmer wants to group different data types. What should be used?</p>
<p data-start="1253" data-end="1338"><strong data-start="1253" data-end="1260">(A)</strong> Structures<br data-start="1271" data-end="1274" /><strong data-start="1277" data-end="1284">(B)</strong> Arrays<br data-start="1291" data-end="1294" /><strong data-start="1297" data-end="1304">(C)</strong> Unions<br data-start="1311" data-end="1314" /><strong data-start="1317" data-end="1324">(D)</strong> None of these</p>
</li>
<li data-section-id="1kdl79k" data-start="1340" data-end="1538">
<p data-start="1343" data-end="1434">A class needs to allow different implementations of a method. Which concept should be used?</p>
<p data-start="1439" data-end="1538"><strong data-start="1439" data-end="1446">(A)</strong> Inheritance<br data-start="1458" data-end="1461" /><strong data-start="1464" data-end="1471">(B)</strong> Polymorphism<br data-start="1484" data-end="1487" /><strong data-start="1490" data-end="1497">(C)</strong> Encapsulation<br data-start="1511" data-end="1514" /><strong data-start="1517" data-end="1524">(D)</strong> None of these</p>
</li>
<li data-section-id="1l0u4dv" data-start="1540" data-end="1731">
<p data-start="1543" data-end="1605">What is the purpose of using virtual functions in inheritance?</p>
<p data-start="1610" data-end="1731"><strong data-start="1610" data-end="1617">(A)</strong> To prevent overriding<br data-start="1639" data-end="1642" /><strong data-start="1645" data-end="1652">(B)</strong> To hide members<br data-start="1668" data-end="1671" /><strong data-start="1674" data-end="1681">(C)</strong> To enable polymorphism<br data-start="1704" data-end="1707" /><strong data-start="1710" data-end="1717">(D)</strong> None of these</p>
</li>
<li data-section-id="rr0a4i" data-start="1733" data-end="1977">
<p data-start="1736" data-end="1809">How does the history of computing influence modern computer architecture?</p>
<p data-start="1814" data-end="1977"><strong data-start="1814" data-end="1821">(A)</strong> By dictating hardware design<br data-start="1850" data-end="1853" /><strong data-start="1856" data-end="1863">(B)</strong> By shaping software development<br data-start="1895" data-end="1898" /><strong data-start="1901" data-end="1908">(C)</strong> By influencing both hardware and software<br data-start="1950" data-end="1953" /><strong data-start="1956" data-end="1963">(D)</strong> None of these</p>
</li>
<li data-section-id="gpj1q7" data-start="1979" data-end="2161">
<p data-start="1982" data-end="2063">A function needs to modify an input variable. How should the parameter be passed?</p>
<p data-start="2068" data-end="2161"><strong data-start="2068" data-end="2075">(A)</strong> By value<br data-start="2084" data-end="2087" /><strong data-start="2090" data-end="2097">(B)</strong> By reference<br data-start="2110" data-end="2113" /><strong data-start="2116" data-end="2123">(C)</strong> By pointer<br data-start="2134" data-end="2137" /><strong data-start="2140" data-end="2147">(D)</strong> None of these</p>
</li>
<li data-section-id="49pg1j" data-start="2163" data-end="2379">
<p data-start="2166" data-end="2279">A developer wants to define a class with methods that can be used with different data types. What should be used?</p>
<p data-start="2284" data-end="2379"><strong data-start="2284" data-end="2291">(A)</strong> Templates<br data-start="2301" data-end="2304" /><strong data-start="2307" data-end="2314">(B)</strong> Inheritance<br data-start="2326" data-end="2329" /><strong data-start="2332" data-end="2339">(C)</strong> Polymorphism<br data-start="2352" data-end="2355" /><strong data-start="2358" data-end="2365">(D)</strong> None of these</p>
</li>
<li data-section-id="3lj68t" data-start="2381" data-end="2523">
<p data-start="2384" data-end="2444">Which operator is typically overloaded for stream insertion?</p>
<p data-start="2449" data-end="2523"><strong data-start="2449" data-end="2456">(A)</strong> <code data-start="2457" data-end="2461">&lt;&lt;</code><br data-start="2461" data-end="2464" /><strong data-start="2467" data-end="2474">(B)</strong> <code data-start="2475" data-end="2479">&gt;&gt;</code><br data-start="2479" data-end="2482" /><strong data-start="2485" data-end="2492">(C)</strong> <code data-start="2493" data-end="2496">+</code><br data-start="2496" data-end="2499" /><strong data-start="2502" data-end="2509">(D)</strong> None of these</p>
</li>
<li data-section-id="109z5de" data-start="2525" data-end="2590">What does the Standard Template Library (STL) provide in C++?</li>
</ol>
<p data-start="2595" data-end="2771"><strong data-start="2595" data-end="2602">(A)</strong> Pre-defined classes for GUI<br data-start="2630" data-end="2633" /><strong data-start="2636" data-end="2643">(B)</strong> Pre-defined functions for mathematical operations<br data-start="2693" data-end="2696" /><strong data-start="2699" data-end="2706">(C)</strong> Pre-defined containers and algorithms<br data-start="2744" data-end="2747" /><strong data-start="2750" data-end="2757">(D)</strong> None of these</p>
<ol start="11" data-start="2773" data-end="2845">
<li data-section-id="ndf7mo" data-start="2773" data-end="2845">When analyzing an algorithm's efficiency, what should be considered?</li>
</ol>
<p data-start="2850" data-end="2972"><strong data-start="2850" data-end="2857">(A)</strong> Code length<br data-start="2869" data-end="2872" /><strong data-start="2875" data-end="2882">(B)</strong> Time and space complexity<br data-start="2908" data-end="2911" /><strong data-start="2914" data-end="2921">(C)</strong> Programmer's experience<br data-start="2945" data-end="2948" /><strong data-start="2951" data-end="2958">(D)</strong> None of these</p>
<ol start="12" data-start="2974" data-end="3053">
<li data-section-id="1f9oqat" data-start="2974" data-end="3053">In Hash Tables, which of the following is a collision-resolution technique?</li>
</ol>
<p data-start="3058" data-end="3155"><strong data-start="3058" data-end="3065">(A)</strong> Linear Search<br data-start="3079" data-end="3082" /><strong data-start="3085" data-end="3092">(B)</strong> Binary Search<br data-start="3106" data-end="3109" /><strong data-start="3112" data-end="3119">(C)</strong> Chaining<br data-start="3128" data-end="3131" /><strong data-start="3134" data-end="3141">(D)</strong> None of these</p>
<ol start="13" data-start="3157" data-end="3221">
<li data-section-id="nm4pfp" data-start="3157" data-end="3221">In recursion, what is crucial to prevent infinite recursion?</li>
</ol>
<p data-start="3226" data-end="3322"><strong data-start="3226" data-end="3233">(A)</strong> Base case<br data-start="3243" data-end="3246" /><strong data-start="3249" data-end="3256">(B)</strong> Recursive call<br data-start="3271" data-end="3274" /><strong data-start="3277" data-end="3284">(C)</strong> Loop usage<br data-start="3295" data-end="3298" /><strong data-start="3301" data-end="3308">(D)</strong> None of these</p>
<ol start="14" data-start="3324" data-end="3417">
<li data-section-id="1jmawip" data-start="3324" data-end="3417">You are leading an Agile team developing a mobile application. What is the primary focus?</li>
</ol>
<p data-start="3422" data-end="3596"><strong data-start="3422" data-end="3429">(A)</strong> Detailed upfront planning<br data-start="3455" data-end="3458" /><strong data-start="3461" data-end="3468">(B)</strong> Strict adherence to initial requirements<br data-start="3509" data-end="3512" /><strong data-start="3515" data-end="3522">(C)</strong> Both (A) and (B)<br data-start="3539" data-end="3542" /><strong data-start="3545" data-end="3552">(D)</strong> Iterative development and customer feedback</p>
<ol start="15" data-start="3598" data-end="3671">
<li data-section-id="1m1cnex" data-start="3598" data-end="3671">A compiler needs to recognize tokens. Which phase performs this task?</li>
</ol>
<p data-start="3676" data-end="3785"><strong data-start="3676" data-end="3683">(A)</strong> Syntax Analysis<br data-start="3699" data-end="3702" /><strong data-start="3705" data-end="3712">(B)</strong> Lexical Analysis<br data-start="3729" data-end="3732" /><strong data-start="3735" data-end="3742">(C)</strong> Code Generation<br data-start="3758" data-end="3761" /><strong data-start="3764" data-end="3771">(D)</strong> None of these</p>
<ol start="16" data-start="3787" data-end="3856">
<li data-section-id="uipbfq" data-start="3787" data-end="3856">What is the advantage of using LL(1) grammars in syntax analysis?</li>
</ol>
<p data-start="3861" data-end="4008"><strong data-start="3861" data-end="3868">(A)</strong> More complex parsing<br data-start="3889" data-end="3892" /><strong data-start="3895" data-end="3902">(B)</strong> Predictive parsing with less complexity<br data-start="3942" data-end="3945" /><strong data-start="3948" data-end="3955">(C)</strong> No need for grammar rules<br data-start="3981" data-end="3984" /><strong data-start="3987" data-end="3994">(D)</strong> None of these</p>
<ol start="17" data-start="4010" data-end="4076">
<li data-section-id="169qru" data-start="4010" data-end="4076">What is the difference between Top-down and Bottom-up parsers?</li>
</ol>
<p data-start="4081" data-end="4237"><strong data-start="4081" data-end="4088">(A)</strong> Top-down is always faster<br data-start="4114" data-end="4117" /><strong data-start="4120" data-end="4127">(B)</strong> Bottom-up handles more grammars<br data-start="4159" data-end="4162" /><strong data-start="4165" data-end="4172">(C)</strong> Top-down starts from the start symbol<br data-start="4210" data-end="4213" /><strong data-start="4216" data-end="4223">(D)</strong> None of these</p>
<ol start="18" data-start="4239" data-end="4288">
<li data-section-id="17fqry5" data-start="4239" data-end="4288">What do compilers use for recognizing tokens?</li>
</ol>
<p data-start="4293" data-end="4408"><strong data-start="4293" data-end="4300">(A)</strong> Regular expressions<br data-start="4320" data-end="4323" /><strong data-start="4326" data-end="4333">(B)</strong> Context-free grammars<br data-start="4355" data-end="4358" /><strong data-start="4361" data-end="4368">(C)</strong> Machine code<br data-start="4381" data-end="4384" /><strong data-start="4387" data-end="4394">(D)</strong> None of these</p>
<ol start="19" data-start="4410" data-end="4483">
<li data-section-id="ooz7o7" data-start="4410" data-end="4483">An Agile project is behind schedule. What is a likely Agile response?</li>
</ol>
<p data-start="4488" data-end="4631"><strong data-start="4488" data-end="4495">(A)</strong> Add more developers<br data-start="4515" data-end="4518" /><strong data-start="4521" data-end="4528">(B)</strong> Work longer hours<br data-start="4546" data-end="4549" /><strong data-start="4552" data-end="4559">(C)</strong> Both (A) and (B)<br data-start="4576" data-end="4579" /><strong data-start="4582" data-end="4589">(D)</strong> Review scope and priorities with the team</p>
<ol start="20" data-start="4633" data-end="4733">
<li data-section-id="jqfbg6" data-start="4633" data-end="4733">A project is using open-source components containing security vulnerabilities. What is the risk?</li>
</ol>
<p data-start="4738" data-end="4915"><strong data-start="4738" data-end="4745">(A)</strong> Security breaches or compliance issues<br data-start="4784" data-end="4787" /><strong data-start="4790" data-end="4797">(B)</strong> Non-technical issues<br data-start="4818" data-end="4821" /><strong data-start="4824" data-end="4831">(C)</strong> Open-source issues<br data-start="4850" data-end="4853" /><strong data-start="4856" data-end="4863">(D)</strong> None of these <span class="contents" data-content-reference-start="4858" data-content-reference-end="4875"><span class="" data-state="closed"></span></span></p>
<h1 style="text-align: center" data-section-id="1yvqorg" data-start="4922" data-end="4931"><span style="font-size: 14pt">PART-II</span></h1>
<h3 data-section-id="ynfaae" data-start="4933" data-end="4941">NOTE</h3>
<p data-start="4943" data-end="5002">(i) Part-II is to be attempted on the separate Answer Book.</p>
<p data-start="5004" data-end="5136">(ii) Attempt <strong data-start="5017" data-end="5040">ONLY FOUR questions</strong> from Part-II by selecting <strong data-start="5067" data-end="5102">TWO questions from EACH SECTION</strong>. All questions carry equal marks.</p>
<p data-start="5138" data-end="5233">(iii) All parts of each question must be attempted at one place instead of at different places.</p>
<p data-start="5235" data-end="5317">(iv) Write the question number in the Answer Book according to the question paper.</p>
<p data-start="5319" data-end="5407">(v) No page/space should be left blank between answers. All blank pages must be crossed.</p>
<p data-start="5409" data-end="5533">(vi) Extra attempt of any question or any part of the question will not be considered. <span class="contents" data-content-reference-start="5456" data-content-reference-end="5473"><span class="" data-state="closed"></span></span></p>
<h1 style="text-align: center" data-section-id="1ap2z37" data-start="5535" data-end="5546"><span style="font-size: 14pt">SECTION-A</span></h1>
<h2 data-section-id="1xwc5uw" data-start="5548" data-end="5555">Q. 2</h2>
<p data-start="5557" data-end="5735"><strong data-start="5557" data-end="5564">(a)</strong> Your team needs to share large files quickly, but email has attachment-size limitations. What computing method should they use, and how will it solve the problem? <strong data-start="5728" data-end="5735">(6)</strong></p>
<p data-start="5737" data-end="5888"><strong data-start="5737" data-end="5744">(b)</strong> You receive an email asking for your banking details. What type of risk or security issue might this represent? How should you respond? <strong data-start="5881" data-end="5888">(6)</strong></p>
<p data-start="5890" data-end="6088"><strong data-start="5890" data-end="5897">(c)</strong> Your office plans to upgrade its hardware, but employees do not know which components matter. Which computer-hardware components would you explain to help them choose better systems? <strong data-start="6081" data-end="6088">(8)</strong></p>
<h2 data-section-id="1xwc5ux" data-start="6090" data-end="6097">Q. 3</h2>
<p data-start="6099" data-end="6209"><strong data-start="6099" data-end="6106">(a)</strong> What is <strong data-start="6115" data-end="6135">bit manipulation</strong> in programming, and why is it used? Give two examples of its use. <strong data-start="6202" data-end="6209">(6)</strong></p>
<p data-start="6211" data-end="6300"><strong data-start="6211" data-end="6218">(b)</strong> What are <strong data-start="6228" data-end="6238">arrays</strong>? Describe one advantage and one limitation of arrays. <strong data-start="6293" data-end="6300">(6)</strong></p>
<p data-start="6302" data-end="6374"><strong data-start="6302" data-end="6309">(c)</strong> Write pseudocode to <strong data-start="6330" data-end="6365">reverse an array using pointers</strong>. <strong data-start="6367" data-end="6374">(8)</strong></p>
<h2 data-section-id="1xwc5v2" data-start="6376" data-end="6383">Q. 4</h2>
<p data-start="6385" data-end="6507"><strong data-start="6385" data-end="6392">(a)</strong> Why can an <strong data-start="6404" data-end="6422">abstract class</strong> not be instantiated directly, even though it may contain complete functions? <strong data-start="6500" data-end="6507">(6)</strong></p>
<p data-start="6509" data-end="6655"><strong data-start="6509" data-end="6516">(b)</strong> A class library contains many <strong data-start="6547" data-end="6563">Book objects</strong>. Should this relationship be modeled using inheritance or composition? Explain why. <strong data-start="6648" data-end="6655">(6)</strong></p>
<p data-start="6657" data-end="6863"><strong data-start="6657" data-end="6664">(c)</strong> Demonstrate <strong data-start="6677" data-end="6698">method overriding</strong> using a base class named <code data-start="6724" data-end="6733">Account</code> and a derived class named <code data-start="6760" data-end="6776">CurrentAccount</code>. Make <code data-start="6783" data-end="6792">balance</code> a protected data member. <strong data-start="6818" data-end="6825">(8)</strong> <span class="contents" data-content-reference-start="6766" data-content-reference-end="6783"><span class="" data-state="closed"></span></span></p>
<h1 style="text-align: center" data-section-id="1ap2z34" data-start="6865" data-end="6876"><span style="font-size: 14pt">SECTION-B</span></h1>
<h2 data-section-id="1xwc5v3" data-start="6878" data-end="6885">Q. 5</h2>
<p data-start="6887" data-end="6962"><strong data-start="6887" data-end="6894">(a)</strong> Why is <strong data-start="6902" data-end="6919">Binary Search</strong> not suitable for an unsorted list? <strong data-start="6955" data-end="6962">(6)</strong></p>
<p data-start="6964" data-end="7079"><strong data-start="6964" data-end="6971">(b)</strong> What is the difference between <strong data-start="7003" data-end="7022">Time Complexity</strong> and <strong data-start="7027" data-end="7047">Space Complexity</strong>? Explain with examples. <strong data-start="7072" data-end="7079">(6)</strong></p>
<p data-start="7081" data-end="7203"><strong data-start="7081" data-end="7088">(c)</strong> Write an algorithm, with an example, showing how a <strong data-start="7140" data-end="7194">Stack can be used to evaluate a postfix expression</strong>. <strong data-start="7196" data-end="7203">(8)</strong></p>
<h2 data-section-id="1xwc5v0" data-start="7205" data-end="7212">Q. 6</h2>
<p data-start="7214" data-end="7316"><strong data-start="7214" data-end="7221">(a)</strong> Why is <strong data-start="7229" data-end="7244">Maintenance</strong> considered the most expensive phase of the software life cycle? <strong data-start="7309" data-end="7316">(6)</strong></p>
<p data-start="7318" data-end="7379"><strong data-start="7318" data-end="7325">(b)</strong> What is the purpose of <strong data-start="7349" data-end="7370">Use Case Diagrams</strong>? <strong data-start="7372" data-end="7379">(6)</strong></p>
<p data-start="7381" data-end="7461"><strong data-start="7381" data-end="7388">(c)</strong> Why do <strong data-start="7396" data-end="7452">Agile projects require frequent customer interaction</strong>? <strong data-start="7454" data-end="7461">(8)</strong></p>
<h2 data-section-id="1xwc5v1" data-start="7463" data-end="7470">Q. 7</h2>
<p data-start="7472" data-end="7560"><strong data-start="7472" data-end="7479">(a)</strong> Construct a <strong data-start="7492" data-end="7532">Deterministic Finite Automaton (DFA)</strong> for the regular expression:</p>
<p data-start="7562" data-end="7573"><code data-start="7562" data-end="7573">(a|b)*abb</code></p>
<p data-start="7575" data-end="7582"><strong data-start="7575" data-end="7582">(6)</strong></p>
<p data-start="7584" data-end="7675"><strong data-start="7584" data-end="7591">(b)</strong> Explain the difference among <strong data-start="7621" data-end="7651">lexeme, token, and pattern</strong>, with examples. <strong data-start="7668" data-end="7675">(6)</strong></p>
<p data-start="7677" data-end="7727"><strong data-start="7677" data-end="7684">(c)</strong> Consider the following three-address code:</p>
<div class="relative w-full mt-4 mb-1">
<div class="">
<div class="contents">
<div class="relative">
<div class="h-full min-h-0 min-w-0">
<div class="h-full min-h-0 min-w-0">
<div class="border border-token-border-light border-radius-3xl corner-superellipse/1.1 rounded-3xl">
<div class="h-full w-full border-radius-3xl bg-(--code-block-surface) corner-superellipse/1.1 overflow-clip rounded-3xl  dark: lxnfua_clipPathFallback">
<div class="pointer-events-none absolute end-1.5 top-1 z-2 md:end-2 md:top-1"> </div>
<div class="relative">
<div class="pe-11 pt-3">
<div class="relative z-0 flex h-full min-h-0 max-w-full">
<div id="b9afa99d-d909-45e1-9d3c-d17495c28d17:0:editor" class="Rx43rG_codemirror z-10 flex h-full min-h-0 w-full flex-col items-stretch" dir="ltr">
<div class="cm-editor ͼ1 ͼ2 ͼd ͼr">
<div class="cm-announced" aria-live="polite"> </div>
<div class="cm-scroller">
<div class="cm-content" role="textbox" aria-label="Edit code">
<div class="cm-line">t1 = a + b</div>
<div class="cm-line">t2 = t1 + c</div>
<div class="cm-line">t3 = t2 + d</div>
</div>
</div>
</div>
</div>
</div>
</div>
</div>
</div>
</div>
</div>
</div>
<div class="">
<div class=""> </div>
</div>
</div>
</div>
</div>
</div>
<p data-start="7777" data-end="7905">If the machine has only <strong data-start="7801" data-end="7818">two registers</strong>, explain how the compiler should allocate registers to minimize memory spills. <strong data-start="7898" data-end="7905">(8)</strong></p>
<h2 data-section-id="1xwc5uq" data-start="7907" data-end="7914">Q. 8</h2>
<p data-start="7916" data-end="7983"><strong data-start="7916" data-end="7923">(a)</strong> Suppose a lexical analyzer is scanning the following input:</p>
<div class="relative w-full mt-4 mb-1">
<div class="">
<div class="contents">
<div class="relative">
<div class="h-full min-h-0 min-w-0">
<div class="h-full min-h-0 min-w-0">
<div class="border border-token-border-light border-radius-3xl corner-superellipse/1.1 rounded-3xl">
<div class="h-full w-full border-radius-3xl bg-(--code-block-surface) corner-superellipse/1.1 overflow-clip rounded-3xl  dark: lxnfua_clipPathFallback">
<div class="pointer-events-none absolute end-1.5 top-1 z-2 md:end-2 md:top-1"> </div>
<div class="relative">
<div class="pe-11 pt-3">
<div class="relative z-0 flex h-full min-h-0 max-w-full">
<div id="b9afa99d-d909-45e1-9d3c-d17495c28d17:1:editor" class="Rx43rG_codemirror z-10 flex h-full min-h-0 w-full flex-col items-stretch" dir="ltr">
<div class="cm-editor ͼ1 ͼ2 ͼd ͼr">
<div class="cm-announced" aria-live="polite"> </div>
<div class="cm-scroller">
<div class="cm-content" role="textbox" aria-label="Edit code">
<div class="cm-line">9var = x + 12abc;</div>
</div>
</div>
</div>
</div>
</div>
</div>
</div>
</div>
</div>
</div>
</div>
<div class="">
<div class=""> </div>
</div>
</div>
</div>
</div>
</div>
<p data-start="8016" data-end="8189">Describe step-by-step how the lexical analyzer processes this input, identifies errors, and generates tokens. Explain which specific lexical-analysis rules are used. <strong data-start="8182" data-end="8189">(6)</strong></p>
<p data-start="8191" data-end="8424"><strong data-start="8191" data-end="8198">(b)</strong> A software team is developing an <strong data-start="8232" data-end="8261">online examination system</strong>. During requirements gathering, the client asks for “very strong security,” while teachers want “fast login without multiple checks.” These requirements conflict.</p>
<p data-start="8426" data-end="8643">Explain how the team should resolve the conflict using proper <strong data-start="8488" data-end="8523">Software Engineering techniques</strong>. Also describe the impact of incorrect requirements handling on the <strong data-start="8592" data-end="8634">Software Development Life Cycle (SDLC)</strong>. <strong data-start="8636" data-end="8643">(6)</strong></p>
<p data-start="8645" data-end="8816"><strong data-start="8645" data-end="8652">(c)</strong> A company maintains millions of product IDs and frequently performs searching, insertion, and deletion. Data volume is extremely large and performance is critical.</p>
<p data-start="8818" data-end="8868">Which data structure would be most suitable among:</p>
<ul data-start="8870" data-end="8922">
<li data-section-id="y8zqq7" data-start="8870" data-end="8890">Binary Search Tree</li>
<li data-section-id="19k8aid" data-start="8891" data-end="8901">AVL Tree</li>
<li data-section-id="lwt5us" data-start="8902" data-end="8914">Hash Table</li>
<li data-section-id="16z2i1d" data-start="8915" data-end="8922">Array</li>
</ul>
<p data-start="8924" data-end="9052">Justify your answer logically using <strong data-start="8960" data-end="9005">time-complexity and memory considerations</strong>. <strong data-start="9007" data-end="9014">(8)</strong> <span class="contents" data-content-reference-start="8935" data-content-reference-end="8952"><span class="" data-state="closed"></span></span></p>
<div style="text-align: center" data-section-id="17uwz4" data-start="9059" data-end="9094"><span style="font-size: 14pt">COMPUTER SCIENCE, PAPER-II — 2026</span></div>
<div style="text-align: center" data-start="9096" data-end="9170"><span style="font-size: 14pt"><strong data-start="9096" data-end="9133">FEDERAL PUBLIC SERVICE COMMISSION</strong></span><br data-start="9133" data-end="9136" /><span style="font-size: 14pt"><strong data-start="9136" data-end="9170">COMPETITIVE EXAMINATION — 2026</strong></span></div>
<div style="text-align: center" data-start="9172" data-end="9202"><span style="font-size: 14pt"><strong data-start="9172" data-end="9202">COMPUTER SCIENCE, PAPER-II</strong></span></div>
<p data-start="9204" data-end="9233"><strong data-start="9204" data-end="9233">TIME ALLOWED: THREE HOURS</strong></p>
<p data-start="9235" data-end="9272"><strong data-start="9235" data-end="9272">PART-I (MCQS): MAXIMUM 30 MINUTES</strong></p>
<p data-start="9274" data-end="9309"><strong data-start="9274" data-end="9309">PART-I (MCQS) MAXIMUM MARKS: 20</strong></p>
<p data-start="9311" data-end="9378"><strong data-start="9311" data-end="9340">PART-II MAXIMUM MARKS: 80</strong> <span class="contents" data-content-reference-start="9241" data-content-reference-end="9258"><span class="" data-state="closed"></span></span></p>
<h1 style="text-align: center" data-section-id="1s5bo6l" data-start="9380" data-end="9395"><span style="font-size: 14pt">PART-I — MCQs</span></h1>
<h2 data-section-id="1xwc5uz" data-start="9397" data-end="9404">Q. 1</h2>
<ol data-start="9406" data-end="11905">
<li data-section-id="bjamwp" data-start="9406" data-end="9744">
<p data-start="9409" data-end="9470">Which statement is true about <strong data-start="9439" data-end="9469">overloading and overriding</strong>?</p>
<p data-start="9475" data-end="9744"><strong data-start="9475" data-end="9482">(A)</strong> They are the same.<br data-start="9501" data-end="9504" /><strong data-start="9507" data-end="9514">(B)</strong> They are different, but inheritance is not involved in implementing either concept.<br data-start="9598" data-end="9601" /><strong data-start="9604" data-end="9611">(C)</strong> Overloading is performed within the same class, whereas overriding is performed among different classes.<br data-start="9716" data-end="9719" /><strong data-start="9722" data-end="9729">(D)</strong> None of these.</p>
</li>
<li data-section-id="13mrplf" data-start="9746" data-end="10065">
<p data-start="9749" data-end="9804">Which statement is true about <strong data-start="9779" data-end="9803">private data members</strong>?</p>
<p data-start="9809" data-end="10065"><strong data-start="9809" data-end="9816">(A)</strong> They cannot be accessed outside the class except through public methods of that class.<br data-start="9903" data-end="9906" /><strong data-start="9909" data-end="9916">(B)</strong> They can be accessed outside the class using objects of that class.<br data-start="9984" data-end="9987" /><strong data-start="9990" data-end="9997">(C)</strong> They can be accessed outside the class.<br data-start="10037" data-end="10040" /><strong data-start="10043" data-end="10050">(D)</strong> None of these.</p>
</li>
<li data-section-id="1ffi4c0" data-start="10067" data-end="10327">
<p data-start="10070" data-end="10167">In histogram equalization, applying the technique independently to each RGB channel often causes:</p>
<p data-start="10172" data-end="10327"><strong data-start="10172" data-end="10179">(A)</strong> Improved colour constancy<br data-start="10205" data-end="10208" /><strong data-start="10211" data-end="10218">(B)</strong> Better noise suppression<br data-start="10243" data-end="10246" /><strong data-start="10249" data-end="10256">(C)</strong> Colour distortions due to channel imbalance<br data-start="10300" data-end="10303" /><strong data-start="10306" data-end="10313">(D)</strong> None of these</p>
</li>
<li data-section-id="2vmyv6" data-start="10329" data-end="10605">
<p data-start="10332" data-end="10414">In a pipelined processor, what is the primary purpose of the instruction pipeline?</p>
<p data-start="10419" data-end="10605"><strong data-start="10419" data-end="10426">(A)</strong> To increase the clock speed<br data-start="10454" data-end="10457" /><strong data-start="10460" data-end="10467">(B)</strong> To execute multiple instructions simultaneously<br data-start="10515" data-end="10518" /><strong data-start="10521" data-end="10528">(C)</strong> To reduce the number of instructions in a program<br data-start="10578" data-end="10581" /><strong data-start="10584" data-end="10591">(D)</strong> None of these</p>
</li>
<li data-section-id="sw31xl" data-start="10607" data-end="10869">
<p data-start="10610" data-end="10750">When applying a <strong data-start="10626" data-end="10650">2D Fourier Transform</strong> to an image, shifting the image spatially causes what corresponding effect in the frequency domain?</p>
<p data-start="10755" data-end="10869"><strong data-start="10755" data-end="10762">(A)</strong> Phase modulation<br data-start="10779" data-end="10782" /><strong data-start="10785" data-end="10792">(B)</strong> Amplitude scaling<br data-start="10810" data-end="10813" /><strong data-start="10816" data-end="10823">(C)</strong> Frequency doubling<br data-start="10842" data-end="10845" /><strong data-start="10848" data-end="10855">(D)</strong> None of these</p>
</li>
<li data-section-id="1pnht6t" data-start="10871" data-end="11093">
<p data-start="10874" data-end="10963">In morphological image operations, opening differs from closing because opening tends to:</p>
<p data-start="10968" data-end="11093"><strong data-start="10968" data-end="10975">(A)</strong> Fill narrow gaps<br data-start="10992" data-end="10995" /><strong data-start="10998" data-end="11005">(B)</strong> Remove thin protrusions<br data-start="11029" data-end="11032" /><strong data-start="11035" data-end="11042">(C)</strong> Produce higher contrast<br data-start="11066" data-end="11069" /><strong data-start="11072" data-end="11079">(D)</strong> None of these</p>
</li>
<li data-section-id="1brj0bt" data-start="11095" data-end="11392">
<p data-start="11098" data-end="11185">The main purpose of a <strong data-start="11120" data-end="11151">Laplacian of Gaussian (LoG)</strong> operator in image analysis is to:</p>
<p data-start="11190" data-end="11392"><strong data-start="11190" data-end="11197">(A)</strong> Detect extremely low-frequency patterns<br data-start="11237" data-end="11240" /><strong data-start="11243" data-end="11250">(B)</strong> Identify regions of uniform colour<br data-start="11285" data-end="11288" /><strong data-start="11291" data-end="11298">(C)</strong> Localize edges by combining smoothing and second-order derivatives<br data-start="11365" data-end="11368" /><strong data-start="11371" data-end="11378">(D)</strong> None of these</p>
</li>
<li data-section-id="oir399" data-start="11394" data-end="11678">
<p data-start="11397" data-end="11455">What does the <strong data-start="11411" data-end="11445">Data Definition Language (DDL)</strong> describe?</p>
<p data-start="11460" data-end="11678"><strong data-start="11460" data-end="11467">(A)</strong> How data are structured in the database<br data-start="11507" data-end="11510" /><strong data-start="11513" data-end="11520">(B)</strong> What the DBMS requires and the techniques used to process data<br data-start="11583" data-end="11586" /><strong data-start="11589" data-end="11596">(C)</strong> How data must be structured to produce the user's view<br data-start="11651" data-end="11654" /><strong data-start="11657" data-end="11664">(D)</strong> None of these</p>
</li>
<li data-section-id="1v97nf3" data-start="11680" data-end="11824">
<p data-start="11683" data-end="11750"><strong data-start="11683" data-end="11717">Data Encryption Standard (DES)</strong> generates ______-bit round keys.</p>
<p data-start="11755" data-end="11824"><strong data-start="11755" data-end="11762">(A)</strong> 16<br data-start="11765" data-end="11768" /><strong data-start="11771" data-end="11778">(B)</strong> 32<br data-start="11781" data-end="11784" /><strong data-start="11787" data-end="11794">(C)</strong> 48<br data-start="11797" data-end="11800" /><strong data-start="11803" data-end="11810">(D)</strong> None of these</p>
</li>
<li data-section-id="u81xbb" data-start="11826" data-end="11905">In <strong data-start="11833" data-end="11863">symmetric-key cryptography</strong>, the sender and receiver use ______ keys.</li>
</ol>
<p data-start="11910" data-end="11984"><strong data-start="11910" data-end="11917">(A)</strong> Shared<br data-start="11924" data-end="11927" /><strong data-start="11930" data-end="11937">(B)</strong> Two<br data-start="11941" data-end="11944" /><strong data-start="11947" data-end="11954">(C)</strong> No<br data-start="11957" data-end="11960" /><strong data-start="11963" data-end="11970">(D)</strong> None of these</p>
<ol start="11" data-start="11986" data-end="12096">
<li data-section-id="aaeybh" data-start="11986" data-end="12096">In modern <strong data-start="12000" data-end="12032">micro-frontend architectures</strong>, the primary benefit of independently deployed UI fragments is:</li>
</ol>
<p data-start="12101" data-end="12277"><strong data-start="12101" data-end="12108">(A)</strong> Tighter coupling across teams<br data-start="12138" data-end="12141" /><strong data-start="12144" data-end="12151">(B)</strong> Improved runtime bundling only<br data-start="12182" data-end="12185" /><strong data-start="12188" data-end="12195">(C)</strong> Enhanced isolation and autonomous deployment pipelines<br data-start="12250" data-end="12253" /><strong data-start="12256" data-end="12263">(D)</strong> None of these</p>
<ol start="12" data-start="12279" data-end="12345">
<li data-section-id="r4cidl" data-start="12279" data-end="12345"><strong data-start="12283" data-end="12293">HTTP/3</strong> improves performance over HTTP/2 mainly because it:</li>
</ol>
<p data-start="12350" data-end="12549"><strong data-start="12350" data-end="12357">(A)</strong> Uses TCP with modified congestion control<br data-start="12399" data-end="12402" /><strong data-start="12405" data-end="12412">(B)</strong> Replaces TLS with a custom encryption protocol<br data-start="12459" data-end="12462" /><strong data-start="12465" data-end="12472">(C)</strong> Operates over QUIC to avoid head-of-line blocking<br data-start="12522" data-end="12525" /><strong data-start="12528" data-end="12535">(D)</strong> None of these</p>
<ol start="13" data-start="12551" data-end="12649">
<li data-section-id="3bx9qp" data-start="12551" data-end="12649">A major advantage of <strong data-start="12576" data-end="12591">WebAssembly</strong> in computationally intensive web applications is that it:</li>
</ol>
<p data-start="12654" data-end="12850"><strong data-start="12654" data-end="12661">(A)</strong> Eliminates the need for JavaScript entirely<br data-start="12705" data-end="12708" /><strong data-start="12711" data-end="12718">(B)</strong> Enables near-native execution speed in browsers<br data-start="12766" data-end="12769" /><strong data-start="12772" data-end="12779">(C)</strong> Works only on server-side rendering engines<br data-start="12823" data-end="12826" /><strong data-start="12829" data-end="12836">(D)</strong> None of these</p>
<ol start="14" data-start="12852" data-end="12918">
<li data-section-id="7dtx4s" data-start="12852" data-end="12918">The __________ is one of the fundamental components of a DBMS.</li>
</ol>
<p data-start="12923" data-end="13048"><strong data-start="12923" data-end="12930">(A)</strong> System catalogue<br data-start="12947" data-end="12950" /><strong data-start="12953" data-end="12960">(B)</strong> Metadata<br data-start="12969" data-end="12972" /><strong data-start="12975" data-end="12982">(C)</strong> Information Resource Dictionary System<br data-start="13021" data-end="13024" /><strong data-start="13027" data-end="13034">(D)</strong> None of these</p>
<ol start="15" data-start="13050" data-end="13109">
<li data-section-id="1siv8k0" data-start="13050" data-end="13109">Which of the following is <strong data-start="13080" data-end="13087">not</strong> a function of a DBMS?</li>
</ol>
<p data-start="13114" data-end="13233"><strong data-start="13114" data-end="13121">(A)</strong> Recovery services<br data-start="13139" data-end="13142" /><strong data-start="13145" data-end="13152">(B)</strong> Support for data communication<br data-start="13183" data-end="13186" /><strong data-start="13189" data-end="13196">(C)</strong> Funneling<br data-start="13206" data-end="13209" /><strong data-start="13212" data-end="13219">(D)</strong> None of these</p>
<ol start="16" data-start="13235" data-end="13288">
<li data-section-id="127apyz" data-start="13235" data-end="13288">Which of the following is not involved in a DBMS?</li>
</ol>
<p data-start="13293" data-end="13388"><strong data-start="13293" data-end="13300">(A)</strong> HTML<br data-start="13305" data-end="13308" /><strong data-start="13311" data-end="13318">(B)</strong> Application Request<br data-start="13338" data-end="13341" /><strong data-start="13344" data-end="13351">(C)</strong> End Users<br data-start="13361" data-end="13364" /><strong data-start="13367" data-end="13374">(D)</strong> None of these</p>
<ol start="17" data-start="13390" data-end="13425">
<li data-section-id="ykih1x" data-start="13390" data-end="13425">In <strong data-start="13397" data-end="13424">peer-to-peer networking</strong>:</li>
</ol>
<p data-start="13430" data-end="13646"><strong data-start="13430" data-end="13437">(A)</strong> There is only one server and many clients.<br data-start="13480" data-end="13483" /><strong data-start="13486" data-end="13493">(B)</strong> Every computer can act as a client, server, or both at the same time.<br data-start="13563" data-end="13566" /><strong data-start="13569" data-end="13576">(C)</strong> There is only one client and many servers.<br data-start="13619" data-end="13622" /><strong data-start="13625" data-end="13632">(D)</strong> None of these</p>
<ol start="18" data-start="13648" data-end="13758">
<li data-section-id="z20cb9" data-start="13648" data-end="13758">A hardware-resource conflict is more likely to be an <strong data-start="13705" data-end="13721">IRQ conflict</strong> rather than an I/O conflict because:</li>
</ol>
<p data-start="13763" data-end="13956"><strong data-start="13763" data-end="13770">(A)</strong> The BIOS sometimes has more difficulty controlling IRQs.<br data-start="13827" data-end="13830" /><strong data-start="13833" data-end="13840">(B)</strong> I/O addresses cannot conflict.<br data-start="13871" data-end="13874" /><strong data-start="13877" data-end="13884">(C)</strong> There are many more I/O addresses than IRQs.<br data-start="13929" data-end="13932" /><strong data-start="13935" data-end="13942">(D)</strong> None of these</p>
<ol start="19" data-start="13958" data-end="14045">
<li data-section-id="1g4psbu" data-start="13958" data-end="14045">Which part of the operating system decides what to do when <strong data-start="14021" data-end="14044">main memory is full</strong>?</li>
</ol>
<p data-start="14050" data-end="14155"><strong data-start="14050" data-end="14057">(A)</strong> Process Scheduler<br data-start="14075" data-end="14078" /><strong data-start="14081" data-end="14088">(B)</strong> Memory Manager<br data-start="14103" data-end="14106" /><strong data-start="14109" data-end="14116">(C)</strong> File System<br data-start="14128" data-end="14131" /><strong data-start="14134" data-end="14141">(D)</strong> None of these</p>
<ol start="20" data-start="14157" data-end="14219">
<li data-section-id="o19sci" data-start="14157" data-end="14219">Which of the following is a method of <strong data-start="14199" data-end="14218">file protection</strong>?</li>
</ol>
<p data-start="14224" data-end="14367"><strong data-start="14224" data-end="14231">(A)</strong> Access Control<br data-start="14246" data-end="14249" /><strong data-start="14252" data-end="14259">(B)</strong> Deleting a file<br data-start="14275" data-end="14278" /><strong data-start="14281" data-end="14288">(C)</strong> Hiding a file<br data-start="14302" data-end="14305" /><strong data-start="14308" data-end="14315">(D)</strong> None of these <span class="contents" data-content-reference-start="14210" data-content-reference-end="14227"><span class="" data-state="closed"></span></span></p>
<h1 style="text-align: center" data-section-id="1yvqorg" data-start="14374" data-end="14383"><span style="font-size: 14pt">PART-II</span></h1>
<h3 data-section-id="ynfaae" data-start="14385" data-end="14393">NOTE</h3>
<p data-start="14395" data-end="14454">(i) Part-II is to be attempted on the separate Answer Book.</p>
<p data-start="14456" data-end="14588">(ii) Attempt <strong data-start="14469" data-end="14492">ONLY FOUR questions</strong> from Part-II by selecting <strong data-start="14519" data-end="14554">TWO questions from EACH SECTION</strong>. All questions carry equal marks.</p>
<p data-start="14590" data-end="14685">(iii) All parts of each question must be attempted at one place instead of at different places.</p>
<p data-start="14687" data-end="14784">(iv) Candidate must write the question number in the Answer Book according to the question paper.</p>
<p data-start="14786" data-end="14874">(v) No page/space should be left blank between answers. All blank pages must be crossed.</p>
<p data-start="14876" data-end="15010">(vi) Extra attempt of any question or any part of the attempted question will not be considered. <span class="contents" data-content-reference-start="14833" data-content-reference-end="14850"><span class="" data-state="closed"></span></span></p>
<h1 style="text-align: center" data-section-id="1ap2z37" data-start="15012" data-end="15023"><span style="font-size: 14pt">SECTION-A</span></h1>
<h2 data-section-id="1xwc5uw" data-start="15025" data-end="15032">Q. 2</h2>
<p data-start="15034" data-end="15119"><strong data-start="15034" data-end="15058">Machine instructions</strong> serve as a critical interface between hardware and software.</p>
<p data-start="15121" data-end="15231">Compare the representation and execution behaviour of machine instructions in <strong data-start="15199" data-end="15230">CISC and RISC architectures</strong>.</p>
<p data-start="15233" data-end="15334">Evaluate how the <strong data-start="15250" data-end="15284">instruction cycle organization</strong> shapes the design of the control unit, comparing:</p>
<ul data-start="15336" data-end="15381">
<li data-section-id="1kzir31" data-start="15336" data-end="15355">Hardwired control</li>
<li data-section-id="17nrlf1" data-start="15356" data-end="15381">Microprogrammed control</li>
</ul>
<p data-start="15383" data-end="15391"><strong data-start="15383" data-end="15391">(20)</strong></p>
<h2 data-section-id="1xwc5ux" data-start="15393" data-end="15400">Q. 3</h2>
<p data-start="15402" data-end="15447">Explain the synergistic relationship between:</p>
<ul data-start="15449" data-end="15537">
<li data-section-id="qwoq3n" data-start="15449" data-end="15486">Instruction-Level Parallelism (ILP)</li>
<li data-section-id="113a4ut" data-start="15487" data-end="15510">Superscalar execution</li>
<li data-section-id="1ygq34h" data-start="15511" data-end="15537">Multi-core architectures</li>
</ul>
<p data-start="15539" data-end="15560">in modern CPU design.</p>
<p data-start="15562" data-end="15601">Analyze how their combined use affects:</p>
<ul data-start="15603" data-end="15695">
<li data-section-id="1lbs8b1" data-start="15603" data-end="15632">Instruction-pipeline design</li>
<li data-section-id="mor6j6" data-start="15633" data-end="15664">Mitigation of control hazards</li>
<li data-section-id="1fddujf" data-start="15665" data-end="15695">Overall processor throughput</li>
</ul>
<p data-start="15697" data-end="15705"><strong data-start="15697" data-end="15705">(20)</strong></p>
<h2 data-section-id="1xwc5v2" data-start="15707" data-end="15714">Q. 4</h2>
<p data-start="15716" data-end="15858">In large-scale distributed networks, <strong data-start="15753" data-end="15811">congestion control and congestion avoidance mechanisms</strong> are essential for maintaining service quality.</p>
<p data-start="15860" data-end="16021">Provide a detailed analysis of the congestion-handling strategies employed in <strong data-start="15938" data-end="15945">TCP</strong> and contrast them with the limitations of <strong data-start="15988" data-end="15995">UDP</strong> under similar conditions.</p>
<p data-start="16023" data-end="16108">Explain why transport-layer design decisions influence overall <strong data-start="16086" data-end="16107">network stability</strong>.</p>
<p data-start="16110" data-end="16118"><strong data-start="16110" data-end="16118">(20)</strong></p>
<h2 data-section-id="1xwc5v3" data-start="16120" data-end="16127">Q. 5</h2>
<p data-start="16129" data-end="16228">Modern operating systems attempt to balance <strong data-start="16173" data-end="16200">efficiency and fairness</strong> while scheduling processes.</p>
<p data-start="16230" data-end="16329">Critically evaluate how <strong data-start="16254" data-end="16292">Multi-Level Feedback Queues (MLFQ)</strong> evolve process priorities over time.</p>
<p data-start="16331" data-end="16366">Discuss how this design influences:</p>
<ul data-start="16368" data-end="16406">
<li data-section-id="12yn284" data-start="16368" data-end="16385">CPU utilization</li>
<li data-section-id="1wsgzfg" data-start="16386" data-end="16406">Process starvation</li>
</ul>
<p data-start="16408" data-end="16458">and compare it with simpler scheduling algorithms.</p>
<p data-start="16460" data-end="16506"><strong data-start="16460" data-end="16468">(20)</strong> <span class="contents" data-content-reference-start="16309" data-content-reference-end="16326"><span class="" data-state="closed"></span></span></p>
<h1 style="text-align: center" data-section-id="1ap2z34" data-start="16508" data-end="16519"><span style="font-size: 14pt">SECTION-B</span></h1>
<h2 data-section-id="1xwc5v0" data-start="16521" data-end="16528">Q. 6</h2>
<p data-start="16530" data-end="16588"><strong data-start="16530" data-end="16547">Normalization</strong> aims to improve database-schema quality.</p>
<p data-start="16590" data-end="16616">Discuss how violations of:</p>
<ul data-start="16618" data-end="16670">
<li data-section-id="tt597y" data-start="16618" data-end="16643">Functional dependencies</li>
<li data-section-id="l6hprb" data-start="16644" data-end="16670">Multivalued dependencies</li>
</ul>
<p data-start="16672" data-end="16701">lead to structural anomalies.</p>
<p data-start="16703" data-end="16751">Evaluate whether higher normal forms, including:</p>
<ul data-start="16753" data-end="16771">
<li data-section-id="1o2iab" data-start="16753" data-end="16758">3NF</li>
<li data-section-id="1j42t41" data-start="16759" data-end="16765">BCNF</li>
<li data-section-id="1o2mdw" data-start="16766" data-end="16771">4NF</li>
</ul>
<p data-start="16773" data-end="16858">always benefit large-scale <strong data-start="16800" data-end="16840">Online Transaction Processing (OLTP)</strong> database systems.</p>
<p data-start="16860" data-end="16868"><strong data-start="16860" data-end="16868">(20)</strong></p>
<h2 data-section-id="1xwc5v1" data-start="16870" data-end="16877">Q. 7</h2>
<p data-start="16879" data-end="16969"><strong data-start="16879" data-end="16907">Morphological operations</strong> provide powerful tools for manipulating shape-based features.</p>
<p data-start="16971" data-end="17010">Discuss the mathematical foundation of:</p>
<ul data-start="17012" data-end="17052">
<li data-section-id="scvmus" data-start="17012" data-end="17022">Dilation</li>
<li data-section-id="3z6bjf" data-start="17023" data-end="17032">Erosion</li>
<li data-section-id="7hx8u4" data-start="17033" data-end="17042">Opening</li>
<li data-section-id="902x23" data-start="17043" data-end="17052">Closing</li>
</ul>
<p data-start="17054" data-end="17099">Evaluate their applications in tasks such as:</p>
<ul data-start="17101" data-end="17150">
<li data-section-id="7o2rmd" data-start="17101" data-end="17120">Document analysis</li>
<li data-section-id="1y9txxh" data-start="17121" data-end="17150">Medical-image preprocessing</li>
</ul>
<p data-start="17152" data-end="17160"><strong data-start="17152" data-end="17160">(20)</strong></p>
<h2 data-section-id="1xwc5uq" data-start="17162" data-end="17169">Q. 8</h2>
<p data-start="17171" data-end="17224"><strong data-start="17171" data-end="17193">Feature extraction</strong> is central to computer vision.</p>
<p data-start="17226" data-end="17297">Describe how <strong data-start="17239" data-end="17268">edge-detection techniques</strong> differ in their response to:</p>
<ul data-start="17299" data-end="17342">
<li data-section-id="16v87qu" data-start="17299" data-end="17306">Noise</li>
<li data-section-id="19gdz13" data-start="17307" data-end="17316">Texture</li>
<li data-section-id="quliht" data-start="17317" data-end="17342">Illumination variations</li>
</ul>
<p data-start="17344" data-end="17418">Compare the boundary-localization accuracy of classical detectors such as:</p>
<ul data-start="17420" data-end="17461">
<li data-section-id="178k8cf" data-start="17420" data-end="17427">Sobel</li>
<li data-section-id="16xazpv" data-start="17428" data-end="17435">Canny</li>
<li data-section-id="cg5q4t" data-start="17436" data-end="17461">Laplacian-based methods</li>
</ul>
<p data-start="17463" data-end="17509"><strong data-start="17463" data-end="17471">(20)</strong> <span class="contents" data-content-reference-start="17292" data-content-reference-end="17309"><span class="" data-state="delayed-open" aria-describedby="radix-_r_125_" data-radix-popper-side="bottom" data-radix-popper-align="start"></span></span></p>
<hr />
<p data-start="17511" data-end="17562" data-is-last-node="" data-is-only-node=""><strong><span style="font-size: 14pt"><a href="https://hostnezt.com/cssfiles/csspastpapers/computer/Computer%20Science%202026.pdf" target="_blank" rel="noopener">DOWNLOAD NOW</a></span></strong></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-2026/#post-81358</guid>
                    </item>
							        </channel>
        </rss>
		