<?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 2010 - Computer Science				            </title>
            <link>https://cssforum.net/group-i-papers-computer-science/css-computer-science-paper-2010/</link>
            <description>CSS Forum Discussion Board</description>
            <language>en-US</language>
            <lastBuildDate>Sat, 15 Aug 2026 09:32:53 +0000</lastBuildDate>
            <generator>wpForo</generator>
            <ttl>60</ttl>
							                    <item>
                        <title>CSS Computer Science Paper 2010</title>
                        <link>https://cssforum.net/group-i-papers-computer-science/css-computer-science-paper-2010/#post-81324</link>
                        <pubDate>Sat, 15 Aug 2026 08:13:21 +0000</pubDate>
                        <description><![CDATA[FEDERAL PUBLIC SERVICE COMMISSIONCOMPETITIVE EXAMINATION FOR RECRUITMENT TO POSTSIN BPS-17 UNDER THE FEDERAL GOVERNMENT, 2010
COMPUTER SCIENCE
 

COMPUTER SCIENCE
PART-I: 30 MINUTES — M...]]></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, 2010</strong></span></div>
<div style="text-align: center"><span style="font-size: 14pt"><strong>COMPUTER SCIENCE</strong></span></div>
<div> </div>
<div>
<h1 style="text-align: center"><span style="font-size: 14pt">COMPUTER SCIENCE</span></h1>
<p class="isSelectedEnd"><strong><span>PART-I:</span></strong><span> 30 MINUTES — </span><strong><span>MAXIMUM MARKS: 20</span></strong><br /><strong><span>PART-II:</span></strong><span> 2 HOURS &amp; 30 MINUTES — </span><strong><span>MAXIMUM MARKS: 80</span></strong></p>
<h1 style="text-align: center"><span style="font-size: 14pt">PART – I (MCQ)</span></h1>
<p class="isSelectedEnd" style="text-align: center"><span style="font-size: 14pt"><strong>(COMPULSORY)</strong></span></p>
<h3><span>Q.1. Select the best option/answer and fill in the appropriate box on the Answer Sheet. (20)</span></h3>
<p class="isSelectedEnd"><strong><span>(i)</span></strong><span> Object (also called ____) is a common data type that includes photograph, audio, video, or a document created in other applications.</span></p>
<p class="isSelectedEnd"><span>(a) Number</span><br /><span>(b) BLOB</span><br /><span>(c) Integer</span><br /><span>(d) Binary</span><br /><span>(e) None of these</span></p>
<p class="isSelectedEnd"><strong><span>(ii)</span></strong><span> In a database, a(n) ____ is a group of related fields.</span></p>
<p class="isSelectedEnd"><span>(a) Table</span><br /><span>(b) Key</span><br /><span>(c) Record</span><br /><span>(d) Primary Field</span><br /><span>(e) None of these</span></p>
<p class="isSelectedEnd"><strong><span>(iii)</span></strong><span> In a database, a(n) ____ field is a field that uniquely identifies each record in a file.</span></p>
<p class="isSelectedEnd"><span>(a) Main</span><br /><span>(b) Identifying</span><br /><span>(c) Master</span><br /><span>(d) Key</span><br /><span>(e) None of these</span></p>
<p class="isSelectedEnd"><strong><span>(iv)</span></strong><span> If the lowest annual fee at a discount warehouse is Rs. 2025 and the highest is Rs. 5550, a(n) ____ on the Annual Fee field ensures it is a value between Rs. 2025 and Rs. 5550.</span></p>
<p class="isSelectedEnd"><span>(a) Range Check</span><br /><span>(b) Completeness Check</span><br /><span>(c) Consistency Check</span><br /><span>(d) Alphabetic/numeric check</span><br /><span>(e) None of these</span></p>
<p class="isSelectedEnd"><strong><span>(v)</span></strong><span> A DBMS uses the ____ to perform validation checks.</span></p>
<p class="isSelectedEnd"><span>(a) Data Server</span><br /><span>(b) Data Mart</span><br /><span>(c) Data Warehouse</span><br /><span>(d) Data Dictionary</span><br /><span>(e) None of these</span></p>
<p class="isSelectedEnd"><strong><span>(vi)</span></strong><span> _______ is a network technology that defines how messages are routed from one end of a network to the other, ensuring the data arrives correctly by dividing it into packets.</span></p>
<p class="isSelectedEnd"><span>(a) HTML</span><br /><span>(b) XML</span><br /><span>(c) HTTP</span><br /><span>(d) TCP/IP</span><br /><span>(e) None of these</span></p>
<p class="isSelectedEnd"><strong><span>(vii)</span></strong><span> When a computer sends data over the Internet, the data is divided into small pieces, or ____.</span></p>
<p class="isSelectedEnd"><span>(a) Bundles</span><br /><span>(b) Packets</span><br /><span>(c) Slices</span><br /><span>(d) Baskets</span><br /><span>(e) None of these</span></p>
<p class="isSelectedEnd"><strong><span>(viii)</span></strong><span> The amount of data, instructions, and information that can travel over a communications channel sometimes is called the ____.</span></p>
<p class="isSelectedEnd"><span>(a) Broadband</span><br /><span>(b) Baseband</span><br /><span>(c) Latency</span><br /><span>(d) Bandwidth</span><br /><span>(e) None of these</span></p>
<p class="isSelectedEnd"><strong><span>(ix)</span></strong><span> Fiber-optic cables have all of the following advantages over cables that use wire except ____.</span></p>
<p class="isSelectedEnd"><span>(a) Lower costs and easier installation and modification</span><br /><span>(b) Faster data transmission and smaller size</span><br /><span>(c) Less susceptible to noise from other devices</span><br /><span>(d) Better security for signals during transmission</span><br /><span>(e) None of these</span></p>
<p class="isSelectedEnd"><strong><span>(x)</span></strong><span> A _________ is a network that connects computers and devices in a limited geographical area, such as a home, school computer laboratory, or office building.</span></p>
<p class="isSelectedEnd"><span>(a) Local Area Network (LAN)</span><br /><span>(b) Metropolitan Area Network (MAN)</span><br /><span>(c) Wide Area Network (WAN)</span><br /><span>(d) Variable Area Network (VAN)</span><br /><span>(e) None of these</span></p>
<p class="isSelectedEnd"><strong><span>(xi)</span></strong><span> With ____ memory, the operating system allocates a portion of a storage medium, usually the hard disk, to function as additional RAM.</span></p>
<p class="isSelectedEnd"><span>(a) Virtual</span><br /><span>(b) Performance</span><br /><span>(c) Device</span><br /><span>(d) Managed</span><br /><span>(e) None of these</span></p>
<p class="isSelectedEnd"><strong><span>(xii)</span></strong><span> If a new device, such as a printer or scanner, is attached to a computer, its ____ must be installed before the device can be used.</span></p>
<p class="isSelectedEnd"><span>(a) Driver</span><br /><span>(b) Platform</span><br /><span>(c) Manager</span><br /><span>(d) Kernel</span><br /><span>(e) None of these</span></p>
<p class="isSelectedEnd"><strong><span>(xiii)</span></strong><span> A ____ is an icon on the desktop that provides a user with immediate access to a program or file.</span></p>
<p class="isSelectedEnd"><span>(a) Kernel</span><br /><span>(b) Spooler</span><br /><span>(c) Buffer</span><br /><span>(d) Shortcut</span><br /><span>(e) None of these</span></p>
<p class="isSelectedEnd"><strong><span>(xiv)</span></strong><span> _____________ a disk, or reorganizing it so the files are stored in contiguous sectors, speeds up disk access and thus the performance of the entire computer.</span></p>
<p class="isSelectedEnd"><span>(a) Formatting</span><br /><span>(b) Defragmenting</span><br /><span>(c) Spooling</span><br /><span>(d) Compressing</span><br /><span>(e) None of these</span></p>
<p class="isSelectedEnd"><strong><span>NOTE:</span></strong></p>
<p class="isSelectedEnd"><span>(i) First attempt PART-I (MCQ) on separate Answer Sheet which shall be taken back after 30 minutes.</span></p>
<p class="isSelectedEnd"><span>(ii) Overwriting/cutting of the options/answers will not be given credit.</span></p>
<h1 style="text-align: center"><span style="font-size: 14pt">PART – II</span></h1>
<p class="isSelectedEnd"><strong><span>NOTE:</span></strong></p>
<p class="isSelectedEnd"><span>(i) PART-II is to be attempted on the separate Answer Book.</span></p>
<p class="isSelectedEnd"><span>(ii) Attempt ONLY FOUR questions from PART-II, selecting at least ONE question from each SECTION. All questions carry EQUAL marks.</span></p>
<p class="isSelectedEnd"><span>(iii) Extra attempt of any question or any part of the attempted question will not be considered.</span></p>
<p class="isSelectedEnd"><span>(iv) Use of Calculator is allowed.</span></p>
<h1 style="text-align: center"><span>SECTION – I</span></h1>
<h2><span>Q.2.</span></h2>
<p class="isSelectedEnd"><strong><span>(a)</span></strong><span> List OSI Seven Layers in order and briefly describe functions of each layer. </span><strong><span>(10+6+4)</span></strong></p>
<p class="isSelectedEnd"><strong><span>(b)</span></strong><span> What is difference between IPv4 and IPv6? Why IPv6 was developed when IPv4 was already available and implemented?</span></p>
<p class="isSelectedEnd"><strong><span>(c)</span></strong><span> What is difference between physical address, logical address, domain and port number?</span></p>
<h2><span>Q.3.</span></h2>
<p class="isSelectedEnd"><span>Consider the following set of processes, with the length of the CPU-burst time given in milliseconds: </span><strong><span>(8+4+4+4)</span></strong></p>
<table>
<tbody>
<tr>
<th><span>Process</span></th>
<th><span>Burst Time</span></th>
<th><span>Priority</span></th>
</tr>
<tr>
<td><span>P1</span></td>
<td><span>10</span></td>
<td><span>3</span></td>
</tr>
<tr>
<td><span>P2</span></td>
<td><span>1</span></td>
<td><span>1</span></td>
</tr>
<tr>
<td><span>P3</span></td>
<td><span>2</span></td>
<td><span>3</span></td>
</tr>
<tr>
<td><span>P4</span></td>
<td><span>1</span></td>
<td><span>4</span></td>
</tr>
<tr>
<td><span>P5</span></td>
<td><span>5</span></td>
<td><span>2</span></td>
</tr>
</tbody>
</table>
<p class="isSelectedEnd"><span>The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0.</span></p>
<p class="isSelectedEnd"><strong><span>(a)</span></strong><span> Draw four Gantt charts illustrating the execution of these processes using FCFS, SJF, nonpreemptive priority (a smaller priority number implies a higher priority), and RR (quantum = 1) scheduling.</span></p>
<p class="isSelectedEnd"><strong><span>(b)</span></strong><span> What is the turnaround time of each process for each of the scheduling algorithms in part (a)?</span></p>
<p class="isSelectedEnd"><strong><span>(c)</span></strong><span> What is the waiting time of each process for each of the scheduling algorithms in part (a)?</span></p>
<p class="isSelectedEnd"><strong><span>(d)</span></strong><span> Which of the schedules in part (a) results in the minimal average waiting time (over all processes)?</span></p>
<h2><span>Q.4.</span></h2>
<p class="isSelectedEnd"><strong><span>(a)</span></strong><span> Consider a logical address space of eight pages of 1024 words each, mapped onto a physical memory of 32 frames. </span><strong><span>(6+10+4)</span></strong></p>
<p class="isSelectedEnd"><strong><span>(i)</span></strong><span> How many bits are there in the logical address?</span></p>
<p class="isSelectedEnd"><strong><span>(ii)</span></strong><span> How many bits are there in the physical address?</span></p>
<p class="isSelectedEnd"><strong><span>(b)</span></strong><span> Consider the following segment table:</span></p>
<table>
<tbody>
<tr>
<td><span>Segment</span></td>
<td><span>Base</span></td>
<td><span>Length</span></td>
</tr>
<tr>
<td><span>0</span></td>
<td><span>219</span></td>
<td><span>600</span></td>
</tr>
<tr>
<td><span>1</span></td>
<td><span>2300</span></td>
<td><span>14</span></td>
</tr>
<tr>
<td><span>2</span></td>
<td><span>90</span></td>
<td><span>100</span></td>
</tr>
<tr>
<td><span>3</span></td>
<td><span>1327</span></td>
<td><span>580</span></td>
</tr>
<tr>
<td><span>4</span></td>
<td><span>1952</span></td>
<td><span>96</span></td>
</tr>
</tbody>
</table>
<p class="isSelectedEnd"><span>What are the physical addresses for the following logical addresses?</span></p>
<p class="isSelectedEnd"><strong><span>(i)</span></strong><span> 0, 430</span><br /><strong><span>(ii)</span></strong><span> 1, 10</span><br /><strong><span>(iii)</span></strong><span> 2, 500</span><br /><strong><span>(iv)</span></strong><span> 3, 400</span><br /><strong><span>(v)</span></strong><span> 4, 112</span></p>
<p class="isSelectedEnd"><strong><span>(c)</span></strong><span> What are the four necessary conditions for deadlock? Define each condition.</span></p>
<h1 style="text-align: center"><span>SECTION – II</span></h1>
<h2><span>Q.5.</span></h2>
<p class="isSelectedEnd"><strong><span>(a)</span></strong><span> Define following terms: </span><strong><span>(16+4)</span></strong></p>
<p class="isSelectedEnd"><span>(i) Class</span><br /><span>(ii) Encapsulation</span><br /><span>(iii) Abstraction</span><br /><span>(iv) Shadowing</span><br /><span>(v) Inheritance</span><br /><span>(vi) Polymorphism</span><br /><span>(vii) Copy Constructor</span><br /><span>(viii) Serialization</span></p>
<p class="isSelectedEnd"><strong><span>(b)</span></strong><span> Write the output of the following program:</span></p>
<pre dir="ltr" contenteditable="false"><code dir="ltr"><span>class Crectangle
{
private:
    int width, height;

public:
    CRectangle (int, int);
    ~CRectangle ();

    int area (void)
    {
        return (width * height);
    }
};

