<?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 2013 - Computer Science				            </title>
            <link>https://cssforum.net/group-i-papers-computer-science/css-computer-science-paper-2013/</link>
            <description>CSS Forum Discussion Board</description>
            <language>en-US</language>
            <lastBuildDate>Sat, 15 Aug 2026 09:49:03 +0000</lastBuildDate>
            <generator>wpForo</generator>
            <ttl>60</ttl>
							                    <item>
                        <title>CSS Computer Science Paper 2013</title>
                        <link>https://cssforum.net/group-i-papers-computer-science/css-computer-science-paper-2013/#post-81327</link>
                        <pubDate>Sat, 15 Aug 2026 08:37:17 +0000</pubDate>
                        <description><![CDATA[FEDERAL PUBLIC SERVICE COMMISSIONCOMPETITIVE EXAMINATION FOR RECRUITMENT TO POSTSIN BPS-17 UNDER THE FEDERAL GOVERNMENT, 2013
COMPUTER SCIENCE
 

COMPUTER SCIENCE
TIME ALLOWED: THREE HO...]]></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, 2013</strong></span></div>
<div style="text-align: center"><span style="font-size: 14pt"><strong>COMPUTER SCIENCE</strong></span></div>
<div> </div>
<div>
<h1 class="PDq2pG_selectionAnchorContainer" style="text-align: center" data-section-id="1g2inqt" data-start="134" data-end="152"><span style="font-size: 14pt">COMPUTER SCIENCE</span><span class="PDq2pG_selectionAnchor" aria-hidden="true"></span></h1>
<p data-start="154" data-end="183"><strong data-start="154" data-end="183">TIME ALLOWED: THREE HOURS</strong></p>
<p data-start="185" data-end="234"><strong data-start="185" data-end="234">PART-I (MCQs): 30 MINUTES — MAXIMUM MARKS: 20</strong></p>
<p data-start="236" data-end="289"><strong data-start="236" data-end="289">PART-II: 2 HOURS &amp; 30 MINUTES — MAXIMUM MARKS: 80</strong></p>
<h3 data-section-id="6z7jxo" data-start="291" data-end="300">NOTE:</h3>
<p data-start="302" data-end="406">(i) First attempt PART-I (MCQs) on separate OMR Answer Sheet which shall be taken back after 30 minutes.</p>
<p data-start="408" data-end="481">(ii) Overwriting/cutting of the options/answers will not be given credit.</p>
<p data-start="483" data-end="518">(iii) Use of Calculator is allowed.</p>
<h1 style="text-align: center" data-section-id="h7qrcl" data-start="525" data-end="533"><span style="font-size: 14pt">PART-I</span></h1>
<h2 style="text-align: center" data-section-id="d65c5f" data-start="535" data-end="557"><span style="font-size: 14pt">(MCQs) — COMPULSORY</span></h2>
<h3 data-section-id="183ckcn" data-start="559" data-end="671">Q.1. Select the best option/answer and fill in the appropriate Circle on the OMR Answer Sheet. (20 × 1 = 20)</h3>
<p data-start="673" data-end="736"><strong data-start="673" data-end="680">(i)</strong> Which of the following best describes “virtual memory?”</p>
<p data-start="738" data-end="1077">(a) A portion of the hard disk considered as RAM<br data-start="786" data-end="789" />(b) Extended memory on the secondary storage that is used whenever physical memory is full<br data-start="879" data-end="882" />(c) The abstraction of separating logical memory—memory as seen by the process—from physical memory—memory as seen by the processor<br data-start="1013" data-end="1016" />(d) It is the page file in Windows folder<br data-start="1057" data-end="1060" />(e) None of these</p>
<p data-start="1079" data-end="1123"><strong data-start="1079" data-end="1087">(ii)</strong> The ‘cmp’ instruction modifies the:</p>
<p data-start="1125" data-end="1213">(a) Instruction register<br data-start="1149" data-end="1152" />(b) Flags register<br data-start="1170" data-end="1173" />(c) Segment register<br data-start="1193" data-end="1196" />(d) None of these</p>
<p data-start="1215" data-end="1270"><strong data-start="1215" data-end="1224">(iii)</strong> Consider the following page reference string:</p>
<p data-start="1272" data-end="1325"><strong data-start="1272" data-end="1325">1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1</strong></p>
<p data-start="1327" data-end="1564">Assuming there are 4 page frames available and that all frames are initially empty, what is the total number of page faults that would occur for the page reference string above if the least-recently-used (LRU) replacement policy is used?</p>
<p data-start="1566" data-end="1617">(a) 6<br data-start="1571" data-end="1574" />(b) 9<br data-start="1579" data-end="1582" />(c) 10<br data-start="1588" data-end="1591" />(d) 11<br data-start="1597" data-end="1600" />(e) None of these</p>
<p data-start="1619" data-end="1675"><strong data-start="1619" data-end="1627">(iv)</strong> The Banker’s algorithm is used to ____________.</p>
<p data-start="1677" data-end="1783">(a) Rectify deadlock<br data-start="1697" data-end="1700" />(b) Detect deadlock<br data-start="1719" data-end="1722" />(c) Prevent deadlock<br data-start="1742" data-end="1745" />(d) Avoid deadlock<br data-start="1763" data-end="1766" />(e) None of these</p>
<p data-start="1785" data-end="1862"><strong data-start="1785" data-end="1792">(v)</strong> The necessary conditions needed before deadlock can occur are ______.</p>
<p data-start="1864" data-end="2153">(a) No Mutual Exclusion, Hold and wait, Preemption, Circular Wait<br data-start="1929" data-end="1932" />(b) Mutual Exclusion, No Hold and wait, Preemption, Circular Wait<br data-start="1997" data-end="2000" />(c) Mutual Exclusion, Hold and wait, No Preemption, Circular Wait<br data-start="2065" data-end="2068" />(d) Mutual Exclusion, Hold and wait, Preemption, No Circular Wait<br data-start="2133" data-end="2136" />(e) None of these</p>
<p data-start="2155" data-end="2243"><strong data-start="2155" data-end="2163">(vi)</strong> Difference between data link layer and transport layer error detection is that:</p>
<p data-start="2245" data-end="2624">(a) Data link detects transmission errors while transport layer detects segmentation faults<br data-start="2336" data-end="2339" />(b) Data link detects node-to-node errors while transport layer detects end-to-end errors<br data-start="2428" data-end="2431" />(c) Data link detects end-to-end errors while transport layer detects node-to-node errors<br data-start="2520" data-end="2523" />(d) Data link detects segmentation errors while transport layer detects bit error<br data-start="2604" data-end="2607" />(e) None of these</p>
<p data-start="2626" data-end="2787"><strong data-start="2626" data-end="2635">(vii)</strong> Phase shift keying (PSK) method is used to modulate digital signals at 9600 bps using 16 levels. The line signals speed (i.e. modulation rate) will be:</p>
<p data-start="2789" data-end="2874">(a) 1200 bands<br data-start="2803" data-end="2806" />(b) 2400 bands<br data-start="2820" data-end="2823" />(c) 4800 bands<br data-start="2837" data-end="2840" />(d) 9600 bands<br data-start="2854" data-end="2857" />(e) None of these</p>
<p data-start="2876" data-end="2982"><strong data-start="2876" data-end="2886">(viii)</strong> Exception handling is a powerful technique that separates error-handling code from ______ code.</p>
<p data-start="2984" data-end="3057">(a) Buggy<br data-start="2993" data-end="2996" />(b) Faulty<br data-start="3006" data-end="3009" />(c) Normal<br data-start="3019" data-end="3022" />(d) Exceptional<br data-start="3037" data-end="3040" />(e) None of these</p>
<p data-start="3059" data-end="3179"><strong data-start="3059" data-end="3067">(ix)</strong> When a subroutine is called, the address of the instruction following the CALL instruction is stored in/on the:</p>
<p data-start="3181" data-end="3270">(a) Stack pointer<br data-start="3198" data-end="3201" />(b) Accumulator<br data-start="3216" data-end="3219" />(c) Program counter<br data-start="3238" data-end="3241" />(d) Stack<br data-start="3250" data-end="3253" />(e) None of these</p>
<p data-start="3272" data-end="3347"><strong data-start="3272" data-end="3279">(x)</strong> Binary tree “preorder” traversal is defined recursively as follows:</p>
<p data-start="3349" data-end="3638">(a) Traverse left subtree, visit the root, traverse right subtree<br data-start="3414" data-end="3417" />(b) Traverse right subtree, visit the root, traverse left subtree<br data-start="3482" data-end="3485" />(c) Visit the root, traverse left subtree, traverse right subtree<br data-start="3550" data-end="3553" />(d) Traverse left subtree, traverse right subtree, visit the root<br data-start="3618" data-end="3621" />(e) None of these</p>
<p data-start="3640" data-end="3740"><strong data-start="3640" data-end="3648">(xi)</strong> What value will return to the operating system upon the successful completion of a program?</p>
<p data-start="3742" data-end="3784">(a) -1<br data-start="3748" data-end="3751" />(b) 1<br data-start="3756" data-end="3759" />(c) 0<br data-start="3764" data-end="3767" />(d) None of these</p>
<p data-start="3786" data-end="3855"><strong data-start="3786" data-end="3795">(xii)</strong> Which of the following is TRUE about the given UML diagram?</p>
<p data-start="3857" data-end="4084">(a) Checking Account is a generalization of Saving Account<br data-start="3915" data-end="3918" />(b) Bank Account is composition of Checking Account and Saving Account<br data-start="3988" data-end="3991" />(c) Saving Account can process Check<br data-start="4027" data-end="4030" />(d) Checking Account has a balance<br data-start="4064" data-end="4067" />(e) None of these</p>
<p data-start="4086" data-end="4140"><strong data-start="4086" data-end="4096">(xiii)</strong> The advantages of creating a prototype are:</p>
<p data-start="4142" data-end="4385">(a) It allows developers to experiment with a number of different design options<br data-start="4222" data-end="4225" />(b) It can serve as a means of communication between developers and customers<br data-start="4302" data-end="4305" />(c) It is better than waterfall model<br data-start="4342" data-end="4345" />(d) Both (a) and (b)<br data-start="4365" data-end="4368" />(e) None of these</p>
<p data-start="4387" data-end="4426"><strong data-start="4387" data-end="4396">(xiv)</strong> Choose the correct statement.</p>
<p data-start="4428" data-end="4652">(a) Testing can show the presence of bugs but never their absence<br data-start="4493" data-end="4496" />(b) Testing can always find all the bugs<br data-start="4536" data-end="4539" />(c) Testing can always be exhaustive<br data-start="4575" data-end="4578" />(d) If we test enough then we can find all of the bugs<br data-start="4632" data-end="4635" />(e) None of these</p>
<p data-start="4654" data-end="4753"><strong data-start="4654" data-end="4662">(xv)</strong> Which of the following operations need the participating relations to be union compatible?</p>
<p data-start="4755" data-end="4839">(a) UNION<br data-start="4764" data-end="4767" />(b) INTERSECTION<br data-start="4783" data-end="4786" />(c) DIFFERENCE<br data-start="4800" data-end="4803" />(d) All of these<br data-start="4819" data-end="4822" />(e) None of these</p>
<p data-start="4841" data-end="4945"><strong data-start="4841" data-end="4850">(xvi)</strong> The language used in application programs to request data from the DBMS is referred to as the:</p>
<p data-start="4947" data-end="5004">(a) DML<br data-start="4954" data-end="4957" />(b) DDL<br data-start="4964" data-end="4967" />(c) VDL<br data-start="4974" data-end="4977" />(d) SDL<br data-start="4984" data-end="4987" />(e) None of these</p>
<p data-start="5006" data-end="5059"><strong data-start="5006" data-end="5016">(xvii)</strong> What is the correct XHTML for a paragraph?</p>
<p data-start="5061" data-end="5142">(a) <code data-start="5065" data-end="5074">&lt;P&gt;&lt;/p&gt;</code><br data-start="5074" data-end="5077" />(b) <code data-start="5081" data-end="5090">&lt;P&gt;&lt;/P&gt;</code><br data-start="5090" data-end="5093" />(c) <code data-start="5097" data-end="5106">&lt;p&gt;&lt;/p&gt;</code><br data-start="5106" data-end="5109" />(d) <code data-start="5113" data-end="5122">&lt;/p&gt;&lt;p&gt;</code><br data-start="5122" data-end="5125" />(e) None of these</p>
<p data-start="5144" data-end="5254"><strong data-start="5144" data-end="5155">(xviii)</strong> Which of the following HTML form method is suitable when you need to send larger form submissions?</p>
<p data-start="5256" data-end="5329">(a) Get<br data-start="5263" data-end="5266" />(b) Post<br data-start="5274" data-end="5277" />(c) Both Get and Post<br data-start="5298" data-end="5301" />(d) Ajax<br data-start="5309" data-end="5312" />(e) None of these</p>
<p data-start="5331" data-end="5455"><strong data-start="5331" data-end="5340">(xix)</strong> <strong data-start="5341" data-end="5351">(2, 4)</strong> is a point on a circle that has center at the origin. Which of the following points are also on circle?</p>
<p data-start="5457" data-end="5535">(a) (2, -4)<br data-start="5468" data-end="5471" />(b) (-2, 4)<br data-start="5482" data-end="5485" />(c) (4, -2)<br data-start="5496" data-end="5499" />(d) All of above<br data-start="5515" data-end="5518" />(e) None of these</p>
<p data-start="5537" data-end="5622"><strong data-start="5537" data-end="5545">(xx)</strong> In Bresenham's algorithm, while generating a circle, it is easy to generate:</p>
<p data-start="5624" data-end="5832">(a) One octant first and other by successive reflection<br data-start="5679" data-end="5682" />(b) One octant first and other by successive rotation<br data-start="5735" data-end="5738" />(c) One octant first and other by successive translation<br data-start="5794" data-end="5797" />(d) All octants<br data-start="5812" data-end="5815" />(e) None of these</p>
<h1 data-section-id="1yvqorg" data-start="5839" data-end="5848"><span style="font-size: 14pt">PART-II</span></h1>
<h3 data-section-id="6z7jxo" data-start="5850" data-end="5859">NOTE:</h3>
<p data-start="5861" data-end="5920">(i) Part-II is to be attempted on the separate Answer Book.</p>
<p data-start="5922" data-end="6022">(ii) Candidate must write Q. No. in the Answer Book in accordance with Q. No. in the Question Paper.</p>
<p data-start="6024" data-end="6163">(iii) Attempt <strong data-start="6038" data-end="6061">ONLY FOUR questions</strong> from PART-II, selecting at least <strong data-start="6095" data-end="6129">ONE question from EACH SECTION</strong>. ALL questions carry EQUAL marks.</p>
<p data-start="6165" data-end="6261">(iv) Extra attempt of any question or any part of the attempted question will not be considered.</p>
<p data-start="6263" data-end="6296">(v) Use of Calculator is allowed.</p>
<h1 style="text-align: center" data-section-id="1ap2z37" data-start="6303" data-end="6314">SECTION-A</h1>
<h2 data-section-id="1gzjynd" data-start="6316" data-end="6328">Q. No. 2.</h2>
<h3 data-section-id="1xxeocm" data-start="6330" data-end="6337">(a)</h3>
<p data-start="6339" data-end="6412">Define <strong data-start="6346" data-end="6386">latency, transfer time and seek time</strong> with respect to disk I/O.</p>
<p data-start="6414" data-end="6494">Compare the given disk scheduling algorithms for cylinder requests in the order:</p>
<p data-start="6496" data-end="6524"><strong data-start="6496" data-end="6524">11, 1, 36, 16, 34, 9, 12</strong></p>
<ul data-start="6526" data-end="6629">
<li data-section-id="165lfvm" data-start="6526" data-end="6559">First-Come, First-Served (FCFS)</li>
<li data-section-id="12otxgx" data-start="6560" data-end="6593">Shortest-Seek-Time-First (SSTF)</li>
<li data-section-id="6rzdot" data-start="6594" data-end="6611">SCAN and C-SCAN</li>
<li data-section-id="v7ih8t" data-start="6612" data-end="6629">LOOK and C-LOOK</li>
</ul>
<p data-start="6631" data-end="6639"><strong data-start="6631" data-end="6639">(12)</strong></p>
<h3 data-section-id="1xxeobp" data-start="6641" data-end="6648">(b)</h3>
<p data-start="6650" data-end="6685">Write short notes on the following:</p>
<p data-start="6687" data-end="6704"><strong data-start="6687" data-end="6704">(i) Semaphore</strong></p>
<p data-start="6706" data-end="6731"><strong data-start="6706" data-end="6731">(ii) Belady's Anomaly</strong></p>
<p data-start="6733" data-end="6752"><strong data-start="6733" data-end="6752">(iii) Thrashing</strong></p>
<p data-start="6754" data-end="6761"><strong data-start="6754" data-end="6761">(8)</strong></p>
<h2 data-section-id="1gzjyko" data-start="6768" data-end="6780">Q. No. 3.</h2>
<h3 data-section-id="1xxeocm" data-start="6782" data-end="6789">(a)</h3>
<p data-start="6791" data-end="6867">What is the significance of the <strong data-start="6823" data-end="6836">OSI model</strong> in the communication paradigm?</p>
<p data-start="6869" data-end="6930">Compare the layers of OSI with the <strong data-start="6904" data-end="6929">TCP/IP protocol stack</strong>.</p>
<p data-start="6932" data-end="6939"><strong data-start="6932" data-end="6939">(8)</strong></p>
<h3 data-section-id="1xxeobp" data-start="6941" data-end="6948">(b)</h3>
<p data-start="6950" data-end="7046">Compare <strong data-start="6958" data-end="6999">IEEE 802.3, IEEE 802.4 and IEEE 802.5</strong>. Also mention their problems and applications.</p>
<p data-start="7048" data-end="7055"><strong data-start="7048" data-end="7055">(8)</strong></p>
<h3 data-section-id="1xxeoas" data-start="7057" data-end="7064">(c)</h3>
<p data-start="7066" data-end="7145">Differentiate between <strong data-start="7088" data-end="7102">Link State</strong> and <strong data-start="7107" data-end="7126">Distance Vector</strong> routing protocols.</p>
<p data-start="7147" data-end="7154"><strong data-start="7147" data-end="7154">(4)</strong></p>
<h1 style="text-align: center" data-section-id="1ap2z34" data-start="7161" data-end="7172">SECTION-B</h1>
<h2 data-section-id="1gzjyi7" data-start="7174" data-end="7186">Q. No. 4.</h2>
<h3 data-section-id="1xxeocm" data-start="7188" data-end="7195">(a)</h3>
<p data-start="7197" data-end="7252">What is the concept of <strong data-start="7220" data-end="7235">inheritance</strong> in OOP paradigm?</p>
<p data-start="7254" data-end="7297">How can we achieve inheritance in <strong data-start="7288" data-end="7296">JAVA</strong>?</p>
<p data-start="7299" data-end="7306"><strong data-start="7299" data-end="7306">(8)</strong></p>
<h3 data-section-id="1xxeobp" data-start="7308" data-end="7315">(b)</h3>
<p data-start="7317" data-end="7427">Why is a <strong data-start="7326" data-end="7337">B+ tree</strong> a better structure than an <strong data-start="7365" data-end="7377">AVL tree</strong> for implementation of an indexed sequential file?</p>
<p data-start="7429" data-end="7458">Explain this with an example.</p>
<p data-start="7460" data-end="7467"><strong data-start="7460" data-end="7467">(6)</strong></p>
<h3 data-section-id="1xxeoas" data-start="7469" data-end="7476">(c)</h3>
<p data-start="7478" data-end="7501">Convert the expression:</p>
<p data-start="7503" data-end="7540"><strong data-start="7503" data-end="7540">((A + B) * C - (D - E) ^ (F + G))</strong></p>
<p data-start="7542" data-end="7593">to equivalent <strong data-start="7556" data-end="7566">Prefix</strong> and <strong data-start="7571" data-end="7582">Postfix</strong> notations.</p>
<p data-start="7595" data-end="7602"><strong data-start="7595" data-end="7602">(6)</strong></p>
<h2 data-section-id="1gzjyfi" data-start="7609" data-end="7621">Q. No. 5.</h2>
<h3 data-section-id="1xxeocm" data-start="7623" data-end="7630">(a)</h3>
<p data-start="7632" data-end="7707">Describe the <strong data-start="7645" data-end="7685">spiral model of software development</strong> with its application.</p>
<p data-start="7709" data-end="7716"><strong data-start="7709" data-end="7716">(7)</strong></p>
<h3 data-section-id="1xxeobp" data-start="7718" data-end="7725">(b)</h3>
<p data-start="7727" data-end="7757">Write a note on the following:</p>
<p data-start="7759" data-end="7793"><strong data-start="7759" data-end="7793">(i) Software Quality Assurance</strong></p>
<p data-start="7795" data-end="7817"><strong data-start="7795" data-end="7817">(ii) Smoke Testing</strong></p>
<p data-start="7819" data-end="7848"><strong data-start="7819" data-end="7848">(iii) Extreme Programming</strong></p>
<p data-start="7850" data-end="7858"><strong data-start="7850" data-end="7858">(13)</strong></p>
<h1 style="text-align: center" data-section-id="1ap2z35" data-start="7865" data-end="7876">SECTION-C</h1>
<h2 data-section-id="1gzjyjx" data-start="7878" data-end="7890">Q. No. 6.</h2>
<h3 data-section-id="1xxeocm" data-start="7892" data-end="7899">(a)</h3>
<p data-start="7901" data-end="7961">What are the main features of the <strong data-start="7935" data-end="7960">Relational Data Model</strong>?</p>
<p data-start="7963" data-end="8022">Why is it more useful than the <strong data-start="7994" data-end="8021">Hierarchical Data Model</strong>?</p>
<p data-start="8024" data-end="8031"><strong data-start="8024" data-end="8031">(7)</strong></p>
<h3 data-section-id="1xxeobp" data-start="8033" data-end="8040">(b)</h3>
<p data-start="8042" data-end="8078">What is <strong data-start="8050" data-end="8077">2PL (Two-Phase Locking)</strong>?</p>
<p data-start="8080" data-end="8222">Give a schedule of two complete transactions that are not allowed by a <strong data-start="8151" data-end="8175">strict 2PL scheduler</strong> but are accepted by a <strong data-start="8198" data-end="8221">basic 2PL scheduler</strong>.</p>
<p data-start="8224" data-end="8231"><strong data-start="8224" data-end="8231">(7)</strong></p>
<h3 data-section-id="1xxeoas" data-start="8233" data-end="8240">(c)</h3>
<p data-start="8242" data-end="8287">Write a note on <strong data-start="8258" data-end="8269">any ONE</strong> of the following:</p>
<p data-start="8289" data-end="8300"><strong data-start="8289" data-end="8300">(i) ERD</strong></p>
<p data-start="8302" data-end="8324"><strong data-start="8302" data-end="8324">(ii) Normalization</strong></p>
<p data-start="8326" data-end="8333"><strong data-start="8326" data-end="8333">(6)</strong></p>
<h2 data-section-id="1gzjyh8" data-start="8340" data-end="8352">Q. No. 7.</h2>
<h3 data-section-id="1xxeocm" data-start="8354" data-end="8361">(a)</h3>
<p data-start="8363" data-end="8425">What is the significance of <strong data-start="8391" data-end="8405">JavaScript</strong> in web development?</p>
<p data-start="8427" data-end="8479">Why is input validation done on the <strong data-start="8463" data-end="8478">client side</strong>?</p>
<p data-start="8481" data-end="8488"><strong data-start="8481" data-end="8488">(5)</strong></p>
<h3 data-section-id="1xxeobp" data-start="8490" data-end="8497">(b)</h3>
<p data-start="8499" data-end="8538">Explain <strong data-start="8507" data-end="8520">any THREE</strong> of the following:</p>
<p data-start="8540" data-end="8567"><strong data-start="8540" data-end="8567">(i) Affiliate Marketing</strong></p>
<p data-start="8569" data-end="8590"><strong data-start="8569" data-end="8590">(ii) Web Services</strong></p>
<p data-start="8592" data-end="8623"><strong data-start="8592" data-end="8623">(iii) Server Side Scripting</strong></p>
<p data-start="8625" data-end="8637"><strong data-start="8625" data-end="8637">(iv) SEO</strong></p>
<hr />
<p data-start="8625" data-end="8637"><strong><span style="font-size: 14pt"><a href="https://hostnezt.com/cssfiles/csspastpapers/computer/Computer%20Science%202013.pdf" target="_blank" rel="noopener">DOWNLOAD NOW </a></span></strong></p>
</div>]]></content:encoded>
						                            <category domain="https://cssforum.net/group-i-papers-computer-science/">Computer Science</category>                        <dc:creator>zarnishayat</dc:creator>
                        <guid isPermaLink="true">https://cssforum.net/group-i-papers-computer-science/css-computer-science-paper-2013/#post-81327</guid>
                    </item>
							        </channel>
        </rss>
		