<?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 2018 - Computer Science				            </title>
            <link>https://cssforum.net/group-i-papers-computer-science/css-computer-science-paper-2018/</link>
            <description>CSS Forum Discussion Board</description>
            <language>en-US</language>
            <lastBuildDate>Sat, 15 Aug 2026 11:59:42 +0000</lastBuildDate>
            <generator>wpForo</generator>
            <ttl>60</ttl>
							                    <item>
                        <title>CSS Computer Science Paper 2018</title>
                        <link>https://cssforum.net/group-i-papers-computer-science/css-computer-science-paper-2018/#post-81336</link>
                        <pubDate>Sat, 15 Aug 2026 10:32:11 +0000</pubDate>
                        <description><![CDATA[FEDERAL PUBLIC SERVICE COMMISSIONCOMPETITIVE EXAMINATION FOR RECRUITMENT TO POSTSIN BPS-17 UNDER THE FEDERAL GOVERNMENT, 2018
COMPUTER SCIENCE, PAPER-I
PART-IISECTION-I
Q. 2. (a) How many...]]></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, 2018</strong></span></p>
<p style="text-align: center"><strong><span style="font-size: 14pt">COMPUTER SCIENCE, PAPER-I</span></strong></p>
<p style="text-align: center"><strong><span style="font-size: 14pt">PART-II</span></strong><br /><strong><span style="font-size: 14pt">SECTION-I</span></strong></p>
<p><br /><strong>Q. 2.</strong> (a) How many layers are in the TCP/IP stack? What are the names?</p>
<p><br />(b) How digital evidences can be preserved from a crime scene. Write in details by taking<br />examples of digital devices commonly used these days.<br />(c) What are the responsibilities of Operating system kernel?<br />(d) List down any four best practices for coding standards.<br />(e) Why do modern processors use more power when their clock frequency is increased?<br />(f) Ali is telling Ahmad that he is representing a -ve number and its most significant bit is 1,<br />Ahmad immediately shouted you are representing numbers using 2's compliment. True<br />or False. And why?<br />(g) If time slice is of 50 milliseconds and context switch requires a microsecond, how many<br />processes can the machine service in a second?<br />(4)<br />(4)<br />(3)<br />(3)<br />(2)<br />(2)<br />(2)<br />Q. 3. (a) Write a program grade average calculator, User will input marks for five subjects and<br />program will output the average of its marks. Print appropriate message on the base of<br />its mark's average e.g.; Well done, Keep it up, Better luck next time etc.<br />(b) Given that i,j,k,n &amp; m are integer variables. Write a condition such that:<br />i- hello is only printed when, any of the following conditions are met: i is twice<br />the value of j, j is smaller than k and less than n, or m is negative.<br />inti,j,k,n,m; cin&gt;&gt;i&gt;&gt;j&gt;&gt;k&gt;&gt;n&gt;&gt;m;<br />if( )<br />cout&lt;&lt;”hello”;<br />ii. hello is only printed when i does not lies in the interval 6-9<br />inti; cin&gt;&gt;i;<br />if( )<br />cout&lt;&lt;“hello”;<br />(c) Write equivalent instruction to following instruction without the use of += operator:<br />where w,z are integers.<br />w+=2*z+4;<br />(d) Predict the values of variables a &amp; b after every instruction<br />integer a=5 b=6<br />a=(b++) + 3;<br />b=--a;<br />(e) Complete the code such that it prompts the user for +ve number n. Then displays the<br />output.(whatever the value of n is)(HINT: instead of triangles of stars its triangles of<br />increasing numbers)[marks<br />1 2 3 4 . . . n<br />1 2 3 4 ..n-1<br />. . .<br />. . .<br />1 2<br />1</p>
<p>for n=4 it will print<br />1 2 3 4<br />1 2 3<br />1 2<br />1<br />void main()<br />{<br />int n; cin&gt;&gt;n;<br />// your loops will go here<br />}<br />(f) In following code replace the character at posth location in the string st with the ,character<br />ch. For example in string helloworld replacing 2nd character with i would result in<br />hilloworld<br />void main( )<br />{char st; int pos; char ch;<br />int size=0;<br />cin&gt;&gt;st;<br />cin&gt;&gt;pos&gt;&gt;ch;<br />while(st!='\0')<br />{<br />size++; // calculating length of current string<br />}<br />// write your code here<br />}<br />(5)</p>
<p><br /><strong>Q. 4.</strong> Consider the inheritance hierarchy shown below. Each part of this question is independent.<br />(a) In which class(es) would it make most sense to have protected members? Which class(es)<br />would be able to access those protected members directly?<br />(b) Which class(es) can access private members of class C directly?<br />(c) Suppose class C contains a pure virtual function. Suppose we wish to instantiate objects of<br />this hierarchy. Which class(es) are or could be abstract and which are concrete?<br />(d) Consider the following list of classes: Car, SteeringWheel, Vehicle, Van, Minivan,<br />AudioSystem, ParkingLot. Your task is to describe all of the is-a and has-a relationships<br />between these classes. Include an inheritance hierarchy for all classes that fit. Fill in the<br />table with is-a or has-a relationship while leaving the cells empty where no relation is<br />applicable.<br />Vehicle Car Van Mini<br />Van<br />Steering<br />Wheel<br />Audio<br />System<br />Parking<br />Lot<br />Vehicle<br />Car is-a<br />Van<br />Mini Van<br />Steering Wheel<br />Audio System<br />Parking Lot</p>
<p><strong>Q. 5. (a) What is dangling pointer?</strong></p>
<p><br />(b) What data structure would employ to build a text editor and why?<br />(c) Random insertion of nodes into a binary search tree would result in what types of tree<br />shape. Elaborate.<br />(d) How would you modify a link list based queue so that first and last node can be accessed<br />in a constant time regardless of data nodes in the queue?<br />(3)<br />(5)<br />(7)<br />(5)<br /><br /><strong>Q. 6. (a) Define balanced tree both for AVL and Binary search tree.</strong></p>
<p><br />(b) What is informed or heuristic search what type of algorithm is used to do such a search?<br />(c) Differentiate between graph and trees. Which is special case of the other?<br />(d) Explain what type of problems can be solved by genetic algorithm.<br />(4)<br />(6)<br />(5)<br />(5)</p>
<p><br /><strong>Q. 7. (a) Outline the difference between software verification and software validation.</strong></p>
<p><br />(b) Give an outline of the unit testing process for verification.<br />(c) Agile Development is a process that values responding to change over following a plan.<br />Discuss three issues a Software Engineer should be mindful of when adopting this<br />approach during software development.<br />(d) What type of project is not suited to incremental methods?<br />(e) Outline the difference between Black box and White box testing.<br />(4)<br />(4)<br />(4)<br />(4)<br />(4)</p>
<p><br /><strong>Q. 8. (a) What is the difference between lexers and parsers?</strong></p>
<p><br />(b) Write a grammar (BNF) for the language of palindromes.<br />(c) Here DFA is given for the language L find the DFA for L2</p>
<p>(d) Convert the following DFA to a RE:</p>
<div style="text-align: center"><strong><span style="font-size: 14pt">FEDERAL PUBLIC SERVICE COMMISSION</span></strong><br /><strong><span style="font-size: 14pt">COMPETITIVE EXAMINATION-2018</span></strong><br /><strong><span style="font-size: 14pt">FOR RECRUITMENT TO POSTS IN BS-17</span></strong><br /><strong><span style="font-size: 14pt">UNDER THE FEDERAL GOVERNMENT</span></strong></div>
<div style="text-align: center"><br /><strong><span style="font-size: 14pt">COMPUTER SCIENCE, PAPER-II</span></strong></div>
<div style="text-align: center"><span style="font-size: 14pt"><strong>PART – II</strong></span><br /><span style="font-size: 14pt"><strong>SECTION – A</strong></span></div>
<div><br /><strong>Q. No.2.</strong> (A) Briefly describe the functionality of the following CPU special-purpose<br />registers: Instruction Register (IR), Memory Data Register (MDR) and<br />Program Counter (PC).</div>
<div><br />(B) Differentiate between Address, Data and Control bus.<br />(C) Discuss instruction pipelining in the context of fetch-decode-execute cycle.<br />(8)<br />(6)<br />(6)</div>
<div><br /><strong>Q. No.3.</strong> (A) Differentiate between hub, bridge, switch and router.<br />(B) Discuss how Network Address Translation (NAT) works and why is it useful?<br />(C) Elaborate the working of multiplexing/de-multiplexing at the transport layer.<br />(8)<br />(6)<br />(6)</div>
<div><br /><strong>Q. No.4.</strong> (A) There are three processes PA, PB and PC and three resources RA, RB and RC.<br />Resources RA and RB have one instance each while resource RC has two<br />instances. PA is holding one instance of RC and has requested for RA. Process<br />PB is holding RA and has requested for RB. RB is allocated to PC which has also<br />requested an instance of RC. Represent the scenario with a resource allocation<br />graph. Discuss whether there is a deadlock or not? If yes, which processes are<br />blocked?<br />(B) In the context of Paging, consider the case where memory addresses are 32 bits<br />i.e. 20 bits Virtual Page Numbers and 12 bits of offset. How many virtual pages<br />are there and what is the size of each page? Given the virtual address 0x7589,<br />find the virtual page number and offset. If the respective page table entry<br />contains 0x900DF, find the physical address.<br />(C) In the context of I/O management, differentiate between Pooling and Interrupts.<br />(8)<br />(6)<br />(6)</div>
<div style="text-align: center"><br /><span style="font-size: 14pt"><strong>Section – B</strong></span></div>
<div><br /><strong>Q. No.5.</strong> (A) Given two relations R and S, where R contains M tuples, S contains N tuples,<br />and M &gt;N &gt; 0, give the minimum and maximum possible sizes (in tuples) for<br />the resulting relation produced by each of the following relational algebra<br />expressions.<br />i. RS −<br />ii. RS ∪<br />iii. RS ∩<br />iv. RS<br />(B) Elaborate the concepts of super key, candidate key and foreign key with<br />examples.<br />(C) Discuss the difference between physical data independence and logical data<br />independence.</div>
<div> </div>
<div><strong>Q. No.6.</strong> (A) Differentiate between image sampling and quantization. Discuss how these<br />concepts relate to spatial and intensity resolutions.<br />(B) In the context of image smoothing, discuss the differences between mean and<br />median filters.<br />(C) For the image ‘X’ shown in Figure 1, show the result of applying the given<br />morphological operators. Assume zero padding for border pixels.<br />i. Dilation of X by structuring element .<br />ii. Erosion of X by structuring element T<br />iii. Dilation of X by a 3x3 structuring element containing all ones.<br />(8)<br />(6)<br />(6)</div>
<div><br /><strong>Q. No.7.</strong> (A) Perform histogram equalization on the 8-bit image shown in Figure 2.<br />(B) For the 3x3 image shown in the following, apply the horizontal and vertical<br />Sobel operators and compute the magnitude of gradient at the central pixel with<br />intensity value 50.<br />5 5 5<br />5 50 5<br />5 5 5<br />(C) In the context of compression, differentiate between coding, spatial and<br />temporal redundancies.<br />(8)<br />(6)<br />(6)</div>
<div><br /><strong>Q. No.8.</strong> (A) Elaborate the concept of three tier architecture with reference to presentation,<br />business logic and data access layers.<br />(B) Differentiate between XHTML and XML.<br />(C) Discuss Agile and Water Fall methodologies in the context of web application<br />development.</div>
<hr />
<p><strong><span style="font-size: 14pt"><a href="https://hostnezt.com/cssfiles/csspastpapers/computer/Computer%20Science%202018.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-2018/#post-81336</guid>
                    </item>
							        </channel>
        </rss>
		