CRectangle::CRectangle (int a, int b)
{
    width = a;
    height = b;
}

void main ()
{
    CRectangle recta (3,4), rectb (5,6);

    cout &lt;&lt; "recta area = " &lt;&lt; recta.area() &lt;&lt; endl;
    cout &lt;&lt; "rectb area = " &lt;&lt; rectb.area() &lt;&lt; endl;
}</span></code></pre>
<h2><span>Q.6.</span></h2>
<p class="isSelectedEnd"><strong><span>(a)</span></strong><span> Suppose the following sorted array A of integers: </span><strong><span>(6+7+7)</span></strong></p>
<table>
<tbody>
<tr>
<td><span>A<span class="text-token-text-primary cursor-text rounded-sm" data-placeholder-token="true"></span></span></td>
<td><span>A<span class="text-token-text-primary cursor-text rounded-sm" data-placeholder-token="true"></span></span></td>
<td><span>A<span class="text-token-text-primary cursor-text rounded-sm" data-placeholder-token="true"></span></span></td>
<td><span>A<span class="text-token-text-primary cursor-text rounded-sm" data-placeholder-token="true"></span></span></td>
<td><span>A<span class="text-token-text-primary cursor-text rounded-sm" data-placeholder-token="true"></span></span></td>
<td><span>A<span class="text-token-text-primary cursor-text rounded-sm" data-placeholder-token="true"></span></span></td>
<td><span>A<span class="text-token-text-primary cursor-text rounded-sm" data-placeholder-token="true"></span></span></td>
</tr>
<tr>
<td><span>1</span></td>
<td><span>2</span></td>
<td><span>5</span></td>
<td><span>7</span></td>
<td><span>9</span></td>
<td><span>11</span></td>
<td><span>13</span></td>
</tr>
</tbody>
</table>
<p class="isSelectedEnd"><span>If you perform the binary search, for each of the search keys given below, write down the sequence of array values that are compared with the search value during the search.</span></p>
<p class="isSelectedEnd"><strong><span>Searching for 2</span></strong><br /><strong><span>Searching for 13</span></strong><br /><strong><span>Searching for 8</span></strong></p>
<p class="isSelectedEnd"><strong><span>(b)</span></strong><span> Trace the execution of SELECTION SORT on the following array by showing the contents of the array after every step.</span></p>
<table>
<tbody>
<tr>
<td><span>A<span class="text-token-text-primary cursor-text rounded-sm" data-placeholder-token="true"></span></span></td>
<td><span>A<span class="text-token-text-primary cursor-text rounded-sm" data-placeholder-token="true"></span></span></td>
<td><span>A<span class="text-token-text-primary cursor-text rounded-sm" data-placeholder-token="true"></span></span></td>
<td><span>A<span class="text-token-text-primary cursor-text rounded-sm" data-placeholder-token="true"></span></span></td>
</tr>
<tr>
<td><span>20</span></td>
<td><span>18</span></td>
<td><span>10</span></td>
<td><span>15</span></td>
</tr>
</tbody>
</table>
<p class="isSelectedEnd"><strong><span>(c)</span></strong><span> If we implement the binary search tree with an array A, what will be the status of the array A after inserting the values </span><strong><span>{7, 4, 1, 3, 11}</span></strong><span> to an initially empty tree?</span></p>
<h1 style="text-align: center"><span>SECTION – III</span></h1>
<h2><span>Q.7.</span></h2>
<p class="isSelectedEnd"><strong><span>(a)</span></strong><span> Why normalization is used in relational databases? Define second and third normal form with an example. </span><strong><span>(10+3+3+4)</span></strong></p>
<p class="isSelectedEnd"><strong><span>(b)</span></strong><span> What is difference between primary key and the alternate key? Why primary key is used in each relation?</span></p>
<p class="isSelectedEnd"><strong><span>(c)</span></strong><span> What is difference between weak entity and strong entity?</span></p>
<p class="isSelectedEnd"><strong><span>(d)</span></strong><span> Draw an entity relationship diagram between </span><strong><span>EMPLOYEES, DEPARTMENTS and PROJECTS</span></strong><span>, assuming that each project can be started by only one department and each employee can be employed by only one department at a time. Write down any other assumption if you use it.</span></p>
<h2><span>Q.8.</span></h2>
<p class="isSelectedEnd"><strong><span>(a)</span></strong><span> Given a point </span><strong><span>P(10, 10)</span></strong><span>. Rotate this point around origin </span><strong><span>O(0, 0)</span></strong><span> at an angle of </span><strong><span>90 degree anti-clockwise</span></strong><span> and calculate the resulting point. </span><strong><span>(8+8+4)</span></strong></p>
<p class="isSelectedEnd"><strong><span>(b)</span></strong><span> Write down the conditions for point clipping.</span></p>
<p><strong><span>(c)</span></strong><span> What are the major components of a Cathode Ray Tube (CRT)? Write down names only.</span></p>
<hr />
<p><span style="font-size: 14pt"><strong><a href="https://hostnezt.com/cssfiles/csspastpapers/computer/Computer%20Science%202010.pdf" target="_blank" rel="noopener">DOWNLOAD NOW</a></strong></span></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-2010/#post-81324</guid>
                    </item>
							        </channel>
        </rss>
		