{"id":237,"date":"2026-01-29T12:03:08","date_gmt":"2026-01-29T12:03:08","guid":{"rendered":"https:\/\/staymind.shop\/?p=237"},"modified":"2026-01-29T12:03:09","modified_gmt":"2026-01-29T12:03:09","slug":"paper-of-programming-fundamental-department-of-computer-science-and-software-engineering","status":"publish","type":"post","link":"https:\/\/staymind.shop\/?p=237","title":{"rendered":"Paper Of Programming Fundamental Department Of Computer Science and Software Engineering"},"content":{"rendered":"\n<p>Let&#8217;s reset your expectations:&nbsp;<strong>Programming Fundamentals<\/strong>&nbsp;isn&#8217;t about learning a language. It&#8217;s about learning to&nbsp;<strong>think<\/strong>&nbsp;in a new way. This past paper isn&#8217;t a test of syntax memorization; it&#8217;s a test of your ability to translate a messy, real-world problem into a clear, step-by-step sequence of logical instructions that a mindless machine can execute flawlessly. It&#8217;s where you stop being a user and start being a creator.<\/p>\n\n\n\n<p>Forget fancy frameworks and shortcuts. This is the pure, raw core of computational thinking. It&#8217;s about building the mental muscles of problem decomposition, precise expression, and relentless debugging.<\/p>\n\n\n\n<p><strong>What This Paper Actually Builds: Your Computational Core<\/strong><\/p>\n\n\n\n<p><strong>1. The Paradigm Shift: From Human to Machine Thinking<\/strong><br>The first hurdle is mental. The paper assesses if you&#8217;ve made the leap:<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li><strong>Imperative Thinking:<\/strong>\u00a0You must think in\u00a0<strong>sequences<\/strong>,\u00a0<strong>decisions<\/strong>, and\u00a0<strong>repetitions<\/strong>. The world is no longer a static picture; it&#8217;s a series of state changes.<\/li>\n\n\n\n<li><strong>Abstraction:<\/strong>\u00a0Can you ignore irrelevant details and focus on the essential logic? This is the skill of seeing the general pattern in a specific problem.<\/li>\n\n\n\n<li><strong>Precision &amp; Literalness:<\/strong>\u00a0The computer does\u00a0<em>exactly<\/em>\u00a0what you tell it, not what you\u00a0<em>mean<\/em>. A misplaced semicolon or an off-by-one error isn&#8217;t a &#8220;typo&#8221;; it&#8217;s a fundamental flaw in your logic.<\/li>\n<\/ul>\n\n\n\n<p><strong>2. The Foundational Toolkit: The Atoms of Code<\/strong><br>You&#8217;ll be tested on your fluency with the basic constructs that combine to form any program.<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li><strong>Variables &amp; Data Types:<\/strong>\u00a0Understanding that a variable is a\u00a0<strong>named container<\/strong>, not an algebra symbol. Knowing the difference between\u00a0<code>int<\/code>,\u00a0<code>float<\/code>,\u00a0<code>char<\/code>,\u00a0<code>string<\/code>, and\u00a0<code>boolean<\/code>\u00a0at a conceptual level\u2014what they can hold and how they behave.<\/li>\n\n\n\n<li><strong>Control Flow:<\/strong>\u00a0The three pillars of structured programming:\n<ol start=\"1\" class=\"wp-block-list\">\n<li><strong>Sequence:<\/strong>\u00a0Statements executed in order.<\/li>\n\n\n\n<li><strong>Selection (<code>if<\/code>,\u00a0<code>else if<\/code>,\u00a0<code>else<\/code>,\u00a0<code>switch<\/code>):<\/strong>\u00a0Making decisions.<\/li>\n\n\n\n<li><strong>Iteration (<code>for<\/code>,\u00a0<code>while<\/code>,\u00a0<code>do-while<\/code>):<\/strong>\u00a0Repeating actions. You&#8217;ll trace loops meticulously, often by constructing &#8220;trace tables&#8221; to track variable values step-by-step.<\/li>\n<\/ol>\n<\/li>\n\n\n\n<li><strong>Basic Data Structures:<\/strong>\u00a0Primarily\u00a0<strong>arrays<\/strong>\u00a0(or lists). Understanding indexing (starting at 0!), bounds, and using loops to process them (searching for a value, finding a max\/min, computing an average).<\/li>\n<\/ul>\n\n\n\n<p><strong>3. The First Major Abstraction: Functions\/Methods<\/strong><br>This is where you learn to manage complexity by breaking it down.<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li><strong>The &#8220;Black Box&#8221; Principle:<\/strong>\u00a0A function takes input (<strong>parameters<\/strong>), performs a task, and returns output. You must understand\u00a0<strong>scope<\/strong>\u00a0(local vs. global variables),\u00a0<strong>passing arguments by value<\/strong>\u00a0(and sometimes by reference), and the power of\u00a0<strong>return<\/strong>.<\/li>\n\n\n\n<li><strong>Why Functions?<\/strong>\u00a0For reusability, organization, and making your code readable. You&#8217;ll be asked to write functions for common tasks (e.g.,\u00a0<code>isPrime(number)<\/code>,\u00a0<code>findMax(array)<\/code>).<\/li>\n<\/ul>\n\n\n\n<p><strong>4. Problem-Solving Methodology: The Real Skill<\/strong><br>The paper&#8217;s primary goal is to test your&nbsp;<strong>problem-solving process<\/strong>, not just your final code.<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li><strong>Step 1: Understanding the Problem.<\/strong>\u00a0Can you restate it in your own words? Identify inputs and desired outputs?<\/li>\n\n\n\n<li><strong>Step 2: Devising a Plan (Algorithm).<\/strong>\u00a0This is the critical, non-coding step. You&#8217;ll develop\u00a0<strong>pseudocode<\/strong>\u00a0or a\u00a0<strong>flowchart<\/strong>. This is where you think.<\/li>\n\n\n\n<li><strong>Step 3: Translating to Code.<\/strong>\u00a0Implementing your plan in a specific language (like C++, Java, or Python basics).<\/li>\n\n\n\n<li><strong>Step 4: Testing &amp; Debugging.<\/strong>\u00a0Given code with errors, you must\u00a0<strong>dry-run<\/strong>\u00a0it (execute it in your head) to find logical bugs (<code>==<\/code>\u00a0vs\u00a0<code>=<\/code>, infinite loops, incorrect loop conditions).<\/li>\n<\/ul>\n\n\n\n<p><strong>5. Introduction to the Debugger&#8217;s Mindset<\/strong><br>You&#8217;ll encounter questions where you&#8217;re given a buggy code snippet and the wrong output. Your job is to:<\/p>\n\n\n\n<ol start=\"1\" class=\"wp-block-list\">\n<li>Identify the line where the logic fails.<\/li>\n\n\n\n<li>Explain the nature of the bug (e.g., &#8220;The loop condition is\u00a0<code>i &lt;= length<\/code>, causing an out-of-bounds access; it should be\u00a0<code>i &lt; length<\/code>.&#8221;).<\/li>\n\n\n\n<li>Correct it.<\/li>\n<\/ol>\n\n\n\n<p><strong>The Paper&#8217;s Real Challenge: The &#8220;Code Reading&#8221; and &#8220;Plan Writing&#8221;<\/strong><br>The hardest parts for beginners are often&nbsp;<strong>not<\/strong>&nbsp;the writing, but:<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li><strong>Tracing Code:<\/strong>\u00a0Given a block of code with nested loops and\u00a0<code>if<\/code>\u00a0statements, you must manually execute it and write the exact output. This forces complete understanding.<\/li>\n\n\n\n<li><strong>Writing Algorithms in Pseudocode:<\/strong>\u00a0Being asked to describe the steps to solve a problem (e.g., &#8220;Find the second largest number in an array&#8221;) without using any specific programming syntax. This tests pure logic.<\/li>\n<\/ul>\n\n\n\n<p><strong>How to Ace This Past Paper:<\/strong><\/p>\n\n\n\n<ol start=\"1\" class=\"wp-block-list\">\n<li><strong>Practice Dry-Running Religiously.<\/strong>\u00a0Take code, a paper, and a pen. Be the computer. Write down the value of every variable after every line. This is the single most important skill.<\/li>\n\n\n\n<li><strong>Master Pseudocode.<\/strong>\u00a0Write your solutions in plain English mixed with basic logic structures first. The language-specific code should be the easy final step.<\/li>\n\n\n\n<li><strong>Become an Expert on Loops and Arrays.<\/strong>\u00a080% of fundamental problems involve processing data in a loop. Know how to iterate forwards, backwards, and conditionally.<\/li>\n\n\n\n<li><strong>Draw Diagrams.<\/strong>\u00a0For complex logic, sketch a quick flowchart. Visualizing the flow of control is invaluable.<\/li>\n\n\n\n<li><strong>Read the Problem, Then Re-Read It.<\/strong>\u00a0Underline key inputs, outputs, and conditions. Many errors come from solving a different problem than the one asked.<\/li>\n<\/ol>\n\n\n\n<p>This past paper is your&nbsp;<strong>initiation rite<\/strong>. It&#8217;s proof that you have successfully rewired a part of your brain to think sequentially, precisely, and algorithmically. Passing it doesn&#8217;t mean you know a language; it means you have acquired the&nbsp;<strong>fundamental skill of programming<\/strong>\u2014a skill you will use, in some form, for the rest of your technical career.<\/p>\n\n\n\n<p><strong>Programming Fundamental\u00a0Final Paper<\/strong><\/p>\n\n\n\n<p><strong>Q1:<\/strong><\/p>\n\n\n\n<ol class=\"wp-block-list\">\n<li>Write down the difference between compiler and interpreter?<\/li>\n\n\n\n<li>Write down difference between operator precedence and operator associativity in C++?<\/li>\n\n\n\n<li>Write down the code for the following output using for loop?<\/li>\n<\/ol>\n\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter size-full\"><img loading=\"lazy\" decoding=\"async\" width=\"634\" height=\"154\" src=\"https:\/\/staymind.shop\/wp-content\/uploads\/2026\/01\/image-83.png\" alt=\"\" class=\"wp-image-238\" srcset=\"https:\/\/staymind.shop\/wp-content\/uploads\/2026\/01\/image-83.png 634w, https:\/\/staymind.shop\/wp-content\/uploads\/2026\/01\/image-83-300x73.png 300w\" sizes=\"auto, (max-width: 634px) 100vw, 634px\" \/><\/figure>\n<\/div>\n\n\n<p><strong>Q2:<\/strong>&nbsp;Write a program that repeatedly collects positive integers from the user, stopping when the user enters a negative number or zero. After that, output the product of all positive entries?<\/p>\n\n\n\n<p><strong>Q3:<\/strong>&nbsp;Input three integer numbers and find the middle number of three integers.<\/p>\n\n\n\n<p>Hint1: 23 54 35&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Hint2: 40 23 50&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Hint3: 34 54 65<\/p>\n\n\n\n<p>Middle No is: 35&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Middle No is: 40 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Middle No is: 54<\/p>\n\n\n\n<p><strong>Q4:<\/strong>&nbsp;Write a program in C++ to display the number\u2019s digits in reverse order?<\/p>\n\n\n\n<p>Sample output:<\/p>\n\n\n\n<p>Input a number: 12345<\/p>\n\n\n\n<p>The number in reverse order is: 54321<\/p>\n\n\n\n<p><strong>Postcolonial Literature Sessional I in past paper<br><\/strong><strong>ATTEMPT ALL QUESTIONS.<\/strong><\/p>\n\n\n\n<p><strong>Q1<\/strong><\/p>\n\n\n\n<p>Write a program that inputs radius from the user and calculates area and circumference of a circle by using the formula Area- pix (radius)\u00b2 &amp; Circumference = 2 x pi x radius (3)<\/p>\n\n\n\n<p><strong>Q-2<\/strong><\/p>\n\n\n\n<p>Draw flowchart for a program that inputs three integer numbers and displays the smallest number by using nested if structure.<\/p>\n\n\n\n<p><strong>Q-3<\/strong><\/p>\n\n\n\n<p>a) Write a code with flowchart that finds the sum of the squares of integers from I to 100.<\/p>\n\n\n\n<p>b) Compare if, if-else-if and nested if structures(3)<\/p>\n\n\n\n<p><strong>Postcolonial Literature Sessional II in past paper<br><\/strong><\/p>\n\n\n\n<p><strong>Q1<\/strong><\/p>\n\n\n\n<p>Write a program that inputs five integers in an array and passes array to a function. The function counts total number of even and odd numbers and returns to main function to display it(10)<\/p>\n\n\n\n<p><strong>Q-2<\/strong>&nbsp;Write a program that inputs values in a two dimensional array with three rows and two columns, The function returns the maximum value in the array. (5)<\/p>\n\n\n\n<p><strong>Q-3<\/strong>&nbsp;Write a program for matrix A that inputs following elements &amp; arrange these elements shown in matrix B as under:\u2013.<\/p>\n\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter size-full\"><img loading=\"lazy\" decoding=\"async\" width=\"329\" height=\"194\" src=\"https:\/\/staymind.shop\/wp-content\/uploads\/2026\/01\/image-84.png\" alt=\"\" class=\"wp-image-239\" srcset=\"https:\/\/staymind.shop\/wp-content\/uploads\/2026\/01\/image-84.png 329w, https:\/\/staymind.shop\/wp-content\/uploads\/2026\/01\/image-84-300x177.png 300w\" sizes=\"auto, (max-width: 329px) 100vw, 329px\" \/><\/figure>\n<\/div>\n\n\n<p><strong>Q-4<\/strong>\u00a0Write a program that inputs ten floating point numbers in an array. It displays the values which are greater or equal or less than average value of this array. (10)<\/p>\n\n\n\n<p><strong>Postcolonial Literature Final paper<br><\/strong><strong>Q-1:<\/strong>&nbsp;Study the following code segments and write the output [2.5\u00b0 2-5).<\/p>\n\n\n\n<p>int N = 7; int i, x;<\/p>\n\n\n\n<p>for (= 1; i &lt;= N; i++) {<\/p>\n\n\n\n<p>cin &gt;&gt; x; cout &lt;&lt;&lt;&lt; \u201c, \u201d &lt;&lt; X &lt;&lt; \u201d \u201c; if(1 % 3= 0) { cout &lt;&lt; endl; }<\/p>\n\n\n\n<p>int arr[5]-{0,1,0,1,1); int sum-0,p=0; for (int i=0;i&lt;5;i++){ sam-sum+pow(2.p) arr[1];<\/p>\n\n\n\n<p>cout &lt;&lt; endl what is displayed with the given input? watch the end 1 characters.<\/p>\n\n\n\n<p>p++;<\/p>\n\n\n\n<p>}<\/p>\n\n\n\n<p>cout&lt;&lt;sum&lt;&lt;&lt;endl;<\/p>\n\n\n\n<p>Input: 11 12 13 14 15 16 17 18 19<\/p>\n\n\n\n<p><strong>Q-2:<\/strong>&nbsp;Rewrite the following C++ code segments to make it more efficient and to remove any unnecessary code. [2.5* 2-5).<\/p>\n\n\n\n<p>if (x &lt;yly &gt;= x) { cout &lt;&lt;<\/p>\n\n\n\n<p>\u201cNot good. \\n\u201d; }<\/p>\n\n\n\n<p>cout &lt;&lt; \u201cCarry on.\\n\u201d;<\/p>\n\n\n\n<p>if (x \/ y != 0 &amp;&amp; y != 0) { cout &lt;&lt; x\/y &lt;&lt; endl; }<\/p>\n\n\n\n<p><strong>Q-3:<\/strong>&nbsp;Write a C++ program to find k largest elements in a given array of integers. [5]<\/p>\n\n\n\n<p>Data Structure and Algorithms<\/p>\n\n\n\n<ol class=\"wp-block-list\">\n<li>Write an algorithm to delete even valued elements from an integer type array,<\/li>\n\n\n\n<li>Suppose an array A containing ten integers as shown, Draw the resultant array after implementing the given loop in each part. (In part-b use the given array, not the resultant array of part-a)<\/li>\n<\/ol>\n\n\n\n<figure class=\"wp-block-table\"><table class=\"has-fixed-layout\"><tbody><tr><td>10<\/td><td>20<\/td><td>30<\/td><td>40<\/td><td>50<\/td><td>60<\/td><td>70<\/td><td>80<\/td><td>90<\/td><td>100<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<figure class=\"wp-block-table\"><table class=\"has-fixed-layout\"><tbody><tr><td>Part-a<\/td><td>Part-b<\/td><\/tr><tr><td>Repeat for k\u00df1 to 9A[K+1] \u00df A[K]<\/td><td>K\u00df 9Repeat while (K&gt;=1)A[K+1] \u00df A[9]K\u00df K-1<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<p>iii. Using binary search technique show how it works when searching for 17 in the<\/p>\n\n\n\n<p>following array. (Assume indexing starts from 1 to 9)<\/p>\n\n\n\n<figure class=\"wp-block-table\"><table class=\"has-fixed-layout\"><tbody><tr><td>1<\/td><td>5<\/td><td>6<\/td><td>9<\/td><td>10<\/td><td>12<\/td><td>14<\/td><td>17<\/td><td>21<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<p>Question No. 2: Write short answers of questions given bellow:<\/p>\n\n\n\n<ol class=\"wp-block-list\">\n<li>What are the types of asymptotic notations?<\/li>\n\n\n\n<li>Which asymptotic notations specifically describes best and average case scenarios?<\/li>\n<\/ol>\n\n\n\n<p>Write difference between traversing and searching<\/p>\n\n\n\n<p>Define the situations when insertion in an array becomes best and worst.<\/p>\n\n\n\n<p><strong>Postcolonial Literature Sessional I in past paper<br><\/strong><\/p>\n\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter size-full\"><img loading=\"lazy\" decoding=\"async\" width=\"624\" height=\"496\" src=\"https:\/\/staymind.shop\/wp-content\/uploads\/2026\/01\/pf3.png\" alt=\"\" class=\"wp-image-240\" srcset=\"https:\/\/staymind.shop\/wp-content\/uploads\/2026\/01\/pf3.png 624w, https:\/\/staymind.shop\/wp-content\/uploads\/2026\/01\/pf3-300x238.png 300w\" sizes=\"auto, (max-width: 624px) 100vw, 624px\" \/><\/figure>\n<\/div>\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter size-large\"><img loading=\"lazy\" decoding=\"async\" width=\"461\" height=\"1024\" src=\"https:\/\/staymind.shop\/wp-content\/uploads\/2026\/01\/c2a05968-bd4b-4b76-b36a-36ee42d6e8e8-461x1024.jpg\" alt=\"\" class=\"wp-image-241\" srcset=\"https:\/\/staymind.shop\/wp-content\/uploads\/2026\/01\/c2a05968-bd4b-4b76-b36a-36ee42d6e8e8-461x1024.jpg 461w, https:\/\/staymind.shop\/wp-content\/uploads\/2026\/01\/c2a05968-bd4b-4b76-b36a-36ee42d6e8e8-135x300.jpg 135w, https:\/\/staymind.shop\/wp-content\/uploads\/2026\/01\/c2a05968-bd4b-4b76-b36a-36ee42d6e8e8.jpg 504w\" sizes=\"auto, (max-width: 461px) 100vw, 461px\" \/><\/figure>\n<\/div>","protected":false},"excerpt":{"rendered":"<p>Let&#8217;s reset your expectations:&nbsp;Programming Fundamentals&nbsp;isn&#8217;t about learning a language. It&#8217;s about learning to&nbsp;think&nbsp;in a new way. This past paper isn&#8217;t a test of syntax memorization; it&#8217;s a test of your ability to translate a messy, real-world problem into a clear, step-by-step sequence of logical instructions that a mindless machine can execute flawlessly. It&#8217;s where you [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":242,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[56],"tags":[4,5,6,7,8,57,10],"class_list":["post-237","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-programming-fundamental","tag-comsats","tag-new","tag-paper","tag-past","tag-past_paper","tag-programming-fundamental","tag-start"],"_links":{"self":[{"href":"https:\/\/staymind.shop\/index.php?rest_route=\/wp\/v2\/posts\/237","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/staymind.shop\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/staymind.shop\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/staymind.shop\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/staymind.shop\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=237"}],"version-history":[{"count":1,"href":"https:\/\/staymind.shop\/index.php?rest_route=\/wp\/v2\/posts\/237\/revisions"}],"predecessor-version":[{"id":243,"href":"https:\/\/staymind.shop\/index.php?rest_route=\/wp\/v2\/posts\/237\/revisions\/243"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/staymind.shop\/index.php?rest_route=\/wp\/v2\/media\/242"}],"wp:attachment":[{"href":"https:\/\/staymind.shop\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=237"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/staymind.shop\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=237"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/staymind.shop\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=237"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}