Before you jump into writing lines of code in languages like C, Java, or Python, you have to learn how to think like a software engineer. At Pokhara University (PU), Problem Solving Technique (PST) is exactly where that mental transformation begins.
It is the foundational course that trains you to break down a messy, real-world issue into a clean, logical, step-by-step solution. Yet, many first-year students struggle to bridge the gap between human thought and machine logic. Designing perfect flowcharts or writing foolproof pseudo-code on a university exam sheet takes a systematic approach.
To make your preparation seamless, we have put together the ultimate PU Problem Solving Technique (PST) Notes & Solutions PDF.
Why PST is the True Foundation of Computer Science
Learning coding syntax is relatively straightforward, but learning how to approach a problem is the real skill. PST ensures you do not waste hours writing bad code by teaching you structural logic first. This course trains your brain in three main areas:
Decomposition: Breaking a massive, intimidating problem down into bite-sized, manageable sub-problems.
Algorithmic Thinking: Creating sequential, unambiguous steps to guarantee a correct output every single time.
Visual Mapping: Translating complex mental workflows into universally recognized symbols using engineering-standard flowcharts.
What’s Inside This Complete PU Resource Manual
This study package directly targets the official Pokhara University syllabus, distilling heavy computer science theories into actionable, exam-focused chapters.
1. Core Theoretical Frameworks
The Problem-Solving Cycle: From problem identification and requirement analysis to maintenance and documentation.
Design Methodologies: Deep-dives into Top-Down vs. Bottom-Up design models, and modular programming structures.
Control Structures: Flawless logic frameworks for Sequential execution, Selection (if-else, switch case), and Iteration (loops like for, while, do-while).
2. Solved Board Questions & Dry-Run Examples
The exam pattern for PST requires absolute precision. Our manual gives you the edge with:
Hand-Drawn Flowcharts: Perfect, clean representations of conditional loops using standard ANSI symbols (rectangles, diamonds, parallelograms).
Trace Tables: Step-by-step dry-run tables tracking variable state changes to prove your algorithms are 100% correct before writing code.
Classic PU Algorithms: Solved implementations for recurring university questions (e.g., Armstrong numbers, Fibonacci series, matrix transposition logic, and sorting arrays).
Access Your Free PDF Download
Stop scouring through disjointed internet articles or trying to decrypt incomplete classroom scribbles. Download the fully compiled, peer-verified study pack featured in our website cover graphic watermarked_img_11577695806721254008.png to start preparing efficiently.
Target Programs: BE Computer, BCT, BCA, BIT, BIM, BSc. CSIT.
Contents: Detailed Chapter Notes + Standard Flowchart Explanations + Solved Past Question Bank.
Format: High-quality, searchable, and mobile-friendly PDF.
[DOWNLOAD POKHARA UNIVERSITY PST NOTES & SOLUTIONS PDF]
Pro Exam Tip: Avoid the Infinite Loop Trap!
When writing loops in your pseudo-code or drawing them out in a flowchart, always double-check your termination condition. University examiners love to check if you have explicitly modified your loop control variable. Forgetting to increment or decrement your counter variable is the easiest way to lose full marks on a logic question!