{"id":9711,"date":"2022-09-14T11:59:23","date_gmt":"2022-09-14T11:59:23","guid":{"rendered":"https:\/\/www.prepbytes.com\/blog\/?p=9711"},"modified":"2022-10-03T03:30:04","modified_gmt":"2022-10-03T03:30:04","slug":"capgemini-pseudocode-questions-set-2","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/capgemini-pseudocode-questions-set-2\/","title":{"rendered":"Capgemini Pseudocode Questions | Set 2"},"content":{"rendered":"<p><img decoding=\"async\" src=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1663156717455-Capgemini%20Pseudocode%20_Set%202.jpg\" alt=\"\" \/><\/p>\n<p>Capgemini <a href=\"https:\/\/prepbytes.com\/blog\/company-placement-process\/capgemini-exam-pattern-syllabus-selection-process-placement-guides\/\" title=\"Pseudocode\">Pseudocode<\/a> Questions are available below on this page. Pseudo Code is a normal representation of algorithm code in C, C++, or any other language. In the Pseudo Code round, there will be a total of 30 questions that we need to answer within 30 minutes. The Difficulty level of the paper goes from Moderate to High. Pseudo-Code is not machine-readable code; it is just as same as algorithms written in coding format. <\/p>\n<h3>What will be the pattern of the pseudo-code round of Capgemini?<\/h3>\n<p>Capgemini pseudo code round is a 30-minute round and you get 30 questions in this round. The questions will be asked from C( input-output), C++, OPPs, and DSA.<br \/>\nThe topics from DSA which are asked:<\/p>\n<ul>\n<li>Array<\/li>\n<li>Time Complexity<\/li>\n<li>Trees<\/li>\n<li>Linked list<\/li>\n<li>Hashing, etc.<\/li>\n<\/ul>\n<h3>Capgemini Pseudocode Questions<\/h3>\n<p><strong>1. What will be the output of the following pseudocode for a = 9, b = 7?<\/strong><br \/>\nInteger funn(Integer a, Integer b)<br \/>\nInteger c<br \/>\nSet c = 2<br \/>\nb = b mod c<br \/>\na = a mod c<br \/>\nreturn a + b<br \/>\nEnd function funn()<\/p>\n<ul>\n<li>2<\/li>\n<li>5<\/li>\n<li>-5<\/li>\n<li>17<\/li>\n<\/ul>\n<p><strong>Answer: 2<\/strong><\/p>\n<p><strong>2. What will be the output of the following pseudocode?<\/strong><br \/>\nInteger a, b, c<br \/>\nSet a = 8, b = 6,c = 4<br \/>\nIf(a &gt; b)<br \/>\na = b<br \/>\nElse<br \/>\nb = a<br \/>\nEnd If<br \/>\nIf(c&gt; b)<br \/>\nc = b<br \/>\nElse<br \/>\nb = c<br \/>\nEnd If<br \/>\nPrint a + b + c<\/p>\n<ul>\n<li>13<\/li>\n<li>14<\/li>\n<li>17<\/li>\n<li>23<\/li>\n<\/ul>\n<p><strong>Answer: 14<\/strong><\/p>\n<p><strong>3. What will be the output of the following pseudocode?<\/strong><br \/>\nInteger a, b, c<br \/>\nSet a = 1, b = 1, c = 7<br \/>\na = a + b<br \/>\nif(a + b)<br \/>\nif(b + (c ^ a))<br \/>\na = 2<br \/>\nb = a<br \/>\nEnd if<br \/>\nEnd if<br \/>\nPrint a + b + c<\/p>\n<ul>\n<li>6<\/li>\n<li>11<\/li>\n<li>22<\/li>\n<li>12<\/li>\n<\/ul>\n<p><strong>Answer: 11<\/strong><\/p>\n<p><strong>4. What will be the output of the following pseudocode?<\/strong><br \/>\nInteger p, q, r, s<br \/>\nSet p=1, q = 1<br \/>\nfor (each r from 0 to 2 )<br \/>\nfor (each s from -4 to -2 )<br \/>\np = p + 2if(p &gt; r)<br \/>\nContinue<br \/>\nEnd if<br \/>\np = 1if(p &gt; s)<br \/>\nJump out of the loop<br \/>\nEnd if<br \/>\nEnd for<br \/>\nEnd for<br \/>\nPrint p + q<\/p>\n<ul>\n<li>35<\/li>\n<li>13<\/li>\n<li>24<\/li>\n<li>20<\/li>\n<\/ul>\n<p><strong>Answer: 20<\/strong><\/p>\n<p><strong>5. What will be the output of the following pseudocode for input a = 30, b = 60, and C = 90?<\/strong><br \/>\nInteger a, b, c, sum<br \/>\nRead a, b, c<br \/>\nSet sum = a + b + c<br \/>\nif ((sum EQUALS 180) and (a NOT EQUALS 0) and (b NOT EQUALS 0) and (c NOT EQUALS 0))<br \/>\nPrint &quot; Success&quot;<br \/>\nOtherwise<br \/>\nPrint &quot;Fail&quot;<br \/>\nEnd if<\/p>\n<ul>\n<li>Success<\/li>\n<li>Fail<\/li>\n<li>Error<\/li>\n<li>None of the above<\/li>\n<\/ul>\n<p><strong>Answer: Success<\/strong><\/p>\n<p><strong>6. What will be the output of the following pseudocode for a =1, b =2?<\/strong><\/p>\n<p>Integer funn(Integer a, Integer b )<br \/>\nif(a&lt;3 &amp;&amp; b&lt;4)<br \/>\nreturn funn( a +1, b + 1)<br \/>\nElse<br \/>\nReturn a + b<br \/>\nEnd if<br \/>\nEnd function funn()<\/p>\n<ul>\n<li>7<\/li>\n<li>-7<\/li>\n<li>8<\/li>\n<li>19<\/li>\n<\/ul>\n<p><strong>Answer: 7<\/strong><\/p>\n<p><strong>7. What will be the output of the following pseudocode for a = 2, b = 6?<\/strong><br \/>\nInteger funn(Integer a, Integer b<br \/>\nIf(a &gt; 0)<br \/>\nIf(b &gt; 0)<br \/>\nReturn a + b + funn(a + 1, 0) + funn(a + 2, 0) + funn(a + 3, 0)<br \/>\nEnd If<br \/>\nEnd If<br \/>\nReturn a + b<br \/>\nEnd Function funn() <\/p>\n<ul>\n<li>21<\/li>\n<li>20<\/li>\n<li>17<\/li>\n<li>37<\/li>\n<\/ul>\n<p><strong>Answer: 20<\/strong><\/p>\n<p><strong>8. What will be the output of the following pseudocode for a = 4, b = 6?<\/strong><br \/>\nInteger funn(Integer a, Integer b)<br \/>\nIf(a &gt; 2)<br \/>\nIf(b &gt; 2)<br \/>\nReturn a + b + funn(a + 1, b &#8211; 5)<br \/>\nEnd If<br \/>\nEnd If<br \/>\nReturn a &#8211; b<br \/>\nEnd function funn()<\/p>\n<ul>\n<li>12<\/li>\n<li>14<\/li>\n<li>17<\/li>\n<li>22<\/li>\n<\/ul>\n<p><strong>Answer: 14<\/strong><\/p>\n<p><strong>9. What will be the output of the following pseudo-code:<\/strong><br \/>\nInteger p, q, r<br \/>\nSet p= 3, q =1, r = 2<br \/>\nIf(p+ (2&amp;2&amp;2) &amp;&amp; q + (3&amp;3&amp;3) &amp;&amp; r + (2^2^2))<br \/>\np = p &#8211; 2<br \/>\nq = p<br \/>\nElse<br \/>\np = r<br \/>\nq = q<sup>2<\/sup><br \/>\nEnd If<br \/>\nPrint p+ q+ r<\/p>\n<ul>\n<li>8<\/li>\n<li>4<\/li>\n<li>-8<\/li>\n<li>16<\/li>\n<\/ul>\n<p><strong>Answer: 4<\/strong><\/p>\n<p><strong>10. What will be the output of the following pseudocode?<\/strong><br \/>\nInteger p, q, r<br \/>\nSet p = 0, q = 4, r = 3<br \/>\nIf(p || r)<br \/>\nIf(p &amp;&amp; r)<br \/>\np = p &amp;r<br \/>\nEnd If<br \/>\np = p<sup>r<\/sup><br \/>\nEnd If<br \/>\nPrint p + q + r<\/p>\n<ul>\n<li>7<\/li>\n<li>10<\/li>\n<li>20<\/li>\n<li>12<\/li>\n<\/ul>\n<p><strong>Answer: 10<\/strong><\/p>\n<p><strong>11. What will be the output of the following pseudocode for a = 4 and b = 9?<\/strong><\/p>\n<p>Integer funn(Integer a, Integer b)<br \/>\nIf(a &lt; b)<br \/>\nReturn 1 + funn(a, b &#8211; 2)<br \/>\nEnd If<br \/>\nIf(a^b &gt; a&amp;b)<br \/>\nReturn a ^ b<br \/>\nElse<br \/>\nReturn a &amp; b<br \/>\nEnd If<br \/>\nReturn 1<br \/>\nEnd function funn()<\/p>\n<ul>\n<li>10<\/li>\n<li>-8<\/li>\n<li>14<\/li>\n<li>24<\/li>\n<\/ul>\n<p><strong>Answer: 10<\/strong><\/p>\n<p><strong>12. What will be the output of the following pseudocode for a = 4, b = 6?<\/strong><br \/>\nInteger funn(Integer a, Integer b)<br \/>\nIf(a &gt; 1)<br \/>\nReturn a * funn (b &#8211; 6, a &#8211; 4)<br \/>\nElse<br \/>\nReturn 1<br \/>\nEnd If<br \/>\nReturn a + b<br \/>\nEnd function funn()<\/p>\n<ul>\n<li>0<\/li>\n<li>17<\/li>\n<li>4<\/li>\n<li>7<\/li>\n<\/ul>\n<p><strong>Answer: 4<\/strong><\/p>\n<p><strong>13. What will be the output of the following pseudocode?<\/strong><br \/>\nInteger p, q, r<br \/>\nSet q = 30, p = 10, r = 20<br \/>\nIf (r &gt; (r + p))<br \/>\nq = 1<br \/>\nElse<br \/>\np = p &#8211; 2<br \/>\nr = r &#8211; 2<br \/>\nEnd If<br \/>\nIf (r &gt; (q + p) || 1)<br \/>\nq = (0 ^ 5)<br \/>\nElse<br \/>\np = p + 2<br \/>\nr = p + 2<br \/>\nEnd If<br \/>\nPrint p + q + r<\/p>\n<ul>\n<li>31<\/li>\n<li>20<\/li>\n<li>30<\/li>\n<li>40<\/li>\n<\/ul>\n<p><strong>Answer: 31<\/strong><\/p>\n<p><strong>14. What will be the output of the following pseudocode?<\/strong><br \/>\nInteger count<br \/>\nFor (each count from 0 to 9)<br \/>\nPrint &quot;#&quot;<br \/>\nIf (count &gt; 6)<br \/>\nCONTINUE<br \/>\nPrint count<br \/>\nEnd For<\/p>\n<ul>\n<li>0#1#2#3#4#5#6#7#8#9#10<\/li>\n<li>0#1#2#3#4#5#6###<\/li>\n<li>&#8216;#0#1#2#3#4#5##7#8#9#10<\/li>\n<li>&#8216;#0#1#2#3#4#5#<\/li>\n<\/ul>\n<p><strong>Answer: #0#1#2#3#4#5#<\/strong><\/p>\n<p><strong>15. What will be the output of the following pseudo-code:<\/strong><br \/>\nInteger m<br \/>\nSet m = 0<br \/>\nInteger p[5] = {1, 1, 0, 1, 7}<br \/>\nIf (p[0] &amp;&amp; P[4])<br \/>\nm = p[1]<br \/>\nEnd If<br \/>\nIf (p[2] &amp;&amp; p[3])<br \/>\nm = p[2]<br \/>\nEnd If<br \/>\nPrint m<\/p>\n<ul>\n<li>1<\/li>\n<li>-5<\/li>\n<li>4<\/li>\n<li>18<\/li>\n<\/ul>\n<p><strong>Answer: 1<\/strong><\/p>\n<h3>Capgemini Pseudocode Questions FAQs<\/h3>\n<p><strong>1. What is a Pseudocode test?<\/strong><br \/>\nPseudocode is another round in the Infosys hiring process. There are a total of 30 questions and you have 30 minutes to complete the test. It is an MCQ question round where you have to predict the output of the code written in the pseudo-code format.<\/p>\n<p><strong>2. Pseudocode is mainly written in which programming language?<\/strong><br \/>\nPseudo-Codes are the language-free representation of the algorithm that explains the more coded format of the algorithm but not the complete representation of the code in any specific language.<\/p>\n<p><strong>3. How many Questions are there in Capgemini Pseudocode MCQs?<\/strong><br \/>\nThere are 30 questions that need to be solved within 30 mins.<\/p>\n<p><strong>4. What is the syllabus for Capgemini pseudocode round questions and Capgemini pseudocode questions and answers?<\/strong><br \/>\nThere is no such Syllabus for Capgemini pseudocode questions and answers but from what we have observed it has basic C input-output questions and a basic C Syllabus that was there first and we have given chapter-wise questions above please check them Capgemini Pseudocode Round Questions.<\/p>\n<p>This article tried to discuss the Capgemini Pseudocode Questions. I hope this blog helps you understand and solve the problem. To practice more problems you can check out <a href=\"#\" title=\"\"><\/a> at <a href=\"https:\/\/www.prepbytes.com\/\" title=\"Prepbytes\">Prepbytes<\/a>.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Capgemini Pseudocode Questions are available below on this page. Pseudo Code is a normal representation of algorithm code in C, C++, or any other language. In the Pseudo Code round, there will be a total of 30 questions that we need to answer within 30 minutes. The Difficulty level of the paper goes from Moderate [&hellip;]<\/p>\n","protected":false},"author":52,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"footnotes":""},"categories":[155],"tags":[],"class_list":["post-9711","post","type-post","status-publish","format-standard","hentry","category-company-placement-process"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v25.8 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>Capgemini Pseudocode Questions | Set 2 | Company Placement Process<\/title>\n<meta name=\"description\" content=\"Capgemini Pseudocode Questions are available below on this page. Pseudo Code is a normal representation of algorithm code in C, C++, or any other language.\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/prepbytes.com\/blog\/capgemini-pseudocode-questions-set-2\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Capgemini Pseudocode Questions | Set 2 | Company Placement Process\" \/>\n<meta property=\"og:description\" content=\"Capgemini Pseudocode Questions are available below on this page. Pseudo Code is a normal representation of algorithm code in C, C++, or any other language.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/prepbytes.com\/blog\/capgemini-pseudocode-questions-set-2\/\" \/>\n<meta property=\"og:site_name\" content=\"PrepBytes Blog\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/prepbytes0211\/\" \/>\n<meta property=\"article:published_time\" content=\"2022-09-14T11:59:23+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2022-10-03T03:30:04+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1663156717455-Capgemini%20Pseudocode%20_Set%202.jpg\" \/>\n<meta name=\"author\" content=\"Prepbytes\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Prepbytes\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"5 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/prepbytes.com\/blog\/capgemini-pseudocode-questions-set-2\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/capgemini-pseudocode-questions-set-2\/\"},\"author\":{\"name\":\"Prepbytes\",\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/person\/3f7dc4ae851791d5947a7f99df363d5e\"},\"headline\":\"Capgemini Pseudocode Questions | Set 2\",\"datePublished\":\"2022-09-14T11:59:23+00:00\",\"dateModified\":\"2022-10-03T03:30:04+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/capgemini-pseudocode-questions-set-2\/\"},\"wordCount\":995,\"commentCount\":0,\"publisher\":{\"@id\":\"http:\/\/43.205.93.38\/#organization\"},\"image\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/capgemini-pseudocode-questions-set-2\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1663156717455-Capgemini%20Pseudocode%20_Set%202.jpg\",\"articleSection\":[\"Company Placement Process\"],\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/prepbytes.com\/blog\/capgemini-pseudocode-questions-set-2\/#respond\"]}]},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/prepbytes.com\/blog\/capgemini-pseudocode-questions-set-2\/\",\"url\":\"https:\/\/prepbytes.com\/blog\/capgemini-pseudocode-questions-set-2\/\",\"name\":\"Capgemini Pseudocode Questions | Set 2 | Company Placement Process\",\"isPartOf\":{\"@id\":\"http:\/\/43.205.93.38\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/capgemini-pseudocode-questions-set-2\/#primaryimage\"},\"image\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/capgemini-pseudocode-questions-set-2\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1663156717455-Capgemini%20Pseudocode%20_Set%202.jpg\",\"datePublished\":\"2022-09-14T11:59:23+00:00\",\"dateModified\":\"2022-10-03T03:30:04+00:00\",\"description\":\"Capgemini Pseudocode Questions are available below on this page. Pseudo Code is a normal representation of algorithm code in C, C++, or any other language.\",\"breadcrumb\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/capgemini-pseudocode-questions-set-2\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/prepbytes.com\/blog\/capgemini-pseudocode-questions-set-2\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/prepbytes.com\/blog\/capgemini-pseudocode-questions-set-2\/#primaryimage\",\"url\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1663156717455-Capgemini%20Pseudocode%20_Set%202.jpg\",\"contentUrl\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1663156717455-Capgemini%20Pseudocode%20_Set%202.jpg\"},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/prepbytes.com\/blog\/capgemini-pseudocode-questions-set-2\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"http:\/\/43.205.93.38\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Company Placement Process\",\"item\":\"https:\/\/prepbytes.com\/blog\/category\/company-placement-process\/\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"Capgemini Pseudocode Questions | Set 2\"}]},{\"@type\":\"WebSite\",\"@id\":\"http:\/\/43.205.93.38\/#website\",\"url\":\"http:\/\/43.205.93.38\/\",\"name\":\"PrepBytes Blog\",\"description\":\"ONE-STOP RESOURCE FOR EVERYTHING RELATED TO CODING\",\"publisher\":{\"@id\":\"http:\/\/43.205.93.38\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"http:\/\/43.205.93.38\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"http:\/\/43.205.93.38\/#organization\",\"name\":\"Prepbytes\",\"url\":\"http:\/\/43.205.93.38\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/blog.prepbytes.com\/wp-content\/uploads\/2025\/07\/uzxxllgloialmn9mhwfe.webp\",\"contentUrl\":\"https:\/\/blog.prepbytes.com\/wp-content\/uploads\/2025\/07\/uzxxllgloialmn9mhwfe.webp\",\"width\":160,\"height\":160,\"caption\":\"Prepbytes\"},\"image\":{\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/logo\/image\/\"},\"sameAs\":[\"https:\/\/www.facebook.com\/prepbytes0211\/\",\"https:\/\/www.instagram.com\/prepbytes\/\",\"https:\/\/www.linkedin.com\/company\/prepbytes\/\",\"https:\/\/www.youtube.com\/channel\/UC0xGnHDrjUM1pDEK2Ka5imA\"]},{\"@type\":\"Person\",\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/person\/3f7dc4ae851791d5947a7f99df363d5e\",\"name\":\"Prepbytes\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/232042cd1a1ea0e982c96d2a2ec93fb70a8e864e00784491231e7bfe5a9e06b5?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/232042cd1a1ea0e982c96d2a2ec93fb70a8e864e00784491231e7bfe5a9e06b5?s=96&d=mm&r=g\",\"caption\":\"Prepbytes\"},\"url\":\"https:\/\/prepbytes.com\/blog\/author\/gourav-jaincollegedekho-com\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Capgemini Pseudocode Questions | Set 2 | Company Placement Process","description":"Capgemini Pseudocode Questions are available below on this page. Pseudo Code is a normal representation of algorithm code in C, C++, or any other language.","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:\/\/prepbytes.com\/blog\/capgemini-pseudocode-questions-set-2\/","og_locale":"en_US","og_type":"article","og_title":"Capgemini Pseudocode Questions | Set 2 | Company Placement Process","og_description":"Capgemini Pseudocode Questions are available below on this page. Pseudo Code is a normal representation of algorithm code in C, C++, or any other language.","og_url":"https:\/\/prepbytes.com\/blog\/capgemini-pseudocode-questions-set-2\/","og_site_name":"PrepBytes Blog","article_publisher":"https:\/\/www.facebook.com\/prepbytes0211\/","article_published_time":"2022-09-14T11:59:23+00:00","article_modified_time":"2022-10-03T03:30:04+00:00","og_image":[{"url":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1663156717455-Capgemini%20Pseudocode%20_Set%202.jpg","type":"","width":"","height":""}],"author":"Prepbytes","twitter_card":"summary_large_image","twitter_misc":{"Written by":"Prepbytes","Est. reading time":"5 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/prepbytes.com\/blog\/capgemini-pseudocode-questions-set-2\/#article","isPartOf":{"@id":"https:\/\/prepbytes.com\/blog\/capgemini-pseudocode-questions-set-2\/"},"author":{"name":"Prepbytes","@id":"http:\/\/43.205.93.38\/#\/schema\/person\/3f7dc4ae851791d5947a7f99df363d5e"},"headline":"Capgemini Pseudocode Questions | Set 2","datePublished":"2022-09-14T11:59:23+00:00","dateModified":"2022-10-03T03:30:04+00:00","mainEntityOfPage":{"@id":"https:\/\/prepbytes.com\/blog\/capgemini-pseudocode-questions-set-2\/"},"wordCount":995,"commentCount":0,"publisher":{"@id":"http:\/\/43.205.93.38\/#organization"},"image":{"@id":"https:\/\/prepbytes.com\/blog\/capgemini-pseudocode-questions-set-2\/#primaryimage"},"thumbnailUrl":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1663156717455-Capgemini%20Pseudocode%20_Set%202.jpg","articleSection":["Company Placement Process"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/prepbytes.com\/blog\/capgemini-pseudocode-questions-set-2\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/prepbytes.com\/blog\/capgemini-pseudocode-questions-set-2\/","url":"https:\/\/prepbytes.com\/blog\/capgemini-pseudocode-questions-set-2\/","name":"Capgemini Pseudocode Questions | Set 2 | Company Placement Process","isPartOf":{"@id":"http:\/\/43.205.93.38\/#website"},"primaryImageOfPage":{"@id":"https:\/\/prepbytes.com\/blog\/capgemini-pseudocode-questions-set-2\/#primaryimage"},"image":{"@id":"https:\/\/prepbytes.com\/blog\/capgemini-pseudocode-questions-set-2\/#primaryimage"},"thumbnailUrl":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1663156717455-Capgemini%20Pseudocode%20_Set%202.jpg","datePublished":"2022-09-14T11:59:23+00:00","dateModified":"2022-10-03T03:30:04+00:00","description":"Capgemini Pseudocode Questions are available below on this page. Pseudo Code is a normal representation of algorithm code in C, C++, or any other language.","breadcrumb":{"@id":"https:\/\/prepbytes.com\/blog\/capgemini-pseudocode-questions-set-2\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/prepbytes.com\/blog\/capgemini-pseudocode-questions-set-2\/"]}]},{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/prepbytes.com\/blog\/capgemini-pseudocode-questions-set-2\/#primaryimage","url":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1663156717455-Capgemini%20Pseudocode%20_Set%202.jpg","contentUrl":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1663156717455-Capgemini%20Pseudocode%20_Set%202.jpg"},{"@type":"BreadcrumbList","@id":"https:\/\/prepbytes.com\/blog\/capgemini-pseudocode-questions-set-2\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"http:\/\/43.205.93.38\/"},{"@type":"ListItem","position":2,"name":"Company Placement Process","item":"https:\/\/prepbytes.com\/blog\/category\/company-placement-process\/"},{"@type":"ListItem","position":3,"name":"Capgemini Pseudocode Questions | Set 2"}]},{"@type":"WebSite","@id":"http:\/\/43.205.93.38\/#website","url":"http:\/\/43.205.93.38\/","name":"PrepBytes Blog","description":"ONE-STOP RESOURCE FOR EVERYTHING RELATED TO CODING","publisher":{"@id":"http:\/\/43.205.93.38\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"http:\/\/43.205.93.38\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Organization","@id":"http:\/\/43.205.93.38\/#organization","name":"Prepbytes","url":"http:\/\/43.205.93.38\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"http:\/\/43.205.93.38\/#\/schema\/logo\/image\/","url":"https:\/\/blog.prepbytes.com\/wp-content\/uploads\/2025\/07\/uzxxllgloialmn9mhwfe.webp","contentUrl":"https:\/\/blog.prepbytes.com\/wp-content\/uploads\/2025\/07\/uzxxllgloialmn9mhwfe.webp","width":160,"height":160,"caption":"Prepbytes"},"image":{"@id":"http:\/\/43.205.93.38\/#\/schema\/logo\/image\/"},"sameAs":["https:\/\/www.facebook.com\/prepbytes0211\/","https:\/\/www.instagram.com\/prepbytes\/","https:\/\/www.linkedin.com\/company\/prepbytes\/","https:\/\/www.youtube.com\/channel\/UC0xGnHDrjUM1pDEK2Ka5imA"]},{"@type":"Person","@id":"http:\/\/43.205.93.38\/#\/schema\/person\/3f7dc4ae851791d5947a7f99df363d5e","name":"Prepbytes","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"http:\/\/43.205.93.38\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/232042cd1a1ea0e982c96d2a2ec93fb70a8e864e00784491231e7bfe5a9e06b5?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/232042cd1a1ea0e982c96d2a2ec93fb70a8e864e00784491231e7bfe5a9e06b5?s=96&d=mm&r=g","caption":"Prepbytes"},"url":"https:\/\/prepbytes.com\/blog\/author\/gourav-jaincollegedekho-com\/"}]}},"_links":{"self":[{"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/posts\/9711","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/users\/52"}],"replies":[{"embeddable":true,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/comments?post=9711"}],"version-history":[{"count":6,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/posts\/9711\/revisions"}],"predecessor-version":[{"id":10084,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/posts\/9711\/revisions\/10084"}],"wp:attachment":[{"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/media?parent=9711"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/categories?post=9711"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/tags?post=9711"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}