{"id":22674,"date":"2018-12-01T16:15:55","date_gmt":"2018-12-01T10:45:55","guid":{"rendered":"http:\/\/mycbseguide.com\/blog\/?p=22674"},"modified":"2018-12-19T14:10:30","modified_gmt":"2018-12-19T08:40:30","slug":"cbse-question-paper-2015-class-12-computer-science","status":"publish","type":"post","link":"https:\/\/mycbseguide.com\/blog\/cbse-question-paper-2015-class-12-computer-science\/","title":{"rendered":"CBSE Question Paper 2015 class 12 Computer Science"},"content":{"rendered":"<div id=\"ez-toc-container\" class=\"ez-toc-v2_0_76 counter-hierarchy ez-toc-counter ez-toc-grey ez-toc-container-direction\">\n<div class=\"ez-toc-title-container\">\n<p class=\"ez-toc-title\" style=\"cursor:inherit\">Table of Contents<\/p>\n<span class=\"ez-toc-title-toggle\"><a href=\"#\" class=\"ez-toc-pull-right ez-toc-btn ez-toc-btn-xs ez-toc-btn-default ez-toc-toggle\" aria-label=\"Toggle Table of Content\"><span class=\"ez-toc-js-icon-con\"><span class=\"\"><span class=\"eztoc-hide\" style=\"display:none;\">Toggle<\/span><span class=\"ez-toc-icon-toggle-span\"><svg style=\"fill: #999;color:#999\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" class=\"list-377408\" width=\"20px\" height=\"20px\" viewBox=\"0 0 24 24\" fill=\"none\"><path d=\"M6 6H4v2h2V6zm14 0H8v2h12V6zM4 11h2v2H4v-2zm16 0H8v2h12v-2zM4 16h2v2H4v-2zm16 0H8v2h12v-2z\" fill=\"currentColor\"><\/path><\/svg><svg style=\"fill: #999;color:#999\" class=\"arrow-unsorted-368013\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" width=\"10px\" height=\"10px\" viewBox=\"0 0 24 24\" version=\"1.2\" baseProfile=\"tiny\"><path d=\"M18.2 9.3l-6.2-6.3-6.2 6.3c-.2.2-.3.4-.3.7s.1.5.3.7c.2.2.4.3.7.3h11c.3 0 .5-.1.7-.3.2-.2.3-.5.3-.7s-.1-.5-.3-.7zM5.8 14.7l6.2 6.3 6.2-6.3c.2-.2.3-.5.3-.7s-.1-.5-.3-.7c-.2-.2-.4-.3-.7-.3h-11c-.3 0-.5.1-.7.3-.2.2-.3.5-.3.7s.1.5.3.7z\"\/><\/svg><\/span><\/span><\/span><\/a><\/span><\/div>\n<nav><ul class='ez-toc-list ez-toc-list-level-1 eztoc-toggle-hide-by-default' ><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-1\" href=\"https:\/\/mycbseguide.com\/blog\/cbse-question-paper-2015-class-12-computer-science\/#Class_12_Computer_Science_list_of_chapters\" >Class 12 Computer Science list of chapters<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-2\" href=\"https:\/\/mycbseguide.com\/blog\/cbse-question-paper-2015-class-12-computer-science\/#CBSE_Question_Paper_2015_class_12_Computer_Science\" >CBSE Question Paper 2015 class 12 Computer Science<\/a><ul class='ez-toc-list-level-3' ><li class='ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-3\" href=\"https:\/\/mycbseguide.com\/blog\/cbse-question-paper-2015-class-12-computer-science\/#General_Instructions\" >General Instructions:<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-4\" href=\"https:\/\/mycbseguide.com\/blog\/cbse-question-paper-2015-class-12-computer-science\/#Section_%E2%80%90_A\" >Section \u2010 A<\/a><\/li><\/ul><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-5\" href=\"https:\/\/mycbseguide.com\/blog\/cbse-question-paper-2015-class-12-computer-science\/#Last_Year_Question_Paper_Class_12_Computer_Science_2015\" >Last Year Question Paper Class 12 Computer Science 2015<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-6\" href=\"https:\/\/mycbseguide.com\/blog\/cbse-question-paper-2015-class-12-computer-science\/#Previous_Year_Question_Paper_for_class_12_in_PDF\" >Previous Year Question Paper for class 12 in PDF<\/a><\/li><\/ul><\/nav><\/div>\n<p><strong>CBSE Question Paper 2015 class 12 Computer Science<\/strong>\u00a0conducted by Central Board of Secondary Education, New Delhi in the month of March 2015. CBSE previous year question papers with solution are available in myCBSEguide mobile app and cbse guide website. The Best CBSE App for students and teachers is myCBSEguide which provides complete study material and practice papers to cbse schools in India and abroad.<\/p>\n<p style=\"text-align: center;\"><strong>CBSE Question Paper 2015 class 12 Computer Science<\/strong><\/p>\n<p style=\"text-align: center;\"><strong><a class=\"button\" href=\"https:\/\/mycbseguide.com\/downloads\/cbse-class-12-computer-science\/1851\/cbse-last-year-papers\/3\/\">Download as PDF<\/a><\/strong><\/p>\n<h2><span class=\"ez-toc-section\" id=\"Class_12_Computer_Science_list_of_chapters\"><\/span>Class 12 Computer Science list of chapters<span class=\"ez-toc-section-end\"><\/span><\/h2>\n<ol>\n<li>Review of Python<\/li>\n<li>Concept of Object Oriented Programming<\/li>\n<li>Classes in Python<\/li>\n<li>Inheritance<\/li>\n<li>Linear List Manipulation<\/li>\n<li>Stacks &amp; Queues in list<\/li>\n<li>Data File Handling<\/li>\n<li>Exception Handling &amp; Green Functions<\/li>\n<li>Databases Concepts and SQL<\/li>\n<li>Structure\u00a0 Query Language<\/li>\n<li>Boolean Algebra<\/li>\n<li>Boolean Functions &amp; Reduce Forms<\/li>\n<li>Application of Boolean Logic<\/li>\n<li>Networking Concepts\u00a0 (Part 1)<\/li>\n<li>Networking Concepts\u00a0 (Part 2)<\/li>\n<li>Networking Protocols<\/li>\n<li>Mobile Telecommunication Technologies, Network Security and Internet Services<\/li>\n<\/ol>\n<h2><span class=\"ez-toc-section\" id=\"CBSE_Question_Paper_2015_class_12_Computer_Science\"><\/span>CBSE Question Paper 2015 class 12 Computer Science<span class=\"ez-toc-section-end\"><\/span><\/h2>\n<div>\n<h3><span class=\"ez-toc-section\" id=\"General_Instructions\"><\/span><strong>General Instructions:<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n<ul>\n<li>All questions are compulsory.<\/li>\n<li>Programming Language : Section A refers to C++<\/li>\n<li>Programming Language : Section B refers to Python.<\/li>\n<li>Attempt either Section A or Section B.<\/li>\n<li>Section C is compulsory for all.<\/li>\n<li>It is compulsory to mention \u2018Section A\u2019 or \u2018Section B\u2019 before attempting the question paper.<\/li>\n<\/ul>\n<hr \/>\n<h3 style=\"text-align: center;\"><span class=\"ez-toc-section\" id=\"Section_%E2%80%90_A\"><\/span><strong>Section \u2010 A<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n<p><strong>(Only for C++ candidates)<\/strong><\/p>\n<p><strong>1 (a) Find the correct identifiers out of the following, which can be used for naming variable, constants or functions in a C++ program: (2)<\/strong><\/p>\n<p><strong>While, for, Float, new, 2ndName, A%B, Amount2, _Counter<\/strong><\/p>\n<p><strong>Ans.<\/strong> While, Float, Amount2, _Counter<\/p>\n<p>(\u00bd Mark for each correct identifier)<\/p>\n<p>Note:0<\/p>\n<ul>\n<li>Deduct \u00bd Mark for writing additional incorrect identifier(s)<\/li>\n<li>No marks to be awarded if all the identifiers are mentioned<\/li>\n<\/ul>\n<p><strong>(b) Observe the following program very carefully and write the names of those header file(s), which are essentially needed to compile and execute the following program successfully: (1)<\/strong><\/p>\n<p><strong>typedef char TEXT[80]\u037e<\/strong><\/p>\n<p><strong>void main()<\/strong><\/p>\n<p><strong>{<\/strong><\/p>\n<p><strong>TEXT Str[] = \u201cPeace is supreme\u201d\u037e<\/strong><\/p>\n<p><strong>int Index=0\u037e<\/strong><\/p>\n<p><strong>while (Str[Index]!=\u2019\\0\u2019)<\/strong><\/p>\n<p><strong>if (isupper(Str[Index]))<\/strong><\/p>\n<p><strong>Str[Index++]=\u2019#\u2019\u037e<\/strong><\/p>\n<p><strong>else<\/strong><\/p>\n<p><strong>Str[Index++]=\u2019*\u2019\u037e<\/strong><\/p>\n<p><strong>puts(str)\u037e<\/strong><\/p>\n<p><strong>}<\/strong><\/p>\n<p><strong>Ans.<\/strong> ctype, stdio<\/p>\n<p>(\u00bd Mark for each correct header file)<\/p>\n<p>Note:<\/p>\n<p>Ignore any additional header file(s)<\/p>\n<p><strong>(c) Observe the following C++ code very carefully and rewrite it after removing any\/all syntactical errors with each correction underlined. (2)<\/strong><\/p>\n<p><strong>Note: Assume all required header files are already being included in the program.<\/strong><\/p>\n<p><strong>#Define float Max=70.0\u037e<\/strong><\/p>\n<p><strong>Void main()<\/strong><\/p>\n<p><strong>{<\/strong><\/p>\n<p><strong>int Speed<\/strong><\/p>\n<p><strong>char Stop=\u2019N\u2019\u037e<\/strong><\/p>\n<p><strong>cin&gt;&gt;Speed\u037e<\/strong><\/p>\n<p><strong>if Speed&gt;Max<\/strong><\/p>\n<p><strong>Stop=\u2019Y\u2019\u037e<\/strong><\/p>\n<p><strong>cout&lt;&lt;Stop&lt;&lt;end\u037e<\/strong><\/p>\n<p><strong>}<\/strong><\/p>\n<p><strong>Ans.<\/strong> <u>#define Max 70.0<\/u> \/\/Error 1,2,3<\/p>\n<p>v oid main() \/\/Error 4<\/p>\n<p>{<\/p>\n<p>int Speed \u037e \/\/Error 5<\/p>\n<p>char Stop=\u2019N\u2019\u037e<\/p>\n<p>cin&gt;&gt;Speed\u037e<\/p>\n<p>if (Speed&gt;Max) \/\/Error 6<\/p>\n<p>Stop=\u2019Y\u2019\u037e<\/p>\n<p>cout&lt;&lt;Stop&lt;&lt; endl \u037e \/\/Error 7<\/p>\n<p>}<\/p>\n<p>(\u00bd Mark for each correction upto a maximum of 4 corrections)<\/p>\n<p style=\"text-align: center;\"><strong>OR<\/strong><\/p>\n<p>(1 Mark for only identifying any 4 errors, without suggesting corrections)<\/p>\n<p><strong>(d) Write the output of the following C++ program code: (2)<\/strong><\/p>\n<p><strong>Note: Assume all required header files are already being included in the program .<\/strong><\/p>\n<p><strong>void Position (int &amp;C1, int C2=3)<\/strong><\/p>\n<p><strong>{<\/strong><\/p>\n<p><strong>C1+=2\u037e<\/strong><\/p>\n<p><strong>C2+=Y\u037e<\/strong><\/p>\n<p><strong>}<\/strong><\/p>\n<p><strong>void main()<\/strong><\/p>\n<p><strong>{<\/strong><\/p>\n<p><strong>int P1=20, P2=4\u037e<\/strong><\/p>\n<p><strong>Position(P1)\u037e<\/strong><\/p>\n<p><strong>cout&lt;&lt;P1&lt;&lt;\u201d,\u201d&lt;&lt;P2&lt;&lt;endl\u037e<\/strong><\/p>\n<p><strong>Position(P2,P1)\u037e<\/strong><\/p>\n<p><strong>cout&lt;&lt;P1&lt;&lt;\u201d,\u201d&lt;&lt;P2&lt;&lt;endl\u037e<\/strong><\/p>\n<p><strong>}<\/strong><\/p>\n<p><strong>Ans.<\/strong> 22,4<\/p>\n<p>22,6<\/p>\n<p>(\u00bd Mark for each correct value of output)<\/p>\n<p>Note:<\/p>\n<ul>\n<li>Deduct \u00bd Mark for not considering any or all endl(s) at proper place(s)<\/li>\n<li>Deduct \u00bd Mark for not considering any or all \u2018,\u2019 at proper place(s)<\/li>\n<\/ul>\n<p style=\"text-align: center;\"><strong>OR<\/strong><\/p>\n<p>(Full 2 marks to be awarded for mentioning Syntax Error OR undeclared variable Y)<\/p>\n<p><strong>(e) Write the output of the following C++ program code: (3)<\/strong><\/p>\n<p><strong>Note: Assume all the required header files are already being included in the program.<\/strong><\/p>\n<p><strong>class Calc<\/strong><\/p>\n<p><strong>{<\/strong><\/p>\n<p><strong>char Grade\u037e<\/strong><\/p>\n<p><strong>\u00a0 int Bonus\u037e<\/strong><\/p>\n<p><strong>public:<\/strong><\/p>\n<p><strong>\u00a0 Calc(){Grade=\u2019E\u2019 \u037e Bonus=0\u037e}<\/strong><\/p>\n<p><strong>void Down(int G)<\/strong><\/p>\n<p><strong>{<\/strong><\/p>\n<p><strong>\u00a0 Grade\u00ad=G\u037e<\/strong><\/p>\n<p><strong>}<br \/>\nVoid Up(int G)<\/strong><\/p>\n<p><strong>{<\/strong><\/p>\n<p><strong>\u00a0 Grade+=G\u037e<\/strong><\/p>\n<p><strong>\u00a0 Bonus++\u037e<\/strong><\/p>\n<p><strong>}<\/strong><\/p>\n<p><strong>void Show()<\/strong><\/p>\n<p><strong>{<\/strong><\/p>\n<p><strong>cout&lt;&lt;Grade&lt;&lt;\u201d#\u201d&lt;&lt;Bonus&lt;&lt;end1\u037e<\/strong><\/p>\n<p><strong>}<\/strong><\/p>\n<p><strong>}\u037e<\/strong><\/p>\n<p><strong>void main()<\/strong><\/p>\n<p><strong>{<\/strong><\/p>\n<p><strong>Calc c\u037e<\/strong><\/p>\n<p><strong>C.Down(2)\u037e<\/strong><\/p>\n<p><strong>C.Show()\u037e<\/strong><\/p>\n<p><strong>C.Up(7)\u037e<\/strong><\/p>\n<p><strong>\u00a0 C.Show()\u037e<\/strong><\/p>\n<p><strong>\u00a0 C.Down(2)<\/strong><\/p>\n<p><strong>\u00a0 C.Show()\u037e<\/strong><\/p>\n<p><strong>}<\/strong><\/p>\n<p><strong>Ans.<\/strong> C#0<\/p>\n<p>J#1<\/p>\n<p>H#1<\/p>\n<p>(1 Mark for each correct line of output)<\/p>\n<p>Note:<\/p>\n<ul>\n<li>Deduct \u00bd Mark for not considering any or all endl(s) at proper place(s)<\/li>\n<li>Deduct \u00bd Mark for not writing any or all # symbol(s)<\/li>\n<\/ul>\n<p style=\"text-align: center;\"><strong>OR<\/strong><\/p>\n<p>(Full 3 marks to be awarded if undeclared object C OR ERROR is identified)<\/p>\n<p><strong>(f) Study the following program and select the possible output(s)from the option (i) to (iv) following it. Also write the maximum and the minimum values that can be assigned to the variable NUM. (2)<\/strong><\/p>\n<p><strong>Note:<\/strong><\/p>\n<ul>\n<li><strong>Assume all required header files are already being included in the program.<\/strong><\/li>\n<li><strong>random(n) function generates an integer between 0 and n\u20101.<\/strong><\/li>\n<\/ul>\n<p><strong>\u00a0 void main()<\/strong><\/p>\n<p><strong>{<\/strong><\/p>\n<p><strong>randomize()\u037e<\/strong><\/p>\n<p><strong>int NUM\u037e<\/strong><\/p>\n<p><strong>NUM=random(3)+2\u037e<\/strong><\/p>\n<p><strong>char TEXT[]=\u201dABCDEFGHIJK\u201d\u037e<\/strong><\/p>\n<p><strong>for (int I=1\u037eI&lt;=NUM\u037e I++)<\/strong><\/p>\n<p><strong>{<\/strong><\/p>\n<p><strong>for (int J=NUM\u037eJ&lt;=7\u037eJ++)<\/strong><\/p>\n<p><strong>cout&lt;&lt;TEXT[J]\u037e<\/strong><\/p>\n<p><strong>cout&lt;&lt;end1\u037e<\/strong><\/p>\n<p><strong>}<\/strong><\/p>\n<p><strong>}<\/strong><\/p>\n<p><strong>(i) FGHI \u00a0(ii) BCDEFGH \u00a0 (iii) EFGH (iv) CDEFGH<\/strong><\/p>\n<p><strong>FGHI \u00a0BCDEFGH EFGH \u00a0 CDEFGH<\/strong><\/p>\n<p><strong>FGHI EFGH<\/strong><\/p>\n<p><strong>FGHI EFGH<\/strong><\/p>\n<p><strong>Ans<\/strong><\/p>\n<table class=\"mobile\" border=\"1\" cellspacing=\"0\" cellpadding=\"3\">\n<tbody>\n<tr>\n<td style=\"width: 76.25pt;\">(iii) and (iv)<\/td>\n<td style=\"width: 297.0pt;\">Minimum value of NUM = 2 Maximum value of NUM = 4<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p>Minimum value of NUM = 2 Maximum value of NUM = 4<\/p>\n<p>(\u00bd Mark for writing option (iii) )<\/p>\n<p>(\u00bd Mark for writing option (iv) )<\/p>\n<p>Note: Deduct \u00bd mark for writing each additional option alongwith both correct options<\/p>\n<p>(\u00bd Mark for writing correct Minimum value of NUM)<\/p>\n<p>(\u00bd Mark for writing correct Maximum value of NUM)<\/p>\n<p><strong>2. (a) What is a copy constructor? Give a suitable example in C++ to illustrate with its definition within a class and a declaration of an object with the help of it . (2)<\/strong><\/p>\n<p><strong>Ans.\u00a0<\/strong>A copy constructor is an overloaded constructor in which an object of the same class is passed as reference parameter.<\/p>\n<p>class Point<\/p>\n<p>{<\/p>\n<p>int x\u037e<\/p>\n<p>public:<\/p>\n<p>Point(){x=0\u037e}<\/p>\n<p>Point(Point &amp;p) \/\/ Copy constructor<\/p>\n<p>{x = p.x\u037e}<\/p>\n<p>:<\/p>\n<p>}\u037e<\/p>\n<p>void main()<\/p>\n<p>{<\/p>\n<p>Point p1\u037e<\/p>\n<p>Point p2(p1)\u037e\/\/Copy constructor is called here<\/p>\n<p style=\"text-align: center;\"><strong>\/\/OR<\/strong><\/p>\n<p>Point p3=p1\u037e\/\/Copy constructor is called here<\/p>\n<p>}<br \/>\n(1\u00bd Mark to be awarded if the copy constructor is explained with an appropriate example)<\/p>\n<p style=\"text-align: center;\"><strong>OR<\/strong><\/p>\n<p>( 1 Mark for correct explanation of copy constructor only without an example)<\/p>\n<p>(\u00bd Mark for correct declaration of an object)<\/p>\n<p><strong>(b) Observe the following C++ code and answer the questions (i) and (ii) :<\/strong><\/p>\n<p><strong>class Traveller<\/strong><\/p>\n<p><strong>{<\/strong><\/p>\n<p><strong>long PNR\u037e<\/strong><\/p>\n<p><strong>char TName[20]\u037e<\/strong><\/p>\n<p><strong>public:<\/strong><\/p>\n<p><strong>Traveller() \u00a0\/\/Function 1<\/strong><\/p>\n<p><strong>{cout&lt;&lt;&#8220;Ready&#8221;&lt;&lt;endl\u037e}<\/strong><\/p>\n<p><strong>void Book(long P,char N[]) \/\/Function 2<\/strong><\/p>\n<p><strong>{PNR = P\u037e strcpy(TName, N)\u037e}<\/strong><\/p>\n<p><strong>void Print() \u00a0 \u00a0\/\/Function 3<\/strong><\/p>\n<p><strong>{cout&lt;&lt;PNR &lt;&lt; TName &lt;&lt;endl\u037e}<\/strong><\/p>\n<p><strong>~Traveller() \/\/Function 4<\/strong><\/p>\n<p><strong>{cout&lt;&lt;&#8220;Booking cancelled!&#8221;&lt;&lt;endl\u037e}<\/strong><\/p>\n<p><strong>}\u037e<\/strong><\/p>\n<p><strong>(i) Fill in the blank statements in Line 1 and Line 2 to execute Function 2 and Function 3 respectively in the following code:<\/strong><\/p>\n<p><strong>v oid main{)<\/strong><\/p>\n<p><strong>{<\/strong><\/p>\n<p><strong> Traveller T\u037e<\/strong><\/p>\n<p><strong>_____________ \u00a0 \/\/Line 1<\/strong><\/p>\n<p><strong>_____________\u00a0 \/\/Line 2<\/strong><\/p>\n<p><strong>}\/\/Stops here<\/strong><\/p>\n<p><strong>Ans.<\/strong> T.Book(1234567,\u201dRavi\u201d)\u037e \/\/Line 1<\/p>\n<p>T.Print()\u037e \u00a0\/\/Line 2<\/p>\n<p>(\u00bd Mark for writing each correct Function)<\/p>\n<p><strong>(ii) Which function will be executed at}\/\/Stops here? What is this function referred as? (1)<\/strong><\/p>\n<p><strong>Ans.<\/strong> Function 4<\/p>\n<p style=\"text-align: center;\"><strong>OR<\/strong><\/p>\n<p>~Traveller()<\/p>\n<p>It is a Destructor function.<\/p>\n<p>(\u00bd Mark for writing Function 4 or ~Traveller())<\/p>\n<p>(\u00bd Mark for referring Destructor)<\/p>\n<p><strong>(c) Write the definition of a class PlC in C++ with following description:<\/strong><\/p>\n<p><strong>Private Members<\/strong><\/p>\n<p><strong>\u00adPno \/\/Data member for Picture Number (an integer)<\/strong><\/p>\n<p><strong>\u00adCategory \/\/Data member for Picture Category (a string)<\/strong><\/p>\n<p><strong>\u00adLocation \/\/Data member for Exhibition Location (a string)<\/strong><\/p>\n<p><strong>\u00ad FixLocation \/\/A member function to assign<\/strong><\/p>\n<p><strong>\/\/Exhibition Location as per category<\/strong><\/p>\n<p><strong>\/\/as shown in the following table<\/strong><\/p>\n<table class=\"mobile\" border=\"1\" cellspacing=\"0\" cellpadding=\"3\">\n<tbody>\n<tr>\n<td><strong>Category<\/strong><\/td>\n<td><strong>Location<\/strong><\/td>\n<\/tr>\n<tr>\n<td><strong>Classic<\/strong><\/td>\n<td><strong>Amina<\/strong><\/td>\n<\/tr>\n<tr>\n<td><strong>Modern<\/strong><\/td>\n<td><strong>Jim Plaq<\/strong><\/td>\n<\/tr>\n<tr>\n<td><strong>Antique<\/strong><\/td>\n<td><strong>Ustad Khan<\/strong><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p><strong>Public Members<\/strong><\/p>\n<p><strong>\u00adEnter()\/\/A function to allow user to enter values<\/strong><\/p>\n<p><strong>\/\/Pno,category and call FixLocation() function<\/strong><\/p>\n<p><strong>\u00adSeeAll()\/\/A function to display all the data members<\/strong><\/p>\n<p><strong>Ans.<\/strong> class PIC<\/p>\n<p>{<\/p>\n<p>int Pno\u037e<\/p>\n<p>char Category[20]\u037e<\/p>\n<p>char Location[20]\u037e<\/p>\n<p>void FixLocation()\u037e<\/p>\n<p>public:<\/p>\n<p>void Enter()\u037e<\/p>\n<p>void SeeAll()\u037e<\/p>\n<p>}\u037e<\/p>\n<p>void PIC::FixLocation()<\/p>\n<p>{<\/p>\n<p>if(strcmpi(Category,\u201dClassic\u201d)==0)<\/p>\n<p>strcpy(Location,\u201dAmina\u201d)\u037e<\/p>\n<p>else if(strcmpi(Category,\u201dModern\u201d)==0)<\/p>\n<p>strcpy(Location,\u201d Jim Plaq\u201d )\u037e<\/p>\n<p>else if strcmpi(Category,\u201dAntique\u201d)==0)<\/p>\n<p>strcpy(Location,\u201d Ustad Khan\u201d )\u037e<\/p>\n<p>}<\/p>\n<p>void PIC::Enter()<\/p>\n<p>{<\/p>\n<p>cin&gt;&gt;Pno\u037egets(Category)\u037e<\/p>\n<p>FixLocation()\u037e<\/p>\n<p>}<\/p>\n<p>void PIC:: SeeAll()<\/p>\n<p>{<\/p>\n<p>cout&lt;&lt;Pno&lt;&lt;Category&lt;&lt;Location&lt;&lt;endl\u037e<\/p>\n<p>}<\/p>\n<p>(\u00bd Mark for correct syntax for class header)<\/p>\n<p>(\u00bd Mark for correct declaration of data members)<\/p>\n<p>(1 Mark for correct definition of FixLocation())<\/p>\n<p>(1 Mark for correct definition of Enter() with proper invocation of FixLocation() function)<\/p>\n<p>(1 Mark for correct definition of SeeAll())<\/p>\n<p>NOTE:<\/p>\n<ul>\n<li>Deduct \u00bd Mark if FixLocation() is not invoked properly inside Enter() function<\/li>\n<li>No marks to be deducted for defining Member Functions inside the class<\/li>\n<li>strcmp()\/strcmpi() acceptable<\/li>\n<\/ul>\n<p>(d) Answer the question (i) to (iv) based on the following:<\/p>\n<p>class Exterior<\/p>\n<p>{<\/p>\n<p>int OrderId\u037e<\/p>\n<p>char Address[20]\u037e<\/p>\n<p>protected:<\/p>\n<p>float Advance\u037e<\/p>\n<p>public:<\/p>\n<p>Exterior()\u037e<\/p>\n<p>void Book()\u037e void View()\u037e<\/p>\n<p>}\u037e<\/p>\n<p>class Paint:public Exterior<\/p>\n<p>{2g<\/p>\n<p>int WallArea,ColorCode\u037e<\/p>\n<p>protected:<\/p>\n<p>char Type\u037e<\/p>\n<p>public:<\/p>\n<p>Paint() \u037e<\/p>\n<p>void PBook()\u037e<\/p>\n<p>void PView()\u037e<\/p>\n<p>}\u037e<\/p>\n<p>class Bill:public Paint<\/p>\n<p>{<\/p>\n<p>float Charges\u037e<\/p>\n<p>void Calculate()\u037e<\/p>\n<p>public:<\/p>\n<p>Bill() \u037e<\/p>\n<p>void Billing() \u037e<\/p>\n<p>void Print() \u037e<\/p>\n<p>}\u037e<\/p>\n<p><strong>(i) Which type of Inheritance out of the following is illustrated in the above example?<\/strong><\/p>\n<ul>\n<li><strong>Single Level Inheritance<\/strong><\/li>\n<li><strong>Multi Level Inheritance<\/strong><\/li>\n<li><strong>Multiple Inheritance<\/strong><\/li>\n<\/ul>\n<p><strong>Ans.<\/strong> Multi Level Inheritance<\/p>\n<p>(1 Mark for mentioning correct option)<\/p>\n<p><strong>(ii) Write the names of all the data members, which are directly accessible from the member functions of class Paint.<\/strong><\/p>\n<p><strong>Ans.\u00a0<\/strong>WallArea, ColorCode,Type, Advance<\/p>\n<p>(1 Mark for correct answer)<\/p>\n<p>Note: No marks to be awarded for any partial\/additional answer(s)<\/p>\n<p><strong>(iii) Write the names of all the member functions, which are directly accessible from an object of class Bill.<\/strong><\/p>\n<p><strong>Ans.<\/strong> Billing(), Print(), PBook(), PView(), Book(), View()<\/p>\n<p>(1 Mark for correct answer)<\/p>\n<p>Note:<\/p>\n<ul>\n<li>No marks to be awarded for any partial\/additionalanswer(s)<\/li>\n<li>Constructors can be ignored<\/li>\n<\/ul>\n<p><strong>(iv) What will be the order of execution of the constructors, when an object of class Bill is declared?<\/strong><\/p>\n<p><strong>Ans.<\/strong> Exterior(), Paint(), Bill()<\/p>\n<p>(1 Mark for correct answer)<\/p>\n<p>Note: No marks to be awarded for any other order<\/p>\n<p><strong>3 (a) Write the definition of a function Alter(int A[], int N) in C++, which should change all the multiples of 5 in the array to 5 and rest of the elements as 0. For example, if an array of 10 integers is as follows: (2)<\/strong><\/p>\n<table class=\"mobile\" border=\"1\" cellspacing=\"0\" cellpadding=\"3\">\n<tbody>\n<tr>\n<td style=\"width: 53.5pt;\"><strong>A[0]<\/strong><\/td>\n<td style=\"width: 53.5pt;\"><strong>A[1]<\/strong><\/td>\n<td style=\"width: 53.5pt;\"><strong>A[2]<\/strong><\/td>\n<td style=\"width: 53.5pt;\"><strong>A[3]<\/strong><\/td>\n<td style=\"width: 53.5pt;\"><strong>A[4]<\/strong><\/td>\n<td style=\"width: 53.5pt;\"><strong>A[5]<\/strong><\/td>\n<td style=\"width: 53.55pt;\"><strong>A[6]<\/strong><\/td>\n<td style=\"width: 53.55pt;\"><strong>A[7]<\/strong><\/td>\n<td style=\"width: 53.55pt;\"><strong>A[8]<\/strong><\/td>\n<td style=\"width: 53.55pt;\"><strong>A[9]<\/strong><\/td>\n<\/tr>\n<tr>\n<td style=\"width: 53.5pt;\"><strong>55<\/strong><\/td>\n<td style=\"width: 53.5pt;\"><strong>43<\/strong><\/td>\n<td style=\"width: 53.5pt;\"><strong>20<\/strong><\/td>\n<td style=\"width: 53.5pt;\"><strong>16<\/strong><\/td>\n<td style=\"width: 53.5pt;\"><strong>39<\/strong><\/td>\n<td style=\"width: 53.5pt;\"><strong>90<\/strong><\/td>\n<td style=\"width: 53.55pt;\"><strong>83<\/strong><\/td>\n<td style=\"width: 53.55pt;\"><strong>40<\/strong><\/td>\n<td style=\"width: 53.55pt;\"><strong>48<\/strong><\/td>\n<td style=\"width: 53.55pt;\"><strong>25<\/strong><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p><strong>After executing the function, the array content should be changed as follow:<\/strong><\/p>\n<table class=\"mobile\" border=\"1\" cellspacing=\"0\" cellpadding=\"3\">\n<tbody>\n<tr>\n<td style=\"width: 53.5pt;\"><strong>A[0]<\/strong><\/td>\n<td style=\"width: 53.5pt;\"><strong>A[1]<\/strong><\/td>\n<td style=\"width: 53.5pt;\"><strong>A[2]<\/strong><\/td>\n<td style=\"width: 53.5pt;\"><strong>A[3]<\/strong><\/td>\n<td style=\"width: 53.5pt;\"><strong>A[4]<\/strong><\/td>\n<td style=\"width: 53.5pt;\"><strong>A[5]<\/strong><\/td>\n<td style=\"width: 53.55pt;\"><strong>A[6]<\/strong><\/td>\n<td style=\"width: 53.55pt;\"><strong>A[7]<\/strong><\/td>\n<td style=\"width: 53.55pt;\"><strong>A[8]<\/strong><\/td>\n<td style=\"width: 53.55pt;\"><strong>A[9]<\/strong><\/td>\n<\/tr>\n<tr>\n<td style=\"width: 53.5pt;\"><strong>5<\/strong><\/td>\n<td style=\"width: 53.5pt;\"><strong>0<\/strong><\/td>\n<td style=\"width: 53.5pt;\"><strong>5<\/strong><\/td>\n<td style=\"width: 53.5pt;\"><strong>0<\/strong><\/td>\n<td style=\"width: 53.5pt;\"><strong>0<\/strong><\/td>\n<td style=\"width: 53.5pt;\"><strong>5<\/strong><\/td>\n<td style=\"width: 53.55pt;\"><strong>0<\/strong><\/td>\n<td style=\"width: 53.55pt;\"><strong>5<\/strong><\/td>\n<td style=\"width: 53.55pt;\"><strong>0<\/strong><\/td>\n<td style=\"width: 53.55pt;\"><strong>5<\/strong><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p><strong>Ans.\u00a0<\/strong>void Alter(int A[ ],int N)<\/p>\n<p>{<\/p>\n<p>for (int i=0\u037ei&lt;N\u037ei++)<\/p>\n<p>if(A[i]%5==0)<\/p>\n<p>A[i]=5\u037e<\/p>\n<p>else<\/p>\n<p>A[i]=0\u037e<\/p>\n<p>}<\/p>\n<p style=\"text-align: center;\"><strong>OR<\/strong><\/p>\n<p>Any other correct equivalent function definition<\/p>\n<p>(\u00bd Mark for correct loop)<\/p>\n<p>(\u00bd Mark for correct checking of divisibility of array elements by 5)<\/p>\n<p>(\u00bd Mark for correct use of else OR correct checking of non divisibility of array elements by 5 )<\/p>\n<p>(\u00bd Mark for correct assignment of 5 and 0 for multiples and non multiples of 5 respectively)<\/p>\n<p><strong>(b) A two dimensional array P[20] [50] is stored in the memory along the row with each of its element occupying 4 bytes, find the address of the element P[10] [30],if the element P[5] [5] is stored at the memory location 15000. (3)<\/strong><\/p>\n<p><strong>Ans.<\/strong> Loc(P[I][J]) along the row<\/p>\n<p>=BaseAddress+W [(I\u2013LBR)*C+(J\u2013LBC)]\n<p>(where C is the number of columns, LBL;R=LBC=0)<\/p>\n<p>LOC(P[5][5])<\/p>\n<p>= BaseAddress + W*[I*C + J]\n<p>15000 = BaseAddress + 4*[5*50 + 5]\n<p>= BaseAddress + 4*[250 + 5]\n<p>= BaseAddress + 4*255<\/p>\n<p>= BaseAddress + 1020<\/p>\n<p>BaseAddress = 15000\u00ad1020 = 13980<\/p>\n<p>LOC(P[10][30])= 13980 + 4*[10*50+30]\n<p>= 13980 + 4*530<\/p>\n<p>= 13980 + 2120<\/p>\n<p>= 16100<\/p>\n<p style=\"text-align: center;\"><strong>OR<\/strong><\/p>\n<p>LOC(P[10][30])<\/p>\n<p>= Loc(P[5][5])+ W[(I\u00adLBR)*C+(J\u00adLBC)]\n<p>= 15000 + 4[(10\u00ad5)*50 + (30\u00ad5)]\n<p>= 15000 + 4[ 5*50 + 25]\n<p>= 15000 + 4 *275<\/p>\n<p>= 15000 + 1100<\/p>\n<p>= 16100<\/p>\n<p style=\"text-align: center;\"><strong>OR<\/strong><\/p>\n<p>(Where C is the number of columns and LBR=LBC=1)<br \/>\nLOC(P[5][5])<\/p>\n<p>15000 = BaseAddress + W [( I\u00ad1)*C + (J\u00ad1)]\n<p>= BaseAddress + 4[4*50 + 4]\n<p>= BaseAddress + 4[200 + 4]\n<p>= BaseAddress + 4 * 204<\/p>\n<p>= BaseAddress + 816<\/p>\n<p>BaseAddress = 15000 \u00ad 816 = 14184<\/p>\n<p>LOC(P[10][30])<\/p>\n<p>= 14184 + 4[(10\u00ad1)*50 + (30\u00ad1)]\n<p>= 14184 + 4[9*50 + 29]\n<p>= 14184 + 4[450 + 29]\n<p>= 14184 + 4*479<\/p>\n<p>= 14184 + 1916<\/p>\n<p>= 16100<\/p>\n<p>(1 Mark for writing correct formula (for row major) OR substituting formula with correct values)<\/p>\n<p>(1 Mark for at least one step of intermediate calculation)<\/p>\n<p>(1 Mark for final correct address)<\/p>\n<p><strong>(c) Write the definition of a member function Pop() in C++, to delete a book from a dynamic stack of TEXTBOOKS considering the following code is already included in the program. (4)<\/strong><\/p>\n<p><strong>struct TEXTBOOKS<\/strong><\/p>\n<p><strong>{<\/strong><\/p>\n<p><strong>char ISBN[20]\u037e char TITLE[80]\u037e<\/strong><\/p>\n<p><strong>TEXTBOOKS *Link\u037e<\/strong><\/p>\n<p><strong>}\u037e<\/strong><\/p>\n<p><strong>class STACK<\/strong><\/p>\n<p><strong>{<\/strong><\/p>\n<p><strong>TEXTBOOKS *Top\u037e<\/strong><\/p>\n<p><strong>public:<\/strong><\/p>\n<p><strong>STACK() {Top=NULL\u037e}<\/strong><\/p>\n<p><strong>void Push()\u037e<\/strong><\/p>\n<p><strong>void Pop()\u037e<\/strong><\/p>\n<p><strong>~STACK()\u037e<\/strong><\/p>\n<p><strong>}\u037e<\/strong><\/p>\n<p><strong>Ans.<\/strong> void STACK::POP()<\/p>\n<p>{<\/p>\n<p>if (Top!=NULL)<\/p>\n<p>{<\/p>\n<p>TEXTBOOKS *Temp\u037e<\/p>\n<p>Temp=Top\u037e<\/p>\n<p>cout&lt;&lt;Top\u00ad&gt;ISBN&lt;&lt;Top\u00ad&gt;TITLE&lt;&lt;\u201ddeleted\u201d&lt;&lt;endl\u037e<\/p>\n<p>Top=Top\u00ad&gt;Link\u037e<\/p>\n<p>delete Temp\u037e<\/p>\n<p>}<\/p>\n<p>else<\/p>\n<p>cout&lt;&lt;\u201dStack Empty\u201d&lt;&lt;endl\u037e<\/p>\n<p>}<\/p>\n<p style=\"text-align: center;\"><strong>OR<\/strong><\/p>\n<p>Any other correct equivalent function definition<\/p>\n<p>(1 Mark for checking Empty\/Non\u2010empty STACK)<\/p>\n<p>(1 Mark for assigning Top to Temp)<\/p>\n<p>(1 Mark for linking the Top to next node)<\/p>\n<p>(1 Mark for deleting Temp node)<\/p>\n<p><strong>(d) Write a function REVCOL (int P[][5], int N, int M) in C++to display the content of a two dimensional array, with each column content in reverse order. (3)<\/strong><\/p>\n<p><strong>Note: Array may contain any number of rows.<\/strong><\/p>\n<p><strong>For example, if the content of array is as follows<\/strong><\/p>\n<table class=\"mobile\" border=\"1\" cellspacing=\"0\" cellpadding=\"3\">\n<tbody>\n<tr>\n<td style=\"width: 107.0pt;\"><strong>15<\/strong><\/td>\n<td style=\"width: 107.05pt;\"><strong>12<\/strong><\/td>\n<td style=\"width: 107.05pt;\"><strong>56<\/strong><\/td>\n<td style=\"width: 107.05pt;\"><strong>45<\/strong><\/td>\n<td style=\"width: 107.05pt;\"><strong>51<\/strong><\/td>\n<\/tr>\n<tr>\n<td style=\"width: 107.0pt;\"><strong>13<\/strong><\/td>\n<td style=\"width: 107.05pt;\"><strong>91<\/strong><\/td>\n<td style=\"width: 107.05pt;\"><strong>92<\/strong><\/td>\n<td style=\"width: 107.05pt;\"><strong>87<\/strong><\/td>\n<td style=\"width: 107.05pt;\"><strong>63<\/strong><\/td>\n<\/tr>\n<tr>\n<td style=\"width: 107.0pt;\"><strong>11<\/strong><\/td>\n<td style=\"width: 107.05pt;\"><strong>23<\/strong><\/td>\n<td style=\"width: 107.05pt;\"><strong>61<\/strong><\/td>\n<td style=\"width: 107.05pt;\"><strong>46<\/strong><\/td>\n<td style=\"width: 107.05pt;\"><strong>81<\/strong><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p><strong>The function should display output as:<\/strong><\/p>\n<p><strong>11 23 61 46 81<\/strong><\/p>\n<p><strong>13 91 92 87 63<\/strong><\/p>\n<p><strong>15 12 56 45 51<\/strong><\/p>\n<p><strong>Ans.<\/strong> void REVCOL(int P[][5],int N,int M)<\/p>\n<p>{<\/p>\n<p>for(int I=N\u00ad1\u037eI&gt;=0\u037eI\u00ad\u00ad)<\/p>\n<p>{<\/p>\n<p>for(int J=0\u037eJ&lt;M\u037eJ++)<\/p>\n<p>cout&lt;&lt;P[I][J]\u037e<\/p>\n<p>cout&lt;&lt;endl\u037e<\/p>\n<p>}<\/p>\n<p>}<\/p>\n<p style=\"text-align: center;\"><strong>OR<\/strong><\/p>\n<p>void REVCOL(int P[][5],int N,int M)<\/p>\n<p>{<\/p>\n<p>for(int I=0\u037eI&lt;N\/2\u037eI++)<\/p>\n<p>{<\/p>\n<p>for(int J=0\u037eJ&lt;M\u037eJ++)<\/p>\n<p>{<\/p>\n<p>int T = P[I][J]\u037e<\/p>\n<p>P[I][J] = P[N\u00adI\u00ad1][J]\u037e<\/p>\n<p>P[N\u00adI\u00ad1][J] = T\u037e<\/p>\n<p>}<\/p>\n<p>}<\/p>\n<p>for(I=0\u037eI&lt;N\u037eI++)<\/p>\n<p>{<\/p>\n<p>for(int J=0\u037eJ&lt;M\u037eJ++)<\/p>\n<p>cout&lt;&lt;P[I][J]\u037e<\/p>\n<p>cout&lt;&lt;endl\u037e<\/p>\n<p>}<\/p>\n<p>}<\/p>\n<p>(1 Mark for correct nesting of loop(s))<\/p>\n<p>(1\u00bd Mark for correct logic for reversing the content of each column)<\/p>\n<p>(\u00bd Mark for correctly displaying the content)<\/p>\n<p>Note:<\/p>\n<ul>\n<li>N and M can be written interchangeably for number of rows and columns<\/li>\n<\/ul>\n<p><strong>(e) Convert the following infix expression to its equivalent postfix expression, showing the stack contents for each step of conversion. (2)<\/strong><\/p>\n<p><strong>X \/ Y + U* (V\u00adW)<\/strong><\/p>\n<p><strong>Ans.<\/strong> X \/ Y + U* (V\u00adW)=((X \/ Y)+(U*(V\u00adW)))<\/p>\n<table class=\"mobile\" border=\"1\" cellspacing=\"0\" cellpadding=\"3\">\n<tbody>\n<tr>\n<td style=\"width: 167.1pt;\">Element<\/td>\n<td style=\"width: 165.7pt;\">Stack<\/td>\n<td style=\"width: 166.4pt;\">Postfix<\/td>\n<\/tr>\n<tr>\n<td style=\"width: 167.1pt;\">(<\/td>\n<td style=\"width: 165.7pt;\"><\/td>\n<td style=\"width: 166.4pt;\"><\/td>\n<\/tr>\n<tr>\n<td style=\"width: 167.1pt;\">(<\/td>\n<td style=\"width: 165.7pt;\"><\/td>\n<td style=\"width: 166.4pt;\"><\/td>\n<\/tr>\n<tr>\n<td style=\"width: 167.1pt;\">X<\/td>\n<td style=\"width: 165.7pt;\"><\/td>\n<td style=\"width: 166.4pt;\">X<\/td>\n<\/tr>\n<tr>\n<td style=\"width: 167.1pt;\">\/<\/td>\n<td style=\"width: 165.7pt;\">\/<\/td>\n<td style=\"width: 166.4pt;\">X<\/td>\n<\/tr>\n<tr>\n<td style=\"width: 167.1pt;\">Y<\/td>\n<td style=\"width: 165.7pt;\">\/<\/td>\n<td style=\"width: 166.4pt;\">XY<\/td>\n<\/tr>\n<tr>\n<td style=\"width: 167.1pt;\">)<\/td>\n<td style=\"width: 165.7pt;\"><\/td>\n<td style=\"width: 166.4pt;\">XY\/<\/td>\n<\/tr>\n<tr>\n<td style=\"width: 167.1pt;\">+<\/td>\n<td style=\"width: 165.7pt;\">+<\/td>\n<td style=\"width: 166.4pt;\">XY\/<\/td>\n<\/tr>\n<tr>\n<td style=\"width: 167.1pt;\">(<\/td>\n<td style=\"width: 165.7pt;\">+<\/td>\n<td style=\"width: 166.4pt;\">XY\/<\/td>\n<\/tr>\n<tr>\n<td style=\"width: 167.1pt;\">U<\/td>\n<td style=\"width: 165.7pt;\">+<\/td>\n<td style=\"width: 166.4pt;\">XY\/U<\/td>\n<\/tr>\n<tr>\n<td style=\"width: 167.1pt;\">*<\/td>\n<td style=\"width: 165.7pt;\">+*<\/td>\n<td style=\"width: 166.4pt;\">XY\/U<\/td>\n<\/tr>\n<tr>\n<td style=\"width: 167.1pt;\">(<\/td>\n<td style=\"width: 165.7pt;\">+*<\/td>\n<td style=\"width: 166.4pt;\">XY\/U<\/td>\n<\/tr>\n<tr>\n<td style=\"width: 167.1pt;\">V<\/td>\n<td style=\"width: 165.7pt;\">+*<\/td>\n<td style=\"width: 166.4pt;\">XY\/UV<\/td>\n<\/tr>\n<tr>\n<td style=\"width: 167.1pt;\">&#8211;<\/td>\n<td style=\"width: 165.7pt;\">+*-<\/td>\n<td style=\"width: 166.4pt;\">XY\/UV<\/td>\n<\/tr>\n<tr>\n<td style=\"width: 167.1pt;\">W<\/td>\n<td style=\"width: 165.7pt;\">+*-<\/td>\n<td style=\"width: 166.4pt;\">XY\/UVW<\/td>\n<\/tr>\n<tr>\n<td style=\"width: 167.1pt;\">)<\/td>\n<td style=\"width: 165.7pt;\">+*<\/td>\n<td style=\"width: 166.4pt;\">XY\/UVW-<\/td>\n<\/tr>\n<tr>\n<td style=\"width: 167.1pt;\">)<\/td>\n<td style=\"width: 165.7pt;\">+<\/td>\n<td style=\"width: 166.4pt;\">XY\/UVW-*<\/td>\n<\/tr>\n<tr>\n<td style=\"width: 167.1pt;\">)<\/td>\n<td style=\"width: 165.7pt;\"><\/td>\n<td style=\"width: 166.4pt;\">XY\/UVW-*+<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p style=\"text-align: center;\"><strong>OR<\/strong><\/p>\n<table class=\"mobile\" border=\"1\" cellspacing=\"0\" cellpadding=\"3\">\n<tbody>\n<tr>\n<td>Element<\/td>\n<td>Stack<\/td>\n<td>Postfix<\/td>\n<\/tr>\n<tr>\n<td>X<\/td>\n<td><\/td>\n<td>X<\/td>\n<\/tr>\n<tr>\n<td>\/<\/td>\n<td>\/<\/td>\n<td>X<\/td>\n<\/tr>\n<tr>\n<td>Y<\/td>\n<td>\/<\/td>\n<td>XY<\/td>\n<\/tr>\n<tr>\n<td>+<\/td>\n<td>+<\/td>\n<td>XY\/<\/td>\n<\/tr>\n<tr>\n<td>U<\/td>\n<td>+<\/td>\n<td>XY\/U<\/td>\n<\/tr>\n<tr>\n<td>*<\/td>\n<td>+*<\/td>\n<td>XY\/U<\/td>\n<\/tr>\n<tr>\n<td>(<\/td>\n<td>+*(<\/td>\n<td>XY\/U<\/td>\n<\/tr>\n<tr>\n<td>V<\/td>\n<td>+*(<\/td>\n<td>XY\/UV<\/td>\n<\/tr>\n<tr>\n<td>&#8211;<\/td>\n<td>+*(-<\/td>\n<td>XY\/UV<\/td>\n<\/tr>\n<tr>\n<td>W<\/td>\n<td>+*(-<\/td>\n<td>XY\/UVW<\/td>\n<\/tr>\n<tr>\n<td>)<\/td>\n<td>+*<\/td>\n<td>Y\/UVW-<\/td>\n<\/tr>\n<tr>\n<td><\/td>\n<td>+<\/td>\n<td>Y\/UVW-*<\/td>\n<\/tr>\n<tr>\n<td><\/td>\n<td><\/td>\n<td>Y\/UVW-*+<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p>Any other method for converting the given Infix expression to its equivalent Postfix expression showing stack contents<\/p>\n<p>(\u00bd Mark for converting expression up to each operator)<\/p>\n<p style=\"text-align: center;\"><strong>OR<\/strong><\/p>\n<p>(1 Mark to be given for writing correct answer without showing the Stack Content on each step)<\/p>\n<p><strong>4. (a) Write function definition for SUCCESS () in C++ to read the content of a text file STORY.TXT count the presence of world STORY and display the number of occurrence of this word. (2)<\/strong><\/p>\n<p><strong>Note:<\/strong><\/p>\n<ul>\n<li><strong>The word STORY should be an independent word<\/strong><\/li>\n<li><strong>Ignore type cases (i.e. lower\/upper case)<\/strong><\/li>\n<\/ul>\n<p><strong>Example:<\/strong><\/p>\n<div>\n<p><strong>If the content of the file Story.TXT is as follows:<br \/>\nSuccess shows others that we can do it. It is possible to achieve success with hard work. Lot of money does not mean SUCCESS.<\/strong><\/p>\n<\/div>\n<p><strong>The function SUCCESS () should display the following:<\/strong><\/p>\n<p><strong>Ans<\/strong> void SUCCESS()<\/p>\n<p>{<\/p>\n<p>int count=0\u037e<\/p>\n<p>ifstream f(&#8220;STORY.TXT&#8221;)\u037e<\/p>\n<p>char s[20]\u037e<\/p>\n<p>while (!f.eof())<\/p>\n<p>{<\/p>\n<p>f&gt;&gt;s\u037e<\/p>\n<p>if(strcmpi(s,\u201dSTORY\u201d)==0)<\/p>\n<div>\n<p>\/\/OR if(strcmpi(s,\u201dSUCCESS\u201d)==0)<\/p>\n<\/div>\n<p>count++\u037e<\/p>\n<p>}<br \/>\ncout&lt;&lt;count\u037e<\/p>\n<p>f.close()\u037e<\/p>\n<p>}<\/p>\n<p style=\"text-align: center;\"><strong>OR<\/strong><\/p>\n<p>Any other correct function definition<\/p>\n<p>(\u00bd Mark for opening STORY.TXT correctly)<\/p>\n<p>(\u00bd Mark for reading each word (using any method) from the file)<\/p>\n<p>(\u00bd Mark for comparing the word with STORY OR SUCCESS)<\/p>\n<p>(\u00bd Mark for displaying correct count of STORY OR SUCCESS)<\/p>\n<p>NOTE:<\/p>\n<p>(\u00bd Mark to be deducted if STORY or SUCCESS is compared<\/p>\n<p>without ignoring the case)<\/p>\n<p><strong>(b) Write a definition for function Economic() in C++ to read each record of a binary file ITEMS.DAT, find and display those items, which costs less than 2500. Assume that the file ITEMS.DAT is created with the help of objects of class ITEMS, which is defined below: (3)<\/strong><\/p>\n<p><strong>class ITEMS<\/strong><\/p>\n<p><strong>{<\/strong><\/p>\n<p><strong>int ID\u037echar GIFT[20]\u037e float Cost\u037e<\/strong><\/p>\n<p><strong>public :<\/strong><\/p>\n<p><strong>void Get()<\/strong><\/p>\n<p><strong>{<br \/>\ncin&gt;&gt;CODE\u037egets(GIFT)\u037ecin&gt;&gt;Cost\u037e<\/strong><\/p>\n<p><strong>}<\/strong><\/p>\n<p><strong>void See()<\/strong><\/p>\n<p><strong>{<\/strong><\/p>\n<p><strong>cout&lt;&lt;ID&lt;&lt;&#8220;:&#8221;&lt;&lt;GIFT&lt;&lt;&#8220;:&#8221;&lt;&lt;Cost&lt;&lt;endl\u037e<\/strong><\/p>\n<p><strong>}<\/strong><\/p>\n<p><strong>float GetCost() {return Cost\u037e}.<\/strong><\/p>\n<p><strong>}\u037e<\/strong><\/p>\n<p><strong>Ans.<\/strong> void Economic()<\/p>\n<p>{<\/p>\n<p>ITEMS I\u037e<\/p>\n<p>ifstream fin(\u201cITEMS.DAT\u201d,ios::binary)\u037e<\/p>\n<p>while (fin.read((char *)&amp;I,sizeof(I)))<\/p>\n<p>{<\/p>\n<p>if(I.GetCost()&lt;2500)<\/p>\n<p>I.See()\u037e<\/p>\n<p>}<\/p>\n<p>fin.close()\u037e<\/p>\n<p>}<\/p>\n<p style=\"text-align: center;\"><strong>OR<\/strong><\/p>\n<p>Any other correct equivalent function definition<\/p>\n<p>(\u00bd Mark for opening ITEMS.DAT correctly)<\/p>\n<p>(1 Mark for reading all records from the file)<\/p>\n<p>(1 Mark for checking value of Cost &lt; 2500 )<\/p>\n<p>(\u00bd Mark for displaying the desired items)<\/p>\n<p><strong>(c) Find the output of the following C++ code considering that the binary file CLIENTS.DAT exists on the hard disk with records of 100 members. (1)<\/strong><\/p>\n<p><strong>class CLIENTS<\/strong><\/p>\n<p><strong>{<\/strong><\/p>\n<p><strong>int Cno\u037echar Name[20]\u037e<\/strong><\/p>\n<p><strong>public:<\/strong><\/p>\n<p><strong>void In()\u037e void Out()\u037e<\/strong><\/p>\n<p><strong>}\u037e<\/strong><\/p>\n<p><strong>void main{)<\/strong><\/p>\n<p><strong>{<\/strong><\/p>\n<p><strong>fstream CF\u037e<\/strong><\/p>\n<p><strong>CF.open(&#8220;CLIENTS.DAT&#8221;,ios:: binary| ios::in) \u037e<\/strong><\/p>\n<p><strong>CLIENTS C\u037e<\/strong><\/p>\n<p><strong>CF.read((char*)&amp;C,sizeof(C))\u037e<\/strong><\/p>\n<p><strong>CF.read((char*)&amp;C,sizeof(C))\u037e<\/strong><\/p>\n<p><strong>CF.read((char*)&amp;C,sizeof(C))\u037e<\/strong><\/p>\n<p><strong>int POS=CF.tellg()\/sizeof(C)\u037e<\/strong><\/p>\n<p><strong>cout&lt;&lt;&#8220;PRESENT RECORD:&#8221;&lt;&lt;POS&lt;&lt;endl\u037e<\/strong><\/p>\n<p><strong>CF.close() \u037e<\/strong><\/p>\n<p><strong>}<\/strong><\/p>\n<p><strong>Ans.<\/strong> PRESENT RECORD: 3<\/p>\n<p>(1 Mark for writing PRESENT RECORD: 3 )<\/p>\n<p style=\"text-align: center;\"><strong>OR<\/strong><\/p>\n<p>(1 Mark for writing only 3 )<\/p>\n<p style=\"text-align: center;\"><strong>OR<\/strong><\/p>\n<p>(\u00bd Mark for writing only PRESENT RECORD:<\/p>\n<div>\n<p style=\"text-align: center;\"><strong>These are First 4 questions only. To view and download complete question paper with solution install myCBSEguide App from google play store or login to our\u00a0<a href=\"https:\/\/mycbseguide.com\/dashboard\/\">student dashboard<\/a>.<\/strong><\/p>\n<p style=\"text-align: center;\"><b><strong><a class=\"button\" href=\"https:\/\/play.google.com\/store\/apps\/details?id=in.techchefs.MyCBSEGuide&amp;referrer=utm_source%3Dmycbse_bottom%26utm_medium%3Dtext%26utm_campaign%3Dmycbseads\">Download myCBSEguide App<\/a><\/strong><\/b><\/p>\n<\/div>\n<h2><span class=\"ez-toc-section\" id=\"Last_Year_Question_Paper_Class_12_Computer_Science_2015\"><\/span>Last Year Question Paper Class 12 Computer Science 2015<span class=\"ez-toc-section-end\"><\/span><\/h2>\n<p>Download class 12 Computer Science question paper with solution from best CBSE App the myCBSEguide. CBSE class 12 Computer Science question paper 2015 in PDF format with solution will help you to understand the latest question paper pattern and marking scheme of the CBSE board examination. You will get to know the difficulty level of the question paper.<\/p>\n<h2><span class=\"ez-toc-section\" id=\"Previous_Year_Question_Paper_for_class_12_in_PDF\"><\/span>Previous Year Question Paper for class 12 in PDF<span class=\"ez-toc-section-end\"><\/span><\/h2>\n<p>CBSE question papers 2018, 2017, 2016, 2015, 2014, 2013, 2012, 2011, 2010, 2009, 2008, 2007, 2006, 2005 and so on for all the subjects are available under this download link. Practicing real question paper certainly helps students to get confidence and improve performance in weak areas.<\/p>\n<ul>\n<li><a href=\"http:\/\/mycbseguide.com\/downloads\/cbse-class-12-physics\/1251\/cbse-last-year-papers\/3\/\">Physics<\/a><\/li>\n<li><a href=\"http:\/\/mycbseguide.com\/downloads\/cbse-class-12-chemistry\/1267\/cbse-last-year-papers\/3\/\">Chemistry<\/a><\/li>\n<li><a href=\"http:\/\/mycbseguide.com\/downloads\/cbse-class-12-mathematics\/1284\/cbse-last-year-papers\/3\/\">Mathematics<\/a><\/li>\n<li><a href=\"http:\/\/mycbseguide.com\/downloads\/cbse-class-12-biology\/1298\/cbse-last-year-papers\/3\/\">Biology<\/a><\/li>\n<li><a href=\"http:\/\/mycbseguide.com\/downloads\/cbse-class-12-accountancy\/1315\/cbse-last-year-papers\/3\/\">Accountancy<\/a><\/li>\n<li><a href=\"http:\/\/mycbseguide.com\/downloads\/cbse-class-12-business-studies\/1727\/cbse-last-year-papers\/3\/\">Business Studies<\/a><\/li>\n<li><a href=\"http:\/\/mycbseguide.com\/downloads\/cbse-class-12-economics\/1327\/cbse-last-year-papers\/3\/\">Economics<\/a><\/li>\n<li><a href=\"http:\/\/mycbseguide.com\/downloads\/cbse-class-12-history\/1869\/cbse-last-year-papers\/3\/\">History<\/a><\/li>\n<li><a href=\"http:\/\/mycbseguide.com\/downloads\/cbse-class-12-geography\/1863\/cbse-last-year-papers\/3\/\">Geography<\/a><\/li>\n<li><a href=\"http:\/\/mycbseguide.com\/downloads\/cbse-class-12-political-science\/1879\/cbse-last-year-papers\/3\/\">Political Science<\/a><\/li>\n<li><a href=\"http:\/\/mycbseguide.com\/downloads\/cbse-class-12-physical-education\/1877\/cbse-last-year-papers\/3\/\">Physical Education<\/a><\/li>\n<li><a href=\"http:\/\/mycbseguide.com\/downloads\/cbse-class-12-computer-science\/1851\/cbse-last-year-papers\/3\/\">Computer Science<\/a><\/li>\n<li><a href=\"http:\/\/mycbseguide.com\/downloads\/cbse-class-12-informatics-practices\/1873\/cbse-last-year-papers\/3\/\">Informatics Practices<\/a><\/li>\n<li><a href=\"http:\/\/mycbseguide.com\/downloads\/cbse-class-12-english-core\/1855\/cbse-last-year-papers\/3\/\">English Core<\/a><\/li>\n<li><a href=\"http:\/\/mycbseguide.com\/downloads\/cbse-class-12-hindi-core\/1865\/cbse-last-year-papers\/3\/\">Hindi Core<\/a><\/li>\n<li><a href=\"http:\/\/mycbseguide.com\/downloads\/cbse-class-12-hindi-elective\/1867\/cbse-last-year-papers\/3\/\">Hindi Elective<\/a><\/li>\n<li><a href=\"http:\/\/mycbseguide.com\/downloads\/cbse-class-12\/1250\/\">Other Subjects<\/a><\/li>\n<\/ul>\n<p>To download CBSE Question Paper class 12 Accountancy, Chemistry, Physics, History, Political Science, Economics, Geography, Computer Science, Home Science, Accountancy, Business Studies and Home Science; do check myCBSEguide app or website. myCBSEguide provides sample papers with solution, test papers for chapter-wise practice, NCERT solutions, NCERT Exemplar solutions, quick revision notes for ready reference, CBSE guess papers and CBSE important question papers. Sample Paper all are made available through\u00a0<a href=\"https:\/\/play.google.com\/store\/apps\/details?id=in.techchefs.MyCBSEGuide&amp;referrer=utm_source%3Dmycbse_bottom%26utm_medium%3Dtext%26utm_campaign%3Dmycbseads\"><strong>the best app for CBSE students<\/strong><\/a>\u00a0and myCBSEguide website.<\/p>\n<\/div>\n","protected":false},"excerpt":{"rendered":"<p>CBSE Question Paper 2015 class 12 Computer Science\u00a0conducted by Central Board of Secondary Education, New Delhi in the month of March 2015. CBSE previous year question papers with solution are available in myCBSEguide mobile app and cbse guide website. The Best CBSE App for students and teachers is myCBSEguide which provides complete study material and &#8230; <a title=\"CBSE Question Paper 2015 class 12 Computer Science\" class=\"read-more\" href=\"https:\/\/mycbseguide.com\/blog\/cbse-question-paper-2015-class-12-computer-science\/\" aria-label=\"More on CBSE Question Paper 2015 class 12 Computer Science\">Read more<\/a><\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1346,1014,1443],"tags":[1527,1342,326,80,1566,1569],"class_list":["post-22674","post","type-post","status-publish","format-standard","hentry","category-cbse","category-cbse-question-papers","category-computer-science-cbse-class-12","tag-cbse-question-paper","tag-class-12","tag-computer-science","tag-last-year-papers","tag-previous-question-paper","tag-ten-year-questions-paper"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v26.0 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>CBSE Question Paper 2015 class 12 Computer Science<\/title>\n<meta name=\"description\" content=\"CBSE Question Paper 2015 class 12 Computer Science\u00a0conducted by Central Board of Secondary Education, New Delhi in the month of March 2015\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/mycbseguide.com\/blog\/cbse-question-paper-2015-class-12-computer-science\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"CBSE Question Paper 2015 class 12 Computer Science\" \/>\n<meta property=\"og:description\" content=\"CBSE Question Paper 2015 class 12 Computer Science\u00a0conducted by Central Board of Secondary Education, New Delhi in the month of March 2015\" \/>\n<meta property=\"og:url\" content=\"https:\/\/mycbseguide.com\/blog\/cbse-question-paper-2015-class-12-computer-science\/\" \/>\n<meta property=\"og:site_name\" content=\"myCBSEguide\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/mycbseguide\/\" \/>\n<meta property=\"article:published_time\" content=\"2018-12-01T10:45:55+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2018-12-19T08:40:30+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/mycbseguide.com\/blog\/wp-content\/uploads\/2016\/09\/mycbseguide_n.jpg\" \/>\n\t<meta property=\"og:image:width\" content=\"599\" \/>\n\t<meta property=\"og:image:height\" content=\"242\" \/>\n\t<meta property=\"og:image:type\" content=\"image\/jpeg\" \/>\n<meta name=\"author\" content=\"myCBSEguide\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:creator\" content=\"@mycbseguide\" \/>\n<meta name=\"twitter:site\" content=\"@mycbseguide\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"myCBSEguide\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"15 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/mycbseguide.com\/blog\/cbse-question-paper-2015-class-12-computer-science\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/mycbseguide.com\/blog\/cbse-question-paper-2015-class-12-computer-science\/\"},\"author\":{\"name\":\"myCBSEguide\",\"@id\":\"https:\/\/mycbseguide.com\/blog\/#\/schema\/person\/f67796d5f5c5a468e8c680aaaad21519\"},\"headline\":\"CBSE Question Paper 2015 class 12 Computer Science\",\"datePublished\":\"2018-12-01T10:45:55+00:00\",\"dateModified\":\"2018-12-19T08:40:30+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/mycbseguide.com\/blog\/cbse-question-paper-2015-class-12-computer-science\/\"},\"wordCount\":2988,\"commentCount\":1,\"publisher\":{\"@id\":\"https:\/\/mycbseguide.com\/blog\/#organization\"},\"keywords\":[\"CBSE Question Paper\",\"class 12\",\"Computer Science\",\"Last Year Papers\",\"previous question paper\",\"Ten Year Questions Paper\"],\"articleSection\":[\"CBSE\",\"CBSE Question Papers\",\"Computer Science\"],\"inLanguage\":\"en-US\"},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/mycbseguide.com\/blog\/cbse-question-paper-2015-class-12-computer-science\/\",\"url\":\"https:\/\/mycbseguide.com\/blog\/cbse-question-paper-2015-class-12-computer-science\/\",\"name\":\"CBSE Question Paper 2015 class 12 Computer Science\",\"isPartOf\":{\"@id\":\"https:\/\/mycbseguide.com\/blog\/#website\"},\"datePublished\":\"2018-12-01T10:45:55+00:00\",\"dateModified\":\"2018-12-19T08:40:30+00:00\",\"description\":\"CBSE Question Paper 2015 class 12 Computer Science\u00a0conducted by Central Board of Secondary Education, New Delhi in the month of March 2015\",\"breadcrumb\":{\"@id\":\"https:\/\/mycbseguide.com\/blog\/cbse-question-paper-2015-class-12-computer-science\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/mycbseguide.com\/blog\/cbse-question-paper-2015-class-12-computer-science\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/mycbseguide.com\/blog\/cbse-question-paper-2015-class-12-computer-science\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/mycbseguide.com\/blog\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"CBSE Question Papers\",\"item\":\"https:\/\/mycbseguide.com\/blog\/category\/cbse-question-papers\/\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"CBSE Question Paper 2015 class 12 Computer Science\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/mycbseguide.com\/blog\/#website\",\"url\":\"https:\/\/mycbseguide.com\/blog\/\",\"name\":\"myCBSEguide\",\"description\":\"\",\"publisher\":{\"@id\":\"https:\/\/mycbseguide.com\/blog\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/mycbseguide.com\/blog\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"https:\/\/mycbseguide.com\/blog\/#organization\",\"name\":\"myCBSEguide\",\"url\":\"https:\/\/mycbseguide.com\/blog\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/mycbseguide.com\/blog\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/mycbseguide.com\/blog\/wp-content\/uploads\/2016\/04\/books_square.png\",\"contentUrl\":\"https:\/\/mycbseguide.com\/blog\/wp-content\/uploads\/2016\/04\/books_square.png\",\"width\":180,\"height\":180,\"caption\":\"myCBSEguide\"},\"image\":{\"@id\":\"https:\/\/mycbseguide.com\/blog\/#\/schema\/logo\/image\/\"},\"sameAs\":[\"https:\/\/www.facebook.com\/mycbseguide\/\",\"https:\/\/x.com\/mycbseguide\",\"https:\/\/www.linkedin.com\/company\/mycbseguide\/\",\"http:\/\/in.pinterest.com\/mycbseguide\/\",\"https:\/\/www.youtube.com\/channel\/UCxuqSnnygFzwJG0pwogCNEQ\"]},{\"@type\":\"Person\",\"@id\":\"https:\/\/mycbseguide.com\/blog\/#\/schema\/person\/f67796d5f5c5a468e8c680aaaad21519\",\"name\":\"myCBSEguide\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"CBSE Question Paper 2015 class 12 Computer Science","description":"CBSE Question Paper 2015 class 12 Computer Science\u00a0conducted by Central Board of Secondary Education, New Delhi in the month of March 2015","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/mycbseguide.com\/blog\/cbse-question-paper-2015-class-12-computer-science\/","og_locale":"en_US","og_type":"article","og_title":"CBSE Question Paper 2015 class 12 Computer Science","og_description":"CBSE Question Paper 2015 class 12 Computer Science\u00a0conducted by Central Board of Secondary Education, New Delhi in the month of March 2015","og_url":"https:\/\/mycbseguide.com\/blog\/cbse-question-paper-2015-class-12-computer-science\/","og_site_name":"myCBSEguide","article_publisher":"https:\/\/www.facebook.com\/mycbseguide\/","article_published_time":"2018-12-01T10:45:55+00:00","article_modified_time":"2018-12-19T08:40:30+00:00","og_image":[{"width":599,"height":242,"url":"https:\/\/mycbseguide.com\/blog\/wp-content\/uploads\/2016\/09\/mycbseguide_n.jpg","type":"image\/jpeg"}],"author":"myCBSEguide","twitter_card":"summary_large_image","twitter_creator":"@mycbseguide","twitter_site":"@mycbseguide","twitter_misc":{"Written by":"myCBSEguide","Est. reading time":"15 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/mycbseguide.com\/blog\/cbse-question-paper-2015-class-12-computer-science\/#article","isPartOf":{"@id":"https:\/\/mycbseguide.com\/blog\/cbse-question-paper-2015-class-12-computer-science\/"},"author":{"name":"myCBSEguide","@id":"https:\/\/mycbseguide.com\/blog\/#\/schema\/person\/f67796d5f5c5a468e8c680aaaad21519"},"headline":"CBSE Question Paper 2015 class 12 Computer Science","datePublished":"2018-12-01T10:45:55+00:00","dateModified":"2018-12-19T08:40:30+00:00","mainEntityOfPage":{"@id":"https:\/\/mycbseguide.com\/blog\/cbse-question-paper-2015-class-12-computer-science\/"},"wordCount":2988,"commentCount":1,"publisher":{"@id":"https:\/\/mycbseguide.com\/blog\/#organization"},"keywords":["CBSE Question Paper","class 12","Computer Science","Last Year Papers","previous question paper","Ten Year Questions Paper"],"articleSection":["CBSE","CBSE Question Papers","Computer Science"],"inLanguage":"en-US"},{"@type":"WebPage","@id":"https:\/\/mycbseguide.com\/blog\/cbse-question-paper-2015-class-12-computer-science\/","url":"https:\/\/mycbseguide.com\/blog\/cbse-question-paper-2015-class-12-computer-science\/","name":"CBSE Question Paper 2015 class 12 Computer Science","isPartOf":{"@id":"https:\/\/mycbseguide.com\/blog\/#website"},"datePublished":"2018-12-01T10:45:55+00:00","dateModified":"2018-12-19T08:40:30+00:00","description":"CBSE Question Paper 2015 class 12 Computer Science\u00a0conducted by Central Board of Secondary Education, New Delhi in the month of March 2015","breadcrumb":{"@id":"https:\/\/mycbseguide.com\/blog\/cbse-question-paper-2015-class-12-computer-science\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/mycbseguide.com\/blog\/cbse-question-paper-2015-class-12-computer-science\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/mycbseguide.com\/blog\/cbse-question-paper-2015-class-12-computer-science\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/mycbseguide.com\/blog\/"},{"@type":"ListItem","position":2,"name":"CBSE Question Papers","item":"https:\/\/mycbseguide.com\/blog\/category\/cbse-question-papers\/"},{"@type":"ListItem","position":3,"name":"CBSE Question Paper 2015 class 12 Computer Science"}]},{"@type":"WebSite","@id":"https:\/\/mycbseguide.com\/blog\/#website","url":"https:\/\/mycbseguide.com\/blog\/","name":"myCBSEguide","description":"","publisher":{"@id":"https:\/\/mycbseguide.com\/blog\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/mycbseguide.com\/blog\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Organization","@id":"https:\/\/mycbseguide.com\/blog\/#organization","name":"myCBSEguide","url":"https:\/\/mycbseguide.com\/blog\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/mycbseguide.com\/blog\/#\/schema\/logo\/image\/","url":"https:\/\/mycbseguide.com\/blog\/wp-content\/uploads\/2016\/04\/books_square.png","contentUrl":"https:\/\/mycbseguide.com\/blog\/wp-content\/uploads\/2016\/04\/books_square.png","width":180,"height":180,"caption":"myCBSEguide"},"image":{"@id":"https:\/\/mycbseguide.com\/blog\/#\/schema\/logo\/image\/"},"sameAs":["https:\/\/www.facebook.com\/mycbseguide\/","https:\/\/x.com\/mycbseguide","https:\/\/www.linkedin.com\/company\/mycbseguide\/","http:\/\/in.pinterest.com\/mycbseguide\/","https:\/\/www.youtube.com\/channel\/UCxuqSnnygFzwJG0pwogCNEQ"]},{"@type":"Person","@id":"https:\/\/mycbseguide.com\/blog\/#\/schema\/person\/f67796d5f5c5a468e8c680aaaad21519","name":"myCBSEguide"}]}},"_links":{"self":[{"href":"https:\/\/mycbseguide.com\/blog\/wp-json\/wp\/v2\/posts\/22674","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/mycbseguide.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/mycbseguide.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/mycbseguide.com\/blog\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/mycbseguide.com\/blog\/wp-json\/wp\/v2\/comments?post=22674"}],"version-history":[{"count":3,"href":"https:\/\/mycbseguide.com\/blog\/wp-json\/wp\/v2\/posts\/22674\/revisions"}],"predecessor-version":[{"id":23720,"href":"https:\/\/mycbseguide.com\/blog\/wp-json\/wp\/v2\/posts\/22674\/revisions\/23720"}],"wp:attachment":[{"href":"https:\/\/mycbseguide.com\/blog\/wp-json\/wp\/v2\/media?parent=22674"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/mycbseguide.com\/blog\/wp-json\/wp\/v2\/categories?post=22674"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/mycbseguide.com\/blog\/wp-json\/wp\/v2\/tags?post=22674"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}