{"id":25560,"date":"2022-02-13T23:15:04","date_gmt":"2022-02-13T17:45:04","guid":{"rendered":"https:\/\/infinitylearn.com\/surge\/?p=25560"},"modified":"2024-01-16T14:26:24","modified_gmt":"2024-01-16T08:56:24","slug":"important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue","status":"publish","type":"post","link":"https:\/\/infinitylearn.com\/surge\/important-questions\/class12\/computer-science\/important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue\/","title":{"rendered":"Important Questions for Class 12 Computer Science (C++) \u2013 Linked List, Stack and Queue"},"content":{"rendered":"<div id=\"ez-toc-container\" class=\"ez-toc-v2_0_37 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\">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\" style=\"display: none;\"><label for=\"item\" aria-label=\"Table of Content\"><span style=\"display: flex;align-items: center;width: 35px;height: 30px;justify-content: center;\"><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><\/label><input type=\"checkbox\" id=\"item\"><\/a><\/span><\/div>\n<nav><ul class='ez-toc-list ez-toc-list-level-1' style='display:block'><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-1\" href=\"https:\/\/infinitylearn.com\/surge\/important-questions\/class12\/computer-science\/important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue\/#Important_Questions_for_Class_12_Computer_Science_C_-_Linked_List_Stack_and_Queue\" title=\"Important Questions for Class 12 Computer Science (C++) \u2013 Linked List, Stack and Queue\">Important Questions for Class 12 Computer Science (C++) \u2013 Linked List, Stack and Queue<\/a><ul class='ez-toc-list-level-3'><li class='ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-2\" href=\"https:\/\/infinitylearn.com\/surge\/important-questions\/class12\/computer-science\/important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue\/#Topic_-_1_Linked_List_and_Stack_Previous_years_Examination_Questions_2_Marks_Questions\" title=\"Topic \u2013 1  \nLinked List and Stack \nPrevious years Examination Questions \n 2 Marks Questions\">Topic \u2013 1  \nLinked List and Stack \nPrevious years Examination Questions \n 2 Marks Questions<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-3\" href=\"https:\/\/infinitylearn.com\/surge\/important-questions\/class12\/computer-science\/important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue\/#Topic_-_2_Queue_Previous_years_Examination_Questions_4_Marks_Questions\" title=\"Topic \u2013 2  \nQueue \nPrevious years Examination Questions \n4 Marks Questions\">Topic \u2013 2  \nQueue \nPrevious years Examination Questions \n4 Marks Questions<\/a><\/li><\/ul><\/li><\/ul><\/nav><\/div>\n<h2><span class=\"ez-toc-section\" id=\"Important_Questions_for_Class_12_Computer_Science_C_-_Linked_List_Stack_and_Queue\"><\/span><span style=\"color: #00ccff;\"><strong>Important Questions for Class 12 Computer Science (C++) \u2013 Linked List, Stack and Queue<\/strong><\/span><span class=\"ez-toc-section-end\"><\/span><\/h2>\n<h3 style=\"text-align: center;\"><span class=\"ez-toc-section\" id=\"Topic_-_1_Linked_List_and_Stack_Previous_years_Examination_Questions_2_Marks_Questions\"><\/span><span style=\"color: #0000ff;\">Topic \u2013 1 <\/span><br \/>\n<span style=\"color: #0000ff;\">Linked List and Stack<\/span><br \/>\n<span style=\"color: #0000ff;\">Previous years Examination Questions<\/span><br \/>\n<span style=\"color: #0000ff;\"> 2 Marks Questions<\/span><span class=\"ez-toc-section-end\"><\/span><\/h3>\n<p><span style=\"color: #eb4924;\"><strong>Question 1:<br \/>\n<\/strong><\/span>Convert the following infix expression to its equivalent postfix expression, showing the stack contents for each step of conversion:<br \/>\nP\/(Q-R)*S + T <strong>All India 2016<br \/>\n<span style=\"color: #eb4924;\"><span style=\"color: #008000;\">\u0410nswer:<\/span><\/span><\/strong><br \/>\n<img loading=\"lazy\" src=\"https:\/\/infinitylearn.com\/surge\/wp-content\/uploads\/2021\/12\/24499330477_b3652cd539_o.png\" alt=\"important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue-(222-1)\" width=\"344\" height=\"388\" \/><\/p>\n<p><span style=\"color: #eb4924;\"><strong>Question 2:<br \/>\n<\/strong><\/span>Convert the following infix expression to its equivalent postfix expression, showing the stack contents for each step of conversion.<br \/>\nA\/(B + Q*D-E <strong>Delhi 2016<br \/>\n<span style=\"color: #eb4924;\"><span style=\"color: #008000;\">\u0410nswer:<\/span><\/span><\/strong><br \/>\n<img loading=\"lazy\" src=\"https:\/\/infinitylearn.com\/surge\/wp-content\/uploads\/2021\/12\/24499330337_1420e138f7_o.png\" alt=\"important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue-(222-2)\" width=\"281\" height=\"128\" \/><br \/>\n<img loading=\"lazy\" src=\"https:\/\/infinitylearn.com\/surge\/wp-content\/uploads\/2021\/12\/24499330227_ca86c490c9_o.png\" alt=\"important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue-(222-3)\" width=\"300\" height=\"243\" \/><\/p>\n<p><span style=\"color: #eb4924;\"><strong>Question 3:<br \/>\n<\/strong><\/span>Convert the following infix expression to its equivalent postfix expression, showing the stack contents for each step of conversion.<br \/>\nP\/(Q+(R-T)*U <strong>All India (C) 2016<br \/>\n<span style=\"color: #eb4924;\"><span style=\"color: #008000;\">\u0410nswer:<\/span><\/span><\/strong><br \/>\n<img loading=\"lazy\" src=\"https:\/\/infinitylearn.com\/surge\/wp-content\/uploads\/2021\/12\/24499330107_1411e4bf6b_o.png\" alt=\"important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue-(222-4)\" width=\"275\" height=\"263\" \/><br \/>\n<img loading=\"lazy\" src=\"https:\/\/infinitylearn.com\/surge\/wp-content\/uploads\/2021\/12\/24499329987_602c5240c4_o.png\" alt=\"important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue-(223-1)\" width=\"279\" height=\"214\" \/><\/p>\n<p><span style=\"color: #eb4924;\"><strong>Question 4:<br \/>\n<\/strong><\/span>Convert the following infix expression to its equivalent postfix expression, showing the stack contents for each step of conversion:<br \/>\n(U* V+ R\/ (S-T)) <strong>All India 2015<br \/>\n<span style=\"color: #eb4924;\"><span style=\"color: #008000;\">\u0410nswer:<\/span><\/span><\/strong><br \/>\n<img loading=\"lazy\" src=\"https:\/\/infinitylearn.com\/surge\/wp-content\/uploads\/2021\/12\/25494585948_3ea19b3508_o.png\" alt=\"important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue-(223-2)\" width=\"350\" height=\"377\" \/><\/p>\n<p><span style=\"color: #eb4924;\"><strong>Question 5:<br \/>\n<\/strong><\/span>Convert the following infix expression to its equivalent postfix expression, showing the stack contents for each step of conversion.<br \/>\n(X\/Y+U*(V-W)) <strong>Delhi 2015<br \/>\n<span style=\"color: #eb4924;\"><span style=\"color: #008000;\">\u0410nswer:<\/span><\/span><\/strong><br \/>\n<img loading=\"lazy\" src=\"https:\/\/infinitylearn.com\/surge\/wp-content\/uploads\/2021\/12\/25494585848_41b1fdeb14_o.png\" alt=\"important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue-(223-3)\" width=\"352\" height=\"395\" \/><\/p>\n<p><span style=\"color: #eb4924;\"><strong>Question 6:<br \/>\n<\/strong><\/span>Evaluate the following postfix expression. Show the. status of stack after execution of each operation separately:<br \/>\nF, T, NOT, AND, F, OR, T, AND   <strong>Delhi 2014<br \/>\n<span style=\"color: #eb4924;\"><span style=\"color: #008000;\">\u0410nswer:<\/span><\/span><\/strong><br \/>\n<img loading=\"lazy\" src=\"https:\/\/infinitylearn.com\/surge\/wp-content\/uploads\/2021\/12\/25494585818_26df3a53a0_o.png\" alt=\"important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue-(223-4)\" width=\"405\" height=\"499\" \/><\/p>\n<p><span style=\"color: #eb4924;\"><strong>Question 7:<br \/>\n<\/strong><\/span>Evaluate the following postfix expression. Show the status of stack after execution of each operation separately:<br \/>\nT, F, NOT, AND, T, OR, F, AND    <strong>All India 2014<br \/>\n<span style=\"color: #eb4924;\"><span style=\"color: #008000;\">\u0410nswer:<\/span><\/span><\/strong><br \/>\n<img loading=\"lazy\" src=\"https:\/\/infinitylearn.com\/surge\/wp-content\/uploads\/2021\/12\/25494585738_f8c03cbb15_o.png\" alt=\"important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue-(223-5)\" width=\"394\" height=\"495\" \/><\/p>\n<p><span style=\"color: #eb4924;\"><strong>Question 8:<br \/>\n<\/strong><\/span>Evaluate the following postfix expression: (show status of stack after each operation)<br \/>\n100,40,8,\/,20,10,-,+,*     <strong>All India (C) 2014<br \/>\n<span style=\"color: #eb4924;\"><span style=\"color: #008000;\">\u0410nswer:<\/span><\/span><\/strong><br \/>\n<img loading=\"lazy\" src=\"https:\/\/infinitylearn.com\/surge\/wp-content\/uploads\/2021\/12\/25494585658_ae97dede4f_o.png\" alt=\"important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue-(224-1)\" width=\"291\" height=\"274\" \/><\/p>\n<p><span style=\"color: #eb4924;\"><strong>Question 9:<br \/>\n<\/strong><\/span>Evaluate the following postfix expression. Show the status of stack after execution of each operation:<br \/>\n5, 2, *, 50, 5, \/, 5, -, +      <strong>All India 2013<br \/>\n<span style=\"color: #eb4924;\"><span style=\"color: #008000;\">\u0410nswer:<\/span><\/span><\/strong><br \/>\n<img loading=\"lazy\" src=\"https:\/\/infinitylearn.com\/surge\/wp-content\/uploads\/2021\/12\/25494585488_92938237f1_o.png\" alt=\"important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue-(224-2)\" width=\"287\" height=\"268\" \/><\/p>\n<p><span style=\"color: #eb4924;\"><strong>Question 10:<br \/>\n<\/strong><\/span>Evaluate the following postfix expression. Show the status of stack after execution of each operation:<br \/>\n60, 6, \/, 5, 2, *, 5, -, +     <strong>Delhi 2013<br \/>\n<span style=\"color: #eb4924;\"><span style=\"color: #008000;\">\u0410nswer:<\/span><\/span><\/strong><br \/>\n<img loading=\"lazy\" src=\"https:\/\/infinitylearn.com\/surge\/wp-content\/uploads\/2021\/12\/25494585398_409bf1c48b_o.png\" alt=\"important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue-(224-3)\" width=\"288\" height=\"268\" \/><\/p>\n<p><span style=\"color: #eb4924;\"><strong>Question 11:<br \/>\n<\/strong><\/span>Evaluate the following postfix expression using a stack and show the contents of stack after execution of each operation:<br \/>\n5, 3, 2, *, 4, 2, \/, -, *      <strong>Delhi 2013C<br \/>\n<span style=\"color: #eb4924;\"><span style=\"color: #008000;\">\u0410nswer:<\/span><\/span><\/strong><br \/>\n<img loading=\"lazy\" src=\"https:\/\/infinitylearn.com\/surge\/wp-content\/uploads\/2021\/12\/25494585218_cffb17b4d4_o.png\" alt=\"important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue-(224-4)\" width=\"294\" height=\"203\" \/><br \/>\n<img loading=\"lazy\" src=\"https:\/\/infinitylearn.com\/surge\/wp-content\/uploads\/2021\/12\/24499328987_a1187a5dd9_o.png\" alt=\"important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue-(224-5)\" width=\"293\" height=\"148\" \/><\/p>\n<p><span style=\"color: #eb4924;\"><strong>Question 12:<br \/>\n<\/strong><\/span>Evaluate the following postfix notation. Show status of stack after every step of evaluation (i.e. after each operator):<br \/>\nFalse, NOT, True, AND, True, False, OR, AND      <strong>Delhi 2012<br \/>\n<span style=\"color: #eb4924;\"><span style=\"color: #008000;\">\u0410nswer:<\/span><\/span><\/strong><br \/>\n<img loading=\"lazy\" src=\"https:\/\/infinitylearn.com\/surge\/wp-content\/uploads\/2021\/12\/25494585058_54ea4d3c6b_o.png\" alt=\"important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue-(224-6)\" width=\"402\" height=\"434\" \/><\/p>\n<p><span style=\"color: #eb4924;\"><strong>Question 13:<br \/>\n<\/strong><\/span>Evaluate the following postfix notation. Show status of stack after every step of evaluation (i.e. after each operator):<br \/>\nTrue, False, NOT, AND, False, True, OR, AND  <strong>  All India 2012<br \/>\n<span style=\"color: #eb4924;\"><span style=\"color: #008000;\">\u0410nswer:<\/span><\/span><\/strong><br \/>\n<img loading=\"lazy\" src=\"https:\/\/infinitylearn.com\/surge\/wp-content\/uploads\/2021\/12\/25494585078_17c01ee640_o.png\" alt=\"important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue-(224-7)\" width=\"397\" height=\"426\" \/><\/p>\n<p><span style=\"color: #eb4924;\"><strong>Question 14:<br \/>\n<\/strong><\/span>Evaluate the following postfix notation of expression:<br \/>\n50, 60, +, 20, 10, \u2013 ,*     <strong> Delhi 2011<br \/>\n<span style=\"color: #eb4924;\"><span style=\"color: #008000;\">\u0410nswer:<\/span><\/span><\/strong><br \/>\n<img loading=\"lazy\" src=\"https:\/\/infinitylearn.com\/surge\/wp-content\/uploads\/2021\/12\/25494584948_60933fe9c7_o.png\" alt=\"important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue-(225-1)\" width=\"348\" height=\"260\" \/><\/p>\n<p><span style=\"color: #eb4924;\"><strong>Question 15:<br \/>\n<\/strong><\/span>Evaluate the following postfix notation of expression:<br \/>\nTrue, False, NOT, AND, True, True, AND, OR  <strong>All india 2011<br \/>\n<span style=\"color: #eb4924;\"><span style=\"color: #008000;\">\u0410nswer:<\/span><\/span><\/strong><br \/>\n<img loading=\"lazy\" src=\"https:\/\/infinitylearn.com\/surge\/wp-content\/uploads\/2021\/12\/24499332077_3b12c477cc_o.png\" alt=\"important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue-(225-2)\" width=\"351\" height=\"551\" \/><\/p>\n<p><span style=\"color: #eb4924;\"><strong>Question 16:<br \/>\n<\/strong><\/span>Evaluate the following postfix notation of expression:<br \/>\nFalse, True, NOT, OR, True, False, AND, OR   <strong>Delhi 2010<br \/>\n<span style=\"color: #eb4924;\"><span style=\"color: #008000;\">\u0410nswer:<\/span><\/span><\/strong><br \/>\n<img loading=\"lazy\" src=\"https:\/\/infinitylearn.com\/surge\/wp-content\/uploads\/2021\/12\/39363644311_b164392d1d_o.png\" alt=\"important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue-(225-3)\" width=\"359\" height=\"203\" \/><br \/>\n<img loading=\"lazy\" src=\"https:\/\/infinitylearn.com\/surge\/wp-content\/uploads\/2021\/12\/25494587788_2f9a16f0e0_o.png\" alt=\"important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue-(225-4)\" width=\"362\" height=\"442\" \/><\/p>\n<p><span style=\"color: #eb4924;\"><strong>Question 17:<br \/>\n<\/strong><\/span>Evaluate the following postfix notation of expression. Show the status of stack after each operation:<br \/>\nTrue, False, NOT, OR, False, True, OR, AND <strong> All <\/strong> <strong>India 2010<br \/>\n<span style=\"color: #eb4924;\"><span style=\"color: #008000;\">\u0410nswer:<\/span><\/span><\/strong><br \/>\n<img loading=\"lazy\" src=\"https:\/\/infinitylearn.com\/surge\/wp-content\/uploads\/2021\/12\/24499332027_16f4ccbec5_o.png\" alt=\"important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue-(225-5)\" width=\"357\" height=\"563\" \/><\/p>\n<p><span style=\"color: #eb4924;\"><strong>Question 18:<br \/>\n<\/strong><\/span>Convert the following infix expression to its equivalent postfix expression.<br \/>\nShowing stack contents for the conversion:<br \/>\n(X \u2013 Y\/(Z+U)*V)    <strong>Delhi 2009<br \/>\n<span style=\"color: #eb4924;\"><span style=\"color: #008000;\">\u0410nswer:<\/span><\/span><\/strong><br \/>\n<img loading=\"lazy\" src=\"https:\/\/infinitylearn.com\/surge\/wp-content\/uploads\/2021\/12\/24499331447_c016172b85_o.png\" alt=\"important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue-(226-1)\" width=\"356\" height=\"349\" \/><\/p>\n<p><span style=\"color: #eb4924;\"><strong>Question 19:<br \/>\n<\/strong><\/span>Convert the following infix expression to its equivalent postfix expression.<br \/>\nShowing stack contents for the conversion:<br \/>\n(A + B* (C-D) IE) <strong>All India 2009<br \/>\n<span style=\"color: #eb4924;\"><span style=\"color: #008000;\">\u0410nswer:<\/span><\/span><\/strong><br \/>\n<img loading=\"lazy\" src=\"https:\/\/infinitylearn.com\/surge\/wp-content\/uploads\/2021\/12\/24499330587_4f3c881225_o.png\" alt=\"important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue-(226-2)\" width=\"353\" height=\"342\" \/><\/p>\n<p style=\"text-align: center;\"><span style=\"color: #0000ff;\"><strong>4 Marks Questions<\/strong><\/span><\/p>\n<p><span style=\"color: #eb4924;\"><strong>Question 20:<br \/>\n<\/strong><\/span>Write the definition of a member function PUSH( ) in C++, to add a new book in a dynamic stack of BOOKS considering the following code is already included in the program: <strong>All India 2015<\/strong><\/p>\n<pre>struct BOOKS \r\n{\r\nchar ISBN[20], TITLE[80];\r\nBOOKS *Link;\r\n};\r\nclass STACK \r\n{\r\nBOOKS *Top; \r\npublic:\r\nSTACK() {Top=NULL;} \r\nvoid PUSH(); \r\nvoid POP();\r\n\u223cSTACK();\r\n };\r\n<\/pre>\n<p><span style=\"color: #eb4924;\"><strong><span style=\"color: #008000;\">\u0410nswer:<\/span><\/strong><\/span><\/p>\n<pre>void STACK::PUSH()\r\n{\r\nBOOKS *b = new BOOKS; \r\ncout&lt;&lt;\"Enter ISBN number\"; \r\ncin&gt;&gt;b-&gt;ISBN; \r\ncout&lt;&lt;\"Enter TITLE\"; \r\ngets(b\u2014&gt;TITLE); \r\nif(TOP == NULL)\r\n{\r\nTOP = b;\r\n}\r\nelse\r\n{\r\nb-&gt;Link = TOP; \r\nTOP = b;\r\n}\r\n}<\/pre>\n<p><span style=\"color: #eb4924;\"><strong>Question 21:<br \/>\n<\/strong><\/span>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. <strong>Delhi 2015<\/strong><\/p>\n<pre>struct TEXTBOOKS\r\n{\r\nchar ISBN[20]; \r\nchar TITLE[80]; \r\nTEXTBOOKS *Link;\r\n};\r\nclass STACK \r\n{\r\nTEXTBOOKS *Top; \r\npublic:\r\nSTACK(){Top=NULL;} \r\nvoid Push(); \r\nvoid Pop();\r\n\u223cSTACKC);\r\n};<\/pre>\n<p><span style=\"color: #eb4924;\"><strong><span style=\"color: #008000;\">\u0410nswer:<\/span><\/strong><\/span><\/p>\n<pre>void STACK::Pop()\r\n{\r\nif(Top! = NULL)\r\n{\r\nTEXTBOOKS *Temp = Top;\r\nTop = Top-&gt;Link; \r\ndelete Temp; \r\n}\r\nelse\r\ncout&lt;&lt;\"Stack empty\";\r\n}<\/pre>\n<p><span style=\"color: #eb4924;\"><strong>Question 22:<br \/>\n<\/strong><\/span>Write a function POPBOOK( ) in C++ to perform delete operation from a dynamic stack, which contains Bno and Title. Consider the following definition of NODE, while writing your C++ code.  <strong>Delhi 2014<\/strong><\/p>\n<pre>struct NODE\r\n{\r\nint Bno;\r\nchar Title[20];\r\nNODE *Link;\r\n};<\/pre>\n<p><span style=\"color: #eb4924;\"><strong><span style=\"color: #008000;\">\u0410nswer:<\/span><\/strong><\/span><\/p>\n<pre>void P0PB00K(N0DE *top)\r\n{\r\ncout&lt;&lt;:Deleting the top element from stack\\n\"; \r\ncout&lt;&lt;\"Book No:\"&lt;&lt;top-&gt;Bno&lt;&lt;endl; \r\ncout&lt;&lt;\"BookTitle:\"&lt;&lt;top-&gt;Title&lt;&lt;endl;\r\nNODE *temp = top;\r\ntop = top-&gt;Link; \r\ndelete(temp);\r\n}<\/pre>\n<p><span style=\"color: #eb4924;\"><strong>Question 23:<br \/>\n<\/strong><\/span>Write a function PUSHBOOK( ) in C++ to perform insert operation on a dynamic stack, which contains Book_no and Book_Title. Consider the following definition of NODE, while writing your C++ code. <strong>All India 2014<\/strong><\/p>\n<pre>struct NODE \r\n{\r\nchar Book_No; \r\nchar Book_Title[20]:\r\nNODE *Next:\r\n};<\/pre>\n<p><span style=\"color: #eb4924;\"><strong><span style=\"color: #008000;\">\u0410nswer:<\/span><\/strong><\/span><\/p>\n<pre>void PUSHBOOK(NODE *top)\r\n{\r\nNODE *NEW = new NODE; \r\ncout&lt;&lt;\"Enter the Book Number:\"; \r\ncin&gt;&gt;NEW-&gt;Book_No; \r\ncout&lt;&lt;\"Enter the Book Title:\"; \r\ngets(NEW-&gt;Book_Titie);\r\nNEW-&gt;Next = NULL; \r\nif(top == NULL)\r\ntop = NEW; \r\nelse \r\n{\r\nNEW-&gt;Next = top; \r\ntop = NEW;\r\n}\r\n}<\/pre>\n<p><span style=\"color: #eb4924;\"><strong>Question 24:<br \/>\n<\/strong><\/span>Write a complete program in C++ to implement a dynamically allocated stack containing names of Countries. <strong>Delhi 2010<br \/>\n<span style=\"color: #eb4924;\"><span style=\"color: #008000;\">\u0410nswer:<\/span><\/span><br \/>\n<\/strong><\/p>\n<pre>The program is:\r\n#include&lt;iostream.h&gt;\r\n#include&lt;stdio.h&gt;\r\nstruct Node\r\n{ \r\nchar Country[30];\r\nNode *Link;\r\n};\r\nclass Stack \r\n{\r\nNode *Top; \r\npublic:\r\nStack(){Top = NULL;} \r\nvoid Push(); \r\nvoid Pop();\r\nvoid Display();\r\n\u223cStack();\r\n};\r\nvoid Stack :: Push()\r\n{\r\nNode *Temp = new Node; \r\ngets(Temp-&gt;Country); \r\nTemp-&gt;Link = Top;\r\nTop = Temp;\r\n}\r\nvoid Stack :: Pop()\r\n{\r\nif(Top!=NULL) \r\n{\r\nNode *Temp = Top;\r\nTop = Top-&gt;Link; \r\ndelete Temp;\r\n}\r\nelse\r\ncout&lt;&lt;\"Stack empty\";\r\n}\r\nvoid Stack :: Display()\r\n{\r\nNode *Temp = Top; \r\nwhile(Temp!= NULL)\r\ncout&lt;&lt;Temp-&gt;Country&lt;&lt;endl; \r\nTemp = Temp-&gt;Link;\r\nStack :: \u223cStack()\r\n{\r\nwhile(Top!=NULL)\r\n{\r\nNode *Temp = Top;\r\nTop = Top-&gt;Link; \r\ndelete Temp;\r\n}\r\n}\r\nvoid main()\r\n{\r\nStack ST; \r\nchar ch; \r\ndo \r\n{\r\ncout&lt;&lt;\"Choose any one P\/O\/D\/Q\"; \/* displaying choices P - Push,0 - Pop, D-Display, Q-Exit *\/ \r\ncin&gt;&gt;ch; \r\nswitch(ch)\r\n{\r\ncase 'P':ST.Push(); \r\nbreak;\r\ncase '0':ST.Pop(); \r\nbreak;\r\ncase 'D':ST.Display();\r\n}\r\n}\r\nwhile(ch!='Q');\r\n}<\/pre>\n<h3 style=\"text-align: center;\"><span class=\"ez-toc-section\" id=\"Topic_-_2_Queue_Previous_years_Examination_Questions_4_Marks_Questions\"><\/span><span style=\"color: #0000ff;\">Topic \u2013 2 <\/span><br \/>\n<span style=\"color: #0000ff;\">Queue<\/span><br \/>\n<span style=\"color: #0000ff;\">Previous years Examination Questions<\/span><br \/>\n<span style=\"color: #0000ff;\">4 Marks Questions<\/span><span class=\"ez-toc-section-end\"><\/span><\/h3>\n<p><span style=\"color: #eb4924;\"><strong>Question 1:<br \/>\n<\/strong><\/span>Write the definition of a member function DELETE( ) for a class QUEUE in C++, to remove a product from a dynamically allocated Queue of products considering the following code is already written as a part of the program. <strong>All India 2016<\/strong><\/p>\n<pre>struct PRODUCT \r\n{\r\nint PID; \r\nchar PNAME[20];\r\nPRODUCT *Next;\r\n};\r\nclass QUEUE \r\n{\r\nPRODUCT *R,*F; \r\npublic:\r\nQUEUE(){R=NULL;F=NULL;} \r\nvoid INSERT(); \r\nvoid DELETE();\r\n\u223cQUEUE();\r\n};\r\n<\/pre>\n<p><span style=\"color: #eb4924;\"><strong><span style=\"color: #008000;\">\u0410nswer:<\/span><\/strong><\/span><\/p>\n<pre>void QUEUE :: DELETE() \r\n{\r\nif(F!=NULL)\r\n{\r\nPRODUCT *Temp=F;\r\ncout&lt;&lt;F-&gt;data&lt;&lt;\"deleted\\n\";\r\nF=F-&gt;Next; \r\ndelete Temp;\r\nif(F==NULL)  \r\nR=NULL;\r\n}\r\nelse\r\ncout&lt;&lt;\"\\n Queue is Empty\":\r\n}<\/pre>\n<p><span style=\"color: #eb4924;\"><strong>Question 2:<br \/>\n<\/strong><\/span>Write the definition of a member function INSERT( ) for a class QUEUE in C++, to insert an ITEM in a dynamically allocated Queue of items considering the following code is already written as a part of the program. <strong>Delhi 2016<\/strong><\/p>\n<pre>struct ITEM \r\n{\r\nint INO; \r\nchar INAME[20];\r\nITEM *Link; \r\n};\r\nclass QUEUE \r\n{\r\nITEM *R, *F; \r\npublic:\r\nQUEUE() {R=NULL; F=NULL;} \r\nvoid INSERT(); \r\nvoid DELETE();\r\n\u223cQUEUE();\r\n};<\/pre>\n<p><span style=\"color: #eb4924;\"><strong><span style=\"color: #008000;\">\u0410nswer:<\/span><\/strong><\/span><\/p>\n<pre>void QUEUE :: INSERT!)\r\n{ \r\nITEM *temp=new ITEM;\r\ncout&lt;&lt;\"\\n Enter Item no &amp; Item name:\";\r\ncin&gt;&gt;temp-&gt;INO; \r\ngets(temp-&gt;IName);\r\ntemp-&gt;Next = Null;\r\nif(R==Null)\r\n{\r\nR = temp;\r\nF = temp; \r\n}\r\nelse\r\n{\r\nR-&gt;Next = temp;\r\nR = temp;\r\n}\r\n}<\/pre>\n<p><span style=\"color: #eb4924;\"><strong>Question 3:<br \/>\n<\/strong><\/span>Write the definition of a member function INSERT! ) in C++, to add a new passenger detail in a dynamic queue of PASSENGERS considering the following code is already existing in the program. <strong>All India 2015<\/strong><\/p>\n<pre>struct PASSENGERS\r\n{\r\nchar PID[20]; NAME[80];\r\nPASSENGERS *Next;\r\n};\r\nclass QUEUE\r\n{\r\nPASSENGERS *Rear, *Front; \r\npublic:  \r\nQUEUE() {Rear=NULL; Front=NULL}\r\nvoid INSERT(); \r\nvoid DELETE();\r\n\u223cQUEUE();\r\n};<\/pre>\n<p><span style=\"color: #eb4924;\"><strong><span style=\"color: #008000;\">\u0410nswer:<\/span><\/strong><\/span><\/p>\n<pre>void QUEUE ::INSERT()\r\n{\r\nPASSENGERS * P = new PASSENGERS; \r\ncout&lt;&lt;\"Enter PID\"; \r\ncin&gt;&gt;P-&gt;PID; \r\ncout&lt;&lt;\"Enter Name\u201d; \r\ngets(p-&gt;Name);\r\nP-&gt;Next = NULL;\r\nif(Rear == NULL)\r\n{\r\nFront = Rear = P;\r\n}\r\nelse \r\n{\r\nRear-&gt;Next = P;\r\nRear = P;\r\n}\r\n}<\/pre>\n<p><span style=\"color: #eb4924;\"><strong>Question 4:<br \/>\n<\/strong><\/span>Write a function QDELETE( ) in C++ to perform delete operation in a Linked Queue, which contains Passenger number and Passenger name. Consider the following definition of node in the code. <strong>All India 2013<\/strong><\/p>\n<pre>struct node \r\n{\r\nlong int Pno; \r\nchar Pname[20]; \r\nnode *Link;\r\n};<\/pre>\n<p><span style=\"color: #eb4924;\"><strong><span style=\"color: #008000;\">\u0410nswer:<\/span><\/strong><\/span><\/p>\n<pre>void QDELETE()\r\n{\r\nif(Front == NULL) \r\n{\r\ncout&lt;&lt;\"Queue is empty\"; \r\nexit(0);\r\n}\r\nelse\r\n{\r\nnode *temp = front; \r\ncout&lt;&lt;\"Passenger Information\"; \r\ncout&lt;&lt;Front-&gt;Pno; \r\ncout&lt;&lt;Front-&gt;Pname;\r\nFront=Front-&gt;Link; \r\ndelete temp;\r\n}\r\n}<\/pre>\n<p><span style=\"color: #eb4924;\"><strong>Question 5:<br \/>\n<\/strong><\/span>Write a function QINSERT( ) in C++ to perform insert operation on a linked queue, which contains client number and client name. Consider the following definition of NODE in the code of QINSERT ( ). <strong>Delhi 2013<\/strong><\/p>\n<pre>struct NODE \r\n{\r\nlong int Cno;    \/\/Client number\r\nchar Cname[20];    \/\/Client name\r\nNODE *Next;\r\n};<\/pre>\n<p><span style=\"color: #eb4924;\"><strong><span style=\"color: #008000;\">\u0410nswer:<\/span><\/strong><\/span><\/p>\n<pre>void QINSERT()\r\n{\r\nNODE *P = new Node;\r\ncout&lt;&lt;\"Enter the Client Number and Name:\";\r\ncin&gt;&gt;P- Cno;\r\ngets(P-&gt;Cname) ;\r\nP-&gt;Next=NULL;\r\nif((front ~ NULL)&amp;&amp;(rear == NULL))\r\n{\r\nfront=rear=P;\r\n}\r\nelse\r\n{\r\nrear-&gt;Next = P; \r\nrear = P;\r\n}\r\n}<\/pre>\n<p><span style=\"color: #eb4924;\"><strong>Question 6:<br \/>\n<\/strong><\/span>Given the necessary declaration of linked implemented Queue containing players information (as defined in the following definition of Node). Also, write a user defined function in C++ to delete one Player\u2019s information from the Queue.<br \/>\n<strong>Delhi 2013C<\/strong><\/p>\n<pre>struct Node \r\n{\r\nint PlayerNo; \r\nchar PIayerName[20];\r\nNode *Link;\r\n};<\/pre>\n<p><span style=\"color: #eb4924;\"><strong><span style=\"color: #008000;\">\u0410nswer:<\/span><\/strong><\/span><\/p>\n<pre>void Delete_NODE()\r\n{\r\nNODE *P;\r\nif(front == Null)\r\ncout&lt;&lt;\u201dQueue is empty\";\r\nelse if(front == rear) \r\n{\r\nP = front;\r\ncout&lt;&lt;\"Deleted Node information is\"; \r\ncout&lt;&lt;P-&gt;PlayerNo; \r\nputs(p-&gt;PlayerName); \r\nfront = rear = NULL; \r\ndelete P;\r\n}\r\nelse\r\n{\r\nP = front;\r\ncout&lt;&lt;\"Deleted Node information is\"; \r\ncout&lt;&lt;P-&gt;PlayerNo; \r\nputs(P-&gt;PlayerName); \r\nfront = front-&gt;Link; \r\ndelete P;\r\n}\r\n}<\/pre>\n<p><span style=\"color: #eb4924;\"><strong>Question 7:<br \/>\n<\/strong><\/span>Write a function in C++ to perform insert operation in a dynamic queue containing DVD\u2019s information (represented with the help of an array of structure DVD). <strong>Delhi 2012<\/strong><\/p>\n<pre>struct DVD \r\n{\r\nlong No; \r\nchar title[20];\r\nDVD *Link;\r\n};<\/pre>\n<p><span style=\"color: #eb4924;\"><strong><span style=\"color: #008000;\">\u0410nswer:<\/span><\/strong><\/span><\/p>\n<pre>void Insert()\r\n{\r\nDVD *p = new DVD; \r\ncout&lt;&lt;\"Enter the DVD number and Title\";\r\ncin&lt;&lt;p-&gt;No; \r\ngets(p-&gt;title);\r\np-&gt;Link = NULL; \r\nif((front \u2014 NULL) &amp;&amp; (rear == NULL))\r\n{\r\nfront - rear = p;\r\n}\r\nelse\r\n{\r\nrear-&gt;Link = p; \r\nrear = p;\r\n}\r\n}<\/pre>\n<p><span style=\"color: #eb4924;\"><strong>Question 8:<br \/>\n<\/strong><\/span>Write a function in C++ to perform insert operation in a static circular queue containing book\u2019s information (represented with the help of an array of structure BOOK). <strong>All India 2012<\/strong><\/p>\n<pre>struct BOOK  \r\n{ \r\nlong AccNo; \/\/Book account number \r\nchar Title[20]; \/\/Book Title\r\n};<\/pre>\n<p><span style=\"color: #eb4924;\"><strong><span style=\"color: #008000;\">\u0410nswer:<\/span><\/strong><\/span><\/p>\n<pre>void circularQueInsert(BOOK B[], int Front, int Rear, int Max)\r\n{\r\nif((Rear=Max-l &amp;&amp; Front ==0)||(Front == Rear +1))\r\n{\r\ncout&lt;&lt;\"Circular Queue is full\"; \r\nexit(O);\r\n}\r\nelse if(Front == -1 &amp;&amp; Rear == -1)\r\n{\r\nFront = Rear = 0;\r\n}\r\nelse if(Rear = Max -1 &amp;&amp; Front &gt;0)\r\n{\r\nRear = 0;\r\n}\r\nelse\r\nRear = Rear+1; \r\ncout&lt;&lt;\"Enter book account number and title\"; \r\ncin&gt;&gt;B[Rear].AccNo; \r\ngets(B[Rear].Title);\r\n}<\/pre>\n<p><span style=\"color: #eb4924;\"><strong>Question 9:<br \/>\n<\/strong><\/span>Write a function in C++ to perform insert operation on a dynamically allocated queue containing passenger details as given in the following definition of NODE; <strong>Delhi 2011<\/strong><\/p>\n<pre>struct NODE \r\n{\r\nlong Pno; \/\/Passenger Number \r\nchar Pname[20]; \/\/Passenger Name \r\nNODE *Link;\r\n};<\/pre>\n<p><span style=\"color: #eb4924;\"><strong><span style=\"color: #008000;\">\u0410nswer:<\/span><\/strong><\/span><\/p>\n<pre>void Enter()\r\n{\r\nNODE *nptr=new NODE;\r\nnptr-&gt;Link = NULL;\r\ncout&lt;&lt;\"Enter name and number for new passenger\";\r\ngets(nptr-&gt;Pname); \r\ncin&gt;&gt;nptr-&gt;Pno; \r\nif(rear == NULL)\r\n{\r\nfront = rear = nptr;\r\n}\r\nelse\r\n{\r\nrear-&gt;Link = nptr; \r\nrear = nptr;\r\n}\r\n}<\/pre>\n<p><span style=\"color: #eb4924;\"><strong>Question 10:<br \/>\n<\/strong><\/span>Write a function in C++ to perform delete operation on a dynamically allocated queue containing passenger details as given in the following definition of NODE: <strong>All India 2011<\/strong><\/p>\n<pre>struct NODE \r\n{\r\nlong Mno; \/\/Member Number \r\nchar Mname[20]; \/\/Member Name \r\nNODE *Link;\r\n};<\/pre>\n<p><span style=\"color: #eb4924;\"><strong><span style=\"color: #008000;\">\u0410nswer:<\/span><\/strong><\/span><\/p>\n<pre>void remove(NODE *front)\r\n{\r\nNODE *nptr; \r\nif(front == NULL) \r\n{\r\ncout&lt;&lt;\"Queue is empty\";\r\n}\r\nelse \r\n{\r\nnptr = front; \r\nfront = front-&gt;Link; \r\nif(front == NULL) \r\nrear = NULL; \r\ndelete nptr;\r\n}<\/pre>\n<p><span style=\"color: #eb4924;\"><strong>Question 11:<br \/>\n<\/strong><\/span>Write a complete program in C++ to implement a dynamically allocated queue containing names of cities. <strong>All India 2010<br \/>\n<span style=\"color: #eb4924;\"><span style=\"color: #008000;\">\u0410nswer:<\/span><\/span><\/strong><\/p>\n<pre>#include&lt;iostream.h&gt;\r\n#include&lt;string.h&gt; \r\nstruct Node \r\n{\r\nchar city[30];\r\nNode *link;\r\n};\r\nclass queue \r\n{\r\nNode *front, *rear; \r\npublic:\r\nqueue() {front=rear=NULL;} \r\nvoid add_Q();    \/\/add queue\r\nvoid del_Q();    \/\/delete queue\r\nvoid show_Q();    \/\/show queue\r\n};\r\nvoid queue :: add_Q()\r\n{\r\nNode *temp = new Node; \r\nchar ct[30]; \r\ncout&lt;&lt;\"Enter city\"; \r\ngets(ct);\r\nstrcpy(temp-&gt;city,ct); \r\ntemp-&gt;link = NULL; \r\nif(rear == NULL)\r\nfront = rear = temp; \r\nelse\r\n{\r\nrear-&gt;link = temp; \r\nrear = temp;\r\n}\r\n}\r\nvoid queue :: del_Q()\r\n{\r\nNode *temp; \r\nchar ct[20]; \r\nif(front == NULL)\r\n{\r\ncout&lt;&lt;\u201dqueue is empty\";\r\n}\r\nelse   \r\n{\r\ntemp = front; \r\nfront = front-&gt;link; \r\nstrcpy(ct, temp-&gt;city); \r\ncout&lt;&lt;\"Deleted values are\"&lt;&lt;ct; \r\ndelete temp;\r\n}\r\nif(front == NULL)\r\nrear = front;\r\n}\r\nvoid queue :: show_Q()\r\n{\r\nNode *temp = front; \r\ncout&lt;&lt;\"The queue elements are\"; \r\nwhile(temp!=NULL)\r\n{\r\ncout&lt;&lt;\"\\n\"&lt;&lt;temp-&gt;city; \r\ntemp = temp-&gt;l ink;\r\n}\r\n}\r\nvoid main()\r\n{\r\nint choice; \r\nqueue QUEUE; \r\nchar opt='Y'; \r\ndo \r\n{\r\ncout&lt;&lt;\"\\nMain Menu\"; \r\ncout&lt;&lt;\"\\nl.Insertion in queue\"; \r\ncout&lt;&lt;\"\\n2.Deletion from queue\"; \r\ncout&lt;&lt;\"\\n3.Traversal of queue\"; \r\ncout&lt;&lt;\"\\n4.Exit from queue\"; \r\ncout&lt;&lt;\"\\nEnter your choice from above(1,2,3,4)\"; \r\ncin&lt;&lt;choice; \r\nswitch(choice)\r\n{\r\ncase 1: \r\ndo \r\n{\r\nQUEUE.add_Q(); \r\ncout&lt;&lt;\"\\ndo you want to add more elements&lt;Y\/N&gt;?\"; \r\ncin&gt;&gt;opt;\r\n}\r\nwhile(toupper(opt)=='Y'); \r\nbreak; \r\ncase 2: \r\ndo \r\n{\r\nQUEUE.del_Q(); \r\ncout&lt;&lt;\"\\ndo you want to delete more elements&lt;Y\/N&gt;?\";\r\ncin&gt;&gt;opt;\r\n}\r\nwhi1e(toupper(opt)== 'Y'); \r\nbreak; \r\ncase 3:\r\nQUEUE.show_Q(); \r\nbreak; \r\ncase 4; \r\nexit(0);\r\n}\r\n}\r\nwhile(choice!=4);\r\n}<\/pre>\n<p><span style=\"color: #eb4924;\"><strong>Question 12:<br \/>\n<\/strong><\/span>Write a function QUEINS( ) in C++ to insert an element in a dynamically allocated queue containing nodes of the following given structure: <strong>Delhi 2009<\/strong><\/p>\n<pre>struct Node\r\n{\r\nint Pid;     \/\/Product Id\r\nchar Pname[20];   \/\/Product Name \r\nNode *Next; \r\n};<\/pre>\n<p><span style=\"color: #eb4924;\"><strong><span style=\"color: #008000;\">\u0410nswer:<\/span><\/strong><\/span><\/p>\n<pre>void QUEINS(Node *rear, int val, char valid)\r\n{\r\nNode *temp=new Node; \r\ntemp-&gt;Pid = val; \r\nstrcpy(temp-&gt;Pname,val1); \r\ntemp-&gt;Next = NULL; \r\nif(rear == NULL)\r\nrear = front = temp; \r\nelse\r\n{\r\nrear-&gt;Next = temp; \r\nrear = temp;\r\n}\r\n}<\/pre>\n<p><span style=\"color: #eb4924;\"><strong>Question 13:<br \/>\n<\/strong><\/span>Write a function QUEDEL( ) in C++ to display and delete an element in a dynamically allocated queue containing nodes of the following given structure: <strong>All India 2009<\/strong><\/p>\n<pre>struct Node \r\n{\r\nint Itemno; \r\nchar Itemname[30];\r\nNode *Link;\r\n};<\/pre>\n<p><span style=\"color: #eb4924;\"><strong><span style=\"color: #008000;\">\u0410nswer:<\/span><\/strong><\/span><\/p>\n<pre>void QUEDEL(Node *front)\r\n{\r\nNode *temp; \r\nif(front == NULL)\r\ncout&lt;&lt;\"Queue is Empty\"; \r\nelse\r\n{\r\ntemp = front; \r\ncout&lt;&lt;\"deleted item=\"; \r\ncout&lt;&lt;front-&gt;Itemno; \r\ncout&lt;&lt;front-&gt;Itemname; \r\nfront = front-&gt;Link; \r\nif(front == NULL) \r\nrear = NULL; \r\ndelete temp;\r\n}\r\n}<\/pre>\n","protected":false},"excerpt":{"rendered":"<p>Important Questions for Class 12 Computer Science (C++) \u2013 Linked List, Stack and Queue Topic \u2013 1 Linked List and [&hellip;]<\/p>\n","protected":false},"author":7,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_yoast_wpseo_focuskw":"Computer science important questions","_yoast_wpseo_title":"","_yoast_wpseo_metadesc":"\"Get Important Questions for Class 12 Computer Science (C++) \u2013 Linked List, Stack and Queue on Infinity Learn.\"","custom_permalink":"important-questions\/class12\/computer-science\/important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue\/"},"categories":[106,93],"tags":[],"table_tags":[],"acf":[],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v17.9 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>Important Questions for Class 12 Computer Science (C++) \u2013 Linked List, Stack and Queue - Infinity Learn by Sri Chaitanya<\/title>\n<meta name=\"description\" content=\"&quot;Get Important Questions for Class 12 Computer Science (C++) \u2013 Linked List, Stack and Queue on Infinity Learn.&quot;\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/infinitylearn.com\/surge\/important-questions\/class12\/computer-science\/important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Important Questions for Class 12 Computer Science (C++) \u2013 Linked List, Stack and Queue - Infinity Learn by Sri Chaitanya\" \/>\n<meta property=\"og:description\" content=\"&quot;Get Important Questions for Class 12 Computer Science (C++) \u2013 Linked List, Stack and Queue on Infinity Learn.&quot;\" \/>\n<meta property=\"og:url\" content=\"https:\/\/infinitylearn.com\/surge\/important-questions\/class12\/computer-science\/important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue\/\" \/>\n<meta property=\"og:site_name\" content=\"Infinity Learn by Sri Chaitanya\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/InfinityLearn.SriChaitanya\/\" \/>\n<meta property=\"article:published_time\" content=\"2022-02-13T17:45:04+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2024-01-16T08:56:24+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/infinitylearn.com\/surge\/wp-content\/uploads\/2021\/12\/24499330477_b3652cd539_o.png\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:creator\" content=\"@InfinityLearn_\" \/>\n<meta name=\"twitter:site\" content=\"@InfinityLearn_\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Prasad Gupta\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"12 minutes\" \/>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Important Questions for Class 12 Computer Science (C++) \u2013 Linked List, Stack and Queue - Infinity Learn by Sri Chaitanya","description":"\"Get Important Questions for Class 12 Computer Science (C++) \u2013 Linked List, Stack and Queue on Infinity Learn.\"","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:\/\/infinitylearn.com\/surge\/important-questions\/class12\/computer-science\/important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue\/","og_locale":"en_US","og_type":"article","og_title":"Important Questions for Class 12 Computer Science (C++) \u2013 Linked List, Stack and Queue - Infinity Learn by Sri Chaitanya","og_description":"\"Get Important Questions for Class 12 Computer Science (C++) \u2013 Linked List, Stack and Queue on Infinity Learn.\"","og_url":"https:\/\/infinitylearn.com\/surge\/important-questions\/class12\/computer-science\/important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue\/","og_site_name":"Infinity Learn by Sri Chaitanya","article_publisher":"https:\/\/www.facebook.com\/InfinityLearn.SriChaitanya\/","article_published_time":"2022-02-13T17:45:04+00:00","article_modified_time":"2024-01-16T08:56:24+00:00","og_image":[{"url":"https:\/\/infinitylearn.com\/surge\/wp-content\/uploads\/2021\/12\/24499330477_b3652cd539_o.png"}],"twitter_card":"summary_large_image","twitter_creator":"@InfinityLearn_","twitter_site":"@InfinityLearn_","twitter_misc":{"Written by":"Prasad Gupta","Est. reading time":"12 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Organization","@id":"https:\/\/infinitylearn.com\/surge\/#organization","name":"Infinity Learn","url":"https:\/\/infinitylearn.com\/surge\/","sameAs":["https:\/\/www.facebook.com\/InfinityLearn.SriChaitanya\/","https:\/\/www.instagram.com\/infinitylearn_by_srichaitanya\/","https:\/\/www.linkedin.com\/company\/infinity-learn-by-sri-chaitanya\/","https:\/\/www.youtube.com\/c\/InfinityLearnEdu","https:\/\/twitter.com\/InfinityLearn_"],"logo":{"@type":"ImageObject","@id":"https:\/\/infinitylearn.com\/surge\/#logo","inLanguage":"en-US","url":"","contentUrl":"","caption":"Infinity Learn"},"image":{"@id":"https:\/\/infinitylearn.com\/surge\/#logo"}},{"@type":"WebSite","@id":"https:\/\/infinitylearn.com\/surge\/#website","url":"https:\/\/infinitylearn.com\/surge\/","name":"Infinity Learn by Sri Chaitanya","description":"Surge","publisher":{"@id":"https:\/\/infinitylearn.com\/surge\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/infinitylearn.com\/surge\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"en-US"},{"@type":"ImageObject","@id":"https:\/\/infinitylearn.com\/surge\/important-questions\/class12\/computer-science\/important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue\/#primaryimage","inLanguage":"en-US","url":"https:\/\/infinitylearn.com\/surge\/wp-content\/uploads\/2021\/12\/24499330477_b3652cd539_o.png?v=1642486141","contentUrl":"https:\/\/infinitylearn.com\/surge\/wp-content\/uploads\/2021\/12\/24499330477_b3652cd539_o.png?v=1642486141","width":344,"height":388},{"@type":"WebPage","@id":"https:\/\/infinitylearn.com\/surge\/important-questions\/class12\/computer-science\/important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue\/#webpage","url":"https:\/\/infinitylearn.com\/surge\/important-questions\/class12\/computer-science\/important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue\/","name":"Important Questions for Class 12 Computer Science (C++) \u2013 Linked List, Stack and Queue - Infinity Learn by Sri Chaitanya","isPartOf":{"@id":"https:\/\/infinitylearn.com\/surge\/#website"},"primaryImageOfPage":{"@id":"https:\/\/infinitylearn.com\/surge\/important-questions\/class12\/computer-science\/important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue\/#primaryimage"},"datePublished":"2022-02-13T17:45:04+00:00","dateModified":"2024-01-16T08:56:24+00:00","description":"\"Get Important Questions for Class 12 Computer Science (C++) \u2013 Linked List, Stack and Queue on Infinity Learn.\"","breadcrumb":{"@id":"https:\/\/infinitylearn.com\/surge\/important-questions\/class12\/computer-science\/important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/infinitylearn.com\/surge\/important-questions\/class12\/computer-science\/important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/infinitylearn.com\/surge\/important-questions\/class12\/computer-science\/important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/infinitylearn.com\/surge\/"},{"@type":"ListItem","position":2,"name":"Important Questions for Class 12 Computer Science (C++) \u2013 Linked List, Stack and Queue"}]},{"@type":"Article","@id":"https:\/\/infinitylearn.com\/surge\/important-questions\/class12\/computer-science\/important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue\/#article","isPartOf":{"@id":"https:\/\/infinitylearn.com\/surge\/important-questions\/class12\/computer-science\/important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue\/#webpage"},"author":{"@id":"https:\/\/infinitylearn.com\/surge\/#\/schema\/person\/143c89c9c2f5e56ed91f96dde47b0b05"},"headline":"Important Questions for Class 12 Computer Science (C++) \u2013 Linked List, Stack and Queue","datePublished":"2022-02-13T17:45:04+00:00","dateModified":"2024-01-16T08:56:24+00:00","mainEntityOfPage":{"@id":"https:\/\/infinitylearn.com\/surge\/important-questions\/class12\/computer-science\/important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue\/#webpage"},"wordCount":1074,"publisher":{"@id":"https:\/\/infinitylearn.com\/surge\/#organization"},"image":{"@id":"https:\/\/infinitylearn.com\/surge\/important-questions\/class12\/computer-science\/important-questions-for-class-12-computer-science-c-linked-list-stack-and-queue\/#primaryimage"},"thumbnailUrl":"https:\/\/infinitylearn.com\/surge\/wp-content\/uploads\/2021\/12\/24499330477_b3652cd539_o.png","articleSection":["Class 12","Important Questions"],"inLanguage":"en-US"},{"@type":"Person","@id":"https:\/\/infinitylearn.com\/surge\/#\/schema\/person\/143c89c9c2f5e56ed91f96dde47b0b05","name":"Prasad Gupta","image":{"@type":"ImageObject","@id":"https:\/\/infinitylearn.com\/surge\/#personlogo","inLanguage":"en-US","url":"https:\/\/secure.gravatar.com\/avatar\/200104b443e586c76c46cadc113d931c?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/200104b443e586c76c46cadc113d931c?s=96&d=mm&r=g","caption":"Prasad Gupta"},"url":"https:\/\/infinitylearn.com\/surge\/author\/prasad\/"}]}},"_links":{"self":[{"href":"https:\/\/infinitylearn.com\/surge\/wp-json\/wp\/v2\/posts\/25560"}],"collection":[{"href":"https:\/\/infinitylearn.com\/surge\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/infinitylearn.com\/surge\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/infinitylearn.com\/surge\/wp-json\/wp\/v2\/users\/7"}],"replies":[{"embeddable":true,"href":"https:\/\/infinitylearn.com\/surge\/wp-json\/wp\/v2\/comments?post=25560"}],"version-history":[{"count":0,"href":"https:\/\/infinitylearn.com\/surge\/wp-json\/wp\/v2\/posts\/25560\/revisions"}],"wp:attachment":[{"href":"https:\/\/infinitylearn.com\/surge\/wp-json\/wp\/v2\/media?parent=25560"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/infinitylearn.com\/surge\/wp-json\/wp\/v2\/categories?post=25560"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/infinitylearn.com\/surge\/wp-json\/wp\/v2\/tags?post=25560"},{"taxonomy":"table_tags","embeddable":true,"href":"https:\/\/infinitylearn.com\/surge\/wp-json\/wp\/v2\/table_tags?post=25560"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}