commit 7bca45b494cfb61b9319462f6c6a14f9f8060bba parent cea88103ec2305a3fd5b2909945cc1f8d8a94f80 Author: github-actions[bot] <41898282+github-actions[bot]@users.noreply.github.com> Date: Tue, 2 Jun 2026 09:37:59 +0000 chore: auto-generate GitHub Pages docs Diffstat:
450 files changed, 29590 insertions(+), 83 deletions(-)
diff --git a/docs-new/semester_1/practice-c/external_3.md b/docs-new/semester_1/practice-c/external_3.md @@ -0,0 +1,76 @@ +--- +title: external_3.c +description: "C program source code for external_3.c" +icon: lucide/file-code +--- + +# `external_3.c` + +## Actions + +<div class="action-buttons-desktop"> +<a href="https://raw.usercontent.amit.is-a.dev/semester_1/practice-c/external_3.c" class="md-button" target="_blank" rel="noopener">Raw</a> +<a href="https://github.com/notamitgamer/bsc/blob/main/semester_1/practice-c/external_3.c" class="md-button" target="_blank" rel="noopener">View on GitHub</a> +<button class="md-button" type="button" onclick="copyPageUrl()">Copy URL</button> +</div> + +> You can print or save this file by opening Raw and using your browser. + +<div class="action-buttons-mobile"> +<button class="md-button" onclick="openActionSheet()">Actions</button> +</div> + +<div class="dd-backdrop" id="actionBackdrop" onclick="closeActionSheet()"></div> +<div class="dd-sheet" id="actionSheet" role="dialog" aria-modal="true" aria-label="Actions"> + <div class="dd-sheet-handle"></div> + <div class="dd-sheet-title"><span class="ti ti-bolt" aria-hidden="true"></span> Actions</div> + <a href="https://raw.usercontent.amit.is-a.dev/semester_1/practice-c/external_3.c" target="_blank" rel="noopener" onclick="closeActionSheet()"> + <span class="ti ti-file-code item-icon" aria-hidden="true"></span> + <span class="item-label">Raw</span> + </a> + <a href="https://github.com/notamitgamer/bsc/blob/main/semester_1/practice-c/external_3.c" target="_blank" rel="noopener" onclick="closeActionSheet()"> + <span class="ti ti-brand-github item-icon" aria-hidden="true"></span> + <span class="item-label">View on GitHub</span> + </a> + <a href="javascript:void(0)" onclick="copyAndClose()"> + <span class="ti ti-copy item-icon" aria-hidden="true"></span> + <span class="item-label">Copy URL</span> + </a> +</div> + +<script> +function openActionSheet(){var b=document.getElementById("actionBackdrop"),s=document.getElementById("actionSheet");b.style.display="block";s.style.display="block";document.body.style.overflow="hidden";requestAnimationFrame(function(){b.classList.add("visible");s.classList.add("visible");});} +function closeActionSheet(){var b=document.getElementById("actionBackdrop"),s=document.getElementById("actionSheet");b.classList.remove("visible");s.classList.remove("visible");document.body.style.overflow="";setTimeout(function(){b.style.display="none";s.style.display="none";},300);} +function copyPageUrl(){var btn=document.querySelector(".action-buttons-desktop .md-button:last-child");try{navigator.clipboard.writeText(window.location.href).then(function(){if(btn){var o=btn.textContent;btn.textContent="Copied!";setTimeout(function(){btn.textContent=o;},1800);}}).catch(function(){fallbackCopy();});}catch(e){fallbackCopy();}} +function fallbackCopy(){var ta=document.createElement("textarea");ta.value=window.location.href;ta.style.position="fixed";ta.style.opacity="0";document.body.appendChild(ta);ta.focus();ta.select();try{document.execCommand("copy");}catch(e){}document.body.removeChild(ta);} +function copyAndClose(){closeActionSheet();setTimeout(function(){copyPageUrl();},320);} +</script> + +## Source Code +<div data-search-exclude="true"> +```c +#include<stdio.h> + +int sum(int); + +int main() { + int n; + printf("Enter the value for n: "); + scanf("%d", &n); + printf("\nSum of the first n terms= %d", sum(n)); + return 0; +} + +int sum(int n) { + int i, res = 0; + for(i = 1; i <= n; i++) { + if(i % 2 == 0) { + res -= i; + continue; + } + res += i; + } + return res; +} +``` +</div> diff --git a/docs-new/semester_1/practice-c/index.md b/docs-new/semester_1/practice-c/index.md @@ -8,41 +8,42 @@ Files and sub-folders in **Practice C**. |---|---|---| | 1 | `external_1.c` | [View Code](external_1.md) | | 2 | `external_2.c` | [View Code](external_2.md) | -| 3 | `pc-ip-01.c` | [View Code](pc-ip-01.md) | -| 4 | `pc-ip-02.c` | [View Code](pc-ip-02.md) | -| 5 | `pc-ip-03.c` | [View Code](pc-ip-03.md) | -| 6 | `pc-ip-04.c` | [View Code](pc-ip-04.md) | -| 7 | `pc-ip-05.c` | [View Code](pc-ip-05.md) | -| 8 | `pc-ip-06.c` | [View Code](pc-ip-06.md) | -| 9 | `pc-ip-07.c` | [View Code](pc-ip-07.md) | -| 10 | `pc-ip-08.c` | [View Code](pc-ip-08.md) | -| 11 | `pc-ip-09.c` | [View Code](pc-ip-09.md) | -| 12 | `pc-ip-10.c` | [View Code](pc-ip-10.md) | -| 13 | `pc-ip-11.c` | [View Code](pc-ip-11.md) | -| 14 | `pc-ip-12.c` | [View Code](pc-ip-12.md) | -| 15 | `pc-ip-13.c` | [View Code](pc-ip-13.md) | -| 16 | `pc-ip-14.c` | [View Code](pc-ip-14.md) | -| 17 | `pc-ip-15.c` | [View Code](pc-ip-15.md) | -| 18 | `pc-ip-16.c` | [View Code](pc-ip-16.md) | -| 19 | `pc-ip-17.c` | [View Code](pc-ip-17.md) | -| 20 | `pc-ip-18.c` | [View Code](pc-ip-18.md) | -| 21 | `pc-ip-19.c` | [View Code](pc-ip-19.md) | -| 22 | `pc-ip-20.c` | [View Code](pc-ip-20.md) | -| 23 | `pc001.c` | [View Code](pc001.md) | -| 24 | `pc002.c` | [View Code](pc002.md) | -| 25 | `pc003.c` | [View Code](pc003.md) | -| 26 | `pc004.c` | [View Code](pc004.md) | -| 27 | `pc005.c` | [View Code](pc005.md) | -| 28 | `pc006.c` | [View Code](pc006.md) | -| 29 | `pc007.c` | [View Code](pc007.md) | -| 30 | `pc008.c` | [View Code](pc008.md) | -| 31 | `pc009.c` | [View Code](pc009.md) | -| 32 | `pc010.c` | [View Code](pc010.md) | -| 33 | `pc011.c` | [View Code](pc011.md) | -| 34 | `pc012.c` | [View Code](pc012.md) | -| 35 | `pc013.c` | [View Code](pc013.md) | -| 36 | `pc014.c` | [View Code](pc014.md) | -| 37 | `pc015.c` | [View Code](pc015.md) | -| 38 | `pc016.c` | [View Code](pc016.md) | -| 39 | `pc017.c` | [View Code](pc017.md) | +| 3 | `external_3.c` | [View Code](external_3.md) | +| 4 | `pc-ip-01.c` | [View Code](pc-ip-01.md) | +| 5 | `pc-ip-02.c` | [View Code](pc-ip-02.md) | +| 6 | `pc-ip-03.c` | [View Code](pc-ip-03.md) | +| 7 | `pc-ip-04.c` | [View Code](pc-ip-04.md) | +| 8 | `pc-ip-05.c` | [View Code](pc-ip-05.md) | +| 9 | `pc-ip-06.c` | [View Code](pc-ip-06.md) | +| 10 | `pc-ip-07.c` | [View Code](pc-ip-07.md) | +| 11 | `pc-ip-08.c` | [View Code](pc-ip-08.md) | +| 12 | `pc-ip-09.c` | [View Code](pc-ip-09.md) | +| 13 | `pc-ip-10.c` | [View Code](pc-ip-10.md) | +| 14 | `pc-ip-11.c` | [View Code](pc-ip-11.md) | +| 15 | `pc-ip-12.c` | [View Code](pc-ip-12.md) | +| 16 | `pc-ip-13.c` | [View Code](pc-ip-13.md) | +| 17 | `pc-ip-14.c` | [View Code](pc-ip-14.md) | +| 18 | `pc-ip-15.c` | [View Code](pc-ip-15.md) | +| 19 | `pc-ip-16.c` | [View Code](pc-ip-16.md) | +| 20 | `pc-ip-17.c` | [View Code](pc-ip-17.md) | +| 21 | `pc-ip-18.c` | [View Code](pc-ip-18.md) | +| 22 | `pc-ip-19.c` | [View Code](pc-ip-19.md) | +| 23 | `pc-ip-20.c` | [View Code](pc-ip-20.md) | +| 24 | `pc001.c` | [View Code](pc001.md) | +| 25 | `pc002.c` | [View Code](pc002.md) | +| 26 | `pc003.c` | [View Code](pc003.md) | +| 27 | `pc004.c` | [View Code](pc004.md) | +| 28 | `pc005.c` | [View Code](pc005.md) | +| 29 | `pc006.c` | [View Code](pc006.md) | +| 30 | `pc007.c` | [View Code](pc007.md) | +| 31 | `pc008.c` | [View Code](pc008.md) | +| 32 | `pc009.c` | [View Code](pc009.md) | +| 33 | `pc010.c` | [View Code](pc010.md) | +| 34 | `pc011.c` | [View Code](pc011.md) | +| 35 | `pc012.c` | [View Code](pc012.md) | +| 36 | `pc013.c` | [View Code](pc013.md) | +| 37 | `pc014.c` | [View Code](pc014.md) | +| 38 | `pc015.c` | [View Code](pc015.md) | +| 39 | `pc016.c` | [View Code](pc016.md) | +| 40 | `pc017.c` | [View Code](pc017.md) | diff --git a/docs/404.html b/docs/404.html @@ -8662,6 +8662,8 @@ + + @@ -8776,6 +8778,35 @@ <li class="md-nav__item"> + <a href="/semester_1/practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="/semester_1/practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/CNAME b/docs/CNAME @@ -1 +1 @@ -code.amit.is-a.dev- \ No newline at end of file +code.amit.is-a.dev diff --git a/docs/CODE_OF_CONDUCT/index.html b/docs/CODE_OF_CONDUCT/index.html @@ -8751,6 +8751,8 @@ + + @@ -8865,6 +8867,35 @@ <li class="md-nav__item"> + <a href="../semester_1/practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../semester_1/practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/CONTRIBUTING/index.html b/docs/CONTRIBUTING/index.html @@ -8762,6 +8762,8 @@ + + @@ -8876,6 +8878,35 @@ <li class="md-nav__item"> + <a href="../semester_1/practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../semester_1/practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/LICENSE/index.html b/docs/LICENSE/index.html @@ -8676,6 +8676,8 @@ + + @@ -8790,6 +8792,35 @@ <li class="md-nav__item"> + <a href="../semester_1/practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../semester_1/practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/SECURITY/index.html b/docs/SECURITY/index.html @@ -8729,6 +8729,8 @@ + + @@ -8843,6 +8845,35 @@ <li class="md-nav__item"> + <a href="../semester_1/practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../semester_1/practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/credits/index.html b/docs/credits/index.html @@ -8679,6 +8679,8 @@ + + @@ -8793,6 +8795,35 @@ <li class="md-nav__item"> + <a href="../semester_1/practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../semester_1/practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/faq/index.html b/docs/faq/index.html @@ -8990,6 +8990,8 @@ + + @@ -9104,6 +9106,35 @@ <li class="md-nav__item"> + <a href="../semester_1/practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../semester_1/practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/index.html b/docs/index.html @@ -8816,6 +8816,8 @@ + + @@ -8930,6 +8932,35 @@ <li class="md-nav__item"> + <a href="./semester_1/practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="./semester_1/practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/quickstart/index.html b/docs/quickstart/index.html @@ -8834,6 +8834,8 @@ + + @@ -8948,6 +8950,35 @@ <li class="md-nav__item"> + <a href="../semester_1/practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../semester_1/practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/search.json b/docs/search.json @@ -1 +1 @@ -{"config":{"separator":"[\\s\\-\\.]+"},"items":[{"location":"","level":1,"title":"BSc Code Index","text":"","path":["BSc Code Index"],"tags":[]},{"location":"#bsc-computer-science-honours-wbsu","level":2,"title":"BSc Computer Science Honours (WBSU)","text":"<p>This repository serves as a comprehensive, live archive of my 4-year academic journey in Computer Science at Acharya Prafulla Chandra College (APC). It contains practical implementations, assignments, and study materials following the WBSU curriculum.</p>","path":["BSc Code Index"],"tags":[]},{"location":"#quick-links","level":3,"title":"Quick Links","text":"<ul> <li>GitHub Repo: @notamitgamer/bsc</li> <li>Web View notamitgamer.github.io/bsc/</li> <li>Web View: amit.is-a.dev/bsc</li> <li>Live Portfolio: amit.is-a.dev</li> <li>GitHub Profile: @notamitgamer</li> </ul>","path":["BSc Code Index"],"tags":[]},{"location":"#roadmap-and-progress","level":2,"title":"Roadmap and Progress","text":"<p>Progress</p> <p>I am currently in Semester 1. Folders for future semesters are placeholders and will be updated in real-time as the academic session progresses.</p> Semester Status Primary Focus Semester 1 Active C Programming, R Semester 2 Pending Upcoming Semester 3 Pending Upcoming Semester 4 Pending Upcoming Semester 5 Pending Upcoming Semester 6 Pending Upcoming Semester 7 Pending Upcoming Semester 8 Pending Upcoming","path":["BSc Code Index"],"tags":[]},{"location":"#environment-setup","level":2,"title":"Environment Setup","text":"","path":["BSc Code Index"],"tags":[]},{"location":"#c-and-c-development","level":3,"title":"C and C++ Development","text":"<ol> <li>Download Compiler: MinGW64.zip (85 MB) or Original MinGW-w64 Executable</li> <li>Configuration: Extract to <code>C:\\MinGW64</code> and add <code>C:\\MinGW64\\bin</code> to your System Environment Variables.</li> <li>Verification: Run <code>gcc --version</code> in your terminal.</li> </ol>","path":["BSc Code Index"],"tags":[]},{"location":"#r-programming","level":3,"title":"R Programming","text":"<p>Setup Tip</p> <p>Download and install R from CRAN and RStudio for the best development experience.</p>","path":["BSc Code Index"],"tags":[]},{"location":"#academic-integrity","level":2,"title":"Academic Integrity","text":"<p>Academic Integrity</p> <p>While this code is public for reference, academic integrity is a priority.</p> <ul> <li>Understand the Logic — Study the implementations to learn the underlying concepts.</li> <li>Avoid Plagiarism — Direct copy-pasting for college submissions is strongly discouraged.</li> <li>Independent Implementation — The best way to learn is to understand the logic, then rewrite it from scratch.</li> </ul>","path":["BSc Code Index"],"tags":[]},{"location":"#about-the-author","level":2,"title":"About the Author","text":"<p>Amit Dutta</p> Method Use Personal amitdutta4255@gmail.com Work mail@amit.is-a.dev License MIT","path":["BSc Code Index"],"tags":[]},{"location":"CODE_OF_CONDUCT/","level":1,"title":"Code of Conduct","text":"","path":["Code of Conduct"],"tags":[]},{"location":"CODE_OF_CONDUCT/#our-pledge","level":2,"title":"Our Pledge","text":"<p>I am committed to making this repository a welcoming and respectful place for learning and discussion.</p>","path":["Code of Conduct"],"tags":[]},{"location":"CODE_OF_CONDUCT/#expectations","level":2,"title":"Expectations","text":"<ul> <li>Be Respectful: Treat others with kindness and respect in Issues and Discussions.</li> <li>Academic Integrity: Do not use this platform to facilitate cheating or academic dishonesty.</li> <li>Constructive Feedback: Criticism should be helpful and focused on the code, not the person.</li> </ul>","path":["Code of Conduct"],"tags":[]},{"location":"CODE_OF_CONDUCT/#enforcement","level":2,"title":"Enforcement","text":"<p>As the repository owner, I reserve the right to remove any comments, issues, or pull requests that violate these standards or the academic integrity goals of this project.</p> <p>Thank you for being a responsible part of this learning journey.</p>","path":["Code of Conduct"],"tags":[]},{"location":"CONTRIBUTING/","level":1,"title":"Contributing to bsc","text":"<p>Thank you for your interest in improving this repository! Now that this project is licensed under the MIT License, I welcome community contributions, bug reports, and optimizations.</p>","path":["Contributing to bsc"],"tags":[]},{"location":"CONTRIBUTING/#licensing","level":2,"title":"Licensing","text":"<p>By submitting a Pull Request (PR) or code snippet to this repository, you agree that your contribution will be governed by the MIT License. </p>","path":["Contributing to bsc"],"tags":[]},{"location":"CONTRIBUTING/#how-to-contribute","level":2,"title":"How to Contribute","text":"<ol> <li>Report Bugs: If you find an error in a solution, please open an Issue. Provide details on how to reproduce the error or why the current logic is incorrect.</li> <li>Suggest Improvements: If you have a more efficient algorithm or a cleaner implementation, feel free to share it via an Issue or a PR.</li> <li>Documentation: Typos, better comments, and clarity improvements are always appreciated.</li> </ol>","path":["Contributing to bsc"],"tags":[]},{"location":"CONTRIBUTING/#contribution-guidelines","level":2,"title":"Contribution Guidelines","text":"<p>To maintain the quality of this resource, please ensure:</p> <ul> <li>Originality: You certify that the code you submit is your own original work or that you have the right to submit it under the MIT License.</li> <li>Academic Integrity: Do not submit code copied from textbooks or other students without proper attribution. </li> <li>Purpose: While this is now open-source, please avoid submitting solutions to active university assignments that could facilitate academic dishonesty.</li> </ul>","path":["Contributing to bsc"],"tags":[]},{"location":"CONTRIBUTING/#getting-started","level":2,"title":"Getting Started","text":"<ol> <li>Fork the repository.</li> <li>Clone your fork locally.</li> <li>Create a branch for your changes.</li> <li>Commit your work with clear descriptions.</li> <li>Push to your fork and submit a Pull Request.</li> </ol> <p>Thank you for helping keep this resource accurate and high-quality!</p>","path":["Contributing to bsc"],"tags":[]},{"location":"LICENSE/","level":1,"title":"LICENSE","text":"<p>MIT License</p> <p>Copyright (c) 2025-2026 AMIT DUTTA</p> <p>Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the \"Software\"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:</p> <p>The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.</p> <p>THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.</p>","path":["LICENSE"],"tags":[]},{"location":"SECURITY/","level":1,"title":"Security Policy","text":"","path":["Security Policy"],"tags":[]},{"location":"SECURITY/#reporting-a-vulnerability-or-code-error","level":2,"title":"Reporting a Vulnerability or Code Error","text":"<p>While this is a personal learning project, if you discover a security vulnerability in any of the code, I would appreciate it if you could bring it to my attention.</p> <p>Please report vulnerabilities or Errors by opening a new issue on the repository. Please provide as much detail as possible in your report, including the steps to reproduce the vulnerability and to solve the error.</p> <p>Thank you for helping to improve the quality of my work.</p>","path":["Security Policy"],"tags":[]},{"location":"credits/","level":1,"title":"Acknowledgments","text":"<p>Building and maintaining a fast, open-source code index requires reliable and accessible infrastructure. I would like to extend my sincere gratitude to the following platforms, communities, and open-source projects that make <code>code.amit.is-a.dev</code> possible:</p> <ul> <li>is-a.dev: For providing the sleek, developer-centric domain name completely free of charge, giving this project a professional home.</li> <li>Hugging Face: For securely and reliably storing the extensive collection of raw C programming files.</li> <li>Cloudflare: For handling the backend routing, DNS, and caching, seamlessly bridging the domain to ensure Hugging Face serves the code files swiftly and securely.</li> <li>Firebase: For providing lightning-fast, dependable, and free web hosting for the site's compiled static assets.</li> <li>MkDocs, Material for MkDocs & Zensical: The phenomenal foundational frameworks that effortlessly transform raw Markdown files and code snippets into the beautiful, searchable, and highly responsive user interface you see today.</li> </ul> <p>This project thrives thanks to the generosity of these free-tier services and the incredible work of the open-source community.</p>","path":["Acknowledgments"],"tags":[]},{"location":"faq/","level":1,"title":"Frequently Asked Questions (FAQ)","text":"","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#general","level":2,"title":"General","text":"","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#1-what-is-this-project","level":3,"title":"1. What is this project?","text":"<p>A live archive of BSc Computer Science practical codes following the WBSU curriculum.</p>","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#2-who-created-this","level":3,"title":"2. Who created this?","text":"<p>Amit Dutta</p>","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#3-where-is-the-source-code-hosted","level":3,"title":"3. Where is the source code hosted?","text":"<p>On GitHub: https://github.com/notamitgamer/bsc</p>","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#4-can-i-use-this-code","level":3,"title":"4. Can I use this code?","text":"<p>Yes, under the MIT License.</p>","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#5-can-i-copy-this-for-assignments","level":3,"title":"5. Can I copy this for assignments?","text":"<p>No. You should understand and rewrite the logic.</p>","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#metadata","level":2,"title":"Metadata","text":"","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#6-what-is-author","level":3,"title":"6. What is \"Author\"?","text":"<p>The person who wrote the code.</p>","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#7-what-is-repo","level":3,"title":"7. What is \"Repo\"?","text":"<p>The original source repository of the file.</p>","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#8-what-is-license","level":3,"title":"8. What is \"License\"?","text":"<p>It defines how the code can be used.</p>","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#usage","level":2,"title":"Usage","text":"","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#9-can-i-print-the-code","level":3,"title":"9. Can I print the code?","text":"<p>Yes. Use the Raw button and print from your browser.</p>","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#10-can-i-reuse-this-in-projects","level":3,"title":"10. Can I reuse this in projects?","text":"<p>Yes, but follow the license terms.</p>","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#11-can-i-modify-the-code","level":3,"title":"11. Can I modify the code?","text":"<p>Yes. You are encouraged to experiment and improve.</p>","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#academic-integrity","level":2,"title":"Academic Integrity","text":"","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#12-what-is-academic-integrity","level":3,"title":"12. What is academic integrity?","text":"<p>It means doing your own work honestly.</p>","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#13-is-copying-allowed","level":3,"title":"13. Is copying allowed?","text":"<p>No. Copying without understanding is discouraged.</p>","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#14-what-should-i-do-instead","level":3,"title":"14. What should I do instead?","text":"<ul> <li>Read the code</li> <li>Understand the logic</li> <li>Rewrite it yourself</li> </ul>","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#technical","level":2,"title":"Technical","text":"","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#15-why-is-something-missing","level":3,"title":"15. Why is something missing?","text":"<p>The project is continuously updated.</p>","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#16-how-often-is-it-updated","level":3,"title":"16. How often is it updated?","text":"<p>As the academic journey progresses.</p>","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#17-where-can-i-report-issues","level":3,"title":"17. Where can I report issues?","text":"<p>On GitHub Issues: https://github.com/notamitgamer/bsc/issues</p>","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"quickstart/","level":1,"title":"Quick Start Guide","text":"<p>Get started with the BSc Code Index in minutes.</p>","path":["Quick Start Guide"],"tags":[]},{"location":"quickstart/#1-browse-the-code","level":2,"title":"1. Browse the Code","text":"<ul> <li>Use the sidebar to navigate semesters and topics</li> <li>Click any file to view full documentation</li> </ul>","path":["Quick Start Guide"],"tags":[]},{"location":"quickstart/#2-understand-a-program","level":2,"title":"2. Understand a Program","text":"<p>Each page includes:</p> <ul> <li>Problem Statement</li> <li>Source Code</li> </ul>","path":["Quick Start Guide"],"tags":[]},{"location":"quickstart/#3-run-the-code","level":2,"title":"3. Run the Code","text":"","path":["Quick Start Guide"],"tags":[]},{"location":"quickstart/#for-c","level":3,"title":"For C","text":"<pre><code>gcc file.c -o output\n./output\n</code></pre>","path":["Quick Start Guide"],"tags":[]},{"location":"quickstart/#for-r","level":3,"title":"For R","text":"<pre><code>Rscript file.r\n</code></pre>","path":["Quick Start Guide"],"tags":[]},{"location":"quickstart/#4-print-or-save","level":2,"title":"4. Print or Save","text":"<ul> <li>Click Raw</li> <li>Use browser → Print → Save as PDF</li> </ul>","path":["Quick Start Guide"],"tags":[]},{"location":"quickstart/#5-learn-properly","level":2,"title":"5. Learn Properly","text":"<p>Important</p> <p>Do NOT copy-paste blindly.</p> <p>Best method: - Read the code - Understand logic - Rewrite yourself</p>","path":["Quick Start Guide"],"tags":[]},{"location":"quickstart/#6-use-github","level":2,"title":"6. Use GitHub","text":"<ul> <li>View full repository</li> <li>Track updates</li> <li>Explore file history</li> </ul>","path":["Quick Start Guide"],"tags":[]},{"location":"quickstart/#7-folder-navigation","level":2,"title":"7. Folder Navigation","text":"<p>Each folder contains: - Subfolders (topics/semesters) - Code files - Auto-generated index</p>","path":["Quick Start Guide"],"tags":[]},{"location":"quickstart/#8-youre-ready","level":2,"title":"8. You're Ready","text":"<p>Start exploring and learning step-by-step.</p>","path":["Quick Start Guide"],"tags":[]},{"location":"terms/","level":1,"title":"Terms of Use","text":"<p>These Terms govern your use of this website and all associated content, including source code, documentation, and generated materials.</p>","path":["Terms of Use"],"tags":[]},{"location":"terms/#about-this-project","level":2,"title":"About This Project","text":"<p>BSc Code Index is an open-source, publicly available collection of reference code and assignment solutions from a BSc (Honours) Computer Science degree at the West Bengal State University (WBSU). It is maintained and published by Amit Dutta (@notamitgamer) as a personal academic reference for students.</p> <p>The project is hosted on GitHub and freely accessible to anyone. It is not affiliated with or endorsed by WBSU or any academic institution.</p>","path":["Terms of Use"],"tags":[]},{"location":"terms/#acceptance-of-terms","level":2,"title":"Acceptance of Terms","text":"<p>By accessing or using this website, you confirm that you have read, understood, and agree to be bound by these Terms. If you do not agree, you must not use this website or its content.</p>","path":["Terms of Use"],"tags":[]},{"location":"terms/#author","level":2,"title":"Author","text":"<p>This project is created and maintained by:</p> <ul> <li>Name: Amit Dutta</li> <li>GitHub: github.com/notamitgamer</li> <li>Website: amit.is-a.dev</li> </ul>","path":["Terms of Use"],"tags":[]},{"location":"terms/#ownership-project-status","level":2,"title":"Ownership & Project Status","text":"<p>This project is provided publicly for educational and reference purposes. The author reserves the right to:</p> <ul> <li>Limit or withdraw access at any time</li> <li>Discontinue the project without notice</li> <li>Disclaim responsibility for how the project is used</li> </ul> <p>No guarantee is made regarding long-term availability or maintenance.</p>","path":["Terms of Use"],"tags":[]},{"location":"terms/#academic-integrity","level":2,"title":"Academic Integrity","text":"<p>This repository is intended strictly for learning and reference.</p> <ul> <li>You are solely responsible for how you use this code</li> <li>Copying code directly for academic submissions is strongly discouraged</li> <li>Any plagiarism, cheating, or misuse is entirely your own responsibility</li> </ul> <p>The author holds no liability for academic misconduct resulting from misuse of this content.</p>","path":["Terms of Use"],"tags":[]},{"location":"terms/#license","level":2,"title":"License","text":"<p>Unless otherwise stated, all code is licensed under the MIT License. You are free to use, modify, and distribute the code in accordance with its terms.</p>","path":["Terms of Use"],"tags":[]},{"location":"terms/#use-at-your-own-risk","level":2,"title":"Use at Your Own Risk","text":"<p>All content is provided \"as-is\" and \"as available\" with no guarantees of correctness, completeness, reliability, or fitness for academic, professional, or production use. You use this website and its content entirely at your own risk.</p>","path":["Terms of Use"],"tags":[]},{"location":"terms/#disclaimer-limitation-of-liability","level":2,"title":"Disclaimer & Limitation of Liability","text":"<p>To the fullest extent permitted by law:</p> <ul> <li>The author shall not be liable for any direct, indirect, incidental, or consequential damages</li> <li>This includes (but is not limited to):<ul> <li>Academic penalties</li> <li>Data loss</li> <li>System failures</li> <li>Incorrect results or outputs</li> </ul> </li> </ul>","path":["Terms of Use"],"tags":[]},{"location":"terms/#content-accuracy","level":2,"title":"Content Accuracy","text":"<p>While efforts are made to ensure correctness, content may contain errors or outdated information. No guarantee is made regarding accuracy or completeness.</p>","path":["Terms of Use"],"tags":[]},{"location":"terms/#indemnification","level":2,"title":"Indemnification","text":"<p>You agree to indemnify and hold harmless the author from any claims, losses, liabilities, damages, or expenses (including legal fees) arising from your use of this service or your violation of these Terms.</p>","path":["Terms of Use"],"tags":[]},{"location":"terms/#data-privacy","level":2,"title":"Data & Privacy","text":"<p>This website:</p> <ul> <li>Does not collect personal data</li> <li>Does not track users</li> <li>Does not store user information</li> </ul> <p>External platforms such as GitHub or hosting providers may have their own privacy policies.</p>","path":["Terms of Use"],"tags":[]},{"location":"terms/#third-party-services","level":2,"title":"Third-Party Services","text":"<p>This website may rely on third-party platforms such as GitHub and hosting providers. The author is not responsible for their services, policies, or availability.</p>","path":["Terms of Use"],"tags":[]},{"location":"terms/#updates-to-terms","level":2,"title":"Updates to Terms","text":"<p>These Terms may be updated at any time. Changes take effect immediately upon posting. Your continued use of the website constitutes acceptance of the updated Terms.</p>","path":["Terms of Use"],"tags":[]},{"location":"terms/#governing-law","level":2,"title":"Governing Law","text":"<p>These Terms are governed by the laws of India. Any disputes shall be subject to the exclusive jurisdiction of the Barasat Court, West Bengal.</p>","path":["Terms of Use"],"tags":[]},{"location":"terms/#contact","level":2,"title":"Contact","text":"<p>For any questions regarding these Terms, you may reach out via:</p> <ul> <li>Email: amitdutta4255@gmail.com</li> <li>Email: mail@amit.is-a.dev</li> <li>GitHub: github.com/notamitgamer</li> <li>Website: amit.is-a.dev</li> </ul> <p>This project exists to support learning and exploration. Use it responsibly.</p>","path":["Terms of Use"],"tags":[]},{"location":"semester_1/","level":1,"title":"Index","text":"<p>Active</p> <p>Files and sub-folders in Eduincs Exam.</p>","path":["Semester 1","Index"],"tags":[]},{"location":"semester_1/#semester-1-active-content","level":2,"title":"SEMESTER 1: ACTIVE CONTENT","text":"<p>This folder contains all my current academic work, including practicals, assignments, and study materials for the BSc Computer Science program (SEM-I) at Acharya Prafulla Chandra College (APC).</p> <p>Current Status: * Actively Updated: New code and materials are added following the college schedule. * Technologies: Primarily focusing on C Programming and R Programming.</p> <p>Explore More: * See my other projects on my Portfolio * Follow my development journey on GitHub</p>","path":["Semester 1","Index"],"tags":[]},{"location":"semester_1/#folders","level":2,"title":"Folders","text":"No. Folder Name Link 1 Assignment Primary Open Folder 2 Assignment Secondary Open Folder 3 Eduincs Exam Open Folder 4 Internal Practice Open Folder 5 Khurapati Idea Open Folder 6 Letusc Open Folder 7 Practice C Open Folder 8 Temp Open Folder 9 Tuition C Open Folder 10 R Open Folder","path":["Semester 1","Index"],"tags":[]},{"location":"semester_1/#directory-structure","level":2,"title":"Directory Structure","text":"<p>To keep the repository organized, the C and R programs are divided into specific categories based on their origin and purpose. </p>","path":["Semester 1","Index"],"tags":[]},{"location":"semester_1/#c-programming","level":3,"title":"C Programming","text":"<ul> <li><code>/assignment-primary/</code>: Core college assignments and standard problems.</li> <li><code>/assignment-secondary/</code>: Additional or extended college assignments.</li> <li><code>/internal-practice/</code>: Code written for internal exam preparation.</li> <li><code>/practice-c/</code>: General, day-to-day C programming practice files.</li> <li><code>/tuition-c/</code>: Programs and problem-solving exercises completed during tuition classes (files prefixed with <code>APC-PRAC</code>, <code>APC-S</code>, etc.).</li> <li><code>/EduInCS Exam/</code>: Specific code solutions for exam papers organized by date.</li> <li><code>/letusc/</code>: Chapter-wise exercise solutions from the textbook \"Let Us C\".</li> <li><code>/khurapati-idea/</code>: Experimental code, logical tests, and out-of-the-box ideas.</li> </ul>","path":["Semester 1","Index"],"tags":[]},{"location":"semester_1/#r-programming","level":3,"title":"R Programming","text":"<ul> <li><code>/R/</code>: Contains all R-related coursework, split into:</li> <li><code>/Code/</code>: R script files (<code>.r</code>) for practicals.</li> <li><code>/Material_PDF/</code>: Study materials and reference documents for R.</li> </ul>","path":["Semester 1","Index"],"tags":[]},{"location":"semester_1/#how-to-find-a-specific-code","level":2,"title":"How to Find a Specific Code","text":"<ol> <li>Identify the Category: Determine if the code was an assignment, a textbook problem, or a tuition exercise, and navigate to the corresponding folder above.</li> <li>Naming Convention: Most files are sequentially numbered for easy tracking (e.g., <code>assignment-p-01.c</code>, <code>luc018.c</code>, <code>APC-PRAC-005.c</code>).</li> <li>Internal Comments: Open the file. Most source codes include a commented section at the top detailing the exact problem statement or logic being solved.</li> </ol>","path":["Semester 1","Index"],"tags":[]},{"location":"semester_1/#how-to-run-the-programs","level":2,"title":"How to Run the Programs","text":"","path":["Semester 1","Index"],"tags":[]},{"location":"semester_1/#running-c-programs-c","level":3,"title":"Running C Programs (<code>.c</code>)","text":"<p>Ensure you have a C compiler (like GCC via MinGW) installed. If you haven't set it up, refer to the Main Repository README for the installation guide.</p> <ol> <li>Open your terminal or command prompt.</li> <li>Navigate to the folder containing the specific program:</li> </ol> <p><pre><code>cd Semester_1/assignment-primary\n</code></pre> 4. Compile the code using GCC:</p> <p><pre><code>gcc assignment-p-01.c -o program.exe\n</code></pre> 6. Execute the compiled file:</p> <pre><code>./program.exe\n</code></pre>","path":["Semester 1","Index"],"tags":[]},{"location":"semester_1/#running-r-programs-r","level":3,"title":"Running R Programs (<code>.r</code>)","text":"<p>It is highly recommended to run R programs using RStudio for the best visual experience with data and plots.</p>","path":["Semester 1","Index"],"tags":[]},{"location":"semester_1/#to-run-via-command-line","level":4,"title":"To run via command line:","text":"<ol> <li>Open your terminal.</li> <li>Navigate to the R Code directory:</li> </ol> <p><pre><code>cd Semester_1/R/Code\n</code></pre> 4. Execute the script using <code>Rscript</code>:</p> <pre><code>Rscript R_Prac-1.r\n</code></pre>","path":["Semester 1","Index"],"tags":[]},{"location":"semester_1/model_questions/","level":1,"title":"Model Questions: Computer Fundamentals and Programming with C","text":"","path":["Semester 1","Model Questions: Computer Fundamentals and Programming with C"],"tags":[]},{"location":"semester_1/model_questions/#paper-code-cmsacor01t","level":3,"title":"Paper Code: CMSACOR01T","text":"<p>How to use this file</p> <p>Questions are grouped unit-wise matching the WBSU NEP syllabus. If you can answer each descriptive question fully, all short/MCQ variants on that topic are automatically covered. Attempt at least 2 questions from each unit before your exam.</p>","path":["Semester 1","Model Questions: Computer Fundamentals and Programming with C"],"tags":[]},{"location":"semester_1/model_questions/#unit-1-overview-of-c","level":2,"title":"Unit 1 — Overview of C","text":"<p>Q1. Trace the history of the C programming language from its origin at Bell Labs to its standardization as ANSI C. Explain why C is considered a middle-level language and what advantages it offers over assembly language and over high-level languages like Python.</p> <p>Q2. Describe the basic structure of a C program with a complete annotated example. Explain the role of each section: documentation, preprocessor directives, global declarations, <code>main()</code>, and user-defined functions. What happens if <code>main()</code> is absent?</p> <p>Q3. What is an algorithm? List and explain the five essential properties of an algorithm. Write an algorithm (in pseudocode or flowchart) to find the largest of three numbers, and then translate it into a working C program.</p> <p>Q4. Explain structured programming constructs in detail. What are the three fundamental control structures according to the Böhm–Jacopini theorem? How does C implement each of them? Why did structured programming replace \"goto-heavy\" coding?</p> <p>Q5. List all the character sets used in C. Classify them into letters, digits, special characters, and whitespace characters. Give examples of how special characters serve dual purposes in C (e.g., <code>*</code> as both multiplication operator and pointer declarator).</p> <p>Q6. Define the term token in C. Identify and explain all six categories of tokens: keywords, identifiers, constants, string literals, operators, and punctuators. Give two examples from each category.</p> <p>Q7. List all 32 keywords of ANSI C. For any 10 of them, write a short code snippet demonstrating their purpose. Why are keywords case-sensitive in C?</p> <p>Q8. Differentiate between integer constants, floating-point constants, character constants, and string constants in C. What is an escape sequence? List at least eight escape sequences with their meanings and an example use of each.</p> <p>Q9. What is a variable? Explain the rules for naming variables in C. Differentiate between variable declaration and variable definition with examples. What is the significance of the <code>extern</code> keyword in this context?</p> <p>Q10. Describe all primitive data types in C (<code>int</code>, <code>float</code>, <code>double</code>, <code>char</code>, <code>void</code>). For each, state the typical size (in bytes on a 32-bit system), range, and a usage example. What is the role of type modifiers (<code>signed</code>, <code>unsigned</code>, <code>short</code>, <code>long</code>)?</p> <p>Q11. Explain the four storage classes in C — <code>auto</code>, <code>register</code>, <code>static</code>, and <code>extern</code> — with respect to: (a) storage location, (b) default initial value, (c) scope, (d) lifetime. Write a single program that demonstrates at least three of these.</p> <p>Q12. What is meant by scope and lifetime of a variable? Differentiate between local scope, global scope, and block scope with examples. What problem can arise when a local variable has the same name as a global variable, and how does C resolve this?</p>","path":["Semester 1","Model Questions: Computer Fundamentals and Programming with C"],"tags":[]},{"location":"semester_1/model_questions/#unit-2-operators-expressions-and-preprocessor","level":2,"title":"Unit 2 — Operators, Expressions and Preprocessor","text":"<p>Q13. Explain all arithmetic operators in C with examples. What is integer division in C? Write a program that accepts two integers and demonstrates all arithmetic operations including integer division truncation and the modulo operator.</p> <p>Q14. List and explain all relational and logical operators in C. What values do they return? Write a program that reads a year and determines whether it is a leap year using relational and logical operators.</p> <p>Q15. Explain the assignment operator and all compound assignment operators (<code>+=</code>, <code>-=</code>, <code>*=</code>, <code>/=</code>, <code>%=</code>, <code>&=</code>, <code>|=</code>, <code>^=</code>, <code><<=</code>, <code>>>=</code>) with examples. What is the difference between <code>=</code> (assignment) and <code>==</code> (equality)?</p> <p>Q16. Explain pre-increment (<code>++i</code>) and post-increment (<code>i++</code>) operators, and their decrement counterparts, with detailed examples. Write a program showing how <code>a = i++</code> and <code>a = ++i</code> produce different results.</p> <p>Q17. Explain the conditional (ternary) operator <code>? :</code> in C with syntax and at least three practical examples. When would you prefer the ternary operator over an <code>if-else</code> block?</p> <p>Q18. Describe all six bitwise operators in C (<code>&</code>, <code>|</code>, <code>^</code>, <code>~</code>, <code><<</code>, <code>>></code>). Write a program that: (a) checks whether a number is even or odd using bitwise AND, (b) swaps two numbers without a temporary variable using XOR, and (c) multiplies a number by 8 using left shift.</p> <p>Q19. What are special operators in C? Explain the <code>sizeof</code> operator, the comma operator, the address-of operator <code>&</code>, and the dereference operator <code>*</code> with examples. What does <code>sizeof(int)</code> return on a 64-bit system and why?</p> <p>Q20. Explain operator precedence and associativity in C. Draw a precedence table covering at least 10 levels. Trace the evaluation of the following expression step-by-step: <code>x = 3 + 4 * 2 - 6 / 2 + (8 % 3)</code>.</p> <p>Q21. What is type casting in C? Distinguish between implicit (automatic) type conversion and explicit type casting with examples. What is integer promotion? Write a program showing a case where implicit conversion leads to data loss.</p> <p>Q22. Explain the role of the C preprocessor. Describe the following directives with syntax and examples: <code>#include</code>, <code>#define</code>, <code>#undef</code>, <code>#if</code>, <code>#ifdef</code>, <code>#ifndef</code>, <code>#else</code>, <code>#elif</code>, <code>#endif</code>, and <code>#error</code>. What is the difference between <code>#include <file></code> and <code>#include \"file\"</code>?</p> <p>Q23. What is a macro in C? Explain function-like macros vs. object-like macros. Write macros for: (a) finding the maximum of two numbers, (b) squaring a number, (c) converting Fahrenheit to Celsius. What is a macro side effect — illustrate with <code>#define SQUARE(x) x*x</code> when called as <code>SQUARE(a+1)</code>.</p> <p>Q24. Describe all standard input/output functions available in C: <code>printf()</code>, <code>scanf()</code>, <code>getchar()</code>, <code>putchar()</code>, <code>gets()</code>, <code>puts()</code>. Explain all format specifiers (<code>%d</code>, <code>%f</code>, <code>%c</code>, <code>%s</code>, <code>%e</code>, <code>%o</code>, <code>%x</code>, <code>%p</code>, <code>%ld</code>, <code>%lf</code>). Write a program that reads and prints data of multiple types.</p>","path":["Semester 1","Model Questions: Computer Fundamentals and Programming with C"],"tags":[]},{"location":"semester_1/model_questions/#unit-3-decision-and-loop-control-structures","level":2,"title":"Unit 3 — Decision and Loop Control Structures","text":"<p>Q25. Explain the <code>if</code>, <code>if-else</code>, and nested <code>if-else</code> statements with syntax, flowcharts, and examples. Write a program that reads three numbers and prints them in descending order using nested <code>if-else</code>.</p> <p>Q26. Explain the <code>switch</code> statement in detail — its syntax, how it works, the role of <code>break</code>, the <code>default</code> case, and fall-through behaviour. Write a program that implements a simple calculator (+, -, *, /) using <code>switch</code>. What are the limitations of <code>switch</code> compared to <code>if-else</code>?</p> <p>Q27. What is the conditional operator <code>? :</code> as a decision construct? Compare and contrast <code>switch</code> and <code>if-else-if</code> ladder: when is each preferred? Write the same grade-classification program using both constructs.</p> <p>Q28. Describe the <code>while</code> loop in C with syntax and flowchart. Write a program using <code>while</code> to: (a) print all perfect numbers between 1 and 500, (b) find the GCD of two numbers using the Euclidean algorithm.</p> <p>Q29. Describe the <code>do-while</code> loop and explain the fundamental difference between <code>while</code> and <code>do-while</code>. Give a scenario where <code>do-while</code> is the correct choice. Write a menu-driven program that keeps repeating until the user chooses to quit, using <code>do-while</code>.</p> <p>Q30. Explain the <code>for</code> loop with syntax, flowchart, and examples. Write programs to: (a) print the multiplication table of a number, (b) compute n! (factorial), (c) print Pascal's triangle up to n rows. Show how to write an infinite loop using <code>for</code>.</p> <p>Q31. Explain the <code>break</code> and <code>continue</code> statements in C with examples. How do they differ in their effect inside a loop? Write a program that prints all prime numbers from 2 to 100 using <code>break</code> and <code>continue</code> appropriately.</p> <p>Q32. Explain the <code>goto</code> statement in C with syntax and an example. Why is <code>goto</code> generally discouraged in structured programming? Are there any cases where <code>goto</code> is considered acceptable? Give an example of forward jump and backward jump using <code>goto</code>.</p> <p>Q33. Write a program in C that prints the following patterns. Explain the loop logic used for each: <pre><code>(a) * (b) ***** (c) 1\n *** **** 1 2\n ***** *** 1 2 3\n ******* ** 1 2 3 4\n ********* * 1 2 3 4 5\n</code></pre></p> <p>Q34. Write a C program to check whether a number is Armstrong (narcissistic), and use it to print all Armstrong numbers between 1 and 9999. Explain the algorithm. Also write programs to check Palindrome and Perfect numbers.</p>","path":["Semester 1","Model Questions: Computer Fundamentals and Programming with C"],"tags":[]},{"location":"semester_1/model_questions/#unit-4-functions-and-arrays","level":2,"title":"Unit 4 — Functions and Arrays","text":"<p>Q35. Explain the concept of functions in C. What are the advantages of modular programming using functions? Distinguish between the following: (a) function declaration (prototype), (b) function definition, (c) function call. Write a program that uses a function to check whether a number is prime.</p> <p>Q36. Explain call by value and call by reference in C with examples. Which mechanism does C use by default? How can call-by-reference behaviour be simulated in C? Write a program to swap two integers both ways and show the difference in output.</p> <p>Q37. Explain functions returning values and void functions (functions returning nothing). What is the <code>return</code> statement? Can a function return multiple values directly? If not, how can you achieve returning multiple values? Write an appropriate example.</p> <p>Q38. What are inline functions in C? Why are they used, and what is the benefit over macros? What are the limitations of inline functions? (Note: Inline is a C99/C++ feature; explain how it relates to macros in ANSI C context.)</p> <p>Q39. What are function parameters? Explain formal parameters vs. actual parameters. What happens if too few or too many arguments are passed? Describe functions with variable number of arguments using <code><stdarg.h></code> (<code>va_list</code>, <code>va_start</code>, <code>va_arg</code>, <code>va_end</code>) with an example that sums n integers.</p> <p>Q40. Explain command line arguments in C. What is the signature <code>int main(int argc, char *argv[])</code>? Write a program that accepts a filename from the command line and prints its contents. What happens if no arguments are provided?</p> <p>Q41. What is recursion? Explain how the call stack works during recursion with a diagram. Write recursive C programs to compute: (a) factorial, (b) Fibonacci numbers, (c) GCD (Euclidean method), (d) Tower of Hanoi. Discuss the advantages and disadvantages of recursion vs. iteration.</p> <p>Q42. Declare and define a one-dimensional array in C. Explain the relationship between an array name and a pointer. Write a program that: (a) finds the maximum and minimum element, (b) reverses the array in place, (c) performs linear search, (d) performs binary search — all using the same array.</p> <p>Q43. Explain two-dimensional arrays in C. How is a 2D array stored in memory (row-major order)? Write a C program to: (a) multiply two matrices, (b) find the transpose of a matrix, (c) check whether a matrix is symmetric. Also explain multi-dimensional arrays.</p> <p>Q44. Explain string handling in C. How are character arrays used to store strings? What is the null character <code>'\\0'</code> and why is it important? Explain and demonstrate the following string functions from <code><string.h></code>: <code>strlen</code>, <code>strcpy</code>, <code>strcat</code>, <code>strcmp</code>, <code>strchr</code>, <code>strstr</code>, <code>strtok</code>, <code>strrev</code>.</p> <p>Q45. Write a C program that reads a sentence and: (a) counts the number of words, vowels, consonants, and digits, (b) converts to uppercase, (c) reverses the sentence word by word (not character by character). Explain the string manipulation logic used.</p>","path":["Semester 1","Model Questions: Computer Fundamentals and Programming with C"],"tags":[]},{"location":"semester_1/model_questions/#unit-5-pointers","level":2,"title":"Unit 5 — Pointers","text":"<p>Q46. What is a pointer in C? Explain pointer declaration, initialization, and dereferencing with detailed examples. What is the difference between <code>int *p = &x</code> and <code>int *p = x</code>? What is a null pointer, and why should you initialize pointers?</p> <p>Q47. Explain pointer arithmetic in C. What operations are valid on pointers? Trace through the following: if <code>int a[] = {10, 20, 30, 40}</code> and <code>int *p = a</code>, what is the value of <code>*(p+2)</code>, <code>p[3]</code>, <code>*(p++)</code>, <code>*++p</code>? Explain why you cannot multiply two pointers.</p> <p>Q48. Explain the relationship between pointers and arrays in C. Why does the array name act as a constant pointer? Write a program to traverse an array using a pointer instead of an index. What is the difference between <code>a[i]</code> and <code>*(a+i)</code>?</p> <p>Q49. Explain pointer-to-pointer (double pointer) in C. Give a scenario where it is necessary. Write a program that uses a double pointer to dynamically allocate a 2D array.</p> <p>Q50. Describe string manipulation using pointers. Write C functions (using only pointer operations, no array indexing) to: (a) compute string length, (b) copy one string to another, (c) concatenate two strings, (d) compare two strings.</p> <p>Q51. What is dynamic memory allocation in C? Explain <code>malloc()</code>, <code>calloc()</code>, <code>realloc()</code>, and <code>free()</code> with syntax and examples. What is a memory leak, and how does <code>free()</code> prevent it? Write a program to dynamically create an array of n integers entered by the user.</p> <p>Q52. Explain the <code>new</code> and <code>delete</code> operators for dynamic allocation. How do they differ from <code>malloc/free</code>? (Note: these are C++ operators; explain in the context of C++ compatibility discussed in C courses.) Write a program using <code>new</code> to allocate a 1D array dynamically.</p> <p>Q53. What are function pointers in C? Explain declaration, assignment, and calling syntax. Write a program that uses an array of function pointers to implement a simple calculator — each operation (+, -, *, /) is pointed to by a function pointer.</p> <p>Q54. Explain <code>const</code> pointers vs. pointers to <code>const</code> in C. What is the difference between: (a) <code>const int *p</code>, (b) <code>int * const p</code>, (c) <code>const int * const p</code>? Give a practical use case for each.</p>","path":["Semester 1","Model Questions: Computer Fundamentals and Programming with C"],"tags":[]},{"location":"semester_1/model_questions/#unit-6-user-defined-datatypes-and-memory-allocation","level":2,"title":"Unit 6 — User-defined Datatypes and Memory Allocation","text":"<p>Q55. What are enumerated data types (<code>enum</code>) in C? How are they declared and used? What are their default values, and how can you assign custom values? Write a program that uses <code>enum</code> to represent days of the week and prints whether a given day is a weekday or weekend.</p> <p>Q56. Define a structure in C. How is it different from an array? Explain: (a) declaring a structure, (b) defining a structure variable, (c) accessing members using <code>.</code> operator, (d) initializing a structure. Write a program using a structure to store and display student records (roll number, name, marks in 5 subjects, average).</p> <p>Q57. Explain arrays of structures in C. Write a program to maintain a phone book: store 5 contacts (name, phone number, email) in an array of structures, and implement search by name.</p> <p>Q58. Explain pointers to structures in C. What is the <code>-></code> (arrow) operator and when is it used? Rewrite the student record program from Q56 using a pointer to the structure. Explain how passing a structure pointer to a function is more efficient than passing by value.</p> <p>Q59. Explain nested structures in C (structure within a structure). Write a program to store employee data: each employee has a name, ID, and a <code>date_of_joining</code> (which is itself a structure with day, month, year fields). Print the employee who joined earliest.</p> <p>Q60. Define a <code>union</code> in C. How does it differ from a <code>struct</code>? Explain memory allocation in a union. Write a program that uses a union to store either an integer, float, or character and prints the currently active member. What hazards can arise with unions?</p> <p>Q61. What is <code>typedef</code> in C? How can <code>typedef</code> be combined with <code>struct</code> and <code>union</code> to simplify code? Rewrite the student structure from Q56 using <code>typedef</code>. What is the advantage of <code>typedef</code> over <code>#define</code> for type aliasing?</p> <p>Q62. Compare and contrast static vs. dynamic memory allocation in C. Explain: (a) where statically allocated variables are stored (stack/BSS/data segment), (b) where dynamically allocated memory lives (heap). What causes a stack overflow, and what causes a heap overflow?</p> <p>Q63. Explain the use of <code>malloc()</code> and <code>calloc()</code> for memory allocation in detail. What is the difference between them regarding initialization? Write a program that: (a) builds a linked list of integers dynamically, (b) traverses and prints it, (c) frees all nodes.</p> <p>Q64. Describe bit fields in C structures. Write a program that uses bit fields to compactly represent a date (day: 5 bits, month: 4 bits, year: 12 bits) inside a structure. What is the advantage of bit fields in embedded/systems programming?</p>","path":["Semester 1","Model Questions: Computer Fundamentals and Programming with C"],"tags":[]},{"location":"semester_1/model_questions/#unit-7-file-access","level":2,"title":"Unit 7 — File Access","text":"<p>Q65. What is a file in C? Explain the difference between text files and binary files. Why is file I/O necessary? Describe the <code>FILE</code> pointer and the <code>fstream</code> header. Explain the modes: <code>\"r\"</code>, <code>\"w\"</code>, <code>\"a\"</code>, <code>\"r+\"</code>, <code>\"w+\"</code>, <code>\"a+\"</code>, <code>\"rb\"</code>, <code>\"wb\"</code>.</p> <p>Q66. Explain <code>fopen()</code> and <code>fclose()</code> in detail. What happens if <code>fopen()</code> fails, and how should you handle it? Write a program that opens a file, writes 10 student records (name, roll no., marks) to it, closes it, reopens it, and reads and displays all records.</p> <p>Q67. Explain character-level file I/O using <code>fgetc()</code> / <code>getc()</code> and <code>fputc()</code> / <code>putc()</code>. Write a program that: (a) copies one text file to another character by character, (b) counts the number of vowels, consonants, lines, and words in a text file.</p> <p>Q68. Explain <code>fgets()</code> and <code>fputs()</code> for line-by-line file I/O. How do they differ from <code>gets()</code> and <code>puts()</code>? Write a program that reads a text file line by line and prints each line with a line number prefix, then writes the numbered output to a new file.</p> <p>Q69. Explain <code>fread()</code> and <code>fwrite()</code> for binary file I/O. When should you use binary mode over text mode? Write a program that: (a) writes an array of structures to a binary file, (b) reads it back and prints the data. Explain the parameters of <code>fread()</code> / <code>fwrite()</code> in detail.</p> <p>Q70. Explain random file access in C using <code>fseek()</code>, <code>ftell()</code>, and <code>rewind()</code>. What are the three seek origins: <code>SEEK_SET</code>, <code>SEEK_CUR</code>, <code>SEEK_END</code>? Write a program that updates a specific record in a binary file of student structures without rewriting the entire file.</p> <p>Q71. What is <code>fprintf()</code> and <code>fscanf()</code>? How are they different from <code>printf()</code> and <code>scanf()</code>? Write a program that logs all user inputs with timestamps to a log file using <code>fprintf()</code>, then uses <code>fscanf()</code> to read them back.</p> <p>Q72. Explain error handling in file operations using <code>ferror()</code>, <code>feof()</code>, <code>clearerr()</code>, and <code>perror()</code>. Write a robust file-copy program that handles all possible errors: file not found, insufficient permissions, disk full, etc.</p>","path":["Semester 1","Model Questions: Computer Fundamentals and Programming with C"],"tags":[]},{"location":"semester_1/model_questions/#unit-8-mixed-application-questions","level":2,"title":"Unit 8 — Mixed / Application Questions","text":"<p>Q73. Write a complete C program to implement a student grade management system that:</p> <ul> <li>Stores data for n students (name, roll number, marks in 5 subjects) using structures</li> <li>Calculates the total and percentage for each student</li> <li>Assigns grades (O/A+/A/B+/B/C/F) based on percentage</li> <li>Sorts students by percentage in descending order</li> <li>Writes all results to a file and reads them back</li> </ul> <p>Explain each section of your program.</p> <p>Q74. Explain recursion and iteration as two approaches to solving the Tower of Hanoi problem. Write a recursive C program to solve Tower of Hanoi for n disks. What is the time complexity? How many moves are needed for n=4? Trace the execution for n=3.</p> <p>Q75. Explain what a Fibonacci sequence is. Write C programs to compute the nth Fibonacci number using: (a) simple recursion, (b) iteration, (c) memoization (storing previously computed values in an array). Compare the time complexity of each approach.</p> <p>Q76. What is a sparse matrix? How is it stored efficiently in C? Write a program to: (a) represent a sparse matrix using a 3-column array (row, col, value), (b) add two sparse matrices represented this way, (c) display the result in standard matrix form.</p> <p>Q77. Explain command-line argument processing in C. Write a program <code>mycat</code> that mimics the Unix <code>cat</code> command: it accepts one or more filenames as command-line arguments and prints their contents to stdout. Handle the case where no arguments are given (read from stdin).</p> <p>Q78. Write a C program to implement a simple stack using arrays. Implement push, pop, peek, isEmpty, and isFull operations. Then use this stack to: (a) check whether a given string is a palindrome, (b) check balanced parentheses in an expression.</p> <p>Q79. Describe the concept of multi-file programming in C. Explain header files (<code>.h</code>), source files (<code>.c</code>), and how <code>#include</code> connects them. What is the purpose of include guards (<code>#ifndef FILE_H</code>... <code>#endif</code>)? Show a small example with a <code>math_utils.h</code>, <code>math_utils.c</code>, and <code>main.c</code>.</p> <p>Q80. Explain dynamic memory allocation for a 2D matrix in C using pointer-to-pointer. Write a program that: (a) dynamically allocates an m×n matrix, (b) fills it with random numbers, (c) finds the row with the maximum sum, (d) frees all allocated memory correctly.</p>","path":["Semester 1","Model Questions: Computer Fundamentals and Programming with C"],"tags":[]},{"location":"semester_1/model_questions/#unit-9-previous-year-pattern-questions-cbcs-style-adapted-for-nep","level":2,"title":"Unit 9 — Previous Year Pattern Questions (CBCS-style adapted for NEP)","text":"<p>Q81. What do you mean by structured programming? What are its characteristics? Distinguish between structured and unstructured programming with examples. How did the GOTO statement violate structured programming principles?</p> <p>Q82. Explain the difference between <code>while</code> loop and <code>do-while</code> loop. In what situation will a <code>do-while</code> loop execute at least once even if the condition is false from the beginning? Write both loops to compute the sum of digits of a number.</p> <p>Q83. What is a pointer? Why do we use pointers? Explain with examples: (a) passing arrays to functions using pointers, (b) returning a pointer from a function, (c) why you should never return a pointer to a local variable.</p> <p>Q84. Explain the concept of string in C. Why does C not have a built-in string type? Write a program to: (a) check if a string is a palindrome, (b) count the frequency of each character in a string, (c) remove all duplicate characters from a string.</p> <p>Q85. Explain what <code>static</code> variables inside a function mean. How is a <code>static</code> local variable different from a global variable even though both persist across function calls? Write a program demonstrating static local variables for counting how many times a function is called.</p> <p>Q86. What is the difference between <code>#define</code> and <code>const</code> for defining constants in C? Which is preferred and why? Write a program showing a case where using <code>#define</code> can cause unexpected bugs (hint: no type checking) while <code>const</code> avoids it.</p> <p>Q87. Write a C program to implement matrix multiplication. Check the compatibility of the matrices before multiplication. Explain the algorithm (O(n³) complexity). How would you optimize it for sparse matrices?</p> <p>Q88. Explain the storage of a 2D array in row-major order. For an array <code>int a[3][4]</code>, if the base address is 2000 and each int takes 4 bytes, calculate the address of <code>a[2][3]</code> using the row-major formula. Write a function that accepts a 2D array and prints it in spiral order.</p> <p>Q89. What is the <code>sizeof</code> operator? Is it a function or an operator? Write a program that prints the sizes of all fundamental data types. Explain padding and alignment in structures — why does <code>sizeof(struct)</code> sometimes exceed the sum of sizes of its members?</p> <p>Q90. Explain type conversion in assignments. What happens when you assign a <code>double</code> to an <code>int</code>? When you assign an <code>int</code> to a <code>char</code>? Write a program that demonstrates both implicit narrowing and widening conversions, and show how to use explicit casting to control the result.</p>","path":["Semester 1","Model Questions: Computer Fundamentals and Programming with C"],"tags":[]},{"location":"semester_1/model_questions/#unit-10-long-answer-essay-type-1015-marks-equivalent","level":2,"title":"Unit 10 — Long Answer / Essay Type (10–15 marks equivalent)","text":"<p>Q91. Write a comprehensive note on pointers in C covering: (a) fundamentals and memory model, (b) pointer arithmetic, (c) pointers and arrays, (d) pointers and strings, (e) pointers and functions (call by reference), (f) pointers and structures, (g) dynamic memory allocation using pointers, (h) common pointer bugs (dangling pointer, wild pointer, memory leak). Use code examples throughout.</p> <p>Q92. Describe the C preprocessor in depth. Explain: (a) the sequence of preprocessing steps before compilation, (b) all preprocessor directives, (c) parameterized macros and their limitations compared to inline functions, (d) conditional compilation and its uses in cross-platform code, (e) the <code>#pragma</code> directive. Show a real-world use case (e.g., debug logging that can be switched off).</p> <p>Q93. Write a detailed essay on user-defined data types in C. Cover: (a) <code>enum</code> — use in state machines, (b) <code>struct</code> — use for records, (c) <code>union</code> — use for type-punning and memory overlay, (d) <code>typedef</code> for readability, (e) nested and self-referential structures (linked list node), (f) bit fields. Provide a complete program that uses all of these.</p> <p>Q94. Explain file handling in C comprehensively. Cover: (a) the concept of streams and FILE *, (b) opening/closing files, (c) sequential vs. random access, (d) text vs. binary files, (e) all standard I/O functions for files, (f) error handling. Write a complete mini-database program that maintains a file of employee records and supports: add, search by ID, update salary, delete, and list-all operations.</p> <p>Q95. Write a detailed note on functions in C. Include: (a) why functions are necessary (code reuse, modularity), (b) function prototype, definition, and call, (c) parameter passing mechanisms, (d) return types including void, (e) recursive functions with examples, (f) function pointers and callbacks, (g) command-line arguments, (h) variable-argument functions (<code>printf</code> itself as an example). Provide at least four complete programs.</p> <p>Q96. Explain arrays and strings in C in depth. Cover: (a) 1D array declaration, access, and common algorithms (search, sort, reverse), (b) 2D arrays and matrix operations, (c) the array-pointer equivalence, (d) strings as character arrays, (e) all major string library functions with implementation from scratch, (f) array of strings. Write programs to: (i) sort an array of strings alphabetically, (ii) implement a simple word-frequency counter.</p> <p>Q97. Describe the decision-making and looping constructs of C comprehensively. Compare <code>if</code>, <code>if-else</code>, <code>nested if-else</code>, <code>switch</code>, and ternary operator. Compare <code>while</code>, <code>do-while</code>, <code>for</code>, and nested loops. Explain <code>break</code>, <code>continue</code>, <code>goto</code>, and <code>return</code> as loop-control modifiers. Write programs for: (a) printing all prime numbers from 2 to 1000 using nested loops, (b) a number guessing game using <code>do-while</code>, (c) a simple menu-driven program using <code>switch</code>.</p> <p>Q98. Describe the complete data type system in C including: (a) all primitive types with sizes and ranges, (b) type modifiers, (c) derived types (arrays, pointers, functions), (d) user-defined types (struct, union, enum), (e) type conversion rules (integer promotion, usual arithmetic conversion), (f) overflow and underflow behaviour. Write programs illustrating at least five non-obvious type conversion scenarios.</p> <p>Q99. Write a complete, well-commented C program implementing a simple library management system using: structures (for books: title, author, ISBN, copies), file I/O (to persist data between runs), functions (add book, search by title/author, issue book, return book, display all), dynamic memory (to hold the catalog in memory during runtime). Explain the design decisions made.</p> <p>Q100. Explain the compilation process in C in detail. Describe the four stages: (a) Preprocessing — what changes, (b) Compilation — converting to assembly, (c) Assembly — producing object code, (d) Linking — resolving symbols and producing executable. Explain what happens at each stage to the source code. What are <code>.o</code> files, <code>.a</code> (static library) files, and <code>.so</code> (shared library) files? How does the linker resolve external references?</p>","path":["Semester 1","Model Questions: Computer Fundamentals and Programming with C"],"tags":[]},{"location":"semester_1/model_questions/#unit-11-bonus-questions-practice-set","level":2,"title":"Unit 11 — Bonus Questions (Practice Set)","text":"<p>Q101. Write a C program to implement bubble sort, selection sort, and insertion sort on an array of n integers. After each pass of bubble sort, print the state of the array. Analyse the time and space complexity of each.</p> <p>Q102. Explain dangling pointers and wild pointers in C. What causes each? Write small programs that demonstrate both bugs, and then show the corrected versions. What is a smart pointer, and why doesn't C have one natively (C++ does)?</p> <p>Q103. Write a C program to evaluate a postfix expression (e.g., <code>3 4 + 5 *</code>) using a stack implemented as an array. Explain the algorithm step by step with the example.</p> <p>Q104. Explain recursive descent in C by writing a recursive program that evaluates a mathematical expression given as a string (supporting <code>+</code>, <code>-</code>, <code>*</code>, <code>/</code> and parentheses). What is the limitation of this approach?</p> <p>Q105. Write a C program to implement a singly linked list using structures and dynamic memory. Include: insert at beginning, insert at end, insert at position, delete by value, search, display, and free the entire list. Explain why linked lists are preferable to arrays for frequent insertions/deletions.</p> <p>Q106. Explain macro vs. function debate in C in depth. Write a generic <code>SWAP</code> macro and a typed swap function. Show cases where the macro fails (side effects) and the function is safer. When would you still choose a macro?</p> <p>Q107. Write a C program to read a text file and build a frequency table of all words (case-insensitive). Sort the words alphabetically and print each word with its count. Use dynamic memory, strings, structures, and file I/O.</p> <p>Q108. Explain how <code>printf()</code> works internally as a variadic function. Rewrite a simplified <code>my_printf()</code> function that handles <code>%d</code>, <code>%f</code>, <code>%c</code>, and <code>%s</code> format specifiers using <code><stdarg.h></code>.</p> <p>Q109. Write a C program that uses bit manipulation to: (a) set a particular bit, (b) clear a particular bit, (c) toggle a particular bit, (d) check if a number is a power of 2, (e) count the number of set bits (Brian Kernighan's algorithm), (f) reverse the bits of a 32-bit integer.</p> <p>Q110. Write a complete C program for a text-based tic-tac-toe game for two players. Use a 2D array for the board, functions for: displaying the board, checking win/draw conditions, and taking turns. Explain each function. How would you extend this to play against the computer?</p>","path":["Semester 1","Model Questions: Computer Fundamentals and Programming with C"],"tags":[]},{"location":"semester_1/model_questions/#quick-reference-syllabus-unit-map","level":2,"title":"Quick Reference: Syllabus Unit Map","text":"Unit Topics Questions 1 History, Structure, Algorithms, Tokens, Data Types, Storage Classes Q1–Q12 2 Operators, Expressions, Preprocessor, I/O Q13–Q24 3 if-else, switch, while, do-while, for, break, continue, goto Q25–Q34 4 Functions, Arrays, Strings, Recursion Q35–Q45 5 Pointers, Pointer Arithmetic, Dynamic Allocation Q46–Q54 6 enum, struct, union, typedef, Memory Q55–Q64 7 File I/O, fopen/fclose, fread/fwrite, fseek Q65–Q72 8 Application / Integrated Programs Q73–Q80 9 Previous Year Pattern Q81–Q90 10 Long Answer / Essay Q91–Q100 11 Bonus / Advanced Practice Q101–Q110 <p>Exam Strategy</p> <ul> <li>5-mark questions: Answer Q1–Q80 type (pick any sub-part)</li> <li>10-mark questions: Answer Q91–Q100 type (write full essay with programs)</li> <li>Lab Viva: Know programs from Q41, Q43, Q44, Q51, Q63, Q69 thoroughly</li> <li>Always write programs with proper <code>#include</code>, <code>main()</code>, and sample output</li> </ul> <p>Key Programs to Memorise</p> <p>Fibonacci (iterative + recursive) · Factorial · GCD · Prime check · Palindrome · Matrix multiplication · Bubble sort · Dynamic array · File copy · Linked list node (struct + malloc)</p>","path":["Semester 1","Model Questions: Computer Fundamentals and Programming with C"],"tags":[]},{"location":"semester_1/R/","level":1,"title":"R","text":"<p>Files and sub-folders in R.</p>","path":["Semester 1","R"],"tags":[]},{"location":"semester_1/R/#folders","level":2,"title":"Folders","text":"# Folder Link 1 Code Open","path":["Semester 1","R"],"tags":[]},{"location":"semester_1/R/#files","level":2,"title":"Files","text":"# File Link 1 <code>temp.r</code> View Code","path":["Semester 1","R"],"tags":[]},{"location":"semester_1/R/temp/","level":1,"title":"<code>temp.r</code>","text":"","path":["Semester 1","R","temp.r"],"tags":[]},{"location":"semester_1/R/temp/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","temp.r"],"tags":[]},{"location":"semester_1/R/temp/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","temp.r"],"tags":[]},{"location":"semester_1/R/Code/","level":1,"title":"Code","text":"<p>Files and sub-folders in Code.</p>","path":["Semester 1","R","Code"],"tags":[]},{"location":"semester_1/R/Code/#files","level":2,"title":"Files","text":"# File Link 1 <code>R_Code-1.r</code> View Code 2 <code>R_Code-10.r</code> View Code 3 <code>R_Code-11.r</code> View Code 4 <code>R_Code-12.r</code> View Code 5 <code>R_Code-13.r</code> View Code 6 <code>R_Code-14.r</code> View Code 7 <code>R_Code-15.r</code> View Code 8 <code>R_Code-2.r</code> View Code 9 <code>R_Code-4.r</code> View Code 10 <code>R_Code-5.r</code> View Code 11 <code>R_Code-6.r</code> View Code 12 <code>R_Code-7.r</code> View Code 13 <code>R_Code-8.r</code> View Code 14 <code>R_Code-9.r</code> View Code 15 <code>R_Prac-1.r</code> View Code 16 <code>R_Prac-2.r</code> View Code 17 <code>R_Prac-3.r</code> View Code 18 <code>R_Prac-4.r</code> View Code 19 <code>R_Prac-5.r</code> View Code 20 <code>R_Prac-6.r</code> View Code 21 <code>R_code-3.r</code> View Code","path":["Semester 1","R","Code"],"tags":[]},{"location":"semester_1/R/Code/R_Code-1/","level":1,"title":"<code>R_Code-1.r</code>","text":"<p>Problem Statement</p> <p>R allows you to assign values to variables in three different ways.</p>","path":["Semester 1","R","Code","R_Code-1.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-1/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) Date 19 Mar 2026 License MIT","path":["Semester 1","R","Code","R_Code-1.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-1/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_Code-1.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-1/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_Code-1.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-10/","level":1,"title":"<code>R_Code-10.r</code>","text":"<p>Problem Statement</p> <p>Create a numeric vector of student exam scores. Write a single line of code that evaluates these scores and outputs \"Pass\" for any score 50 or above, and \"Fail\" for any score below 50.</p>","path":["Semester 1","R","Code","R_Code-10.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-10/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) Date 20 Mar 2026 License MIT","path":["Semester 1","R","Code","R_Code-10.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-10/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_Code-10.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-10/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_Code-10.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-11/","level":1,"title":"<code>R_Code-11.r</code>","text":"<p>Problem Statement</p> <p>Write a while loop that starts with a multiplier of 1. The loop should multiply the current multiplier by 4, assign it to a result variable, and print the result. The loop should exit if the result exceeds 100; otherwise, increment the multiplier by 1.</p>","path":["Semester 1","R","Code","R_Code-11.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-11/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) Date 20 Mar 2026 License MIT","path":["Semester 1","R","Code","R_Code-11.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-11/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_Code-11.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-11/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_Code-11.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-12/","level":1,"title":"<code>R_Code-12.r</code>","text":"<p>Problem Statement</p> <p>Write a custom function named calculate_area that takes two parameters: length and width. The width parameter should have a default value of 5. The function should print the product of the two parameters. Finally, call your function passing only the value 12 for the length.</p>","path":["Semester 1","R","Code","R_Code-12.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-12/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) Date 20 Mar 2026 License MIT","path":["Semester 1","R","Code","R_Code-12.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-12/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_Code-12.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-12/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_Code-12.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-13/","level":1,"title":"<code>R_Code-13.r</code>","text":"<p>Problem Statement</p> <p>Create a list named student_record containing a string, an integer, and a numeric vector of two grades. Then, add the logical value TRUE to the end of the list, ensuring the original student_record variable is updated. Print the final list.</p>","path":["Semester 1","R","Code","R_Code-13.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-13/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) Date 20 Mar 2026 License MIT","path":["Semester 1","R","Code","R_Code-13.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-13/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_Code-13.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-13/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_Code-13.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-14/","level":1,"title":"<code>R_Code-14.r</code>","text":"<p>Problem Statement</p> <p>Write an if...else if...else block that evaluates a newly created temperature variable. * If the temperature is strictly greater than 30, print: \"30+ is too hot!\" * If the temperature is between 20 and 30 (inclusive), print: \"Perfect weather.\" * Otherwise, print: \"It is quite cold.\"</p>","path":["Semester 1","R","Code","R_Code-14.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-14/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) Date 20 Mar 2026 License MIT","path":["Semester 1","R","Code","R_Code-14.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-14/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_Code-14.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-14/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_Code-14.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-15/","level":1,"title":"<code>R_Code-15.r</code>","text":"","path":["Semester 1","R","Code","R_Code-15.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-15/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_Code-15.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-15/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_Code-15.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-2/","level":1,"title":"<code>R_Code-2.r</code>","text":"<p>Problem Statement</p> <p>How do you declare an explicitly integer variable (e.g., the number 14) so that its class returns \"integer\" instead of the default floating-point \"numeric\"?</p>","path":["Semester 1","R","Code","R_Code-2.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-2/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) Date 19 Mar 2026 License MIT","path":["Semester 1","R","Code","R_Code-2.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-2/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_Code-2.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-2/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_Code-2.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-4/","level":1,"title":"<code>R_Code-4.r</code>","text":"<p>Problem Statement</p> <p>Write a standard if...else block that checks if a variable named age is greater than 18. If the condition is true, print \"You are eligible to vote.\", otherwise print \"You cannot vote.\".</p>","path":["Semester 1","R","Code","R_Code-4.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-4/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) Date 19 Mar 2026 License MIT","path":["Semester 1","R","Code","R_Code-4.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-4/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_Code-4.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-4/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_Code-4.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-5/","level":1,"title":"<code>R_Code-5.r</code>","text":"<p>Problem Statement</p> <p>You have a vector of numbers: x <- c(12, 9, 23, 14). Use R's shorthand ifelse() function to output \"EVEN\" if a number in the vector is divisible by 2 (x %% 2 == 0), and \"ODD\" if it is not.</p>","path":["Semester 1","R","Code","R_Code-5.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-5/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) Date 19 Mar 2026 License MIT","path":["Semester 1","R","Code","R_Code-5.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-5/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_Code-5.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-5/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_Code-5.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-6/","level":1,"title":"<code>R_Code-6.r</code>","text":"<p>Problem Statement</p> <p>Write a while loop with a number variable starting at 1. The loop should print the number and increment it by 1, but you must include an if statement with a break command to stop the loop's execution exactly when number == 6</p>","path":["Semester 1","R","Code","R_Code-6.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-6/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) Date 19 Mar 2026 License MIT","path":["Semester 1","R","Code","R_Code-6.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-6/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_Code-6.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-6/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_Code-6.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-7/","level":1,"title":"<code>R_Code-7.r</code>","text":"<p>Problem Statement</p> <p>Create a numerical vector containing the sequence of numbers from 1 to 5 using the : operator. Then, use the rep() function with the times argument to repeat that entire sequence exactly 2 times.</p>","path":["Semester 1","R","Code","R_Code-7.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-7/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) Date 19 Mar 2026 License MIT","path":["Semester 1","R","Code","R_Code-7.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-7/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_Code-7.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-7/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_Code-7.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-8/","level":1,"title":"<code>R_Code-8.r</code>","text":"<p>Problem Statement</p> <p>Create a list named list1 containing the number 24, the string \"Sabby\", the float 5.4, and the string \"Nepal\". Then, write the code using the append() function to add the number 3.14 to the very end of this list.</p>","path":["Semester 1","R","Code","R_Code-8.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-8/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) Date 19 Mar 2026 License MIT","path":["Semester 1","R","Code","R_Code-8.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-8/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_Code-8.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-8/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_Code-8.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-9/","level":1,"title":"<code>R_Code-9.r</code>","text":"<p>Problem Statement</p> <p>Define a function called power that takes two parameters, a and b. Give a a default value of 2. The function should print the result of a raised to the power of b (a^b).</p>","path":["Semester 1","R","Code","R_Code-9.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-9/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) Date 19 Mar 2026 License MIT","path":["Semester 1","R","Code","R_Code-9.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-9/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_Code-9.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-9/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_Code-9.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-1/","level":1,"title":"<code>R_Prac-1.r</code>","text":"<p>Problem Statement</p> <p>Write a R program to print numbers from 1 to 5.</p>","path":["Semester 1","R","Code","R_Prac-1.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-1/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) Date 25 Mar 2026 License MIT","path":["Semester 1","R","Code","R_Prac-1.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-1/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_Prac-1.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-1/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_Prac-1.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-2/","level":1,"title":"<code>R_Prac-2.r</code>","text":"<p>Problem Statement</p> <p>Check whether a number is even or odd.</p>","path":["Semester 1","R","Code","R_Prac-2.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-2/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) Date 25 Mar 2026 License MIT","path":["Semester 1","R","Code","R_Prac-2.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-2/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_Prac-2.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-2/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_Prac-2.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-3/","level":1,"title":"<code>R_Prac-3.r</code>","text":"<p>Problem Statement</p> <p>Print elements of vector using for loop.</p>","path":["Semester 1","R","Code","R_Prac-3.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-3/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) Date 25 Mar 2026 License MIT","path":["Semester 1","R","Code","R_Prac-3.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-3/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_Prac-3.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-3/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_Prac-3.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-4/","level":1,"title":"<code>R_Prac-4.r</code>","text":"<p>Problem Statement</p> <p>Program to add two numbers in R program.</p>","path":["Semester 1","R","Code","R_Prac-4.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-4/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) Date 25 Mar 2026 License MIT","path":["Semester 1","R","Code","R_Prac-4.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-4/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_Prac-4.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-4/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_Prac-4.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-5/","level":1,"title":"<code>R_Prac-5.r</code>","text":"<p>Problem Statement</p> <p>Program to count the number of even numbers stored inside a vector of numbers.</p>","path":["Semester 1","R","Code","R_Prac-5.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-5/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) Date 25 Mar 2026 License MIT","path":["Semester 1","R","Code","R_Prac-5.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-5/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_Prac-5.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-5/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_Prac-5.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-6/","level":1,"title":"<code>R_Prac-6.r</code>","text":"<p>Problem Statement</p> <p>Program to access List elements, modify a List Element, add items to List, Remove items from a List, length of List.</p>","path":["Semester 1","R","Code","R_Prac-6.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-6/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) Date 25 Mar 2026 License MIT","path":["Semester 1","R","Code","R_Prac-6.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-6/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_Prac-6.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-6/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_Prac-6.r"],"tags":[]},{"location":"semester_1/R/Code/R_code-3/","level":1,"title":"<code>R_code-3.r</code>","text":"<p>Problem Statement</p> <p>Assume you have a variable company <- \"Programiz\". Write a line of code using the paste0() function to print \"Welcome toProgramiz\" ensuring there is no default space between the string and the variable.</p>","path":["Semester 1","R","Code","R_code-3.r"],"tags":[]},{"location":"semester_1/R/Code/R_code-3/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) Date 19 Mar 2026 License MIT","path":["Semester 1","R","Code","R_code-3.r"],"tags":[]},{"location":"semester_1/R/Code/R_code-3/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_code-3.r"],"tags":[]},{"location":"semester_1/R/Code/R_code-3/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_code-3.r"],"tags":[]},{"location":"semester_1/assignment-primary/","level":1,"title":"Assignment Primary","text":"<p>Files and sub-folders in Assignment Primary.</p>","path":["Semester 1","Assignment primary","Assignment Primary"],"tags":[]},{"location":"semester_1/assignment-primary/#files","level":2,"title":"Files","text":"# File Link 1 <code>assignment-p-01.c</code> View Code 2 <code>assignment-p-02.c</code> View Code 3 <code>assignment-p-03.c</code> View Code 4 <code>assignment-p-04.c</code> View Code 5 <code>assignment-p-05.c</code> View Code 6 <code>assignment-p-06.c</code> View Code 7 <code>assignment-p-07.c</code> View Code 8 <code>assignment-p-08.c</code> View Code 9 <code>assignment-p-09.c</code> View Code 10 <code>assignment-p-10.c</code> View Code 11 <code>assignment-p-11.c</code> View Code 12 <code>assignment-p-12_v1.c</code> View Code 13 <code>assignment-p-12_v2.c</code> View Code 14 <code>assignment-p-13.c</code> View Code 15 <code>assignment-p-14_v1.c</code> View Code 16 <code>assignment-p-14_v2.c</code> View Code 17 <code>assignment-p-15.c</code> View Code","path":["Semester 1","Assignment primary","Assignment Primary"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-01/","level":1,"title":"<code>assignment-p-01.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that includes a user-defined function named isPrime with the signature int isPrime(int num); The function should take an integer as a parameter and return 1 if the number is prime and 0 otherwise.</p>","path":["Semester 1","Assignment primary","assignment-p-01.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-01/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment primary","assignment-p-01.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-01/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment primary","assignment-p-01.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-01/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment primary","assignment-p-01.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-02/","level":1,"title":"<code>assignment-p-02.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that includes a user-defined function named isArmstrong with the signature int isArmstrong(int num);. An Armstrong number is a number that is equal to the sum of its own digits each raised to the power of the number of digits. For example, 153 is an Armstrong number because 1^3 + 5^3 + 3^3 = 153</p>","path":["Semester 1","Assignment primary","assignment-p-02.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-02/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment primary","assignment-p-02.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-02/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment primary","assignment-p-02.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-02/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment primary","assignment-p-02.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-03/","level":1,"title":"<code>assignment-p-03.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that includes a user-defined function named isPerfect with the signature int isPerfect(int num);. A perfect number is a positive integer that is equal to the sum of its proper divisors, excluding itself. For example, 28 is a perfect number because the sum of its divisors (1, 2, 4, 7, 14) equals 28.</p>","path":["Semester 1","Assignment primary","assignment-p-03.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-03/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Assignment primary","assignment-p-03.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-03/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment primary","assignment-p-03.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-03/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment primary","assignment-p-03.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-04/","level":1,"title":"<code>assignment-p-04.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that takes an integer input representing a month (1 to 12) and a year. Use a switch statement to display the number of days in that month, considering leap years.</p>","path":["Semester 1","Assignment primary","assignment-p-04.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-04/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment primary","assignment-p-04.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-04/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment primary","assignment-p-04.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-04/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment primary","assignment-p-04.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-05/","level":1,"title":"<code>assignment-p-05.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that defines an array of integers, and includes a user-defined function named reverseArray with the signature void reverseArray(int arr[], int size);. The function should reverse the elements of the array.</p>","path":["Semester 1","Assignment primary","assignment-p-05.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-05/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment primary","assignment-p-05.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-05/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment primary","assignment-p-05.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-05/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment primary","assignment-p-05.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-06/","level":1,"title":"<code>assignment-p-06.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that includes a user-defined function named findLargest with the signature int findLargest(int arr[], int size);. The function should take an array of integers and its size, and return the largest element in the array.</p>","path":["Semester 1","Assignment primary","assignment-p-06.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-06/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment primary","assignment-p-06.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-06/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment primary","assignment-p-06.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-06/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment primary","assignment-p-06.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-07/","level":1,"title":"<code>assignment-p-07.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that includes a user-defined function named binarySearch with the signature int binarySearch(int arr[], int size, int target);. The function should perform a binary search on a sorted array of integers and return the index of the target element if found, and -1 otherwise.</p>","path":["Semester 1","Assignment primary","assignment-p-07.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-07/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment primary","assignment-p-07.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-07/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment primary","assignment-p-07.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-07/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment primary","assignment-p-07.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-08/","level":1,"title":"<code>assignment-p-08.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that includes a user-defined function named countSetBits with the signature int countSetBits(int num);. The function should count and return the number of set bits (1s) in the binary representation of the given number.</p>","path":["Semester 1","Assignment primary","assignment-p-08.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-08/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Assignment primary","assignment-p-08.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-08/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment primary","assignment-p-08.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-08/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment primary","assignment-p-08.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-09/","level":1,"title":"<code>assignment-p-09.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that includes a user-defined function named setBit with the signature int setBit(int num, int position);. The function should set the bit at the specified position (0-indexed) to 1 and return the modified number.</p>","path":["Semester 1","Assignment primary","assignment-p-09.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-09/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Assignment primary","assignment-p-09.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-09/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment primary","assignment-p-09.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-09/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment primary","assignment-p-09.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-10/","level":1,"title":"<code>assignment-p-10.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that defines a structure Rectangle with attributes length and width. Include a user-defined function named calculateArea with the signature float calculateArea(struct Rectangle r);. The function should calculate and return the area of the rectangle.</p>","path":["Semester 1","Assignment primary","assignment-p-10.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-10/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Assignment primary","assignment-p-10.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-10/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment primary","assignment-p-10.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-10/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment primary","assignment-p-10.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-11/","level":1,"title":"<code>assignment-p-11.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that defines a structure Student containing the attributes rollNumber, name, and marks. Include a user-defined function named displayStudent with the signature void displayStudent(struct Student s);. The function should display the details of a student.</p>","path":["Semester 1","Assignment primary","assignment-p-11.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-11/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment primary","assignment-p-11.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-11/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment primary","assignment-p-11.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-11/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment primary","assignment-p-11.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-12_v1/","level":1,"title":"<code>assignment-p-12_v1.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that takes multiple integers as command-line arguments and finds the maximum and minimum value among them.</p>","path":["Semester 1","Assignment primary","assignment-p-12_v1.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-12_v1/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment primary","assignment-p-12_v1.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-12_v1/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment primary","assignment-p-12_v1.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-12_v1/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment primary","assignment-p-12_v1.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-12_v2/","level":1,"title":"<code>assignment-p-12_v2.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that takes multiple integers as command-line arguments and finds the maximum and minimum value among them.</p>","path":["Semester 1","Assignment primary","assignment-p-12_v2.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-12_v2/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 06 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment primary","assignment-p-12_v2.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-12_v2/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment primary","assignment-p-12_v2.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-12_v2/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment primary","assignment-p-12_v2.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-13/","level":1,"title":"<code>assignment-p-13.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that accepts a string as a command line argument and includes a user- defined function named isPalindrome with the signature int isPalindrome(char str[]);. The function should check if the given string is a palindrome and return 1 if it is, and 0 otherwise.</p>","path":["Semester 1","Assignment primary","assignment-p-13.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-13/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment primary","assignment-p-13.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-13/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment primary","assignment-p-13.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-13/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment primary","assignment-p-13.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-14_v1/","level":1,"title":"<code>assignment-p-14_v1.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that opens its own source code file, reads its contents, and then prints the contents to the console.</p>","path":["Semester 1","Assignment primary","assignment-p-14_v1.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-14_v1/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment primary","assignment-p-14_v1.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-14_v1/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment primary","assignment-p-14_v1.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-14_v1/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment primary","assignment-p-14_v1.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-14_v2/","level":1,"title":"<code>assignment-p-14_v2.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that opens its own source code file, reads its contents, and then prints the contents to the console.</p>","path":["Semester 1","Assignment primary","assignment-p-14_v2.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-14_v2/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment primary","assignment-p-14_v2.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-14_v2/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment primary","assignment-p-14_v2.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-14_v2/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment primary","assignment-p-14_v2.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-15/","level":1,"title":"<code>assignment-p-15.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that reads a sequence of integers from a file named 'input.txt'. This program should segregate the odd numbers from the even numbers and store the odd numbers in a new file named 'ODDFile.txt' while storing the even numbers in another file named 'EVENFile.txt'</p>","path":["Semester 1","Assignment primary","assignment-p-15.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-15/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment primary","assignment-p-15.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-15/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment primary","assignment-p-15.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-15/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment primary","assignment-p-15.c"],"tags":[]},{"location":"semester_1/assignment-secondary/","level":1,"title":"Assignment Secondary","text":"<p>Files and sub-folders in Assignment Secondary.</p>","path":["Semester 1","Assignment secondary","Assignment Secondary"],"tags":[]},{"location":"semester_1/assignment-secondary/#files","level":2,"title":"Files","text":"# File Link 1 <code>assignment-s-01.c</code> View Code 2 <code>assignment-s-02.c</code> View Code 3 <code>assignment-s-03.c</code> View Code 4 <code>assignment-s-04.c</code> View Code 5 <code>assignment-s-05.c</code> View Code 6 <code>assignment-s-06.c</code> View Code 7 <code>assignment-s-07.c</code> View Code 8 <code>assignment-s-08.c</code> View Code 9 <code>assignment-s-09.c</code> View Code 10 <code>assignment-s-10.c</code> View Code 11 <code>assignment-s-11.c</code> View Code 12 <code>assignment-s-12.c</code> View Code 13 <code>assignment-s-13-1.c</code> View Code 14 <code>assignment-s-13-2.c</code> View Code 15 <code>assignment-s-14.c</code> View Code 16 <code>assignment-s-15.c</code> View Code 17 <code>assignment-s-16.c</code> View Code 18 <code>assignment-s-17.c</code> View Code 19 <code>assignment-s-18.c</code> View Code 20 <code>assignment-s-19.c</code> View Code 21 <code>assignment-s-20.c</code> View Code 22 <code>assignment-s-21.c</code> View Code 23 <code>assignment-s-22.c</code> View Code 24 <code>assignment-s-23.c</code> View Code 25 <code>assignment-s-24.c</code> View Code","path":["Semester 1","Assignment secondary","Assignment Secondary"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-01/","level":1,"title":"<code>assignment-s-01.c</code>","text":"<p>Problem Statement</p> <p>Write a program to compute the sum and product of digits of an integer using user defined functions.</p>","path":["Semester 1","Assignment secondary","assignment-s-01.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-01/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Assignment secondary","assignment-s-01.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-01/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-01.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-01/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-01.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-02/","level":1,"title":"<code>assignment-s-02.c</code>","text":"<p>Problem Statement</p> <p>Write a program to reverse a non-negative integer using a function.</p>","path":["Semester 1","Assignment secondary","assignment-s-02.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-02/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Assignment secondary","assignment-s-02.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-02/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-02.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-02/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-02.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-03/","level":1,"title":"<code>assignment-s-03.c</code>","text":"<p>Problem Statement</p> <p>Write a program to compute the sum of the first n terms of the series using a function: S=1−2+3−4+5−6+…</p>","path":["Semester 1","Assignment secondary","assignment-s-03.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-03/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Assignment secondary","assignment-s-03.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-03/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-03.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-03/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-03.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-04/","level":1,"title":"<code>assignment-s-04.c</code>","text":"<p>Problem Statement</p> <p>Write a function to check whether a number is prime or not. Use the same function to generate all prime numbers less than 100.</p>","path":["Semester 1","Assignment secondary","assignment-s-04.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-04/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment secondary","assignment-s-04.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-04/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-04.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-04/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-04.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-05/","level":1,"title":"<code>assignment-s-05.c</code>","text":"<p>Problem Statement</p> <p>Write a function to check whether a given string is a palindrome. Use this function to determine whether an entered string is Palindrome.</p>","path":["Semester 1","Assignment secondary","assignment-s-05.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-05/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment secondary","assignment-s-05.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-05/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-05.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-05/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-05.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-06/","level":1,"title":"<code>assignment-s-06.c</code>","text":"<p>Problem Statement</p> <p>Write a program using a function to compute and display all factors of a given number.</p>","path":["Semester 1","Assignment secondary","assignment-s-06.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-06/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Assignment secondary","assignment-s-06.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-06/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-06.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-06/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-06.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-07/","level":1,"title":"<code>assignment-s-07.c</code>","text":"<p>Problem Statement</p> <p>Write a program to swap two numbers using a macro (#define).</p>","path":["Semester 1","Assignment secondary","assignment-s-07.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-07/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Assignment secondary","assignment-s-07.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-07/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-07.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-07/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-07.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-08/","level":1,"title":"<code>assignment-s-08.c</code>","text":"<p>Problem Statement</p> <p>Write a program that counts the number of occurrences of each alphabet (A-Z, a-z) in the text entered using Command-Line Arguments.</p>","path":["Semester 1","Assignment secondary","assignment-s-08.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-08/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Assignment secondary","assignment-s-08.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-08/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-08.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-08/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-08.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-09/","level":1,"title":"<code>assignment-s-09.c</code>","text":"<p>Problem Statement</p> <p>Write a program to swap two numbers using pointers (user-defined function).</p>","path":["Semester 1","Assignment secondary","assignment-s-09.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-09/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Assignment secondary","assignment-s-09.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-09/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-09.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-09/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-09.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-10/","level":1,"title":"<code>assignment-s-10.c</code>","text":"<p>Problem Statement</p> <p>Write a program to swap two numbers using pointers (user-defined function).</p>","path":["Semester 1","Assignment secondary","assignment-s-10.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-10/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Assignment secondary","assignment-s-10.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-10/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-10.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-10/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-10.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-11/","level":1,"title":"<code>assignment-s-11.c</code>","text":"<p>Problem Statement</p> <p>Write a program that takes the radius of a circle as input, passes it to a function that computes area and circumference, and displays results in main().</p>","path":["Semester 1","Assignment secondary","assignment-s-11.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-11/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Assignment secondary","assignment-s-11.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-11/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-11.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-11/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-11.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-12/","level":1,"title":"<code>assignment-s-12.c</code>","text":"<p>Problem Statement</p> <p>Write a program to find the sum of n elements entered by the user. Use dynamic memory allocation (malloc() or calloc()).</p>","path":["Semester 1","Assignment secondary","assignment-s-12.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-12/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Assignment secondary","assignment-s-12.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-12/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-12.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-12/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-12.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-13-1/","level":1,"title":"<code>assignment-s-13-1.c</code>","text":"<p>Problem Statement</p> <p>Write a function that reverses the elements of an array in place, using only a single pointer argument, and return void.</p>","path":["Semester 1","Assignment secondary","assignment-s-13-1.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-13-1/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 19 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment secondary","assignment-s-13-1.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-13-1/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-13-1.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-13-1/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-13-1.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-13-2/","level":1,"title":"<code>assignment-s-13-2.c</code>","text":"<p>Problem Statement</p> <p>Write a function that reverses the elements of an array in place, using only a single pointer argument, and return void.</p>","path":["Semester 1","Assignment secondary","assignment-s-13-2.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-13-2/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 19 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment secondary","assignment-s-13-2.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-13-2/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-13-2.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-13-2/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-13-2.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-14/","level":1,"title":"<code>assignment-s-14.c</code>","text":"<p>Problem Statement</p> <p>Write a menu-driven program to perform the following string operations: a. Show address of each character b. Concatenate two strings without using strcat() c. Concatenate two strings using strcat() d. Compare two strings e. Find string length using pointers f. Convert lowercase to uppercase g. Convert uppercase to lowercase h. Count number of vowels i. Reverse the string</p>","path":["Semester 1","Assignment secondary","assignment-s-14.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-14/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 20 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment secondary","assignment-s-14.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-14/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-14.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-14/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-14.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-15/","level":1,"title":"<code>assignment-s-15.c</code>","text":"<p>Problem Statement</p> <p>Write a program to merge two sorted integer arrays to form a single sorted array.</p>","path":["Semester 1","Assignment secondary","assignment-s-15.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-15/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 21 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment secondary","assignment-s-15.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-15/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-15.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-15/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-15.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-16/","level":1,"title":"<code>assignment-s-16.c</code>","text":"<p>Problem Statement</p> <p>Write a program that reads 10 integers into an array (using pointers), and prints the array in ascending and descending order.</p>","path":["Semester 1","Assignment secondary","assignment-s-16.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-16/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 21 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment secondary","assignment-s-16.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-16/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-16.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-16/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-16.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-17/","level":1,"title":"<code>assignment-s-17.c</code>","text":"<p>Problem Statement</p> <p>Write a program to display the Fibonacci series (i) using recursion (ii) using iteration</p>","path":["Semester 1","Assignment secondary","assignment-s-17.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-17/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 21 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment secondary","assignment-s-17.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-17/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-17.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-17/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-17.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-18/","level":1,"title":"<code>assignment-s-18.c</code>","text":"<p>Problem Statement</p> <p>Write a program to calculate the factorial of a number (i) using recursion (ii) using iteration</p>","path":["Semester 1","Assignment secondary","assignment-s-18.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-18/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 22 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment secondary","assignment-s-18.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-18/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-18.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-18/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-18.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-19/","level":1,"title":"<code>assignment-s-19.c</code>","text":"<p>Problem Statement</p> <p>Write a program to calculate the GCD of two numbers (i) using recursion (ii) without recursion</p>","path":["Semester 1","Assignment secondary","assignment-s-19.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-19/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 22 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment secondary","assignment-s-19.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-19/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-19.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-19/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-19.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-20/","level":1,"title":"<code>assignment-s-20.c</code>","text":"<p>Problem Statement</p> <p>Write a menu-driven program to perform the following matrix operations using 2-D arrays and functions: a. Sum b. Difference c. Product d. Transpose</p>","path":["Semester 1","Assignment secondary","assignment-s-20.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-20/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 22 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment secondary","assignment-s-20.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-20/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-20.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-20/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-20.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-21/","level":1,"title":"<code>assignment-s-21.c</code>","text":"<p>Problem Statement</p> <p>Write a program to copy the contents of a text file to another file, after removing all white spaces (spaces, tabs, newlines).</p>","path":["Semester 1","Assignment secondary","assignment-s-21.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-21/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 21 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment secondary","assignment-s-21.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-21/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-21.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-21/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-21.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-22/","level":1,"title":"<code>assignment-s-22.c</code>","text":"<p>Problem Statement</p> <p>Write a program using structures to add two distances in meter-kilometer format.</p>","path":["Semester 1","Assignment secondary","assignment-s-22.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-22/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Assignment secondary","assignment-s-22.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-22/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-22.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-22/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-22.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-23/","level":1,"title":"<code>assignment-s-23.c</code>","text":"<p>Problem Statement</p> <p>Write a program to add two complex numbers using structures.</p>","path":["Semester 1","Assignment secondary","assignment-s-23.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-23/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Assignment secondary","assignment-s-23.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-23/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-23.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-23/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-23.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-24/","level":1,"title":"<code>assignment-s-24.c</code>","text":"<p>Problem Statement</p> <p>Write a program to calculate the difference between two time periods using structures.</p>","path":["Semester 1","Assignment secondary","assignment-s-24.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-24/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Assignment secondary","assignment-s-24.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-24/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-24.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-24/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-24.c"],"tags":[]},{"location":"semester_1/eduincs_exam/","level":1,"title":"Eduincs Exam","text":"<p>Files and sub-folders in Eduincs Exam.</p>","path":["Semester 1","Eduincs exam","Eduincs Exam"],"tags":[]},{"location":"semester_1/eduincs_exam/#folders","level":2,"title":"Folders","text":"# Folder Link 1 Paper 1 05 03 2026 Open 2 Paper 2 05 03 2026 Open","path":["Semester 1","Eduincs exam","Eduincs Exam"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-1_05-03-2026/","level":1,"title":"Paper 1 05 03 2026","text":"<p>Files and sub-folders in Paper 1 05 03 2026.</p>","path":["Semester 1","Eduincs exam","Paper 1 05 03 2026"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-1_05-03-2026/#files","level":2,"title":"Files","text":"# File Link 1 <code>Qn-10.c</code> View Code 2 <code>Qn-8.c</code> View Code 3 <code>Qn-9.c</code> View Code","path":["Semester 1","Eduincs exam","Paper 1 05 03 2026"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-1_05-03-2026/Qn-10/","level":1,"title":"<code>Qn-10.c</code>","text":"<p>Problem Statement</p> <p>Write a C program to find the maximum element in each row of a 2D array and print the result.</p>","path":["Semester 1","Eduincs exam","Paper 1 05 03 2026","Qn-10.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-1_05-03-2026/Qn-10/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 06 Mar 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Eduincs exam","Paper 1 05 03 2026","Qn-10.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-1_05-03-2026/Qn-10/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Eduincs exam","Paper 1 05 03 2026","Qn-10.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-1_05-03-2026/Qn-10/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Eduincs exam","Paper 1 05 03 2026","Qn-10.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-1_05-03-2026/Qn-8/","level":1,"title":"<code>Qn-8.c</code>","text":"<p>Problem Statement</p> <p>Write a C program to find the transpose of a given square matrix using 2D array. The transpose of a matrix is obtained by swapping the rows and columns of the matrix</p>","path":["Semester 1","Eduincs exam","Paper 1 05 03 2026","Qn-8.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-1_05-03-2026/Qn-8/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 06 Mar 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Eduincs exam","Paper 1 05 03 2026","Qn-8.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-1_05-03-2026/Qn-8/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Eduincs exam","Paper 1 05 03 2026","Qn-8.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-1_05-03-2026/Qn-8/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Eduincs exam","Paper 1 05 03 2026","Qn-8.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-1_05-03-2026/Qn-9/","level":1,"title":"<code>Qn-9.c</code>","text":"<p>Problem Statement</p> <p>Write a C program to find sum of all elements in a given 2D array.</p>","path":["Semester 1","Eduincs exam","Paper 1 05 03 2026","Qn-9.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-1_05-03-2026/Qn-9/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 06 Mar 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Eduincs exam","Paper 1 05 03 2026","Qn-9.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-1_05-03-2026/Qn-9/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Eduincs exam","Paper 1 05 03 2026","Qn-9.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-1_05-03-2026/Qn-9/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Eduincs exam","Paper 1 05 03 2026","Qn-9.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-2_05-03-2026/","level":1,"title":"Paper 2 05 03 2026","text":"<p>Files and sub-folders in Paper 2 05 03 2026.</p>","path":["Semester 1","Eduincs exam","Paper 2 05 03 2026"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-2_05-03-2026/#files","level":2,"title":"Files","text":"# File Link 1 <code>Qn-11.c</code> View Code 2 <code>Qn-3.c</code> View Code 3 <code>Qn-4.c</code> View Code","path":["Semester 1","Eduincs exam","Paper 2 05 03 2026"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-2_05-03-2026/Qn-11/","level":1,"title":"<code>Qn-11.c</code>","text":"<p>Problem Statement</p> <p>Write a program to explain, how an array of stucture can you defined and accessed.</p>","path":["Semester 1","Eduincs exam","Paper 2 05 03 2026","Qn-11.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-2_05-03-2026/Qn-11/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 06 Mar 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Eduincs exam","Paper 2 05 03 2026","Qn-11.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-2_05-03-2026/Qn-11/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Eduincs exam","Paper 2 05 03 2026","Qn-11.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-2_05-03-2026/Qn-11/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Eduincs exam","Paper 2 05 03 2026","Qn-11.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-2_05-03-2026/Qn-3/","level":1,"title":"<code>Qn-3.c</code>","text":"<p>Problem Statement</p> <p>Write a program to search an element from an array using linear search technique using malloc() and free() for memory allocation and deallocation.</p>","path":["Semester 1","Eduincs exam","Paper 2 05 03 2026","Qn-3.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-2_05-03-2026/Qn-3/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 06 Mar 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Eduincs exam","Paper 2 05 03 2026","Qn-3.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-2_05-03-2026/Qn-3/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Eduincs exam","Paper 2 05 03 2026","Qn-3.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-2_05-03-2026/Qn-3/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Eduincs exam","Paper 2 05 03 2026","Qn-3.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-2_05-03-2026/Qn-4/","level":1,"title":"<code>Qn-4.c</code>","text":"<p>Problem Statement</p> <p>Write a program to check a string is palindrome or not using user-defined function.</p>","path":["Semester 1","Eduincs exam","Paper 2 05 03 2026","Qn-4.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-2_05-03-2026/Qn-4/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 06 Mar 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Eduincs exam","Paper 2 05 03 2026","Qn-4.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-2_05-03-2026/Qn-4/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Eduincs exam","Paper 2 05 03 2026","Qn-4.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-2_05-03-2026/Qn-4/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Eduincs exam","Paper 2 05 03 2026","Qn-4.c"],"tags":[]},{"location":"semester_1/internal-practice/","level":1,"title":"Internal Practice","text":"<p>Files and sub-folders in Internal Practice.</p>","path":["Semester 1","Internal practice","Internal Practice"],"tags":[]},{"location":"semester_1/internal-practice/#files","level":2,"title":"Files","text":"# File Link 1 <code>IP-01.c</code> View Code 2 <code>IP-02.c</code> View Code 3 <code>IP-03.c</code> View Code 4 <code>IP-04.c</code> View Code 5 <code>IP-05.c</code> View Code 6 <code>IP-06.c</code> View Code 7 <code>IP-07.c</code> View Code 8 <code>IP-08.c</code> View Code 9 <code>IP-09.c</code> View Code 10 <code>IP-10.c</code> View Code 11 <code>IP-11.c</code> View Code 12 <code>IP-12.c</code> View Code 13 <code>IP-13.c</code> View Code 14 <code>IP-14.c</code> View Code 15 <code>IP-15.c</code> View Code 16 <code>IP-16.c</code> View Code 17 <code>IP-17.c</code> View Code 18 <code>IP-18.c</code> View Code 19 <code>IP-19.c</code> View Code 20 <code>IP-20.c</code> View Code","path":["Semester 1","Internal practice","Internal Practice"],"tags":[]},{"location":"semester_1/internal-practice/IP-01/","level":1,"title":"<code>IP-01.c</code>","text":"<p>Problem Statement</p> <p>Write a program to compute the sum and product of digits of an integer using user defined functions.</p>","path":["Semester 1","Internal practice","IP-01.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-01/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Internal practice","IP-01.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-01/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Internal practice","IP-01.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-01/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Internal practice","IP-01.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-02/","level":1,"title":"<code>IP-02.c</code>","text":"<p>Problem Statement</p> <p>Write a program to reverse a non-negative integer using a function.</p>","path":["Semester 1","Internal practice","IP-02.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-02/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Internal practice","IP-02.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-02/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Internal practice","IP-02.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-02/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Internal practice","IP-02.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-03/","level":1,"title":"<code>IP-03.c</code>","text":"<p>Problem Statement</p> <p>Write a program to compute the sum of the first n terms of the series using a function: S=1−2+3−4+5−6+…</p>","path":["Semester 1","Internal practice","IP-03.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-03/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Internal practice","IP-03.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-03/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Internal practice","IP-03.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-03/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Internal practice","IP-03.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-04/","level":1,"title":"<code>IP-04.c</code>","text":"<p>Problem Statement</p> <p>Write a function to check whether a number is prime or not. Use the same function to generate all prime numbers less than 100.</p>","path":["Semester 1","Internal practice","IP-04.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-04/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 03 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Internal practice","IP-04.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-04/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Internal practice","IP-04.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-04/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Internal practice","IP-04.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-05/","level":1,"title":"<code>IP-05.c</code>","text":"<p>Problem Statement</p> <p>Write a function to check whether a given string is a palindrome. Use this function to determine whether an entered string is Palindrome.</p>","path":["Semester 1","Internal practice","IP-05.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-05/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 03 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Internal practice","IP-05.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-05/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Internal practice","IP-05.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-05/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Internal practice","IP-05.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-06/","level":1,"title":"<code>IP-06.c</code>","text":"<p>Problem Statement</p> <p>Write a program using a function to compute and display all factors of a given number.</p>","path":["Semester 1","Internal practice","IP-06.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-06/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Internal practice","IP-06.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-06/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Internal practice","IP-06.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-06/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Internal practice","IP-06.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-07/","level":1,"title":"<code>IP-07.c</code>","text":"<p>Problem Statement</p> <p>Write a program to swap two numbers using pointers (user-defined function).</p>","path":["Semester 1","Internal practice","IP-07.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-07/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Internal practice","IP-07.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-07/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Internal practice","IP-07.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-07/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Internal practice","IP-07.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-08/","level":1,"title":"<code>IP-08.c</code>","text":"<p>Problem Statement</p> <p>Write a program that takes the radius of a circle as input, passes it to a function that computes area and circumference, and displays results in main().</p>","path":["Semester 1","Internal practice","IP-08.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-08/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Internal practice","IP-08.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-08/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Internal practice","IP-08.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-08/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Internal practice","IP-08.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-09/","level":1,"title":"<code>IP-09.c</code>","text":"<p>Problem Statement</p> <p>Write a program to find the sum of n elements entered by the user. Use dynamic memory allocation (malloc() or calloc()).</p>","path":["Semester 1","Internal practice","IP-09.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-09/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Internal practice","IP-09.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-09/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Internal practice","IP-09.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-09/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Internal practice","IP-09.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-10/","level":1,"title":"<code>IP-10.c</code>","text":"<p>Problem Statement</p> <p>Write a function that reverses the elements of an array in place, using only a single pointer argument, and return void.</p>","path":["Semester 1","Internal practice","IP-10.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-10/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 03 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Internal practice","IP-10.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-10/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Internal practice","IP-10.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-10/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Internal practice","IP-10.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-11/","level":1,"title":"<code>IP-11.c</code>","text":"<p>Problem Statement</p> <p>Write a program to merge two sorted integer arrays to form a single sorted array.</p>","path":["Semester 1","Internal practice","IP-11.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-11/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 03 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Internal practice","IP-11.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-11/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Internal practice","IP-11.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-11/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Internal practice","IP-11.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-12/","level":1,"title":"<code>IP-12.c</code>","text":"<p>Problem Statement</p> <p>Write a program that reads 10 integers into an array (using pointers), and prints the array in ascending and descending order.</p>","path":["Semester 1","Internal practice","IP-12.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-12/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 03 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Internal practice","IP-12.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-12/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Internal practice","IP-12.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-12/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Internal practice","IP-12.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-13/","level":1,"title":"<code>IP-13.c</code>","text":"<p>Problem Statement</p> <p>Write a program to display the Fibonacci series (i) using recursion (ii) using iteration</p>","path":["Semester 1","Internal practice","IP-13.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-13/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 03 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Internal practice","IP-13.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-13/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Internal practice","IP-13.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-13/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Internal practice","IP-13.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-14/","level":1,"title":"<code>IP-14.c</code>","text":"<p>Problem Statement</p> <p>Write a program to calculate the factorial of a number (i) using recursion (ii) using iteration</p>","path":["Semester 1","Internal practice","IP-14.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-14/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 03 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Internal practice","IP-14.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-14/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Internal practice","IP-14.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-14/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Internal practice","IP-14.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-15/","level":1,"title":"<code>IP-15.c</code>","text":"<p>Problem Statement</p> <p>Write a program to calculate the GCD of two numbers (i) using recursion (ii) without recursion</p>","path":["Semester 1","Internal practice","IP-15.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-15/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 03 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Internal practice","IP-15.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-15/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Internal practice","IP-15.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-15/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Internal practice","IP-15.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-16/","level":1,"title":"<code>IP-16.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that includes a user-defined function named isArmstrong with the signature int isArmstrong(int num);. An Armstrong number is a number that is equal to the sum of its own digits each raised to the power of the number of digits. For example, 153 is an Armstrong number because 1^3 + 5^3 + 3^3 = 153</p>","path":["Semester 1","Internal practice","IP-16.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-16/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 03 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Internal practice","IP-16.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-16/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Internal practice","IP-16.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-16/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Internal practice","IP-16.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-17/","level":1,"title":"<code>IP-17.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that includes a user-defined function named isPerfect with the signature int isPerfect(int num);. A perfect number is a positive integer that is equal to the sum of its proper divisors, excluding itself. For example, 28 is a perfect number because the sum of its divisors (1, 2, 4, 7, 14) equals 28.</p>","path":["Semester 1","Internal practice","IP-17.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-17/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Internal practice","IP-17.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-17/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Internal practice","IP-17.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-17/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Internal practice","IP-17.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-18/","level":1,"title":"<code>IP-18.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that includes a user-defined function named findLargest with the signature int findLargest(int arr[], int size);. The function should take an array of integers and its size, and return the largest element in the array.</p>","path":["Semester 1","Internal practice","IP-18.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-18/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 03 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Internal practice","IP-18.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-18/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Internal practice","IP-18.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-18/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Internal practice","IP-18.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-19/","level":1,"title":"<code>IP-19.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that includes a user-defined function named binarySearch with the signature int binarySearch(int arr[], int size, int target);. The function should perform a binary search on a sorted array of integers and return the index of the target element if found, and -1 otherwise.</p>","path":["Semester 1","Internal practice","IP-19.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-19/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 03 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Internal practice","IP-19.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-19/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Internal practice","IP-19.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-19/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Internal practice","IP-19.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-20/","level":1,"title":"<code>IP-20.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that defines an array of integers, and includes a user-defined function named reverseArray with the signature void reverseArray(int arr[], int size);. The function should reverse the elements of the array.</p>","path":["Semester 1","Internal practice","IP-20.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-20/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 03 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Internal practice","IP-20.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-20/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Internal practice","IP-20.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-20/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Internal practice","IP-20.c"],"tags":[]},{"location":"semester_1/khurapati-idea/","level":1,"title":"Khurapati Idea","text":"<p>Files and sub-folders in Khurapati Idea.</p>","path":["Semester 1","Khurapati idea","Khurapati Idea"],"tags":[]},{"location":"semester_1/khurapati-idea/#files","level":2,"title":"Files","text":"# File Link 1 <code>KI001.c</code> View Code 2 <code>KI002.c</code> View Code 3 <code>KI003.c</code> View Code 4 <code>KI004.c</code> View Code","path":["Semester 1","Khurapati idea","Khurapati Idea"],"tags":[]},{"location":"semester_1/khurapati-idea/KI001/","level":1,"title":"<code>KI001.c</code>","text":"","path":["Semester 1","Khurapati idea","KI001.c"],"tags":[]},{"location":"semester_1/khurapati-idea/KI001/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Khurapati idea","KI001.c"],"tags":[]},{"location":"semester_1/khurapati-idea/KI001/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Khurapati idea","KI001.c"],"tags":[]},{"location":"semester_1/khurapati-idea/KI001/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Khurapati idea","KI001.c"],"tags":[]},{"location":"semester_1/khurapati-idea/KI002/","level":1,"title":"<code>KI002.c</code>","text":"<p>Problem Statement</p> <p>Plan - checking for edge case</p>","path":["Semester 1","Khurapati idea","KI002.c"],"tags":[]},{"location":"semester_1/khurapati-idea/KI002/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Khurapati idea","KI002.c"],"tags":[]},{"location":"semester_1/khurapati-idea/KI002/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Khurapati idea","KI002.c"],"tags":[]},{"location":"semester_1/khurapati-idea/KI002/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Khurapati idea","KI002.c"],"tags":[]},{"location":"semester_1/khurapati-idea/KI003/","level":1,"title":"<code>KI003.c</code>","text":"<p>Problem Statement</p> <p>Bubble sort (with swap)</p>","path":["Semester 1","Khurapati idea","KI003.c"],"tags":[]},{"location":"semester_1/khurapati-idea/KI003/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 24 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Khurapati idea","KI003.c"],"tags":[]},{"location":"semester_1/khurapati-idea/KI003/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Khurapati idea","KI003.c"],"tags":[]},{"location":"semester_1/khurapati-idea/KI003/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Khurapati idea","KI003.c"],"tags":[]},{"location":"semester_1/khurapati-idea/KI004/","level":1,"title":"<code>KI004.c</code>","text":"<p>Problem Statement</p> <p>Trying to write code only with emoji</p>","path":["Semester 1","Khurapati idea","KI004.c"],"tags":[]},{"location":"semester_1/khurapati-idea/KI004/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Khurapati idea","KI004.c"],"tags":[]},{"location":"semester_1/khurapati-idea/KI004/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Khurapati idea","KI004.c"],"tags":[]},{"location":"semester_1/khurapati-idea/KI004/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Khurapati idea","KI004.c"],"tags":[]},{"location":"semester_1/letusc/","level":1,"title":"Letusc","text":"<p>Files and sub-folders in Letusc.</p>","path":["Semester 1","Letusc"],"tags":[]},{"location":"semester_1/letusc/#files","level":2,"title":"Files","text":"# File Link 1 <code>luc001.c</code> View Code 2 <code>luc002.c</code> View Code 3 <code>luc003.c</code> View Code 4 <code>luc004.c</code> View Code 5 <code>luc005.c</code> View Code 6 <code>luc006.c</code> View Code 7 <code>luc007.c</code> View Code 8 <code>luc008.c</code> View Code 9 <code>luc009.c</code> View Code 10 <code>luc010.c</code> View Code 11 <code>luc011.c</code> View Code 12 <code>luc012.c</code> View Code 13 <code>luc013.c</code> View Code 14 <code>luc014.c</code> View Code 15 <code>luc015.c</code> View Code 16 <code>luc016.c</code> View Code 17 <code>luc017.c</code> View Code 18 <code>luc018-logic.c</code> View Code 19 <code>luc018.c</code> View Code 20 <code>luc019.c</code> View Code 21 <code>luc020.c</code> View Code 22 <code>luc021.c</code> View Code 23 <code>luc022.c</code> View Code 24 <code>luc023.c</code> View Code 25 <code>luc024.c</code> View Code 26 <code>luc025.c</code> View Code 27 <code>luc026.c</code> View Code 28 <code>luc027.c</code> View Code 29 <code>luc028.c</code> View Code 30 <code>luc029.c</code> View Code 31 <code>luc030.c</code> View Code 32 <code>luc031-logic.c</code> View Code 33 <code>luc031.c</code> View Code 34 <code>luc032.c</code> View Code 35 <code>luc033.c</code> View Code 36 <code>luc034.c</code> View Code 37 <code>luc035.c</code> View Code 38 <code>luc036.c</code> View Code 39 <code>luc037.c</code> View Code 40 <code>luc038.c</code> View Code 41 <code>luc039.c</code> View Code 42 <code>luc040-logic.c</code> View Code 43 <code>luc040.c</code> View Code 44 <code>luc041.c</code> View Code 45 <code>luc042.c</code> View Code 46 <code>luc043.c</code> View Code 47 <code>luc044.c</code> View Code 48 <code>luc045.c</code> View Code 49 <code>luc046.c</code> View Code 50 <code>luc047.c</code> View Code 51 <code>luc048.c</code> View Code 52 <code>luc049.c</code> View Code 53 <code>luc050.c</code> View Code 54 <code>luc051.c</code> View Code 55 <code>luc052.c</code> View Code 56 <code>luc053.c</code> View Code 57 <code>luc054.c</code> View Code 58 <code>luc055.c</code> View Code 59 <code>luc056.c</code> View Code 60 <code>luc057.c</code> View Code 61 <code>luc058.c</code> View Code 62 <code>luc059.c</code> View Code 63 <code>luc060.c</code> View Code 64 <code>luc061.c</code> View Code 65 <code>luc062.c</code> View Code 66 <code>luc063.c</code> View Code 67 <code>luc064.c</code> View Code 68 <code>luc065.c</code> View Code 69 <code>luc066.c</code> View Code 70 <code>luc067.c</code> View Code 71 <code>luc068.c</code> View Code 72 <code>luc069.c</code> View Code 73 <code>luc070.c</code> View Code 74 <code>luc071.c</code> View Code 75 <code>luc072.c</code> View Code 76 <code>luc073.c</code> View Code 77 <code>luc074.c</code> View Code 78 <code>luc075.c</code> View Code 79 <code>luc076.c</code> View Code 80 <code>luc077.c</code> View Code 81 <code>luc078.c</code> View Code 82 <code>luc079.c</code> View Code 83 <code>luc080.c</code> View Code 84 <code>luc081.c</code> View Code 85 <code>luc082.c</code> View Code 86 <code>luc083.c</code> View Code 87 <code>luc084.c</code> View Code 88 <code>luc085.c</code> View Code 89 <code>luc086.c</code> View Code 90 <code>luc087.c</code> View Code 91 <code>luc088.c</code> View Code 92 <code>luc089.c</code> View Code 93 <code>luc090.c</code> View Code 94 <code>luc091.c</code> View Code 95 <code>luc092.c</code> View Code 96 <code>luc093.c</code> View Code 97 <code>luc094.c</code> View Code 98 <code>luc095.c</code> View Code 99 <code>luc096.c</code> View Code 100 <code>luc097.c</code> View Code 101 <code>luc098.c</code> View Code 102 <code>luc099.c</code> View Code 103 <code>luc100.c</code> View Code 104 <code>luc101.c</code> View Code 105 <code>luc102.c</code> View Code 106 <code>luc103.c</code> View Code 107 <code>luc104.c</code> View Code 108 <code>luc105.c</code> View Code 109 <code>luc106.c</code> View Code 110 <code>luc107.c</code> View Code 111 <code>luc108.c</code> View Code 112 <code>luc109.c</code> View Code 113 <code>luc110.c</code> View Code 114 <code>luc111.c</code> View Code 115 <code>luc112.c</code> View Code 116 <code>luc113.c</code> View Code 117 <code>luc114.c</code> View Code 118 <code>luc115.c</code> View Code 119 <code>luc116.c</code> View Code 120 <code>luc117.c</code> View Code 121 <code>luc118.c</code> View Code 122 <code>luc119.c</code> View Code 123 <code>lucproblem001.c</code> View Code 124 <code>lucproblem002.c</code> View Code 125 <code>lucproblem003.c</code> View Code 126 <code>lucproblem004.c</code> View Code 127 <code>lucproblem005.c</code> View Code 128 <code>lucproblem006.c</code> View Code 129 <code>lucproblem007.c</code> View Code 130 <code>lucproblem008.c</code> View Code 131 <code>lucproblem009.c</code> View Code 132 <code>lucproblem010-complex.c</code> View Code 133 <code>lucproblem010.c</code> View Code 134 <code>lucproblem011.c</code> View Code 135 <code>lucproblem012.c</code> View Code 136 <code>lucproblem013.c</code> View Code 137 <code>lucproblem014-short.c</code> View Code 138 <code>lucproblem014.c</code> View Code 139 <code>lucproblem015.c</code> View Code 140 <code>lucproblem016.c</code> View Code","path":["Semester 1","Letusc"],"tags":[]},{"location":"semester_1/letusc/luc001/","level":1,"title":"<code>luc001.c</code>","text":"<p>Problem Statement</p> <p>Temperature of a city in fahrenheit degrees is input through the keyboard. WAP to convert this temperature into Centigrade degrees.</p>","path":["Semester 1","Letusc","luc001.c"],"tags":[]},{"location":"semester_1/letusc/luc001/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc001.c"],"tags":[]},{"location":"semester_1/letusc/luc001/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc001.c"],"tags":[]},{"location":"semester_1/letusc/luc001/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc001.c"],"tags":[]},{"location":"semester_1/letusc/luc002/","level":1,"title":"<code>luc002.c</code>","text":"<p>Problem Statement</p> <p>The length and breadth of a rectangle and radius of a circle are input through the keyboard. Write a program to calculate the area and perimeter of the rectangle, and the area and circumference of the circle.</p>","path":["Semester 1","Letusc","luc002.c"],"tags":[]},{"location":"semester_1/letusc/luc002/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc002.c"],"tags":[]},{"location":"semester_1/letusc/luc002/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc002.c"],"tags":[]},{"location":"semester_1/letusc/luc002/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc002.c"],"tags":[]},{"location":"semester_1/letusc/luc003/","level":1,"title":"<code>luc003.c</code>","text":"<p>Problem Statement</p> <p>Paper of size AO has dimensions 1189 mm x 841 mm. Each subsequent size A(n) is defined as A(n-1) cut in half, parallel to its shorter sides. Thus, paper of size A1 would have dimensions 841 mm x 594 mm. Write a program to calculate and print paper sizes A0,� A1,�A2,�...�A8.</p>","path":["Semester 1","Letusc","luc003.c"],"tags":[]},{"location":"semester_1/letusc/luc003/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc003.c"],"tags":[]},{"location":"semester_1/letusc/luc003/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc003.c"],"tags":[]},{"location":"semester_1/letusc/luc003/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc003.c"],"tags":[]},{"location":"semester_1/letusc/luc004/","level":1,"title":"<code>luc004.c</code>","text":"<p>Problem Statement</p> <p>If a five digit number is input through the keyboard, write a program to calculate the sum of it's digit. (Hint : Use the modulus operator %)</p>","path":["Semester 1","Letusc","luc004.c"],"tags":[]},{"location":"semester_1/letusc/luc004/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc004.c"],"tags":[]},{"location":"semester_1/letusc/luc004/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc004.c"],"tags":[]},{"location":"semester_1/letusc/luc004/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc004.c"],"tags":[]},{"location":"semester_1/letusc/luc005/","level":1,"title":"<code>luc005.c</code>","text":"<p>Problem Statement</p> <p>Write a program to recive Cartesian co-ordinates (x, y) of a point and convert them into Polar co-ordinates (r, phi) Hint : r = sqrt (x^2 + y^2) and phi = tan^-1 (y/x)</p>","path":["Semester 1","Letusc","luc005.c"],"tags":[]},{"location":"semester_1/letusc/luc005/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc005.c"],"tags":[]},{"location":"semester_1/letusc/luc005/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc005.c"],"tags":[]},{"location":"semester_1/letusc/luc005/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc005.c"],"tags":[]},{"location":"semester_1/letusc/luc006/","level":1,"title":"<code>luc006.c</code>","text":"<p>Problem Statement</p> <p>Write a program to receive values of latitude (L1, L2) and longitude (G1, G2), in degrees, of two places on the earth and output the distance (D) between them in nautical miles. The formula for distance in nautical miles is : D = 3963 cos^-1(sin L1 sin L2 + cos L1 cos L2 * cos(G2 - G1))</p>","path":["Semester 1","Letusc","luc006.c"],"tags":[]},{"location":"semester_1/letusc/luc006/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc006.c"],"tags":[]},{"location":"semester_1/letusc/luc006/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc006.c"],"tags":[]},{"location":"semester_1/letusc/luc006/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc006.c"],"tags":[]},{"location":"semester_1/letusc/luc007/","level":1,"title":"<code>luc007.c</code>","text":"<p>Problem Statement</p> <p>Wind-chill factor is the felt air temperature on exposed skin due to wind. The wind-chill temperature is always lower than the air temperature, and is calculated as per the following formula. wcf = 35.74 + 0.6215t + (0.4275t - 35.75) * v^0.16 Where t is temperature and v is wind velocity. Write a program to receive values of t and v and calcualate wind-chill factor (wcf).</p>","path":["Semester 1","Letusc","luc007.c"],"tags":[]},{"location":"semester_1/letusc/luc007/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc007.c"],"tags":[]},{"location":"semester_1/letusc/luc007/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc007.c"],"tags":[]},{"location":"semester_1/letusc/luc007/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc007.c"],"tags":[]},{"location":"semester_1/letusc/luc008/","level":1,"title":"<code>luc008.c</code>","text":"<p>Problem Statement</p> <p>If value of an angle is input through the keyboard, write a program to print all its trigonometric ratios.</p>","path":["Semester 1","Letusc","luc008.c"],"tags":[]},{"location":"semester_1/letusc/luc008/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc008.c"],"tags":[]},{"location":"semester_1/letusc/luc008/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc008.c"],"tags":[]},{"location":"semester_1/letusc/luc008/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc008.c"],"tags":[]},{"location":"semester_1/letusc/luc009/","level":1,"title":"<code>luc009.c</code>","text":"<p>Problem Statement</p> <p>Two numbers are input through the keyboard into two locations C and D. Write a program to interchange the contents of C and D.</p>","path":["Semester 1","Letusc","luc009.c"],"tags":[]},{"location":"semester_1/letusc/luc009/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc009.c"],"tags":[]},{"location":"semester_1/letusc/luc009/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc009.c"],"tags":[]},{"location":"semester_1/letusc/luc009/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc009.c"],"tags":[]},{"location":"semester_1/letusc/luc010/","level":1,"title":"<code>luc010.c</code>","text":"<p>Problem Statement</p> <p>A five-digit number is entered through the keyboard. Write a program to obtain the reversed number and to etermine whether the original and reversed numbers are equal or not.</p>","path":["Semester 1","Letusc","luc010.c"],"tags":[]},{"location":"semester_1/letusc/luc010/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc010.c"],"tags":[]},{"location":"semester_1/letusc/luc010/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc010.c"],"tags":[]},{"location":"semester_1/letusc/luc010/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc010.c"],"tags":[]},{"location":"semester_1/letusc/luc011/","level":1,"title":"<code>luc011.c</code>","text":"<p>Problem Statement</p> <p>If ages of Ram, Shyam and Ajay are input through the keyboard, write a program to determine the youngest of the three.</p>","path":["Semester 1","Letusc","luc011.c"],"tags":[]},{"location":"semester_1/letusc/luc011/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc011.c"],"tags":[]},{"location":"semester_1/letusc/luc011/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc011.c"],"tags":[]},{"location":"semester_1/letusc/luc011/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc011.c"],"tags":[]},{"location":"semester_1/letusc/luc012/","level":1,"title":"<code>luc012.c</code>","text":"<p>Problem Statement</p> <p>Write a program to check whether a triangle is valid or not, if three angles of the triangle are entered through the keyboard. A triangle is valid if the sum of all the three angles is equal to 180 degrees.</p>","path":["Semester 1","Letusc","luc012.c"],"tags":[]},{"location":"semester_1/letusc/luc012/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc012.c"],"tags":[]},{"location":"semester_1/letusc/luc012/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc012.c"],"tags":[]},{"location":"semester_1/letusc/luc012/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc012.c"],"tags":[]},{"location":"semester_1/letusc/luc013/","level":1,"title":"<code>luc013.c</code>","text":"<p>Problem Statement</p> <p>Write a program to find the absolute value of a number entered through the keyboard.</p>","path":["Semester 1","Letusc","luc013.c"],"tags":[]},{"location":"semester_1/letusc/luc013/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc013.c"],"tags":[]},{"location":"semester_1/letusc/luc013/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc013.c"],"tags":[]},{"location":"semester_1/letusc/luc013/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc013.c"],"tags":[]},{"location":"semester_1/letusc/luc014/","level":1,"title":"<code>luc014.c</code>","text":"<p>Problem Statement</p> <p>Given the length and breadth of a rectangle, write a program to find whether the area of the rectangle is greater than it's perimeter. For example, the area of the rectangle with length = 5 and breadth = 4 is greater than its perimeter.</p>","path":["Semester 1","Letusc","luc014.c"],"tags":[]},{"location":"semester_1/letusc/luc014/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc014.c"],"tags":[]},{"location":"semester_1/letusc/luc014/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc014.c"],"tags":[]},{"location":"semester_1/letusc/luc014/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc014.c"],"tags":[]},{"location":"semester_1/letusc/luc015/","level":1,"title":"<code>luc015.c</code>","text":"<p>Problem Statement</p> <p>Given three points (x1, y1), (x2, y2), and (x3, y3), write a program to check if the three poins fall on one straight line.</p>","path":["Semester 1","Letusc","luc015.c"],"tags":[]},{"location":"semester_1/letusc/luc015/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc015.c"],"tags":[]},{"location":"semester_1/letusc/luc015/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc015.c"],"tags":[]},{"location":"semester_1/letusc/luc015/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc015.c"],"tags":[]},{"location":"semester_1/letusc/luc016/","level":1,"title":"<code>luc016.c</code>","text":"<p>Problem Statement</p> <p>Given the coordiantes (x, y) of center of a circle and its radius, write a program that will determine whether a point lies inside the circle, on the circle or outside the circle. (Hint : Use sqrt() and pow() functions.)</p>","path":["Semester 1","Letusc","luc016.c"],"tags":[]},{"location":"semester_1/letusc/luc016/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc016.c"],"tags":[]},{"location":"semester_1/letusc/luc016/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc016.c"],"tags":[]},{"location":"semester_1/letusc/luc016/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc016.c"],"tags":[]},{"location":"semester_1/letusc/luc017/","level":1,"title":"<code>luc017.c</code>","text":"<p>Problem Statement</p> <p>Given a point (x, y), write a program to find out if it lies on X-axis, Y-axis or origin.</p>","path":["Semester 1","Letusc","luc017.c"],"tags":[]},{"location":"semester_1/letusc/luc017/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc017.c"],"tags":[]},{"location":"semester_1/letusc/luc017/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc017.c"],"tags":[]},{"location":"semester_1/letusc/luc017/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc017.c"],"tags":[]},{"location":"semester_1/letusc/luc018-logic/","level":1,"title":"<code>luc018-logic.c</code>","text":"<p>Problem Statement</p> <p>According to Gregorian calender, it was Monday on the date 01/01/01. Write a program to find out what is the day on 1st January of any input year.</p>","path":["Semester 1","Letusc","luc018-logic.c"],"tags":[]},{"location":"semester_1/letusc/luc018-logic/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc018-logic.c"],"tags":[]},{"location":"semester_1/letusc/luc018-logic/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc018-logic.c"],"tags":[]},{"location":"semester_1/letusc/luc018-logic/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc018-logic.c"],"tags":[]},{"location":"semester_1/letusc/luc018/","level":1,"title":"<code>luc018.c</code>","text":"<p>Problem Statement</p> <p>According to Gregorian calender, it was Monday on the date 01/01/01. if any year is input through the keyboard write a program to find out what is the day on 1st January of this year.</p>","path":["Semester 1","Letusc","luc018.c"],"tags":[]},{"location":"semester_1/letusc/luc018/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc018.c"],"tags":[]},{"location":"semester_1/letusc/luc018/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc018.c"],"tags":[]},{"location":"semester_1/letusc/luc018/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc018.c"],"tags":[]},{"location":"semester_1/letusc/luc019/","level":1,"title":"<code>luc019.c</code>","text":"<p>Problem Statement</p> <p>If the length of three sides of a triangle are entered through the keyboard, write a program to check whether the triangle is an isosceles, an equilateral, a scalene or a right-angled triangle.</p>","path":["Semester 1","Letusc","luc019.c"],"tags":[]},{"location":"semester_1/letusc/luc019/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc019.c"],"tags":[]},{"location":"semester_1/letusc/luc019/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc019.c"],"tags":[]},{"location":"semester_1/letusc/luc019/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc019.c"],"tags":[]},{"location":"semester_1/letusc/luc020/","level":1,"title":"<code>luc020.c</code>","text":"<p>Problem Statement</p> <p>In digital world colors are specified in Red-Green-Blue (RGB) format, with values of R, G, B varying on an integer scale from 0 to 255. In print publishing the colors are mentioned in Cyan-Magenta-Yellow-Black (CMYK) format, with values of C, M, Y, and K varying on a real scale from 0.0 to 1.0. Write a program that converts RGB color to CMYK color as per the following formulae: White = Max(Red/255, Green/255, Blue/255) Cyan = (White-Red/255) / White Magenta = (White-Green/255) / White Yellow = (White-Blue/255) / White Black = 1 - White Note that if the RGB values are all 0, then the CMY values are all 0 and the K value is 1.</p>","path":["Semester 1","Letusc","luc020.c"],"tags":[]},{"location":"semester_1/letusc/luc020/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc020.c"],"tags":[]},{"location":"semester_1/letusc/luc020/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc020.c"],"tags":[]},{"location":"semester_1/letusc/luc020/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc020.c"],"tags":[]},{"location":"semester_1/letusc/luc021/","level":1,"title":"<code>luc021.c</code>","text":"<p>Problem Statement</p> <p>A certain grade of steel is graded according to the following conditions: (i) Hardness must be greater than 50 (ii) Carbon content must be less than 0.7 (iii) Tensile strength must be greater than 5600 The grades are as follows: Grade is 10 if all three conditions are met Grade is 9 if conditions (i) and (ii) are met Grade is 8 if conditions (ii) and (iii) are met Grade is 7 if conditions (i) and (iii) are met Grade is 6 if only one condition is met Grade is 5 if none of the conditions are met Write a program, which will require the user to give values of hardness, carbon content and tensile strength of the steel under consideration and output the grade of the steel.</p>","path":["Semester 1","Letusc","luc021.c"],"tags":[]},{"location":"semester_1/letusc/luc021/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc021.c"],"tags":[]},{"location":"semester_1/letusc/luc021/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc021.c"],"tags":[]},{"location":"semester_1/letusc/luc021/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc021.c"],"tags":[]},{"location":"semester_1/letusc/luc022/","level":1,"title":"<code>luc022.c</code>","text":"<p>Problem Statement</p> <p>The Body Mass Index (BMI) is defined as ratio of weight of the person (in Kilograms) to square of the height (in meters). Write a program that receives weight and height, calculate the BMI, and reports the BMI catagory as per the following table. BMI Catagory BMI Starvation < 15 Anorexic 15.1 to 17.5 Underweight 17.6 to 18.5 Ideal 18.6 to 24.9 Overweight 25 to 25.9 Obese 30 to 39.9 Morbidly Obese >= 40</p>","path":["Semester 1","Letusc","luc022.c"],"tags":[]},{"location":"semester_1/letusc/luc022/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc022.c"],"tags":[]},{"location":"semester_1/letusc/luc022/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc022.c"],"tags":[]},{"location":"semester_1/letusc/luc022/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc022.c"],"tags":[]},{"location":"semester_1/letusc/luc023/","level":1,"title":"<code>luc023.c</code>","text":"<p>Problem Statement</p> <p>Using conditional operators determine : (1) Whether the character entered through the keyboard is a lower case alphabet or not. (2) Whether a character entered through the keyboard is a special symbol or not.</p>","path":["Semester 1","Letusc","luc023.c"],"tags":[]},{"location":"semester_1/letusc/luc023/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc023.c"],"tags":[]},{"location":"semester_1/letusc/luc023/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc023.c"],"tags":[]},{"location":"semester_1/letusc/luc023/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc023.c"],"tags":[]},{"location":"semester_1/letusc/luc024/","level":1,"title":"<code>luc024.c</code>","text":"<p>Problem Statement</p> <p>Write a program using conditional operators to determine whether a year entered through the keyboard is a leap year or not.</p>","path":["Semester 1","Letusc","luc024.c"],"tags":[]},{"location":"semester_1/letusc/luc024/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc024.c"],"tags":[]},{"location":"semester_1/letusc/luc024/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc024.c"],"tags":[]},{"location":"semester_1/letusc/luc024/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc024.c"],"tags":[]},{"location":"semester_1/letusc/luc025/","level":1,"title":"<code>luc025.c</code>","text":"<p>Problem Statement</p> <p>Write a program to find the greates of the three numbers entered through the keyboard. Use conditional operators.</p>","path":["Semester 1","Letusc","luc025.c"],"tags":[]},{"location":"semester_1/letusc/luc025/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc025.c"],"tags":[]},{"location":"semester_1/letusc/luc025/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc025.c"],"tags":[]},{"location":"semester_1/letusc/luc025/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc025.c"],"tags":[]},{"location":"semester_1/letusc/luc026/","level":1,"title":"<code>luc026.c</code>","text":"<p>Problem Statement</p> <p>Write a program to recieve value of an angle in degreesand check whether sum of squares of sine and cosine of this angle is equal to 1.</p>","path":["Semester 1","Letusc","luc026.c"],"tags":[]},{"location":"semester_1/letusc/luc026/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc026.c"],"tags":[]},{"location":"semester_1/letusc/luc026/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc026.c"],"tags":[]},{"location":"semester_1/letusc/luc026/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc026.c"],"tags":[]},{"location":"semester_1/letusc/luc027/","level":1,"title":"<code>luc027.c</code>","text":"","path":["Semester 1","Letusc","luc027.c"],"tags":[]},{"location":"semester_1/letusc/luc027/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc027.c"],"tags":[]},{"location":"semester_1/letusc/luc027/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc027.c"],"tags":[]},{"location":"semester_1/letusc/luc027/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc027.c"],"tags":[]},{"location":"semester_1/letusc/luc028/","level":1,"title":"<code>luc028.c</code>","text":"<p>Problem Statement</p> <p>Write a program to print all the ASCII values and their equivalent characters using a while loop. The ASCII may vary from 0 to 255.</p>","path":["Semester 1","Letusc","luc028.c"],"tags":[]},{"location":"semester_1/letusc/luc028/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc028.c"],"tags":[]},{"location":"semester_1/letusc/luc028/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc028.c"],"tags":[]},{"location":"semester_1/letusc/luc028/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc028.c"],"tags":[]},{"location":"semester_1/letusc/luc029/","level":1,"title":"<code>luc029.c</code>","text":"<p>Problem Statement</p> <p>Write a program to print out all Armstrong numbers between 100 and 500. If sum of cubes of each digit of the number is equal to the number itself, then the number is called an Armstrong number. For example, 153 = (1 * 1 * 1) + (5 * 5 * 5) + (3 * 3 * 3)</p>","path":["Semester 1","Letusc","luc029.c"],"tags":[]},{"location":"semester_1/letusc/luc029/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc029.c"],"tags":[]},{"location":"semester_1/letusc/luc029/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc029.c"],"tags":[]},{"location":"semester_1/letusc/luc029/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc029.c"],"tags":[]},{"location":"semester_1/letusc/luc030/","level":1,"title":"<code>luc030.c</code>","text":"<p>Problem Statement</p> <p>Write a program for a matchstick game being played between the computer and a user. Your program should ensure that the computer always wins. Rules for the game are as follows : - There are 21 matchsticks. - The computer asks the player to pick 1, 2, 3, or 4 matchsticks. - After the person picks, the computer does its picking. - Whoever is forced to pick up the last matchstick loses the game.</p>","path":["Semester 1","Letusc","luc030.c"],"tags":[]},{"location":"semester_1/letusc/luc030/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc030.c"],"tags":[]},{"location":"semester_1/letusc/luc030/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc030.c"],"tags":[]},{"location":"semester_1/letusc/luc030/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc030.c"],"tags":[]},{"location":"semester_1/letusc/luc031-logic/","level":1,"title":"<code>luc031-logic.c</code>","text":"<p>Problem Statement</p> <p>Write a program to enter numbers till the user wants. At the end it should display the count of positive, negative and zeros entered.</p>","path":["Semester 1","Letusc","luc031-logic.c"],"tags":[]},{"location":"semester_1/letusc/luc031-logic/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc031-logic.c"],"tags":[]},{"location":"semester_1/letusc/luc031-logic/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc031-logic.c"],"tags":[]},{"location":"semester_1/letusc/luc031-logic/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc031-logic.c"],"tags":[]},{"location":"semester_1/letusc/luc031/","level":1,"title":"<code>luc031.c</code>","text":"<p>Problem Statement</p> <p>Write a program to enter numbers till the user wants. At the end it should display the count of positive, negative and zeros entered.</p>","path":["Semester 1","Letusc","luc031.c"],"tags":[]},{"location":"semester_1/letusc/luc031/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc031.c"],"tags":[]},{"location":"semester_1/letusc/luc031/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc031.c"],"tags":[]},{"location":"semester_1/letusc/luc031/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc031.c"],"tags":[]},{"location":"semester_1/letusc/luc032/","level":1,"title":"<code>luc032.c</code>","text":"<p>Problem Statement</p> <p>Write a program to recieve an integer and find its octal equivalent. (Hint : To obtain octal equivalent of an integer, Divide it continuously by 8 till dividend does not become zero, then write the remainders obtained in reverse derection.)</p>","path":["Semester 1","Letusc","luc032.c"],"tags":[]},{"location":"semester_1/letusc/luc032/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc032.c"],"tags":[]},{"location":"semester_1/letusc/luc032/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc032.c"],"tags":[]},{"location":"semester_1/letusc/luc032/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc032.c"],"tags":[]},{"location":"semester_1/letusc/luc033/","level":1,"title":"<code>luc033.c</code>","text":"<p>Problem Statement</p> <p>Write a program to find the range of a set of numbers entered through the keyboard. Range is the difference between the smallest and biggest number in the list.</p>","path":["Semester 1","Letusc","luc033.c"],"tags":[]},{"location":"semester_1/letusc/luc033/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc033.c"],"tags":[]},{"location":"semester_1/letusc/luc033/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc033.c"],"tags":[]},{"location":"semester_1/letusc/luc033/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc033.c"],"tags":[]},{"location":"semester_1/letusc/luc034/","level":1,"title":"<code>luc034.c</code>","text":"<p>Problem Statement</p> <p>Write a program to print the multiplication table of the number entered by the user. The table should get displayed in the following form : 29 * 1 = 29 29 * 2 = 58</p>","path":["Semester 1","Letusc","luc034.c"],"tags":[]},{"location":"semester_1/letusc/luc034/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc034.c"],"tags":[]},{"location":"semester_1/letusc/luc034/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc034.c"],"tags":[]},{"location":"semester_1/letusc/luc034/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc034.c"],"tags":[]},{"location":"semester_1/letusc/luc035/","level":1,"title":"<code>luc035.c</code>","text":"<p>Problem Statement</p> <p>According to a study, the approximate level of intelligence of a person can be calculated using the following formula. i = 2 + (y + 0.5x) write a program that will produce a table of values of i, y and x, where y varies from 1 to 6, and, for each value of y, x varies from 5.5 to 12.5 in steps of 0.5</p>","path":["Semester 1","Letusc","luc035.c"],"tags":[]},{"location":"semester_1/letusc/luc035/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc035.c"],"tags":[]},{"location":"semester_1/letusc/luc035/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc035.c"],"tags":[]},{"location":"semester_1/letusc/luc035/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc035.c"],"tags":[]},{"location":"semester_1/letusc/luc036/","level":1,"title":"<code>luc036.c</code>","text":"<p>Problem Statement</p> <p>When interest compounds q times per year at an annual rate of r % for n years, the principle p compounds to an amount a as per the following formula a = p (1 + r / q) ^ nq Write a program to read 10 sets of p, r, n & q and calculate the corresponding as'</p>","path":["Semester 1","Letusc","luc036.c"],"tags":[]},{"location":"semester_1/letusc/luc036/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc036.c"],"tags":[]},{"location":"semester_1/letusc/luc036/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc036.c"],"tags":[]},{"location":"semester_1/letusc/luc036/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc036.c"],"tags":[]},{"location":"semester_1/letusc/luc037/","level":1,"title":"<code>luc037.c</code>","text":"<p>Problem Statement</p> <p>The natural logarithm can be approximated by the following series. (x-1)/x + 1/2 ((x-1)/x)^2 + 1/2 ((x-1)/x)^3 + 1/2 ((x-1)/x)^4 + ... If x is input through the keyboard, write a program to calculate the sum of the first seven terms of this series.</p>","path":["Semester 1","Letusc","luc037.c"],"tags":[]},{"location":"semester_1/letusc/luc037/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc037.c"],"tags":[]},{"location":"semester_1/letusc/luc037/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc037.c"],"tags":[]},{"location":"semester_1/letusc/luc037/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc037.c"],"tags":[]},{"location":"semester_1/letusc/luc038/","level":1,"title":"<code>luc038.c</code>","text":"<p>Problem Statement</p> <p>Write a program to generate all Pythagorean Triplets with slide length less than or equal to 30.</p>","path":["Semester 1","Letusc","luc038.c"],"tags":[]},{"location":"semester_1/letusc/luc038/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc038.c"],"tags":[]},{"location":"semester_1/letusc/luc038/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc038.c"],"tags":[]},{"location":"semester_1/letusc/luc038/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc038.c"],"tags":[]},{"location":"semester_1/letusc/luc039/","level":1,"title":"<code>luc039.c</code>","text":"<p>Problem Statement</p> <p>Population of a town today is 100000. The population has increased steadily at the rate of 10% per year for last 10 years. Write a program to determine the population at the end of each year in the last decade.</p>","path":["Semester 1","Letusc","luc039.c"],"tags":[]},{"location":"semester_1/letusc/luc039/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc039.c"],"tags":[]},{"location":"semester_1/letusc/luc039/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc039.c"],"tags":[]},{"location":"semester_1/letusc/luc039/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc039.c"],"tags":[]},{"location":"semester_1/letusc/luc040-logic/","level":1,"title":"<code>luc040-logic.c</code>","text":"<p>Problem Statement</p> <p>Ramanujan number (1729) is the smallest number that can be expressed as sum of cubes in two different ways - 1729 can be expressed as 1^3 + 12^3 and 9^3 + 10^3. Write a program to print all such numbers up to a reasonable limit.</p>","path":["Semester 1","Letusc","luc040-logic.c"],"tags":[]},{"location":"semester_1/letusc/luc040-logic/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc040-logic.c"],"tags":[]},{"location":"semester_1/letusc/luc040-logic/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc040-logic.c"],"tags":[]},{"location":"semester_1/letusc/luc040-logic/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc040-logic.c"],"tags":[]},{"location":"semester_1/letusc/luc040/","level":1,"title":"<code>luc040.c</code>","text":"<p>Problem Statement</p> <p>Ramanujan number (1729) is the smallest number that can be expressed as sum of cubes in two different ways - 1729 can be expressed as 1^3 + 12^3 and 9^3 + 10^3. Write a program to print all such numbers up to a reasonable limit.</p>","path":["Semester 1","Letusc","luc040.c"],"tags":[]},{"location":"semester_1/letusc/luc040/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc040.c"],"tags":[]},{"location":"semester_1/letusc/luc040/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc040.c"],"tags":[]},{"location":"semester_1/letusc/luc040/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc040.c"],"tags":[]},{"location":"semester_1/letusc/luc041/","level":1,"title":"<code>luc041.c</code>","text":"<p>Problem Statement</p> <p>Write a program to print 24 hours of day with suitable suffixes like AM, PM, Noon and Midnight.</p>","path":["Semester 1","Letusc","luc041.c"],"tags":[]},{"location":"semester_1/letusc/luc041/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc041.c"],"tags":[]},{"location":"semester_1/letusc/luc041/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc041.c"],"tags":[]},{"location":"semester_1/letusc/luc041/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc041.c"],"tags":[]},{"location":"semester_1/letusc/luc042/","level":1,"title":"<code>luc042.c</code>","text":"<p>Problem Statement</p> <p>Write a program to produce the following output : 1 2 3 4 5 6 7 8 9 10</p>","path":["Semester 1","Letusc","luc042.c"],"tags":[]},{"location":"semester_1/letusc/luc042/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc042.c"],"tags":[]},{"location":"semester_1/letusc/luc042/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc042.c"],"tags":[]},{"location":"semester_1/letusc/luc042/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc042.c"],"tags":[]},{"location":"semester_1/letusc/luc043/","level":1,"title":"<code>luc043.c</code>","text":"<p>Problem Statement</p> <p>Write a program to find the grace marks for a student using switch. The user should enter the class obtained by the student and the number of subjects he has failed in. Use the following logic. - If the student gets first class and he fails in more than 3 subjects, he does not get any grace, Otherwise, he gets a grace of 5 marks per subject. - If the student gets second class and he fails in more than 2 subjects, he does not get any grace. Otherwise, he gets a grace of 4 marks per subject. - If the student gets third class and he fails in more than 1 subject, then he does not get any grace. Otherwise, he gets a grace of 5 marks.</p>","path":["Semester 1","Letusc","luc043.c"],"tags":[]},{"location":"semester_1/letusc/luc043/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc043.c"],"tags":[]},{"location":"semester_1/letusc/luc043/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc043.c"],"tags":[]},{"location":"semester_1/letusc/luc043/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc043.c"],"tags":[]},{"location":"semester_1/letusc/luc044/","level":1,"title":"<code>luc044.c</code>","text":"<p>Problem Statement</p> <p>Any year is entered through the keyboard. Write a function to determine whether the year is aleap year or not.</p>","path":["Semester 1","Letusc","luc044.c"],"tags":[]},{"location":"semester_1/letusc/luc044/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc044.c"],"tags":[]},{"location":"semester_1/letusc/luc044/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc044.c"],"tags":[]},{"location":"semester_1/letusc/luc044/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc044.c"],"tags":[]},{"location":"semester_1/letusc/luc045/","level":1,"title":"<code>luc045.c</code>","text":"<p>Problem Statement</p> <p>A position integer is entered through the keyboard. Write a Function to obtain the prime factors of this number. For example, prime factors of 24 are 2, 2, 2 and 3, whereas prime factors of 35 are 5 and 7</p>","path":["Semester 1","Letusc","luc045.c"],"tags":[]},{"location":"semester_1/letusc/luc045/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc045.c"],"tags":[]},{"location":"semester_1/letusc/luc045/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc045.c"],"tags":[]},{"location":"semester_1/letusc/luc045/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc045.c"],"tags":[]},{"location":"semester_1/letusc/luc046/","level":1,"title":"<code>luc046.c</code>","text":"<p>Problem Statement</p> <p>Given three variables x, y, z, write a function to circularly shift their values to right. In other words, if x = 5, y = 8, z = 10, after circular shift y = 5, z = 8, x = 10. cal the function with variables a, b, c to circularly shift values.</p>","path":["Semester 1","Letusc","luc046.c"],"tags":[]},{"location":"semester_1/letusc/luc046/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc046.c"],"tags":[]},{"location":"semester_1/letusc/luc046/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc046.c"],"tags":[]},{"location":"semester_1/letusc/luc046/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc046.c"],"tags":[]},{"location":"semester_1/letusc/luc047/","level":1,"title":"<code>luc047.c</code>","text":"<p>Problem Statement</p> <p>Define a function that receives weight of a commodity in kilograms and returns the equivalent weight in Grams, Tons and pounds. Call this fuction from main() and print the results in main()</p>","path":["Semester 1","Letusc","luc047.c"],"tags":[]},{"location":"semester_1/letusc/luc047/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc047.c"],"tags":[]},{"location":"semester_1/letusc/luc047/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc047.c"],"tags":[]},{"location":"semester_1/letusc/luc047/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc047.c"],"tags":[]},{"location":"semester_1/letusc/luc048/","level":1,"title":"<code>luc048.c</code>","text":"<p>Problem Statement</p> <p>Define a function to compute the distance between two points and use it to develop another function that will compute the area of the triangle whose vertices are A(x1, y1), B(x2, y2), and C(x3, y3). Use these functions to develop a function which returns a value 1 if the point (x, y) lines inside the triangle ABC, otherwise returns a value 0. Would you get any advantage if you develop these functions to work on call by reference principle?</p>","path":["Semester 1","Letusc","luc048.c"],"tags":[]},{"location":"semester_1/letusc/luc048/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc048.c"],"tags":[]},{"location":"semester_1/letusc/luc048/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc048.c"],"tags":[]},{"location":"semester_1/letusc/luc048/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc048.c"],"tags":[]},{"location":"semester_1/letusc/luc049/","level":1,"title":"<code>luc049.c</code>","text":"<p>Problem Statement</p> <p>A positive integer is entered through the keyboard, write a function to find the binary equivalent of this number: (1) Without using recursion (2) Using recursion</p>","path":["Semester 1","Letusc","luc049.c"],"tags":[]},{"location":"semester_1/letusc/luc049/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc049.c"],"tags":[]},{"location":"semester_1/letusc/luc049/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc049.c"],"tags":[]},{"location":"semester_1/letusc/luc049/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc049.c"],"tags":[]},{"location":"semester_1/letusc/luc050/","level":1,"title":"<code>luc050.c</code>","text":"<p>Problem Statement</p> <p>Write a recursive function to obtain the sum of first 25 natural numbers.</p>","path":["Semester 1","Letusc","luc050.c"],"tags":[]},{"location":"semester_1/letusc/luc050/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc050.c"],"tags":[]},{"location":"semester_1/letusc/luc050/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc050.c"],"tags":[]},{"location":"semester_1/letusc/luc050/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc050.c"],"tags":[]},{"location":"semester_1/letusc/luc051/","level":1,"title":"<code>luc051.c</code>","text":"<p>Problem Statement</p> <p>Tower of Hanoi: Write a program to print out the sequence in which 4 disks should be moved from peg A to peg C using peg B.</p>","path":["Semester 1","Letusc","luc051.c"],"tags":[]},{"location":"semester_1/letusc/luc051/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc051.c"],"tags":[]},{"location":"semester_1/letusc/luc051/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc051.c"],"tags":[]},{"location":"semester_1/letusc/luc051/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc051.c"],"tags":[]},{"location":"semester_1/letusc/luc052/","level":1,"title":"<code>luc052.c</code>","text":"<p>Problem Statement</p> <p>If a macro is not getting expanded as per your expectation, how will you find out how is it being expanded by the preprocessor?</p>","path":["Semester 1","Letusc","luc052.c"],"tags":[]},{"location":"semester_1/letusc/luc052/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc052.c"],"tags":[]},{"location":"semester_1/letusc/luc052/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc052.c"],"tags":[]},{"location":"semester_1/letusc/luc052/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc052.c"],"tags":[]},{"location":"semester_1/letusc/luc053/","level":1,"title":"<code>luc053.c</code>","text":"<p>Problem Statement</p> <p>Write macro definitions for: Mean, Absolute value, Uppercase to Lowercase, Biggest of three.</p>","path":["Semester 1","Letusc","luc053.c"],"tags":[]},{"location":"semester_1/letusc/luc053/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc053.c"],"tags":[]},{"location":"semester_1/letusc/luc053/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc053.c"],"tags":[]},{"location":"semester_1/letusc/luc053/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc053.c"],"tags":[]},{"location":"semester_1/letusc/luc054/","level":1,"title":"<code>luc054.c</code>","text":"<p>Problem Statement</p> <p>Use 'interest.h' macros to calculate Simple Interest and Amount.</p>","path":["Semester 1","Letusc","luc054.c"],"tags":[]},{"location":"semester_1/letusc/luc054/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc054.c"],"tags":[]},{"location":"semester_1/letusc/luc054/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc054.c"],"tags":[]},{"location":"semester_1/letusc/luc054/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc054.c"],"tags":[]},{"location":"semester_1/letusc/luc055/","level":1,"title":"<code>luc055.c</code>","text":"<p>Problem Statement</p> <p>Twenty-five numbers are entered from the keyboard into an array. Write a program to find out how many of them are positive, how many are negative, how many are even and how many odd.</p>","path":["Semester 1","Letusc","luc055.c"],"tags":[]},{"location":"semester_1/letusc/luc055/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc055.c"],"tags":[]},{"location":"semester_1/letusc/luc055/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc055.c"],"tags":[]},{"location":"semester_1/letusc/luc055/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc055.c"],"tags":[]},{"location":"semester_1/letusc/luc056/","level":1,"title":"<code>luc056.c</code>","text":"<p>Problem Statement</p> <p>If an array arr contains n elements, then write a program to check if arr[0] = arr[n-1], arr[1] = arr[n-2] and so on.</p>","path":["Semester 1","Letusc","luc056.c"],"tags":[]},{"location":"semester_1/letusc/luc056/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc056.c"],"tags":[]},{"location":"semester_1/letusc/luc056/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc056.c"],"tags":[]},{"location":"semester_1/letusc/luc056/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc056.c"],"tags":[]},{"location":"semester_1/letusc/luc057/","level":1,"title":"<code>luc057.c</code>","text":"<p>Problem Statement</p> <p>Write a program using pointers to find the smallest number in an array of 25 integers.</p>","path":["Semester 1","Letusc","luc057.c"],"tags":[]},{"location":"semester_1/letusc/luc057/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc057.c"],"tags":[]},{"location":"semester_1/letusc/luc057/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc057.c"],"tags":[]},{"location":"semester_1/letusc/luc057/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc057.c"],"tags":[]},{"location":"semester_1/letusc/luc058/","level":1,"title":"<code>luc058.c</code>","text":"<p>Problem Statement</p> <p>Implement the Insertion Sort algorithm shown in Figure 13.3 on a set of 25 numbers.</p>","path":["Semester 1","Letusc","luc058.c"],"tags":[]},{"location":"semester_1/letusc/luc058/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc058.c"],"tags":[]},{"location":"semester_1/letusc/luc058/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc058.c"],"tags":[]},{"location":"semester_1/letusc/luc058/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc058.c"],"tags":[]},{"location":"semester_1/letusc/luc059/","level":1,"title":"<code>luc059.c</code>","text":"<p>Problem Statement</p> <p>Write a program which initializes an integer array of 10 elements in main(), passes it to modify(), multiplies each element by 3, and prints the new array in main().</p>","path":["Semester 1","Letusc","luc059.c"],"tags":[]},{"location":"semester_1/letusc/luc059/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc059.c"],"tags":[]},{"location":"semester_1/letusc/luc059/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc059.c"],"tags":[]},{"location":"semester_1/letusc/luc059/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc059.c"],"tags":[]},{"location":"semester_1/letusc/luc060/","level":1,"title":"<code>luc060.c</code>","text":"<p>Problem Statement</p> <p>For the following set of sample data, compute the standard deviation and the mean.\\nData: -6, -12, 8, 13, 11, 6, 7, 2, -6, -9, -10, 11, 10, 9, 2</p>","path":["Semester 1","Letusc","luc060.c"],"tags":[]},{"location":"semester_1/letusc/luc060/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc060.c"],"tags":[]},{"location":"semester_1/letusc/luc060/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc060.c"],"tags":[]},{"location":"semester_1/letusc/luc060/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc060.c"],"tags":[]},{"location":"semester_1/letusc/luc061/","level":1,"title":"<code>luc061.c</code>","text":"<p>Problem Statement</p> <p>The area of a triangle can be computed by the sine law. Given 6 triangular pieces of land (a, b, angle), find their area and determine which is largest.</p>","path":["Semester 1","Letusc","luc061.c"],"tags":[]},{"location":"semester_1/letusc/luc061/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc061.c"],"tags":[]},{"location":"semester_1/letusc/luc061/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc061.c"],"tags":[]},{"location":"semester_1/letusc/luc061/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc061.c"],"tags":[]},{"location":"semester_1/letusc/luc062/","level":1,"title":"<code>luc062.c</code>","text":"<p>Problem Statement</p> <p>For the following set of n data points (x, y), write a program to compute the correlation coefficient r.</p>","path":["Semester 1","Letusc","luc062.c"],"tags":[]},{"location":"semester_1/letusc/luc062/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc062.c"],"tags":[]},{"location":"semester_1/letusc/luc062/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc062.c"],"tags":[]},{"location":"semester_1/letusc/luc062/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc062.c"],"tags":[]},{"location":"semester_1/letusc/luc063/","level":1,"title":"<code>luc063.c</code>","text":"<p>Problem Statement</p> <p>The X and Y coordinates of 10 different points are entered through the keyboard. Write a program to find the distance of last point from the first point (sum of distances between consecutive points).</p>","path":["Semester 1","Letusc","luc063.c"],"tags":[]},{"location":"semester_1/letusc/luc063/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc063.c"],"tags":[]},{"location":"semester_1/letusc/luc063/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc063.c"],"tags":[]},{"location":"semester_1/letusc/luc063/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc063.c"],"tags":[]},{"location":"semester_1/letusc/luc064/","level":1,"title":"<code>luc064.c</code>","text":"<p>Problem Statement</p> <p>Simulate a Dequeue (Double Ended Queue) using an array. Support: retrieve left, retrieve right, insert left, insert right. Use pointers left and right.</p>","path":["Semester 1","Letusc","luc064.c"],"tags":[]},{"location":"semester_1/letusc/luc064/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc064.c"],"tags":[]},{"location":"semester_1/letusc/luc064/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc064.c"],"tags":[]},{"location":"semester_1/letusc/luc064/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc064.c"],"tags":[]},{"location":"semester_1/letusc/luc065/","level":1,"title":"<code>luc065.c</code>","text":"<p>Problem Statement</p> <p>Write a program to find if a square matrix is symmetric.</p>","path":["Semester 1","Letusc","luc065.c"],"tags":[]},{"location":"semester_1/letusc/luc065/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc065.c"],"tags":[]},{"location":"semester_1/letusc/luc065/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc065.c"],"tags":[]},{"location":"semester_1/letusc/luc065/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc065.c"],"tags":[]},{"location":"semester_1/letusc/luc066/","level":1,"title":"<code>luc066.c</code>","text":"<p>Problem Statement</p> <p>Write a program to add two 6 x 6 matrices.</p>","path":["Semester 1","Letusc","luc066.c"],"tags":[]},{"location":"semester_1/letusc/luc066/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc066.c"],"tags":[]},{"location":"semester_1/letusc/luc066/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc066.c"],"tags":[]},{"location":"semester_1/letusc/luc066/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc066.c"],"tags":[]},{"location":"semester_1/letusc/luc067/","level":1,"title":"<code>luc067.c</code>","text":"<p>Problem Statement</p> <p>Write a program to multiply any two 3 x 3 matrices.</p>","path":["Semester 1","Letusc","luc067.c"],"tags":[]},{"location":"semester_1/letusc/luc067/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc067.c"],"tags":[]},{"location":"semester_1/letusc/luc067/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc067.c"],"tags":[]},{"location":"semester_1/letusc/luc067/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc067.c"],"tags":[]},{"location":"semester_1/letusc/luc068/","level":1,"title":"<code>luc068.c</code>","text":"<p>Problem Statement</p> <p>Given an array p[5], write a function to shift it circularly left by two positions. Call this function for a 4 x 5 matrix and get its rows left shifted.</p>","path":["Semester 1","Letusc","luc068.c"],"tags":[]},{"location":"semester_1/letusc/luc068/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc068.c"],"tags":[]},{"location":"semester_1/letusc/luc068/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc068.c"],"tags":[]},{"location":"semester_1/letusc/luc068/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc068.c"],"tags":[]},{"location":"semester_1/letusc/luc069/","level":1,"title":"<code>luc069.c</code>","text":"<p>Problem Statement</p> <p>If the string \"Alice in wonder land\" is fed to the following scanf() statement, what will be the contents of arrays str1, str2, str3 and str4?</p>","path":["Semester 1","Letusc","luc069.c"],"tags":[]},{"location":"semester_1/letusc/luc069/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc069.c"],"tags":[]},{"location":"semester_1/letusc/luc069/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc069.c"],"tags":[]},{"location":"semester_1/letusc/luc069/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc069.c"],"tags":[]},{"location":"semester_1/letusc/luc070/","level":1,"title":"<code>luc070.c</code>","text":"<p>Problem Statement</p> <p>Write a program that receives a 10-digit ISBN number, computes the checksum (d1 + 2d2 + 3d3 + ... + 10d10), and reports whether the ISBN number is correct (sum divisible by 11).</p>","path":["Semester 1","Letusc","luc070.c"],"tags":[]},{"location":"semester_1/letusc/luc070/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc070.c"],"tags":[]},{"location":"semester_1/letusc/luc070/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc070.c"],"tags":[]},{"location":"semester_1/letusc/luc070/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc070.c"],"tags":[]},{"location":"semester_1/letusc/luc071/","level":1,"title":"<code>luc071.c</code>","text":"<p>Problem Statement</p> <p>Write a program that receives a 16-digit Credit Card number and checks whether it is valid using the Luhn algorithm variant described.</p>","path":["Semester 1","Letusc","luc071.c"],"tags":[]},{"location":"semester_1/letusc/luc071/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc071.c"],"tags":[]},{"location":"semester_1/letusc/luc071/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc071.c"],"tags":[]},{"location":"semester_1/letusc/luc071/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc071.c"],"tags":[]},{"location":"semester_1/letusc/luc072/","level":1,"title":"<code>luc072.c</code>","text":"<p>Problem Statement</p> <p>How many bytes in memory would be occupied by the following array of pointers to strings? How many bytes would be required to store the same strings in a two-dimensional character array?</p>","path":["Semester 1","Letusc","luc072.c"],"tags":[]},{"location":"semester_1/letusc/luc072/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc072.c"],"tags":[]},{"location":"semester_1/letusc/luc072/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc072.c"],"tags":[]},{"location":"semester_1/letusc/luc072/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc072.c"],"tags":[]},{"location":"semester_1/letusc/luc073/","level":1,"title":"<code>luc073.c</code>","text":"<p>Problem Statement</p> <p>Write a program to delete all vowels from a sentence. Assume that the sentence is not more than 80 characters long.</p>","path":["Semester 1","Letusc","luc073.c"],"tags":[]},{"location":"semester_1/letusc/luc073/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc073.c"],"tags":[]},{"location":"semester_1/letusc/luc073/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc073.c"],"tags":[]},{"location":"semester_1/letusc/luc073/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc073.c"],"tags":[]},{"location":"semester_1/letusc/luc074/","level":1,"title":"<code>luc074.c</code>","text":"<p>Problem Statement</p> <p>Write a program that will read a line and delete from it all occurrences of the word 'the'.</p>","path":["Semester 1","Letusc","luc074.c"],"tags":[]},{"location":"semester_1/letusc/luc074/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc074.c"],"tags":[]},{"location":"semester_1/letusc/luc074/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc074.c"],"tags":[]},{"location":"semester_1/letusc/luc074/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc074.c"],"tags":[]},{"location":"semester_1/letusc/luc075/","level":1,"title":"<code>luc075.c</code>","text":"<p>Problem Statement</p> <p>Write a program that stores a set of names of individuals and abbreviates the first and middle name to their first letter.</p>","path":["Semester 1","Letusc","luc075.c"],"tags":[]},{"location":"semester_1/letusc/luc075/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc075.c"],"tags":[]},{"location":"semester_1/letusc/luc075/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc075.c"],"tags":[]},{"location":"semester_1/letusc/luc075/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc075.c"],"tags":[]},{"location":"semester_1/letusc/luc076/","level":1,"title":"<code>luc076.c</code>","text":"<p>Problem Statement</p> <p>Write a program to count the number of occurrences of any two vowels in succession in a line of text.</p>","path":["Semester 1","Letusc","luc076.c"],"tags":[]},{"location":"semester_1/letusc/luc076/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc076.c"],"tags":[]},{"location":"semester_1/letusc/luc076/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc076.c"],"tags":[]},{"location":"semester_1/letusc/luc076/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc076.c"],"tags":[]},{"location":"semester_1/letusc/luc077/","level":1,"title":"<code>luc077.c</code>","text":"<p>Problem Statement</p> <p>Write a program that receives an integer (less than or equal to nine digits in length) and prints out the number in words.</p>","path":["Semester 1","Letusc","luc077.c"],"tags":[]},{"location":"semester_1/letusc/luc077/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc077.c"],"tags":[]},{"location":"semester_1/letusc/luc077/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc077.c"],"tags":[]},{"location":"semester_1/letusc/luc077/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc077.c"],"tags":[]},{"location":"semester_1/letusc/luc078/","level":1,"title":"<code>luc078.c</code>","text":"<p>Problem Statement</p> <p>Create a structure 'student' (Roll, Name, Dept, Course, Year). Write functions to print names by join year and print data by roll number.</p>","path":["Semester 1","Letusc","luc078.c"],"tags":[]},{"location":"semester_1/letusc/luc078/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc078.c"],"tags":[]},{"location":"semester_1/letusc/luc078/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc078.c"],"tags":[]},{"location":"semester_1/letusc/luc078/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc078.c"],"tags":[]},{"location":"semester_1/letusc/luc079/","level":1,"title":"<code>luc079.c</code>","text":"<p>Problem Statement</p> <p>Create a structure for bank customers (Acc no, Name, Balance). Write functions to print low balance customers and handle deposits/withdrawals.</p>","path":["Semester 1","Letusc","luc079.c"],"tags":[]},{"location":"semester_1/letusc/luc079/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc079.c"],"tags":[]},{"location":"semester_1/letusc/luc079/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc079.c"],"tags":[]},{"location":"semester_1/letusc/luc079/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc079.c"],"tags":[]},{"location":"semester_1/letusc/luc080/","level":1,"title":"<code>luc080.c</code>","text":"<p>Problem Statement</p> <p>Automobile engine parts (Serial AA0-FF9, Year, Material, Qty). Retrieve parts between serial numbers BB1 and CC6.</p>","path":["Semester 1","Letusc","luc080.c"],"tags":[]},{"location":"semester_1/letusc/luc080/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc080.c"],"tags":[]},{"location":"semester_1/letusc/luc080/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc080.c"],"tags":[]},{"location":"semester_1/letusc/luc080/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc080.c"],"tags":[]},{"location":"semester_1/letusc/luc081/","level":1,"title":"<code>luc081.c</code>","text":"<p>Problem Statement</p> <p>Create structure for Cricketers (Name, Age, Tests, Avg Runs). Sort 20 records by average runs using qsort().</p>","path":["Semester 1","Letusc","luc081.c"],"tags":[]},{"location":"semester_1/letusc/luc081/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc081.c"],"tags":[]},{"location":"semester_1/letusc/luc081/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc081.c"],"tags":[]},{"location":"semester_1/letusc/luc081/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc081.c"],"tags":[]},{"location":"semester_1/letusc/luc082/","level":1,"title":"<code>luc082.c</code>","text":"<p>Problem Statement</p> <p>Structure 'employee' (Code, Name, Date of Joining). Display names of employees with tenure >= 3 years.</p>","path":["Semester 1","Letusc","luc082.c"],"tags":[]},{"location":"semester_1/letusc/luc082/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc082.c"],"tags":[]},{"location":"semester_1/letusc/luc082/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc082.c"],"tags":[]},{"location":"semester_1/letusc/luc082/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc082.c"],"tags":[]},{"location":"semester_1/letusc/luc083/","level":1,"title":"<code>luc083.c</code>","text":"<p>Problem Statement</p> <p>Library menu-driven program (Add, Display, List by Author, List by Title, Count, List sorted).</p>","path":["Semester 1","Letusc","luc083.c"],"tags":[]},{"location":"semester_1/letusc/luc083/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc083.c"],"tags":[]},{"location":"semester_1/letusc/luc083/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc083.c"],"tags":[]},{"location":"semester_1/letusc/luc083/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc083.c"],"tags":[]},{"location":"semester_1/letusc/luc084/","level":1,"title":"<code>luc084.c</code>","text":"<p>Problem Statement</p> <p>Define a function that compares two given dates. Return 0 if equal, otherwise return 1.</p>","path":["Semester 1","Letusc","luc084.c"],"tags":[]},{"location":"semester_1/letusc/luc084/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc084.c"],"tags":[]},{"location":"semester_1/letusc/luc084/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc084.c"],"tags":[]},{"location":"semester_1/letusc/luc084/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc084.c"],"tags":[]},{"location":"semester_1/letusc/luc085/","level":1,"title":"<code>luc085.c</code>","text":"<p>Problem Statement</p> <p>Suppose a file contains student records (Name, Age). Write a program to read these records and display them in sorted order by name.</p>","path":["Semester 1","Letusc","luc085.c"],"tags":[]},{"location":"semester_1/letusc/luc085/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc085.c"],"tags":[]},{"location":"semester_1/letusc/luc085/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc085.c"],"tags":[]},{"location":"semester_1/letusc/luc085/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc085.c"],"tags":[]},{"location":"semester_1/letusc/luc086/","level":1,"title":"<code>luc086.c</code>","text":"<p>Problem Statement</p> <p>Write a program to copy contents of one file to another. While doing so replace all lowercase characters to their equivalent uppercase characters.</p>","path":["Semester 1","Letusc","luc086.c"],"tags":[]},{"location":"semester_1/letusc/luc086/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc086.c"],"tags":[]},{"location":"semester_1/letusc/luc086/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc086.c"],"tags":[]},{"location":"semester_1/letusc/luc086/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc086.c"],"tags":[]},{"location":"semester_1/letusc/luc087/","level":1,"title":"<code>luc087.c</code>","text":"<p>Problem Statement</p> <p>Write a program that merges lines alternately from two files and writes the results to a new file. Handle remaining lines if file sizes differ.</p>","path":["Semester 1","Letusc","luc087.c"],"tags":[]},{"location":"semester_1/letusc/luc087/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc087.c"],"tags":[]},{"location":"semester_1/letusc/luc087/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc087.c"],"tags":[]},{"location":"semester_1/letusc/luc087/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc087.c"],"tags":[]},{"location":"semester_1/letusc/luc088/","level":1,"title":"<code>luc088.c</code>","text":"<p>Problem Statement</p> <p>Write a program to encrypt/decrypt a file using: (1) Offset cipher (2) Substitution cipher.</p>","path":["Semester 1","Letusc","luc088.c"],"tags":[]},{"location":"semester_1/letusc/luc088/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc088.c"],"tags":[]},{"location":"semester_1/letusc/luc088/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc088.c"],"tags":[]},{"location":"semester_1/letusc/luc088/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc088.c"],"tags":[]},{"location":"semester_1/letusc/luc089/","level":1,"title":"<code>luc089.c</code>","text":"<p>Problem Statement</p> <p>Update 'CUSTOMER.DAT' balance using 'TRANSACTIONS.DAT' (Deposit/Withdrawal). Ensure balance doesn't fall below Rs. 100 on withdrawal.</p>","path":["Semester 1","Letusc","luc089.c"],"tags":[]},{"location":"semester_1/letusc/luc089/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc089.c"],"tags":[]},{"location":"semester_1/letusc/luc089/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc089.c"],"tags":[]},{"location":"semester_1/letusc/luc089/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc089.c"],"tags":[]},{"location":"semester_1/letusc/luc090/","level":1,"title":"<code>luc090.c</code>","text":"<p>Problem Statement</p> <p>Read employee records (code, name, date, salary), sort them by Date of Joining, and write to a target file.</p>","path":["Semester 1","Letusc","luc090.c"],"tags":[]},{"location":"semester_1/letusc/luc090/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc090.c"],"tags":[]},{"location":"semester_1/letusc/luc090/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc090.c"],"tags":[]},{"location":"semester_1/letusc/luc090/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc090.c"],"tags":[]},{"location":"semester_1/letusc/luc091/","level":1,"title":"<code>luc091.c</code>","text":"<p>Problem Statement</p> <p>Read 'blood donors' file (Name, Address, Age, Blood Type). Print donors with Age < 25 and Blood Type 2.</p>","path":["Semester 1","Letusc","luc091.c"],"tags":[]},{"location":"semester_1/letusc/luc091/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc091.c"],"tags":[]},{"location":"semester_1/letusc/luc091/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc091.c"],"tags":[]},{"location":"semester_1/letusc/luc091/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc091.c"],"tags":[]},{"location":"semester_1/letusc/luc092/","level":1,"title":"<code>luc092.c</code>","text":"<p>Problem Statement</p> <p>Write a program to store names in a file. Display the n-th name in the list, where n is read from the keyboard.</p>","path":["Semester 1","Letusc","luc092.c"],"tags":[]},{"location":"semester_1/letusc/luc092/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc092.c"],"tags":[]},{"location":"semester_1/letusc/luc092/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc092.c"],"tags":[]},{"location":"semester_1/letusc/luc092/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc092.c"],"tags":[]},{"location":"semester_1/letusc/luc093/","level":1,"title":"<code>luc093.c</code>","text":"<p>Problem Statement</p> <p>Update Master file (Roll, Name) using Transaction file (Roll, Code Add/Delete). Both files are sorted by Roll.</p>","path":["Semester 1","Letusc","luc093.c"],"tags":[]},{"location":"semester_1/letusc/luc093/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc093.c"],"tags":[]},{"location":"semester_1/letusc/luc093/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc093.c"],"tags":[]},{"location":"semester_1/letusc/luc093/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc093.c"],"tags":[]},{"location":"semester_1/letusc/luc094/","level":1,"title":"<code>luc094.c</code>","text":"<p>Problem Statement</p> <p>Read a text file, delete the words 'a', 'the', 'an' and replace each with a blank space. Write to new file.</p>","path":["Semester 1","Letusc","luc094.c"],"tags":[]},{"location":"semester_1/letusc/luc094/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc094.c"],"tags":[]},{"location":"semester_1/letusc/luc094/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc094.c"],"tags":[]},{"location":"semester_1/letusc/luc094/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc094.c"],"tags":[]},{"location":"semester_1/letusc/luc095/","level":1,"title":"<code>luc095.c</code>","text":"<p>Problem Statement</p> <p>Write a program that can read a file and display its contents. The file name should be supplied as a command-line argument.</p>","path":["Semester 1","Letusc","luc095.c"],"tags":[]},{"location":"semester_1/letusc/luc095/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc095.c"],"tags":[]},{"location":"semester_1/letusc/luc095/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc095.c"],"tags":[]},{"location":"semester_1/letusc/luc095/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc095.c"],"tags":[]},{"location":"semester_1/letusc/luc096/","level":1,"title":"<code>luc096.c</code>","text":"<p>Problem Statement</p> <p>Write a program that can copy the contents of one file to another. The source and target filenames should be supplied as command-line arguments.</p>","path":["Semester 1","Letusc","luc096.c"],"tags":[]},{"location":"semester_1/letusc/luc096/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc096.c"],"tags":[]},{"location":"semester_1/letusc/luc096/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc096.c"],"tags":[]},{"location":"semester_1/letusc/luc096/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc096.c"],"tags":[]},{"location":"semester_1/letusc/luc097/","level":1,"title":"<code>luc097.c</code>","text":"<p>Problem Statement</p> <p>Write a program using command-line arguments to search for a word in a file and replace it with the specified word.\\nUsage: change","path":["Semester 1","Letusc","luc097.c"],"tags":[]},{"location":"semester_1/letusc/luc097/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc097.c"],"tags":[]},{"location":"semester_1/letusc/luc097/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc097.c"],"tags":[]},{"location":"semester_1/letusc/luc097/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc097.c"],"tags":[]},{"location":"semester_1/letusc/luc098/","level":1,"title":"<code>luc098.c</code>","text":"<p>Problem Statement</p> <p>Write a calculator utility using command line arguments.\\nUsage: calc \\nwhere switch is arithmetic operator or comparison operator.","path":["Semester 1","Letusc","luc098.c"],"tags":[]},{"location":"semester_1/letusc/luc098/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc098.c"],"tags":[]},{"location":"semester_1/letusc/luc098/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc098.c"],"tags":[]},{"location":"semester_1/letusc/luc098/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc098.c"],"tags":[]},{"location":"semester_1/letusc/luc099/","level":1,"title":"<code>luc099.c</code>","text":"<p>Problem Statement</p> <p>Read an integer 'game' representing sports won by a college. Determine if it won the 'Champion of Champions' trophy (>5 games) and list games won.</p>","path":["Semester 1","Letusc","luc099.c"],"tags":[]},{"location":"semester_1/letusc/luc099/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc099.c"],"tags":[]},{"location":"semester_1/letusc/luc099/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc099.c"],"tags":[]},{"location":"semester_1/letusc/luc099/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc099.c"],"tags":[]},{"location":"semester_1/letusc/luc100/","level":1,"title":"<code>luc100.c</code>","text":"<p>Problem Statement</p> <p>Determine if an animal is Carnivore/Herbivore and its type (Canine, Feline, Cetacean, Marsupial) based on bits in an integer.</p>","path":["Semester 1","Letusc","luc100.c"],"tags":[]},{"location":"semester_1/letusc/luc100/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc100.c"],"tags":[]},{"location":"semester_1/letusc/luc100/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc100.c"],"tags":[]},{"location":"semester_1/letusc/luc100/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc100.c"],"tags":[]},{"location":"semester_1/letusc/luc101/","level":1,"title":"<code>luc101.c</code>","text":"<p>Problem Statement</p> <p>Decode student information (Year, Stream, Room No) packed into an integer array.</p>","path":["Semester 1","Letusc","luc101.c"],"tags":[]},{"location":"semester_1/letusc/luc101/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc101.c"],"tags":[]},{"location":"semester_1/letusc/luc101/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc101.c"],"tags":[]},{"location":"semester_1/letusc/luc101/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc101.c"],"tags":[]},{"location":"semester_1/letusc/luc102/","level":1,"title":"<code>luc102.c</code>","text":"<p>Problem Statement</p> <p>What will be the output of the provided program segment involving bitwise operators?</p>","path":["Semester 1","Letusc","luc102.c"],"tags":[]},{"location":"semester_1/letusc/luc102/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc102.c"],"tags":[]},{"location":"semester_1/letusc/luc102/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc102.c"],"tags":[]},{"location":"semester_1/letusc/luc102/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc102.c"],"tags":[]},{"location":"semester_1/letusc/luc103/","level":1,"title":"<code>luc103.c</code>","text":"<p>Problem Statement</p> <p>What is the hexadecimal equivalent of the following binary numbers?</p>","path":["Semester 1","Letusc","luc103.c"],"tags":[]},{"location":"semester_1/letusc/luc103/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc103.c"],"tags":[]},{"location":"semester_1/letusc/luc103/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc103.c"],"tags":[]},{"location":"semester_1/letusc/luc103/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc103.c"],"tags":[]},{"location":"semester_1/letusc/luc104/","level":1,"title":"<code>luc104.c</code>","text":"<p>Problem Statement</p> <p>Rewrite expressions using bitwise compound assignment operators.</p>","path":["Semester 1","Letusc","luc104.c"],"tags":[]},{"location":"semester_1/letusc/luc104/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc104.c"],"tags":[]},{"location":"semester_1/letusc/luc104/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc104.c"],"tags":[]},{"location":"semester_1/letusc/luc104/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc104.c"],"tags":[]},{"location":"semester_1/letusc/luc105/","level":1,"title":"<code>luc105.c</code>","text":"<p>Problem Statement</p> <p>Write a function checkbits(x, p, n) which returns true if all 'n' bits starting from position 'p' are turned on.</p>","path":["Semester 1","Letusc","luc105.c"],"tags":[]},{"location":"semester_1/letusc/luc105/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc105.c"],"tags":[]},{"location":"semester_1/letusc/luc105/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc105.c"],"tags":[]},{"location":"semester_1/letusc/luc105/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc105.c"],"tags":[]},{"location":"semester_1/letusc/luc106/","level":1,"title":"<code>luc106.c</code>","text":"<p>Problem Statement</p> <p>Write a program to scan an 8-bit number and check whether its 3rd, 6th and 7th bit is on.</p>","path":["Semester 1","Letusc","luc106.c"],"tags":[]},{"location":"semester_1/letusc/luc106/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc106.c"],"tags":[]},{"location":"semester_1/letusc/luc106/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc106.c"],"tags":[]},{"location":"semester_1/letusc/luc106/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc106.c"],"tags":[]},{"location":"semester_1/letusc/luc107/","level":1,"title":"<code>luc107.c</code>","text":"<p>Problem Statement</p> <p>Receive an unsigned 16-bit integer and exchange the contents of its 2 bytes using bitwise operators.</p>","path":["Semester 1","Letusc","luc107.c"],"tags":[]},{"location":"semester_1/letusc/luc107/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc107.c"],"tags":[]},{"location":"semester_1/letusc/luc107/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc107.c"],"tags":[]},{"location":"semester_1/letusc/luc107/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc107.c"],"tags":[]},{"location":"semester_1/letusc/luc108/","level":1,"title":"<code>luc108.c</code>","text":"<p>Problem Statement</p> <p>Receive an 8-bit number and exchange its higher 4 bits with lower 4 bits.</p>","path":["Semester 1","Letusc","luc108.c"],"tags":[]},{"location":"semester_1/letusc/luc108/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc108.c"],"tags":[]},{"location":"semester_1/letusc/luc108/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc108.c"],"tags":[]},{"location":"semester_1/letusc/luc108/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc108.c"],"tags":[]},{"location":"semester_1/letusc/luc109/","level":1,"title":"<code>luc109.c</code>","text":"<p>Problem Statement</p> <p>Receive an 8-bit number and set its odd bits to 1.</p>","path":["Semester 1","Letusc","luc109.c"],"tags":[]},{"location":"semester_1/letusc/luc109/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc109.c"],"tags":[]},{"location":"semester_1/letusc/luc109/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc109.c"],"tags":[]},{"location":"semester_1/letusc/luc109/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc109.c"],"tags":[]},{"location":"semester_1/letusc/luc110/","level":1,"title":"<code>luc110.c</code>","text":"<p>Problem Statement</p> <p>Receive an 8-bit number. Check if 3rd and 5th bits are ON. If yes, put them OFF.</p>","path":["Semester 1","Letusc","luc110.c"],"tags":[]},{"location":"semester_1/letusc/luc110/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc110.c"],"tags":[]},{"location":"semester_1/letusc/luc110/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc110.c"],"tags":[]},{"location":"semester_1/letusc/luc110/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc110.c"],"tags":[]},{"location":"semester_1/letusc/luc111/","level":1,"title":"<code>luc111.c</code>","text":"<p>Problem Statement</p> <p>Receive an 8-bit number. Check if 3rd and 5th bits are OFF. If yes, put them ON.</p>","path":["Semester 1","Letusc","luc111.c"],"tags":[]},{"location":"semester_1/letusc/luc111/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc111.c"],"tags":[]},{"location":"semester_1/letusc/luc111/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc111.c"],"tags":[]},{"location":"semester_1/letusc/luc111/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc111.c"],"tags":[]},{"location":"semester_1/letusc/luc112/","level":1,"title":"<code>luc112.c</code>","text":"<p>Problem Statement</p> <p>Rewrite the showbits() function using the _BV macro.</p>","path":["Semester 1","Letusc","luc112.c"],"tags":[]},{"location":"semester_1/letusc/luc112/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc112.c"],"tags":[]},{"location":"semester_1/letusc/luc112/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc112.c"],"tags":[]},{"location":"semester_1/letusc/luc112/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc112.c"],"tags":[]},{"location":"semester_1/letusc/luc113/","level":1,"title":"<code>luc113.c</code>","text":"<p>Problem Statement</p> <p>Store date in a structure using bit fields (day: 5 bits, month: 4 bits, year: 12 bits). Read joining dates of 10 employees and display them sorted by year.</p>","path":["Semester 1","Letusc","luc113.c"],"tags":[]},{"location":"semester_1/letusc/luc113/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc113.c"],"tags":[]},{"location":"semester_1/letusc/luc113/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc113.c"],"tags":[]},{"location":"semester_1/letusc/luc113/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc113.c"],"tags":[]},{"location":"semester_1/letusc/luc114/","level":1,"title":"<code>luc114.c</code>","text":"<p>Problem Statement</p> <p>Store insurance policy holder info (gender, minor/major, policy name, duration) using bit-fields.</p>","path":["Semester 1","Letusc","luc114.c"],"tags":[]},{"location":"semester_1/letusc/luc114/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc114.c"],"tags":[]},{"location":"semester_1/letusc/luc114/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc114.c"],"tags":[]},{"location":"semester_1/letusc/luc114/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc114.c"],"tags":[]},{"location":"semester_1/letusc/luc115/","level":1,"title":"<code>luc115.c</code>","text":"<p>Problem Statement</p> <p>Obtain MD5 checksum of the following strings and check whether they are same: \"Six slippery snails slid slowly seaward.\" \"Six silppery snails slid slowly seaward.\"</p>","path":["Semester 1","Letusc","luc115.c"],"tags":[]},{"location":"semester_1/letusc/luc115/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc115.c"],"tags":[]},{"location":"semester_1/letusc/luc115/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc115.c"],"tags":[]},{"location":"semester_1/letusc/luc115/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc115.c"],"tags":[]},{"location":"semester_1/letusc/luc116/","level":1,"title":"<code>luc116.c</code>","text":"<p>Problem Statement</p> <p>Compile any C program into a .EXE or a .out file. Obtain SHA256 checksum of the file.</p>","path":["Semester 1","Letusc","luc116.c"],"tags":[]},{"location":"semester_1/letusc/luc116/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc116.c"],"tags":[]},{"location":"semester_1/letusc/luc116/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc116.c"],"tags":[]},{"location":"semester_1/letusc/luc116/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc116.c"],"tags":[]},{"location":"semester_1/letusc/luc117/","level":1,"title":"<code>luc117.c</code>","text":"<p>Problem Statement</p> <p>Write a program to convert a given text into an audio file using OpenAI Audio API (TTS).</p>","path":["Semester 1","Letusc","luc117.c"],"tags":[]},{"location":"semester_1/letusc/luc117/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc117.c"],"tags":[]},{"location":"semester_1/letusc/luc117/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc117.c"],"tags":[]},{"location":"semester_1/letusc/luc117/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc117.c"],"tags":[]},{"location":"semester_1/letusc/luc118/","level":1,"title":"<code>luc118.c</code>","text":"<p>Problem Statement</p> <p>Write a program to generate 4 images of birds flying in the sky with a computer's mouse in their beak using OpenAI Image API.</p>","path":["Semester 1","Letusc","luc118.c"],"tags":[]},{"location":"semester_1/letusc/luc118/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc118.c"],"tags":[]},{"location":"semester_1/letusc/luc118/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc118.c"],"tags":[]},{"location":"semester_1/letusc/luc118/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc118.c"],"tags":[]},{"location":"semester_1/letusc/luc119/","level":1,"title":"<code>luc119.c</code>","text":"<p>Problem Statement</p> <p>Write a program to analyse a given sentence to detect the mood of the sentence using OpenAI Chat Completion API.</p>","path":["Semester 1","Letusc","luc119.c"],"tags":[]},{"location":"semester_1/letusc/luc119/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc119.c"],"tags":[]},{"location":"semester_1/letusc/luc119/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc119.c"],"tags":[]},{"location":"semester_1/letusc/luc119/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc119.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem001/","level":1,"title":"<code>lucproblem001.c</code>","text":"<p>Problem Statement</p> <p>Consider a currency system in which there are notes of six denominations, namely, Rs. 1, Rs. 2, rs. 5, Rs. 10, Rs. 50, Rs. 100. If a sum of Rs. N is entered through the keyboard, Write a program to compute the smallest number of notes that will combine to give Rs. N.</p>","path":["Semester 1","Letusc","lucproblem001.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem001/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","lucproblem001.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem001/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","lucproblem001.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem001/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","lucproblem001.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem002/","level":1,"title":"<code>lucproblem002.c</code>","text":"<p>Problem Statement</p> <p>A year is entered through the keyboard, write a program to determine whether the year is leap or not. Use the logical operators && and || .</p>","path":["Semester 1","Letusc","lucproblem002.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem002/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","lucproblem002.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem002/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","lucproblem002.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem002/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","lucproblem002.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem003/","level":1,"title":"<code>lucproblem003.c</code>","text":"<p>Problem Statement</p> <p>If a character is entered through the keyboard, Write a program to determine whether the character is a capital letter, a small case letter, a digit or a speacial symbol. The following table shows the range of ASCII values for various characters : Characters ASCII Values A - Z 65 - 90 a - z 97 - 122 0 - 9 48 - 57 special symbols 0 - 47, 58 - 64, 91 - 96, 123 - 127</p>","path":["Semester 1","Letusc","lucproblem003.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem003/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","lucproblem003.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem003/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","lucproblem003.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem003/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","lucproblem003.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem004/","level":1,"title":"<code>lucproblem004.c</code>","text":"<p>Problem Statement</p> <p>If the lengths of three sides of a triangle are entered through the keyboard, write a program to check whether the triangle is valid or not. The triangle is valid if the sum of two sides is greater that the largest of the three sides.</p>","path":["Semester 1","Letusc","lucproblem004.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem004/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","lucproblem004.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem004/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","lucproblem004.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem004/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","lucproblem004.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem005/","level":1,"title":"<code>lucproblem005.c</code>","text":"<p>Problem Statement</p> <p>Write a program to calculate overtime pay of 10 employees. Overtime is paid at the rate of Rs. 120.00 per hour for every hour worked above 40 hours. Assume that employees do not work for fractional part of an hour.</p>","path":["Semester 1","Letusc","lucproblem005.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem005/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","lucproblem005.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem005/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","lucproblem005.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem005/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","lucproblem005.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem006/","level":1,"title":"<code>lucproblem006.c</code>","text":"<p>Problem Statement</p> <p>Write a program to find the factorial value of any number entered through the keyboard.</p>","path":["Semester 1","Letusc","lucproblem006.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem006/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","lucproblem006.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem006/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","lucproblem006.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem006/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","lucproblem006.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem007/","level":1,"title":"<code>lucproblem007.c</code>","text":"<p>Problem Statement</p> <p>Two numbers are entered through the keyboard. Write a program to find the value of one number raised to the power of another</p>","path":["Semester 1","Letusc","lucproblem007.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem007/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","lucproblem007.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem007/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","lucproblem007.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem007/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","lucproblem007.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem008/","level":1,"title":"<code>lucproblem008.c</code>","text":"<p>Problem Statement</p> <p>Write a problem to print all the prime numbers from 1 to 300.</p>","path":["Semester 1","Letusc","lucproblem008.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem008/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","lucproblem008.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem008/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","lucproblem008.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem008/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","lucproblem008.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem009/","level":1,"title":"<code>lucproblem009.c</code>","text":"<p>Problem Statement</p> <p>Write a program to add first seven terms of the following series using a for loop. 1 / 1! + 2 / 2! + 3 / 3! + ...</p>","path":["Semester 1","Letusc","lucproblem009.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem009/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","lucproblem009.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem009/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","lucproblem009.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem009/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","lucproblem009.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem010-complex/","level":1,"title":"<code>lucproblem010-complex.c</code>","text":"<p>Problem Statement</p> <p>Write a program to generate all combinations (permutations) of 1, 2 and 3 from 1-digit numbers up to 4-digit numbers using a main loop to control the number of digits (1 to 3333).</p>","path":["Semester 1","Letusc","lucproblem010-complex.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem010-complex/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","lucproblem010-complex.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem010-complex/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","lucproblem010-complex.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem010-complex/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","lucproblem010-complex.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem010/","level":1,"title":"<code>lucproblem010.c</code>","text":"<p>Problem Statement</p> <p>Write a program to generate all combination of 1, 2 and 3 using for loop.</p>","path":["Semester 1","Letusc","lucproblem010.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem010/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","lucproblem010.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem010/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","lucproblem010.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem010/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","lucproblem010.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem011/","level":1,"title":"<code>lucproblem011.c</code>","text":"<p>Problem Statement</p> <p>Write a menu driven program which has following options : 1. Factorial of a number 2. Prime or not 3. Odd or even 4. Exit Once a menu item is selected the appropriate action should be taken and once this action is finished, the menu should reappear. Unless the user selects the 'Exit' option the program should continue work.</p>","path":["Semester 1","Letusc","lucproblem011.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem011/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","lucproblem011.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem011/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","lucproblem011.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem011/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","lucproblem011.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem012/","level":1,"title":"<code>lucproblem012.c</code>","text":"<p>Problem Statement</p> <p>Write a Function power(a, b), to calculate the value of a raised to b</p>","path":["Semester 1","Letusc","lucproblem012.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem012/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","lucproblem012.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem012/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","lucproblem012.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem012/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","lucproblem012.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem013/","level":1,"title":"<code>lucproblem013.c</code>","text":"<p>Problem Statement</p> <p>Define a function to convert any given year into its Roman equivalent. Use these roman equivalent for decimal numbers : 1 - I, 5 - V, 10 - X, 50 - L, 100 - C, 500 - D, 1000 - M</p>","path":["Semester 1","Letusc","lucproblem013.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem013/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","lucproblem013.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem013/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","lucproblem013.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem013/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","lucproblem013.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem014-short/","level":1,"title":"<code>lucproblem014-short.c</code>","text":"<p>Problem Statement</p> <p>Write a function that receives integers and returns the sum, average and standard deviation of these numbers. Call this function from main() and print the result in main()</p>","path":["Semester 1","Letusc","lucproblem014-short.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem014-short/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","lucproblem014-short.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem014-short/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","lucproblem014-short.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem014-short/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","lucproblem014-short.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem014/","level":1,"title":"<code>lucproblem014.c</code>","text":"<p>Problem Statement</p> <p>Write a function that receives integers and returns the sum, average and standard deviation of these numbers. Call this function from main() and print the result in main()</p>","path":["Semester 1","Letusc","lucproblem014.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem014/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","lucproblem014.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem014/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","lucproblem014.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem014/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","lucproblem014.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem015/","level":1,"title":"<code>lucproblem015.c</code>","text":"<p>Problem Statement</p> <p>Write a program that defines a function that calculates power of one number reaised to another and factorial value of a number in one cell.</p>","path":["Semester 1","Letusc","lucproblem015.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem015/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","lucproblem015.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem015/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","lucproblem015.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem015/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","lucproblem015.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem016/","level":1,"title":"<code>lucproblem016.c</code>","text":"<p>Problem Statement</p> <p>Figure 9.4 shows three memory locations and values stored in them. Write a program to declare variables that implement the relationship shown. How will you print the values and addresses shown in the figure? On which machine the program should be executed to get such addresses? Figure 9.4: value: 3.14, memory_address: 7fff9489c79c value: 7fff9489c7a0, memory_address: 7fff4fd134b8 value: 7fff9489c79c, memory_address: 7fff9489c7a0</p>","path":["Semester 1","Letusc","lucproblem016.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem016/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","lucproblem016.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem016/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","lucproblem016.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem016/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","lucproblem016.c"],"tags":[]},{"location":"semester_1/practice-c/","level":1,"title":"Practice C","text":"<p>Files and sub-folders in Practice C.</p>","path":["Semester 1","Practice c","Practice C"],"tags":[]},{"location":"semester_1/practice-c/#files","level":2,"title":"Files","text":"# File Link 1 <code>external_1.c</code> View Code 2 <code>external_2.c</code> View Code 3 <code>pc-ip-01.c</code> View Code 4 <code>pc-ip-02.c</code> View Code 5 <code>pc-ip-03.c</code> View Code 6 <code>pc-ip-04.c</code> View Code 7 <code>pc-ip-05.c</code> View Code 8 <code>pc-ip-06.c</code> View Code 9 <code>pc-ip-07.c</code> View Code 10 <code>pc-ip-08.c</code> View Code 11 <code>pc-ip-09.c</code> View Code 12 <code>pc-ip-10.c</code> View Code 13 <code>pc-ip-11.c</code> View Code 14 <code>pc-ip-12.c</code> View Code 15 <code>pc-ip-13.c</code> View Code 16 <code>pc-ip-14.c</code> View Code 17 <code>pc-ip-15.c</code> View Code 18 <code>pc-ip-16.c</code> View Code 19 <code>pc-ip-17.c</code> View Code 20 <code>pc-ip-18.c</code> View Code 21 <code>pc-ip-19.c</code> View Code 22 <code>pc-ip-20.c</code> View Code 23 <code>pc001.c</code> View Code 24 <code>pc002.c</code> View Code 25 <code>pc003.c</code> View Code 26 <code>pc004.c</code> View Code 27 <code>pc005.c</code> View Code 28 <code>pc006.c</code> View Code 29 <code>pc007.c</code> View Code 30 <code>pc008.c</code> View Code 31 <code>pc009.c</code> View Code 32 <code>pc010.c</code> View Code 33 <code>pc011.c</code> View Code 34 <code>pc012.c</code> View Code 35 <code>pc013.c</code> View Code 36 <code>pc014.c</code> View Code 37 <code>pc015.c</code> View Code 38 <code>pc016.c</code> View Code 39 <code>pc017.c</code> View Code","path":["Semester 1","Practice c","Practice C"],"tags":[]},{"location":"semester_1/practice-c/external_1/","level":1,"title":"<code>external_1.c</code>","text":"","path":["Semester 1","Practice c","external_1.c"],"tags":[]},{"location":"semester_1/practice-c/external_1/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","external_1.c"],"tags":[]},{"location":"semester_1/practice-c/external_1/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","external_1.c"],"tags":[]},{"location":"semester_1/practice-c/external_2/","level":1,"title":"<code>external_2.c</code>","text":"","path":["Semester 1","Practice c","external_2.c"],"tags":[]},{"location":"semester_1/practice-c/external_2/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","external_2.c"],"tags":[]},{"location":"semester_1/practice-c/external_2/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","external_2.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-01/","level":1,"title":"<code>pc-ip-01.c</code>","text":"<p>Problem Statement</p> <p>Question 1: Write a program to compute the sum and product of digits of an integer using user-defined functions.</p>","path":["Semester 1","Practice c","pc-ip-01.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-01/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 05 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Practice c","pc-ip-01.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-01/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc-ip-01.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-01/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc-ip-01.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-02/","level":1,"title":"<code>pc-ip-02.c</code>","text":"<p>Problem Statement</p> <p>Question 2: Write a program to reverse a non-negative integer using a function.</p>","path":["Semester 1","Practice c","pc-ip-02.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-02/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc-ip-02.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-02/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc-ip-02.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-02/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc-ip-02.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-03/","level":1,"title":"<code>pc-ip-03.c</code>","text":"<p>Problem Statement</p> <p>Question 3: Write a program to compute the sum of the first n terms of the series using a function: S=1-2+3-4+5-6+...</p>","path":["Semester 1","Practice c","pc-ip-03.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-03/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc-ip-03.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-03/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc-ip-03.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-03/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc-ip-03.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-04/","level":1,"title":"<code>pc-ip-04.c</code>","text":"<p>Problem Statement</p> <p>Question 4: Write a function to check whether a number is prime or not. Use the same function to generate all prime numbers less than 100.</p>","path":["Semester 1","Practice c","pc-ip-04.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-04/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 05 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Practice c","pc-ip-04.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-04/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc-ip-04.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-04/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc-ip-04.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-05/","level":1,"title":"<code>pc-ip-05.c</code>","text":"<p>Problem Statement</p> <p>Question 5: Write a function to check whether a given string is a palindrome. Use this function to determine whether an entered string is Palindrome.</p>","path":["Semester 1","Practice c","pc-ip-05.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-05/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 05 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Practice c","pc-ip-05.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-05/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc-ip-05.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-05/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc-ip-05.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-06/","level":1,"title":"<code>pc-ip-06.c</code>","text":"<p>Problem Statement</p> <p>Question 6: Write a program using a function to compute and display all factors of a given number.</p>","path":["Semester 1","Practice c","pc-ip-06.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-06/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc-ip-06.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-06/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc-ip-06.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-06/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc-ip-06.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-07/","level":1,"title":"<code>pc-ip-07.c</code>","text":"<p>Problem Statement</p> <p>Question 7: Write a program to swap two numbers using pointers using user-defined function.</p>","path":["Semester 1","Practice c","pc-ip-07.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-07/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc-ip-07.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-07/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc-ip-07.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-07/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc-ip-07.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-08/","level":1,"title":"<code>pc-ip-08.c</code>","text":"<p>Problem Statement</p> <p>Question 8: Write a program that takes the radius of a circle as input, passes it to a function that computes area and circumference, and displays results in main().</p>","path":["Semester 1","Practice c","pc-ip-08.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-08/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc-ip-08.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-08/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc-ip-08.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-08/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc-ip-08.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-09/","level":1,"title":"<code>pc-ip-09.c</code>","text":"<p>Problem Statement</p> <p>Question 9: Write a program to find the sum of n elements entered by the user. Use dynamic memory allocation (malloc() or calloc()).</p>","path":["Semester 1","Practice c","pc-ip-09.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-09/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 05 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Practice c","pc-ip-09.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-09/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc-ip-09.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-09/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc-ip-09.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-10/","level":1,"title":"<code>pc-ip-10.c</code>","text":"<p>Problem Statement</p> <p>Question 10: Write a function that reverses each elements of an array in place, using only a single pointer argument, and return void.</p>","path":["Semester 1","Practice c","pc-ip-10.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-10/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 05 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Practice c","pc-ip-10.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-10/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc-ip-10.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-10/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc-ip-10.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-11/","level":1,"title":"<code>pc-ip-11.c</code>","text":"<p>Problem Statement</p> <p>Question 11: Write a program to merge two sorted integer arrays to form a single sorted array.</p>","path":["Semester 1","Practice c","pc-ip-11.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-11/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 05 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Practice c","pc-ip-11.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-11/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc-ip-11.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-11/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc-ip-11.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-12/","level":1,"title":"<code>pc-ip-12.c</code>","text":"<p>Problem Statement</p> <p>Question 12: Write a program that reads 10 integers into an array (using pointers), and prints the array in ascending and descending order.</p>","path":["Semester 1","Practice c","pc-ip-12.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-12/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 05 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Practice c","pc-ip-12.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-12/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc-ip-12.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-12/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc-ip-12.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-13/","level":1,"title":"<code>pc-ip-13.c</code>","text":"<p>Problem Statement</p> <p>Question 13: Write a program to display the Fibonacci series using recursive function and iterative function.</p>","path":["Semester 1","Practice c","pc-ip-13.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-13/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 05 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Practice c","pc-ip-13.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-13/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc-ip-13.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-13/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc-ip-13.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-14/","level":1,"title":"<code>pc-ip-14.c</code>","text":"<p>Problem Statement</p> <p>Question 14: Write a program to calculate the factorial of a number using recursive and iterative function.</p>","path":["Semester 1","Practice c","pc-ip-14.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-14/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc-ip-14.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-14/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc-ip-14.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-14/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc-ip-14.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-15/","level":1,"title":"<code>pc-ip-15.c</code>","text":"<p>Problem Statement</p> <p>Question 15: Write a program to calculate the GCD of two numbers using recursive and iterative function.</p>","path":["Semester 1","Practice c","pc-ip-15.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-15/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 05 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Practice c","pc-ip-15.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-15/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc-ip-15.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-15/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc-ip-15.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-16/","level":1,"title":"<code>pc-ip-16.c</code>","text":"<p>Problem Statement</p> <p>Question 16: Write a C program that includes a user-defined function named isArmstrong with the signature int isArmstrong(int num);.</p>","path":["Semester 1","Practice c","pc-ip-16.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-16/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 05 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Practice c","pc-ip-16.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-16/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc-ip-16.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-16/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc-ip-16.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-17/","level":1,"title":"<code>pc-ip-17.c</code>","text":"<p>Problem Statement</p> <p>Question 17: Write a C program that includes a user-defined function named isPerfect with the signature int isPerfect(int num);.</p>","path":["Semester 1","Practice c","pc-ip-17.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-17/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc-ip-17.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-17/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc-ip-17.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-17/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc-ip-17.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-18/","level":1,"title":"<code>pc-ip-18.c</code>","text":"<p>Problem Statement</p> <p>Question 18: Write a C program that includes a user-defined function named findLargest with the signature int findLargest(int arr[], int size);.</p>","path":["Semester 1","Practice c","pc-ip-18.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-18/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 05 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Practice c","pc-ip-18.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-18/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc-ip-18.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-18/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc-ip-18.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-19/","level":1,"title":"<code>pc-ip-19.c</code>","text":"<p>Problem Statement</p> <p>Question 19: Write a C program that includes a user-defined function named binarySearch with the signature int binarySearch(int arr[], int size, int target);.</p>","path":["Semester 1","Practice c","pc-ip-19.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-19/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 05 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Practice c","pc-ip-19.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-19/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc-ip-19.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-19/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc-ip-19.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-20/","level":1,"title":"<code>pc-ip-20.c</code>","text":"<p>Problem Statement</p> <p>Question 20: Write a C program that defines an array of integers, and includes a user-defined function named reverseArray with the signature void reverseArray(int arr[], int size);.</p>","path":["Semester 1","Practice c","pc-ip-20.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-20/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 05 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Practice c","pc-ip-20.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-20/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc-ip-20.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-20/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc-ip-20.c"],"tags":[]},{"location":"semester_1/practice-c/pc001/","level":1,"title":"<code>pc001.c</code>","text":"<p>Problem Statement</p> <p>Pattern : 1 1 2 1 2 3 1 2 3 4 1 2 3 4 5 for n = 5</p>","path":["Semester 1","Practice c","pc001.c"],"tags":[]},{"location":"semester_1/practice-c/pc001/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc001.c"],"tags":[]},{"location":"semester_1/practice-c/pc001/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc001.c"],"tags":[]},{"location":"semester_1/practice-c/pc001/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc001.c"],"tags":[]},{"location":"semester_1/practice-c/pc002/","level":1,"title":"<code>pc002.c</code>","text":"<p>Problem Statement</p> <p>Pattern : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 for n = 5</p>","path":["Semester 1","Practice c","pc002.c"],"tags":[]},{"location":"semester_1/practice-c/pc002/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc002.c"],"tags":[]},{"location":"semester_1/practice-c/pc002/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc002.c"],"tags":[]},{"location":"semester_1/practice-c/pc002/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc002.c"],"tags":[]},{"location":"semester_1/practice-c/pc003/","level":1,"title":"<code>pc003.c</code>","text":"<p>Problem Statement</p> <p>Pattern : 1 2 4 3 6 9 4 8 12 16 5 10 15 20 25 for n = 5</p>","path":["Semester 1","Practice c","pc003.c"],"tags":[]},{"location":"semester_1/practice-c/pc003/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc003.c"],"tags":[]},{"location":"semester_1/practice-c/pc003/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc003.c"],"tags":[]},{"location":"semester_1/practice-c/pc003/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc003.c"],"tags":[]},{"location":"semester_1/practice-c/pc004/","level":1,"title":"<code>pc004.c</code>","text":"<p>Problem Statement</p> <p>Pattern : 5 4 3 2 1 4 3 2 1 3 2 1 2 1 1 for n = 5</p>","path":["Semester 1","Practice c","pc004.c"],"tags":[]},{"location":"semester_1/practice-c/pc004/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc004.c"],"tags":[]},{"location":"semester_1/practice-c/pc004/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc004.c"],"tags":[]},{"location":"semester_1/practice-c/pc004/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc004.c"],"tags":[]},{"location":"semester_1/practice-c/pc005/","level":1,"title":"<code>pc005.c</code>","text":"<p>Problem Statement</p> <p>Pattern : 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 for n = 5</p>","path":["Semester 1","Practice c","pc005.c"],"tags":[]},{"location":"semester_1/practice-c/pc005/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc005.c"],"tags":[]},{"location":"semester_1/practice-c/pc005/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc005.c"],"tags":[]},{"location":"semester_1/practice-c/pc005/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc005.c"],"tags":[]},{"location":"semester_1/practice-c/pc006/","level":1,"title":"<code>pc006.c</code>","text":"<p>Problem Statement</p> <p>Prime number check</p>","path":["Semester 1","Practice c","pc006.c"],"tags":[]},{"location":"semester_1/practice-c/pc006/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Practice c","pc006.c"],"tags":[]},{"location":"semester_1/practice-c/pc006/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc006.c"],"tags":[]},{"location":"semester_1/practice-c/pc006/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc006.c"],"tags":[]},{"location":"semester_1/practice-c/pc007/","level":1,"title":"<code>pc007.c</code>","text":"<p>Problem Statement</p> <p>Armstrong number check only for three digit</p>","path":["Semester 1","Practice c","pc007.c"],"tags":[]},{"location":"semester_1/practice-c/pc007/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc007.c"],"tags":[]},{"location":"semester_1/practice-c/pc007/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc007.c"],"tags":[]},{"location":"semester_1/practice-c/pc007/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc007.c"],"tags":[]},{"location":"semester_1/practice-c/pc008/","level":1,"title":"<code>pc008.c</code>","text":"<p>Problem Statement</p> <p>Factorial upto N</p>","path":["Semester 1","Practice c","pc008.c"],"tags":[]},{"location":"semester_1/practice-c/pc008/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc008.c"],"tags":[]},{"location":"semester_1/practice-c/pc008/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc008.c"],"tags":[]},{"location":"semester_1/practice-c/pc008/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc008.c"],"tags":[]},{"location":"semester_1/practice-c/pc009/","level":1,"title":"<code>pc009.c</code>","text":"<p>Problem Statement</p> <p>Sum of digit</p>","path":["Semester 1","Practice c","pc009.c"],"tags":[]},{"location":"semester_1/practice-c/pc009/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc009.c"],"tags":[]},{"location":"semester_1/practice-c/pc009/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc009.c"],"tags":[]},{"location":"semester_1/practice-c/pc009/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc009.c"],"tags":[]},{"location":"semester_1/practice-c/pc010/","level":1,"title":"<code>pc010.c</code>","text":"<p>Problem Statement</p> <p>Reverse a number</p>","path":["Semester 1","Practice c","pc010.c"],"tags":[]},{"location":"semester_1/practice-c/pc010/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc010.c"],"tags":[]},{"location":"semester_1/practice-c/pc010/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc010.c"],"tags":[]},{"location":"semester_1/practice-c/pc010/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc010.c"],"tags":[]},{"location":"semester_1/practice-c/pc011/","level":1,"title":"<code>pc011.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that takes two positive integers, L (Lower Bound) and U (Upper Bound), as input from the user. The program must find and print the count of all numbers between L and U (inclusive) that are also a Palindrome Number.</p>","path":["Semester 1","Practice c","pc011.c"],"tags":[]},{"location":"semester_1/practice-c/pc011/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Practice c","pc011.c"],"tags":[]},{"location":"semester_1/practice-c/pc011/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc011.c"],"tags":[]},{"location":"semester_1/practice-c/pc011/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc011.c"],"tags":[]},{"location":"semester_1/practice-c/pc012/","level":1,"title":"<code>pc012.c</code>","text":"<p>Problem Statement</p> <p>Write a C function that receives a string (character array) and uses pointers to count and return the total number of vowels and consonants in that string.</p>","path":["Semester 1","Practice c","pc012.c"],"tags":[]},{"location":"semester_1/practice-c/pc012/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Practice c","pc012.c"],"tags":[]},{"location":"semester_1/practice-c/pc012/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc012.c"],"tags":[]},{"location":"semester_1/practice-c/pc012/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc012.c"],"tags":[]},{"location":"semester_1/practice-c/pc013/","level":1,"title":"<code>pc013.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that defines a structure named Book with attributes bookID (int), title (string), and price (float). Include a user-defined function named updatePrice with the signature: void updatePrice(struct Book *b, float newPrice); The program should: Accept details for one book from the user. Display the details before the update. Use the function to update the price of the book. Display the updated details.</p>","path":["Semester 1","Practice c","pc013.c"],"tags":[]},{"location":"semester_1/practice-c/pc013/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc013.c"],"tags":[]},{"location":"semester_1/practice-c/pc013/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc013.c"],"tags":[]},{"location":"semester_1/practice-c/pc013/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc013.c"],"tags":[]},{"location":"semester_1/practice-c/pc014/","level":1,"title":"<code>pc014.c</code>","text":"<p>Problem Statement</p> <p>Write a c program that defines a structure Student with the following members: roll (int), name (string), and marks (float). Do the below: Create an array to store details for 3 students. Read the details for these 3 student from a file named students.txt. (Assume the file contains data in the format: Roll Name Marks). Implement a recursive function float calculateTotal(struct Student arr[], int n) to calculate the sum of marks of all students in the array. Display each student's details and the total marks calculated by the recursive function.</p>","path":["Semester 1","Practice c","pc014.c"],"tags":[]},{"location":"semester_1/practice-c/pc014/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc014.c"],"tags":[]},{"location":"semester_1/practice-c/pc014/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc014.c"],"tags":[]},{"location":"semester_1/practice-c/pc014/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc014.c"],"tags":[]},{"location":"semester_1/practice-c/pc015/","level":1,"title":"<code>pc015.c</code>","text":"<p>Problem Statement</p> <p>Write a C program to reverse a string using a recursive function.</p>","path":["Semester 1","Practice c","pc015.c"],"tags":[]},{"location":"semester_1/practice-c/pc015/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc015.c"],"tags":[]},{"location":"semester_1/practice-c/pc015/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc015.c"],"tags":[]},{"location":"semester_1/practice-c/pc015/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc015.c"],"tags":[]},{"location":"semester_1/practice-c/pc016/","level":1,"title":"<code>pc016.c</code>","text":"<p>Problem Statement</p> <p>Write a c program that records book data from user and stores them in to a file.</p>","path":["Semester 1","Practice c","pc016.c"],"tags":[]},{"location":"semester_1/practice-c/pc016/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc016.c"],"tags":[]},{"location":"semester_1/practice-c/pc016/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc016.c"],"tags":[]},{"location":"semester_1/practice-c/pc016/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc016.c"],"tags":[]},{"location":"semester_1/practice-c/pc017/","level":1,"title":"<code>pc017.c</code>","text":"<p>Problem Statement</p> <p>Write a program to calculate the difference between two time periods using structures.</p>","path":["Semester 1","Practice c","pc017.c"],"tags":[]},{"location":"semester_1/practice-c/pc017/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc017.c"],"tags":[]},{"location":"semester_1/practice-c/pc017/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc017.c"],"tags":[]},{"location":"semester_1/practice-c/pc017/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc017.c"],"tags":[]},{"location":"semester_1/temp/","level":1,"title":"Temp","text":"<p>Files and sub-folders in Temp.</p>","path":["Semester 1","Temp"],"tags":[]},{"location":"semester_1/temp/#files","level":2,"title":"Files","text":"# File Link 1 <code>maheswar01.c</code> View Code 2 <code>maheswar02.c</code> View Code 3 <code>sudipto1.c</code> View Code 4 <code>sudiptoown01.c</code> View Code","path":["Semester 1","Temp"],"tags":[]},{"location":"semester_1/temp/maheswar01/","level":1,"title":"<code>maheswar01.c</code>","text":"","path":["Semester 1","Temp","maheswar01.c"],"tags":[]},{"location":"semester_1/temp/maheswar01/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Temp","maheswar01.c"],"tags":[]},{"location":"semester_1/temp/maheswar01/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Temp","maheswar01.c"],"tags":[]},{"location":"semester_1/temp/maheswar02/","level":1,"title":"<code>maheswar02.c</code>","text":"","path":["Semester 1","Temp","maheswar02.c"],"tags":[]},{"location":"semester_1/temp/maheswar02/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Temp","maheswar02.c"],"tags":[]},{"location":"semester_1/temp/maheswar02/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Temp","maheswar02.c"],"tags":[]},{"location":"semester_1/temp/sudipto1/","level":1,"title":"<code>sudipto1.c</code>","text":"<p>Problem Statement</p> <p>A smart home security controller monitors the state of several sensors to decide what action to take. Each second, the system reads data from sensors that can either be active or inactive. Based on the current state of all sensors, the controller must perform exactly one action, such as activating a warning, checking a specific zone, or declaring an intrusion. Write a C program that reads the sensor states as input and prints the corresponding system action. -- Conditions: 1. You must determine exactly one action for every possible combination of sensor states. 2. You are not allowed to use any conditional statements (if, else if, else, or the ternary operator?). 3. You are not allowed to use logical operators. 4. You must use a single switch statement to control the program's behaviour. 5. Loops may only be used for reading input, not for making decisions. 6. The program should handle all possible combinations of the sensors' active/inactive states and print the appropriate response each time. -- Example (for understanding): If all sensors are inactive, the system should remain idle. If some sensors are active, the system should issue warnings or alerts based on the situation. If all sensors are active, the system should declare a confirmed intrusion.</p>","path":["Semester 1","Temp","sudipto1.c"],"tags":[]},{"location":"semester_1/temp/sudipto1/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Temp","sudipto1.c"],"tags":[]},{"location":"semester_1/temp/sudipto1/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Temp","sudipto1.c"],"tags":[]},{"location":"semester_1/temp/sudipto1/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Temp","sudipto1.c"],"tags":[]},{"location":"semester_1/temp/sudiptoown01/","level":1,"title":"<code>sudiptoown01.c</code>","text":"","path":["Semester 1","Temp","sudiptoown01.c"],"tags":[]},{"location":"semester_1/temp/sudiptoown01/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Temp","sudiptoown01.c"],"tags":[]},{"location":"semester_1/temp/sudiptoown01/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Temp","sudiptoown01.c"],"tags":[]},{"location":"semester_1/tuition-c/","level":1,"title":"Tuition C","text":"<p>Files and sub-folders in Tuition C.</p>","path":["Semester 1","Tuition c","Tuition C"],"tags":[]},{"location":"semester_1/tuition-c/#files","level":2,"title":"Files","text":"# File Link 1 <code>APC-PRAC-001.c</code> View Code 2 <code>APC-PRAC-002.c</code> View Code 3 <code>APC-PRAC-003.c</code> View Code 4 <code>APC-PRAC-004.c</code> View Code 5 <code>APC-PRAC-005.c</code> View Code 6 <code>APC-PRAC-006.c</code> View Code 7 <code>APC-PRAC-007.c</code> View Code 8 <code>APC-PRAC-008.c</code> View Code 9 <code>APC-PRAC-009.c</code> View Code 10 <code>APC-PRAC-010.c</code> View Code 11 <code>APC-PRAC-011.c</code> View Code 12 <code>APC-PRAC-012.c</code> View Code 13 <code>APC-PRAC-013.c</code> View Code 14 <code>APC-PRAC-014.c</code> View Code 15 <code>APC-PRAC-015.c</code> View Code 16 <code>APC-PRAC-016.c</code> View Code 17 <code>APC-PRAC-017.c</code> View Code 18 <code>APC-PRAC-018.c</code> View Code 19 <code>APC-PRAC-019.c</code> View Code 20 <code>APC-PRAC-020.c</code> View Code 21 <code>APC-PRAC-021.c</code> View Code 22 <code>APC-PRAC-022.c</code> View Code 23 <code>APC-PRAC-023.c</code> View Code 24 <code>APC-PRAC-024.c</code> View Code 25 <code>APC-PRAC-025.c</code> View Code 26 <code>APC-PRAC-026.c</code> View Code 27 <code>APC-PRAC-027.c</code> View Code 28 <code>APC-PRAC-028.c</code> View Code 29 <code>APC-PRAC-029.c</code> View Code 30 <code>APC-PRAC-030.c</code> View Code 31 <code>APC-PRAC-031.c</code> View Code 32 <code>APC-PRAC-032.c</code> View Code 33 <code>APC-PRAC-033.c</code> View Code 34 <code>APC-PRAC-034.c</code> View Code 35 <code>APC-PRAC-035.c</code> View Code 36 <code>APC-PRAC-036.c</code> View Code 37 <code>APC-PRAC-037.c</code> View Code 38 <code>APC-PRAC-038.c</code> View Code 39 <code>APC-PRAC-039.c</code> View Code 40 <code>APC-PRAC-040.c</code> View Code 41 <code>APC-PRAC-041.c</code> View Code 42 <code>APC-PRAC-042.c</code> View Code 43 <code>APC-S-001.c</code> View Code 44 <code>APC-S-002.c</code> View Code 45 <code>APC-S-003.c</code> View Code 46 <code>APC-S-004.c</code> View Code 47 <code>APC-S-005.c</code> View Code 48 <code>APC-S-006.c</code> View Code 49 <code>APC-S-007.c</code> View Code 50 <code>APC-S-008.c</code> View Code 51 <code>APC-S-009.c</code> View Code 52 <code>APC-S-010.c</code> View Code 53 <code>APC-S-011.c</code> View Code 54 <code>APC-S-012.c</code> View Code 55 <code>APC-S-013.c</code> View Code 56 <code>APC-S-014.c</code> View Code 57 <code>APC-SPS-001.c</code> View Code 58 <code>APC-SPS-002.c</code> View Code 59 <code>APC-SPS-003.c</code> View Code 60 <code>APC-SPS-004.c</code> View Code 61 <code>APC-SPS-005.c</code> View Code 62 <code>APC-SPS-006.c</code> View Code 63 <code>APC-SPS-007.c</code> View Code 64 <code>APC-SPS-008.c</code> View Code 65 <code>P001.c</code> View Code 66 <code>P002.c</code> View Code 67 <code>P003.c</code> View Code 68 <code>P004.c</code> View Code 69 <code>P005.c</code> View Code 70 <code>P006.c</code> View Code 71 <code>P007.c</code> View Code 72 <code>P008.c</code> View Code 73 <code>P009.c</code> View Code 74 <code>P010.c</code> View Code 75 <code>P011.c</code> View Code 76 <code>P012.c</code> View Code 77 <code>P013.c</code> View Code 78 <code>P014.c</code> View Code 79 <code>P015.c</code> View Code 80 <code>P016.c</code> View Code 81 <code>P017.c</code> View Code 82 <code>P018.c</code> View Code 83 <code>P019.c</code> View Code 84 <code>P020.c</code> View Code 85 <code>P021.c</code> View Code 86 <code>P022.c</code> View Code 87 <code>P023.c</code> View Code 88 <code>P024.c</code> View Code 89 <code>P025.c</code> View Code 90 <code>P026.c</code> View Code 91 <code>P027.c</code> View Code 92 <code>P028.c</code> View Code 93 <code>P029.c</code> View Code 94 <code>P030.c</code> View Code 95 <code>P031.c</code> View Code 96 <code>P032.c</code> View Code 97 <code>P033.c</code> View Code 98 <code>P034.c</code> View Code 99 <code>P035.c</code> View Code 100 <code>P036.c</code> View Code 101 <code>P037.c</code> View Code 102 <code>P038.c</code> View Code 103 <code>P039.c</code> View Code 104 <code>P040.c</code> View Code 105 <code>P041.c</code> View Code 106 <code>P042.c</code> View Code 107 <code>P043.c</code> View Code 108 <code>P044.c</code> View Code 109 <code>P045.c</code> View Code 110 <code>P046.c</code> View Code 111 <code>P047.c</code> View Code 112 <code>P048.c</code> View Code 113 <code>P049.c</code> View Code 114 <code>P050-SHORT.c</code> View Code 115 <code>P050.c</code> View Code 116 <code>P051.c</code> View Code 117 <code>P052.c</code> View Code 118 <code>P053.c</code> View Code 119 <code>P054.c</code> View Code 120 <code>P055.c</code> View Code 121 <code>P056.c</code> View Code 122 <code>P057.c</code> View Code 123 <code>P058.c</code> View Code 124 <code>P059.c</code> View Code 125 <code>P060.c</code> View Code 126 <code>P061.c</code> View Code 127 <code>P062.c</code> View Code 128 <code>P063.c</code> View Code 129 <code>P064.c</code> View Code 130 <code>P065.c</code> View Code 131 <code>P066.c</code> View Code 132 <code>P067.c</code> View Code 133 <code>P068.c</code> View Code 134 <code>P069.c</code> View Code 135 <code>P070.c</code> View Code","path":["Semester 1","Tuition c","Tuition C"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-001/","level":1,"title":"<code>APC-PRAC-001.c</code>","text":"<p>Problem Statement</p> <p>WAP to calculate area and perimeter of a rectangle by accepting length and breadth as input.</p>","path":["Semester 1","Tuition c","APC-PRAC-001.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-001/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-001.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-001/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-001.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-001/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-001.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-002/","level":1,"title":"<code>APC-PRAC-002.c</code>","text":"<p>Problem Statement</p> <p>WAP to calculate area of a circle using math library method. Take radius of the circle as input.</p>","path":["Semester 1","Tuition c","APC-PRAC-002.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-002/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-002.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-002/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-002.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-002/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-002.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-003/","level":1,"title":"<code>APC-PRAC-003.c</code>","text":"<p>Problem Statement</p> <p>WAP to accept diagonal of a square and calculate area, parimeter</p>","path":["Semester 1","Tuition c","APC-PRAC-003.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-003/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-003.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-003/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-003.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-003/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-003.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-004/","level":1,"title":"<code>APC-PRAC-004.c</code>","text":"<p>Problem Statement</p> <p>WAP to calculate and display radius of a circle by taking the area as input.</p>","path":["Semester 1","Tuition c","APC-PRAC-004.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-004/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-004.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-004/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-004.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-004/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-004.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-005/","level":1,"title":"<code>APC-PRAC-005.c</code>","text":"<p>Problem Statement</p> <p>WAP a program that accept number of days as input and represent it as years, months and days.</p>","path":["Semester 1","Tuition c","APC-PRAC-005.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-005/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-005.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-005/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-005.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-005/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-005.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-006/","level":1,"title":"<code>APC-PRAC-006.c</code>","text":"<p>Problem Statement</p> <p>WAP that accept seconds as input and represent it an hours, minutes and seconds.</p>","path":["Semester 1","Tuition c","APC-PRAC-006.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-006/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-006.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-006/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-006.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-006/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-006.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-007/","level":1,"title":"<code>APC-PRAC-007.c</code>","text":"<p>Problem Statement</p> <p>WAP that accept basic salary of an employee and display gross salary, net salary generated by below formula. DA = 25% of the basic salary. HRA = 12.5% of the basic salary. PF = 10% of the basic salary. gross salary = basic salary + da + hra net salary = gross salary - pf</p>","path":["Semester 1","Tuition c","APC-PRAC-007.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-007/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-007.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-007/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-007.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-007/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-007.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-008/","level":1,"title":"<code>APC-PRAC-008.c</code>","text":"<p>Problem Statement</p> <p>WAP to multiply and divide a number by 4 without using multiplication and division operator.</p>","path":["Semester 1","Tuition c","APC-PRAC-008.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-008/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-008.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-008/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-008.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-008/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-008.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-009/","level":1,"title":"<code>APC-PRAC-009.c</code>","text":"<p>Problem Statement</p> <p>WAP to swap two integer variable without using Third variable.</p>","path":["Semester 1","Tuition c","APC-PRAC-009.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-009/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-009.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-009/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-009.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-009/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-009.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-010/","level":1,"title":"<code>APC-PRAC-010.c</code>","text":"<p>Problem Statement</p> <p>WAP to calculate and display the valve of the given expression : (1/a^3) + (1/(b+2)^3) + (1/(c^4 + root(2))) take a, b, c as input.</p>","path":["Semester 1","Tuition c","APC-PRAC-010.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-010/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-010.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-010/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-010.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-010/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-010.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-011/","level":1,"title":"<code>APC-PRAC-011.c</code>","text":"<p>Problem Statement</p> <p>Write a program to input positive number and check whether the number is perfect square or not. If the number is negetive then display appropriate message</p>","path":["Semester 1","Tuition c","APC-PRAC-011.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-011/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-011.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-011/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-011.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-011/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-011.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-012/","level":1,"title":"<code>APC-PRAC-012.c</code>","text":"<p>Problem Statement</p> <p>Write a program to input three integer and find out second largest</p>","path":["Semester 1","Tuition c","APC-PRAC-012.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-012/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-012.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-012/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-012.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-012/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-012.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-013/","level":1,"title":"<code>APC-PRAC-013.c</code>","text":"<p>Problem Statement</p> <p>Write a program to input sum(p), rate of interest(r), time(t) and type of interest ('s' for simple interes, 'c' for compound interest), then calculate and display the earned interest</p>","path":["Semester 1","Tuition c","APC-PRAC-013.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-013/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-013.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-013/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-013.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-013/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-013.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-014/","level":1,"title":"<code>APC-PRAC-014.c</code>","text":"<p>Problem Statement</p> <p>Write a program to calculate and display the maturity amount taking the sum and number of days as input. No. of Days Rate of Interest =========== ================ <= 180 5.57 % 181 - 364 7.75 % 365 - 500 9.25 % > 500 9.15 %</p>","path":["Semester 1","Tuition c","APC-PRAC-014.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-014/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-014.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-014/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-014.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-014/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-014.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-015/","level":1,"title":"<code>APC-PRAC-015.c</code>","text":"<p>Problem Statement</p> <p>Write a program to display all numbers between lb (lower bound) and up (upper bound) which ends with digit 7 or divisible by 7.</p>","path":["Semester 1","Tuition c","APC-PRAC-015.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-015/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-015.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-015/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-015.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-015/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-015.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-016/","level":1,"title":"<code>APC-PRAC-016.c</code>","text":"<p>Problem Statement</p> <p>Write a program to check palindrome number.</p>","path":["Semester 1","Tuition c","APC-PRAC-016.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-016/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-016.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-016/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-016.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-016/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-016.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-017/","level":1,"title":"<code>APC-PRAC-017.c</code>","text":"<p>Problem Statement</p> <p>Write a program to check perfect number.</p>","path":["Semester 1","Tuition c","APC-PRAC-017.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-017/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-017.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-017/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-017.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-017/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-017.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-018/","level":1,"title":"<code>APC-PRAC-018.c</code>","text":"<p>Problem Statement</p> <p>Write a program to check Automorphic Number.</p>","path":["Semester 1","Tuition c","APC-PRAC-018.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-018/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-018.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-018/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-018.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-018/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-018.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-019/","level":1,"title":"<code>APC-PRAC-019.c</code>","text":"<p>Problem Statement</p> <p>Write a program to find hcf of two numbers</p>","path":["Semester 1","Tuition c","APC-PRAC-019.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-019/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-019.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-019/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-019.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-019/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-019.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-020/","level":1,"title":"<code>APC-PRAC-020.c</code>","text":"<p>Problem Statement</p> <p>Write a program to check if two number is co-prime or not</p>","path":["Semester 1","Tuition c","APC-PRAC-020.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-020/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-020.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-020/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-020.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-020/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-020.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-021/","level":1,"title":"<code>APC-PRAC-021.c</code>","text":"<p>Problem Statement</p> <p>Write a program to check special number (sum of digit + product of digit = original number)</p>","path":["Semester 1","Tuition c","APC-PRAC-021.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-021/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-021.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-021/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-021.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-021/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-021.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-022/","level":1,"title":"<code>APC-PRAC-022.c</code>","text":"<p>Problem Statement</p> <p>Write a program to accept a number and check whether the number is twisted prime or not</p>","path":["Semester 1","Tuition c","APC-PRAC-022.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-022/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","APC-PRAC-022.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-022/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-022.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-022/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-022.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-023/","level":1,"title":"<code>APC-PRAC-023.c</code>","text":"<p>Problem Statement</p> <p>Pattern : (a) 1, -3, 5, -7, 9, -11, ... upto n times (b) 0, 3, 8, 15, ... upto n times</p>","path":["Semester 1","Tuition c","APC-PRAC-023.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-023/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","APC-PRAC-023.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-023/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-023.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-023/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-023.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-024/","level":1,"title":"<code>APC-PRAC-024.c</code>","text":"<p>Problem Statement</p> <p>Pattern: 1 2 1 3 2 1 4 3 2 1 5 4 3 2 1</p>","path":["Semester 1","Tuition c","APC-PRAC-024.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-024/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-024.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-024/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-024.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-024/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-024.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-025/","level":1,"title":"<code>APC-PRAC-025.c</code>","text":"<p>Problem Statement</p> <p>Pattern: 5 4 3 2 1 5 4 3 2 5 4 3 5 4 5</p>","path":["Semester 1","Tuition c","APC-PRAC-025.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-025/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-025.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-025/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-025.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-025/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-025.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-026/","level":1,"title":"<code>APC-PRAC-026.c</code>","text":"<p>Problem Statement</p> <p>Pattern: 5 5 4 5 4 3 5 4 3 2 5 4 3 2 1</p>","path":["Semester 1","Tuition c","APC-PRAC-026.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-026/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-026.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-026/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-026.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-026/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-026.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-027/","level":1,"title":"<code>APC-PRAC-027.c</code>","text":"<p>Problem Statement</p> <p>Pattern: 1 2 3 4 5 2 3 4 5 3 4 5 4 5 5</p>","path":["Semester 1","Tuition c","APC-PRAC-027.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-027/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-027.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-027/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-027.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-027/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-027.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-028/","level":1,"title":"<code>APC-PRAC-028.c</code>","text":"<p>Problem Statement</p> <p>Pattern: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15</p>","path":["Semester 1","Tuition c","APC-PRAC-028.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-028/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-028.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-028/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-028.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-028/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-028.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-029/","level":1,"title":"<code>APC-PRAC-029.c</code>","text":"<p>Problem Statement</p> <p>Pattern: 1 1 0 1 0 1 1 0 1 0 1 0 1 0 1</p>","path":["Semester 1","Tuition c","APC-PRAC-029.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-029/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-029.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-029/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-029.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-029/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-029.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-030/","level":1,"title":"<code>APC-PRAC-030.c</code>","text":"<p>Problem Statement</p> <p>Pattern: # @ @ # # # @ @ @ @ # # # # #</p>","path":["Semester 1","Tuition c","APC-PRAC-030.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-030/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-030.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-030/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-030.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-030/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-030.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-031/","level":1,"title":"<code>APC-PRAC-031.c</code>","text":"<p>Problem Statement</p> <p>Pattern: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15</p>","path":["Semester 1","Tuition c","APC-PRAC-031.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-031/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-031.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-031/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-031.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-031/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-031.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-032/","level":1,"title":"<code>APC-PRAC-032.c</code>","text":"<p>Problem Statement</p> <p>Pattern: A B B C C C D D D D E E E E E</p>","path":["Semester 1","Tuition c","APC-PRAC-032.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-032/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-032.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-032/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-032.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-032/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-032.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-033/","level":1,"title":"<code>APC-PRAC-033.c</code>","text":"<p>Problem Statement</p> <p>Print the factorial of the digits off a number</p>","path":["Semester 1","Tuition c","APC-PRAC-033.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-033/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-033.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-033/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-033.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-033/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-033.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-034/","level":1,"title":"<code>APC-PRAC-034.c</code>","text":"<p>Problem Statement</p> <p>Take a Range as input from user and print the prime number between it.</p>","path":["Semester 1","Tuition c","APC-PRAC-034.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-034/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-034.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-034/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-034.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-034/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-034.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-035/","level":1,"title":"<code>APC-PRAC-035.c</code>","text":"<p>Problem Statement</p> <p>Print all the 3 and 4 digit palindrome number.</p>","path":["Semester 1","Tuition c","APC-PRAC-035.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-035/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-035.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-035/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-035.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-035/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-035.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-036/","level":1,"title":"<code>APC-PRAC-036.c</code>","text":"<p>Problem Statement</p> <p>Check krishnamurty number.</p>","path":["Semester 1","Tuition c","APC-PRAC-036.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-036/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","APC-PRAC-036.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-036/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-036.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-036/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-036.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-037/","level":1,"title":"<code>APC-PRAC-037.c</code>","text":"<p>Problem Statement</p> <p>Show all the armstrong number between a range.</p>","path":["Semester 1","Tuition c","APC-PRAC-037.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-037/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","APC-PRAC-037.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-037/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-037.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-037/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-037.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-038/","level":1,"title":"<code>APC-PRAC-038.c</code>","text":"<p>Problem Statement</p> <p>Print all combinations of two two-digit numbers such that the sum of digits of both numbers is equal. Example: 23 and 41 → (2+3) = 5, (4+1) = 5.</p>","path":["Semester 1","Tuition c","APC-PRAC-038.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-038/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-038.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-038/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-038.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-038/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-038.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-039/","level":1,"title":"<code>APC-PRAC-039.c</code>","text":"<p>Problem Statement</p> <p>Write a C program to print all unique combinations of three numbers (a, b, c) such that: 1 ≤ a, b, c ≤ 30 and a² + b² = c² (Pythagorean triplets)</p>","path":["Semester 1","Tuition c","APC-PRAC-039.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-039/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-039.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-039/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-039.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-039/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-039.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-040/","level":1,"title":"<code>APC-PRAC-040.c</code>","text":"<p>Problem Statement</p> <p>Write a C program to count how many numbers between 100 and 999 have all distinct digits (e.g., 123, 709, 981).</p>","path":["Semester 1","Tuition c","APC-PRAC-040.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-040/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-040.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-040/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-040.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-040/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-040.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-041/","level":1,"title":"<code>APC-PRAC-041.c</code>","text":"<p>Problem Statement</p> <p>Write a C program to find and print all twin prime pairs between 1 and n using nested loops. (Twin primes are prime numbers having a difference of 2, like 11 and 13)</p>","path":["Semester 1","Tuition c","APC-PRAC-041.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-041/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","APC-PRAC-041.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-041/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-041.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-041/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-041.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-042/","level":1,"title":"<code>APC-PRAC-042.c</code>","text":"<p>Problem Statement</p> <p>Write a function to check whether a given string is a palindrome. Use this function to determine whether an entered string is Palindrome.</p>","path":["Semester 1","Tuition c","APC-PRAC-042.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-042/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","APC-PRAC-042.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-042/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-042.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-042/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-042.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-001/","level":1,"title":"<code>APC-S-001.c</code>","text":"","path":["Semester 1","Tuition c","APC-S-001.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-001/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-S-001.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-001/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-S-001.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-001/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-S-001.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-002/","level":1,"title":"<code>APC-S-002.c</code>","text":"","path":["Semester 1","Tuition c","APC-S-002.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-002/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-S-002.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-002/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-S-002.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-002/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-S-002.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-003/","level":1,"title":"<code>APC-S-003.c</code>","text":"","path":["Semester 1","Tuition c","APC-S-003.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-003/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-S-003.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-003/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-S-003.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-003/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-S-003.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-004/","level":1,"title":"<code>APC-S-004.c</code>","text":"<p>Problem Statement</p> <p>Program to print first 10 natural numbers using while loop.</p>","path":["Semester 1","Tuition c","APC-S-004.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-004/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-S-004.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-004/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-S-004.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-004/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-S-004.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-005/","level":1,"title":"<code>APC-S-005.c</code>","text":"<p>Problem Statement</p> <p>Write to reverse a number.</p>","path":["Semester 1","Tuition c","APC-S-005.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-005/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-S-005.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-005/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-S-005.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-005/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-S-005.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-006/","level":1,"title":"<code>APC-S-006.c</code>","text":"<p>Problem Statement</p> <p>Write a program to print first 10 multiple of 5</p>","path":["Semester 1","Tuition c","APC-S-006.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-006/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-S-006.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-006/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-S-006.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-006/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-S-006.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-007/","level":1,"title":"<code>APC-S-007.c</code>","text":"<p>Problem Statement</p> <p>Write a program the sum of first 10 natural numbers.</p>","path":["Semester 1","Tuition c","APC-S-007.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-007/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-S-007.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-007/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-S-007.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-007/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-S-007.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-008/","level":1,"title":"<code>APC-S-008.c</code>","text":"<p>Problem Statement</p> <p>Write a program to print the sum of two matrix as input given by the user.</p>","path":["Semester 1","Tuition c","APC-S-008.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-008/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","APC-S-008.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-008/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-S-008.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-008/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-S-008.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-009/","level":1,"title":"<code>APC-S-009.c</code>","text":"<p>Problem Statement</p> <p>Write a program to find the upper and lower triangular matrix.</p>","path":["Semester 1","Tuition c","APC-S-009.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-009/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","APC-S-009.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-009/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-S-009.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-009/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-S-009.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-010/","level":1,"title":"<code>APC-S-010.c</code>","text":"<p>Problem Statement</p> <p>Write a program to input a new element at a specific position of an array. a[] = {4, 5, 2, 10, 6, 9, 8}, newItem = 7, position = 3</p>","path":["Semester 1","Tuition c","APC-S-010.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-010/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-S-010.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-010/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-S-010.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-010/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-S-010.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-011/","level":1,"title":"<code>APC-S-011.c</code>","text":"<p>Problem Statement</p> <p>Linear search</p>","path":["Semester 1","Tuition c","APC-S-011.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-011/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-S-011.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-011/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-S-011.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-011/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-S-011.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-012/","level":1,"title":"<code>APC-S-012.c</code>","text":"<p>Problem Statement</p> <p>Write a program to check if a matrix is a sparx matrix.</p>","path":["Semester 1","Tuition c","APC-S-012.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-012/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-S-012.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-012/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-S-012.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-012/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-S-012.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-013/","level":1,"title":"<code>APC-S-013.c</code>","text":"<p>Problem Statement</p> <p>Write a fuction to calculate the average of an array</p>","path":["Semester 1","Tuition c","APC-S-013.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-013/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-S-013.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-013/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-S-013.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-013/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-S-013.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-014/","level":1,"title":"<code>APC-S-014.c</code>","text":"<p>Problem Statement</p> <p>Write a program to store roll no, name and marks of 5 students then print it. use structure</p>","path":["Semester 1","Tuition c","APC-S-014.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-014/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-S-014.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-014/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-S-014.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-014/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-S-014.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-001/","level":1,"title":"<code>APC-SPS-001.c</code>","text":"","path":["Semester 1","Tuition c","APC-SPS-001.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-001/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-SPS-001.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-001/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-SPS-001.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-001/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-SPS-001.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-002/","level":1,"title":"<code>APC-SPS-002.c</code>","text":"<p>Problem Statement</p> <p>WAP to swap two integers. Display both numbers before and after swap</p>","path":["Semester 1","Tuition c","APC-SPS-002.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-002/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-SPS-002.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-002/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-SPS-002.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-002/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-SPS-002.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-003/","level":1,"title":"<code>APC-SPS-003.c</code>","text":"<p>Problem Statement</p> <p>Bitwise AND '&'</p>","path":["Semester 1","Tuition c","APC-SPS-003.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-003/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-SPS-003.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-003/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-SPS-003.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-003/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-SPS-003.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-004/","level":1,"title":"<code>APC-SPS-004.c</code>","text":"","path":["Semester 1","Tuition c","APC-SPS-004.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-004/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-SPS-004.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-004/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-SPS-004.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-004/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-SPS-004.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-005/","level":1,"title":"<code>APC-SPS-005.c</code>","text":"<p>Problem Statement</p> <p>Bitwise OR '|'</p>","path":["Semester 1","Tuition c","APC-SPS-005.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-005/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-SPS-005.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-005/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-SPS-005.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-005/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-SPS-005.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-006/","level":1,"title":"<code>APC-SPS-006.c</code>","text":"<p>Problem Statement</p> <p>Bitwise NOT '~'</p>","path":["Semester 1","Tuition c","APC-SPS-006.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-006/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-SPS-006.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-006/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-SPS-006.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-006/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-SPS-006.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-007/","level":1,"title":"<code>APC-SPS-007.c</code>","text":"<p>Problem Statement</p> <p>WAP to check a number is even or odd using bitwise operator</p>","path":["Semester 1","Tuition c","APC-SPS-007.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-007/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-SPS-007.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-007/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-SPS-007.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-007/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-SPS-007.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-008/","level":1,"title":"<code>APC-SPS-008.c</code>","text":"<p>Problem Statement</p> <p>WAP to calculate area of circle by accepting radius as input</p>","path":["Semester 1","Tuition c","APC-SPS-008.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-008/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-SPS-008.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-008/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-SPS-008.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-008/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-SPS-008.c"],"tags":[]},{"location":"semester_1/tuition-c/P001/","level":1,"title":"<code>P001.c</code>","text":"","path":["Semester 1","Tuition c","P001.c"],"tags":[]},{"location":"semester_1/tuition-c/P001/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P001.c"],"tags":[]},{"location":"semester_1/tuition-c/P001/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P001.c"],"tags":[]},{"location":"semester_1/tuition-c/P001/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P001.c"],"tags":[]},{"location":"semester_1/tuition-c/P002/","level":1,"title":"<code>P002.c</code>","text":"","path":["Semester 1","Tuition c","P002.c"],"tags":[]},{"location":"semester_1/tuition-c/P002/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P002.c"],"tags":[]},{"location":"semester_1/tuition-c/P002/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P002.c"],"tags":[]},{"location":"semester_1/tuition-c/P002/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P002.c"],"tags":[]},{"location":"semester_1/tuition-c/P003/","level":1,"title":"<code>P003.c</code>","text":"","path":["Semester 1","Tuition c","P003.c"],"tags":[]},{"location":"semester_1/tuition-c/P003/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P003.c"],"tags":[]},{"location":"semester_1/tuition-c/P003/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P003.c"],"tags":[]},{"location":"semester_1/tuition-c/P003/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P003.c"],"tags":[]},{"location":"semester_1/tuition-c/P004/","level":1,"title":"<code>P004.c</code>","text":"<p>Problem Statement</p> <p>WAP to find and display the value of given expression : ((x+3)/4) - ((2x+4)/3) taking the value of x = 5</p>","path":["Semester 1","Tuition c","P004.c"],"tags":[]},{"location":"semester_1/tuition-c/P004/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P004.c"],"tags":[]},{"location":"semester_1/tuition-c/P004/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P004.c"],"tags":[]},{"location":"semester_1/tuition-c/P004/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P004.c"],"tags":[]},{"location":"semester_1/tuition-c/P005/","level":1,"title":"<code>P005.c</code>","text":"<p>Problem Statement</p> <p>A person is paid Rs. 455 for each day he works and fined Rs. 150 for each day he remains absent. WAP to calculate his monthly income taking the number of days present as input.</p>","path":["Semester 1","Tuition c","P005.c"],"tags":[]},{"location":"semester_1/tuition-c/P005/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P005.c"],"tags":[]},{"location":"semester_1/tuition-c/P005/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P005.c"],"tags":[]},{"location":"semester_1/tuition-c/P005/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P005.c"],"tags":[]},{"location":"semester_1/tuition-c/P006/","level":1,"title":"<code>P006.c</code>","text":"<p>Problem Statement</p> <p>The normal temperature of human body is 98.6 Degree Fahrenheit. WAP to convert the temperature to Degree Celcius and display the output.</p>","path":["Semester 1","Tuition c","P006.c"],"tags":[]},{"location":"semester_1/tuition-c/P006/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P006.c"],"tags":[]},{"location":"semester_1/tuition-c/P006/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P006.c"],"tags":[]},{"location":"semester_1/tuition-c/P006/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P006.c"],"tags":[]},{"location":"semester_1/tuition-c/P007/","level":1,"title":"<code>P007.c</code>","text":"<p>Problem Statement</p> <p>A shopkeeper offers 10% discount on printed price of a digital camera. However a customer has to pay 6% GST on the remaining amount. WAP to calculate and display the amount to paid by the customer, taking the printed price as input.</p>","path":["Semester 1","Tuition c","P007.c"],"tags":[]},{"location":"semester_1/tuition-c/P007/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P007.c"],"tags":[]},{"location":"semester_1/tuition-c/P007/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P007.c"],"tags":[]},{"location":"semester_1/tuition-c/P007/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P007.c"],"tags":[]},{"location":"semester_1/tuition-c/P008/","level":1,"title":"<code>P008.c</code>","text":"<p>Problem Statement</p> <p>A shopkeeper offers 30% discount on purchasing an item whereas the other shopkeeper offers 2 successive discount of 20% and 10% for purchasing the same item. WAP to caompute and display the discounted price of the item by taking the price as input.</p>","path":["Semester 1","Tuition c","P008.c"],"tags":[]},{"location":"semester_1/tuition-c/P008/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P008.c"],"tags":[]},{"location":"semester_1/tuition-c/P008/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P008.c"],"tags":[]},{"location":"semester_1/tuition-c/P008/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P008.c"],"tags":[]},{"location":"semester_1/tuition-c/P009/","level":1,"title":"<code>P009.c</code>","text":"<p>Problem Statement</p> <p>WAP to calculate gross and net salary by accepting basic salary as input. IMP : DA = 30% of Basic Pay HRA = 20% of Basic Pay PF = 12.5% of Basic Pay Gross Salary = Basic Pay + DA + HRA Net Salary = Gross Salary - PF</p>","path":["Semester 1","Tuition c","P009.c"],"tags":[]},{"location":"semester_1/tuition-c/P009/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P009.c"],"tags":[]},{"location":"semester_1/tuition-c/P009/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P009.c"],"tags":[]},{"location":"semester_1/tuition-c/P009/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P009.c"],"tags":[]},{"location":"semester_1/tuition-c/P010/","level":1,"title":"<code>P010.c</code>","text":"<p>Problem Statement</p> <p>WAP to find and display the difference between compound Interest and Simple Interest. Take principle amount as input. Hint : si = (p * r * t) / 100 a = p * ((1 + (r / 100)) ^ t) ci = a - p</p>","path":["Semester 1","Tuition c","P010.c"],"tags":[]},{"location":"semester_1/tuition-c/P010/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P010.c"],"tags":[]},{"location":"semester_1/tuition-c/P010/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P010.c"],"tags":[]},{"location":"semester_1/tuition-c/P010/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P010.c"],"tags":[]},{"location":"semester_1/tuition-c/P011/","level":1,"title":"<code>P011.c</code>","text":"<p>Problem Statement</p> <p>The time period of a simple pendulam is given by the formula : t = 2 * pi * square_root(l / g) WAP to calculate T take length(L) and gravity as input</p>","path":["Semester 1","Tuition c","P011.c"],"tags":[]},{"location":"semester_1/tuition-c/P011/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P011.c"],"tags":[]},{"location":"semester_1/tuition-c/P011/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P011.c"],"tags":[]},{"location":"semester_1/tuition-c/P011/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P011.c"],"tags":[]},{"location":"semester_1/tuition-c/P012/","level":1,"title":"<code>P012.c</code>","text":"<p>Problem Statement</p> <p>WAP to swap two integer variable without using third variable</p>","path":["Semester 1","Tuition c","P012.c"],"tags":[]},{"location":"semester_1/tuition-c/P012/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P012.c"],"tags":[]},{"location":"semester_1/tuition-c/P012/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P012.c"],"tags":[]},{"location":"semester_1/tuition-c/P012/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P012.c"],"tags":[]},{"location":"semester_1/tuition-c/P013/","level":1,"title":"<code>P013.c</code>","text":"<p>Problem Statement</p> <p>WAP to swap two integer variable without using third variable</p>","path":["Semester 1","Tuition c","P013.c"],"tags":[]},{"location":"semester_1/tuition-c/P013/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P013.c"],"tags":[]},{"location":"semester_1/tuition-c/P013/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P013.c"],"tags":[]},{"location":"semester_1/tuition-c/P013/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P013.c"],"tags":[]},{"location":"semester_1/tuition-c/P014/","level":1,"title":"<code>P014.c</code>","text":"<p>Problem Statement</p> <p>WAP to accept the diagonal of square. Find and display the area and perimeter of the square.</p>","path":["Semester 1","Tuition c","P014.c"],"tags":[]},{"location":"semester_1/tuition-c/P014/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P014.c"],"tags":[]},{"location":"semester_1/tuition-c/P014/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P014.c"],"tags":[]},{"location":"semester_1/tuition-c/P014/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P014.c"],"tags":[]},{"location":"semester_1/tuition-c/P015/","level":1,"title":"<code>P015.c</code>","text":"<p>Problem Statement</p> <p>WAP to accept number of days and display it after converting into number of years, months and days</p>","path":["Semester 1","Tuition c","P015.c"],"tags":[]},{"location":"semester_1/tuition-c/P015/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P015.c"],"tags":[]},{"location":"semester_1/tuition-c/P015/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P015.c"],"tags":[]},{"location":"semester_1/tuition-c/P015/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P015.c"],"tags":[]},{"location":"semester_1/tuition-c/P016/","level":1,"title":"<code>P016.c</code>","text":"<p>Problem Statement</p> <p>WAP to calculate and display radius of a circle by taking the area as input</p>","path":["Semester 1","Tuition c","P016.c"],"tags":[]},{"location":"semester_1/tuition-c/P016/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P016.c"],"tags":[]},{"location":"semester_1/tuition-c/P016/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P016.c"],"tags":[]},{"location":"semester_1/tuition-c/P016/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P016.c"],"tags":[]},{"location":"semester_1/tuition-c/P017/","level":1,"title":"<code>P017.c</code>","text":"<p>Problem Statement</p> <p>Find maximum between three number.</p>","path":["Semester 1","Tuition c","P017.c"],"tags":[]},{"location":"semester_1/tuition-c/P017/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P017.c"],"tags":[]},{"location":"semester_1/tuition-c/P017/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P017.c"],"tags":[]},{"location":"semester_1/tuition-c/P017/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P017.c"],"tags":[]},{"location":"semester_1/tuition-c/P018/","level":1,"title":"<code>P018.c</code>","text":"<p>Problem Statement</p> <p>WAP to input the cost price and selling price and calculate profit, profit percentage, loss percentage or display the manage nither profit nor loss.</p>","path":["Semester 1","Tuition c","P018.c"],"tags":[]},{"location":"semester_1/tuition-c/P018/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P018.c"],"tags":[]},{"location":"semester_1/tuition-c/P018/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P018.c"],"tags":[]},{"location":"semester_1/tuition-c/P018/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P018.c"],"tags":[]},{"location":"semester_1/tuition-c/P019/","level":1,"title":"<code>P019.c</code>","text":"<p>Problem Statement</p> <p>WAP to input the distance covered and calculate the amount to be paid by the passanger. Distance Rate =<5KM RS 90 next 10KM RS 20/KM next 10KM RS 10/KM more than 25KM RS 9/KM</p>","path":["Semester 1","Tuition c","P019.c"],"tags":[]},{"location":"semester_1/tuition-c/P019/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P019.c"],"tags":[]},{"location":"semester_1/tuition-c/P019/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P019.c"],"tags":[]},{"location":"semester_1/tuition-c/P019/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P019.c"],"tags":[]},{"location":"semester_1/tuition-c/P020/","level":1,"title":"<code>P020.c</code>","text":"<p>Problem Statement</p> <p>WAP to calculate and display the maturity amount taking the sum and number of days as input. No. of Days Rate of Interest Upto 180 days 5.5 % 181 to 364 days 7.5 % exact 365 days 9.0 % more than 365 days 8.5 %</p>","path":["Semester 1","Tuition c","P020.c"],"tags":[]},{"location":"semester_1/tuition-c/P020/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P020.c"],"tags":[]},{"location":"semester_1/tuition-c/P020/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P020.c"],"tags":[]},{"location":"semester_1/tuition-c/P020/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P020.c"],"tags":[]},{"location":"semester_1/tuition-c/P021/","level":1,"title":"<code>P021.c</code>","text":"<p>Problem Statement</p> <p>WAP to input a positive number and check if it is a perfect square number or not.</p>","path":["Semester 1","Tuition c","P021.c"],"tags":[]},{"location":"semester_1/tuition-c/P021/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P021.c"],"tags":[]},{"location":"semester_1/tuition-c/P021/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P021.c"],"tags":[]},{"location":"semester_1/tuition-c/P021/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P021.c"],"tags":[]},{"location":"semester_1/tuition-c/P022/","level":1,"title":"<code>P022.c</code>","text":"<p>Problem Statement</p> <p>WAP to find out smallest of three numbers without using if_else block.</p>","path":["Semester 1","Tuition c","P022.c"],"tags":[]},{"location":"semester_1/tuition-c/P022/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P022.c"],"tags":[]},{"location":"semester_1/tuition-c/P022/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P022.c"],"tags":[]},{"location":"semester_1/tuition-c/P022/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P022.c"],"tags":[]},{"location":"semester_1/tuition-c/P023/","level":1,"title":"<code>P023.c</code>","text":"<p>Problem Statement</p> <p>WAP to input the total cost and compute the amount to be paid by the customer.</p>","path":["Semester 1","Tuition c","P023.c"],"tags":[]},{"location":"semester_1/tuition-c/P023/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P023.c"],"tags":[]},{"location":"semester_1/tuition-c/P023/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P023.c"],"tags":[]},{"location":"semester_1/tuition-c/P023/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P023.c"],"tags":[]},{"location":"semester_1/tuition-c/P024/","level":1,"title":"<code>P024.c</code>","text":"<p>Problem Statement</p> <p>WAP to check whether a year is leapyear or not.</p>","path":["Semester 1","Tuition c","P024.c"],"tags":[]},{"location":"semester_1/tuition-c/P024/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P024.c"],"tags":[]},{"location":"semester_1/tuition-c/P024/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P024.c"],"tags":[]},{"location":"semester_1/tuition-c/P024/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P024.c"],"tags":[]},{"location":"semester_1/tuition-c/P025/","level":1,"title":"<code>P025.c</code>","text":"<p>Problem Statement</p> <p>WAP to input the electricity unit consumed and calculate the total bill amount according to the given condition : for 1st 50 unit Rs. 0.50 per unit next 100 unit Rs. 0.75 per unit next 100 unit Rs. 1.20 per unit above 250 unit Rs. 1.50 per unit And additional charge of 20 percent is added to the bill.</p>","path":["Semester 1","Tuition c","P025.c"],"tags":[]},{"location":"semester_1/tuition-c/P025/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P025.c"],"tags":[]},{"location":"semester_1/tuition-c/P025/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P025.c"],"tags":[]},{"location":"semester_1/tuition-c/P025/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P025.c"],"tags":[]},{"location":"semester_1/tuition-c/P026/","level":1,"title":"<code>P026.c</code>","text":"<p>Problem Statement</p> <p>WAP to input sum (p), rate of interest (r), time (t) and type of interest ('s' for simple interest amd 'c' for compound interest). Calculate and display the interest earned si = (p * r * t) / 100 compoundInterest = p * ((1 + r / 100)^t - 1)</p>","path":["Semester 1","Tuition c","P026.c"],"tags":[]},{"location":"semester_1/tuition-c/P026/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P026.c"],"tags":[]},{"location":"semester_1/tuition-c/P026/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P026.c"],"tags":[]},{"location":"semester_1/tuition-c/P026/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P026.c"],"tags":[]},{"location":"semester_1/tuition-c/P027/","level":1,"title":"<code>P027.c</code>","text":"<p>Problem Statement</p> <p>Purchase Discount on Discount on Amount Laptop Desktop -------- ----------- ----------- Upto 20k 3.0% 5.0% 20001 - 50k 5.0% 7.5% 50001 - 75k 7.5% 10.5% more than 75k 10.0% 15.0% WAP to input amount of purchase and type of purchase ('L' : laptop, 'D' : desktop) and display the discount amount and the discounted price (Net Amount).</p>","path":["Semester 1","Tuition c","P027.c"],"tags":[]},{"location":"semester_1/tuition-c/P027/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","P027.c"],"tags":[]},{"location":"semester_1/tuition-c/P027/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P027.c"],"tags":[]},{"location":"semester_1/tuition-c/P027/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P027.c"],"tags":[]},{"location":"semester_1/tuition-c/P028/","level":1,"title":"<code>P028.c</code>","text":"<p>Problem Statement</p> <p>WAP to calculate factorial of a number</p>","path":["Semester 1","Tuition c","P028.c"],"tags":[]},{"location":"semester_1/tuition-c/P028/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P028.c"],"tags":[]},{"location":"semester_1/tuition-c/P028/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P028.c"],"tags":[]},{"location":"semester_1/tuition-c/P028/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P028.c"],"tags":[]},{"location":"semester_1/tuition-c/P029/","level":1,"title":"<code>P029.c</code>","text":"<p>Problem Statement</p> <p>WAP to perform addition of first n natural numbers. sum = 1 + 2 + 3 + ...</p>","path":["Semester 1","Tuition c","P029.c"],"tags":[]},{"location":"semester_1/tuition-c/P029/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P029.c"],"tags":[]},{"location":"semester_1/tuition-c/P029/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P029.c"],"tags":[]},{"location":"semester_1/tuition-c/P029/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P029.c"],"tags":[]},{"location":"semester_1/tuition-c/P030/","level":1,"title":"<code>P030.c</code>","text":"<p>Problem Statement</p> <p>Display the first 15 terms of the series.</p>","path":["Semester 1","Tuition c","P030.c"],"tags":[]},{"location":"semester_1/tuition-c/P030/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","P030.c"],"tags":[]},{"location":"semester_1/tuition-c/P030/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P030.c"],"tags":[]},{"location":"semester_1/tuition-c/P030/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P030.c"],"tags":[]},{"location":"semester_1/tuition-c/P031/","level":1,"title":"<code>P031.c</code>","text":"<p>Problem Statement</p> <p>Find the sum of the series</p>","path":["Semester 1","Tuition c","P031.c"],"tags":[]},{"location":"semester_1/tuition-c/P031/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P031.c"],"tags":[]},{"location":"semester_1/tuition-c/P031/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P031.c"],"tags":[]},{"location":"semester_1/tuition-c/P031/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P031.c"],"tags":[]},{"location":"semester_1/tuition-c/P032/","level":1,"title":"<code>P032.c</code>","text":"<p>Problem Statement</p> <p>WAP to input a number and check whether it is a Niven number or not. (When a number is divisible by its sum of digit) e.g. : n = 126</p>","path":["Semester 1","Tuition c","P032.c"],"tags":[]},{"location":"semester_1/tuition-c/P032/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P032.c"],"tags":[]},{"location":"semester_1/tuition-c/P032/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P032.c"],"tags":[]},{"location":"semester_1/tuition-c/P032/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P032.c"],"tags":[]},{"location":"semester_1/tuition-c/P033/","level":1,"title":"<code>P033.c</code>","text":"<p>Problem Statement</p> <p>WAP to calculate the sum of even digits and odd digits. Number will be provided by user.</p>","path":["Semester 1","Tuition c","P033.c"],"tags":[]},{"location":"semester_1/tuition-c/P033/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P033.c"],"tags":[]},{"location":"semester_1/tuition-c/P033/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P033.c"],"tags":[]},{"location":"semester_1/tuition-c/P033/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P033.c"],"tags":[]},{"location":"semester_1/tuition-c/P034/","level":1,"title":"<code>P034.c</code>","text":"<p>Problem Statement</p> <p>Get sum of even position digit and odd position digit</p>","path":["Semester 1","Tuition c","P034.c"],"tags":[]},{"location":"semester_1/tuition-c/P034/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P034.c"],"tags":[]},{"location":"semester_1/tuition-c/P034/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P034.c"],"tags":[]},{"location":"semester_1/tuition-c/P034/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P034.c"],"tags":[]},{"location":"semester_1/tuition-c/P035/","level":1,"title":"<code>P035.c</code>","text":"<p>Problem Statement</p> <p>WAP to input an int number and display the product of the successors of even digits of the number entered by user.</p>","path":["Semester 1","Tuition c","P035.c"],"tags":[]},{"location":"semester_1/tuition-c/P035/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P035.c"],"tags":[]},{"location":"semester_1/tuition-c/P035/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P035.c"],"tags":[]},{"location":"semester_1/tuition-c/P035/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P035.c"],"tags":[]},{"location":"semester_1/tuition-c/P036/","level":1,"title":"<code>P036.c</code>","text":"<p>Problem Statement</p> <p>sum = a + (a^2)/2 + (a^3)/3 + ... + (a^n)/n</p>","path":["Semester 1","Tuition c","P036.c"],"tags":[]},{"location":"semester_1/tuition-c/P036/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P036.c"],"tags":[]},{"location":"semester_1/tuition-c/P036/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P036.c"],"tags":[]},{"location":"semester_1/tuition-c/P036/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P036.c"],"tags":[]},{"location":"semester_1/tuition-c/P037/","level":1,"title":"<code>P037.c</code>","text":"<p>Problem Statement</p> <p>sum = 1 + 1+2/12 + 1+2+3/123 + ... + 1+2+3+...+n/123...*n</p>","path":["Semester 1","Tuition c","P037.c"],"tags":[]},{"location":"semester_1/tuition-c/P037/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P037.c"],"tags":[]},{"location":"semester_1/tuition-c/P037/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P037.c"],"tags":[]},{"location":"semester_1/tuition-c/P037/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P037.c"],"tags":[]},{"location":"semester_1/tuition-c/P038/","level":1,"title":"<code>P038.c</code>","text":"<p>Problem Statement</p> <p>Write a program to check prime number</p>","path":["Semester 1","Tuition c","P038.c"],"tags":[]},{"location":"semester_1/tuition-c/P038/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","P038.c"],"tags":[]},{"location":"semester_1/tuition-c/P038/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P038.c"],"tags":[]},{"location":"semester_1/tuition-c/P038/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P038.c"],"tags":[]},{"location":"semester_1/tuition-c/P039/","level":1,"title":"<code>P039.c</code>","text":"<p>Problem Statement</p> <p>Write a program to print all the factors of a postive integer</p>","path":["Semester 1","Tuition c","P039.c"],"tags":[]},{"location":"semester_1/tuition-c/P039/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P039.c"],"tags":[]},{"location":"semester_1/tuition-c/P039/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P039.c"],"tags":[]},{"location":"semester_1/tuition-c/P039/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P039.c"],"tags":[]},{"location":"semester_1/tuition-c/P040/","level":1,"title":"<code>P040.c</code>","text":"<p>Problem Statement</p> <p>Write a program to calculate HCF of two positive number</p>","path":["Semester 1","Tuition c","P040.c"],"tags":[]},{"location":"semester_1/tuition-c/P040/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P040.c"],"tags":[]},{"location":"semester_1/tuition-c/P040/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P040.c"],"tags":[]},{"location":"semester_1/tuition-c/P040/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P040.c"],"tags":[]},{"location":"semester_1/tuition-c/P041/","level":1,"title":"<code>P041.c</code>","text":"<p>Problem Statement</p> <p>Write a program to enter two numbers and check they are co-prime or not. co-prime when HCF = 1</p>","path":["Semester 1","Tuition c","P041.c"],"tags":[]},{"location":"semester_1/tuition-c/P041/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P041.c"],"tags":[]},{"location":"semester_1/tuition-c/P041/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P041.c"],"tags":[]},{"location":"semester_1/tuition-c/P041/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P041.c"],"tags":[]},{"location":"semester_1/tuition-c/P042/","level":1,"title":"<code>P042.c</code>","text":"<p>Problem Statement</p> <p>Write a program to accept a number and check whether the number is twisted prime or not.</p>","path":["Semester 1","Tuition c","P042.c"],"tags":[]},{"location":"semester_1/tuition-c/P042/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","P042.c"],"tags":[]},{"location":"semester_1/tuition-c/P042/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P042.c"],"tags":[]},{"location":"semester_1/tuition-c/P042/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P042.c"],"tags":[]},{"location":"semester_1/tuition-c/P043/","level":1,"title":"<code>P043.c</code>","text":"<p>Problem Statement</p> <p>Write a program to check palindrome number.</p>","path":["Semester 1","Tuition c","P043.c"],"tags":[]},{"location":"semester_1/tuition-c/P043/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P043.c"],"tags":[]},{"location":"semester_1/tuition-c/P043/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P043.c"],"tags":[]},{"location":"semester_1/tuition-c/P043/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P043.c"],"tags":[]},{"location":"semester_1/tuition-c/P044/","level":1,"title":"<code>P044.c</code>","text":"<p>Problem Statement</p> <p>Write a program to input a number and check whether the number is Pronic number or not. Pronic Number: The number which is the product of two numbers which is the product of two consecutive integer. Ex: 20 = 4 * 5</p>","path":["Semester 1","Tuition c","P044.c"],"tags":[]},{"location":"semester_1/tuition-c/P044/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","P044.c"],"tags":[]},{"location":"semester_1/tuition-c/P044/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P044.c"],"tags":[]},{"location":"semester_1/tuition-c/P044/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P044.c"],"tags":[]},{"location":"semester_1/tuition-c/P045/","level":1,"title":"<code>P045.c</code>","text":"<p>Problem Statement</p> <p>Make this pattern for input n. Pattern : 1 1 2 1 2 3 1 2 3 4 1 2 3 4 5</p>","path":["Semester 1","Tuition c","P045.c"],"tags":[]},{"location":"semester_1/tuition-c/P045/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P045.c"],"tags":[]},{"location":"semester_1/tuition-c/P045/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P045.c"],"tags":[]},{"location":"semester_1/tuition-c/P045/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P045.c"],"tags":[]},{"location":"semester_1/tuition-c/P046/","level":1,"title":"<code>P046.c</code>","text":"<p>Problem Statement</p> <p>Make this pattern for input n. Pattern : 1 2 1 3 2 1 4 3 2 1 5 4 3 2 1</p>","path":["Semester 1","Tuition c","P046.c"],"tags":[]},{"location":"semester_1/tuition-c/P046/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P046.c"],"tags":[]},{"location":"semester_1/tuition-c/P046/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P046.c"],"tags":[]},{"location":"semester_1/tuition-c/P046/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P046.c"],"tags":[]},{"location":"semester_1/tuition-c/P047/","level":1,"title":"<code>P047.c</code>","text":"<p>Problem Statement</p> <p>Make this pattern for input n. Pattern : 5 5 4 5 4 3 5 4 3 2 5 4 3 2 1</p>","path":["Semester 1","Tuition c","P047.c"],"tags":[]},{"location":"semester_1/tuition-c/P047/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P047.c"],"tags":[]},{"location":"semester_1/tuition-c/P047/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P047.c"],"tags":[]},{"location":"semester_1/tuition-c/P047/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P047.c"],"tags":[]},{"location":"semester_1/tuition-c/P048/","level":1,"title":"<code>P048.c</code>","text":"<p>Problem Statement</p> <p>Make this pattern for input n no of row. Pattern : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15</p>","path":["Semester 1","Tuition c","P048.c"],"tags":[]},{"location":"semester_1/tuition-c/P048/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P048.c"],"tags":[]},{"location":"semester_1/tuition-c/P048/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P048.c"],"tags":[]},{"location":"semester_1/tuition-c/P048/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P048.c"],"tags":[]},{"location":"semester_1/tuition-c/P049/","level":1,"title":"<code>P049.c</code>","text":"<p>Problem Statement</p> <p>Make this pattern for input n no of row. Pattern : # @ @ # # # @ @ @ @ # # # # #</p>","path":["Semester 1","Tuition c","P049.c"],"tags":[]},{"location":"semester_1/tuition-c/P049/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P049.c"],"tags":[]},{"location":"semester_1/tuition-c/P049/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P049.c"],"tags":[]},{"location":"semester_1/tuition-c/P049/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P049.c"],"tags":[]},{"location":"semester_1/tuition-c/P050-SHORT/","level":1,"title":"<code>P050-SHORT.c</code>","text":"<p>Problem Statement</p> <p>Write a program to input a number and check whether it is Disarium Number or not. Note : A number is said to Disarium if sum of its digit powered by with their respective position is equal to the original number.</p>","path":["Semester 1","Tuition c","P050-SHORT.c"],"tags":[]},{"location":"semester_1/tuition-c/P050-SHORT/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P050-SHORT.c"],"tags":[]},{"location":"semester_1/tuition-c/P050-SHORT/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P050-SHORT.c"],"tags":[]},{"location":"semester_1/tuition-c/P050-SHORT/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P050-SHORT.c"],"tags":[]},{"location":"semester_1/tuition-c/P050/","level":1,"title":"<code>P050.c</code>","text":"<p>Problem Statement</p> <p>Write a program to input a number and check whether it is Disarium Number or not. Note : A number is said to Disarium if sum of its digit powered by with their respective position is equal to the original number.</p>","path":["Semester 1","Tuition c","P050.c"],"tags":[]},{"location":"semester_1/tuition-c/P050/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P050.c"],"tags":[]},{"location":"semester_1/tuition-c/P050/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P050.c"],"tags":[]},{"location":"semester_1/tuition-c/P050/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P050.c"],"tags":[]},{"location":"semester_1/tuition-c/P051/","level":1,"title":"<code>P051.c</code>","text":"<p>Problem Statement</p> <p>Write a program to input two number and check whether they are Amicable Pair or not Example : Sum of Proper Divisors of 220 (1, 2, 4, 5, 10, 11, 20, 22, 44, 55, 110) = 284 Sum of Proper Divisors of 284 (1, 2, 4, 71, 142) = 220</p>","path":["Semester 1","Tuition c","P051.c"],"tags":[]},{"location":"semester_1/tuition-c/P051/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P051.c"],"tags":[]},{"location":"semester_1/tuition-c/P051/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P051.c"],"tags":[]},{"location":"semester_1/tuition-c/P051/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P051.c"],"tags":[]},{"location":"semester_1/tuition-c/P052/","level":1,"title":"<code>P052.c</code>","text":"<p>Problem Statement</p> <p>Print the sum of this series for upto n element. Series: 1 + (1 + 2) + (1 + 2 + 3) + (1 + 2 + 3 + 4) + ... + (1 + 2 + 3 + ... + n)</p>","path":["Semester 1","Tuition c","P052.c"],"tags":[]},{"location":"semester_1/tuition-c/P052/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P052.c"],"tags":[]},{"location":"semester_1/tuition-c/P052/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P052.c"],"tags":[]},{"location":"semester_1/tuition-c/P052/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P052.c"],"tags":[]},{"location":"semester_1/tuition-c/P053/","level":1,"title":"<code>P053.c</code>","text":"<p>Problem Statement</p> <p>Print all pattern</p>","path":["Semester 1","Tuition c","P053.c"],"tags":[]},{"location":"semester_1/tuition-c/P053/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","P053.c"],"tags":[]},{"location":"semester_1/tuition-c/P053/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P053.c"],"tags":[]},{"location":"semester_1/tuition-c/P053/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P053.c"],"tags":[]},{"location":"semester_1/tuition-c/P054/","level":1,"title":"<code>P054.c</code>","text":"<p>Problem Statement</p> <p>WAP to check Krishnamurty number using user defined methods/functions.</p>","path":["Semester 1","Tuition c","P054.c"],"tags":[]},{"location":"semester_1/tuition-c/P054/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","P054.c"],"tags":[]},{"location":"semester_1/tuition-c/P054/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P054.c"],"tags":[]},{"location":"semester_1/tuition-c/P054/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P054.c"],"tags":[]},{"location":"semester_1/tuition-c/P055/","level":1,"title":"<code>P055.c</code>","text":"<p>Problem Statement</p> <p>WAP to print n terms of Fibbonacci Series (Starting from term 0)</p>","path":["Semester 1","Tuition c","P055.c"],"tags":[]},{"location":"semester_1/tuition-c/P055/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P055.c"],"tags":[]},{"location":"semester_1/tuition-c/P055/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P055.c"],"tags":[]},{"location":"semester_1/tuition-c/P055/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P055.c"],"tags":[]},{"location":"semester_1/tuition-c/P056/","level":1,"title":"<code>P056.c</code>","text":"<p>Problem Statement</p> <p>WAP to swap the value of a and b using user defined method.</p>","path":["Semester 1","Tuition c","P056.c"],"tags":[]},{"location":"semester_1/tuition-c/P056/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P056.c"],"tags":[]},{"location":"semester_1/tuition-c/P056/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P056.c"],"tags":[]},{"location":"semester_1/tuition-c/P056/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P056.c"],"tags":[]},{"location":"semester_1/tuition-c/P057/","level":1,"title":"<code>P057.c</code>","text":"<p>Problem Statement</p> <p>WAP to display the series using user defined method. 0, 7, 26, 63, ... upto n terms using void series(int n)</p>","path":["Semester 1","Tuition c","P057.c"],"tags":[]},{"location":"semester_1/tuition-c/P057/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P057.c"],"tags":[]},{"location":"semester_1/tuition-c/P057/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P057.c"],"tags":[]},{"location":"semester_1/tuition-c/P057/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P057.c"],"tags":[]},{"location":"semester_1/tuition-c/P058/","level":1,"title":"<code>P058.c</code>","text":"<p>Problem Statement</p> <p>WAP to display ASCII code of Alphabets (A - Z) using void displayASCII()</p>","path":["Semester 1","Tuition c","P058.c"],"tags":[]},{"location":"semester_1/tuition-c/P058/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P058.c"],"tags":[]},{"location":"semester_1/tuition-c/P058/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P058.c"],"tags":[]},{"location":"semester_1/tuition-c/P058/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P058.c"],"tags":[]},{"location":"semester_1/tuition-c/P059/","level":1,"title":"<code>P059.c</code>","text":"<p>Problem Statement</p> <p>Write a program to find the sum of array elements using following fuctions int array_sum(int a[], int n); void get_data(int a[], int n); void dispaly(int a[], int n);</p>","path":["Semester 1","Tuition c","P059.c"],"tags":[]},{"location":"semester_1/tuition-c/P059/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","P059.c"],"tags":[]},{"location":"semester_1/tuition-c/P059/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P059.c"],"tags":[]},{"location":"semester_1/tuition-c/P059/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P059.c"],"tags":[]},{"location":"semester_1/tuition-c/P060/","level":1,"title":"<code>P060.c</code>","text":"<p>Problem Statement</p> <p>write a C program to count the occurrences of a given element in an array using a user-defined function. Create a function int count_occurrences(int arr[], int n, int target) that countts how many times target appears in the array.</p>","path":["Semester 1","Tuition c","P060.c"],"tags":[]},{"location":"semester_1/tuition-c/P060/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 13 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","P060.c"],"tags":[]},{"location":"semester_1/tuition-c/P060/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P060.c"],"tags":[]},{"location":"semester_1/tuition-c/P060/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P060.c"],"tags":[]},{"location":"semester_1/tuition-c/P061/","level":1,"title":"<code>P061.c</code>","text":"<p>Problem Statement</p> <p>Write a C program to find the sum of even elements in an array using a user defined function. Define a functions int sumEven(int arr[], int n) that returns the sum of all even elements in the array.</p>","path":["Semester 1","Tuition c","P061.c"],"tags":[]},{"location":"semester_1/tuition-c/P061/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P061.c"],"tags":[]},{"location":"semester_1/tuition-c/P061/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P061.c"],"tags":[]},{"location":"semester_1/tuition-c/P061/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P061.c"],"tags":[]},{"location":"semester_1/tuition-c/P062/","level":1,"title":"<code>P062.c</code>","text":"<p>Problem Statement</p> <p>Write a C program to find the smallest and largest in an array using user-defined functions. Define two functions int findSmallest(int arr[], int n) and int findLargest(int arr[], int n) that return the smallest and largest elements in an array, respectively.</p>","path":["Semester 1","Tuition c","P062.c"],"tags":[]},{"location":"semester_1/tuition-c/P062/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 16 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","P062.c"],"tags":[]},{"location":"semester_1/tuition-c/P062/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P062.c"],"tags":[]},{"location":"semester_1/tuition-c/P062/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P062.c"],"tags":[]},{"location":"semester_1/tuition-c/P063/","level":1,"title":"<code>P063.c</code>","text":"<p>Problem Statement</p> <p>Write a C program to find all Niven in an array. Define a user-defined function int isNiven(int num) that returns 1 if the numbers is a Niven number, otherwise returns 0. A Niven number (also known as a Harshad Number) is an integer that is divisible by the sum of its digits.</p>","path":["Semester 1","Tuition c","P063.c"],"tags":[]},{"location":"semester_1/tuition-c/P063/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 16 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","P063.c"],"tags":[]},{"location":"semester_1/tuition-c/P063/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P063.c"],"tags":[]},{"location":"semester_1/tuition-c/P063/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P063.c"],"tags":[]},{"location":"semester_1/tuition-c/P064/","level":1,"title":"<code>P064.c</code>","text":"<p>Problem Statement</p> <p>Write a program to merge two sorted integer arrays to form a single sorted array.</p>","path":["Semester 1","Tuition c","P064.c"],"tags":[]},{"location":"semester_1/tuition-c/P064/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 21 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","P064.c"],"tags":[]},{"location":"semester_1/tuition-c/P064/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P064.c"],"tags":[]},{"location":"semester_1/tuition-c/P064/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P064.c"],"tags":[]},{"location":"semester_1/tuition-c/P065/","level":1,"title":"<code>P065.c</code>","text":"<p>Problem Statement</p> <p>Write a program to reverse a string</p>","path":["Semester 1","Tuition c","P065.c"],"tags":[]},{"location":"semester_1/tuition-c/P065/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P065.c"],"tags":[]},{"location":"semester_1/tuition-c/P065/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P065.c"],"tags":[]},{"location":"semester_1/tuition-c/P065/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P065.c"],"tags":[]},{"location":"semester_1/tuition-c/P066/","level":1,"title":"<code>P066.c</code>","text":"<p>Problem Statement</p> <p>WAP to find the length of a string using i) Library Method ii) User defined method</p>","path":["Semester 1","Tuition c","P066.c"],"tags":[]},{"location":"semester_1/tuition-c/P066/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P066.c"],"tags":[]},{"location":"semester_1/tuition-c/P066/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P066.c"],"tags":[]},{"location":"semester_1/tuition-c/P066/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P066.c"],"tags":[]},{"location":"semester_1/tuition-c/P067/","level":1,"title":"<code>P067.c</code>","text":"<p>Problem Statement</p> <p>Write a program using function which concatenates two string s1 and s2 in to a third string</p>","path":["Semester 1","Tuition c","P067.c"],"tags":[]},{"location":"semester_1/tuition-c/P067/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P067.c"],"tags":[]},{"location":"semester_1/tuition-c/P067/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P067.c"],"tags":[]},{"location":"semester_1/tuition-c/P067/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P067.c"],"tags":[]},{"location":"semester_1/tuition-c/P068/","level":1,"title":"<code>P068.c</code>","text":"<p>Problem Statement</p> <p>Write a c program that perform the operation of strcmp()</p>","path":["Semester 1","Tuition c","P068.c"],"tags":[]},{"location":"semester_1/tuition-c/P068/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P068.c"],"tags":[]},{"location":"semester_1/tuition-c/P068/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P068.c"],"tags":[]},{"location":"semester_1/tuition-c/P068/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P068.c"],"tags":[]},{"location":"semester_1/tuition-c/P069/","level":1,"title":"<code>P069.c</code>","text":"<p>Problem Statement</p> <p>Write a program using user defined method to implement the following JAVA PROG Mastery -> JPM java prog mastery -> JPM Acharya Prafulla Chandra -> JPM</p>","path":["Semester 1","Tuition c","P069.c"],"tags":[]},{"location":"semester_1/tuition-c/P069/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 14 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","P069.c"],"tags":[]},{"location":"semester_1/tuition-c/P069/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P069.c"],"tags":[]},{"location":"semester_1/tuition-c/P069/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P069.c"],"tags":[]},{"location":"semester_1/tuition-c/P070/","level":1,"title":"<code>P070.c</code>","text":"<p>Problem Statement</p> <p>Write a program to perform addition of two complex number having fields 'real' and 'img' of type integer.</p>","path":["Semester 1","Tuition c","P070.c"],"tags":[]},{"location":"semester_1/tuition-c/P070/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 24 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","P070.c"],"tags":[]},{"location":"semester_1/tuition-c/P070/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P070.c"],"tags":[]},{"location":"semester_1/tuition-c/P070/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P070.c"],"tags":[]},{"location":"semester_2/","level":1,"title":"Index","text":"<p>Semester Pending</p>","path":["Semester 2","Index"],"tags":[]},{"location":"semester_2/#this-folder-is-currently-empty","level":2,"title":"This folder is currently empty","text":"<p>I am still completing Semester 1. This repository is a live documentation of my progress through the BSc Computer Science program at Acharya Prafulla Chandra College (APC).</p> <p>Current Activity:</p> <ul> <li>See active work in Semester 1</li> <li>Real-time updates as the academic session progresses.</li> </ul> <p>Explore More:</p> <ul> <li>Check out my full project gallery on my Portfolio</li> <li>View my other repositories on GitHub</li> </ul>","path":["Semester 2","Index"],"tags":[]},{"location":"semester_3/","level":1,"title":"Index","text":"<p>Semester Pending</p>","path":["Semester 3","Index"],"tags":[]},{"location":"semester_3/#this-folder-is-currently-empty","level":2,"title":"This folder is currently empty","text":"<p>I am still completing Semester 1. This repository is a live documentation of my progress through the BSc Computer Science program at Acharya Prafulla Chandra College (APC).</p> <p>Current Activity:</p> <ul> <li>See active work in Semester 1</li> <li>Real-time updates as the academic session progresses.</li> </ul> <p>Explore More:</p> <ul> <li>Check out my full project gallery on my Portfolio</li> <li>View my other repositories on GitHub</li> </ul>","path":["Semester 3","Index"],"tags":[]},{"location":"semester_4/","level":1,"title":"Index","text":"<p>Semester Pending</p>","path":["Semester 4","Index"],"tags":[]},{"location":"semester_4/#this-folder-is-currently-empty","level":2,"title":"This folder is currently empty","text":"<p>I am still completing Semester 1. This repository is a live documentation of my progress through the BSc Computer Science program at Acharya Prafulla Chandra College (APC).</p> <p>Current Activity:</p> <ul> <li>See active work in Semester 1</li> <li>Real-time updates as the academic session progresses.</li> </ul> <p>Explore More:</p> <ul> <li>Check out my full project gallery on my Portfolio</li> <li>View my other repositories on GitHub</li> </ul>","path":["Semester 4","Index"],"tags":[]},{"location":"semester_5/","level":1,"title":"Index","text":"<p>Semester Pending</p>","path":["Semester 5","Index"],"tags":[]},{"location":"semester_5/#this-folder-is-currently-empty","level":2,"title":"This folder is currently empty","text":"<p>I am still completing Semester 1. This repository is a live documentation of my progress through the BSc Computer Science program at Acharya Prafulla Chandra College (APC).</p> <p>Current Activity:</p> <ul> <li>See active work in Semester 1</li> <li>Real-time updates as the academic session progresses.</li> </ul> <p>Explore More:</p> <ul> <li>Check out my full project gallery on my Portfolio</li> <li>View my other repositories on GitHub</li> </ul>","path":["Semester 5","Index"],"tags":[]},{"location":"semester_6/","level":1,"title":"Index","text":"<p>Semester Pending</p>","path":["Semester 6","Index"],"tags":[]},{"location":"semester_6/#this-folder-is-currently-empty","level":2,"title":"This folder is currently empty","text":"<p>I am still completing Semester 1. This repository is a live documentation of my progress through the BSc Computer Science program at Acharya Prafulla Chandra College (APC).</p> <p>Current Activity:</p> <ul> <li>See active work in Semester 1</li> <li>Real-time updates as the academic session progresses.</li> </ul> <p>Explore More:</p> <ul> <li>Check out my full project gallery on my Portfolio</li> <li>View my other repositories on GitHub</li> </ul>","path":["Semester 6","Index"],"tags":[]},{"location":"semester_7/","level":1,"title":"Index","text":"<p>Semester Pending</p>","path":["Semester 7","Index"],"tags":[]},{"location":"semester_7/#this-folder-is-currently-empty","level":2,"title":"This folder is currently empty","text":"<p>I am still completing Semester 1. This repository is a live documentation of my progress through the BSc Computer Science program at Acharya Prafulla Chandra College (APC).</p> <p>Current Activity:</p> <ul> <li>See active work in Semester 1</li> <li>Real-time updates as the academic session progresses.</li> </ul> <p>Explore More:</p> <ul> <li>Check out my full project gallery on my Portfolio</li> <li>View my other repositories on GitHub</li> </ul>","path":["Semester 7","Index"],"tags":[]},{"location":"semester_8/","level":1,"title":"Index","text":"<p>Semester Pending</p>","path":["Semester 8","Index"],"tags":[]},{"location":"semester_8/#this-folder-is-currently-empty","level":2,"title":"This folder is currently empty","text":"<p>I am still completing Semester 1. This repository is a live documentation of my progress through the BSc Computer Science program at Acharya Prafulla Chandra College (APC).</p> <p>Current Activity:</p> <ul> <li>See active work in Semester 1</li> <li>Real-time updates as the academic session progresses.</li> </ul> <p>Explore More:</p> <ul> <li>Check out my full project gallery on my Portfolio</li> <li>View my other repositories on GitHub</li> </ul>","path":["Semester 8","Index"],"tags":[]}]}- \ No newline at end of file +{"config":{"separator":"[\\s\\-\\.]+"},"items":[{"location":"","level":1,"title":"BSc Code Index","text":"","path":["BSc Code Index"],"tags":[]},{"location":"#bsc-computer-science-honours-wbsu","level":2,"title":"BSc Computer Science Honours (WBSU)","text":"<p>This repository serves as a comprehensive, live archive of my 4-year academic journey in Computer Science at Acharya Prafulla Chandra College (APC). It contains practical implementations, assignments, and study materials following the WBSU curriculum.</p>","path":["BSc Code Index"],"tags":[]},{"location":"#quick-links","level":3,"title":"Quick Links","text":"<ul> <li>GitHub Repo: @notamitgamer/bsc</li> <li>Web View notamitgamer.github.io/bsc/</li> <li>Web View: amit.is-a.dev/bsc</li> <li>Live Portfolio: amit.is-a.dev</li> <li>GitHub Profile: @notamitgamer</li> </ul>","path":["BSc Code Index"],"tags":[]},{"location":"#roadmap-and-progress","level":2,"title":"Roadmap and Progress","text":"<p>Progress</p> <p>I am currently in Semester 1. Folders for future semesters are placeholders and will be updated in real-time as the academic session progresses.</p> Semester Status Primary Focus Semester 1 Active C Programming, R Semester 2 Pending Upcoming Semester 3 Pending Upcoming Semester 4 Pending Upcoming Semester 5 Pending Upcoming Semester 6 Pending Upcoming Semester 7 Pending Upcoming Semester 8 Pending Upcoming","path":["BSc Code Index"],"tags":[]},{"location":"#environment-setup","level":2,"title":"Environment Setup","text":"","path":["BSc Code Index"],"tags":[]},{"location":"#c-and-c-development","level":3,"title":"C and C++ Development","text":"<ol> <li>Download Compiler: MinGW64.zip (85 MB) or Original MinGW-w64 Executable</li> <li>Configuration: Extract to <code>C:\\MinGW64</code> and add <code>C:\\MinGW64\\bin</code> to your System Environment Variables.</li> <li>Verification: Run <code>gcc --version</code> in your terminal.</li> </ol>","path":["BSc Code Index"],"tags":[]},{"location":"#r-programming","level":3,"title":"R Programming","text":"<p>Setup Tip</p> <p>Download and install R from CRAN and RStudio for the best development experience.</p>","path":["BSc Code Index"],"tags":[]},{"location":"#academic-integrity","level":2,"title":"Academic Integrity","text":"<p>Academic Integrity</p> <p>While this code is public for reference, academic integrity is a priority.</p> <ul> <li>Understand the Logic — Study the implementations to learn the underlying concepts.</li> <li>Avoid Plagiarism — Direct copy-pasting for college submissions is strongly discouraged.</li> <li>Independent Implementation — The best way to learn is to understand the logic, then rewrite it from scratch.</li> </ul>","path":["BSc Code Index"],"tags":[]},{"location":"#about-the-author","level":2,"title":"About the Author","text":"<p>Amit Dutta</p> Method Use Personal amitdutta4255@gmail.com Work mail@amit.is-a.dev License MIT","path":["BSc Code Index"],"tags":[]},{"location":"CODE_OF_CONDUCT/","level":1,"title":"Code of Conduct","text":"","path":["Code of Conduct"],"tags":[]},{"location":"CODE_OF_CONDUCT/#our-pledge","level":2,"title":"Our Pledge","text":"<p>I am committed to making this repository a welcoming and respectful place for learning and discussion.</p>","path":["Code of Conduct"],"tags":[]},{"location":"CODE_OF_CONDUCT/#expectations","level":2,"title":"Expectations","text":"<ul> <li>Be Respectful: Treat others with kindness and respect in Issues and Discussions.</li> <li>Academic Integrity: Do not use this platform to facilitate cheating or academic dishonesty.</li> <li>Constructive Feedback: Criticism should be helpful and focused on the code, not the person.</li> </ul>","path":["Code of Conduct"],"tags":[]},{"location":"CODE_OF_CONDUCT/#enforcement","level":2,"title":"Enforcement","text":"<p>As the repository owner, I reserve the right to remove any comments, issues, or pull requests that violate these standards or the academic integrity goals of this project.</p> <p>Thank you for being a responsible part of this learning journey.</p>","path":["Code of Conduct"],"tags":[]},{"location":"CONTRIBUTING/","level":1,"title":"Contributing to bsc","text":"<p>Thank you for your interest in improving this repository! Now that this project is licensed under the MIT License, I welcome community contributions, bug reports, and optimizations.</p>","path":["Contributing to bsc"],"tags":[]},{"location":"CONTRIBUTING/#licensing","level":2,"title":"Licensing","text":"<p>By submitting a Pull Request (PR) or code snippet to this repository, you agree that your contribution will be governed by the MIT License. </p>","path":["Contributing to bsc"],"tags":[]},{"location":"CONTRIBUTING/#how-to-contribute","level":2,"title":"How to Contribute","text":"<ol> <li>Report Bugs: If you find an error in a solution, please open an Issue. Provide details on how to reproduce the error or why the current logic is incorrect.</li> <li>Suggest Improvements: If you have a more efficient algorithm or a cleaner implementation, feel free to share it via an Issue or a PR.</li> <li>Documentation: Typos, better comments, and clarity improvements are always appreciated.</li> </ol>","path":["Contributing to bsc"],"tags":[]},{"location":"CONTRIBUTING/#contribution-guidelines","level":2,"title":"Contribution Guidelines","text":"<p>To maintain the quality of this resource, please ensure:</p> <ul> <li>Originality: You certify that the code you submit is your own original work or that you have the right to submit it under the MIT License.</li> <li>Academic Integrity: Do not submit code copied from textbooks or other students without proper attribution. </li> <li>Purpose: While this is now open-source, please avoid submitting solutions to active university assignments that could facilitate academic dishonesty.</li> </ul>","path":["Contributing to bsc"],"tags":[]},{"location":"CONTRIBUTING/#getting-started","level":2,"title":"Getting Started","text":"<ol> <li>Fork the repository.</li> <li>Clone your fork locally.</li> <li>Create a branch for your changes.</li> <li>Commit your work with clear descriptions.</li> <li>Push to your fork and submit a Pull Request.</li> </ol> <p>Thank you for helping keep this resource accurate and high-quality!</p>","path":["Contributing to bsc"],"tags":[]},{"location":"LICENSE/","level":1,"title":"LICENSE","text":"<p>MIT License</p> <p>Copyright (c) 2025-2026 AMIT DUTTA</p> <p>Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the \"Software\"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:</p> <p>The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.</p> <p>THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.</p>","path":["LICENSE"],"tags":[]},{"location":"SECURITY/","level":1,"title":"Security Policy","text":"","path":["Security Policy"],"tags":[]},{"location":"SECURITY/#reporting-a-vulnerability-or-code-error","level":2,"title":"Reporting a Vulnerability or Code Error","text":"<p>While this is a personal learning project, if you discover a security vulnerability in any of the code, I would appreciate it if you could bring it to my attention.</p> <p>Please report vulnerabilities or Errors by opening a new issue on the repository. Please provide as much detail as possible in your report, including the steps to reproduce the vulnerability and to solve the error.</p> <p>Thank you for helping to improve the quality of my work.</p>","path":["Security Policy"],"tags":[]},{"location":"credits/","level":1,"title":"Acknowledgments","text":"<p>Building and maintaining a fast, open-source code index requires reliable and accessible infrastructure. I would like to extend my sincere gratitude to the following platforms, communities, and open-source projects that make <code>code.amit.is-a.dev</code> possible:</p> <ul> <li>is-a.dev: For providing the sleek, developer-centric domain name completely free of charge, giving this project a professional home.</li> <li>Hugging Face: For securely and reliably storing the extensive collection of raw C programming files.</li> <li>Cloudflare: For handling the backend routing, DNS, and caching, seamlessly bridging the domain to ensure Hugging Face serves the code files swiftly and securely.</li> <li>Firebase: For providing lightning-fast, dependable, and free web hosting for the site's compiled static assets.</li> <li>MkDocs, Material for MkDocs & Zensical: The phenomenal foundational frameworks that effortlessly transform raw Markdown files and code snippets into the beautiful, searchable, and highly responsive user interface you see today.</li> </ul> <p>This project thrives thanks to the generosity of these free-tier services and the incredible work of the open-source community.</p>","path":["Acknowledgments"],"tags":[]},{"location":"faq/","level":1,"title":"Frequently Asked Questions (FAQ)","text":"","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#general","level":2,"title":"General","text":"","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#1-what-is-this-project","level":3,"title":"1. What is this project?","text":"<p>A live archive of BSc Computer Science practical codes following the WBSU curriculum.</p>","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#2-who-created-this","level":3,"title":"2. Who created this?","text":"<p>Amit Dutta</p>","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#3-where-is-the-source-code-hosted","level":3,"title":"3. Where is the source code hosted?","text":"<p>On GitHub: https://github.com/notamitgamer/bsc</p>","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#4-can-i-use-this-code","level":3,"title":"4. Can I use this code?","text":"<p>Yes, under the MIT License.</p>","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#5-can-i-copy-this-for-assignments","level":3,"title":"5. Can I copy this for assignments?","text":"<p>No. You should understand and rewrite the logic.</p>","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#metadata","level":2,"title":"Metadata","text":"","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#6-what-is-author","level":3,"title":"6. What is \"Author\"?","text":"<p>The person who wrote the code.</p>","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#7-what-is-repo","level":3,"title":"7. What is \"Repo\"?","text":"<p>The original source repository of the file.</p>","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#8-what-is-license","level":3,"title":"8. What is \"License\"?","text":"<p>It defines how the code can be used.</p>","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#usage","level":2,"title":"Usage","text":"","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#9-can-i-print-the-code","level":3,"title":"9. Can I print the code?","text":"<p>Yes. Use the Raw button and print from your browser.</p>","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#10-can-i-reuse-this-in-projects","level":3,"title":"10. Can I reuse this in projects?","text":"<p>Yes, but follow the license terms.</p>","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#11-can-i-modify-the-code","level":3,"title":"11. Can I modify the code?","text":"<p>Yes. You are encouraged to experiment and improve.</p>","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#academic-integrity","level":2,"title":"Academic Integrity","text":"","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#12-what-is-academic-integrity","level":3,"title":"12. What is academic integrity?","text":"<p>It means doing your own work honestly.</p>","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#13-is-copying-allowed","level":3,"title":"13. Is copying allowed?","text":"<p>No. Copying without understanding is discouraged.</p>","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#14-what-should-i-do-instead","level":3,"title":"14. What should I do instead?","text":"<ul> <li>Read the code</li> <li>Understand the logic</li> <li>Rewrite it yourself</li> </ul>","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#technical","level":2,"title":"Technical","text":"","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#15-why-is-something-missing","level":3,"title":"15. Why is something missing?","text":"<p>The project is continuously updated.</p>","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#16-how-often-is-it-updated","level":3,"title":"16. How often is it updated?","text":"<p>As the academic journey progresses.</p>","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"faq/#17-where-can-i-report-issues","level":3,"title":"17. Where can I report issues?","text":"<p>On GitHub Issues: https://github.com/notamitgamer/bsc/issues</p>","path":["Frequently Asked Questions (FAQ)"],"tags":[]},{"location":"quickstart/","level":1,"title":"Quick Start Guide","text":"<p>Get started with the BSc Code Index in minutes.</p>","path":["Quick Start Guide"],"tags":[]},{"location":"quickstart/#1-browse-the-code","level":2,"title":"1. Browse the Code","text":"<ul> <li>Use the sidebar to navigate semesters and topics</li> <li>Click any file to view full documentation</li> </ul>","path":["Quick Start Guide"],"tags":[]},{"location":"quickstart/#2-understand-a-program","level":2,"title":"2. Understand a Program","text":"<p>Each page includes:</p> <ul> <li>Problem Statement</li> <li>Source Code</li> </ul>","path":["Quick Start Guide"],"tags":[]},{"location":"quickstart/#3-run-the-code","level":2,"title":"3. Run the Code","text":"","path":["Quick Start Guide"],"tags":[]},{"location":"quickstart/#for-c","level":3,"title":"For C","text":"<pre><code>gcc file.c -o output\n./output\n</code></pre>","path":["Quick Start Guide"],"tags":[]},{"location":"quickstart/#for-r","level":3,"title":"For R","text":"<pre><code>Rscript file.r\n</code></pre>","path":["Quick Start Guide"],"tags":[]},{"location":"quickstart/#4-print-or-save","level":2,"title":"4. Print or Save","text":"<ul> <li>Click Raw</li> <li>Use browser → Print → Save as PDF</li> </ul>","path":["Quick Start Guide"],"tags":[]},{"location":"quickstart/#5-learn-properly","level":2,"title":"5. Learn Properly","text":"<p>Important</p> <p>Do NOT copy-paste blindly.</p> <p>Best method: - Read the code - Understand logic - Rewrite yourself</p>","path":["Quick Start Guide"],"tags":[]},{"location":"quickstart/#6-use-github","level":2,"title":"6. Use GitHub","text":"<ul> <li>View full repository</li> <li>Track updates</li> <li>Explore file history</li> </ul>","path":["Quick Start Guide"],"tags":[]},{"location":"quickstart/#7-folder-navigation","level":2,"title":"7. Folder Navigation","text":"<p>Each folder contains: - Subfolders (topics/semesters) - Code files - Auto-generated index</p>","path":["Quick Start Guide"],"tags":[]},{"location":"quickstart/#8-youre-ready","level":2,"title":"8. You're Ready","text":"<p>Start exploring and learning step-by-step.</p>","path":["Quick Start Guide"],"tags":[]},{"location":"terms/","level":1,"title":"Terms of Use","text":"<p>These Terms govern your use of this website and all associated content, including source code, documentation, and generated materials.</p>","path":["Terms of Use"],"tags":[]},{"location":"terms/#about-this-project","level":2,"title":"About This Project","text":"<p>BSc Code Index is an open-source, publicly available collection of reference code and assignment solutions from a BSc (Honours) Computer Science degree at the West Bengal State University (WBSU). It is maintained and published by Amit Dutta (@notamitgamer) as a personal academic reference for students.</p> <p>The project is hosted on GitHub and freely accessible to anyone. It is not affiliated with or endorsed by WBSU or any academic institution.</p>","path":["Terms of Use"],"tags":[]},{"location":"terms/#acceptance-of-terms","level":2,"title":"Acceptance of Terms","text":"<p>By accessing or using this website, you confirm that you have read, understood, and agree to be bound by these Terms. If you do not agree, you must not use this website or its content.</p>","path":["Terms of Use"],"tags":[]},{"location":"terms/#author","level":2,"title":"Author","text":"<p>This project is created and maintained by:</p> <ul> <li>Name: Amit Dutta</li> <li>GitHub: github.com/notamitgamer</li> <li>Website: amit.is-a.dev</li> </ul>","path":["Terms of Use"],"tags":[]},{"location":"terms/#ownership-project-status","level":2,"title":"Ownership & Project Status","text":"<p>This project is provided publicly for educational and reference purposes. The author reserves the right to:</p> <ul> <li>Limit or withdraw access at any time</li> <li>Discontinue the project without notice</li> <li>Disclaim responsibility for how the project is used</li> </ul> <p>No guarantee is made regarding long-term availability or maintenance.</p>","path":["Terms of Use"],"tags":[]},{"location":"terms/#academic-integrity","level":2,"title":"Academic Integrity","text":"<p>This repository is intended strictly for learning and reference.</p> <ul> <li>You are solely responsible for how you use this code</li> <li>Copying code directly for academic submissions is strongly discouraged</li> <li>Any plagiarism, cheating, or misuse is entirely your own responsibility</li> </ul> <p>The author holds no liability for academic misconduct resulting from misuse of this content.</p>","path":["Terms of Use"],"tags":[]},{"location":"terms/#license","level":2,"title":"License","text":"<p>Unless otherwise stated, all code is licensed under the MIT License. You are free to use, modify, and distribute the code in accordance with its terms.</p>","path":["Terms of Use"],"tags":[]},{"location":"terms/#use-at-your-own-risk","level":2,"title":"Use at Your Own Risk","text":"<p>All content is provided \"as-is\" and \"as available\" with no guarantees of correctness, completeness, reliability, or fitness for academic, professional, or production use. You use this website and its content entirely at your own risk.</p>","path":["Terms of Use"],"tags":[]},{"location":"terms/#disclaimer-limitation-of-liability","level":2,"title":"Disclaimer & Limitation of Liability","text":"<p>To the fullest extent permitted by law:</p> <ul> <li>The author shall not be liable for any direct, indirect, incidental, or consequential damages</li> <li>This includes (but is not limited to):<ul> <li>Academic penalties</li> <li>Data loss</li> <li>System failures</li> <li>Incorrect results or outputs</li> </ul> </li> </ul>","path":["Terms of Use"],"tags":[]},{"location":"terms/#content-accuracy","level":2,"title":"Content Accuracy","text":"<p>While efforts are made to ensure correctness, content may contain errors or outdated information. No guarantee is made regarding accuracy or completeness.</p>","path":["Terms of Use"],"tags":[]},{"location":"terms/#indemnification","level":2,"title":"Indemnification","text":"<p>You agree to indemnify and hold harmless the author from any claims, losses, liabilities, damages, or expenses (including legal fees) arising from your use of this service or your violation of these Terms.</p>","path":["Terms of Use"],"tags":[]},{"location":"terms/#data-privacy","level":2,"title":"Data & Privacy","text":"<p>This website:</p> <ul> <li>Does not collect personal data</li> <li>Does not track users</li> <li>Does not store user information</li> </ul> <p>External platforms such as GitHub or hosting providers may have their own privacy policies.</p>","path":["Terms of Use"],"tags":[]},{"location":"terms/#third-party-services","level":2,"title":"Third-Party Services","text":"<p>This website may rely on third-party platforms such as GitHub and hosting providers. The author is not responsible for their services, policies, or availability.</p>","path":["Terms of Use"],"tags":[]},{"location":"terms/#updates-to-terms","level":2,"title":"Updates to Terms","text":"<p>These Terms may be updated at any time. Changes take effect immediately upon posting. Your continued use of the website constitutes acceptance of the updated Terms.</p>","path":["Terms of Use"],"tags":[]},{"location":"terms/#governing-law","level":2,"title":"Governing Law","text":"<p>These Terms are governed by the laws of India. Any disputes shall be subject to the exclusive jurisdiction of the Barasat Court, West Bengal.</p>","path":["Terms of Use"],"tags":[]},{"location":"terms/#contact","level":2,"title":"Contact","text":"<p>For any questions regarding these Terms, you may reach out via:</p> <ul> <li>Email: amitdutta4255@gmail.com</li> <li>Email: mail@amit.is-a.dev</li> <li>GitHub: github.com/notamitgamer</li> <li>Website: amit.is-a.dev</li> </ul> <p>This project exists to support learning and exploration. Use it responsibly.</p>","path":["Terms of Use"],"tags":[]},{"location":"semester_1/","level":1,"title":"Index","text":"<p>Active</p> <p>Files and sub-folders in Eduincs Exam.</p>","path":["Semester 1","Index"],"tags":[]},{"location":"semester_1/#semester-1-active-content","level":2,"title":"SEMESTER 1: ACTIVE CONTENT","text":"<p>This folder contains all my current academic work, including practicals, assignments, and study materials for the BSc Computer Science program (SEM-I) at Acharya Prafulla Chandra College (APC).</p> <p>Current Status: * Actively Updated: New code and materials are added following the college schedule. * Technologies: Primarily focusing on C Programming and R Programming.</p> <p>Explore More: * See my other projects on my Portfolio * Follow my development journey on GitHub</p>","path":["Semester 1","Index"],"tags":[]},{"location":"semester_1/#folders","level":2,"title":"Folders","text":"No. Folder Name Link 1 Assignment Primary Open Folder 2 Assignment Secondary Open Folder 3 Eduincs Exam Open Folder 4 Internal Practice Open Folder 5 Khurapati Idea Open Folder 6 Letusc Open Folder 7 Practice C Open Folder 8 Temp Open Folder 9 Tuition C Open Folder 10 R Open Folder","path":["Semester 1","Index"],"tags":[]},{"location":"semester_1/#directory-structure","level":2,"title":"Directory Structure","text":"<p>To keep the repository organized, the C and R programs are divided into specific categories based on their origin and purpose. </p>","path":["Semester 1","Index"],"tags":[]},{"location":"semester_1/#c-programming","level":3,"title":"C Programming","text":"<ul> <li><code>/assignment-primary/</code>: Core college assignments and standard problems.</li> <li><code>/assignment-secondary/</code>: Additional or extended college assignments.</li> <li><code>/internal-practice/</code>: Code written for internal exam preparation.</li> <li><code>/practice-c/</code>: General, day-to-day C programming practice files.</li> <li><code>/tuition-c/</code>: Programs and problem-solving exercises completed during tuition classes (files prefixed with <code>APC-PRAC</code>, <code>APC-S</code>, etc.).</li> <li><code>/EduInCS Exam/</code>: Specific code solutions for exam papers organized by date.</li> <li><code>/letusc/</code>: Chapter-wise exercise solutions from the textbook \"Let Us C\".</li> <li><code>/khurapati-idea/</code>: Experimental code, logical tests, and out-of-the-box ideas.</li> </ul>","path":["Semester 1","Index"],"tags":[]},{"location":"semester_1/#r-programming","level":3,"title":"R Programming","text":"<ul> <li><code>/R/</code>: Contains all R-related coursework, split into:</li> <li><code>/Code/</code>: R script files (<code>.r</code>) for practicals.</li> <li><code>/Material_PDF/</code>: Study materials and reference documents for R.</li> </ul>","path":["Semester 1","Index"],"tags":[]},{"location":"semester_1/#how-to-find-a-specific-code","level":2,"title":"How to Find a Specific Code","text":"<ol> <li>Identify the Category: Determine if the code was an assignment, a textbook problem, or a tuition exercise, and navigate to the corresponding folder above.</li> <li>Naming Convention: Most files are sequentially numbered for easy tracking (e.g., <code>assignment-p-01.c</code>, <code>luc018.c</code>, <code>APC-PRAC-005.c</code>).</li> <li>Internal Comments: Open the file. Most source codes include a commented section at the top detailing the exact problem statement or logic being solved.</li> </ol>","path":["Semester 1","Index"],"tags":[]},{"location":"semester_1/#how-to-run-the-programs","level":2,"title":"How to Run the Programs","text":"","path":["Semester 1","Index"],"tags":[]},{"location":"semester_1/#running-c-programs-c","level":3,"title":"Running C Programs (<code>.c</code>)","text":"<p>Ensure you have a C compiler (like GCC via MinGW) installed. If you haven't set it up, refer to the Main Repository README for the installation guide.</p> <ol> <li>Open your terminal or command prompt.</li> <li>Navigate to the folder containing the specific program:</li> </ol> <p><pre><code>cd Semester_1/assignment-primary\n</code></pre> 4. Compile the code using GCC:</p> <p><pre><code>gcc assignment-p-01.c -o program.exe\n</code></pre> 6. Execute the compiled file:</p> <pre><code>./program.exe\n</code></pre>","path":["Semester 1","Index"],"tags":[]},{"location":"semester_1/#running-r-programs-r","level":3,"title":"Running R Programs (<code>.r</code>)","text":"<p>It is highly recommended to run R programs using RStudio for the best visual experience with data and plots.</p>","path":["Semester 1","Index"],"tags":[]},{"location":"semester_1/#to-run-via-command-line","level":4,"title":"To run via command line:","text":"<ol> <li>Open your terminal.</li> <li>Navigate to the R Code directory:</li> </ol> <p><pre><code>cd Semester_1/R/Code\n</code></pre> 4. Execute the script using <code>Rscript</code>:</p> <pre><code>Rscript R_Prac-1.r\n</code></pre>","path":["Semester 1","Index"],"tags":[]},{"location":"semester_1/model_questions/","level":1,"title":"Model Questions: Computer Fundamentals and Programming with C","text":"","path":["Semester 1","Model Questions: Computer Fundamentals and Programming with C"],"tags":[]},{"location":"semester_1/model_questions/#paper-code-cmsacor01t","level":3,"title":"Paper Code: CMSACOR01T","text":"<p>How to use this file</p> <p>Questions are grouped unit-wise matching the WBSU NEP syllabus. If you can answer each descriptive question fully, all short/MCQ variants on that topic are automatically covered. Attempt at least 2 questions from each unit before your exam.</p>","path":["Semester 1","Model Questions: Computer Fundamentals and Programming with C"],"tags":[]},{"location":"semester_1/model_questions/#unit-1-overview-of-c","level":2,"title":"Unit 1 — Overview of C","text":"<p>Q1. Trace the history of the C programming language from its origin at Bell Labs to its standardization as ANSI C. Explain why C is considered a middle-level language and what advantages it offers over assembly language and over high-level languages like Python.</p> <p>Q2. Describe the basic structure of a C program with a complete annotated example. Explain the role of each section: documentation, preprocessor directives, global declarations, <code>main()</code>, and user-defined functions. What happens if <code>main()</code> is absent?</p> <p>Q3. What is an algorithm? List and explain the five essential properties of an algorithm. Write an algorithm (in pseudocode or flowchart) to find the largest of three numbers, and then translate it into a working C program.</p> <p>Q4. Explain structured programming constructs in detail. What are the three fundamental control structures according to the Böhm–Jacopini theorem? How does C implement each of them? Why did structured programming replace \"goto-heavy\" coding?</p> <p>Q5. List all the character sets used in C. Classify them into letters, digits, special characters, and whitespace characters. Give examples of how special characters serve dual purposes in C (e.g., <code>*</code> as both multiplication operator and pointer declarator).</p> <p>Q6. Define the term token in C. Identify and explain all six categories of tokens: keywords, identifiers, constants, string literals, operators, and punctuators. Give two examples from each category.</p> <p>Q7. List all 32 keywords of ANSI C. For any 10 of them, write a short code snippet demonstrating their purpose. Why are keywords case-sensitive in C?</p> <p>Q8. Differentiate between integer constants, floating-point constants, character constants, and string constants in C. What is an escape sequence? List at least eight escape sequences with their meanings and an example use of each.</p> <p>Q9. What is a variable? Explain the rules for naming variables in C. Differentiate between variable declaration and variable definition with examples. What is the significance of the <code>extern</code> keyword in this context?</p> <p>Q10. Describe all primitive data types in C (<code>int</code>, <code>float</code>, <code>double</code>, <code>char</code>, <code>void</code>). For each, state the typical size (in bytes on a 32-bit system), range, and a usage example. What is the role of type modifiers (<code>signed</code>, <code>unsigned</code>, <code>short</code>, <code>long</code>)?</p> <p>Q11. Explain the four storage classes in C — <code>auto</code>, <code>register</code>, <code>static</code>, and <code>extern</code> — with respect to: (a) storage location, (b) default initial value, (c) scope, (d) lifetime. Write a single program that demonstrates at least three of these.</p> <p>Q12. What is meant by scope and lifetime of a variable? Differentiate between local scope, global scope, and block scope with examples. What problem can arise when a local variable has the same name as a global variable, and how does C resolve this?</p>","path":["Semester 1","Model Questions: Computer Fundamentals and Programming with C"],"tags":[]},{"location":"semester_1/model_questions/#unit-2-operators-expressions-and-preprocessor","level":2,"title":"Unit 2 — Operators, Expressions and Preprocessor","text":"<p>Q13. Explain all arithmetic operators in C with examples. What is integer division in C? Write a program that accepts two integers and demonstrates all arithmetic operations including integer division truncation and the modulo operator.</p> <p>Q14. List and explain all relational and logical operators in C. What values do they return? Write a program that reads a year and determines whether it is a leap year using relational and logical operators.</p> <p>Q15. Explain the assignment operator and all compound assignment operators (<code>+=</code>, <code>-=</code>, <code>*=</code>, <code>/=</code>, <code>%=</code>, <code>&=</code>, <code>|=</code>, <code>^=</code>, <code><<=</code>, <code>>>=</code>) with examples. What is the difference between <code>=</code> (assignment) and <code>==</code> (equality)?</p> <p>Q16. Explain pre-increment (<code>++i</code>) and post-increment (<code>i++</code>) operators, and their decrement counterparts, with detailed examples. Write a program showing how <code>a = i++</code> and <code>a = ++i</code> produce different results.</p> <p>Q17. Explain the conditional (ternary) operator <code>? :</code> in C with syntax and at least three practical examples. When would you prefer the ternary operator over an <code>if-else</code> block?</p> <p>Q18. Describe all six bitwise operators in C (<code>&</code>, <code>|</code>, <code>^</code>, <code>~</code>, <code><<</code>, <code>>></code>). Write a program that: (a) checks whether a number is even or odd using bitwise AND, (b) swaps two numbers without a temporary variable using XOR, and (c) multiplies a number by 8 using left shift.</p> <p>Q19. What are special operators in C? Explain the <code>sizeof</code> operator, the comma operator, the address-of operator <code>&</code>, and the dereference operator <code>*</code> with examples. What does <code>sizeof(int)</code> return on a 64-bit system and why?</p> <p>Q20. Explain operator precedence and associativity in C. Draw a precedence table covering at least 10 levels. Trace the evaluation of the following expression step-by-step: <code>x = 3 + 4 * 2 - 6 / 2 + (8 % 3)</code>.</p> <p>Q21. What is type casting in C? Distinguish between implicit (automatic) type conversion and explicit type casting with examples. What is integer promotion? Write a program showing a case where implicit conversion leads to data loss.</p> <p>Q22. Explain the role of the C preprocessor. Describe the following directives with syntax and examples: <code>#include</code>, <code>#define</code>, <code>#undef</code>, <code>#if</code>, <code>#ifdef</code>, <code>#ifndef</code>, <code>#else</code>, <code>#elif</code>, <code>#endif</code>, and <code>#error</code>. What is the difference between <code>#include <file></code> and <code>#include \"file\"</code>?</p> <p>Q23. What is a macro in C? Explain function-like macros vs. object-like macros. Write macros for: (a) finding the maximum of two numbers, (b) squaring a number, (c) converting Fahrenheit to Celsius. What is a macro side effect — illustrate with <code>#define SQUARE(x) x*x</code> when called as <code>SQUARE(a+1)</code>.</p> <p>Q24. Describe all standard input/output functions available in C: <code>printf()</code>, <code>scanf()</code>, <code>getchar()</code>, <code>putchar()</code>, <code>gets()</code>, <code>puts()</code>. Explain all format specifiers (<code>%d</code>, <code>%f</code>, <code>%c</code>, <code>%s</code>, <code>%e</code>, <code>%o</code>, <code>%x</code>, <code>%p</code>, <code>%ld</code>, <code>%lf</code>). Write a program that reads and prints data of multiple types.</p>","path":["Semester 1","Model Questions: Computer Fundamentals and Programming with C"],"tags":[]},{"location":"semester_1/model_questions/#unit-3-decision-and-loop-control-structures","level":2,"title":"Unit 3 — Decision and Loop Control Structures","text":"<p>Q25. Explain the <code>if</code>, <code>if-else</code>, and nested <code>if-else</code> statements with syntax, flowcharts, and examples. Write a program that reads three numbers and prints them in descending order using nested <code>if-else</code>.</p> <p>Q26. Explain the <code>switch</code> statement in detail — its syntax, how it works, the role of <code>break</code>, the <code>default</code> case, and fall-through behaviour. Write a program that implements a simple calculator (+, -, *, /) using <code>switch</code>. What are the limitations of <code>switch</code> compared to <code>if-else</code>?</p> <p>Q27. What is the conditional operator <code>? :</code> as a decision construct? Compare and contrast <code>switch</code> and <code>if-else-if</code> ladder: when is each preferred? Write the same grade-classification program using both constructs.</p> <p>Q28. Describe the <code>while</code> loop in C with syntax and flowchart. Write a program using <code>while</code> to: (a) print all perfect numbers between 1 and 500, (b) find the GCD of two numbers using the Euclidean algorithm.</p> <p>Q29. Describe the <code>do-while</code> loop and explain the fundamental difference between <code>while</code> and <code>do-while</code>. Give a scenario where <code>do-while</code> is the correct choice. Write a menu-driven program that keeps repeating until the user chooses to quit, using <code>do-while</code>.</p> <p>Q30. Explain the <code>for</code> loop with syntax, flowchart, and examples. Write programs to: (a) print the multiplication table of a number, (b) compute n! (factorial), (c) print Pascal's triangle up to n rows. Show how to write an infinite loop using <code>for</code>.</p> <p>Q31. Explain the <code>break</code> and <code>continue</code> statements in C with examples. How do they differ in their effect inside a loop? Write a program that prints all prime numbers from 2 to 100 using <code>break</code> and <code>continue</code> appropriately.</p> <p>Q32. Explain the <code>goto</code> statement in C with syntax and an example. Why is <code>goto</code> generally discouraged in structured programming? Are there any cases where <code>goto</code> is considered acceptable? Give an example of forward jump and backward jump using <code>goto</code>.</p> <p>Q33. Write a program in C that prints the following patterns. Explain the loop logic used for each: <pre><code>(a) * (b) ***** (c) 1\n *** **** 1 2\n ***** *** 1 2 3\n ******* ** 1 2 3 4\n ********* * 1 2 3 4 5\n</code></pre></p> <p>Q34. Write a C program to check whether a number is Armstrong (narcissistic), and use it to print all Armstrong numbers between 1 and 9999. Explain the algorithm. Also write programs to check Palindrome and Perfect numbers.</p>","path":["Semester 1","Model Questions: Computer Fundamentals and Programming with C"],"tags":[]},{"location":"semester_1/model_questions/#unit-4-functions-and-arrays","level":2,"title":"Unit 4 — Functions and Arrays","text":"<p>Q35. Explain the concept of functions in C. What are the advantages of modular programming using functions? Distinguish between the following: (a) function declaration (prototype), (b) function definition, (c) function call. Write a program that uses a function to check whether a number is prime.</p> <p>Q36. Explain call by value and call by reference in C with examples. Which mechanism does C use by default? How can call-by-reference behaviour be simulated in C? Write a program to swap two integers both ways and show the difference in output.</p> <p>Q37. Explain functions returning values and void functions (functions returning nothing). What is the <code>return</code> statement? Can a function return multiple values directly? If not, how can you achieve returning multiple values? Write an appropriate example.</p> <p>Q38. What are inline functions in C? Why are they used, and what is the benefit over macros? What are the limitations of inline functions? (Note: Inline is a C99/C++ feature; explain how it relates to macros in ANSI C context.)</p> <p>Q39. What are function parameters? Explain formal parameters vs. actual parameters. What happens if too few or too many arguments are passed? Describe functions with variable number of arguments using <code><stdarg.h></code> (<code>va_list</code>, <code>va_start</code>, <code>va_arg</code>, <code>va_end</code>) with an example that sums n integers.</p> <p>Q40. Explain command line arguments in C. What is the signature <code>int main(int argc, char *argv[])</code>? Write a program that accepts a filename from the command line and prints its contents. What happens if no arguments are provided?</p> <p>Q41. What is recursion? Explain how the call stack works during recursion with a diagram. Write recursive C programs to compute: (a) factorial, (b) Fibonacci numbers, (c) GCD (Euclidean method), (d) Tower of Hanoi. Discuss the advantages and disadvantages of recursion vs. iteration.</p> <p>Q42. Declare and define a one-dimensional array in C. Explain the relationship between an array name and a pointer. Write a program that: (a) finds the maximum and minimum element, (b) reverses the array in place, (c) performs linear search, (d) performs binary search — all using the same array.</p> <p>Q43. Explain two-dimensional arrays in C. How is a 2D array stored in memory (row-major order)? Write a C program to: (a) multiply two matrices, (b) find the transpose of a matrix, (c) check whether a matrix is symmetric. Also explain multi-dimensional arrays.</p> <p>Q44. Explain string handling in C. How are character arrays used to store strings? What is the null character <code>'\\0'</code> and why is it important? Explain and demonstrate the following string functions from <code><string.h></code>: <code>strlen</code>, <code>strcpy</code>, <code>strcat</code>, <code>strcmp</code>, <code>strchr</code>, <code>strstr</code>, <code>strtok</code>, <code>strrev</code>.</p> <p>Q45. Write a C program that reads a sentence and: (a) counts the number of words, vowels, consonants, and digits, (b) converts to uppercase, (c) reverses the sentence word by word (not character by character). Explain the string manipulation logic used.</p>","path":["Semester 1","Model Questions: Computer Fundamentals and Programming with C"],"tags":[]},{"location":"semester_1/model_questions/#unit-5-pointers","level":2,"title":"Unit 5 — Pointers","text":"<p>Q46. What is a pointer in C? Explain pointer declaration, initialization, and dereferencing with detailed examples. What is the difference between <code>int *p = &x</code> and <code>int *p = x</code>? What is a null pointer, and why should you initialize pointers?</p> <p>Q47. Explain pointer arithmetic in C. What operations are valid on pointers? Trace through the following: if <code>int a[] = {10, 20, 30, 40}</code> and <code>int *p = a</code>, what is the value of <code>*(p+2)</code>, <code>p[3]</code>, <code>*(p++)</code>, <code>*++p</code>? Explain why you cannot multiply two pointers.</p> <p>Q48. Explain the relationship between pointers and arrays in C. Why does the array name act as a constant pointer? Write a program to traverse an array using a pointer instead of an index. What is the difference between <code>a[i]</code> and <code>*(a+i)</code>?</p> <p>Q49. Explain pointer-to-pointer (double pointer) in C. Give a scenario where it is necessary. Write a program that uses a double pointer to dynamically allocate a 2D array.</p> <p>Q50. Describe string manipulation using pointers. Write C functions (using only pointer operations, no array indexing) to: (a) compute string length, (b) copy one string to another, (c) concatenate two strings, (d) compare two strings.</p> <p>Q51. What is dynamic memory allocation in C? Explain <code>malloc()</code>, <code>calloc()</code>, <code>realloc()</code>, and <code>free()</code> with syntax and examples. What is a memory leak, and how does <code>free()</code> prevent it? Write a program to dynamically create an array of n integers entered by the user.</p> <p>Q52. Explain the <code>new</code> and <code>delete</code> operators for dynamic allocation. How do they differ from <code>malloc/free</code>? (Note: these are C++ operators; explain in the context of C++ compatibility discussed in C courses.) Write a program using <code>new</code> to allocate a 1D array dynamically.</p> <p>Q53. What are function pointers in C? Explain declaration, assignment, and calling syntax. Write a program that uses an array of function pointers to implement a simple calculator — each operation (+, -, *, /) is pointed to by a function pointer.</p> <p>Q54. Explain <code>const</code> pointers vs. pointers to <code>const</code> in C. What is the difference between: (a) <code>const int *p</code>, (b) <code>int * const p</code>, (c) <code>const int * const p</code>? Give a practical use case for each.</p>","path":["Semester 1","Model Questions: Computer Fundamentals and Programming with C"],"tags":[]},{"location":"semester_1/model_questions/#unit-6-user-defined-datatypes-and-memory-allocation","level":2,"title":"Unit 6 — User-defined Datatypes and Memory Allocation","text":"<p>Q55. What are enumerated data types (<code>enum</code>) in C? How are they declared and used? What are their default values, and how can you assign custom values? Write a program that uses <code>enum</code> to represent days of the week and prints whether a given day is a weekday or weekend.</p> <p>Q56. Define a structure in C. How is it different from an array? Explain: (a) declaring a structure, (b) defining a structure variable, (c) accessing members using <code>.</code> operator, (d) initializing a structure. Write a program using a structure to store and display student records (roll number, name, marks in 5 subjects, average).</p> <p>Q57. Explain arrays of structures in C. Write a program to maintain a phone book: store 5 contacts (name, phone number, email) in an array of structures, and implement search by name.</p> <p>Q58. Explain pointers to structures in C. What is the <code>-></code> (arrow) operator and when is it used? Rewrite the student record program from Q56 using a pointer to the structure. Explain how passing a structure pointer to a function is more efficient than passing by value.</p> <p>Q59. Explain nested structures in C (structure within a structure). Write a program to store employee data: each employee has a name, ID, and a <code>date_of_joining</code> (which is itself a structure with day, month, year fields). Print the employee who joined earliest.</p> <p>Q60. Define a <code>union</code> in C. How does it differ from a <code>struct</code>? Explain memory allocation in a union. Write a program that uses a union to store either an integer, float, or character and prints the currently active member. What hazards can arise with unions?</p> <p>Q61. What is <code>typedef</code> in C? How can <code>typedef</code> be combined with <code>struct</code> and <code>union</code> to simplify code? Rewrite the student structure from Q56 using <code>typedef</code>. What is the advantage of <code>typedef</code> over <code>#define</code> for type aliasing?</p> <p>Q62. Compare and contrast static vs. dynamic memory allocation in C. Explain: (a) where statically allocated variables are stored (stack/BSS/data segment), (b) where dynamically allocated memory lives (heap). What causes a stack overflow, and what causes a heap overflow?</p> <p>Q63. Explain the use of <code>malloc()</code> and <code>calloc()</code> for memory allocation in detail. What is the difference between them regarding initialization? Write a program that: (a) builds a linked list of integers dynamically, (b) traverses and prints it, (c) frees all nodes.</p> <p>Q64. Describe bit fields in C structures. Write a program that uses bit fields to compactly represent a date (day: 5 bits, month: 4 bits, year: 12 bits) inside a structure. What is the advantage of bit fields in embedded/systems programming?</p>","path":["Semester 1","Model Questions: Computer Fundamentals and Programming with C"],"tags":[]},{"location":"semester_1/model_questions/#unit-7-file-access","level":2,"title":"Unit 7 — File Access","text":"<p>Q65. What is a file in C? Explain the difference between text files and binary files. Why is file I/O necessary? Describe the <code>FILE</code> pointer and the <code>fstream</code> header. Explain the modes: <code>\"r\"</code>, <code>\"w\"</code>, <code>\"a\"</code>, <code>\"r+\"</code>, <code>\"w+\"</code>, <code>\"a+\"</code>, <code>\"rb\"</code>, <code>\"wb\"</code>.</p> <p>Q66. Explain <code>fopen()</code> and <code>fclose()</code> in detail. What happens if <code>fopen()</code> fails, and how should you handle it? Write a program that opens a file, writes 10 student records (name, roll no., marks) to it, closes it, reopens it, and reads and displays all records.</p> <p>Q67. Explain character-level file I/O using <code>fgetc()</code> / <code>getc()</code> and <code>fputc()</code> / <code>putc()</code>. Write a program that: (a) copies one text file to another character by character, (b) counts the number of vowels, consonants, lines, and words in a text file.</p> <p>Q68. Explain <code>fgets()</code> and <code>fputs()</code> for line-by-line file I/O. How do they differ from <code>gets()</code> and <code>puts()</code>? Write a program that reads a text file line by line and prints each line with a line number prefix, then writes the numbered output to a new file.</p> <p>Q69. Explain <code>fread()</code> and <code>fwrite()</code> for binary file I/O. When should you use binary mode over text mode? Write a program that: (a) writes an array of structures to a binary file, (b) reads it back and prints the data. Explain the parameters of <code>fread()</code> / <code>fwrite()</code> in detail.</p> <p>Q70. Explain random file access in C using <code>fseek()</code>, <code>ftell()</code>, and <code>rewind()</code>. What are the three seek origins: <code>SEEK_SET</code>, <code>SEEK_CUR</code>, <code>SEEK_END</code>? Write a program that updates a specific record in a binary file of student structures without rewriting the entire file.</p> <p>Q71. What is <code>fprintf()</code> and <code>fscanf()</code>? How are they different from <code>printf()</code> and <code>scanf()</code>? Write a program that logs all user inputs with timestamps to a log file using <code>fprintf()</code>, then uses <code>fscanf()</code> to read them back.</p> <p>Q72. Explain error handling in file operations using <code>ferror()</code>, <code>feof()</code>, <code>clearerr()</code>, and <code>perror()</code>. Write a robust file-copy program that handles all possible errors: file not found, insufficient permissions, disk full, etc.</p>","path":["Semester 1","Model Questions: Computer Fundamentals and Programming with C"],"tags":[]},{"location":"semester_1/model_questions/#unit-8-mixed-application-questions","level":2,"title":"Unit 8 — Mixed / Application Questions","text":"<p>Q73. Write a complete C program to implement a student grade management system that:</p> <ul> <li>Stores data for n students (name, roll number, marks in 5 subjects) using structures</li> <li>Calculates the total and percentage for each student</li> <li>Assigns grades (O/A+/A/B+/B/C/F) based on percentage</li> <li>Sorts students by percentage in descending order</li> <li>Writes all results to a file and reads them back</li> </ul> <p>Explain each section of your program.</p> <p>Q74. Explain recursion and iteration as two approaches to solving the Tower of Hanoi problem. Write a recursive C program to solve Tower of Hanoi for n disks. What is the time complexity? How many moves are needed for n=4? Trace the execution for n=3.</p> <p>Q75. Explain what a Fibonacci sequence is. Write C programs to compute the nth Fibonacci number using: (a) simple recursion, (b) iteration, (c) memoization (storing previously computed values in an array). Compare the time complexity of each approach.</p> <p>Q76. What is a sparse matrix? How is it stored efficiently in C? Write a program to: (a) represent a sparse matrix using a 3-column array (row, col, value), (b) add two sparse matrices represented this way, (c) display the result in standard matrix form.</p> <p>Q77. Explain command-line argument processing in C. Write a program <code>mycat</code> that mimics the Unix <code>cat</code> command: it accepts one or more filenames as command-line arguments and prints their contents to stdout. Handle the case where no arguments are given (read from stdin).</p> <p>Q78. Write a C program to implement a simple stack using arrays. Implement push, pop, peek, isEmpty, and isFull operations. Then use this stack to: (a) check whether a given string is a palindrome, (b) check balanced parentheses in an expression.</p> <p>Q79. Describe the concept of multi-file programming in C. Explain header files (<code>.h</code>), source files (<code>.c</code>), and how <code>#include</code> connects them. What is the purpose of include guards (<code>#ifndef FILE_H</code>... <code>#endif</code>)? Show a small example with a <code>math_utils.h</code>, <code>math_utils.c</code>, and <code>main.c</code>.</p> <p>Q80. Explain dynamic memory allocation for a 2D matrix in C using pointer-to-pointer. Write a program that: (a) dynamically allocates an m×n matrix, (b) fills it with random numbers, (c) finds the row with the maximum sum, (d) frees all allocated memory correctly.</p>","path":["Semester 1","Model Questions: Computer Fundamentals and Programming with C"],"tags":[]},{"location":"semester_1/model_questions/#unit-9-previous-year-pattern-questions-cbcs-style-adapted-for-nep","level":2,"title":"Unit 9 — Previous Year Pattern Questions (CBCS-style adapted for NEP)","text":"<p>Q81. What do you mean by structured programming? What are its characteristics? Distinguish between structured and unstructured programming with examples. How did the GOTO statement violate structured programming principles?</p> <p>Q82. Explain the difference between <code>while</code> loop and <code>do-while</code> loop. In what situation will a <code>do-while</code> loop execute at least once even if the condition is false from the beginning? Write both loops to compute the sum of digits of a number.</p> <p>Q83. What is a pointer? Why do we use pointers? Explain with examples: (a) passing arrays to functions using pointers, (b) returning a pointer from a function, (c) why you should never return a pointer to a local variable.</p> <p>Q84. Explain the concept of string in C. Why does C not have a built-in string type? Write a program to: (a) check if a string is a palindrome, (b) count the frequency of each character in a string, (c) remove all duplicate characters from a string.</p> <p>Q85. Explain what <code>static</code> variables inside a function mean. How is a <code>static</code> local variable different from a global variable even though both persist across function calls? Write a program demonstrating static local variables for counting how many times a function is called.</p> <p>Q86. What is the difference between <code>#define</code> and <code>const</code> for defining constants in C? Which is preferred and why? Write a program showing a case where using <code>#define</code> can cause unexpected bugs (hint: no type checking) while <code>const</code> avoids it.</p> <p>Q87. Write a C program to implement matrix multiplication. Check the compatibility of the matrices before multiplication. Explain the algorithm (O(n³) complexity). How would you optimize it for sparse matrices?</p> <p>Q88. Explain the storage of a 2D array in row-major order. For an array <code>int a[3][4]</code>, if the base address is 2000 and each int takes 4 bytes, calculate the address of <code>a[2][3]</code> using the row-major formula. Write a function that accepts a 2D array and prints it in spiral order.</p> <p>Q89. What is the <code>sizeof</code> operator? Is it a function or an operator? Write a program that prints the sizes of all fundamental data types. Explain padding and alignment in structures — why does <code>sizeof(struct)</code> sometimes exceed the sum of sizes of its members?</p> <p>Q90. Explain type conversion in assignments. What happens when you assign a <code>double</code> to an <code>int</code>? When you assign an <code>int</code> to a <code>char</code>? Write a program that demonstrates both implicit narrowing and widening conversions, and show how to use explicit casting to control the result.</p>","path":["Semester 1","Model Questions: Computer Fundamentals and Programming with C"],"tags":[]},{"location":"semester_1/model_questions/#unit-10-long-answer-essay-type-1015-marks-equivalent","level":2,"title":"Unit 10 — Long Answer / Essay Type (10–15 marks equivalent)","text":"<p>Q91. Write a comprehensive note on pointers in C covering: (a) fundamentals and memory model, (b) pointer arithmetic, (c) pointers and arrays, (d) pointers and strings, (e) pointers and functions (call by reference), (f) pointers and structures, (g) dynamic memory allocation using pointers, (h) common pointer bugs (dangling pointer, wild pointer, memory leak). Use code examples throughout.</p> <p>Q92. Describe the C preprocessor in depth. Explain: (a) the sequence of preprocessing steps before compilation, (b) all preprocessor directives, (c) parameterized macros and their limitations compared to inline functions, (d) conditional compilation and its uses in cross-platform code, (e) the <code>#pragma</code> directive. Show a real-world use case (e.g., debug logging that can be switched off).</p> <p>Q93. Write a detailed essay on user-defined data types in C. Cover: (a) <code>enum</code> — use in state machines, (b) <code>struct</code> — use for records, (c) <code>union</code> — use for type-punning and memory overlay, (d) <code>typedef</code> for readability, (e) nested and self-referential structures (linked list node), (f) bit fields. Provide a complete program that uses all of these.</p> <p>Q94. Explain file handling in C comprehensively. Cover: (a) the concept of streams and FILE *, (b) opening/closing files, (c) sequential vs. random access, (d) text vs. binary files, (e) all standard I/O functions for files, (f) error handling. Write a complete mini-database program that maintains a file of employee records and supports: add, search by ID, update salary, delete, and list-all operations.</p> <p>Q95. Write a detailed note on functions in C. Include: (a) why functions are necessary (code reuse, modularity), (b) function prototype, definition, and call, (c) parameter passing mechanisms, (d) return types including void, (e) recursive functions with examples, (f) function pointers and callbacks, (g) command-line arguments, (h) variable-argument functions (<code>printf</code> itself as an example). Provide at least four complete programs.</p> <p>Q96. Explain arrays and strings in C in depth. Cover: (a) 1D array declaration, access, and common algorithms (search, sort, reverse), (b) 2D arrays and matrix operations, (c) the array-pointer equivalence, (d) strings as character arrays, (e) all major string library functions with implementation from scratch, (f) array of strings. Write programs to: (i) sort an array of strings alphabetically, (ii) implement a simple word-frequency counter.</p> <p>Q97. Describe the decision-making and looping constructs of C comprehensively. Compare <code>if</code>, <code>if-else</code>, <code>nested if-else</code>, <code>switch</code>, and ternary operator. Compare <code>while</code>, <code>do-while</code>, <code>for</code>, and nested loops. Explain <code>break</code>, <code>continue</code>, <code>goto</code>, and <code>return</code> as loop-control modifiers. Write programs for: (a) printing all prime numbers from 2 to 1000 using nested loops, (b) a number guessing game using <code>do-while</code>, (c) a simple menu-driven program using <code>switch</code>.</p> <p>Q98. Describe the complete data type system in C including: (a) all primitive types with sizes and ranges, (b) type modifiers, (c) derived types (arrays, pointers, functions), (d) user-defined types (struct, union, enum), (e) type conversion rules (integer promotion, usual arithmetic conversion), (f) overflow and underflow behaviour. Write programs illustrating at least five non-obvious type conversion scenarios.</p> <p>Q99. Write a complete, well-commented C program implementing a simple library management system using: structures (for books: title, author, ISBN, copies), file I/O (to persist data between runs), functions (add book, search by title/author, issue book, return book, display all), dynamic memory (to hold the catalog in memory during runtime). Explain the design decisions made.</p> <p>Q100. Explain the compilation process in C in detail. Describe the four stages: (a) Preprocessing — what changes, (b) Compilation — converting to assembly, (c) Assembly — producing object code, (d) Linking — resolving symbols and producing executable. Explain what happens at each stage to the source code. What are <code>.o</code> files, <code>.a</code> (static library) files, and <code>.so</code> (shared library) files? How does the linker resolve external references?</p>","path":["Semester 1","Model Questions: Computer Fundamentals and Programming with C"],"tags":[]},{"location":"semester_1/model_questions/#unit-11-bonus-questions-practice-set","level":2,"title":"Unit 11 — Bonus Questions (Practice Set)","text":"<p>Q101. Write a C program to implement bubble sort, selection sort, and insertion sort on an array of n integers. After each pass of bubble sort, print the state of the array. Analyse the time and space complexity of each.</p> <p>Q102. Explain dangling pointers and wild pointers in C. What causes each? Write small programs that demonstrate both bugs, and then show the corrected versions. What is a smart pointer, and why doesn't C have one natively (C++ does)?</p> <p>Q103. Write a C program to evaluate a postfix expression (e.g., <code>3 4 + 5 *</code>) using a stack implemented as an array. Explain the algorithm step by step with the example.</p> <p>Q104. Explain recursive descent in C by writing a recursive program that evaluates a mathematical expression given as a string (supporting <code>+</code>, <code>-</code>, <code>*</code>, <code>/</code> and parentheses). What is the limitation of this approach?</p> <p>Q105. Write a C program to implement a singly linked list using structures and dynamic memory. Include: insert at beginning, insert at end, insert at position, delete by value, search, display, and free the entire list. Explain why linked lists are preferable to arrays for frequent insertions/deletions.</p> <p>Q106. Explain macro vs. function debate in C in depth. Write a generic <code>SWAP</code> macro and a typed swap function. Show cases where the macro fails (side effects) and the function is safer. When would you still choose a macro?</p> <p>Q107. Write a C program to read a text file and build a frequency table of all words (case-insensitive). Sort the words alphabetically and print each word with its count. Use dynamic memory, strings, structures, and file I/O.</p> <p>Q108. Explain how <code>printf()</code> works internally as a variadic function. Rewrite a simplified <code>my_printf()</code> function that handles <code>%d</code>, <code>%f</code>, <code>%c</code>, and <code>%s</code> format specifiers using <code><stdarg.h></code>.</p> <p>Q109. Write a C program that uses bit manipulation to: (a) set a particular bit, (b) clear a particular bit, (c) toggle a particular bit, (d) check if a number is a power of 2, (e) count the number of set bits (Brian Kernighan's algorithm), (f) reverse the bits of a 32-bit integer.</p> <p>Q110. Write a complete C program for a text-based tic-tac-toe game for two players. Use a 2D array for the board, functions for: displaying the board, checking win/draw conditions, and taking turns. Explain each function. How would you extend this to play against the computer?</p>","path":["Semester 1","Model Questions: Computer Fundamentals and Programming with C"],"tags":[]},{"location":"semester_1/model_questions/#quick-reference-syllabus-unit-map","level":2,"title":"Quick Reference: Syllabus Unit Map","text":"Unit Topics Questions 1 History, Structure, Algorithms, Tokens, Data Types, Storage Classes Q1–Q12 2 Operators, Expressions, Preprocessor, I/O Q13–Q24 3 if-else, switch, while, do-while, for, break, continue, goto Q25–Q34 4 Functions, Arrays, Strings, Recursion Q35–Q45 5 Pointers, Pointer Arithmetic, Dynamic Allocation Q46–Q54 6 enum, struct, union, typedef, Memory Q55–Q64 7 File I/O, fopen/fclose, fread/fwrite, fseek Q65–Q72 8 Application / Integrated Programs Q73–Q80 9 Previous Year Pattern Q81–Q90 10 Long Answer / Essay Q91–Q100 11 Bonus / Advanced Practice Q101–Q110 <p>Exam Strategy</p> <ul> <li>5-mark questions: Answer Q1–Q80 type (pick any sub-part)</li> <li>10-mark questions: Answer Q91–Q100 type (write full essay with programs)</li> <li>Lab Viva: Know programs from Q41, Q43, Q44, Q51, Q63, Q69 thoroughly</li> <li>Always write programs with proper <code>#include</code>, <code>main()</code>, and sample output</li> </ul> <p>Key Programs to Memorise</p> <p>Fibonacci (iterative + recursive) · Factorial · GCD · Prime check · Palindrome · Matrix multiplication · Bubble sort · Dynamic array · File copy · Linked list node (struct + malloc)</p>","path":["Semester 1","Model Questions: Computer Fundamentals and Programming with C"],"tags":[]},{"location":"semester_1/R/","level":1,"title":"R","text":"<p>Files and sub-folders in R.</p>","path":["Semester 1","R"],"tags":[]},{"location":"semester_1/R/#folders","level":2,"title":"Folders","text":"# Folder Link 1 Code Open","path":["Semester 1","R"],"tags":[]},{"location":"semester_1/R/#files","level":2,"title":"Files","text":"# File Link 1 <code>temp.r</code> View Code","path":["Semester 1","R"],"tags":[]},{"location":"semester_1/R/temp/","level":1,"title":"<code>temp.r</code>","text":"","path":["Semester 1","R","temp.r"],"tags":[]},{"location":"semester_1/R/temp/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","temp.r"],"tags":[]},{"location":"semester_1/R/temp/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","temp.r"],"tags":[]},{"location":"semester_1/R/Code/","level":1,"title":"Code","text":"<p>Files and sub-folders in Code.</p>","path":["Semester 1","R","Code"],"tags":[]},{"location":"semester_1/R/Code/#files","level":2,"title":"Files","text":"# File Link 1 <code>R_Code-1.r</code> View Code 2 <code>R_Code-10.r</code> View Code 3 <code>R_Code-11.r</code> View Code 4 <code>R_Code-12.r</code> View Code 5 <code>R_Code-13.r</code> View Code 6 <code>R_Code-14.r</code> View Code 7 <code>R_Code-15.r</code> View Code 8 <code>R_Code-2.r</code> View Code 9 <code>R_Code-4.r</code> View Code 10 <code>R_Code-5.r</code> View Code 11 <code>R_Code-6.r</code> View Code 12 <code>R_Code-7.r</code> View Code 13 <code>R_Code-8.r</code> View Code 14 <code>R_Code-9.r</code> View Code 15 <code>R_Prac-1.r</code> View Code 16 <code>R_Prac-2.r</code> View Code 17 <code>R_Prac-3.r</code> View Code 18 <code>R_Prac-4.r</code> View Code 19 <code>R_Prac-5.r</code> View Code 20 <code>R_Prac-6.r</code> View Code 21 <code>R_code-3.r</code> View Code","path":["Semester 1","R","Code"],"tags":[]},{"location":"semester_1/R/Code/R_Code-1/","level":1,"title":"<code>R_Code-1.r</code>","text":"<p>Problem Statement</p> <p>R allows you to assign values to variables in three different ways.</p>","path":["Semester 1","R","Code","R_Code-1.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-1/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) Date 19 Mar 2026 License MIT","path":["Semester 1","R","Code","R_Code-1.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-1/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_Code-1.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-1/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_Code-1.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-10/","level":1,"title":"<code>R_Code-10.r</code>","text":"<p>Problem Statement</p> <p>Create a numeric vector of student exam scores. Write a single line of code that evaluates these scores and outputs \"Pass\" for any score 50 or above, and \"Fail\" for any score below 50.</p>","path":["Semester 1","R","Code","R_Code-10.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-10/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) Date 20 Mar 2026 License MIT","path":["Semester 1","R","Code","R_Code-10.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-10/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_Code-10.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-10/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_Code-10.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-11/","level":1,"title":"<code>R_Code-11.r</code>","text":"<p>Problem Statement</p> <p>Write a while loop that starts with a multiplier of 1. The loop should multiply the current multiplier by 4, assign it to a result variable, and print the result. The loop should exit if the result exceeds 100; otherwise, increment the multiplier by 1.</p>","path":["Semester 1","R","Code","R_Code-11.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-11/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) Date 20 Mar 2026 License MIT","path":["Semester 1","R","Code","R_Code-11.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-11/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_Code-11.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-11/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_Code-11.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-12/","level":1,"title":"<code>R_Code-12.r</code>","text":"<p>Problem Statement</p> <p>Write a custom function named calculate_area that takes two parameters: length and width. The width parameter should have a default value of 5. The function should print the product of the two parameters. Finally, call your function passing only the value 12 for the length.</p>","path":["Semester 1","R","Code","R_Code-12.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-12/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) Date 20 Mar 2026 License MIT","path":["Semester 1","R","Code","R_Code-12.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-12/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_Code-12.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-12/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_Code-12.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-13/","level":1,"title":"<code>R_Code-13.r</code>","text":"<p>Problem Statement</p> <p>Create a list named student_record containing a string, an integer, and a numeric vector of two grades. Then, add the logical value TRUE to the end of the list, ensuring the original student_record variable is updated. Print the final list.</p>","path":["Semester 1","R","Code","R_Code-13.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-13/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) Date 20 Mar 2026 License MIT","path":["Semester 1","R","Code","R_Code-13.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-13/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_Code-13.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-13/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_Code-13.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-14/","level":1,"title":"<code>R_Code-14.r</code>","text":"<p>Problem Statement</p> <p>Write an if...else if...else block that evaluates a newly created temperature variable. * If the temperature is strictly greater than 30, print: \"30+ is too hot!\" * If the temperature is between 20 and 30 (inclusive), print: \"Perfect weather.\" * Otherwise, print: \"It is quite cold.\"</p>","path":["Semester 1","R","Code","R_Code-14.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-14/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) Date 20 Mar 2026 License MIT","path":["Semester 1","R","Code","R_Code-14.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-14/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_Code-14.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-14/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_Code-14.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-15/","level":1,"title":"<code>R_Code-15.r</code>","text":"","path":["Semester 1","R","Code","R_Code-15.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-15/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_Code-15.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-15/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_Code-15.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-2/","level":1,"title":"<code>R_Code-2.r</code>","text":"<p>Problem Statement</p> <p>How do you declare an explicitly integer variable (e.g., the number 14) so that its class returns \"integer\" instead of the default floating-point \"numeric\"?</p>","path":["Semester 1","R","Code","R_Code-2.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-2/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) Date 19 Mar 2026 License MIT","path":["Semester 1","R","Code","R_Code-2.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-2/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_Code-2.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-2/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_Code-2.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-4/","level":1,"title":"<code>R_Code-4.r</code>","text":"<p>Problem Statement</p> <p>Write a standard if...else block that checks if a variable named age is greater than 18. If the condition is true, print \"You are eligible to vote.\", otherwise print \"You cannot vote.\".</p>","path":["Semester 1","R","Code","R_Code-4.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-4/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) Date 19 Mar 2026 License MIT","path":["Semester 1","R","Code","R_Code-4.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-4/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_Code-4.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-4/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_Code-4.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-5/","level":1,"title":"<code>R_Code-5.r</code>","text":"<p>Problem Statement</p> <p>You have a vector of numbers: x <- c(12, 9, 23, 14). Use R's shorthand ifelse() function to output \"EVEN\" if a number in the vector is divisible by 2 (x %% 2 == 0), and \"ODD\" if it is not.</p>","path":["Semester 1","R","Code","R_Code-5.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-5/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) Date 19 Mar 2026 License MIT","path":["Semester 1","R","Code","R_Code-5.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-5/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_Code-5.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-5/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_Code-5.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-6/","level":1,"title":"<code>R_Code-6.r</code>","text":"<p>Problem Statement</p> <p>Write a while loop with a number variable starting at 1. The loop should print the number and increment it by 1, but you must include an if statement with a break command to stop the loop's execution exactly when number == 6</p>","path":["Semester 1","R","Code","R_Code-6.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-6/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) Date 19 Mar 2026 License MIT","path":["Semester 1","R","Code","R_Code-6.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-6/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_Code-6.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-6/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_Code-6.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-7/","level":1,"title":"<code>R_Code-7.r</code>","text":"<p>Problem Statement</p> <p>Create a numerical vector containing the sequence of numbers from 1 to 5 using the : operator. Then, use the rep() function with the times argument to repeat that entire sequence exactly 2 times.</p>","path":["Semester 1","R","Code","R_Code-7.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-7/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) Date 19 Mar 2026 License MIT","path":["Semester 1","R","Code","R_Code-7.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-7/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_Code-7.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-7/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_Code-7.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-8/","level":1,"title":"<code>R_Code-8.r</code>","text":"<p>Problem Statement</p> <p>Create a list named list1 containing the number 24, the string \"Sabby\", the float 5.4, and the string \"Nepal\". Then, write the code using the append() function to add the number 3.14 to the very end of this list.</p>","path":["Semester 1","R","Code","R_Code-8.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-8/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) Date 19 Mar 2026 License MIT","path":["Semester 1","R","Code","R_Code-8.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-8/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_Code-8.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-8/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_Code-8.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-9/","level":1,"title":"<code>R_Code-9.r</code>","text":"<p>Problem Statement</p> <p>Define a function called power that takes two parameters, a and b. Give a a default value of 2. The function should print the result of a raised to the power of b (a^b).</p>","path":["Semester 1","R","Code","R_Code-9.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-9/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) Date 19 Mar 2026 License MIT","path":["Semester 1","R","Code","R_Code-9.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-9/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_Code-9.r"],"tags":[]},{"location":"semester_1/R/Code/R_Code-9/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_Code-9.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-1/","level":1,"title":"<code>R_Prac-1.r</code>","text":"<p>Problem Statement</p> <p>Write a R program to print numbers from 1 to 5.</p>","path":["Semester 1","R","Code","R_Prac-1.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-1/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) Date 25 Mar 2026 License MIT","path":["Semester 1","R","Code","R_Prac-1.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-1/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_Prac-1.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-1/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_Prac-1.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-2/","level":1,"title":"<code>R_Prac-2.r</code>","text":"<p>Problem Statement</p> <p>Check whether a number is even or odd.</p>","path":["Semester 1","R","Code","R_Prac-2.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-2/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) Date 25 Mar 2026 License MIT","path":["Semester 1","R","Code","R_Prac-2.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-2/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_Prac-2.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-2/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_Prac-2.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-3/","level":1,"title":"<code>R_Prac-3.r</code>","text":"<p>Problem Statement</p> <p>Print elements of vector using for loop.</p>","path":["Semester 1","R","Code","R_Prac-3.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-3/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) Date 25 Mar 2026 License MIT","path":["Semester 1","R","Code","R_Prac-3.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-3/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_Prac-3.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-3/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_Prac-3.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-4/","level":1,"title":"<code>R_Prac-4.r</code>","text":"<p>Problem Statement</p> <p>Program to add two numbers in R program.</p>","path":["Semester 1","R","Code","R_Prac-4.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-4/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) Date 25 Mar 2026 License MIT","path":["Semester 1","R","Code","R_Prac-4.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-4/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_Prac-4.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-4/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_Prac-4.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-5/","level":1,"title":"<code>R_Prac-5.r</code>","text":"<p>Problem Statement</p> <p>Program to count the number of even numbers stored inside a vector of numbers.</p>","path":["Semester 1","R","Code","R_Prac-5.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-5/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) Date 25 Mar 2026 License MIT","path":["Semester 1","R","Code","R_Prac-5.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-5/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_Prac-5.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-5/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_Prac-5.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-6/","level":1,"title":"<code>R_Prac-6.r</code>","text":"<p>Problem Statement</p> <p>Program to access List elements, modify a List Element, add items to List, Remove items from a List, length of List.</p>","path":["Semester 1","R","Code","R_Prac-6.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-6/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) Date 25 Mar 2026 License MIT","path":["Semester 1","R","Code","R_Prac-6.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-6/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_Prac-6.r"],"tags":[]},{"location":"semester_1/R/Code/R_Prac-6/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_Prac-6.r"],"tags":[]},{"location":"semester_1/R/Code/R_code-3/","level":1,"title":"<code>R_code-3.r</code>","text":"<p>Problem Statement</p> <p>Assume you have a variable company <- \"Programiz\". Write a line of code using the paste0() function to print \"Welcome toProgramiz\" ensuring there is no default space between the string and the variable.</p>","path":["Semester 1","R","Code","R_code-3.r"],"tags":[]},{"location":"semester_1/R/Code/R_code-3/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) Date 19 Mar 2026 License MIT","path":["Semester 1","R","Code","R_code-3.r"],"tags":[]},{"location":"semester_1/R/Code/R_code-3/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","R","Code","R_code-3.r"],"tags":[]},{"location":"semester_1/R/Code/R_code-3/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","R","Code","R_code-3.r"],"tags":[]},{"location":"semester_1/assignment-primary/","level":1,"title":"Assignment Primary","text":"<p>Files and sub-folders in Assignment Primary.</p>","path":["Semester 1","Assignment primary","Assignment Primary"],"tags":[]},{"location":"semester_1/assignment-primary/#files","level":2,"title":"Files","text":"# File Link 1 <code>assignment-p-01.c</code> View Code 2 <code>assignment-p-02.c</code> View Code 3 <code>assignment-p-03.c</code> View Code 4 <code>assignment-p-04.c</code> View Code 5 <code>assignment-p-05.c</code> View Code 6 <code>assignment-p-06.c</code> View Code 7 <code>assignment-p-07.c</code> View Code 8 <code>assignment-p-08.c</code> View Code 9 <code>assignment-p-09.c</code> View Code 10 <code>assignment-p-10.c</code> View Code 11 <code>assignment-p-11.c</code> View Code 12 <code>assignment-p-12_v1.c</code> View Code 13 <code>assignment-p-12_v2.c</code> View Code 14 <code>assignment-p-13.c</code> View Code 15 <code>assignment-p-14_v1.c</code> View Code 16 <code>assignment-p-14_v2.c</code> View Code 17 <code>assignment-p-15.c</code> View Code","path":["Semester 1","Assignment primary","Assignment Primary"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-01/","level":1,"title":"<code>assignment-p-01.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that includes a user-defined function named isPrime with the signature int isPrime(int num); The function should take an integer as a parameter and return 1 if the number is prime and 0 otherwise.</p>","path":["Semester 1","Assignment primary","assignment-p-01.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-01/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment primary","assignment-p-01.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-01/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment primary","assignment-p-01.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-01/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment primary","assignment-p-01.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-02/","level":1,"title":"<code>assignment-p-02.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that includes a user-defined function named isArmstrong with the signature int isArmstrong(int num);. An Armstrong number is a number that is equal to the sum of its own digits each raised to the power of the number of digits. For example, 153 is an Armstrong number because 1^3 + 5^3 + 3^3 = 153</p>","path":["Semester 1","Assignment primary","assignment-p-02.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-02/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment primary","assignment-p-02.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-02/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment primary","assignment-p-02.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-02/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment primary","assignment-p-02.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-03/","level":1,"title":"<code>assignment-p-03.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that includes a user-defined function named isPerfect with the signature int isPerfect(int num);. A perfect number is a positive integer that is equal to the sum of its proper divisors, excluding itself. For example, 28 is a perfect number because the sum of its divisors (1, 2, 4, 7, 14) equals 28.</p>","path":["Semester 1","Assignment primary","assignment-p-03.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-03/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Assignment primary","assignment-p-03.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-03/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment primary","assignment-p-03.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-03/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment primary","assignment-p-03.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-04/","level":1,"title":"<code>assignment-p-04.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that takes an integer input representing a month (1 to 12) and a year. Use a switch statement to display the number of days in that month, considering leap years.</p>","path":["Semester 1","Assignment primary","assignment-p-04.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-04/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment primary","assignment-p-04.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-04/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment primary","assignment-p-04.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-04/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment primary","assignment-p-04.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-05/","level":1,"title":"<code>assignment-p-05.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that defines an array of integers, and includes a user-defined function named reverseArray with the signature void reverseArray(int arr[], int size);. The function should reverse the elements of the array.</p>","path":["Semester 1","Assignment primary","assignment-p-05.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-05/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment primary","assignment-p-05.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-05/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment primary","assignment-p-05.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-05/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment primary","assignment-p-05.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-06/","level":1,"title":"<code>assignment-p-06.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that includes a user-defined function named findLargest with the signature int findLargest(int arr[], int size);. The function should take an array of integers and its size, and return the largest element in the array.</p>","path":["Semester 1","Assignment primary","assignment-p-06.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-06/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment primary","assignment-p-06.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-06/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment primary","assignment-p-06.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-06/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment primary","assignment-p-06.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-07/","level":1,"title":"<code>assignment-p-07.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that includes a user-defined function named binarySearch with the signature int binarySearch(int arr[], int size, int target);. The function should perform a binary search on a sorted array of integers and return the index of the target element if found, and -1 otherwise.</p>","path":["Semester 1","Assignment primary","assignment-p-07.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-07/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment primary","assignment-p-07.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-07/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment primary","assignment-p-07.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-07/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment primary","assignment-p-07.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-08/","level":1,"title":"<code>assignment-p-08.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that includes a user-defined function named countSetBits with the signature int countSetBits(int num);. The function should count and return the number of set bits (1s) in the binary representation of the given number.</p>","path":["Semester 1","Assignment primary","assignment-p-08.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-08/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Assignment primary","assignment-p-08.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-08/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment primary","assignment-p-08.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-08/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment primary","assignment-p-08.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-09/","level":1,"title":"<code>assignment-p-09.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that includes a user-defined function named setBit with the signature int setBit(int num, int position);. The function should set the bit at the specified position (0-indexed) to 1 and return the modified number.</p>","path":["Semester 1","Assignment primary","assignment-p-09.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-09/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Assignment primary","assignment-p-09.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-09/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment primary","assignment-p-09.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-09/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment primary","assignment-p-09.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-10/","level":1,"title":"<code>assignment-p-10.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that defines a structure Rectangle with attributes length and width. Include a user-defined function named calculateArea with the signature float calculateArea(struct Rectangle r);. The function should calculate and return the area of the rectangle.</p>","path":["Semester 1","Assignment primary","assignment-p-10.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-10/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Assignment primary","assignment-p-10.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-10/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment primary","assignment-p-10.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-10/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment primary","assignment-p-10.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-11/","level":1,"title":"<code>assignment-p-11.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that defines a structure Student containing the attributes rollNumber, name, and marks. Include a user-defined function named displayStudent with the signature void displayStudent(struct Student s);. The function should display the details of a student.</p>","path":["Semester 1","Assignment primary","assignment-p-11.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-11/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment primary","assignment-p-11.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-11/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment primary","assignment-p-11.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-11/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment primary","assignment-p-11.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-12_v1/","level":1,"title":"<code>assignment-p-12_v1.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that takes multiple integers as command-line arguments and finds the maximum and minimum value among them.</p>","path":["Semester 1","Assignment primary","assignment-p-12_v1.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-12_v1/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment primary","assignment-p-12_v1.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-12_v1/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment primary","assignment-p-12_v1.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-12_v1/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment primary","assignment-p-12_v1.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-12_v2/","level":1,"title":"<code>assignment-p-12_v2.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that takes multiple integers as command-line arguments and finds the maximum and minimum value among them.</p>","path":["Semester 1","Assignment primary","assignment-p-12_v2.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-12_v2/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 06 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment primary","assignment-p-12_v2.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-12_v2/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment primary","assignment-p-12_v2.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-12_v2/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment primary","assignment-p-12_v2.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-13/","level":1,"title":"<code>assignment-p-13.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that accepts a string as a command line argument and includes a user- defined function named isPalindrome with the signature int isPalindrome(char str[]);. The function should check if the given string is a palindrome and return 1 if it is, and 0 otherwise.</p>","path":["Semester 1","Assignment primary","assignment-p-13.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-13/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment primary","assignment-p-13.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-13/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment primary","assignment-p-13.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-13/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment primary","assignment-p-13.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-14_v1/","level":1,"title":"<code>assignment-p-14_v1.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that opens its own source code file, reads its contents, and then prints the contents to the console.</p>","path":["Semester 1","Assignment primary","assignment-p-14_v1.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-14_v1/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment primary","assignment-p-14_v1.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-14_v1/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment primary","assignment-p-14_v1.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-14_v1/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment primary","assignment-p-14_v1.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-14_v2/","level":1,"title":"<code>assignment-p-14_v2.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that opens its own source code file, reads its contents, and then prints the contents to the console.</p>","path":["Semester 1","Assignment primary","assignment-p-14_v2.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-14_v2/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment primary","assignment-p-14_v2.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-14_v2/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment primary","assignment-p-14_v2.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-14_v2/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment primary","assignment-p-14_v2.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-15/","level":1,"title":"<code>assignment-p-15.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that reads a sequence of integers from a file named 'input.txt'. This program should segregate the odd numbers from the even numbers and store the odd numbers in a new file named 'ODDFile.txt' while storing the even numbers in another file named 'EVENFile.txt'</p>","path":["Semester 1","Assignment primary","assignment-p-15.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-15/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment primary","assignment-p-15.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-15/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment primary","assignment-p-15.c"],"tags":[]},{"location":"semester_1/assignment-primary/assignment-p-15/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment primary","assignment-p-15.c"],"tags":[]},{"location":"semester_1/assignment-secondary/","level":1,"title":"Assignment Secondary","text":"<p>Files and sub-folders in Assignment Secondary.</p>","path":["Semester 1","Assignment secondary","Assignment Secondary"],"tags":[]},{"location":"semester_1/assignment-secondary/#files","level":2,"title":"Files","text":"# File Link 1 <code>assignment-s-01.c</code> View Code 2 <code>assignment-s-02.c</code> View Code 3 <code>assignment-s-03.c</code> View Code 4 <code>assignment-s-04.c</code> View Code 5 <code>assignment-s-05.c</code> View Code 6 <code>assignment-s-06.c</code> View Code 7 <code>assignment-s-07.c</code> View Code 8 <code>assignment-s-08.c</code> View Code 9 <code>assignment-s-09.c</code> View Code 10 <code>assignment-s-10.c</code> View Code 11 <code>assignment-s-11.c</code> View Code 12 <code>assignment-s-12.c</code> View Code 13 <code>assignment-s-13-1.c</code> View Code 14 <code>assignment-s-13-2.c</code> View Code 15 <code>assignment-s-14.c</code> View Code 16 <code>assignment-s-15.c</code> View Code 17 <code>assignment-s-16.c</code> View Code 18 <code>assignment-s-17.c</code> View Code 19 <code>assignment-s-18.c</code> View Code 20 <code>assignment-s-19.c</code> View Code 21 <code>assignment-s-20.c</code> View Code 22 <code>assignment-s-21.c</code> View Code 23 <code>assignment-s-22.c</code> View Code 24 <code>assignment-s-23.c</code> View Code 25 <code>assignment-s-24.c</code> View Code","path":["Semester 1","Assignment secondary","Assignment Secondary"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-01/","level":1,"title":"<code>assignment-s-01.c</code>","text":"<p>Problem Statement</p> <p>Write a program to compute the sum and product of digits of an integer using user defined functions.</p>","path":["Semester 1","Assignment secondary","assignment-s-01.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-01/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Assignment secondary","assignment-s-01.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-01/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-01.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-01/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-01.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-02/","level":1,"title":"<code>assignment-s-02.c</code>","text":"<p>Problem Statement</p> <p>Write a program to reverse a non-negative integer using a function.</p>","path":["Semester 1","Assignment secondary","assignment-s-02.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-02/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Assignment secondary","assignment-s-02.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-02/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-02.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-02/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-02.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-03/","level":1,"title":"<code>assignment-s-03.c</code>","text":"<p>Problem Statement</p> <p>Write a program to compute the sum of the first n terms of the series using a function: S=1−2+3−4+5−6+…</p>","path":["Semester 1","Assignment secondary","assignment-s-03.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-03/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Assignment secondary","assignment-s-03.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-03/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-03.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-03/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-03.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-04/","level":1,"title":"<code>assignment-s-04.c</code>","text":"<p>Problem Statement</p> <p>Write a function to check whether a number is prime or not. Use the same function to generate all prime numbers less than 100.</p>","path":["Semester 1","Assignment secondary","assignment-s-04.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-04/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment secondary","assignment-s-04.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-04/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-04.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-04/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-04.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-05/","level":1,"title":"<code>assignment-s-05.c</code>","text":"<p>Problem Statement</p> <p>Write a function to check whether a given string is a palindrome. Use this function to determine whether an entered string is Palindrome.</p>","path":["Semester 1","Assignment secondary","assignment-s-05.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-05/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment secondary","assignment-s-05.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-05/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-05.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-05/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-05.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-06/","level":1,"title":"<code>assignment-s-06.c</code>","text":"<p>Problem Statement</p> <p>Write a program using a function to compute and display all factors of a given number.</p>","path":["Semester 1","Assignment secondary","assignment-s-06.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-06/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Assignment secondary","assignment-s-06.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-06/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-06.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-06/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-06.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-07/","level":1,"title":"<code>assignment-s-07.c</code>","text":"<p>Problem Statement</p> <p>Write a program to swap two numbers using a macro (#define).</p>","path":["Semester 1","Assignment secondary","assignment-s-07.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-07/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Assignment secondary","assignment-s-07.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-07/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-07.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-07/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-07.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-08/","level":1,"title":"<code>assignment-s-08.c</code>","text":"<p>Problem Statement</p> <p>Write a program that counts the number of occurrences of each alphabet (A-Z, a-z) in the text entered using Command-Line Arguments.</p>","path":["Semester 1","Assignment secondary","assignment-s-08.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-08/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Assignment secondary","assignment-s-08.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-08/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-08.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-08/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-08.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-09/","level":1,"title":"<code>assignment-s-09.c</code>","text":"<p>Problem Statement</p> <p>Write a program to swap two numbers using pointers (user-defined function).</p>","path":["Semester 1","Assignment secondary","assignment-s-09.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-09/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Assignment secondary","assignment-s-09.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-09/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-09.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-09/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-09.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-10/","level":1,"title":"<code>assignment-s-10.c</code>","text":"<p>Problem Statement</p> <p>Write a program to swap two numbers using pointers (user-defined function).</p>","path":["Semester 1","Assignment secondary","assignment-s-10.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-10/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Assignment secondary","assignment-s-10.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-10/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-10.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-10/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-10.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-11/","level":1,"title":"<code>assignment-s-11.c</code>","text":"<p>Problem Statement</p> <p>Write a program that takes the radius of a circle as input, passes it to a function that computes area and circumference, and displays results in main().</p>","path":["Semester 1","Assignment secondary","assignment-s-11.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-11/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Assignment secondary","assignment-s-11.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-11/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-11.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-11/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-11.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-12/","level":1,"title":"<code>assignment-s-12.c</code>","text":"<p>Problem Statement</p> <p>Write a program to find the sum of n elements entered by the user. Use dynamic memory allocation (malloc() or calloc()).</p>","path":["Semester 1","Assignment secondary","assignment-s-12.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-12/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Assignment secondary","assignment-s-12.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-12/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-12.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-12/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-12.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-13-1/","level":1,"title":"<code>assignment-s-13-1.c</code>","text":"<p>Problem Statement</p> <p>Write a function that reverses the elements of an array in place, using only a single pointer argument, and return void.</p>","path":["Semester 1","Assignment secondary","assignment-s-13-1.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-13-1/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 19 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment secondary","assignment-s-13-1.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-13-1/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-13-1.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-13-1/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-13-1.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-13-2/","level":1,"title":"<code>assignment-s-13-2.c</code>","text":"<p>Problem Statement</p> <p>Write a function that reverses the elements of an array in place, using only a single pointer argument, and return void.</p>","path":["Semester 1","Assignment secondary","assignment-s-13-2.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-13-2/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 19 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment secondary","assignment-s-13-2.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-13-2/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-13-2.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-13-2/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-13-2.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-14/","level":1,"title":"<code>assignment-s-14.c</code>","text":"<p>Problem Statement</p> <p>Write a menu-driven program to perform the following string operations: a. Show address of each character b. Concatenate two strings without using strcat() c. Concatenate two strings using strcat() d. Compare two strings e. Find string length using pointers f. Convert lowercase to uppercase g. Convert uppercase to lowercase h. Count number of vowels i. Reverse the string</p>","path":["Semester 1","Assignment secondary","assignment-s-14.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-14/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 20 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment secondary","assignment-s-14.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-14/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-14.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-14/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-14.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-15/","level":1,"title":"<code>assignment-s-15.c</code>","text":"<p>Problem Statement</p> <p>Write a program to merge two sorted integer arrays to form a single sorted array.</p>","path":["Semester 1","Assignment secondary","assignment-s-15.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-15/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 21 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment secondary","assignment-s-15.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-15/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-15.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-15/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-15.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-16/","level":1,"title":"<code>assignment-s-16.c</code>","text":"<p>Problem Statement</p> <p>Write a program that reads 10 integers into an array (using pointers), and prints the array in ascending and descending order.</p>","path":["Semester 1","Assignment secondary","assignment-s-16.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-16/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 21 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment secondary","assignment-s-16.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-16/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-16.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-16/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-16.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-17/","level":1,"title":"<code>assignment-s-17.c</code>","text":"<p>Problem Statement</p> <p>Write a program to display the Fibonacci series (i) using recursion (ii) using iteration</p>","path":["Semester 1","Assignment secondary","assignment-s-17.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-17/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 21 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment secondary","assignment-s-17.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-17/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-17.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-17/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-17.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-18/","level":1,"title":"<code>assignment-s-18.c</code>","text":"<p>Problem Statement</p> <p>Write a program to calculate the factorial of a number (i) using recursion (ii) using iteration</p>","path":["Semester 1","Assignment secondary","assignment-s-18.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-18/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 22 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment secondary","assignment-s-18.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-18/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-18.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-18/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-18.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-19/","level":1,"title":"<code>assignment-s-19.c</code>","text":"<p>Problem Statement</p> <p>Write a program to calculate the GCD of two numbers (i) using recursion (ii) without recursion</p>","path":["Semester 1","Assignment secondary","assignment-s-19.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-19/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 22 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment secondary","assignment-s-19.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-19/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-19.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-19/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-19.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-20/","level":1,"title":"<code>assignment-s-20.c</code>","text":"<p>Problem Statement</p> <p>Write a menu-driven program to perform the following matrix operations using 2-D arrays and functions: a. Sum b. Difference c. Product d. Transpose</p>","path":["Semester 1","Assignment secondary","assignment-s-20.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-20/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 22 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment secondary","assignment-s-20.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-20/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-20.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-20/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-20.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-21/","level":1,"title":"<code>assignment-s-21.c</code>","text":"<p>Problem Statement</p> <p>Write a program to copy the contents of a text file to another file, after removing all white spaces (spaces, tabs, newlines).</p>","path":["Semester 1","Assignment secondary","assignment-s-21.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-21/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 21 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Assignment secondary","assignment-s-21.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-21/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-21.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-21/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-21.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-22/","level":1,"title":"<code>assignment-s-22.c</code>","text":"<p>Problem Statement</p> <p>Write a program using structures to add two distances in meter-kilometer format.</p>","path":["Semester 1","Assignment secondary","assignment-s-22.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-22/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Assignment secondary","assignment-s-22.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-22/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-22.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-22/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-22.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-23/","level":1,"title":"<code>assignment-s-23.c</code>","text":"<p>Problem Statement</p> <p>Write a program to add two complex numbers using structures.</p>","path":["Semester 1","Assignment secondary","assignment-s-23.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-23/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Assignment secondary","assignment-s-23.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-23/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-23.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-23/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-23.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-24/","level":1,"title":"<code>assignment-s-24.c</code>","text":"<p>Problem Statement</p> <p>Write a program to calculate the difference between two time periods using structures.</p>","path":["Semester 1","Assignment secondary","assignment-s-24.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-24/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Assignment secondary","assignment-s-24.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-24/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Assignment secondary","assignment-s-24.c"],"tags":[]},{"location":"semester_1/assignment-secondary/assignment-s-24/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Assignment secondary","assignment-s-24.c"],"tags":[]},{"location":"semester_1/eduincs_exam/","level":1,"title":"Eduincs Exam","text":"<p>Files and sub-folders in Eduincs Exam.</p>","path":["Semester 1","Eduincs exam","Eduincs Exam"],"tags":[]},{"location":"semester_1/eduincs_exam/#folders","level":2,"title":"Folders","text":"# Folder Link 1 Paper 1 05 03 2026 Open 2 Paper 2 05 03 2026 Open","path":["Semester 1","Eduincs exam","Eduincs Exam"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-1_05-03-2026/","level":1,"title":"Paper 1 05 03 2026","text":"<p>Files and sub-folders in Paper 1 05 03 2026.</p>","path":["Semester 1","Eduincs exam","Paper 1 05 03 2026"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-1_05-03-2026/#files","level":2,"title":"Files","text":"# File Link 1 <code>Qn-10.c</code> View Code 2 <code>Qn-8.c</code> View Code 3 <code>Qn-9.c</code> View Code","path":["Semester 1","Eduincs exam","Paper 1 05 03 2026"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-1_05-03-2026/Qn-10/","level":1,"title":"<code>Qn-10.c</code>","text":"<p>Problem Statement</p> <p>Write a C program to find the maximum element in each row of a 2D array and print the result.</p>","path":["Semester 1","Eduincs exam","Paper 1 05 03 2026","Qn-10.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-1_05-03-2026/Qn-10/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 06 Mar 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Eduincs exam","Paper 1 05 03 2026","Qn-10.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-1_05-03-2026/Qn-10/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Eduincs exam","Paper 1 05 03 2026","Qn-10.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-1_05-03-2026/Qn-10/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Eduincs exam","Paper 1 05 03 2026","Qn-10.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-1_05-03-2026/Qn-8/","level":1,"title":"<code>Qn-8.c</code>","text":"<p>Problem Statement</p> <p>Write a C program to find the transpose of a given square matrix using 2D array. The transpose of a matrix is obtained by swapping the rows and columns of the matrix</p>","path":["Semester 1","Eduincs exam","Paper 1 05 03 2026","Qn-8.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-1_05-03-2026/Qn-8/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 06 Mar 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Eduincs exam","Paper 1 05 03 2026","Qn-8.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-1_05-03-2026/Qn-8/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Eduincs exam","Paper 1 05 03 2026","Qn-8.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-1_05-03-2026/Qn-8/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Eduincs exam","Paper 1 05 03 2026","Qn-8.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-1_05-03-2026/Qn-9/","level":1,"title":"<code>Qn-9.c</code>","text":"<p>Problem Statement</p> <p>Write a C program to find sum of all elements in a given 2D array.</p>","path":["Semester 1","Eduincs exam","Paper 1 05 03 2026","Qn-9.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-1_05-03-2026/Qn-9/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 06 Mar 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Eduincs exam","Paper 1 05 03 2026","Qn-9.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-1_05-03-2026/Qn-9/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Eduincs exam","Paper 1 05 03 2026","Qn-9.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-1_05-03-2026/Qn-9/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Eduincs exam","Paper 1 05 03 2026","Qn-9.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-2_05-03-2026/","level":1,"title":"Paper 2 05 03 2026","text":"<p>Files and sub-folders in Paper 2 05 03 2026.</p>","path":["Semester 1","Eduincs exam","Paper 2 05 03 2026"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-2_05-03-2026/#files","level":2,"title":"Files","text":"# File Link 1 <code>Qn-11.c</code> View Code 2 <code>Qn-3.c</code> View Code 3 <code>Qn-4.c</code> View Code","path":["Semester 1","Eduincs exam","Paper 2 05 03 2026"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-2_05-03-2026/Qn-11/","level":1,"title":"<code>Qn-11.c</code>","text":"<p>Problem Statement</p> <p>Write a program to explain, how an array of stucture can you defined and accessed.</p>","path":["Semester 1","Eduincs exam","Paper 2 05 03 2026","Qn-11.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-2_05-03-2026/Qn-11/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 06 Mar 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Eduincs exam","Paper 2 05 03 2026","Qn-11.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-2_05-03-2026/Qn-11/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Eduincs exam","Paper 2 05 03 2026","Qn-11.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-2_05-03-2026/Qn-11/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Eduincs exam","Paper 2 05 03 2026","Qn-11.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-2_05-03-2026/Qn-3/","level":1,"title":"<code>Qn-3.c</code>","text":"<p>Problem Statement</p> <p>Write a program to search an element from an array using linear search technique using malloc() and free() for memory allocation and deallocation.</p>","path":["Semester 1","Eduincs exam","Paper 2 05 03 2026","Qn-3.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-2_05-03-2026/Qn-3/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 06 Mar 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Eduincs exam","Paper 2 05 03 2026","Qn-3.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-2_05-03-2026/Qn-3/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Eduincs exam","Paper 2 05 03 2026","Qn-3.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-2_05-03-2026/Qn-3/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Eduincs exam","Paper 2 05 03 2026","Qn-3.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-2_05-03-2026/Qn-4/","level":1,"title":"<code>Qn-4.c</code>","text":"<p>Problem Statement</p> <p>Write a program to check a string is palindrome or not using user-defined function.</p>","path":["Semester 1","Eduincs exam","Paper 2 05 03 2026","Qn-4.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-2_05-03-2026/Qn-4/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 06 Mar 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Eduincs exam","Paper 2 05 03 2026","Qn-4.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-2_05-03-2026/Qn-4/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Eduincs exam","Paper 2 05 03 2026","Qn-4.c"],"tags":[]},{"location":"semester_1/eduincs_exam/Paper-2_05-03-2026/Qn-4/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Eduincs exam","Paper 2 05 03 2026","Qn-4.c"],"tags":[]},{"location":"semester_1/internal-practice/","level":1,"title":"Internal Practice","text":"<p>Files and sub-folders in Internal Practice.</p>","path":["Semester 1","Internal practice","Internal Practice"],"tags":[]},{"location":"semester_1/internal-practice/#files","level":2,"title":"Files","text":"# File Link 1 <code>IP-01.c</code> View Code 2 <code>IP-02.c</code> View Code 3 <code>IP-03.c</code> View Code 4 <code>IP-04.c</code> View Code 5 <code>IP-05.c</code> View Code 6 <code>IP-06.c</code> View Code 7 <code>IP-07.c</code> View Code 8 <code>IP-08.c</code> View Code 9 <code>IP-09.c</code> View Code 10 <code>IP-10.c</code> View Code 11 <code>IP-11.c</code> View Code 12 <code>IP-12.c</code> View Code 13 <code>IP-13.c</code> View Code 14 <code>IP-14.c</code> View Code 15 <code>IP-15.c</code> View Code 16 <code>IP-16.c</code> View Code 17 <code>IP-17.c</code> View Code 18 <code>IP-18.c</code> View Code 19 <code>IP-19.c</code> View Code 20 <code>IP-20.c</code> View Code","path":["Semester 1","Internal practice","Internal Practice"],"tags":[]},{"location":"semester_1/internal-practice/IP-01/","level":1,"title":"<code>IP-01.c</code>","text":"<p>Problem Statement</p> <p>Write a program to compute the sum and product of digits of an integer using user defined functions.</p>","path":["Semester 1","Internal practice","IP-01.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-01/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Internal practice","IP-01.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-01/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Internal practice","IP-01.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-01/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Internal practice","IP-01.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-02/","level":1,"title":"<code>IP-02.c</code>","text":"<p>Problem Statement</p> <p>Write a program to reverse a non-negative integer using a function.</p>","path":["Semester 1","Internal practice","IP-02.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-02/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Internal practice","IP-02.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-02/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Internal practice","IP-02.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-02/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Internal practice","IP-02.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-03/","level":1,"title":"<code>IP-03.c</code>","text":"<p>Problem Statement</p> <p>Write a program to compute the sum of the first n terms of the series using a function: S=1−2+3−4+5−6+…</p>","path":["Semester 1","Internal practice","IP-03.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-03/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Internal practice","IP-03.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-03/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Internal practice","IP-03.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-03/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Internal practice","IP-03.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-04/","level":1,"title":"<code>IP-04.c</code>","text":"<p>Problem Statement</p> <p>Write a function to check whether a number is prime or not. Use the same function to generate all prime numbers less than 100.</p>","path":["Semester 1","Internal practice","IP-04.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-04/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 03 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Internal practice","IP-04.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-04/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Internal practice","IP-04.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-04/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Internal practice","IP-04.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-05/","level":1,"title":"<code>IP-05.c</code>","text":"<p>Problem Statement</p> <p>Write a function to check whether a given string is a palindrome. Use this function to determine whether an entered string is Palindrome.</p>","path":["Semester 1","Internal practice","IP-05.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-05/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 03 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Internal practice","IP-05.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-05/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Internal practice","IP-05.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-05/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Internal practice","IP-05.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-06/","level":1,"title":"<code>IP-06.c</code>","text":"<p>Problem Statement</p> <p>Write a program using a function to compute and display all factors of a given number.</p>","path":["Semester 1","Internal practice","IP-06.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-06/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Internal practice","IP-06.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-06/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Internal practice","IP-06.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-06/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Internal practice","IP-06.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-07/","level":1,"title":"<code>IP-07.c</code>","text":"<p>Problem Statement</p> <p>Write a program to swap two numbers using pointers (user-defined function).</p>","path":["Semester 1","Internal practice","IP-07.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-07/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Internal practice","IP-07.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-07/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Internal practice","IP-07.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-07/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Internal practice","IP-07.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-08/","level":1,"title":"<code>IP-08.c</code>","text":"<p>Problem Statement</p> <p>Write a program that takes the radius of a circle as input, passes it to a function that computes area and circumference, and displays results in main().</p>","path":["Semester 1","Internal practice","IP-08.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-08/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Internal practice","IP-08.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-08/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Internal practice","IP-08.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-08/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Internal practice","IP-08.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-09/","level":1,"title":"<code>IP-09.c</code>","text":"<p>Problem Statement</p> <p>Write a program to find the sum of n elements entered by the user. Use dynamic memory allocation (malloc() or calloc()).</p>","path":["Semester 1","Internal practice","IP-09.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-09/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Internal practice","IP-09.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-09/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Internal practice","IP-09.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-09/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Internal practice","IP-09.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-10/","level":1,"title":"<code>IP-10.c</code>","text":"<p>Problem Statement</p> <p>Write a function that reverses the elements of an array in place, using only a single pointer argument, and return void.</p>","path":["Semester 1","Internal practice","IP-10.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-10/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 03 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Internal practice","IP-10.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-10/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Internal practice","IP-10.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-10/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Internal practice","IP-10.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-11/","level":1,"title":"<code>IP-11.c</code>","text":"<p>Problem Statement</p> <p>Write a program to merge two sorted integer arrays to form a single sorted array.</p>","path":["Semester 1","Internal practice","IP-11.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-11/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 03 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Internal practice","IP-11.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-11/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Internal practice","IP-11.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-11/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Internal practice","IP-11.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-12/","level":1,"title":"<code>IP-12.c</code>","text":"<p>Problem Statement</p> <p>Write a program that reads 10 integers into an array (using pointers), and prints the array in ascending and descending order.</p>","path":["Semester 1","Internal practice","IP-12.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-12/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 03 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Internal practice","IP-12.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-12/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Internal practice","IP-12.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-12/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Internal practice","IP-12.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-13/","level":1,"title":"<code>IP-13.c</code>","text":"<p>Problem Statement</p> <p>Write a program to display the Fibonacci series (i) using recursion (ii) using iteration</p>","path":["Semester 1","Internal practice","IP-13.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-13/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 03 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Internal practice","IP-13.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-13/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Internal practice","IP-13.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-13/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Internal practice","IP-13.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-14/","level":1,"title":"<code>IP-14.c</code>","text":"<p>Problem Statement</p> <p>Write a program to calculate the factorial of a number (i) using recursion (ii) using iteration</p>","path":["Semester 1","Internal practice","IP-14.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-14/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 03 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Internal practice","IP-14.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-14/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Internal practice","IP-14.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-14/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Internal practice","IP-14.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-15/","level":1,"title":"<code>IP-15.c</code>","text":"<p>Problem Statement</p> <p>Write a program to calculate the GCD of two numbers (i) using recursion (ii) without recursion</p>","path":["Semester 1","Internal practice","IP-15.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-15/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 03 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Internal practice","IP-15.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-15/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Internal practice","IP-15.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-15/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Internal practice","IP-15.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-16/","level":1,"title":"<code>IP-16.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that includes a user-defined function named isArmstrong with the signature int isArmstrong(int num);. An Armstrong number is a number that is equal to the sum of its own digits each raised to the power of the number of digits. For example, 153 is an Armstrong number because 1^3 + 5^3 + 3^3 = 153</p>","path":["Semester 1","Internal practice","IP-16.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-16/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 03 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Internal practice","IP-16.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-16/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Internal practice","IP-16.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-16/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Internal practice","IP-16.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-17/","level":1,"title":"<code>IP-17.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that includes a user-defined function named isPerfect with the signature int isPerfect(int num);. A perfect number is a positive integer that is equal to the sum of its proper divisors, excluding itself. For example, 28 is a perfect number because the sum of its divisors (1, 2, 4, 7, 14) equals 28.</p>","path":["Semester 1","Internal practice","IP-17.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-17/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Internal practice","IP-17.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-17/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Internal practice","IP-17.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-17/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Internal practice","IP-17.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-18/","level":1,"title":"<code>IP-18.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that includes a user-defined function named findLargest with the signature int findLargest(int arr[], int size);. The function should take an array of integers and its size, and return the largest element in the array.</p>","path":["Semester 1","Internal practice","IP-18.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-18/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 03 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Internal practice","IP-18.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-18/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Internal practice","IP-18.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-18/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Internal practice","IP-18.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-19/","level":1,"title":"<code>IP-19.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that includes a user-defined function named binarySearch with the signature int binarySearch(int arr[], int size, int target);. The function should perform a binary search on a sorted array of integers and return the index of the target element if found, and -1 otherwise.</p>","path":["Semester 1","Internal practice","IP-19.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-19/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 03 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Internal practice","IP-19.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-19/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Internal practice","IP-19.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-19/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Internal practice","IP-19.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-20/","level":1,"title":"<code>IP-20.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that defines an array of integers, and includes a user-defined function named reverseArray with the signature void reverseArray(int arr[], int size);. The function should reverse the elements of the array.</p>","path":["Semester 1","Internal practice","IP-20.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-20/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 03 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Internal practice","IP-20.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-20/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Internal practice","IP-20.c"],"tags":[]},{"location":"semester_1/internal-practice/IP-20/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Internal practice","IP-20.c"],"tags":[]},{"location":"semester_1/khurapati-idea/","level":1,"title":"Khurapati Idea","text":"<p>Files and sub-folders in Khurapati Idea.</p>","path":["Semester 1","Khurapati idea","Khurapati Idea"],"tags":[]},{"location":"semester_1/khurapati-idea/#files","level":2,"title":"Files","text":"# File Link 1 <code>KI001.c</code> View Code 2 <code>KI002.c</code> View Code 3 <code>KI003.c</code> View Code 4 <code>KI004.c</code> View Code","path":["Semester 1","Khurapati idea","Khurapati Idea"],"tags":[]},{"location":"semester_1/khurapati-idea/KI001/","level":1,"title":"<code>KI001.c</code>","text":"","path":["Semester 1","Khurapati idea","KI001.c"],"tags":[]},{"location":"semester_1/khurapati-idea/KI001/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Khurapati idea","KI001.c"],"tags":[]},{"location":"semester_1/khurapati-idea/KI001/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Khurapati idea","KI001.c"],"tags":[]},{"location":"semester_1/khurapati-idea/KI001/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Khurapati idea","KI001.c"],"tags":[]},{"location":"semester_1/khurapati-idea/KI002/","level":1,"title":"<code>KI002.c</code>","text":"<p>Problem Statement</p> <p>Plan - checking for edge case</p>","path":["Semester 1","Khurapati idea","KI002.c"],"tags":[]},{"location":"semester_1/khurapati-idea/KI002/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Khurapati idea","KI002.c"],"tags":[]},{"location":"semester_1/khurapati-idea/KI002/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Khurapati idea","KI002.c"],"tags":[]},{"location":"semester_1/khurapati-idea/KI002/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Khurapati idea","KI002.c"],"tags":[]},{"location":"semester_1/khurapati-idea/KI003/","level":1,"title":"<code>KI003.c</code>","text":"<p>Problem Statement</p> <p>Bubble sort (with swap)</p>","path":["Semester 1","Khurapati idea","KI003.c"],"tags":[]},{"location":"semester_1/khurapati-idea/KI003/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 24 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Khurapati idea","KI003.c"],"tags":[]},{"location":"semester_1/khurapati-idea/KI003/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Khurapati idea","KI003.c"],"tags":[]},{"location":"semester_1/khurapati-idea/KI003/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Khurapati idea","KI003.c"],"tags":[]},{"location":"semester_1/khurapati-idea/KI004/","level":1,"title":"<code>KI004.c</code>","text":"<p>Problem Statement</p> <p>Trying to write code only with emoji</p>","path":["Semester 1","Khurapati idea","KI004.c"],"tags":[]},{"location":"semester_1/khurapati-idea/KI004/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Khurapati idea","KI004.c"],"tags":[]},{"location":"semester_1/khurapati-idea/KI004/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Khurapati idea","KI004.c"],"tags":[]},{"location":"semester_1/khurapati-idea/KI004/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Khurapati idea","KI004.c"],"tags":[]},{"location":"semester_1/letusc/","level":1,"title":"Letusc","text":"<p>Files and sub-folders in Letusc.</p>","path":["Semester 1","Letusc"],"tags":[]},{"location":"semester_1/letusc/#files","level":2,"title":"Files","text":"# File Link 1 <code>luc001.c</code> View Code 2 <code>luc002.c</code> View Code 3 <code>luc003.c</code> View Code 4 <code>luc004.c</code> View Code 5 <code>luc005.c</code> View Code 6 <code>luc006.c</code> View Code 7 <code>luc007.c</code> View Code 8 <code>luc008.c</code> View Code 9 <code>luc009.c</code> View Code 10 <code>luc010.c</code> View Code 11 <code>luc011.c</code> View Code 12 <code>luc012.c</code> View Code 13 <code>luc013.c</code> View Code 14 <code>luc014.c</code> View Code 15 <code>luc015.c</code> View Code 16 <code>luc016.c</code> View Code 17 <code>luc017.c</code> View Code 18 <code>luc018-logic.c</code> View Code 19 <code>luc018.c</code> View Code 20 <code>luc019.c</code> View Code 21 <code>luc020.c</code> View Code 22 <code>luc021.c</code> View Code 23 <code>luc022.c</code> View Code 24 <code>luc023.c</code> View Code 25 <code>luc024.c</code> View Code 26 <code>luc025.c</code> View Code 27 <code>luc026.c</code> View Code 28 <code>luc027.c</code> View Code 29 <code>luc028.c</code> View Code 30 <code>luc029.c</code> View Code 31 <code>luc030.c</code> View Code 32 <code>luc031-logic.c</code> View Code 33 <code>luc031.c</code> View Code 34 <code>luc032.c</code> View Code 35 <code>luc033.c</code> View Code 36 <code>luc034.c</code> View Code 37 <code>luc035.c</code> View Code 38 <code>luc036.c</code> View Code 39 <code>luc037.c</code> View Code 40 <code>luc038.c</code> View Code 41 <code>luc039.c</code> View Code 42 <code>luc040-logic.c</code> View Code 43 <code>luc040.c</code> View Code 44 <code>luc041.c</code> View Code 45 <code>luc042.c</code> View Code 46 <code>luc043.c</code> View Code 47 <code>luc044.c</code> View Code 48 <code>luc045.c</code> View Code 49 <code>luc046.c</code> View Code 50 <code>luc047.c</code> View Code 51 <code>luc048.c</code> View Code 52 <code>luc049.c</code> View Code 53 <code>luc050.c</code> View Code 54 <code>luc051.c</code> View Code 55 <code>luc052.c</code> View Code 56 <code>luc053.c</code> View Code 57 <code>luc054.c</code> View Code 58 <code>luc055.c</code> View Code 59 <code>luc056.c</code> View Code 60 <code>luc057.c</code> View Code 61 <code>luc058.c</code> View Code 62 <code>luc059.c</code> View Code 63 <code>luc060.c</code> View Code 64 <code>luc061.c</code> View Code 65 <code>luc062.c</code> View Code 66 <code>luc063.c</code> View Code 67 <code>luc064.c</code> View Code 68 <code>luc065.c</code> View Code 69 <code>luc066.c</code> View Code 70 <code>luc067.c</code> View Code 71 <code>luc068.c</code> View Code 72 <code>luc069.c</code> View Code 73 <code>luc070.c</code> View Code 74 <code>luc071.c</code> View Code 75 <code>luc072.c</code> View Code 76 <code>luc073.c</code> View Code 77 <code>luc074.c</code> View Code 78 <code>luc075.c</code> View Code 79 <code>luc076.c</code> View Code 80 <code>luc077.c</code> View Code 81 <code>luc078.c</code> View Code 82 <code>luc079.c</code> View Code 83 <code>luc080.c</code> View Code 84 <code>luc081.c</code> View Code 85 <code>luc082.c</code> View Code 86 <code>luc083.c</code> View Code 87 <code>luc084.c</code> View Code 88 <code>luc085.c</code> View Code 89 <code>luc086.c</code> View Code 90 <code>luc087.c</code> View Code 91 <code>luc088.c</code> View Code 92 <code>luc089.c</code> View Code 93 <code>luc090.c</code> View Code 94 <code>luc091.c</code> View Code 95 <code>luc092.c</code> View Code 96 <code>luc093.c</code> View Code 97 <code>luc094.c</code> View Code 98 <code>luc095.c</code> View Code 99 <code>luc096.c</code> View Code 100 <code>luc097.c</code> View Code 101 <code>luc098.c</code> View Code 102 <code>luc099.c</code> View Code 103 <code>luc100.c</code> View Code 104 <code>luc101.c</code> View Code 105 <code>luc102.c</code> View Code 106 <code>luc103.c</code> View Code 107 <code>luc104.c</code> View Code 108 <code>luc105.c</code> View Code 109 <code>luc106.c</code> View Code 110 <code>luc107.c</code> View Code 111 <code>luc108.c</code> View Code 112 <code>luc109.c</code> View Code 113 <code>luc110.c</code> View Code 114 <code>luc111.c</code> View Code 115 <code>luc112.c</code> View Code 116 <code>luc113.c</code> View Code 117 <code>luc114.c</code> View Code 118 <code>luc115.c</code> View Code 119 <code>luc116.c</code> View Code 120 <code>luc117.c</code> View Code 121 <code>luc118.c</code> View Code 122 <code>luc119.c</code> View Code 123 <code>lucproblem001.c</code> View Code 124 <code>lucproblem002.c</code> View Code 125 <code>lucproblem003.c</code> View Code 126 <code>lucproblem004.c</code> View Code 127 <code>lucproblem005.c</code> View Code 128 <code>lucproblem006.c</code> View Code 129 <code>lucproblem007.c</code> View Code 130 <code>lucproblem008.c</code> View Code 131 <code>lucproblem009.c</code> View Code 132 <code>lucproblem010-complex.c</code> View Code 133 <code>lucproblem010.c</code> View Code 134 <code>lucproblem011.c</code> View Code 135 <code>lucproblem012.c</code> View Code 136 <code>lucproblem013.c</code> View Code 137 <code>lucproblem014-short.c</code> View Code 138 <code>lucproblem014.c</code> View Code 139 <code>lucproblem015.c</code> View Code 140 <code>lucproblem016.c</code> View Code","path":["Semester 1","Letusc"],"tags":[]},{"location":"semester_1/letusc/luc001/","level":1,"title":"<code>luc001.c</code>","text":"<p>Problem Statement</p> <p>Temperature of a city in fahrenheit degrees is input through the keyboard. WAP to convert this temperature into Centigrade degrees.</p>","path":["Semester 1","Letusc","luc001.c"],"tags":[]},{"location":"semester_1/letusc/luc001/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc001.c"],"tags":[]},{"location":"semester_1/letusc/luc001/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc001.c"],"tags":[]},{"location":"semester_1/letusc/luc001/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc001.c"],"tags":[]},{"location":"semester_1/letusc/luc002/","level":1,"title":"<code>luc002.c</code>","text":"<p>Problem Statement</p> <p>The length and breadth of a rectangle and radius of a circle are input through the keyboard. Write a program to calculate the area and perimeter of the rectangle, and the area and circumference of the circle.</p>","path":["Semester 1","Letusc","luc002.c"],"tags":[]},{"location":"semester_1/letusc/luc002/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc002.c"],"tags":[]},{"location":"semester_1/letusc/luc002/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc002.c"],"tags":[]},{"location":"semester_1/letusc/luc002/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc002.c"],"tags":[]},{"location":"semester_1/letusc/luc003/","level":1,"title":"<code>luc003.c</code>","text":"<p>Problem Statement</p> <p>Paper of size AO has dimensions 1189 mm x 841 mm. Each subsequent size A(n) is defined as A(n-1) cut in half, parallel to its shorter sides. Thus, paper of size A1 would have dimensions 841 mm x 594 mm. Write a program to calculate and print paper sizes A0,� A1,�A2,�...�A8.</p>","path":["Semester 1","Letusc","luc003.c"],"tags":[]},{"location":"semester_1/letusc/luc003/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc003.c"],"tags":[]},{"location":"semester_1/letusc/luc003/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc003.c"],"tags":[]},{"location":"semester_1/letusc/luc003/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc003.c"],"tags":[]},{"location":"semester_1/letusc/luc004/","level":1,"title":"<code>luc004.c</code>","text":"<p>Problem Statement</p> <p>If a five digit number is input through the keyboard, write a program to calculate the sum of it's digit. (Hint : Use the modulus operator %)</p>","path":["Semester 1","Letusc","luc004.c"],"tags":[]},{"location":"semester_1/letusc/luc004/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc004.c"],"tags":[]},{"location":"semester_1/letusc/luc004/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc004.c"],"tags":[]},{"location":"semester_1/letusc/luc004/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc004.c"],"tags":[]},{"location":"semester_1/letusc/luc005/","level":1,"title":"<code>luc005.c</code>","text":"<p>Problem Statement</p> <p>Write a program to recive Cartesian co-ordinates (x, y) of a point and convert them into Polar co-ordinates (r, phi) Hint : r = sqrt (x^2 + y^2) and phi = tan^-1 (y/x)</p>","path":["Semester 1","Letusc","luc005.c"],"tags":[]},{"location":"semester_1/letusc/luc005/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc005.c"],"tags":[]},{"location":"semester_1/letusc/luc005/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc005.c"],"tags":[]},{"location":"semester_1/letusc/luc005/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc005.c"],"tags":[]},{"location":"semester_1/letusc/luc006/","level":1,"title":"<code>luc006.c</code>","text":"<p>Problem Statement</p> <p>Write a program to receive values of latitude (L1, L2) and longitude (G1, G2), in degrees, of two places on the earth and output the distance (D) between them in nautical miles. The formula for distance in nautical miles is : D = 3963 cos^-1(sin L1 sin L2 + cos L1 cos L2 * cos(G2 - G1))</p>","path":["Semester 1","Letusc","luc006.c"],"tags":[]},{"location":"semester_1/letusc/luc006/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc006.c"],"tags":[]},{"location":"semester_1/letusc/luc006/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc006.c"],"tags":[]},{"location":"semester_1/letusc/luc006/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc006.c"],"tags":[]},{"location":"semester_1/letusc/luc007/","level":1,"title":"<code>luc007.c</code>","text":"<p>Problem Statement</p> <p>Wind-chill factor is the felt air temperature on exposed skin due to wind. The wind-chill temperature is always lower than the air temperature, and is calculated as per the following formula. wcf = 35.74 + 0.6215t + (0.4275t - 35.75) * v^0.16 Where t is temperature and v is wind velocity. Write a program to receive values of t and v and calcualate wind-chill factor (wcf).</p>","path":["Semester 1","Letusc","luc007.c"],"tags":[]},{"location":"semester_1/letusc/luc007/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc007.c"],"tags":[]},{"location":"semester_1/letusc/luc007/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc007.c"],"tags":[]},{"location":"semester_1/letusc/luc007/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc007.c"],"tags":[]},{"location":"semester_1/letusc/luc008/","level":1,"title":"<code>luc008.c</code>","text":"<p>Problem Statement</p> <p>If value of an angle is input through the keyboard, write a program to print all its trigonometric ratios.</p>","path":["Semester 1","Letusc","luc008.c"],"tags":[]},{"location":"semester_1/letusc/luc008/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc008.c"],"tags":[]},{"location":"semester_1/letusc/luc008/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc008.c"],"tags":[]},{"location":"semester_1/letusc/luc008/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc008.c"],"tags":[]},{"location":"semester_1/letusc/luc009/","level":1,"title":"<code>luc009.c</code>","text":"<p>Problem Statement</p> <p>Two numbers are input through the keyboard into two locations C and D. Write a program to interchange the contents of C and D.</p>","path":["Semester 1","Letusc","luc009.c"],"tags":[]},{"location":"semester_1/letusc/luc009/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc009.c"],"tags":[]},{"location":"semester_1/letusc/luc009/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc009.c"],"tags":[]},{"location":"semester_1/letusc/luc009/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc009.c"],"tags":[]},{"location":"semester_1/letusc/luc010/","level":1,"title":"<code>luc010.c</code>","text":"<p>Problem Statement</p> <p>A five-digit number is entered through the keyboard. Write a program to obtain the reversed number and to etermine whether the original and reversed numbers are equal or not.</p>","path":["Semester 1","Letusc","luc010.c"],"tags":[]},{"location":"semester_1/letusc/luc010/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc010.c"],"tags":[]},{"location":"semester_1/letusc/luc010/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc010.c"],"tags":[]},{"location":"semester_1/letusc/luc010/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc010.c"],"tags":[]},{"location":"semester_1/letusc/luc011/","level":1,"title":"<code>luc011.c</code>","text":"<p>Problem Statement</p> <p>If ages of Ram, Shyam and Ajay are input through the keyboard, write a program to determine the youngest of the three.</p>","path":["Semester 1","Letusc","luc011.c"],"tags":[]},{"location":"semester_1/letusc/luc011/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc011.c"],"tags":[]},{"location":"semester_1/letusc/luc011/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc011.c"],"tags":[]},{"location":"semester_1/letusc/luc011/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc011.c"],"tags":[]},{"location":"semester_1/letusc/luc012/","level":1,"title":"<code>luc012.c</code>","text":"<p>Problem Statement</p> <p>Write a program to check whether a triangle is valid or not, if three angles of the triangle are entered through the keyboard. A triangle is valid if the sum of all the three angles is equal to 180 degrees.</p>","path":["Semester 1","Letusc","luc012.c"],"tags":[]},{"location":"semester_1/letusc/luc012/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc012.c"],"tags":[]},{"location":"semester_1/letusc/luc012/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc012.c"],"tags":[]},{"location":"semester_1/letusc/luc012/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc012.c"],"tags":[]},{"location":"semester_1/letusc/luc013/","level":1,"title":"<code>luc013.c</code>","text":"<p>Problem Statement</p> <p>Write a program to find the absolute value of a number entered through the keyboard.</p>","path":["Semester 1","Letusc","luc013.c"],"tags":[]},{"location":"semester_1/letusc/luc013/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc013.c"],"tags":[]},{"location":"semester_1/letusc/luc013/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc013.c"],"tags":[]},{"location":"semester_1/letusc/luc013/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc013.c"],"tags":[]},{"location":"semester_1/letusc/luc014/","level":1,"title":"<code>luc014.c</code>","text":"<p>Problem Statement</p> <p>Given the length and breadth of a rectangle, write a program to find whether the area of the rectangle is greater than it's perimeter. For example, the area of the rectangle with length = 5 and breadth = 4 is greater than its perimeter.</p>","path":["Semester 1","Letusc","luc014.c"],"tags":[]},{"location":"semester_1/letusc/luc014/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc014.c"],"tags":[]},{"location":"semester_1/letusc/luc014/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc014.c"],"tags":[]},{"location":"semester_1/letusc/luc014/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc014.c"],"tags":[]},{"location":"semester_1/letusc/luc015/","level":1,"title":"<code>luc015.c</code>","text":"<p>Problem Statement</p> <p>Given three points (x1, y1), (x2, y2), and (x3, y3), write a program to check if the three poins fall on one straight line.</p>","path":["Semester 1","Letusc","luc015.c"],"tags":[]},{"location":"semester_1/letusc/luc015/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc015.c"],"tags":[]},{"location":"semester_1/letusc/luc015/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc015.c"],"tags":[]},{"location":"semester_1/letusc/luc015/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc015.c"],"tags":[]},{"location":"semester_1/letusc/luc016/","level":1,"title":"<code>luc016.c</code>","text":"<p>Problem Statement</p> <p>Given the coordiantes (x, y) of center of a circle and its radius, write a program that will determine whether a point lies inside the circle, on the circle or outside the circle. (Hint : Use sqrt() and pow() functions.)</p>","path":["Semester 1","Letusc","luc016.c"],"tags":[]},{"location":"semester_1/letusc/luc016/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc016.c"],"tags":[]},{"location":"semester_1/letusc/luc016/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc016.c"],"tags":[]},{"location":"semester_1/letusc/luc016/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc016.c"],"tags":[]},{"location":"semester_1/letusc/luc017/","level":1,"title":"<code>luc017.c</code>","text":"<p>Problem Statement</p> <p>Given a point (x, y), write a program to find out if it lies on X-axis, Y-axis or origin.</p>","path":["Semester 1","Letusc","luc017.c"],"tags":[]},{"location":"semester_1/letusc/luc017/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc017.c"],"tags":[]},{"location":"semester_1/letusc/luc017/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc017.c"],"tags":[]},{"location":"semester_1/letusc/luc017/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc017.c"],"tags":[]},{"location":"semester_1/letusc/luc018-logic/","level":1,"title":"<code>luc018-logic.c</code>","text":"<p>Problem Statement</p> <p>According to Gregorian calender, it was Monday on the date 01/01/01. Write a program to find out what is the day on 1st January of any input year.</p>","path":["Semester 1","Letusc","luc018-logic.c"],"tags":[]},{"location":"semester_1/letusc/luc018-logic/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc018-logic.c"],"tags":[]},{"location":"semester_1/letusc/luc018-logic/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc018-logic.c"],"tags":[]},{"location":"semester_1/letusc/luc018-logic/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc018-logic.c"],"tags":[]},{"location":"semester_1/letusc/luc018/","level":1,"title":"<code>luc018.c</code>","text":"<p>Problem Statement</p> <p>According to Gregorian calender, it was Monday on the date 01/01/01. if any year is input through the keyboard write a program to find out what is the day on 1st January of this year.</p>","path":["Semester 1","Letusc","luc018.c"],"tags":[]},{"location":"semester_1/letusc/luc018/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc018.c"],"tags":[]},{"location":"semester_1/letusc/luc018/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc018.c"],"tags":[]},{"location":"semester_1/letusc/luc018/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc018.c"],"tags":[]},{"location":"semester_1/letusc/luc019/","level":1,"title":"<code>luc019.c</code>","text":"<p>Problem Statement</p> <p>If the length of three sides of a triangle are entered through the keyboard, write a program to check whether the triangle is an isosceles, an equilateral, a scalene or a right-angled triangle.</p>","path":["Semester 1","Letusc","luc019.c"],"tags":[]},{"location":"semester_1/letusc/luc019/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc019.c"],"tags":[]},{"location":"semester_1/letusc/luc019/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc019.c"],"tags":[]},{"location":"semester_1/letusc/luc019/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc019.c"],"tags":[]},{"location":"semester_1/letusc/luc020/","level":1,"title":"<code>luc020.c</code>","text":"<p>Problem Statement</p> <p>In digital world colors are specified in Red-Green-Blue (RGB) format, with values of R, G, B varying on an integer scale from 0 to 255. In print publishing the colors are mentioned in Cyan-Magenta-Yellow-Black (CMYK) format, with values of C, M, Y, and K varying on a real scale from 0.0 to 1.0. Write a program that converts RGB color to CMYK color as per the following formulae: White = Max(Red/255, Green/255, Blue/255) Cyan = (White-Red/255) / White Magenta = (White-Green/255) / White Yellow = (White-Blue/255) / White Black = 1 - White Note that if the RGB values are all 0, then the CMY values are all 0 and the K value is 1.</p>","path":["Semester 1","Letusc","luc020.c"],"tags":[]},{"location":"semester_1/letusc/luc020/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc020.c"],"tags":[]},{"location":"semester_1/letusc/luc020/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc020.c"],"tags":[]},{"location":"semester_1/letusc/luc020/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc020.c"],"tags":[]},{"location":"semester_1/letusc/luc021/","level":1,"title":"<code>luc021.c</code>","text":"<p>Problem Statement</p> <p>A certain grade of steel is graded according to the following conditions: (i) Hardness must be greater than 50 (ii) Carbon content must be less than 0.7 (iii) Tensile strength must be greater than 5600 The grades are as follows: Grade is 10 if all three conditions are met Grade is 9 if conditions (i) and (ii) are met Grade is 8 if conditions (ii) and (iii) are met Grade is 7 if conditions (i) and (iii) are met Grade is 6 if only one condition is met Grade is 5 if none of the conditions are met Write a program, which will require the user to give values of hardness, carbon content and tensile strength of the steel under consideration and output the grade of the steel.</p>","path":["Semester 1","Letusc","luc021.c"],"tags":[]},{"location":"semester_1/letusc/luc021/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc021.c"],"tags":[]},{"location":"semester_1/letusc/luc021/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc021.c"],"tags":[]},{"location":"semester_1/letusc/luc021/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc021.c"],"tags":[]},{"location":"semester_1/letusc/luc022/","level":1,"title":"<code>luc022.c</code>","text":"<p>Problem Statement</p> <p>The Body Mass Index (BMI) is defined as ratio of weight of the person (in Kilograms) to square of the height (in meters). Write a program that receives weight and height, calculate the BMI, and reports the BMI catagory as per the following table. BMI Catagory BMI Starvation < 15 Anorexic 15.1 to 17.5 Underweight 17.6 to 18.5 Ideal 18.6 to 24.9 Overweight 25 to 25.9 Obese 30 to 39.9 Morbidly Obese >= 40</p>","path":["Semester 1","Letusc","luc022.c"],"tags":[]},{"location":"semester_1/letusc/luc022/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc022.c"],"tags":[]},{"location":"semester_1/letusc/luc022/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc022.c"],"tags":[]},{"location":"semester_1/letusc/luc022/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc022.c"],"tags":[]},{"location":"semester_1/letusc/luc023/","level":1,"title":"<code>luc023.c</code>","text":"<p>Problem Statement</p> <p>Using conditional operators determine : (1) Whether the character entered through the keyboard is a lower case alphabet or not. (2) Whether a character entered through the keyboard is a special symbol or not.</p>","path":["Semester 1","Letusc","luc023.c"],"tags":[]},{"location":"semester_1/letusc/luc023/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc023.c"],"tags":[]},{"location":"semester_1/letusc/luc023/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc023.c"],"tags":[]},{"location":"semester_1/letusc/luc023/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc023.c"],"tags":[]},{"location":"semester_1/letusc/luc024/","level":1,"title":"<code>luc024.c</code>","text":"<p>Problem Statement</p> <p>Write a program using conditional operators to determine whether a year entered through the keyboard is a leap year or not.</p>","path":["Semester 1","Letusc","luc024.c"],"tags":[]},{"location":"semester_1/letusc/luc024/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc024.c"],"tags":[]},{"location":"semester_1/letusc/luc024/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc024.c"],"tags":[]},{"location":"semester_1/letusc/luc024/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc024.c"],"tags":[]},{"location":"semester_1/letusc/luc025/","level":1,"title":"<code>luc025.c</code>","text":"<p>Problem Statement</p> <p>Write a program to find the greates of the three numbers entered through the keyboard. Use conditional operators.</p>","path":["Semester 1","Letusc","luc025.c"],"tags":[]},{"location":"semester_1/letusc/luc025/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc025.c"],"tags":[]},{"location":"semester_1/letusc/luc025/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc025.c"],"tags":[]},{"location":"semester_1/letusc/luc025/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc025.c"],"tags":[]},{"location":"semester_1/letusc/luc026/","level":1,"title":"<code>luc026.c</code>","text":"<p>Problem Statement</p> <p>Write a program to recieve value of an angle in degreesand check whether sum of squares of sine and cosine of this angle is equal to 1.</p>","path":["Semester 1","Letusc","luc026.c"],"tags":[]},{"location":"semester_1/letusc/luc026/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc026.c"],"tags":[]},{"location":"semester_1/letusc/luc026/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc026.c"],"tags":[]},{"location":"semester_1/letusc/luc026/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc026.c"],"tags":[]},{"location":"semester_1/letusc/luc027/","level":1,"title":"<code>luc027.c</code>","text":"","path":["Semester 1","Letusc","luc027.c"],"tags":[]},{"location":"semester_1/letusc/luc027/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc027.c"],"tags":[]},{"location":"semester_1/letusc/luc027/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc027.c"],"tags":[]},{"location":"semester_1/letusc/luc027/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc027.c"],"tags":[]},{"location":"semester_1/letusc/luc028/","level":1,"title":"<code>luc028.c</code>","text":"<p>Problem Statement</p> <p>Write a program to print all the ASCII values and their equivalent characters using a while loop. The ASCII may vary from 0 to 255.</p>","path":["Semester 1","Letusc","luc028.c"],"tags":[]},{"location":"semester_1/letusc/luc028/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc028.c"],"tags":[]},{"location":"semester_1/letusc/luc028/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc028.c"],"tags":[]},{"location":"semester_1/letusc/luc028/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc028.c"],"tags":[]},{"location":"semester_1/letusc/luc029/","level":1,"title":"<code>luc029.c</code>","text":"<p>Problem Statement</p> <p>Write a program to print out all Armstrong numbers between 100 and 500. If sum of cubes of each digit of the number is equal to the number itself, then the number is called an Armstrong number. For example, 153 = (1 * 1 * 1) + (5 * 5 * 5) + (3 * 3 * 3)</p>","path":["Semester 1","Letusc","luc029.c"],"tags":[]},{"location":"semester_1/letusc/luc029/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc029.c"],"tags":[]},{"location":"semester_1/letusc/luc029/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc029.c"],"tags":[]},{"location":"semester_1/letusc/luc029/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc029.c"],"tags":[]},{"location":"semester_1/letusc/luc030/","level":1,"title":"<code>luc030.c</code>","text":"<p>Problem Statement</p> <p>Write a program for a matchstick game being played between the computer and a user. Your program should ensure that the computer always wins. Rules for the game are as follows : - There are 21 matchsticks. - The computer asks the player to pick 1, 2, 3, or 4 matchsticks. - After the person picks, the computer does its picking. - Whoever is forced to pick up the last matchstick loses the game.</p>","path":["Semester 1","Letusc","luc030.c"],"tags":[]},{"location":"semester_1/letusc/luc030/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc030.c"],"tags":[]},{"location":"semester_1/letusc/luc030/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc030.c"],"tags":[]},{"location":"semester_1/letusc/luc030/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc030.c"],"tags":[]},{"location":"semester_1/letusc/luc031-logic/","level":1,"title":"<code>luc031-logic.c</code>","text":"<p>Problem Statement</p> <p>Write a program to enter numbers till the user wants. At the end it should display the count of positive, negative and zeros entered.</p>","path":["Semester 1","Letusc","luc031-logic.c"],"tags":[]},{"location":"semester_1/letusc/luc031-logic/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc031-logic.c"],"tags":[]},{"location":"semester_1/letusc/luc031-logic/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc031-logic.c"],"tags":[]},{"location":"semester_1/letusc/luc031-logic/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc031-logic.c"],"tags":[]},{"location":"semester_1/letusc/luc031/","level":1,"title":"<code>luc031.c</code>","text":"<p>Problem Statement</p> <p>Write a program to enter numbers till the user wants. At the end it should display the count of positive, negative and zeros entered.</p>","path":["Semester 1","Letusc","luc031.c"],"tags":[]},{"location":"semester_1/letusc/luc031/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc031.c"],"tags":[]},{"location":"semester_1/letusc/luc031/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc031.c"],"tags":[]},{"location":"semester_1/letusc/luc031/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc031.c"],"tags":[]},{"location":"semester_1/letusc/luc032/","level":1,"title":"<code>luc032.c</code>","text":"<p>Problem Statement</p> <p>Write a program to recieve an integer and find its octal equivalent. (Hint : To obtain octal equivalent of an integer, Divide it continuously by 8 till dividend does not become zero, then write the remainders obtained in reverse derection.)</p>","path":["Semester 1","Letusc","luc032.c"],"tags":[]},{"location":"semester_1/letusc/luc032/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc032.c"],"tags":[]},{"location":"semester_1/letusc/luc032/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc032.c"],"tags":[]},{"location":"semester_1/letusc/luc032/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc032.c"],"tags":[]},{"location":"semester_1/letusc/luc033/","level":1,"title":"<code>luc033.c</code>","text":"<p>Problem Statement</p> <p>Write a program to find the range of a set of numbers entered through the keyboard. Range is the difference between the smallest and biggest number in the list.</p>","path":["Semester 1","Letusc","luc033.c"],"tags":[]},{"location":"semester_1/letusc/luc033/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc033.c"],"tags":[]},{"location":"semester_1/letusc/luc033/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc033.c"],"tags":[]},{"location":"semester_1/letusc/luc033/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc033.c"],"tags":[]},{"location":"semester_1/letusc/luc034/","level":1,"title":"<code>luc034.c</code>","text":"<p>Problem Statement</p> <p>Write a program to print the multiplication table of the number entered by the user. The table should get displayed in the following form : 29 * 1 = 29 29 * 2 = 58</p>","path":["Semester 1","Letusc","luc034.c"],"tags":[]},{"location":"semester_1/letusc/luc034/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc034.c"],"tags":[]},{"location":"semester_1/letusc/luc034/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc034.c"],"tags":[]},{"location":"semester_1/letusc/luc034/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc034.c"],"tags":[]},{"location":"semester_1/letusc/luc035/","level":1,"title":"<code>luc035.c</code>","text":"<p>Problem Statement</p> <p>According to a study, the approximate level of intelligence of a person can be calculated using the following formula. i = 2 + (y + 0.5x) write a program that will produce a table of values of i, y and x, where y varies from 1 to 6, and, for each value of y, x varies from 5.5 to 12.5 in steps of 0.5</p>","path":["Semester 1","Letusc","luc035.c"],"tags":[]},{"location":"semester_1/letusc/luc035/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc035.c"],"tags":[]},{"location":"semester_1/letusc/luc035/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc035.c"],"tags":[]},{"location":"semester_1/letusc/luc035/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc035.c"],"tags":[]},{"location":"semester_1/letusc/luc036/","level":1,"title":"<code>luc036.c</code>","text":"<p>Problem Statement</p> <p>When interest compounds q times per year at an annual rate of r % for n years, the principle p compounds to an amount a as per the following formula a = p (1 + r / q) ^ nq Write a program to read 10 sets of p, r, n & q and calculate the corresponding as'</p>","path":["Semester 1","Letusc","luc036.c"],"tags":[]},{"location":"semester_1/letusc/luc036/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc036.c"],"tags":[]},{"location":"semester_1/letusc/luc036/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc036.c"],"tags":[]},{"location":"semester_1/letusc/luc036/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc036.c"],"tags":[]},{"location":"semester_1/letusc/luc037/","level":1,"title":"<code>luc037.c</code>","text":"<p>Problem Statement</p> <p>The natural logarithm can be approximated by the following series. (x-1)/x + 1/2 ((x-1)/x)^2 + 1/2 ((x-1)/x)^3 + 1/2 ((x-1)/x)^4 + ... If x is input through the keyboard, write a program to calculate the sum of the first seven terms of this series.</p>","path":["Semester 1","Letusc","luc037.c"],"tags":[]},{"location":"semester_1/letusc/luc037/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc037.c"],"tags":[]},{"location":"semester_1/letusc/luc037/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc037.c"],"tags":[]},{"location":"semester_1/letusc/luc037/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc037.c"],"tags":[]},{"location":"semester_1/letusc/luc038/","level":1,"title":"<code>luc038.c</code>","text":"<p>Problem Statement</p> <p>Write a program to generate all Pythagorean Triplets with slide length less than or equal to 30.</p>","path":["Semester 1","Letusc","luc038.c"],"tags":[]},{"location":"semester_1/letusc/luc038/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc038.c"],"tags":[]},{"location":"semester_1/letusc/luc038/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc038.c"],"tags":[]},{"location":"semester_1/letusc/luc038/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc038.c"],"tags":[]},{"location":"semester_1/letusc/luc039/","level":1,"title":"<code>luc039.c</code>","text":"<p>Problem Statement</p> <p>Population of a town today is 100000. The population has increased steadily at the rate of 10% per year for last 10 years. Write a program to determine the population at the end of each year in the last decade.</p>","path":["Semester 1","Letusc","luc039.c"],"tags":[]},{"location":"semester_1/letusc/luc039/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc039.c"],"tags":[]},{"location":"semester_1/letusc/luc039/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc039.c"],"tags":[]},{"location":"semester_1/letusc/luc039/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc039.c"],"tags":[]},{"location":"semester_1/letusc/luc040-logic/","level":1,"title":"<code>luc040-logic.c</code>","text":"<p>Problem Statement</p> <p>Ramanujan number (1729) is the smallest number that can be expressed as sum of cubes in two different ways - 1729 can be expressed as 1^3 + 12^3 and 9^3 + 10^3. Write a program to print all such numbers up to a reasonable limit.</p>","path":["Semester 1","Letusc","luc040-logic.c"],"tags":[]},{"location":"semester_1/letusc/luc040-logic/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc040-logic.c"],"tags":[]},{"location":"semester_1/letusc/luc040-logic/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc040-logic.c"],"tags":[]},{"location":"semester_1/letusc/luc040-logic/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc040-logic.c"],"tags":[]},{"location":"semester_1/letusc/luc040/","level":1,"title":"<code>luc040.c</code>","text":"<p>Problem Statement</p> <p>Ramanujan number (1729) is the smallest number that can be expressed as sum of cubes in two different ways - 1729 can be expressed as 1^3 + 12^3 and 9^3 + 10^3. Write a program to print all such numbers up to a reasonable limit.</p>","path":["Semester 1","Letusc","luc040.c"],"tags":[]},{"location":"semester_1/letusc/luc040/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc040.c"],"tags":[]},{"location":"semester_1/letusc/luc040/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc040.c"],"tags":[]},{"location":"semester_1/letusc/luc040/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc040.c"],"tags":[]},{"location":"semester_1/letusc/luc041/","level":1,"title":"<code>luc041.c</code>","text":"<p>Problem Statement</p> <p>Write a program to print 24 hours of day with suitable suffixes like AM, PM, Noon and Midnight.</p>","path":["Semester 1","Letusc","luc041.c"],"tags":[]},{"location":"semester_1/letusc/luc041/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc041.c"],"tags":[]},{"location":"semester_1/letusc/luc041/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc041.c"],"tags":[]},{"location":"semester_1/letusc/luc041/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc041.c"],"tags":[]},{"location":"semester_1/letusc/luc042/","level":1,"title":"<code>luc042.c</code>","text":"<p>Problem Statement</p> <p>Write a program to produce the following output : 1 2 3 4 5 6 7 8 9 10</p>","path":["Semester 1","Letusc","luc042.c"],"tags":[]},{"location":"semester_1/letusc/luc042/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc042.c"],"tags":[]},{"location":"semester_1/letusc/luc042/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc042.c"],"tags":[]},{"location":"semester_1/letusc/luc042/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc042.c"],"tags":[]},{"location":"semester_1/letusc/luc043/","level":1,"title":"<code>luc043.c</code>","text":"<p>Problem Statement</p> <p>Write a program to find the grace marks for a student using switch. The user should enter the class obtained by the student and the number of subjects he has failed in. Use the following logic. - If the student gets first class and he fails in more than 3 subjects, he does not get any grace, Otherwise, he gets a grace of 5 marks per subject. - If the student gets second class and he fails in more than 2 subjects, he does not get any grace. Otherwise, he gets a grace of 4 marks per subject. - If the student gets third class and he fails in more than 1 subject, then he does not get any grace. Otherwise, he gets a grace of 5 marks.</p>","path":["Semester 1","Letusc","luc043.c"],"tags":[]},{"location":"semester_1/letusc/luc043/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc043.c"],"tags":[]},{"location":"semester_1/letusc/luc043/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc043.c"],"tags":[]},{"location":"semester_1/letusc/luc043/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc043.c"],"tags":[]},{"location":"semester_1/letusc/luc044/","level":1,"title":"<code>luc044.c</code>","text":"<p>Problem Statement</p> <p>Any year is entered through the keyboard. Write a function to determine whether the year is aleap year or not.</p>","path":["Semester 1","Letusc","luc044.c"],"tags":[]},{"location":"semester_1/letusc/luc044/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc044.c"],"tags":[]},{"location":"semester_1/letusc/luc044/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc044.c"],"tags":[]},{"location":"semester_1/letusc/luc044/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc044.c"],"tags":[]},{"location":"semester_1/letusc/luc045/","level":1,"title":"<code>luc045.c</code>","text":"<p>Problem Statement</p> <p>A position integer is entered through the keyboard. Write a Function to obtain the prime factors of this number. For example, prime factors of 24 are 2, 2, 2 and 3, whereas prime factors of 35 are 5 and 7</p>","path":["Semester 1","Letusc","luc045.c"],"tags":[]},{"location":"semester_1/letusc/luc045/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc045.c"],"tags":[]},{"location":"semester_1/letusc/luc045/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc045.c"],"tags":[]},{"location":"semester_1/letusc/luc045/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc045.c"],"tags":[]},{"location":"semester_1/letusc/luc046/","level":1,"title":"<code>luc046.c</code>","text":"<p>Problem Statement</p> <p>Given three variables x, y, z, write a function to circularly shift their values to right. In other words, if x = 5, y = 8, z = 10, after circular shift y = 5, z = 8, x = 10. cal the function with variables a, b, c to circularly shift values.</p>","path":["Semester 1","Letusc","luc046.c"],"tags":[]},{"location":"semester_1/letusc/luc046/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc046.c"],"tags":[]},{"location":"semester_1/letusc/luc046/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc046.c"],"tags":[]},{"location":"semester_1/letusc/luc046/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc046.c"],"tags":[]},{"location":"semester_1/letusc/luc047/","level":1,"title":"<code>luc047.c</code>","text":"<p>Problem Statement</p> <p>Define a function that receives weight of a commodity in kilograms and returns the equivalent weight in Grams, Tons and pounds. Call this fuction from main() and print the results in main()</p>","path":["Semester 1","Letusc","luc047.c"],"tags":[]},{"location":"semester_1/letusc/luc047/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","luc047.c"],"tags":[]},{"location":"semester_1/letusc/luc047/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc047.c"],"tags":[]},{"location":"semester_1/letusc/luc047/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc047.c"],"tags":[]},{"location":"semester_1/letusc/luc048/","level":1,"title":"<code>luc048.c</code>","text":"<p>Problem Statement</p> <p>Define a function to compute the distance between two points and use it to develop another function that will compute the area of the triangle whose vertices are A(x1, y1), B(x2, y2), and C(x3, y3). Use these functions to develop a function which returns a value 1 if the point (x, y) lines inside the triangle ABC, otherwise returns a value 0. Would you get any advantage if you develop these functions to work on call by reference principle?</p>","path":["Semester 1","Letusc","luc048.c"],"tags":[]},{"location":"semester_1/letusc/luc048/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc048.c"],"tags":[]},{"location":"semester_1/letusc/luc048/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc048.c"],"tags":[]},{"location":"semester_1/letusc/luc048/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc048.c"],"tags":[]},{"location":"semester_1/letusc/luc049/","level":1,"title":"<code>luc049.c</code>","text":"<p>Problem Statement</p> <p>A positive integer is entered through the keyboard, write a function to find the binary equivalent of this number: (1) Without using recursion (2) Using recursion</p>","path":["Semester 1","Letusc","luc049.c"],"tags":[]},{"location":"semester_1/letusc/luc049/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc049.c"],"tags":[]},{"location":"semester_1/letusc/luc049/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc049.c"],"tags":[]},{"location":"semester_1/letusc/luc049/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc049.c"],"tags":[]},{"location":"semester_1/letusc/luc050/","level":1,"title":"<code>luc050.c</code>","text":"<p>Problem Statement</p> <p>Write a recursive function to obtain the sum of first 25 natural numbers.</p>","path":["Semester 1","Letusc","luc050.c"],"tags":[]},{"location":"semester_1/letusc/luc050/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc050.c"],"tags":[]},{"location":"semester_1/letusc/luc050/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc050.c"],"tags":[]},{"location":"semester_1/letusc/luc050/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc050.c"],"tags":[]},{"location":"semester_1/letusc/luc051/","level":1,"title":"<code>luc051.c</code>","text":"<p>Problem Statement</p> <p>Tower of Hanoi: Write a program to print out the sequence in which 4 disks should be moved from peg A to peg C using peg B.</p>","path":["Semester 1","Letusc","luc051.c"],"tags":[]},{"location":"semester_1/letusc/luc051/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc051.c"],"tags":[]},{"location":"semester_1/letusc/luc051/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc051.c"],"tags":[]},{"location":"semester_1/letusc/luc051/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc051.c"],"tags":[]},{"location":"semester_1/letusc/luc052/","level":1,"title":"<code>luc052.c</code>","text":"<p>Problem Statement</p> <p>If a macro is not getting expanded as per your expectation, how will you find out how is it being expanded by the preprocessor?</p>","path":["Semester 1","Letusc","luc052.c"],"tags":[]},{"location":"semester_1/letusc/luc052/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc052.c"],"tags":[]},{"location":"semester_1/letusc/luc052/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc052.c"],"tags":[]},{"location":"semester_1/letusc/luc052/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc052.c"],"tags":[]},{"location":"semester_1/letusc/luc053/","level":1,"title":"<code>luc053.c</code>","text":"<p>Problem Statement</p> <p>Write macro definitions for: Mean, Absolute value, Uppercase to Lowercase, Biggest of three.</p>","path":["Semester 1","Letusc","luc053.c"],"tags":[]},{"location":"semester_1/letusc/luc053/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc053.c"],"tags":[]},{"location":"semester_1/letusc/luc053/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc053.c"],"tags":[]},{"location":"semester_1/letusc/luc053/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc053.c"],"tags":[]},{"location":"semester_1/letusc/luc054/","level":1,"title":"<code>luc054.c</code>","text":"<p>Problem Statement</p> <p>Use 'interest.h' macros to calculate Simple Interest and Amount.</p>","path":["Semester 1","Letusc","luc054.c"],"tags":[]},{"location":"semester_1/letusc/luc054/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc054.c"],"tags":[]},{"location":"semester_1/letusc/luc054/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc054.c"],"tags":[]},{"location":"semester_1/letusc/luc054/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc054.c"],"tags":[]},{"location":"semester_1/letusc/luc055/","level":1,"title":"<code>luc055.c</code>","text":"<p>Problem Statement</p> <p>Twenty-five numbers are entered from the keyboard into an array. Write a program to find out how many of them are positive, how many are negative, how many are even and how many odd.</p>","path":["Semester 1","Letusc","luc055.c"],"tags":[]},{"location":"semester_1/letusc/luc055/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc055.c"],"tags":[]},{"location":"semester_1/letusc/luc055/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc055.c"],"tags":[]},{"location":"semester_1/letusc/luc055/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc055.c"],"tags":[]},{"location":"semester_1/letusc/luc056/","level":1,"title":"<code>luc056.c</code>","text":"<p>Problem Statement</p> <p>If an array arr contains n elements, then write a program to check if arr[0] = arr[n-1], arr[1] = arr[n-2] and so on.</p>","path":["Semester 1","Letusc","luc056.c"],"tags":[]},{"location":"semester_1/letusc/luc056/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc056.c"],"tags":[]},{"location":"semester_1/letusc/luc056/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc056.c"],"tags":[]},{"location":"semester_1/letusc/luc056/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc056.c"],"tags":[]},{"location":"semester_1/letusc/luc057/","level":1,"title":"<code>luc057.c</code>","text":"<p>Problem Statement</p> <p>Write a program using pointers to find the smallest number in an array of 25 integers.</p>","path":["Semester 1","Letusc","luc057.c"],"tags":[]},{"location":"semester_1/letusc/luc057/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc057.c"],"tags":[]},{"location":"semester_1/letusc/luc057/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc057.c"],"tags":[]},{"location":"semester_1/letusc/luc057/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc057.c"],"tags":[]},{"location":"semester_1/letusc/luc058/","level":1,"title":"<code>luc058.c</code>","text":"<p>Problem Statement</p> <p>Implement the Insertion Sort algorithm shown in Figure 13.3 on a set of 25 numbers.</p>","path":["Semester 1","Letusc","luc058.c"],"tags":[]},{"location":"semester_1/letusc/luc058/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc058.c"],"tags":[]},{"location":"semester_1/letusc/luc058/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc058.c"],"tags":[]},{"location":"semester_1/letusc/luc058/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc058.c"],"tags":[]},{"location":"semester_1/letusc/luc059/","level":1,"title":"<code>luc059.c</code>","text":"<p>Problem Statement</p> <p>Write a program which initializes an integer array of 10 elements in main(), passes it to modify(), multiplies each element by 3, and prints the new array in main().</p>","path":["Semester 1","Letusc","luc059.c"],"tags":[]},{"location":"semester_1/letusc/luc059/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc059.c"],"tags":[]},{"location":"semester_1/letusc/luc059/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc059.c"],"tags":[]},{"location":"semester_1/letusc/luc059/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc059.c"],"tags":[]},{"location":"semester_1/letusc/luc060/","level":1,"title":"<code>luc060.c</code>","text":"<p>Problem Statement</p> <p>For the following set of sample data, compute the standard deviation and the mean.\\nData: -6, -12, 8, 13, 11, 6, 7, 2, -6, -9, -10, 11, 10, 9, 2</p>","path":["Semester 1","Letusc","luc060.c"],"tags":[]},{"location":"semester_1/letusc/luc060/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc060.c"],"tags":[]},{"location":"semester_1/letusc/luc060/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc060.c"],"tags":[]},{"location":"semester_1/letusc/luc060/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc060.c"],"tags":[]},{"location":"semester_1/letusc/luc061/","level":1,"title":"<code>luc061.c</code>","text":"<p>Problem Statement</p> <p>The area of a triangle can be computed by the sine law. Given 6 triangular pieces of land (a, b, angle), find their area and determine which is largest.</p>","path":["Semester 1","Letusc","luc061.c"],"tags":[]},{"location":"semester_1/letusc/luc061/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc061.c"],"tags":[]},{"location":"semester_1/letusc/luc061/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc061.c"],"tags":[]},{"location":"semester_1/letusc/luc061/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc061.c"],"tags":[]},{"location":"semester_1/letusc/luc062/","level":1,"title":"<code>luc062.c</code>","text":"<p>Problem Statement</p> <p>For the following set of n data points (x, y), write a program to compute the correlation coefficient r.</p>","path":["Semester 1","Letusc","luc062.c"],"tags":[]},{"location":"semester_1/letusc/luc062/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc062.c"],"tags":[]},{"location":"semester_1/letusc/luc062/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc062.c"],"tags":[]},{"location":"semester_1/letusc/luc062/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc062.c"],"tags":[]},{"location":"semester_1/letusc/luc063/","level":1,"title":"<code>luc063.c</code>","text":"<p>Problem Statement</p> <p>The X and Y coordinates of 10 different points are entered through the keyboard. Write a program to find the distance of last point from the first point (sum of distances between consecutive points).</p>","path":["Semester 1","Letusc","luc063.c"],"tags":[]},{"location":"semester_1/letusc/luc063/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc063.c"],"tags":[]},{"location":"semester_1/letusc/luc063/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc063.c"],"tags":[]},{"location":"semester_1/letusc/luc063/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc063.c"],"tags":[]},{"location":"semester_1/letusc/luc064/","level":1,"title":"<code>luc064.c</code>","text":"<p>Problem Statement</p> <p>Simulate a Dequeue (Double Ended Queue) using an array. Support: retrieve left, retrieve right, insert left, insert right. Use pointers left and right.</p>","path":["Semester 1","Letusc","luc064.c"],"tags":[]},{"location":"semester_1/letusc/luc064/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc064.c"],"tags":[]},{"location":"semester_1/letusc/luc064/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc064.c"],"tags":[]},{"location":"semester_1/letusc/luc064/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc064.c"],"tags":[]},{"location":"semester_1/letusc/luc065/","level":1,"title":"<code>luc065.c</code>","text":"<p>Problem Statement</p> <p>Write a program to find if a square matrix is symmetric.</p>","path":["Semester 1","Letusc","luc065.c"],"tags":[]},{"location":"semester_1/letusc/luc065/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc065.c"],"tags":[]},{"location":"semester_1/letusc/luc065/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc065.c"],"tags":[]},{"location":"semester_1/letusc/luc065/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc065.c"],"tags":[]},{"location":"semester_1/letusc/luc066/","level":1,"title":"<code>luc066.c</code>","text":"<p>Problem Statement</p> <p>Write a program to add two 6 x 6 matrices.</p>","path":["Semester 1","Letusc","luc066.c"],"tags":[]},{"location":"semester_1/letusc/luc066/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc066.c"],"tags":[]},{"location":"semester_1/letusc/luc066/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc066.c"],"tags":[]},{"location":"semester_1/letusc/luc066/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc066.c"],"tags":[]},{"location":"semester_1/letusc/luc067/","level":1,"title":"<code>luc067.c</code>","text":"<p>Problem Statement</p> <p>Write a program to multiply any two 3 x 3 matrices.</p>","path":["Semester 1","Letusc","luc067.c"],"tags":[]},{"location":"semester_1/letusc/luc067/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc067.c"],"tags":[]},{"location":"semester_1/letusc/luc067/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc067.c"],"tags":[]},{"location":"semester_1/letusc/luc067/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc067.c"],"tags":[]},{"location":"semester_1/letusc/luc068/","level":1,"title":"<code>luc068.c</code>","text":"<p>Problem Statement</p> <p>Given an array p[5], write a function to shift it circularly left by two positions. Call this function for a 4 x 5 matrix and get its rows left shifted.</p>","path":["Semester 1","Letusc","luc068.c"],"tags":[]},{"location":"semester_1/letusc/luc068/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc068.c"],"tags":[]},{"location":"semester_1/letusc/luc068/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc068.c"],"tags":[]},{"location":"semester_1/letusc/luc068/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc068.c"],"tags":[]},{"location":"semester_1/letusc/luc069/","level":1,"title":"<code>luc069.c</code>","text":"<p>Problem Statement</p> <p>If the string \"Alice in wonder land\" is fed to the following scanf() statement, what will be the contents of arrays str1, str2, str3 and str4?</p>","path":["Semester 1","Letusc","luc069.c"],"tags":[]},{"location":"semester_1/letusc/luc069/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc069.c"],"tags":[]},{"location":"semester_1/letusc/luc069/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc069.c"],"tags":[]},{"location":"semester_1/letusc/luc069/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc069.c"],"tags":[]},{"location":"semester_1/letusc/luc070/","level":1,"title":"<code>luc070.c</code>","text":"<p>Problem Statement</p> <p>Write a program that receives a 10-digit ISBN number, computes the checksum (d1 + 2d2 + 3d3 + ... + 10d10), and reports whether the ISBN number is correct (sum divisible by 11).</p>","path":["Semester 1","Letusc","luc070.c"],"tags":[]},{"location":"semester_1/letusc/luc070/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc070.c"],"tags":[]},{"location":"semester_1/letusc/luc070/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc070.c"],"tags":[]},{"location":"semester_1/letusc/luc070/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc070.c"],"tags":[]},{"location":"semester_1/letusc/luc071/","level":1,"title":"<code>luc071.c</code>","text":"<p>Problem Statement</p> <p>Write a program that receives a 16-digit Credit Card number and checks whether it is valid using the Luhn algorithm variant described.</p>","path":["Semester 1","Letusc","luc071.c"],"tags":[]},{"location":"semester_1/letusc/luc071/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc071.c"],"tags":[]},{"location":"semester_1/letusc/luc071/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc071.c"],"tags":[]},{"location":"semester_1/letusc/luc071/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc071.c"],"tags":[]},{"location":"semester_1/letusc/luc072/","level":1,"title":"<code>luc072.c</code>","text":"<p>Problem Statement</p> <p>How many bytes in memory would be occupied by the following array of pointers to strings? How many bytes would be required to store the same strings in a two-dimensional character array?</p>","path":["Semester 1","Letusc","luc072.c"],"tags":[]},{"location":"semester_1/letusc/luc072/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc072.c"],"tags":[]},{"location":"semester_1/letusc/luc072/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc072.c"],"tags":[]},{"location":"semester_1/letusc/luc072/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc072.c"],"tags":[]},{"location":"semester_1/letusc/luc073/","level":1,"title":"<code>luc073.c</code>","text":"<p>Problem Statement</p> <p>Write a program to delete all vowels from a sentence. Assume that the sentence is not more than 80 characters long.</p>","path":["Semester 1","Letusc","luc073.c"],"tags":[]},{"location":"semester_1/letusc/luc073/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc073.c"],"tags":[]},{"location":"semester_1/letusc/luc073/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc073.c"],"tags":[]},{"location":"semester_1/letusc/luc073/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc073.c"],"tags":[]},{"location":"semester_1/letusc/luc074/","level":1,"title":"<code>luc074.c</code>","text":"<p>Problem Statement</p> <p>Write a program that will read a line and delete from it all occurrences of the word 'the'.</p>","path":["Semester 1","Letusc","luc074.c"],"tags":[]},{"location":"semester_1/letusc/luc074/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc074.c"],"tags":[]},{"location":"semester_1/letusc/luc074/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc074.c"],"tags":[]},{"location":"semester_1/letusc/luc074/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc074.c"],"tags":[]},{"location":"semester_1/letusc/luc075/","level":1,"title":"<code>luc075.c</code>","text":"<p>Problem Statement</p> <p>Write a program that stores a set of names of individuals and abbreviates the first and middle name to their first letter.</p>","path":["Semester 1","Letusc","luc075.c"],"tags":[]},{"location":"semester_1/letusc/luc075/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc075.c"],"tags":[]},{"location":"semester_1/letusc/luc075/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc075.c"],"tags":[]},{"location":"semester_1/letusc/luc075/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc075.c"],"tags":[]},{"location":"semester_1/letusc/luc076/","level":1,"title":"<code>luc076.c</code>","text":"<p>Problem Statement</p> <p>Write a program to count the number of occurrences of any two vowels in succession in a line of text.</p>","path":["Semester 1","Letusc","luc076.c"],"tags":[]},{"location":"semester_1/letusc/luc076/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc076.c"],"tags":[]},{"location":"semester_1/letusc/luc076/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc076.c"],"tags":[]},{"location":"semester_1/letusc/luc076/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc076.c"],"tags":[]},{"location":"semester_1/letusc/luc077/","level":1,"title":"<code>luc077.c</code>","text":"<p>Problem Statement</p> <p>Write a program that receives an integer (less than or equal to nine digits in length) and prints out the number in words.</p>","path":["Semester 1","Letusc","luc077.c"],"tags":[]},{"location":"semester_1/letusc/luc077/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc077.c"],"tags":[]},{"location":"semester_1/letusc/luc077/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc077.c"],"tags":[]},{"location":"semester_1/letusc/luc077/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc077.c"],"tags":[]},{"location":"semester_1/letusc/luc078/","level":1,"title":"<code>luc078.c</code>","text":"<p>Problem Statement</p> <p>Create a structure 'student' (Roll, Name, Dept, Course, Year). Write functions to print names by join year and print data by roll number.</p>","path":["Semester 1","Letusc","luc078.c"],"tags":[]},{"location":"semester_1/letusc/luc078/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc078.c"],"tags":[]},{"location":"semester_1/letusc/luc078/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc078.c"],"tags":[]},{"location":"semester_1/letusc/luc078/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc078.c"],"tags":[]},{"location":"semester_1/letusc/luc079/","level":1,"title":"<code>luc079.c</code>","text":"<p>Problem Statement</p> <p>Create a structure for bank customers (Acc no, Name, Balance). Write functions to print low balance customers and handle deposits/withdrawals.</p>","path":["Semester 1","Letusc","luc079.c"],"tags":[]},{"location":"semester_1/letusc/luc079/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc079.c"],"tags":[]},{"location":"semester_1/letusc/luc079/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc079.c"],"tags":[]},{"location":"semester_1/letusc/luc079/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc079.c"],"tags":[]},{"location":"semester_1/letusc/luc080/","level":1,"title":"<code>luc080.c</code>","text":"<p>Problem Statement</p> <p>Automobile engine parts (Serial AA0-FF9, Year, Material, Qty). Retrieve parts between serial numbers BB1 and CC6.</p>","path":["Semester 1","Letusc","luc080.c"],"tags":[]},{"location":"semester_1/letusc/luc080/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc080.c"],"tags":[]},{"location":"semester_1/letusc/luc080/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc080.c"],"tags":[]},{"location":"semester_1/letusc/luc080/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc080.c"],"tags":[]},{"location":"semester_1/letusc/luc081/","level":1,"title":"<code>luc081.c</code>","text":"<p>Problem Statement</p> <p>Create structure for Cricketers (Name, Age, Tests, Avg Runs). Sort 20 records by average runs using qsort().</p>","path":["Semester 1","Letusc","luc081.c"],"tags":[]},{"location":"semester_1/letusc/luc081/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc081.c"],"tags":[]},{"location":"semester_1/letusc/luc081/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc081.c"],"tags":[]},{"location":"semester_1/letusc/luc081/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc081.c"],"tags":[]},{"location":"semester_1/letusc/luc082/","level":1,"title":"<code>luc082.c</code>","text":"<p>Problem Statement</p> <p>Structure 'employee' (Code, Name, Date of Joining). Display names of employees with tenure >= 3 years.</p>","path":["Semester 1","Letusc","luc082.c"],"tags":[]},{"location":"semester_1/letusc/luc082/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc082.c"],"tags":[]},{"location":"semester_1/letusc/luc082/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc082.c"],"tags":[]},{"location":"semester_1/letusc/luc082/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc082.c"],"tags":[]},{"location":"semester_1/letusc/luc083/","level":1,"title":"<code>luc083.c</code>","text":"<p>Problem Statement</p> <p>Library menu-driven program (Add, Display, List by Author, List by Title, Count, List sorted).</p>","path":["Semester 1","Letusc","luc083.c"],"tags":[]},{"location":"semester_1/letusc/luc083/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc083.c"],"tags":[]},{"location":"semester_1/letusc/luc083/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc083.c"],"tags":[]},{"location":"semester_1/letusc/luc083/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc083.c"],"tags":[]},{"location":"semester_1/letusc/luc084/","level":1,"title":"<code>luc084.c</code>","text":"<p>Problem Statement</p> <p>Define a function that compares two given dates. Return 0 if equal, otherwise return 1.</p>","path":["Semester 1","Letusc","luc084.c"],"tags":[]},{"location":"semester_1/letusc/luc084/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc084.c"],"tags":[]},{"location":"semester_1/letusc/luc084/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc084.c"],"tags":[]},{"location":"semester_1/letusc/luc084/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc084.c"],"tags":[]},{"location":"semester_1/letusc/luc085/","level":1,"title":"<code>luc085.c</code>","text":"<p>Problem Statement</p> <p>Suppose a file contains student records (Name, Age). Write a program to read these records and display them in sorted order by name.</p>","path":["Semester 1","Letusc","luc085.c"],"tags":[]},{"location":"semester_1/letusc/luc085/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc085.c"],"tags":[]},{"location":"semester_1/letusc/luc085/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc085.c"],"tags":[]},{"location":"semester_1/letusc/luc085/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc085.c"],"tags":[]},{"location":"semester_1/letusc/luc086/","level":1,"title":"<code>luc086.c</code>","text":"<p>Problem Statement</p> <p>Write a program to copy contents of one file to another. While doing so replace all lowercase characters to their equivalent uppercase characters.</p>","path":["Semester 1","Letusc","luc086.c"],"tags":[]},{"location":"semester_1/letusc/luc086/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc086.c"],"tags":[]},{"location":"semester_1/letusc/luc086/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc086.c"],"tags":[]},{"location":"semester_1/letusc/luc086/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc086.c"],"tags":[]},{"location":"semester_1/letusc/luc087/","level":1,"title":"<code>luc087.c</code>","text":"<p>Problem Statement</p> <p>Write a program that merges lines alternately from two files and writes the results to a new file. Handle remaining lines if file sizes differ.</p>","path":["Semester 1","Letusc","luc087.c"],"tags":[]},{"location":"semester_1/letusc/luc087/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc087.c"],"tags":[]},{"location":"semester_1/letusc/luc087/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc087.c"],"tags":[]},{"location":"semester_1/letusc/luc087/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc087.c"],"tags":[]},{"location":"semester_1/letusc/luc088/","level":1,"title":"<code>luc088.c</code>","text":"<p>Problem Statement</p> <p>Write a program to encrypt/decrypt a file using: (1) Offset cipher (2) Substitution cipher.</p>","path":["Semester 1","Letusc","luc088.c"],"tags":[]},{"location":"semester_1/letusc/luc088/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc088.c"],"tags":[]},{"location":"semester_1/letusc/luc088/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc088.c"],"tags":[]},{"location":"semester_1/letusc/luc088/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc088.c"],"tags":[]},{"location":"semester_1/letusc/luc089/","level":1,"title":"<code>luc089.c</code>","text":"<p>Problem Statement</p> <p>Update 'CUSTOMER.DAT' balance using 'TRANSACTIONS.DAT' (Deposit/Withdrawal). Ensure balance doesn't fall below Rs. 100 on withdrawal.</p>","path":["Semester 1","Letusc","luc089.c"],"tags":[]},{"location":"semester_1/letusc/luc089/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc089.c"],"tags":[]},{"location":"semester_1/letusc/luc089/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc089.c"],"tags":[]},{"location":"semester_1/letusc/luc089/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc089.c"],"tags":[]},{"location":"semester_1/letusc/luc090/","level":1,"title":"<code>luc090.c</code>","text":"<p>Problem Statement</p> <p>Read employee records (code, name, date, salary), sort them by Date of Joining, and write to a target file.</p>","path":["Semester 1","Letusc","luc090.c"],"tags":[]},{"location":"semester_1/letusc/luc090/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc090.c"],"tags":[]},{"location":"semester_1/letusc/luc090/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc090.c"],"tags":[]},{"location":"semester_1/letusc/luc090/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc090.c"],"tags":[]},{"location":"semester_1/letusc/luc091/","level":1,"title":"<code>luc091.c</code>","text":"<p>Problem Statement</p> <p>Read 'blood donors' file (Name, Address, Age, Blood Type). Print donors with Age < 25 and Blood Type 2.</p>","path":["Semester 1","Letusc","luc091.c"],"tags":[]},{"location":"semester_1/letusc/luc091/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc091.c"],"tags":[]},{"location":"semester_1/letusc/luc091/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc091.c"],"tags":[]},{"location":"semester_1/letusc/luc091/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc091.c"],"tags":[]},{"location":"semester_1/letusc/luc092/","level":1,"title":"<code>luc092.c</code>","text":"<p>Problem Statement</p> <p>Write a program to store names in a file. Display the n-th name in the list, where n is read from the keyboard.</p>","path":["Semester 1","Letusc","luc092.c"],"tags":[]},{"location":"semester_1/letusc/luc092/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc092.c"],"tags":[]},{"location":"semester_1/letusc/luc092/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc092.c"],"tags":[]},{"location":"semester_1/letusc/luc092/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc092.c"],"tags":[]},{"location":"semester_1/letusc/luc093/","level":1,"title":"<code>luc093.c</code>","text":"<p>Problem Statement</p> <p>Update Master file (Roll, Name) using Transaction file (Roll, Code Add/Delete). Both files are sorted by Roll.</p>","path":["Semester 1","Letusc","luc093.c"],"tags":[]},{"location":"semester_1/letusc/luc093/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc093.c"],"tags":[]},{"location":"semester_1/letusc/luc093/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc093.c"],"tags":[]},{"location":"semester_1/letusc/luc093/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc093.c"],"tags":[]},{"location":"semester_1/letusc/luc094/","level":1,"title":"<code>luc094.c</code>","text":"<p>Problem Statement</p> <p>Read a text file, delete the words 'a', 'the', 'an' and replace each with a blank space. Write to new file.</p>","path":["Semester 1","Letusc","luc094.c"],"tags":[]},{"location":"semester_1/letusc/luc094/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc094.c"],"tags":[]},{"location":"semester_1/letusc/luc094/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc094.c"],"tags":[]},{"location":"semester_1/letusc/luc094/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc094.c"],"tags":[]},{"location":"semester_1/letusc/luc095/","level":1,"title":"<code>luc095.c</code>","text":"<p>Problem Statement</p> <p>Write a program that can read a file and display its contents. The file name should be supplied as a command-line argument.</p>","path":["Semester 1","Letusc","luc095.c"],"tags":[]},{"location":"semester_1/letusc/luc095/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc095.c"],"tags":[]},{"location":"semester_1/letusc/luc095/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc095.c"],"tags":[]},{"location":"semester_1/letusc/luc095/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc095.c"],"tags":[]},{"location":"semester_1/letusc/luc096/","level":1,"title":"<code>luc096.c</code>","text":"<p>Problem Statement</p> <p>Write a program that can copy the contents of one file to another. The source and target filenames should be supplied as command-line arguments.</p>","path":["Semester 1","Letusc","luc096.c"],"tags":[]},{"location":"semester_1/letusc/luc096/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc096.c"],"tags":[]},{"location":"semester_1/letusc/luc096/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc096.c"],"tags":[]},{"location":"semester_1/letusc/luc096/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc096.c"],"tags":[]},{"location":"semester_1/letusc/luc097/","level":1,"title":"<code>luc097.c</code>","text":"<p>Problem Statement</p> <p>Write a program using command-line arguments to search for a word in a file and replace it with the specified word.\\nUsage: change","path":["Semester 1","Letusc","luc097.c"],"tags":[]},{"location":"semester_1/letusc/luc097/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc097.c"],"tags":[]},{"location":"semester_1/letusc/luc097/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc097.c"],"tags":[]},{"location":"semester_1/letusc/luc097/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc097.c"],"tags":[]},{"location":"semester_1/letusc/luc098/","level":1,"title":"<code>luc098.c</code>","text":"<p>Problem Statement</p> <p>Write a calculator utility using command line arguments.\\nUsage: calc \\nwhere switch is arithmetic operator or comparison operator.","path":["Semester 1","Letusc","luc098.c"],"tags":[]},{"location":"semester_1/letusc/luc098/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc098.c"],"tags":[]},{"location":"semester_1/letusc/luc098/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc098.c"],"tags":[]},{"location":"semester_1/letusc/luc098/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc098.c"],"tags":[]},{"location":"semester_1/letusc/luc099/","level":1,"title":"<code>luc099.c</code>","text":"<p>Problem Statement</p> <p>Read an integer 'game' representing sports won by a college. Determine if it won the 'Champion of Champions' trophy (>5 games) and list games won.</p>","path":["Semester 1","Letusc","luc099.c"],"tags":[]},{"location":"semester_1/letusc/luc099/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc099.c"],"tags":[]},{"location":"semester_1/letusc/luc099/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc099.c"],"tags":[]},{"location":"semester_1/letusc/luc099/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc099.c"],"tags":[]},{"location":"semester_1/letusc/luc100/","level":1,"title":"<code>luc100.c</code>","text":"<p>Problem Statement</p> <p>Determine if an animal is Carnivore/Herbivore and its type (Canine, Feline, Cetacean, Marsupial) based on bits in an integer.</p>","path":["Semester 1","Letusc","luc100.c"],"tags":[]},{"location":"semester_1/letusc/luc100/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc100.c"],"tags":[]},{"location":"semester_1/letusc/luc100/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc100.c"],"tags":[]},{"location":"semester_1/letusc/luc100/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc100.c"],"tags":[]},{"location":"semester_1/letusc/luc101/","level":1,"title":"<code>luc101.c</code>","text":"<p>Problem Statement</p> <p>Decode student information (Year, Stream, Room No) packed into an integer array.</p>","path":["Semester 1","Letusc","luc101.c"],"tags":[]},{"location":"semester_1/letusc/luc101/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc101.c"],"tags":[]},{"location":"semester_1/letusc/luc101/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc101.c"],"tags":[]},{"location":"semester_1/letusc/luc101/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc101.c"],"tags":[]},{"location":"semester_1/letusc/luc102/","level":1,"title":"<code>luc102.c</code>","text":"<p>Problem Statement</p> <p>What will be the output of the provided program segment involving bitwise operators?</p>","path":["Semester 1","Letusc","luc102.c"],"tags":[]},{"location":"semester_1/letusc/luc102/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc102.c"],"tags":[]},{"location":"semester_1/letusc/luc102/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc102.c"],"tags":[]},{"location":"semester_1/letusc/luc102/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc102.c"],"tags":[]},{"location":"semester_1/letusc/luc103/","level":1,"title":"<code>luc103.c</code>","text":"<p>Problem Statement</p> <p>What is the hexadecimal equivalent of the following binary numbers?</p>","path":["Semester 1","Letusc","luc103.c"],"tags":[]},{"location":"semester_1/letusc/luc103/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc103.c"],"tags":[]},{"location":"semester_1/letusc/luc103/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc103.c"],"tags":[]},{"location":"semester_1/letusc/luc103/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc103.c"],"tags":[]},{"location":"semester_1/letusc/luc104/","level":1,"title":"<code>luc104.c</code>","text":"<p>Problem Statement</p> <p>Rewrite expressions using bitwise compound assignment operators.</p>","path":["Semester 1","Letusc","luc104.c"],"tags":[]},{"location":"semester_1/letusc/luc104/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc104.c"],"tags":[]},{"location":"semester_1/letusc/luc104/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc104.c"],"tags":[]},{"location":"semester_1/letusc/luc104/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc104.c"],"tags":[]},{"location":"semester_1/letusc/luc105/","level":1,"title":"<code>luc105.c</code>","text":"<p>Problem Statement</p> <p>Write a function checkbits(x, p, n) which returns true if all 'n' bits starting from position 'p' are turned on.</p>","path":["Semester 1","Letusc","luc105.c"],"tags":[]},{"location":"semester_1/letusc/luc105/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc105.c"],"tags":[]},{"location":"semester_1/letusc/luc105/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc105.c"],"tags":[]},{"location":"semester_1/letusc/luc105/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc105.c"],"tags":[]},{"location":"semester_1/letusc/luc106/","level":1,"title":"<code>luc106.c</code>","text":"<p>Problem Statement</p> <p>Write a program to scan an 8-bit number and check whether its 3rd, 6th and 7th bit is on.</p>","path":["Semester 1","Letusc","luc106.c"],"tags":[]},{"location":"semester_1/letusc/luc106/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc106.c"],"tags":[]},{"location":"semester_1/letusc/luc106/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc106.c"],"tags":[]},{"location":"semester_1/letusc/luc106/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc106.c"],"tags":[]},{"location":"semester_1/letusc/luc107/","level":1,"title":"<code>luc107.c</code>","text":"<p>Problem Statement</p> <p>Receive an unsigned 16-bit integer and exchange the contents of its 2 bytes using bitwise operators.</p>","path":["Semester 1","Letusc","luc107.c"],"tags":[]},{"location":"semester_1/letusc/luc107/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc107.c"],"tags":[]},{"location":"semester_1/letusc/luc107/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc107.c"],"tags":[]},{"location":"semester_1/letusc/luc107/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc107.c"],"tags":[]},{"location":"semester_1/letusc/luc108/","level":1,"title":"<code>luc108.c</code>","text":"<p>Problem Statement</p> <p>Receive an 8-bit number and exchange its higher 4 bits with lower 4 bits.</p>","path":["Semester 1","Letusc","luc108.c"],"tags":[]},{"location":"semester_1/letusc/luc108/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc108.c"],"tags":[]},{"location":"semester_1/letusc/luc108/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc108.c"],"tags":[]},{"location":"semester_1/letusc/luc108/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc108.c"],"tags":[]},{"location":"semester_1/letusc/luc109/","level":1,"title":"<code>luc109.c</code>","text":"<p>Problem Statement</p> <p>Receive an 8-bit number and set its odd bits to 1.</p>","path":["Semester 1","Letusc","luc109.c"],"tags":[]},{"location":"semester_1/letusc/luc109/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc109.c"],"tags":[]},{"location":"semester_1/letusc/luc109/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc109.c"],"tags":[]},{"location":"semester_1/letusc/luc109/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc109.c"],"tags":[]},{"location":"semester_1/letusc/luc110/","level":1,"title":"<code>luc110.c</code>","text":"<p>Problem Statement</p> <p>Receive an 8-bit number. Check if 3rd and 5th bits are ON. If yes, put them OFF.</p>","path":["Semester 1","Letusc","luc110.c"],"tags":[]},{"location":"semester_1/letusc/luc110/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc110.c"],"tags":[]},{"location":"semester_1/letusc/luc110/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc110.c"],"tags":[]},{"location":"semester_1/letusc/luc110/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc110.c"],"tags":[]},{"location":"semester_1/letusc/luc111/","level":1,"title":"<code>luc111.c</code>","text":"<p>Problem Statement</p> <p>Receive an 8-bit number. Check if 3rd and 5th bits are OFF. If yes, put them ON.</p>","path":["Semester 1","Letusc","luc111.c"],"tags":[]},{"location":"semester_1/letusc/luc111/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc111.c"],"tags":[]},{"location":"semester_1/letusc/luc111/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc111.c"],"tags":[]},{"location":"semester_1/letusc/luc111/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc111.c"],"tags":[]},{"location":"semester_1/letusc/luc112/","level":1,"title":"<code>luc112.c</code>","text":"<p>Problem Statement</p> <p>Rewrite the showbits() function using the _BV macro.</p>","path":["Semester 1","Letusc","luc112.c"],"tags":[]},{"location":"semester_1/letusc/luc112/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc112.c"],"tags":[]},{"location":"semester_1/letusc/luc112/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc112.c"],"tags":[]},{"location":"semester_1/letusc/luc112/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc112.c"],"tags":[]},{"location":"semester_1/letusc/luc113/","level":1,"title":"<code>luc113.c</code>","text":"<p>Problem Statement</p> <p>Store date in a structure using bit fields (day: 5 bits, month: 4 bits, year: 12 bits). Read joining dates of 10 employees and display them sorted by year.</p>","path":["Semester 1","Letusc","luc113.c"],"tags":[]},{"location":"semester_1/letusc/luc113/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc113.c"],"tags":[]},{"location":"semester_1/letusc/luc113/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc113.c"],"tags":[]},{"location":"semester_1/letusc/luc113/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc113.c"],"tags":[]},{"location":"semester_1/letusc/luc114/","level":1,"title":"<code>luc114.c</code>","text":"<p>Problem Statement</p> <p>Store insurance policy holder info (gender, minor/major, policy name, duration) using bit-fields.</p>","path":["Semester 1","Letusc","luc114.c"],"tags":[]},{"location":"semester_1/letusc/luc114/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc114.c"],"tags":[]},{"location":"semester_1/letusc/luc114/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc114.c"],"tags":[]},{"location":"semester_1/letusc/luc114/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc114.c"],"tags":[]},{"location":"semester_1/letusc/luc115/","level":1,"title":"<code>luc115.c</code>","text":"<p>Problem Statement</p> <p>Obtain MD5 checksum of the following strings and check whether they are same: \"Six slippery snails slid slowly seaward.\" \"Six silppery snails slid slowly seaward.\"</p>","path":["Semester 1","Letusc","luc115.c"],"tags":[]},{"location":"semester_1/letusc/luc115/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc115.c"],"tags":[]},{"location":"semester_1/letusc/luc115/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc115.c"],"tags":[]},{"location":"semester_1/letusc/luc115/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc115.c"],"tags":[]},{"location":"semester_1/letusc/luc116/","level":1,"title":"<code>luc116.c</code>","text":"<p>Problem Statement</p> <p>Compile any C program into a .EXE or a .out file. Obtain SHA256 checksum of the file.</p>","path":["Semester 1","Letusc","luc116.c"],"tags":[]},{"location":"semester_1/letusc/luc116/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc116.c"],"tags":[]},{"location":"semester_1/letusc/luc116/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc116.c"],"tags":[]},{"location":"semester_1/letusc/luc116/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc116.c"],"tags":[]},{"location":"semester_1/letusc/luc117/","level":1,"title":"<code>luc117.c</code>","text":"<p>Problem Statement</p> <p>Write a program to convert a given text into an audio file using OpenAI Audio API (TTS).</p>","path":["Semester 1","Letusc","luc117.c"],"tags":[]},{"location":"semester_1/letusc/luc117/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc117.c"],"tags":[]},{"location":"semester_1/letusc/luc117/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc117.c"],"tags":[]},{"location":"semester_1/letusc/luc117/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc117.c"],"tags":[]},{"location":"semester_1/letusc/luc118/","level":1,"title":"<code>luc118.c</code>","text":"<p>Problem Statement</p> <p>Write a program to generate 4 images of birds flying in the sky with a computer's mouse in their beak using OpenAI Image API.</p>","path":["Semester 1","Letusc","luc118.c"],"tags":[]},{"location":"semester_1/letusc/luc118/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc118.c"],"tags":[]},{"location":"semester_1/letusc/luc118/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc118.c"],"tags":[]},{"location":"semester_1/letusc/luc118/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc118.c"],"tags":[]},{"location":"semester_1/letusc/luc119/","level":1,"title":"<code>luc119.c</code>","text":"<p>Problem Statement</p> <p>Write a program to analyse a given sentence to detect the mood of the sentence using OpenAI Chat Completion API.</p>","path":["Semester 1","Letusc","luc119.c"],"tags":[]},{"location":"semester_1/letusc/luc119/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 08 Feb 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","luc119.c"],"tags":[]},{"location":"semester_1/letusc/luc119/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","luc119.c"],"tags":[]},{"location":"semester_1/letusc/luc119/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","luc119.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem001/","level":1,"title":"<code>lucproblem001.c</code>","text":"<p>Problem Statement</p> <p>Consider a currency system in which there are notes of six denominations, namely, Rs. 1, Rs. 2, rs. 5, Rs. 10, Rs. 50, Rs. 100. If a sum of Rs. N is entered through the keyboard, Write a program to compute the smallest number of notes that will combine to give Rs. N.</p>","path":["Semester 1","Letusc","lucproblem001.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem001/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","lucproblem001.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem001/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","lucproblem001.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem001/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","lucproblem001.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem002/","level":1,"title":"<code>lucproblem002.c</code>","text":"<p>Problem Statement</p> <p>A year is entered through the keyboard, write a program to determine whether the year is leap or not. Use the logical operators && and || .</p>","path":["Semester 1","Letusc","lucproblem002.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem002/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","lucproblem002.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem002/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","lucproblem002.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem002/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","lucproblem002.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem003/","level":1,"title":"<code>lucproblem003.c</code>","text":"<p>Problem Statement</p> <p>If a character is entered through the keyboard, Write a program to determine whether the character is a capital letter, a small case letter, a digit or a speacial symbol. The following table shows the range of ASCII values for various characters : Characters ASCII Values A - Z 65 - 90 a - z 97 - 122 0 - 9 48 - 57 special symbols 0 - 47, 58 - 64, 91 - 96, 123 - 127</p>","path":["Semester 1","Letusc","lucproblem003.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem003/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","lucproblem003.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem003/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","lucproblem003.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem003/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","lucproblem003.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem004/","level":1,"title":"<code>lucproblem004.c</code>","text":"<p>Problem Statement</p> <p>If the lengths of three sides of a triangle are entered through the keyboard, write a program to check whether the triangle is valid or not. The triangle is valid if the sum of two sides is greater that the largest of the three sides.</p>","path":["Semester 1","Letusc","lucproblem004.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem004/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","lucproblem004.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem004/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","lucproblem004.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem004/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","lucproblem004.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem005/","level":1,"title":"<code>lucproblem005.c</code>","text":"<p>Problem Statement</p> <p>Write a program to calculate overtime pay of 10 employees. Overtime is paid at the rate of Rs. 120.00 per hour for every hour worked above 40 hours. Assume that employees do not work for fractional part of an hour.</p>","path":["Semester 1","Letusc","lucproblem005.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem005/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","lucproblem005.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem005/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","lucproblem005.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem005/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","lucproblem005.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem006/","level":1,"title":"<code>lucproblem006.c</code>","text":"<p>Problem Statement</p> <p>Write a program to find the factorial value of any number entered through the keyboard.</p>","path":["Semester 1","Letusc","lucproblem006.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem006/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","lucproblem006.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem006/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","lucproblem006.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem006/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","lucproblem006.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem007/","level":1,"title":"<code>lucproblem007.c</code>","text":"<p>Problem Statement</p> <p>Two numbers are entered through the keyboard. Write a program to find the value of one number raised to the power of another</p>","path":["Semester 1","Letusc","lucproblem007.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem007/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","lucproblem007.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem007/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","lucproblem007.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem007/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","lucproblem007.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem008/","level":1,"title":"<code>lucproblem008.c</code>","text":"<p>Problem Statement</p> <p>Write a problem to print all the prime numbers from 1 to 300.</p>","path":["Semester 1","Letusc","lucproblem008.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem008/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","lucproblem008.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem008/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","lucproblem008.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem008/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","lucproblem008.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem009/","level":1,"title":"<code>lucproblem009.c</code>","text":"<p>Problem Statement</p> <p>Write a program to add first seven terms of the following series using a for loop. 1 / 1! + 2 / 2! + 3 / 3! + ...</p>","path":["Semester 1","Letusc","lucproblem009.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem009/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","lucproblem009.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem009/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","lucproblem009.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem009/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","lucproblem009.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem010-complex/","level":1,"title":"<code>lucproblem010-complex.c</code>","text":"<p>Problem Statement</p> <p>Write a program to generate all combinations (permutations) of 1, 2 and 3 from 1-digit numbers up to 4-digit numbers using a main loop to control the number of digits (1 to 3333).</p>","path":["Semester 1","Letusc","lucproblem010-complex.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem010-complex/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","lucproblem010-complex.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem010-complex/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","lucproblem010-complex.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem010-complex/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","lucproblem010-complex.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem010/","level":1,"title":"<code>lucproblem010.c</code>","text":"<p>Problem Statement</p> <p>Write a program to generate all combination of 1, 2 and 3 using for loop.</p>","path":["Semester 1","Letusc","lucproblem010.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem010/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","lucproblem010.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem010/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","lucproblem010.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem010/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","lucproblem010.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem011/","level":1,"title":"<code>lucproblem011.c</code>","text":"<p>Problem Statement</p> <p>Write a menu driven program which has following options : 1. Factorial of a number 2. Prime or not 3. Odd or even 4. Exit Once a menu item is selected the appropriate action should be taken and once this action is finished, the menu should reappear. Unless the user selects the 'Exit' option the program should continue work.</p>","path":["Semester 1","Letusc","lucproblem011.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem011/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","lucproblem011.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem011/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","lucproblem011.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem011/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","lucproblem011.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem012/","level":1,"title":"<code>lucproblem012.c</code>","text":"<p>Problem Statement</p> <p>Write a Function power(a, b), to calculate the value of a raised to b</p>","path":["Semester 1","Letusc","lucproblem012.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem012/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","lucproblem012.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem012/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","lucproblem012.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem012/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","lucproblem012.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem013/","level":1,"title":"<code>lucproblem013.c</code>","text":"<p>Problem Statement</p> <p>Define a function to convert any given year into its Roman equivalent. Use these roman equivalent for decimal numbers : 1 - I, 5 - V, 10 - X, 50 - L, 100 - C, 500 - D, 1000 - M</p>","path":["Semester 1","Letusc","lucproblem013.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem013/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","lucproblem013.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem013/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","lucproblem013.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem013/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","lucproblem013.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem014-short/","level":1,"title":"<code>lucproblem014-short.c</code>","text":"<p>Problem Statement</p> <p>Write a function that receives integers and returns the sum, average and standard deviation of these numbers. Call this function from main() and print the result in main()</p>","path":["Semester 1","Letusc","lucproblem014-short.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem014-short/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","lucproblem014-short.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem014-short/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","lucproblem014-short.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem014-short/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","lucproblem014-short.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem014/","level":1,"title":"<code>lucproblem014.c</code>","text":"<p>Problem Statement</p> <p>Write a function that receives integers and returns the sum, average and standard deviation of these numbers. Call this function from main() and print the result in main()</p>","path":["Semester 1","Letusc","lucproblem014.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem014/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","lucproblem014.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem014/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","lucproblem014.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem014/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","lucproblem014.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem015/","level":1,"title":"<code>lucproblem015.c</code>","text":"<p>Problem Statement</p> <p>Write a program that defines a function that calculates power of one number reaised to another and factorial value of a number in one cell.</p>","path":["Semester 1","Letusc","lucproblem015.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem015/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Letusc","lucproblem015.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem015/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","lucproblem015.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem015/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","lucproblem015.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem016/","level":1,"title":"<code>lucproblem016.c</code>","text":"<p>Problem Statement</p> <p>Figure 9.4 shows three memory locations and values stored in them. Write a program to declare variables that implement the relationship shown. How will you print the values and addresses shown in the figure? On which machine the program should be executed to get such addresses? Figure 9.4: value: 3.14, memory_address: 7fff9489c79c value: 7fff9489c7a0, memory_address: 7fff4fd134b8 value: 7fff9489c79c, memory_address: 7fff9489c7a0</p>","path":["Semester 1","Letusc","lucproblem016.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem016/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Letusc","lucproblem016.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem016/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Letusc","lucproblem016.c"],"tags":[]},{"location":"semester_1/letusc/lucproblem016/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Letusc","lucproblem016.c"],"tags":[]},{"location":"semester_1/practice-c/","level":1,"title":"Practice C","text":"<p>Files and sub-folders in Practice C.</p>","path":["Semester 1","Practice c","Practice C"],"tags":[]},{"location":"semester_1/practice-c/#files","level":2,"title":"Files","text":"# File Link 1 <code>external_1.c</code> View Code 2 <code>external_2.c</code> View Code 3 <code>external_3.c</code> View Code 4 <code>pc-ip-01.c</code> View Code 5 <code>pc-ip-02.c</code> View Code 6 <code>pc-ip-03.c</code> View Code 7 <code>pc-ip-04.c</code> View Code 8 <code>pc-ip-05.c</code> View Code 9 <code>pc-ip-06.c</code> View Code 10 <code>pc-ip-07.c</code> View Code 11 <code>pc-ip-08.c</code> View Code 12 <code>pc-ip-09.c</code> View Code 13 <code>pc-ip-10.c</code> View Code 14 <code>pc-ip-11.c</code> View Code 15 <code>pc-ip-12.c</code> View Code 16 <code>pc-ip-13.c</code> View Code 17 <code>pc-ip-14.c</code> View Code 18 <code>pc-ip-15.c</code> View Code 19 <code>pc-ip-16.c</code> View Code 20 <code>pc-ip-17.c</code> View Code 21 <code>pc-ip-18.c</code> View Code 22 <code>pc-ip-19.c</code> View Code 23 <code>pc-ip-20.c</code> View Code 24 <code>pc001.c</code> View Code 25 <code>pc002.c</code> View Code 26 <code>pc003.c</code> View Code 27 <code>pc004.c</code> View Code 28 <code>pc005.c</code> View Code 29 <code>pc006.c</code> View Code 30 <code>pc007.c</code> View Code 31 <code>pc008.c</code> View Code 32 <code>pc009.c</code> View Code 33 <code>pc010.c</code> View Code 34 <code>pc011.c</code> View Code 35 <code>pc012.c</code> View Code 36 <code>pc013.c</code> View Code 37 <code>pc014.c</code> View Code 38 <code>pc015.c</code> View Code 39 <code>pc016.c</code> View Code 40 <code>pc017.c</code> View Code","path":["Semester 1","Practice c","Practice C"],"tags":[]},{"location":"semester_1/practice-c/external_1/","level":1,"title":"<code>external_1.c</code>","text":"","path":["Semester 1","Practice c","external_1.c"],"tags":[]},{"location":"semester_1/practice-c/external_1/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","external_1.c"],"tags":[]},{"location":"semester_1/practice-c/external_1/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","external_1.c"],"tags":[]},{"location":"semester_1/practice-c/external_2/","level":1,"title":"<code>external_2.c</code>","text":"","path":["Semester 1","Practice c","external_2.c"],"tags":[]},{"location":"semester_1/practice-c/external_2/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","external_2.c"],"tags":[]},{"location":"semester_1/practice-c/external_2/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","external_2.c"],"tags":[]},{"location":"semester_1/practice-c/external_3/","level":1,"title":"<code>external_3.c</code>","text":"","path":["Semester 1","Practice c","external_3.c"],"tags":[]},{"location":"semester_1/practice-c/external_3/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","external_3.c"],"tags":[]},{"location":"semester_1/practice-c/external_3/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","external_3.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-01/","level":1,"title":"<code>pc-ip-01.c</code>","text":"<p>Problem Statement</p> <p>Question 1: Write a program to compute the sum and product of digits of an integer using user-defined functions.</p>","path":["Semester 1","Practice c","pc-ip-01.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-01/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 05 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Practice c","pc-ip-01.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-01/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc-ip-01.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-01/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc-ip-01.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-02/","level":1,"title":"<code>pc-ip-02.c</code>","text":"<p>Problem Statement</p> <p>Question 2: Write a program to reverse a non-negative integer using a function.</p>","path":["Semester 1","Practice c","pc-ip-02.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-02/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc-ip-02.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-02/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc-ip-02.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-02/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc-ip-02.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-03/","level":1,"title":"<code>pc-ip-03.c</code>","text":"<p>Problem Statement</p> <p>Question 3: Write a program to compute the sum of the first n terms of the series using a function: S=1-2+3-4+5-6+...</p>","path":["Semester 1","Practice c","pc-ip-03.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-03/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc-ip-03.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-03/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc-ip-03.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-03/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc-ip-03.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-04/","level":1,"title":"<code>pc-ip-04.c</code>","text":"<p>Problem Statement</p> <p>Question 4: Write a function to check whether a number is prime or not. Use the same function to generate all prime numbers less than 100.</p>","path":["Semester 1","Practice c","pc-ip-04.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-04/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 05 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Practice c","pc-ip-04.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-04/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc-ip-04.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-04/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc-ip-04.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-05/","level":1,"title":"<code>pc-ip-05.c</code>","text":"<p>Problem Statement</p> <p>Question 5: Write a function to check whether a given string is a palindrome. Use this function to determine whether an entered string is Palindrome.</p>","path":["Semester 1","Practice c","pc-ip-05.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-05/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 05 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Practice c","pc-ip-05.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-05/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc-ip-05.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-05/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc-ip-05.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-06/","level":1,"title":"<code>pc-ip-06.c</code>","text":"<p>Problem Statement</p> <p>Question 6: Write a program using a function to compute and display all factors of a given number.</p>","path":["Semester 1","Practice c","pc-ip-06.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-06/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc-ip-06.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-06/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc-ip-06.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-06/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc-ip-06.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-07/","level":1,"title":"<code>pc-ip-07.c</code>","text":"<p>Problem Statement</p> <p>Question 7: Write a program to swap two numbers using pointers using user-defined function.</p>","path":["Semester 1","Practice c","pc-ip-07.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-07/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc-ip-07.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-07/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc-ip-07.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-07/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc-ip-07.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-08/","level":1,"title":"<code>pc-ip-08.c</code>","text":"<p>Problem Statement</p> <p>Question 8: Write a program that takes the radius of a circle as input, passes it to a function that computes area and circumference, and displays results in main().</p>","path":["Semester 1","Practice c","pc-ip-08.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-08/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc-ip-08.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-08/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc-ip-08.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-08/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc-ip-08.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-09/","level":1,"title":"<code>pc-ip-09.c</code>","text":"<p>Problem Statement</p> <p>Question 9: Write a program to find the sum of n elements entered by the user. Use dynamic memory allocation (malloc() or calloc()).</p>","path":["Semester 1","Practice c","pc-ip-09.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-09/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 05 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Practice c","pc-ip-09.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-09/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc-ip-09.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-09/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc-ip-09.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-10/","level":1,"title":"<code>pc-ip-10.c</code>","text":"<p>Problem Statement</p> <p>Question 10: Write a function that reverses each elements of an array in place, using only a single pointer argument, and return void.</p>","path":["Semester 1","Practice c","pc-ip-10.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-10/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 05 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Practice c","pc-ip-10.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-10/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc-ip-10.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-10/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc-ip-10.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-11/","level":1,"title":"<code>pc-ip-11.c</code>","text":"<p>Problem Statement</p> <p>Question 11: Write a program to merge two sorted integer arrays to form a single sorted array.</p>","path":["Semester 1","Practice c","pc-ip-11.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-11/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 05 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Practice c","pc-ip-11.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-11/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc-ip-11.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-11/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc-ip-11.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-12/","level":1,"title":"<code>pc-ip-12.c</code>","text":"<p>Problem Statement</p> <p>Question 12: Write a program that reads 10 integers into an array (using pointers), and prints the array in ascending and descending order.</p>","path":["Semester 1","Practice c","pc-ip-12.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-12/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 05 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Practice c","pc-ip-12.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-12/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc-ip-12.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-12/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc-ip-12.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-13/","level":1,"title":"<code>pc-ip-13.c</code>","text":"<p>Problem Statement</p> <p>Question 13: Write a program to display the Fibonacci series using recursive function and iterative function.</p>","path":["Semester 1","Practice c","pc-ip-13.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-13/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 05 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Practice c","pc-ip-13.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-13/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc-ip-13.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-13/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc-ip-13.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-14/","level":1,"title":"<code>pc-ip-14.c</code>","text":"<p>Problem Statement</p> <p>Question 14: Write a program to calculate the factorial of a number using recursive and iterative function.</p>","path":["Semester 1","Practice c","pc-ip-14.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-14/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc-ip-14.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-14/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc-ip-14.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-14/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc-ip-14.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-15/","level":1,"title":"<code>pc-ip-15.c</code>","text":"<p>Problem Statement</p> <p>Question 15: Write a program to calculate the GCD of two numbers using recursive and iterative function.</p>","path":["Semester 1","Practice c","pc-ip-15.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-15/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 05 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Practice c","pc-ip-15.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-15/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc-ip-15.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-15/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc-ip-15.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-16/","level":1,"title":"<code>pc-ip-16.c</code>","text":"<p>Problem Statement</p> <p>Question 16: Write a C program that includes a user-defined function named isArmstrong with the signature int isArmstrong(int num);.</p>","path":["Semester 1","Practice c","pc-ip-16.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-16/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 05 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Practice c","pc-ip-16.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-16/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc-ip-16.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-16/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc-ip-16.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-17/","level":1,"title":"<code>pc-ip-17.c</code>","text":"<p>Problem Statement</p> <p>Question 17: Write a C program that includes a user-defined function named isPerfect with the signature int isPerfect(int num);.</p>","path":["Semester 1","Practice c","pc-ip-17.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-17/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc-ip-17.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-17/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc-ip-17.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-17/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc-ip-17.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-18/","level":1,"title":"<code>pc-ip-18.c</code>","text":"<p>Problem Statement</p> <p>Question 18: Write a C program that includes a user-defined function named findLargest with the signature int findLargest(int arr[], int size);.</p>","path":["Semester 1","Practice c","pc-ip-18.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-18/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 05 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Practice c","pc-ip-18.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-18/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc-ip-18.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-18/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc-ip-18.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-19/","level":1,"title":"<code>pc-ip-19.c</code>","text":"<p>Problem Statement</p> <p>Question 19: Write a C program that includes a user-defined function named binarySearch with the signature int binarySearch(int arr[], int size, int target);.</p>","path":["Semester 1","Practice c","pc-ip-19.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-19/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 05 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Practice c","pc-ip-19.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-19/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc-ip-19.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-19/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc-ip-19.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-20/","level":1,"title":"<code>pc-ip-20.c</code>","text":"<p>Problem Statement</p> <p>Question 20: Write a C program that defines an array of integers, and includes a user-defined function named reverseArray with the signature void reverseArray(int arr[], int size);.</p>","path":["Semester 1","Practice c","pc-ip-20.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-20/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 05 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Practice c","pc-ip-20.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-20/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc-ip-20.c"],"tags":[]},{"location":"semester_1/practice-c/pc-ip-20/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc-ip-20.c"],"tags":[]},{"location":"semester_1/practice-c/pc001/","level":1,"title":"<code>pc001.c</code>","text":"<p>Problem Statement</p> <p>Pattern : 1 1 2 1 2 3 1 2 3 4 1 2 3 4 5 for n = 5</p>","path":["Semester 1","Practice c","pc001.c"],"tags":[]},{"location":"semester_1/practice-c/pc001/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc001.c"],"tags":[]},{"location":"semester_1/practice-c/pc001/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc001.c"],"tags":[]},{"location":"semester_1/practice-c/pc001/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc001.c"],"tags":[]},{"location":"semester_1/practice-c/pc002/","level":1,"title":"<code>pc002.c</code>","text":"<p>Problem Statement</p> <p>Pattern : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 for n = 5</p>","path":["Semester 1","Practice c","pc002.c"],"tags":[]},{"location":"semester_1/practice-c/pc002/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc002.c"],"tags":[]},{"location":"semester_1/practice-c/pc002/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc002.c"],"tags":[]},{"location":"semester_1/practice-c/pc002/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc002.c"],"tags":[]},{"location":"semester_1/practice-c/pc003/","level":1,"title":"<code>pc003.c</code>","text":"<p>Problem Statement</p> <p>Pattern : 1 2 4 3 6 9 4 8 12 16 5 10 15 20 25 for n = 5</p>","path":["Semester 1","Practice c","pc003.c"],"tags":[]},{"location":"semester_1/practice-c/pc003/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc003.c"],"tags":[]},{"location":"semester_1/practice-c/pc003/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc003.c"],"tags":[]},{"location":"semester_1/practice-c/pc003/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc003.c"],"tags":[]},{"location":"semester_1/practice-c/pc004/","level":1,"title":"<code>pc004.c</code>","text":"<p>Problem Statement</p> <p>Pattern : 5 4 3 2 1 4 3 2 1 3 2 1 2 1 1 for n = 5</p>","path":["Semester 1","Practice c","pc004.c"],"tags":[]},{"location":"semester_1/practice-c/pc004/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc004.c"],"tags":[]},{"location":"semester_1/practice-c/pc004/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc004.c"],"tags":[]},{"location":"semester_1/practice-c/pc004/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc004.c"],"tags":[]},{"location":"semester_1/practice-c/pc005/","level":1,"title":"<code>pc005.c</code>","text":"<p>Problem Statement</p> <p>Pattern : 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 for n = 5</p>","path":["Semester 1","Practice c","pc005.c"],"tags":[]},{"location":"semester_1/practice-c/pc005/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc005.c"],"tags":[]},{"location":"semester_1/practice-c/pc005/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc005.c"],"tags":[]},{"location":"semester_1/practice-c/pc005/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc005.c"],"tags":[]},{"location":"semester_1/practice-c/pc006/","level":1,"title":"<code>pc006.c</code>","text":"<p>Problem Statement</p> <p>Prime number check</p>","path":["Semester 1","Practice c","pc006.c"],"tags":[]},{"location":"semester_1/practice-c/pc006/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Practice c","pc006.c"],"tags":[]},{"location":"semester_1/practice-c/pc006/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc006.c"],"tags":[]},{"location":"semester_1/practice-c/pc006/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc006.c"],"tags":[]},{"location":"semester_1/practice-c/pc007/","level":1,"title":"<code>pc007.c</code>","text":"<p>Problem Statement</p> <p>Armstrong number check only for three digit</p>","path":["Semester 1","Practice c","pc007.c"],"tags":[]},{"location":"semester_1/practice-c/pc007/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc007.c"],"tags":[]},{"location":"semester_1/practice-c/pc007/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc007.c"],"tags":[]},{"location":"semester_1/practice-c/pc007/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc007.c"],"tags":[]},{"location":"semester_1/practice-c/pc008/","level":1,"title":"<code>pc008.c</code>","text":"<p>Problem Statement</p> <p>Factorial upto N</p>","path":["Semester 1","Practice c","pc008.c"],"tags":[]},{"location":"semester_1/practice-c/pc008/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc008.c"],"tags":[]},{"location":"semester_1/practice-c/pc008/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc008.c"],"tags":[]},{"location":"semester_1/practice-c/pc008/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc008.c"],"tags":[]},{"location":"semester_1/practice-c/pc009/","level":1,"title":"<code>pc009.c</code>","text":"<p>Problem Statement</p> <p>Sum of digit</p>","path":["Semester 1","Practice c","pc009.c"],"tags":[]},{"location":"semester_1/practice-c/pc009/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc009.c"],"tags":[]},{"location":"semester_1/practice-c/pc009/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc009.c"],"tags":[]},{"location":"semester_1/practice-c/pc009/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc009.c"],"tags":[]},{"location":"semester_1/practice-c/pc010/","level":1,"title":"<code>pc010.c</code>","text":"<p>Problem Statement</p> <p>Reverse a number</p>","path":["Semester 1","Practice c","pc010.c"],"tags":[]},{"location":"semester_1/practice-c/pc010/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc010.c"],"tags":[]},{"location":"semester_1/practice-c/pc010/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc010.c"],"tags":[]},{"location":"semester_1/practice-c/pc010/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc010.c"],"tags":[]},{"location":"semester_1/practice-c/pc011/","level":1,"title":"<code>pc011.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that takes two positive integers, L (Lower Bound) and U (Upper Bound), as input from the user. The program must find and print the count of all numbers between L and U (inclusive) that are also a Palindrome Number.</p>","path":["Semester 1","Practice c","pc011.c"],"tags":[]},{"location":"semester_1/practice-c/pc011/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Practice c","pc011.c"],"tags":[]},{"location":"semester_1/practice-c/pc011/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc011.c"],"tags":[]},{"location":"semester_1/practice-c/pc011/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc011.c"],"tags":[]},{"location":"semester_1/practice-c/pc012/","level":1,"title":"<code>pc012.c</code>","text":"<p>Problem Statement</p> <p>Write a C function that receives a string (character array) and uses pointers to count and return the total number of vowels and consonants in that string.</p>","path":["Semester 1","Practice c","pc012.c"],"tags":[]},{"location":"semester_1/practice-c/pc012/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Practice c","pc012.c"],"tags":[]},{"location":"semester_1/practice-c/pc012/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc012.c"],"tags":[]},{"location":"semester_1/practice-c/pc012/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc012.c"],"tags":[]},{"location":"semester_1/practice-c/pc013/","level":1,"title":"<code>pc013.c</code>","text":"<p>Problem Statement</p> <p>Write a C program that defines a structure named Book with attributes bookID (int), title (string), and price (float). Include a user-defined function named updatePrice with the signature: void updatePrice(struct Book *b, float newPrice); The program should: Accept details for one book from the user. Display the details before the update. Use the function to update the price of the book. Display the updated details.</p>","path":["Semester 1","Practice c","pc013.c"],"tags":[]},{"location":"semester_1/practice-c/pc013/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc013.c"],"tags":[]},{"location":"semester_1/practice-c/pc013/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc013.c"],"tags":[]},{"location":"semester_1/practice-c/pc013/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc013.c"],"tags":[]},{"location":"semester_1/practice-c/pc014/","level":1,"title":"<code>pc014.c</code>","text":"<p>Problem Statement</p> <p>Write a c program that defines a structure Student with the following members: roll (int), name (string), and marks (float). Do the below: Create an array to store details for 3 students. Read the details for these 3 student from a file named students.txt. (Assume the file contains data in the format: Roll Name Marks). Implement a recursive function float calculateTotal(struct Student arr[], int n) to calculate the sum of marks of all students in the array. Display each student's details and the total marks calculated by the recursive function.</p>","path":["Semester 1","Practice c","pc014.c"],"tags":[]},{"location":"semester_1/practice-c/pc014/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc014.c"],"tags":[]},{"location":"semester_1/practice-c/pc014/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc014.c"],"tags":[]},{"location":"semester_1/practice-c/pc014/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc014.c"],"tags":[]},{"location":"semester_1/practice-c/pc015/","level":1,"title":"<code>pc015.c</code>","text":"<p>Problem Statement</p> <p>Write a C program to reverse a string using a recursive function.</p>","path":["Semester 1","Practice c","pc015.c"],"tags":[]},{"location":"semester_1/practice-c/pc015/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc015.c"],"tags":[]},{"location":"semester_1/practice-c/pc015/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc015.c"],"tags":[]},{"location":"semester_1/practice-c/pc015/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc015.c"],"tags":[]},{"location":"semester_1/practice-c/pc016/","level":1,"title":"<code>pc016.c</code>","text":"<p>Problem Statement</p> <p>Write a c program that records book data from user and stores them in to a file.</p>","path":["Semester 1","Practice c","pc016.c"],"tags":[]},{"location":"semester_1/practice-c/pc016/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc016.c"],"tags":[]},{"location":"semester_1/practice-c/pc016/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc016.c"],"tags":[]},{"location":"semester_1/practice-c/pc016/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc016.c"],"tags":[]},{"location":"semester_1/practice-c/pc017/","level":1,"title":"<code>pc017.c</code>","text":"<p>Problem Statement</p> <p>Write a program to calculate the difference between two time periods using structures.</p>","path":["Semester 1","Practice c","pc017.c"],"tags":[]},{"location":"semester_1/practice-c/pc017/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Practice c","pc017.c"],"tags":[]},{"location":"semester_1/practice-c/pc017/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Practice c","pc017.c"],"tags":[]},{"location":"semester_1/practice-c/pc017/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Practice c","pc017.c"],"tags":[]},{"location":"semester_1/temp/","level":1,"title":"Temp","text":"<p>Files and sub-folders in Temp.</p>","path":["Semester 1","Temp"],"tags":[]},{"location":"semester_1/temp/#files","level":2,"title":"Files","text":"# File Link 1 <code>maheswar01.c</code> View Code 2 <code>maheswar02.c</code> View Code 3 <code>sudipto1.c</code> View Code 4 <code>sudiptoown01.c</code> View Code","path":["Semester 1","Temp"],"tags":[]},{"location":"semester_1/temp/maheswar01/","level":1,"title":"<code>maheswar01.c</code>","text":"","path":["Semester 1","Temp","maheswar01.c"],"tags":[]},{"location":"semester_1/temp/maheswar01/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Temp","maheswar01.c"],"tags":[]},{"location":"semester_1/temp/maheswar01/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Temp","maheswar01.c"],"tags":[]},{"location":"semester_1/temp/maheswar02/","level":1,"title":"<code>maheswar02.c</code>","text":"","path":["Semester 1","Temp","maheswar02.c"],"tags":[]},{"location":"semester_1/temp/maheswar02/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Temp","maheswar02.c"],"tags":[]},{"location":"semester_1/temp/maheswar02/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Temp","maheswar02.c"],"tags":[]},{"location":"semester_1/temp/sudipto1/","level":1,"title":"<code>sudipto1.c</code>","text":"<p>Problem Statement</p> <p>A smart home security controller monitors the state of several sensors to decide what action to take. Each second, the system reads data from sensors that can either be active or inactive. Based on the current state of all sensors, the controller must perform exactly one action, such as activating a warning, checking a specific zone, or declaring an intrusion. Write a C program that reads the sensor states as input and prints the corresponding system action. -- Conditions: 1. You must determine exactly one action for every possible combination of sensor states. 2. You are not allowed to use any conditional statements (if, else if, else, or the ternary operator?). 3. You are not allowed to use logical operators. 4. You must use a single switch statement to control the program's behaviour. 5. Loops may only be used for reading input, not for making decisions. 6. The program should handle all possible combinations of the sensors' active/inactive states and print the appropriate response each time. -- Example (for understanding): If all sensors are inactive, the system should remain idle. If some sensors are active, the system should issue warnings or alerts based on the situation. If all sensors are active, the system should declare a confirmed intrusion.</p>","path":["Semester 1","Temp","sudipto1.c"],"tags":[]},{"location":"semester_1/temp/sudipto1/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Temp","sudipto1.c"],"tags":[]},{"location":"semester_1/temp/sudipto1/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Temp","sudipto1.c"],"tags":[]},{"location":"semester_1/temp/sudipto1/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Temp","sudipto1.c"],"tags":[]},{"location":"semester_1/temp/sudiptoown01/","level":1,"title":"<code>sudiptoown01.c</code>","text":"","path":["Semester 1","Temp","sudiptoown01.c"],"tags":[]},{"location":"semester_1/temp/sudiptoown01/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Temp","sudiptoown01.c"],"tags":[]},{"location":"semester_1/temp/sudiptoown01/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Temp","sudiptoown01.c"],"tags":[]},{"location":"semester_1/tuition-c/","level":1,"title":"Tuition C","text":"<p>Files and sub-folders in Tuition C.</p>","path":["Semester 1","Tuition c","Tuition C"],"tags":[]},{"location":"semester_1/tuition-c/#files","level":2,"title":"Files","text":"# File Link 1 <code>APC-PRAC-001.c</code> View Code 2 <code>APC-PRAC-002.c</code> View Code 3 <code>APC-PRAC-003.c</code> View Code 4 <code>APC-PRAC-004.c</code> View Code 5 <code>APC-PRAC-005.c</code> View Code 6 <code>APC-PRAC-006.c</code> View Code 7 <code>APC-PRAC-007.c</code> View Code 8 <code>APC-PRAC-008.c</code> View Code 9 <code>APC-PRAC-009.c</code> View Code 10 <code>APC-PRAC-010.c</code> View Code 11 <code>APC-PRAC-011.c</code> View Code 12 <code>APC-PRAC-012.c</code> View Code 13 <code>APC-PRAC-013.c</code> View Code 14 <code>APC-PRAC-014.c</code> View Code 15 <code>APC-PRAC-015.c</code> View Code 16 <code>APC-PRAC-016.c</code> View Code 17 <code>APC-PRAC-017.c</code> View Code 18 <code>APC-PRAC-018.c</code> View Code 19 <code>APC-PRAC-019.c</code> View Code 20 <code>APC-PRAC-020.c</code> View Code 21 <code>APC-PRAC-021.c</code> View Code 22 <code>APC-PRAC-022.c</code> View Code 23 <code>APC-PRAC-023.c</code> View Code 24 <code>APC-PRAC-024.c</code> View Code 25 <code>APC-PRAC-025.c</code> View Code 26 <code>APC-PRAC-026.c</code> View Code 27 <code>APC-PRAC-027.c</code> View Code 28 <code>APC-PRAC-028.c</code> View Code 29 <code>APC-PRAC-029.c</code> View Code 30 <code>APC-PRAC-030.c</code> View Code 31 <code>APC-PRAC-031.c</code> View Code 32 <code>APC-PRAC-032.c</code> View Code 33 <code>APC-PRAC-033.c</code> View Code 34 <code>APC-PRAC-034.c</code> View Code 35 <code>APC-PRAC-035.c</code> View Code 36 <code>APC-PRAC-036.c</code> View Code 37 <code>APC-PRAC-037.c</code> View Code 38 <code>APC-PRAC-038.c</code> View Code 39 <code>APC-PRAC-039.c</code> View Code 40 <code>APC-PRAC-040.c</code> View Code 41 <code>APC-PRAC-041.c</code> View Code 42 <code>APC-PRAC-042.c</code> View Code 43 <code>APC-S-001.c</code> View Code 44 <code>APC-S-002.c</code> View Code 45 <code>APC-S-003.c</code> View Code 46 <code>APC-S-004.c</code> View Code 47 <code>APC-S-005.c</code> View Code 48 <code>APC-S-006.c</code> View Code 49 <code>APC-S-007.c</code> View Code 50 <code>APC-S-008.c</code> View Code 51 <code>APC-S-009.c</code> View Code 52 <code>APC-S-010.c</code> View Code 53 <code>APC-S-011.c</code> View Code 54 <code>APC-S-012.c</code> View Code 55 <code>APC-S-013.c</code> View Code 56 <code>APC-S-014.c</code> View Code 57 <code>APC-SPS-001.c</code> View Code 58 <code>APC-SPS-002.c</code> View Code 59 <code>APC-SPS-003.c</code> View Code 60 <code>APC-SPS-004.c</code> View Code 61 <code>APC-SPS-005.c</code> View Code 62 <code>APC-SPS-006.c</code> View Code 63 <code>APC-SPS-007.c</code> View Code 64 <code>APC-SPS-008.c</code> View Code 65 <code>P001.c</code> View Code 66 <code>P002.c</code> View Code 67 <code>P003.c</code> View Code 68 <code>P004.c</code> View Code 69 <code>P005.c</code> View Code 70 <code>P006.c</code> View Code 71 <code>P007.c</code> View Code 72 <code>P008.c</code> View Code 73 <code>P009.c</code> View Code 74 <code>P010.c</code> View Code 75 <code>P011.c</code> View Code 76 <code>P012.c</code> View Code 77 <code>P013.c</code> View Code 78 <code>P014.c</code> View Code 79 <code>P015.c</code> View Code 80 <code>P016.c</code> View Code 81 <code>P017.c</code> View Code 82 <code>P018.c</code> View Code 83 <code>P019.c</code> View Code 84 <code>P020.c</code> View Code 85 <code>P021.c</code> View Code 86 <code>P022.c</code> View Code 87 <code>P023.c</code> View Code 88 <code>P024.c</code> View Code 89 <code>P025.c</code> View Code 90 <code>P026.c</code> View Code 91 <code>P027.c</code> View Code 92 <code>P028.c</code> View Code 93 <code>P029.c</code> View Code 94 <code>P030.c</code> View Code 95 <code>P031.c</code> View Code 96 <code>P032.c</code> View Code 97 <code>P033.c</code> View Code 98 <code>P034.c</code> View Code 99 <code>P035.c</code> View Code 100 <code>P036.c</code> View Code 101 <code>P037.c</code> View Code 102 <code>P038.c</code> View Code 103 <code>P039.c</code> View Code 104 <code>P040.c</code> View Code 105 <code>P041.c</code> View Code 106 <code>P042.c</code> View Code 107 <code>P043.c</code> View Code 108 <code>P044.c</code> View Code 109 <code>P045.c</code> View Code 110 <code>P046.c</code> View Code 111 <code>P047.c</code> View Code 112 <code>P048.c</code> View Code 113 <code>P049.c</code> View Code 114 <code>P050-SHORT.c</code> View Code 115 <code>P050.c</code> View Code 116 <code>P051.c</code> View Code 117 <code>P052.c</code> View Code 118 <code>P053.c</code> View Code 119 <code>P054.c</code> View Code 120 <code>P055.c</code> View Code 121 <code>P056.c</code> View Code 122 <code>P057.c</code> View Code 123 <code>P058.c</code> View Code 124 <code>P059.c</code> View Code 125 <code>P060.c</code> View Code 126 <code>P061.c</code> View Code 127 <code>P062.c</code> View Code 128 <code>P063.c</code> View Code 129 <code>P064.c</code> View Code 130 <code>P065.c</code> View Code 131 <code>P066.c</code> View Code 132 <code>P067.c</code> View Code 133 <code>P068.c</code> View Code 134 <code>P069.c</code> View Code 135 <code>P070.c</code> View Code","path":["Semester 1","Tuition c","Tuition C"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-001/","level":1,"title":"<code>APC-PRAC-001.c</code>","text":"<p>Problem Statement</p> <p>WAP to calculate area and perimeter of a rectangle by accepting length and breadth as input.</p>","path":["Semester 1","Tuition c","APC-PRAC-001.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-001/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-001.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-001/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-001.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-001/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-001.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-002/","level":1,"title":"<code>APC-PRAC-002.c</code>","text":"<p>Problem Statement</p> <p>WAP to calculate area of a circle using math library method. Take radius of the circle as input.</p>","path":["Semester 1","Tuition c","APC-PRAC-002.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-002/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-002.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-002/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-002.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-002/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-002.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-003/","level":1,"title":"<code>APC-PRAC-003.c</code>","text":"<p>Problem Statement</p> <p>WAP to accept diagonal of a square and calculate area, parimeter</p>","path":["Semester 1","Tuition c","APC-PRAC-003.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-003/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-003.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-003/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-003.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-003/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-003.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-004/","level":1,"title":"<code>APC-PRAC-004.c</code>","text":"<p>Problem Statement</p> <p>WAP to calculate and display radius of a circle by taking the area as input.</p>","path":["Semester 1","Tuition c","APC-PRAC-004.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-004/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-004.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-004/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-004.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-004/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-004.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-005/","level":1,"title":"<code>APC-PRAC-005.c</code>","text":"<p>Problem Statement</p> <p>WAP a program that accept number of days as input and represent it as years, months and days.</p>","path":["Semester 1","Tuition c","APC-PRAC-005.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-005/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-005.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-005/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-005.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-005/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-005.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-006/","level":1,"title":"<code>APC-PRAC-006.c</code>","text":"<p>Problem Statement</p> <p>WAP that accept seconds as input and represent it an hours, minutes and seconds.</p>","path":["Semester 1","Tuition c","APC-PRAC-006.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-006/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-006.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-006/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-006.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-006/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-006.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-007/","level":1,"title":"<code>APC-PRAC-007.c</code>","text":"<p>Problem Statement</p> <p>WAP that accept basic salary of an employee and display gross salary, net salary generated by below formula. DA = 25% of the basic salary. HRA = 12.5% of the basic salary. PF = 10% of the basic salary. gross salary = basic salary + da + hra net salary = gross salary - pf</p>","path":["Semester 1","Tuition c","APC-PRAC-007.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-007/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-007.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-007/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-007.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-007/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-007.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-008/","level":1,"title":"<code>APC-PRAC-008.c</code>","text":"<p>Problem Statement</p> <p>WAP to multiply and divide a number by 4 without using multiplication and division operator.</p>","path":["Semester 1","Tuition c","APC-PRAC-008.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-008/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-008.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-008/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-008.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-008/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-008.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-009/","level":1,"title":"<code>APC-PRAC-009.c</code>","text":"<p>Problem Statement</p> <p>WAP to swap two integer variable without using Third variable.</p>","path":["Semester 1","Tuition c","APC-PRAC-009.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-009/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-009.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-009/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-009.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-009/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-009.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-010/","level":1,"title":"<code>APC-PRAC-010.c</code>","text":"<p>Problem Statement</p> <p>WAP to calculate and display the valve of the given expression : (1/a^3) + (1/(b+2)^3) + (1/(c^4 + root(2))) take a, b, c as input.</p>","path":["Semester 1","Tuition c","APC-PRAC-010.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-010/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-010.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-010/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-010.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-010/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-010.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-011/","level":1,"title":"<code>APC-PRAC-011.c</code>","text":"<p>Problem Statement</p> <p>Write a program to input positive number and check whether the number is perfect square or not. If the number is negetive then display appropriate message</p>","path":["Semester 1","Tuition c","APC-PRAC-011.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-011/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-011.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-011/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-011.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-011/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-011.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-012/","level":1,"title":"<code>APC-PRAC-012.c</code>","text":"<p>Problem Statement</p> <p>Write a program to input three integer and find out second largest</p>","path":["Semester 1","Tuition c","APC-PRAC-012.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-012/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-012.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-012/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-012.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-012/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-012.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-013/","level":1,"title":"<code>APC-PRAC-013.c</code>","text":"<p>Problem Statement</p> <p>Write a program to input sum(p), rate of interest(r), time(t) and type of interest ('s' for simple interes, 'c' for compound interest), then calculate and display the earned interest</p>","path":["Semester 1","Tuition c","APC-PRAC-013.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-013/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-013.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-013/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-013.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-013/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-013.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-014/","level":1,"title":"<code>APC-PRAC-014.c</code>","text":"<p>Problem Statement</p> <p>Write a program to calculate and display the maturity amount taking the sum and number of days as input. No. of Days Rate of Interest =========== ================ <= 180 5.57 % 181 - 364 7.75 % 365 - 500 9.25 % > 500 9.15 %</p>","path":["Semester 1","Tuition c","APC-PRAC-014.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-014/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-014.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-014/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-014.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-014/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-014.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-015/","level":1,"title":"<code>APC-PRAC-015.c</code>","text":"<p>Problem Statement</p> <p>Write a program to display all numbers between lb (lower bound) and up (upper bound) which ends with digit 7 or divisible by 7.</p>","path":["Semester 1","Tuition c","APC-PRAC-015.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-015/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-015.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-015/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-015.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-015/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-015.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-016/","level":1,"title":"<code>APC-PRAC-016.c</code>","text":"<p>Problem Statement</p> <p>Write a program to check palindrome number.</p>","path":["Semester 1","Tuition c","APC-PRAC-016.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-016/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-016.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-016/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-016.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-016/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-016.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-017/","level":1,"title":"<code>APC-PRAC-017.c</code>","text":"<p>Problem Statement</p> <p>Write a program to check perfect number.</p>","path":["Semester 1","Tuition c","APC-PRAC-017.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-017/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-017.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-017/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-017.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-017/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-017.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-018/","level":1,"title":"<code>APC-PRAC-018.c</code>","text":"<p>Problem Statement</p> <p>Write a program to check Automorphic Number.</p>","path":["Semester 1","Tuition c","APC-PRAC-018.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-018/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-018.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-018/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-018.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-018/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-018.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-019/","level":1,"title":"<code>APC-PRAC-019.c</code>","text":"<p>Problem Statement</p> <p>Write a program to find hcf of two numbers</p>","path":["Semester 1","Tuition c","APC-PRAC-019.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-019/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-019.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-019/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-019.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-019/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-019.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-020/","level":1,"title":"<code>APC-PRAC-020.c</code>","text":"<p>Problem Statement</p> <p>Write a program to check if two number is co-prime or not</p>","path":["Semester 1","Tuition c","APC-PRAC-020.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-020/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-020.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-020/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-020.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-020/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-020.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-021/","level":1,"title":"<code>APC-PRAC-021.c</code>","text":"<p>Problem Statement</p> <p>Write a program to check special number (sum of digit + product of digit = original number)</p>","path":["Semester 1","Tuition c","APC-PRAC-021.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-021/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-021.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-021/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-021.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-021/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-021.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-022/","level":1,"title":"<code>APC-PRAC-022.c</code>","text":"<p>Problem Statement</p> <p>Write a program to accept a number and check whether the number is twisted prime or not</p>","path":["Semester 1","Tuition c","APC-PRAC-022.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-022/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","APC-PRAC-022.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-022/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-022.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-022/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-022.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-023/","level":1,"title":"<code>APC-PRAC-023.c</code>","text":"<p>Problem Statement</p> <p>Pattern : (a) 1, -3, 5, -7, 9, -11, ... upto n times (b) 0, 3, 8, 15, ... upto n times</p>","path":["Semester 1","Tuition c","APC-PRAC-023.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-023/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","APC-PRAC-023.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-023/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-023.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-023/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-023.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-024/","level":1,"title":"<code>APC-PRAC-024.c</code>","text":"<p>Problem Statement</p> <p>Pattern: 1 2 1 3 2 1 4 3 2 1 5 4 3 2 1</p>","path":["Semester 1","Tuition c","APC-PRAC-024.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-024/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-024.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-024/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-024.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-024/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-024.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-025/","level":1,"title":"<code>APC-PRAC-025.c</code>","text":"<p>Problem Statement</p> <p>Pattern: 5 4 3 2 1 5 4 3 2 5 4 3 5 4 5</p>","path":["Semester 1","Tuition c","APC-PRAC-025.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-025/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-025.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-025/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-025.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-025/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-025.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-026/","level":1,"title":"<code>APC-PRAC-026.c</code>","text":"<p>Problem Statement</p> <p>Pattern: 5 5 4 5 4 3 5 4 3 2 5 4 3 2 1</p>","path":["Semester 1","Tuition c","APC-PRAC-026.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-026/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-026.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-026/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-026.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-026/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-026.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-027/","level":1,"title":"<code>APC-PRAC-027.c</code>","text":"<p>Problem Statement</p> <p>Pattern: 1 2 3 4 5 2 3 4 5 3 4 5 4 5 5</p>","path":["Semester 1","Tuition c","APC-PRAC-027.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-027/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-027.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-027/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-027.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-027/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-027.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-028/","level":1,"title":"<code>APC-PRAC-028.c</code>","text":"<p>Problem Statement</p> <p>Pattern: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15</p>","path":["Semester 1","Tuition c","APC-PRAC-028.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-028/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-028.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-028/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-028.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-028/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-028.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-029/","level":1,"title":"<code>APC-PRAC-029.c</code>","text":"<p>Problem Statement</p> <p>Pattern: 1 1 0 1 0 1 1 0 1 0 1 0 1 0 1</p>","path":["Semester 1","Tuition c","APC-PRAC-029.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-029/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-029.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-029/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-029.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-029/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-029.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-030/","level":1,"title":"<code>APC-PRAC-030.c</code>","text":"<p>Problem Statement</p> <p>Pattern: # @ @ # # # @ @ @ @ # # # # #</p>","path":["Semester 1","Tuition c","APC-PRAC-030.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-030/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-030.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-030/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-030.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-030/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-030.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-031/","level":1,"title":"<code>APC-PRAC-031.c</code>","text":"<p>Problem Statement</p> <p>Pattern: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15</p>","path":["Semester 1","Tuition c","APC-PRAC-031.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-031/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-031.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-031/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-031.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-031/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-031.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-032/","level":1,"title":"<code>APC-PRAC-032.c</code>","text":"<p>Problem Statement</p> <p>Pattern: A B B C C C D D D D E E E E E</p>","path":["Semester 1","Tuition c","APC-PRAC-032.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-032/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-032.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-032/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-032.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-032/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-032.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-033/","level":1,"title":"<code>APC-PRAC-033.c</code>","text":"<p>Problem Statement</p> <p>Print the factorial of the digits off a number</p>","path":["Semester 1","Tuition c","APC-PRAC-033.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-033/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-033.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-033/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-033.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-033/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-033.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-034/","level":1,"title":"<code>APC-PRAC-034.c</code>","text":"<p>Problem Statement</p> <p>Take a Range as input from user and print the prime number between it.</p>","path":["Semester 1","Tuition c","APC-PRAC-034.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-034/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-034.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-034/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-034.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-034/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-034.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-035/","level":1,"title":"<code>APC-PRAC-035.c</code>","text":"<p>Problem Statement</p> <p>Print all the 3 and 4 digit palindrome number.</p>","path":["Semester 1","Tuition c","APC-PRAC-035.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-035/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-035.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-035/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-035.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-035/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-035.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-036/","level":1,"title":"<code>APC-PRAC-036.c</code>","text":"<p>Problem Statement</p> <p>Check krishnamurty number.</p>","path":["Semester 1","Tuition c","APC-PRAC-036.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-036/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","APC-PRAC-036.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-036/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-036.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-036/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-036.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-037/","level":1,"title":"<code>APC-PRAC-037.c</code>","text":"<p>Problem Statement</p> <p>Show all the armstrong number between a range.</p>","path":["Semester 1","Tuition c","APC-PRAC-037.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-037/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","APC-PRAC-037.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-037/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-037.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-037/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-037.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-038/","level":1,"title":"<code>APC-PRAC-038.c</code>","text":"<p>Problem Statement</p> <p>Print all combinations of two two-digit numbers such that the sum of digits of both numbers is equal. Example: 23 and 41 → (2+3) = 5, (4+1) = 5.</p>","path":["Semester 1","Tuition c","APC-PRAC-038.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-038/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-038.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-038/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-038.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-038/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-038.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-039/","level":1,"title":"<code>APC-PRAC-039.c</code>","text":"<p>Problem Statement</p> <p>Write a C program to print all unique combinations of three numbers (a, b, c) such that: 1 ≤ a, b, c ≤ 30 and a² + b² = c² (Pythagorean triplets)</p>","path":["Semester 1","Tuition c","APC-PRAC-039.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-039/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-039.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-039/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-039.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-039/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-039.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-040/","level":1,"title":"<code>APC-PRAC-040.c</code>","text":"<p>Problem Statement</p> <p>Write a C program to count how many numbers between 100 and 999 have all distinct digits (e.g., 123, 709, 981).</p>","path":["Semester 1","Tuition c","APC-PRAC-040.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-040/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-PRAC-040.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-040/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-040.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-040/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-040.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-041/","level":1,"title":"<code>APC-PRAC-041.c</code>","text":"<p>Problem Statement</p> <p>Write a C program to find and print all twin prime pairs between 1 and n using nested loops. (Twin primes are prime numbers having a difference of 2, like 11 and 13)</p>","path":["Semester 1","Tuition c","APC-PRAC-041.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-041/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","APC-PRAC-041.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-041/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-041.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-041/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-041.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-042/","level":1,"title":"<code>APC-PRAC-042.c</code>","text":"<p>Problem Statement</p> <p>Write a function to check whether a given string is a palindrome. Use this function to determine whether an entered string is Palindrome.</p>","path":["Semester 1","Tuition c","APC-PRAC-042.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-042/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","APC-PRAC-042.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-042/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-PRAC-042.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-PRAC-042/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-PRAC-042.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-001/","level":1,"title":"<code>APC-S-001.c</code>","text":"","path":["Semester 1","Tuition c","APC-S-001.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-001/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-S-001.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-001/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-S-001.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-001/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-S-001.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-002/","level":1,"title":"<code>APC-S-002.c</code>","text":"","path":["Semester 1","Tuition c","APC-S-002.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-002/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-S-002.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-002/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-S-002.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-002/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-S-002.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-003/","level":1,"title":"<code>APC-S-003.c</code>","text":"","path":["Semester 1","Tuition c","APC-S-003.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-003/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-S-003.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-003/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-S-003.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-003/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-S-003.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-004/","level":1,"title":"<code>APC-S-004.c</code>","text":"<p>Problem Statement</p> <p>Program to print first 10 natural numbers using while loop.</p>","path":["Semester 1","Tuition c","APC-S-004.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-004/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-S-004.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-004/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-S-004.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-004/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-S-004.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-005/","level":1,"title":"<code>APC-S-005.c</code>","text":"<p>Problem Statement</p> <p>Write to reverse a number.</p>","path":["Semester 1","Tuition c","APC-S-005.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-005/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-S-005.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-005/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-S-005.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-005/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-S-005.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-006/","level":1,"title":"<code>APC-S-006.c</code>","text":"<p>Problem Statement</p> <p>Write a program to print first 10 multiple of 5</p>","path":["Semester 1","Tuition c","APC-S-006.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-006/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-S-006.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-006/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-S-006.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-006/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-S-006.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-007/","level":1,"title":"<code>APC-S-007.c</code>","text":"<p>Problem Statement</p> <p>Write a program the sum of first 10 natural numbers.</p>","path":["Semester 1","Tuition c","APC-S-007.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-007/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-S-007.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-007/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-S-007.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-007/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-S-007.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-008/","level":1,"title":"<code>APC-S-008.c</code>","text":"<p>Problem Statement</p> <p>Write a program to print the sum of two matrix as input given by the user.</p>","path":["Semester 1","Tuition c","APC-S-008.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-008/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","APC-S-008.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-008/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-S-008.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-008/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-S-008.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-009/","level":1,"title":"<code>APC-S-009.c</code>","text":"<p>Problem Statement</p> <p>Write a program to find the upper and lower triangular matrix.</p>","path":["Semester 1","Tuition c","APC-S-009.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-009/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","APC-S-009.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-009/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-S-009.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-009/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-S-009.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-010/","level":1,"title":"<code>APC-S-010.c</code>","text":"<p>Problem Statement</p> <p>Write a program to input a new element at a specific position of an array. a[] = {4, 5, 2, 10, 6, 9, 8}, newItem = 7, position = 3</p>","path":["Semester 1","Tuition c","APC-S-010.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-010/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-S-010.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-010/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-S-010.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-010/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-S-010.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-011/","level":1,"title":"<code>APC-S-011.c</code>","text":"<p>Problem Statement</p> <p>Linear search</p>","path":["Semester 1","Tuition c","APC-S-011.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-011/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-S-011.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-011/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-S-011.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-011/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-S-011.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-012/","level":1,"title":"<code>APC-S-012.c</code>","text":"<p>Problem Statement</p> <p>Write a program to check if a matrix is a sparx matrix.</p>","path":["Semester 1","Tuition c","APC-S-012.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-012/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-S-012.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-012/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-S-012.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-012/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-S-012.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-013/","level":1,"title":"<code>APC-S-013.c</code>","text":"<p>Problem Statement</p> <p>Write a fuction to calculate the average of an array</p>","path":["Semester 1","Tuition c","APC-S-013.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-013/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-S-013.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-013/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-S-013.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-013/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-S-013.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-014/","level":1,"title":"<code>APC-S-014.c</code>","text":"<p>Problem Statement</p> <p>Write a program to store roll no, name and marks of 5 students then print it. use structure</p>","path":["Semester 1","Tuition c","APC-S-014.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-014/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-S-014.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-014/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-S-014.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-S-014/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-S-014.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-001/","level":1,"title":"<code>APC-SPS-001.c</code>","text":"","path":["Semester 1","Tuition c","APC-SPS-001.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-001/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-SPS-001.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-001/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-SPS-001.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-001/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-SPS-001.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-002/","level":1,"title":"<code>APC-SPS-002.c</code>","text":"<p>Problem Statement</p> <p>WAP to swap two integers. Display both numbers before and after swap</p>","path":["Semester 1","Tuition c","APC-SPS-002.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-002/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-SPS-002.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-002/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-SPS-002.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-002/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-SPS-002.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-003/","level":1,"title":"<code>APC-SPS-003.c</code>","text":"<p>Problem Statement</p> <p>Bitwise AND '&'</p>","path":["Semester 1","Tuition c","APC-SPS-003.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-003/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-SPS-003.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-003/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-SPS-003.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-003/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-SPS-003.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-004/","level":1,"title":"<code>APC-SPS-004.c</code>","text":"","path":["Semester 1","Tuition c","APC-SPS-004.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-004/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-SPS-004.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-004/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-SPS-004.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-004/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-SPS-004.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-005/","level":1,"title":"<code>APC-SPS-005.c</code>","text":"<p>Problem Statement</p> <p>Bitwise OR '|'</p>","path":["Semester 1","Tuition c","APC-SPS-005.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-005/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-SPS-005.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-005/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-SPS-005.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-005/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-SPS-005.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-006/","level":1,"title":"<code>APC-SPS-006.c</code>","text":"<p>Problem Statement</p> <p>Bitwise NOT '~'</p>","path":["Semester 1","Tuition c","APC-SPS-006.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-006/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-SPS-006.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-006/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-SPS-006.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-006/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-SPS-006.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-007/","level":1,"title":"<code>APC-SPS-007.c</code>","text":"<p>Problem Statement</p> <p>WAP to check a number is even or odd using bitwise operator</p>","path":["Semester 1","Tuition c","APC-SPS-007.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-007/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-SPS-007.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-007/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-SPS-007.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-007/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-SPS-007.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-008/","level":1,"title":"<code>APC-SPS-008.c</code>","text":"<p>Problem Statement</p> <p>WAP to calculate area of circle by accepting radius as input</p>","path":["Semester 1","Tuition c","APC-SPS-008.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-008/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","APC-SPS-008.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-008/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","APC-SPS-008.c"],"tags":[]},{"location":"semester_1/tuition-c/APC-SPS-008/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","APC-SPS-008.c"],"tags":[]},{"location":"semester_1/tuition-c/P001/","level":1,"title":"<code>P001.c</code>","text":"","path":["Semester 1","Tuition c","P001.c"],"tags":[]},{"location":"semester_1/tuition-c/P001/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P001.c"],"tags":[]},{"location":"semester_1/tuition-c/P001/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P001.c"],"tags":[]},{"location":"semester_1/tuition-c/P001/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P001.c"],"tags":[]},{"location":"semester_1/tuition-c/P002/","level":1,"title":"<code>P002.c</code>","text":"","path":["Semester 1","Tuition c","P002.c"],"tags":[]},{"location":"semester_1/tuition-c/P002/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P002.c"],"tags":[]},{"location":"semester_1/tuition-c/P002/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P002.c"],"tags":[]},{"location":"semester_1/tuition-c/P002/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P002.c"],"tags":[]},{"location":"semester_1/tuition-c/P003/","level":1,"title":"<code>P003.c</code>","text":"","path":["Semester 1","Tuition c","P003.c"],"tags":[]},{"location":"semester_1/tuition-c/P003/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P003.c"],"tags":[]},{"location":"semester_1/tuition-c/P003/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P003.c"],"tags":[]},{"location":"semester_1/tuition-c/P003/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P003.c"],"tags":[]},{"location":"semester_1/tuition-c/P004/","level":1,"title":"<code>P004.c</code>","text":"<p>Problem Statement</p> <p>WAP to find and display the value of given expression : ((x+3)/4) - ((2x+4)/3) taking the value of x = 5</p>","path":["Semester 1","Tuition c","P004.c"],"tags":[]},{"location":"semester_1/tuition-c/P004/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P004.c"],"tags":[]},{"location":"semester_1/tuition-c/P004/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P004.c"],"tags":[]},{"location":"semester_1/tuition-c/P004/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P004.c"],"tags":[]},{"location":"semester_1/tuition-c/P005/","level":1,"title":"<code>P005.c</code>","text":"<p>Problem Statement</p> <p>A person is paid Rs. 455 for each day he works and fined Rs. 150 for each day he remains absent. WAP to calculate his monthly income taking the number of days present as input.</p>","path":["Semester 1","Tuition c","P005.c"],"tags":[]},{"location":"semester_1/tuition-c/P005/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P005.c"],"tags":[]},{"location":"semester_1/tuition-c/P005/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P005.c"],"tags":[]},{"location":"semester_1/tuition-c/P005/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P005.c"],"tags":[]},{"location":"semester_1/tuition-c/P006/","level":1,"title":"<code>P006.c</code>","text":"<p>Problem Statement</p> <p>The normal temperature of human body is 98.6 Degree Fahrenheit. WAP to convert the temperature to Degree Celcius and display the output.</p>","path":["Semester 1","Tuition c","P006.c"],"tags":[]},{"location":"semester_1/tuition-c/P006/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P006.c"],"tags":[]},{"location":"semester_1/tuition-c/P006/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P006.c"],"tags":[]},{"location":"semester_1/tuition-c/P006/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P006.c"],"tags":[]},{"location":"semester_1/tuition-c/P007/","level":1,"title":"<code>P007.c</code>","text":"<p>Problem Statement</p> <p>A shopkeeper offers 10% discount on printed price of a digital camera. However a customer has to pay 6% GST on the remaining amount. WAP to calculate and display the amount to paid by the customer, taking the printed price as input.</p>","path":["Semester 1","Tuition c","P007.c"],"tags":[]},{"location":"semester_1/tuition-c/P007/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P007.c"],"tags":[]},{"location":"semester_1/tuition-c/P007/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P007.c"],"tags":[]},{"location":"semester_1/tuition-c/P007/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P007.c"],"tags":[]},{"location":"semester_1/tuition-c/P008/","level":1,"title":"<code>P008.c</code>","text":"<p>Problem Statement</p> <p>A shopkeeper offers 30% discount on purchasing an item whereas the other shopkeeper offers 2 successive discount of 20% and 10% for purchasing the same item. WAP to caompute and display the discounted price of the item by taking the price as input.</p>","path":["Semester 1","Tuition c","P008.c"],"tags":[]},{"location":"semester_1/tuition-c/P008/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P008.c"],"tags":[]},{"location":"semester_1/tuition-c/P008/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P008.c"],"tags":[]},{"location":"semester_1/tuition-c/P008/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P008.c"],"tags":[]},{"location":"semester_1/tuition-c/P009/","level":1,"title":"<code>P009.c</code>","text":"<p>Problem Statement</p> <p>WAP to calculate gross and net salary by accepting basic salary as input. IMP : DA = 30% of Basic Pay HRA = 20% of Basic Pay PF = 12.5% of Basic Pay Gross Salary = Basic Pay + DA + HRA Net Salary = Gross Salary - PF</p>","path":["Semester 1","Tuition c","P009.c"],"tags":[]},{"location":"semester_1/tuition-c/P009/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P009.c"],"tags":[]},{"location":"semester_1/tuition-c/P009/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P009.c"],"tags":[]},{"location":"semester_1/tuition-c/P009/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P009.c"],"tags":[]},{"location":"semester_1/tuition-c/P010/","level":1,"title":"<code>P010.c</code>","text":"<p>Problem Statement</p> <p>WAP to find and display the difference between compound Interest and Simple Interest. Take principle amount as input. Hint : si = (p * r * t) / 100 a = p * ((1 + (r / 100)) ^ t) ci = a - p</p>","path":["Semester 1","Tuition c","P010.c"],"tags":[]},{"location":"semester_1/tuition-c/P010/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P010.c"],"tags":[]},{"location":"semester_1/tuition-c/P010/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P010.c"],"tags":[]},{"location":"semester_1/tuition-c/P010/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P010.c"],"tags":[]},{"location":"semester_1/tuition-c/P011/","level":1,"title":"<code>P011.c</code>","text":"<p>Problem Statement</p> <p>The time period of a simple pendulam is given by the formula : t = 2 * pi * square_root(l / g) WAP to calculate T take length(L) and gravity as input</p>","path":["Semester 1","Tuition c","P011.c"],"tags":[]},{"location":"semester_1/tuition-c/P011/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P011.c"],"tags":[]},{"location":"semester_1/tuition-c/P011/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P011.c"],"tags":[]},{"location":"semester_1/tuition-c/P011/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P011.c"],"tags":[]},{"location":"semester_1/tuition-c/P012/","level":1,"title":"<code>P012.c</code>","text":"<p>Problem Statement</p> <p>WAP to swap two integer variable without using third variable</p>","path":["Semester 1","Tuition c","P012.c"],"tags":[]},{"location":"semester_1/tuition-c/P012/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P012.c"],"tags":[]},{"location":"semester_1/tuition-c/P012/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P012.c"],"tags":[]},{"location":"semester_1/tuition-c/P012/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P012.c"],"tags":[]},{"location":"semester_1/tuition-c/P013/","level":1,"title":"<code>P013.c</code>","text":"<p>Problem Statement</p> <p>WAP to swap two integer variable without using third variable</p>","path":["Semester 1","Tuition c","P013.c"],"tags":[]},{"location":"semester_1/tuition-c/P013/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P013.c"],"tags":[]},{"location":"semester_1/tuition-c/P013/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P013.c"],"tags":[]},{"location":"semester_1/tuition-c/P013/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P013.c"],"tags":[]},{"location":"semester_1/tuition-c/P014/","level":1,"title":"<code>P014.c</code>","text":"<p>Problem Statement</p> <p>WAP to accept the diagonal of square. Find and display the area and perimeter of the square.</p>","path":["Semester 1","Tuition c","P014.c"],"tags":[]},{"location":"semester_1/tuition-c/P014/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P014.c"],"tags":[]},{"location":"semester_1/tuition-c/P014/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P014.c"],"tags":[]},{"location":"semester_1/tuition-c/P014/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P014.c"],"tags":[]},{"location":"semester_1/tuition-c/P015/","level":1,"title":"<code>P015.c</code>","text":"<p>Problem Statement</p> <p>WAP to accept number of days and display it after converting into number of years, months and days</p>","path":["Semester 1","Tuition c","P015.c"],"tags":[]},{"location":"semester_1/tuition-c/P015/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P015.c"],"tags":[]},{"location":"semester_1/tuition-c/P015/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P015.c"],"tags":[]},{"location":"semester_1/tuition-c/P015/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P015.c"],"tags":[]},{"location":"semester_1/tuition-c/P016/","level":1,"title":"<code>P016.c</code>","text":"<p>Problem Statement</p> <p>WAP to calculate and display radius of a circle by taking the area as input</p>","path":["Semester 1","Tuition c","P016.c"],"tags":[]},{"location":"semester_1/tuition-c/P016/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P016.c"],"tags":[]},{"location":"semester_1/tuition-c/P016/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P016.c"],"tags":[]},{"location":"semester_1/tuition-c/P016/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P016.c"],"tags":[]},{"location":"semester_1/tuition-c/P017/","level":1,"title":"<code>P017.c</code>","text":"<p>Problem Statement</p> <p>Find maximum between three number.</p>","path":["Semester 1","Tuition c","P017.c"],"tags":[]},{"location":"semester_1/tuition-c/P017/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P017.c"],"tags":[]},{"location":"semester_1/tuition-c/P017/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P017.c"],"tags":[]},{"location":"semester_1/tuition-c/P017/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P017.c"],"tags":[]},{"location":"semester_1/tuition-c/P018/","level":1,"title":"<code>P018.c</code>","text":"<p>Problem Statement</p> <p>WAP to input the cost price and selling price and calculate profit, profit percentage, loss percentage or display the manage nither profit nor loss.</p>","path":["Semester 1","Tuition c","P018.c"],"tags":[]},{"location":"semester_1/tuition-c/P018/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P018.c"],"tags":[]},{"location":"semester_1/tuition-c/P018/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P018.c"],"tags":[]},{"location":"semester_1/tuition-c/P018/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P018.c"],"tags":[]},{"location":"semester_1/tuition-c/P019/","level":1,"title":"<code>P019.c</code>","text":"<p>Problem Statement</p> <p>WAP to input the distance covered and calculate the amount to be paid by the passanger. Distance Rate =<5KM RS 90 next 10KM RS 20/KM next 10KM RS 10/KM more than 25KM RS 9/KM</p>","path":["Semester 1","Tuition c","P019.c"],"tags":[]},{"location":"semester_1/tuition-c/P019/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P019.c"],"tags":[]},{"location":"semester_1/tuition-c/P019/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P019.c"],"tags":[]},{"location":"semester_1/tuition-c/P019/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P019.c"],"tags":[]},{"location":"semester_1/tuition-c/P020/","level":1,"title":"<code>P020.c</code>","text":"<p>Problem Statement</p> <p>WAP to calculate and display the maturity amount taking the sum and number of days as input. No. of Days Rate of Interest Upto 180 days 5.5 % 181 to 364 days 7.5 % exact 365 days 9.0 % more than 365 days 8.5 %</p>","path":["Semester 1","Tuition c","P020.c"],"tags":[]},{"location":"semester_1/tuition-c/P020/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P020.c"],"tags":[]},{"location":"semester_1/tuition-c/P020/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P020.c"],"tags":[]},{"location":"semester_1/tuition-c/P020/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P020.c"],"tags":[]},{"location":"semester_1/tuition-c/P021/","level":1,"title":"<code>P021.c</code>","text":"<p>Problem Statement</p> <p>WAP to input a positive number and check if it is a perfect square number or not.</p>","path":["Semester 1","Tuition c","P021.c"],"tags":[]},{"location":"semester_1/tuition-c/P021/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P021.c"],"tags":[]},{"location":"semester_1/tuition-c/P021/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P021.c"],"tags":[]},{"location":"semester_1/tuition-c/P021/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P021.c"],"tags":[]},{"location":"semester_1/tuition-c/P022/","level":1,"title":"<code>P022.c</code>","text":"<p>Problem Statement</p> <p>WAP to find out smallest of three numbers without using if_else block.</p>","path":["Semester 1","Tuition c","P022.c"],"tags":[]},{"location":"semester_1/tuition-c/P022/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P022.c"],"tags":[]},{"location":"semester_1/tuition-c/P022/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P022.c"],"tags":[]},{"location":"semester_1/tuition-c/P022/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P022.c"],"tags":[]},{"location":"semester_1/tuition-c/P023/","level":1,"title":"<code>P023.c</code>","text":"<p>Problem Statement</p> <p>WAP to input the total cost and compute the amount to be paid by the customer.</p>","path":["Semester 1","Tuition c","P023.c"],"tags":[]},{"location":"semester_1/tuition-c/P023/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P023.c"],"tags":[]},{"location":"semester_1/tuition-c/P023/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P023.c"],"tags":[]},{"location":"semester_1/tuition-c/P023/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P023.c"],"tags":[]},{"location":"semester_1/tuition-c/P024/","level":1,"title":"<code>P024.c</code>","text":"<p>Problem Statement</p> <p>WAP to check whether a year is leapyear or not.</p>","path":["Semester 1","Tuition c","P024.c"],"tags":[]},{"location":"semester_1/tuition-c/P024/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P024.c"],"tags":[]},{"location":"semester_1/tuition-c/P024/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P024.c"],"tags":[]},{"location":"semester_1/tuition-c/P024/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P024.c"],"tags":[]},{"location":"semester_1/tuition-c/P025/","level":1,"title":"<code>P025.c</code>","text":"<p>Problem Statement</p> <p>WAP to input the electricity unit consumed and calculate the total bill amount according to the given condition : for 1st 50 unit Rs. 0.50 per unit next 100 unit Rs. 0.75 per unit next 100 unit Rs. 1.20 per unit above 250 unit Rs. 1.50 per unit And additional charge of 20 percent is added to the bill.</p>","path":["Semester 1","Tuition c","P025.c"],"tags":[]},{"location":"semester_1/tuition-c/P025/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P025.c"],"tags":[]},{"location":"semester_1/tuition-c/P025/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P025.c"],"tags":[]},{"location":"semester_1/tuition-c/P025/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P025.c"],"tags":[]},{"location":"semester_1/tuition-c/P026/","level":1,"title":"<code>P026.c</code>","text":"<p>Problem Statement</p> <p>WAP to input sum (p), rate of interest (r), time (t) and type of interest ('s' for simple interest amd 'c' for compound interest). Calculate and display the interest earned si = (p * r * t) / 100 compoundInterest = p * ((1 + r / 100)^t - 1)</p>","path":["Semester 1","Tuition c","P026.c"],"tags":[]},{"location":"semester_1/tuition-c/P026/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P026.c"],"tags":[]},{"location":"semester_1/tuition-c/P026/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P026.c"],"tags":[]},{"location":"semester_1/tuition-c/P026/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P026.c"],"tags":[]},{"location":"semester_1/tuition-c/P027/","level":1,"title":"<code>P027.c</code>","text":"<p>Problem Statement</p> <p>Purchase Discount on Discount on Amount Laptop Desktop -------- ----------- ----------- Upto 20k 3.0% 5.0% 20001 - 50k 5.0% 7.5% 50001 - 75k 7.5% 10.5% more than 75k 10.0% 15.0% WAP to input amount of purchase and type of purchase ('L' : laptop, 'D' : desktop) and display the discount amount and the discounted price (Net Amount).</p>","path":["Semester 1","Tuition c","P027.c"],"tags":[]},{"location":"semester_1/tuition-c/P027/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","P027.c"],"tags":[]},{"location":"semester_1/tuition-c/P027/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P027.c"],"tags":[]},{"location":"semester_1/tuition-c/P027/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P027.c"],"tags":[]},{"location":"semester_1/tuition-c/P028/","level":1,"title":"<code>P028.c</code>","text":"<p>Problem Statement</p> <p>WAP to calculate factorial of a number</p>","path":["Semester 1","Tuition c","P028.c"],"tags":[]},{"location":"semester_1/tuition-c/P028/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P028.c"],"tags":[]},{"location":"semester_1/tuition-c/P028/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P028.c"],"tags":[]},{"location":"semester_1/tuition-c/P028/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P028.c"],"tags":[]},{"location":"semester_1/tuition-c/P029/","level":1,"title":"<code>P029.c</code>","text":"<p>Problem Statement</p> <p>WAP to perform addition of first n natural numbers. sum = 1 + 2 + 3 + ...</p>","path":["Semester 1","Tuition c","P029.c"],"tags":[]},{"location":"semester_1/tuition-c/P029/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P029.c"],"tags":[]},{"location":"semester_1/tuition-c/P029/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P029.c"],"tags":[]},{"location":"semester_1/tuition-c/P029/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P029.c"],"tags":[]},{"location":"semester_1/tuition-c/P030/","level":1,"title":"<code>P030.c</code>","text":"<p>Problem Statement</p> <p>Display the first 15 terms of the series.</p>","path":["Semester 1","Tuition c","P030.c"],"tags":[]},{"location":"semester_1/tuition-c/P030/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","P030.c"],"tags":[]},{"location":"semester_1/tuition-c/P030/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P030.c"],"tags":[]},{"location":"semester_1/tuition-c/P030/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P030.c"],"tags":[]},{"location":"semester_1/tuition-c/P031/","level":1,"title":"<code>P031.c</code>","text":"<p>Problem Statement</p> <p>Find the sum of the series</p>","path":["Semester 1","Tuition c","P031.c"],"tags":[]},{"location":"semester_1/tuition-c/P031/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P031.c"],"tags":[]},{"location":"semester_1/tuition-c/P031/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P031.c"],"tags":[]},{"location":"semester_1/tuition-c/P031/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P031.c"],"tags":[]},{"location":"semester_1/tuition-c/P032/","level":1,"title":"<code>P032.c</code>","text":"<p>Problem Statement</p> <p>WAP to input a number and check whether it is a Niven number or not. (When a number is divisible by its sum of digit) e.g. : n = 126</p>","path":["Semester 1","Tuition c","P032.c"],"tags":[]},{"location":"semester_1/tuition-c/P032/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P032.c"],"tags":[]},{"location":"semester_1/tuition-c/P032/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P032.c"],"tags":[]},{"location":"semester_1/tuition-c/P032/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P032.c"],"tags":[]},{"location":"semester_1/tuition-c/P033/","level":1,"title":"<code>P033.c</code>","text":"<p>Problem Statement</p> <p>WAP to calculate the sum of even digits and odd digits. Number will be provided by user.</p>","path":["Semester 1","Tuition c","P033.c"],"tags":[]},{"location":"semester_1/tuition-c/P033/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P033.c"],"tags":[]},{"location":"semester_1/tuition-c/P033/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P033.c"],"tags":[]},{"location":"semester_1/tuition-c/P033/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P033.c"],"tags":[]},{"location":"semester_1/tuition-c/P034/","level":1,"title":"<code>P034.c</code>","text":"<p>Problem Statement</p> <p>Get sum of even position digit and odd position digit</p>","path":["Semester 1","Tuition c","P034.c"],"tags":[]},{"location":"semester_1/tuition-c/P034/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P034.c"],"tags":[]},{"location":"semester_1/tuition-c/P034/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P034.c"],"tags":[]},{"location":"semester_1/tuition-c/P034/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P034.c"],"tags":[]},{"location":"semester_1/tuition-c/P035/","level":1,"title":"<code>P035.c</code>","text":"<p>Problem Statement</p> <p>WAP to input an int number and display the product of the successors of even digits of the number entered by user.</p>","path":["Semester 1","Tuition c","P035.c"],"tags":[]},{"location":"semester_1/tuition-c/P035/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P035.c"],"tags":[]},{"location":"semester_1/tuition-c/P035/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P035.c"],"tags":[]},{"location":"semester_1/tuition-c/P035/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P035.c"],"tags":[]},{"location":"semester_1/tuition-c/P036/","level":1,"title":"<code>P036.c</code>","text":"<p>Problem Statement</p> <p>sum = a + (a^2)/2 + (a^3)/3 + ... + (a^n)/n</p>","path":["Semester 1","Tuition c","P036.c"],"tags":[]},{"location":"semester_1/tuition-c/P036/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P036.c"],"tags":[]},{"location":"semester_1/tuition-c/P036/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P036.c"],"tags":[]},{"location":"semester_1/tuition-c/P036/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P036.c"],"tags":[]},{"location":"semester_1/tuition-c/P037/","level":1,"title":"<code>P037.c</code>","text":"<p>Problem Statement</p> <p>sum = 1 + 1+2/12 + 1+2+3/123 + ... + 1+2+3+...+n/123...*n</p>","path":["Semester 1","Tuition c","P037.c"],"tags":[]},{"location":"semester_1/tuition-c/P037/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P037.c"],"tags":[]},{"location":"semester_1/tuition-c/P037/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P037.c"],"tags":[]},{"location":"semester_1/tuition-c/P037/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P037.c"],"tags":[]},{"location":"semester_1/tuition-c/P038/","level":1,"title":"<code>P038.c</code>","text":"<p>Problem Statement</p> <p>Write a program to check prime number</p>","path":["Semester 1","Tuition c","P038.c"],"tags":[]},{"location":"semester_1/tuition-c/P038/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","P038.c"],"tags":[]},{"location":"semester_1/tuition-c/P038/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P038.c"],"tags":[]},{"location":"semester_1/tuition-c/P038/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P038.c"],"tags":[]},{"location":"semester_1/tuition-c/P039/","level":1,"title":"<code>P039.c</code>","text":"<p>Problem Statement</p> <p>Write a program to print all the factors of a postive integer</p>","path":["Semester 1","Tuition c","P039.c"],"tags":[]},{"location":"semester_1/tuition-c/P039/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P039.c"],"tags":[]},{"location":"semester_1/tuition-c/P039/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P039.c"],"tags":[]},{"location":"semester_1/tuition-c/P039/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P039.c"],"tags":[]},{"location":"semester_1/tuition-c/P040/","level":1,"title":"<code>P040.c</code>","text":"<p>Problem Statement</p> <p>Write a program to calculate HCF of two positive number</p>","path":["Semester 1","Tuition c","P040.c"],"tags":[]},{"location":"semester_1/tuition-c/P040/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P040.c"],"tags":[]},{"location":"semester_1/tuition-c/P040/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P040.c"],"tags":[]},{"location":"semester_1/tuition-c/P040/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P040.c"],"tags":[]},{"location":"semester_1/tuition-c/P041/","level":1,"title":"<code>P041.c</code>","text":"<p>Problem Statement</p> <p>Write a program to enter two numbers and check they are co-prime or not. co-prime when HCF = 1</p>","path":["Semester 1","Tuition c","P041.c"],"tags":[]},{"location":"semester_1/tuition-c/P041/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P041.c"],"tags":[]},{"location":"semester_1/tuition-c/P041/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P041.c"],"tags":[]},{"location":"semester_1/tuition-c/P041/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P041.c"],"tags":[]},{"location":"semester_1/tuition-c/P042/","level":1,"title":"<code>P042.c</code>","text":"<p>Problem Statement</p> <p>Write a program to accept a number and check whether the number is twisted prime or not.</p>","path":["Semester 1","Tuition c","P042.c"],"tags":[]},{"location":"semester_1/tuition-c/P042/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","P042.c"],"tags":[]},{"location":"semester_1/tuition-c/P042/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P042.c"],"tags":[]},{"location":"semester_1/tuition-c/P042/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P042.c"],"tags":[]},{"location":"semester_1/tuition-c/P043/","level":1,"title":"<code>P043.c</code>","text":"<p>Problem Statement</p> <p>Write a program to check palindrome number.</p>","path":["Semester 1","Tuition c","P043.c"],"tags":[]},{"location":"semester_1/tuition-c/P043/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P043.c"],"tags":[]},{"location":"semester_1/tuition-c/P043/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P043.c"],"tags":[]},{"location":"semester_1/tuition-c/P043/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P043.c"],"tags":[]},{"location":"semester_1/tuition-c/P044/","level":1,"title":"<code>P044.c</code>","text":"<p>Problem Statement</p> <p>Write a program to input a number and check whether the number is Pronic number or not. Pronic Number: The number which is the product of two numbers which is the product of two consecutive integer. Ex: 20 = 4 * 5</p>","path":["Semester 1","Tuition c","P044.c"],"tags":[]},{"location":"semester_1/tuition-c/P044/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","P044.c"],"tags":[]},{"location":"semester_1/tuition-c/P044/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P044.c"],"tags":[]},{"location":"semester_1/tuition-c/P044/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P044.c"],"tags":[]},{"location":"semester_1/tuition-c/P045/","level":1,"title":"<code>P045.c</code>","text":"<p>Problem Statement</p> <p>Make this pattern for input n. Pattern : 1 1 2 1 2 3 1 2 3 4 1 2 3 4 5</p>","path":["Semester 1","Tuition c","P045.c"],"tags":[]},{"location":"semester_1/tuition-c/P045/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P045.c"],"tags":[]},{"location":"semester_1/tuition-c/P045/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P045.c"],"tags":[]},{"location":"semester_1/tuition-c/P045/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P045.c"],"tags":[]},{"location":"semester_1/tuition-c/P046/","level":1,"title":"<code>P046.c</code>","text":"<p>Problem Statement</p> <p>Make this pattern for input n. Pattern : 1 2 1 3 2 1 4 3 2 1 5 4 3 2 1</p>","path":["Semester 1","Tuition c","P046.c"],"tags":[]},{"location":"semester_1/tuition-c/P046/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P046.c"],"tags":[]},{"location":"semester_1/tuition-c/P046/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P046.c"],"tags":[]},{"location":"semester_1/tuition-c/P046/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P046.c"],"tags":[]},{"location":"semester_1/tuition-c/P047/","level":1,"title":"<code>P047.c</code>","text":"<p>Problem Statement</p> <p>Make this pattern for input n. Pattern : 5 5 4 5 4 3 5 4 3 2 5 4 3 2 1</p>","path":["Semester 1","Tuition c","P047.c"],"tags":[]},{"location":"semester_1/tuition-c/P047/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P047.c"],"tags":[]},{"location":"semester_1/tuition-c/P047/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P047.c"],"tags":[]},{"location":"semester_1/tuition-c/P047/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P047.c"],"tags":[]},{"location":"semester_1/tuition-c/P048/","level":1,"title":"<code>P048.c</code>","text":"<p>Problem Statement</p> <p>Make this pattern for input n no of row. Pattern : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15</p>","path":["Semester 1","Tuition c","P048.c"],"tags":[]},{"location":"semester_1/tuition-c/P048/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P048.c"],"tags":[]},{"location":"semester_1/tuition-c/P048/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P048.c"],"tags":[]},{"location":"semester_1/tuition-c/P048/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P048.c"],"tags":[]},{"location":"semester_1/tuition-c/P049/","level":1,"title":"<code>P049.c</code>","text":"<p>Problem Statement</p> <p>Make this pattern for input n no of row. Pattern : # @ @ # # # @ @ @ @ # # # # #</p>","path":["Semester 1","Tuition c","P049.c"],"tags":[]},{"location":"semester_1/tuition-c/P049/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P049.c"],"tags":[]},{"location":"semester_1/tuition-c/P049/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P049.c"],"tags":[]},{"location":"semester_1/tuition-c/P049/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P049.c"],"tags":[]},{"location":"semester_1/tuition-c/P050-SHORT/","level":1,"title":"<code>P050-SHORT.c</code>","text":"<p>Problem Statement</p> <p>Write a program to input a number and check whether it is Disarium Number or not. Note : A number is said to Disarium if sum of its digit powered by with their respective position is equal to the original number.</p>","path":["Semester 1","Tuition c","P050-SHORT.c"],"tags":[]},{"location":"semester_1/tuition-c/P050-SHORT/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P050-SHORT.c"],"tags":[]},{"location":"semester_1/tuition-c/P050-SHORT/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P050-SHORT.c"],"tags":[]},{"location":"semester_1/tuition-c/P050-SHORT/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P050-SHORT.c"],"tags":[]},{"location":"semester_1/tuition-c/P050/","level":1,"title":"<code>P050.c</code>","text":"<p>Problem Statement</p> <p>Write a program to input a number and check whether it is Disarium Number or not. Note : A number is said to Disarium if sum of its digit powered by with their respective position is equal to the original number.</p>","path":["Semester 1","Tuition c","P050.c"],"tags":[]},{"location":"semester_1/tuition-c/P050/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P050.c"],"tags":[]},{"location":"semester_1/tuition-c/P050/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P050.c"],"tags":[]},{"location":"semester_1/tuition-c/P050/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P050.c"],"tags":[]},{"location":"semester_1/tuition-c/P051/","level":1,"title":"<code>P051.c</code>","text":"<p>Problem Statement</p> <p>Write a program to input two number and check whether they are Amicable Pair or not Example : Sum of Proper Divisors of 220 (1, 2, 4, 5, 10, 11, 20, 22, 44, 55, 110) = 284 Sum of Proper Divisors of 284 (1, 2, 4, 71, 142) = 220</p>","path":["Semester 1","Tuition c","P051.c"],"tags":[]},{"location":"semester_1/tuition-c/P051/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P051.c"],"tags":[]},{"location":"semester_1/tuition-c/P051/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P051.c"],"tags":[]},{"location":"semester_1/tuition-c/P051/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P051.c"],"tags":[]},{"location":"semester_1/tuition-c/P052/","level":1,"title":"<code>P052.c</code>","text":"<p>Problem Statement</p> <p>Print the sum of this series for upto n element. Series: 1 + (1 + 2) + (1 + 2 + 3) + (1 + 2 + 3 + 4) + ... + (1 + 2 + 3 + ... + n)</p>","path":["Semester 1","Tuition c","P052.c"],"tags":[]},{"location":"semester_1/tuition-c/P052/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P052.c"],"tags":[]},{"location":"semester_1/tuition-c/P052/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P052.c"],"tags":[]},{"location":"semester_1/tuition-c/P052/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P052.c"],"tags":[]},{"location":"semester_1/tuition-c/P053/","level":1,"title":"<code>P053.c</code>","text":"<p>Problem Statement</p> <p>Print all pattern</p>","path":["Semester 1","Tuition c","P053.c"],"tags":[]},{"location":"semester_1/tuition-c/P053/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","P053.c"],"tags":[]},{"location":"semester_1/tuition-c/P053/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P053.c"],"tags":[]},{"location":"semester_1/tuition-c/P053/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P053.c"],"tags":[]},{"location":"semester_1/tuition-c/P054/","level":1,"title":"<code>P054.c</code>","text":"<p>Problem Statement</p> <p>WAP to check Krishnamurty number using user defined methods/functions.</p>","path":["Semester 1","Tuition c","P054.c"],"tags":[]},{"location":"semester_1/tuition-c/P054/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","P054.c"],"tags":[]},{"location":"semester_1/tuition-c/P054/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P054.c"],"tags":[]},{"location":"semester_1/tuition-c/P054/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P054.c"],"tags":[]},{"location":"semester_1/tuition-c/P055/","level":1,"title":"<code>P055.c</code>","text":"<p>Problem Statement</p> <p>WAP to print n terms of Fibbonacci Series (Starting from term 0)</p>","path":["Semester 1","Tuition c","P055.c"],"tags":[]},{"location":"semester_1/tuition-c/P055/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P055.c"],"tags":[]},{"location":"semester_1/tuition-c/P055/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P055.c"],"tags":[]},{"location":"semester_1/tuition-c/P055/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P055.c"],"tags":[]},{"location":"semester_1/tuition-c/P056/","level":1,"title":"<code>P056.c</code>","text":"<p>Problem Statement</p> <p>WAP to swap the value of a and b using user defined method.</p>","path":["Semester 1","Tuition c","P056.c"],"tags":[]},{"location":"semester_1/tuition-c/P056/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P056.c"],"tags":[]},{"location":"semester_1/tuition-c/P056/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P056.c"],"tags":[]},{"location":"semester_1/tuition-c/P056/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P056.c"],"tags":[]},{"location":"semester_1/tuition-c/P057/","level":1,"title":"<code>P057.c</code>","text":"<p>Problem Statement</p> <p>WAP to display the series using user defined method. 0, 7, 26, 63, ... upto n terms using void series(int n)</p>","path":["Semester 1","Tuition c","P057.c"],"tags":[]},{"location":"semester_1/tuition-c/P057/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P057.c"],"tags":[]},{"location":"semester_1/tuition-c/P057/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P057.c"],"tags":[]},{"location":"semester_1/tuition-c/P057/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P057.c"],"tags":[]},{"location":"semester_1/tuition-c/P058/","level":1,"title":"<code>P058.c</code>","text":"<p>Problem Statement</p> <p>WAP to display ASCII code of Alphabets (A - Z) using void displayASCII()</p>","path":["Semester 1","Tuition c","P058.c"],"tags":[]},{"location":"semester_1/tuition-c/P058/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P058.c"],"tags":[]},{"location":"semester_1/tuition-c/P058/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P058.c"],"tags":[]},{"location":"semester_1/tuition-c/P058/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P058.c"],"tags":[]},{"location":"semester_1/tuition-c/P059/","level":1,"title":"<code>P059.c</code>","text":"<p>Problem Statement</p> <p>Write a program to find the sum of array elements using following fuctions int array_sum(int a[], int n); void get_data(int a[], int n); void dispaly(int a[], int n);</p>","path":["Semester 1","Tuition c","P059.c"],"tags":[]},{"location":"semester_1/tuition-c/P059/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 12 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","P059.c"],"tags":[]},{"location":"semester_1/tuition-c/P059/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P059.c"],"tags":[]},{"location":"semester_1/tuition-c/P059/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P059.c"],"tags":[]},{"location":"semester_1/tuition-c/P060/","level":1,"title":"<code>P060.c</code>","text":"<p>Problem Statement</p> <p>write a C program to count the occurrences of a given element in an array using a user-defined function. Create a function int count_occurrences(int arr[], int n, int target) that countts how many times target appears in the array.</p>","path":["Semester 1","Tuition c","P060.c"],"tags":[]},{"location":"semester_1/tuition-c/P060/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 13 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","P060.c"],"tags":[]},{"location":"semester_1/tuition-c/P060/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P060.c"],"tags":[]},{"location":"semester_1/tuition-c/P060/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P060.c"],"tags":[]},{"location":"semester_1/tuition-c/P061/","level":1,"title":"<code>P061.c</code>","text":"<p>Problem Statement</p> <p>Write a C program to find the sum of even elements in an array using a user defined function. Define a functions int sumEven(int arr[], int n) that returns the sum of all even elements in the array.</p>","path":["Semester 1","Tuition c","P061.c"],"tags":[]},{"location":"semester_1/tuition-c/P061/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P061.c"],"tags":[]},{"location":"semester_1/tuition-c/P061/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P061.c"],"tags":[]},{"location":"semester_1/tuition-c/P061/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P061.c"],"tags":[]},{"location":"semester_1/tuition-c/P062/","level":1,"title":"<code>P062.c</code>","text":"<p>Problem Statement</p> <p>Write a C program to find the smallest and largest in an array using user-defined functions. Define two functions int findSmallest(int arr[], int n) and int findLargest(int arr[], int n) that return the smallest and largest elements in an array, respectively.</p>","path":["Semester 1","Tuition c","P062.c"],"tags":[]},{"location":"semester_1/tuition-c/P062/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 16 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","P062.c"],"tags":[]},{"location":"semester_1/tuition-c/P062/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P062.c"],"tags":[]},{"location":"semester_1/tuition-c/P062/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P062.c"],"tags":[]},{"location":"semester_1/tuition-c/P063/","level":1,"title":"<code>P063.c</code>","text":"<p>Problem Statement</p> <p>Write a C program to find all Niven in an array. Define a user-defined function int isNiven(int num) that returns 1 if the numbers is a Niven number, otherwise returns 0. A Niven number (also known as a Harshad Number) is an integer that is divisible by the sum of its digits.</p>","path":["Semester 1","Tuition c","P063.c"],"tags":[]},{"location":"semester_1/tuition-c/P063/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 16 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","P063.c"],"tags":[]},{"location":"semester_1/tuition-c/P063/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P063.c"],"tags":[]},{"location":"semester_1/tuition-c/P063/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P063.c"],"tags":[]},{"location":"semester_1/tuition-c/P064/","level":1,"title":"<code>P064.c</code>","text":"<p>Problem Statement</p> <p>Write a program to merge two sorted integer arrays to form a single sorted array.</p>","path":["Semester 1","Tuition c","P064.c"],"tags":[]},{"location":"semester_1/tuition-c/P064/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 21 Dec 2025 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","P064.c"],"tags":[]},{"location":"semester_1/tuition-c/P064/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P064.c"],"tags":[]},{"location":"semester_1/tuition-c/P064/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P064.c"],"tags":[]},{"location":"semester_1/tuition-c/P065/","level":1,"title":"<code>P065.c</code>","text":"<p>Problem Statement</p> <p>Write a program to reverse a string</p>","path":["Semester 1","Tuition c","P065.c"],"tags":[]},{"location":"semester_1/tuition-c/P065/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P065.c"],"tags":[]},{"location":"semester_1/tuition-c/P065/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P065.c"],"tags":[]},{"location":"semester_1/tuition-c/P065/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P065.c"],"tags":[]},{"location":"semester_1/tuition-c/P066/","level":1,"title":"<code>P066.c</code>","text":"<p>Problem Statement</p> <p>WAP to find the length of a string using i) Library Method ii) User defined method</p>","path":["Semester 1","Tuition c","P066.c"],"tags":[]},{"location":"semester_1/tuition-c/P066/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P066.c"],"tags":[]},{"location":"semester_1/tuition-c/P066/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P066.c"],"tags":[]},{"location":"semester_1/tuition-c/P066/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P066.c"],"tags":[]},{"location":"semester_1/tuition-c/P067/","level":1,"title":"<code>P067.c</code>","text":"<p>Problem Statement</p> <p>Write a program using function which concatenates two string s1 and s2 in to a third string</p>","path":["Semester 1","Tuition c","P067.c"],"tags":[]},{"location":"semester_1/tuition-c/P067/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P067.c"],"tags":[]},{"location":"semester_1/tuition-c/P067/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P067.c"],"tags":[]},{"location":"semester_1/tuition-c/P067/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P067.c"],"tags":[]},{"location":"semester_1/tuition-c/P068/","level":1,"title":"<code>P068.c</code>","text":"<p>Problem Statement</p> <p>Write a c program that perform the operation of strcmp()</p>","path":["Semester 1","Tuition c","P068.c"],"tags":[]},{"location":"semester_1/tuition-c/P068/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta (amitdutta4255@gmail.com) License MIT","path":["Semester 1","Tuition c","P068.c"],"tags":[]},{"location":"semester_1/tuition-c/P068/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P068.c"],"tags":[]},{"location":"semester_1/tuition-c/P068/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P068.c"],"tags":[]},{"location":"semester_1/tuition-c/P069/","level":1,"title":"<code>P069.c</code>","text":"<p>Problem Statement</p> <p>Write a program using user defined method to implement the following JAVA PROG Mastery -> JPM java prog mastery -> JPM Acharya Prafulla Chandra -> JPM</p>","path":["Semester 1","Tuition c","P069.c"],"tags":[]},{"location":"semester_1/tuition-c/P069/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 14 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","P069.c"],"tags":[]},{"location":"semester_1/tuition-c/P069/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P069.c"],"tags":[]},{"location":"semester_1/tuition-c/P069/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P069.c"],"tags":[]},{"location":"semester_1/tuition-c/P070/","level":1,"title":"<code>P070.c</code>","text":"<p>Problem Statement</p> <p>Write a program to perform addition of two complex number having fields 'real' and 'img' of type integer.</p>","path":["Semester 1","Tuition c","P070.c"],"tags":[]},{"location":"semester_1/tuition-c/P070/#metadata","level":2,"title":"Metadata","text":"Property Detail Author Amit Dutta amitdutta4255@gmail.com Date 24 Jan 2026 License MIT License (See the LICENSE file for details)","path":["Semester 1","Tuition c","P070.c"],"tags":[]},{"location":"semester_1/tuition-c/P070/#actions","level":2,"title":"Actions","text":"Raw View on GitHub Copy URL <p>You can print or save this file by opening Raw and using your browser.</p> Actions Actions Raw View on GitHub Copy URL","path":["Semester 1","Tuition c","P070.c"],"tags":[]},{"location":"semester_1/tuition-c/P070/#source-code","level":2,"title":"Source Code","text":"","path":["Semester 1","Tuition c","P070.c"],"tags":[]},{"location":"semester_2/","level":1,"title":"Index","text":"<p>Semester Pending</p>","path":["Semester 2","Index"],"tags":[]},{"location":"semester_2/#this-folder-is-currently-empty","level":2,"title":"This folder is currently empty","text":"<p>I am still completing Semester 1. This repository is a live documentation of my progress through the BSc Computer Science program at Acharya Prafulla Chandra College (APC).</p> <p>Current Activity:</p> <ul> <li>See active work in Semester 1</li> <li>Real-time updates as the academic session progresses.</li> </ul> <p>Explore More:</p> <ul> <li>Check out my full project gallery on my Portfolio</li> <li>View my other repositories on GitHub</li> </ul>","path":["Semester 2","Index"],"tags":[]},{"location":"semester_3/","level":1,"title":"Index","text":"<p>Semester Pending</p>","path":["Semester 3","Index"],"tags":[]},{"location":"semester_3/#this-folder-is-currently-empty","level":2,"title":"This folder is currently empty","text":"<p>I am still completing Semester 1. This repository is a live documentation of my progress through the BSc Computer Science program at Acharya Prafulla Chandra College (APC).</p> <p>Current Activity:</p> <ul> <li>See active work in Semester 1</li> <li>Real-time updates as the academic session progresses.</li> </ul> <p>Explore More:</p> <ul> <li>Check out my full project gallery on my Portfolio</li> <li>View my other repositories on GitHub</li> </ul>","path":["Semester 3","Index"],"tags":[]},{"location":"semester_4/","level":1,"title":"Index","text":"<p>Semester Pending</p>","path":["Semester 4","Index"],"tags":[]},{"location":"semester_4/#this-folder-is-currently-empty","level":2,"title":"This folder is currently empty","text":"<p>I am still completing Semester 1. This repository is a live documentation of my progress through the BSc Computer Science program at Acharya Prafulla Chandra College (APC).</p> <p>Current Activity:</p> <ul> <li>See active work in Semester 1</li> <li>Real-time updates as the academic session progresses.</li> </ul> <p>Explore More:</p> <ul> <li>Check out my full project gallery on my Portfolio</li> <li>View my other repositories on GitHub</li> </ul>","path":["Semester 4","Index"],"tags":[]},{"location":"semester_5/","level":1,"title":"Index","text":"<p>Semester Pending</p>","path":["Semester 5","Index"],"tags":[]},{"location":"semester_5/#this-folder-is-currently-empty","level":2,"title":"This folder is currently empty","text":"<p>I am still completing Semester 1. This repository is a live documentation of my progress through the BSc Computer Science program at Acharya Prafulla Chandra College (APC).</p> <p>Current Activity:</p> <ul> <li>See active work in Semester 1</li> <li>Real-time updates as the academic session progresses.</li> </ul> <p>Explore More:</p> <ul> <li>Check out my full project gallery on my Portfolio</li> <li>View my other repositories on GitHub</li> </ul>","path":["Semester 5","Index"],"tags":[]},{"location":"semester_6/","level":1,"title":"Index","text":"<p>Semester Pending</p>","path":["Semester 6","Index"],"tags":[]},{"location":"semester_6/#this-folder-is-currently-empty","level":2,"title":"This folder is currently empty","text":"<p>I am still completing Semester 1. This repository is a live documentation of my progress through the BSc Computer Science program at Acharya Prafulla Chandra College (APC).</p> <p>Current Activity:</p> <ul> <li>See active work in Semester 1</li> <li>Real-time updates as the academic session progresses.</li> </ul> <p>Explore More:</p> <ul> <li>Check out my full project gallery on my Portfolio</li> <li>View my other repositories on GitHub</li> </ul>","path":["Semester 6","Index"],"tags":[]},{"location":"semester_7/","level":1,"title":"Index","text":"<p>Semester Pending</p>","path":["Semester 7","Index"],"tags":[]},{"location":"semester_7/#this-folder-is-currently-empty","level":2,"title":"This folder is currently empty","text":"<p>I am still completing Semester 1. This repository is a live documentation of my progress through the BSc Computer Science program at Acharya Prafulla Chandra College (APC).</p> <p>Current Activity:</p> <ul> <li>See active work in Semester 1</li> <li>Real-time updates as the academic session progresses.</li> </ul> <p>Explore More:</p> <ul> <li>Check out my full project gallery on my Portfolio</li> <li>View my other repositories on GitHub</li> </ul>","path":["Semester 7","Index"],"tags":[]},{"location":"semester_8/","level":1,"title":"Index","text":"<p>Semester Pending</p>","path":["Semester 8","Index"],"tags":[]},{"location":"semester_8/#this-folder-is-currently-empty","level":2,"title":"This folder is currently empty","text":"<p>I am still completing Semester 1. This repository is a live documentation of my progress through the BSc Computer Science program at Acharya Prafulla Chandra College (APC).</p> <p>Current Activity:</p> <ul> <li>See active work in Semester 1</li> <li>Real-time updates as the academic session progresses.</li> </ul> <p>Explore More:</p> <ul> <li>Check out my full project gallery on my Portfolio</li> <li>View my other repositories on GitHub</li> </ul>","path":["Semester 8","Index"],"tags":[]}]}+ \ No newline at end of file diff --git a/docs/semester_1/R/Code/R_Code-1/index.html b/docs/semester_1/R/Code/R_Code-1/index.html @@ -8757,6 +8757,8 @@ + + @@ -8871,6 +8873,35 @@ <li class="md-nav__item"> + <a href="../../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/R/Code/R_Code-10/index.html b/docs/semester_1/R/Code/R_Code-10/index.html @@ -8757,6 +8757,8 @@ + + @@ -8871,6 +8873,35 @@ <li class="md-nav__item"> + <a href="../../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/R/Code/R_Code-11/index.html b/docs/semester_1/R/Code/R_Code-11/index.html @@ -8757,6 +8757,8 @@ + + @@ -8871,6 +8873,35 @@ <li class="md-nav__item"> + <a href="../../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/R/Code/R_Code-12/index.html b/docs/semester_1/R/Code/R_Code-12/index.html @@ -8757,6 +8757,8 @@ + + @@ -8871,6 +8873,35 @@ <li class="md-nav__item"> + <a href="../../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/R/Code/R_Code-13/index.html b/docs/semester_1/R/Code/R_Code-13/index.html @@ -8757,6 +8757,8 @@ + + @@ -8871,6 +8873,35 @@ <li class="md-nav__item"> + <a href="../../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/R/Code/R_Code-14/index.html b/docs/semester_1/R/Code/R_Code-14/index.html @@ -8757,6 +8757,8 @@ + + @@ -8871,6 +8873,35 @@ <li class="md-nav__item"> + <a href="../../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/R/Code/R_Code-15/index.html b/docs/semester_1/R/Code/R_Code-15/index.html @@ -8746,6 +8746,8 @@ + + @@ -8860,6 +8862,35 @@ <li class="md-nav__item"> + <a href="../../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/R/Code/R_Code-2/index.html b/docs/semester_1/R/Code/R_Code-2/index.html @@ -8757,6 +8757,8 @@ + + @@ -8871,6 +8873,35 @@ <li class="md-nav__item"> + <a href="../../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/R/Code/R_Code-4/index.html b/docs/semester_1/R/Code/R_Code-4/index.html @@ -8757,6 +8757,8 @@ + + @@ -8871,6 +8873,35 @@ <li class="md-nav__item"> + <a href="../../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/R/Code/R_Code-5/index.html b/docs/semester_1/R/Code/R_Code-5/index.html @@ -8757,6 +8757,8 @@ + + @@ -8871,6 +8873,35 @@ <li class="md-nav__item"> + <a href="../../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/R/Code/R_Code-6/index.html b/docs/semester_1/R/Code/R_Code-6/index.html @@ -8757,6 +8757,8 @@ + + @@ -8871,6 +8873,35 @@ <li class="md-nav__item"> + <a href="../../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/R/Code/R_Code-7/index.html b/docs/semester_1/R/Code/R_Code-7/index.html @@ -8757,6 +8757,8 @@ + + @@ -8871,6 +8873,35 @@ <li class="md-nav__item"> + <a href="../../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/R/Code/R_Code-8/index.html b/docs/semester_1/R/Code/R_Code-8/index.html @@ -8757,6 +8757,8 @@ + + @@ -8871,6 +8873,35 @@ <li class="md-nav__item"> + <a href="../../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/R/Code/R_Code-9/index.html b/docs/semester_1/R/Code/R_Code-9/index.html @@ -8757,6 +8757,8 @@ + + @@ -8871,6 +8873,35 @@ <li class="md-nav__item"> + <a href="../../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/R/Code/R_Prac-1/index.html b/docs/semester_1/R/Code/R_Prac-1/index.html @@ -8757,6 +8757,8 @@ + + @@ -8871,6 +8873,35 @@ <li class="md-nav__item"> + <a href="../../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/R/Code/R_Prac-2/index.html b/docs/semester_1/R/Code/R_Prac-2/index.html @@ -8757,6 +8757,8 @@ + + @@ -8871,6 +8873,35 @@ <li class="md-nav__item"> + <a href="../../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/R/Code/R_Prac-3/index.html b/docs/semester_1/R/Code/R_Prac-3/index.html @@ -8757,6 +8757,8 @@ + + @@ -8871,6 +8873,35 @@ <li class="md-nav__item"> + <a href="../../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/R/Code/R_Prac-4/index.html b/docs/semester_1/R/Code/R_Prac-4/index.html @@ -8757,6 +8757,8 @@ + + @@ -8871,6 +8873,35 @@ <li class="md-nav__item"> + <a href="../../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/R/Code/R_Prac-5/index.html b/docs/semester_1/R/Code/R_Prac-5/index.html @@ -8757,6 +8757,8 @@ + + @@ -8871,6 +8873,35 @@ <li class="md-nav__item"> + <a href="../../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/R/Code/R_Prac-6/index.html b/docs/semester_1/R/Code/R_Prac-6/index.html @@ -8757,6 +8757,8 @@ + + @@ -8871,6 +8873,35 @@ <li class="md-nav__item"> + <a href="../../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/R/Code/R_code-3/index.html b/docs/semester_1/R/Code/R_code-3/index.html @@ -8757,6 +8757,8 @@ + + @@ -8871,6 +8873,35 @@ <li class="md-nav__item"> + <a href="../../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/R/Code/index.html b/docs/semester_1/R/Code/index.html @@ -8675,6 +8675,8 @@ + + @@ -8789,6 +8791,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/R/index.html b/docs/semester_1/R/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/R/temp/index.html b/docs/semester_1/R/temp/index.html @@ -8744,6 +8744,8 @@ + + @@ -8858,6 +8860,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-primary/assignment-p-01/index.html b/docs/semester_1/assignment-primary/assignment-p-01/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-primary/assignment-p-02/index.html b/docs/semester_1/assignment-primary/assignment-p-02/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-primary/assignment-p-03/index.html b/docs/semester_1/assignment-primary/assignment-p-03/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-primary/assignment-p-04/index.html b/docs/semester_1/assignment-primary/assignment-p-04/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-primary/assignment-p-05/index.html b/docs/semester_1/assignment-primary/assignment-p-05/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-primary/assignment-p-06/index.html b/docs/semester_1/assignment-primary/assignment-p-06/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-primary/assignment-p-07/index.html b/docs/semester_1/assignment-primary/assignment-p-07/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-primary/assignment-p-08/index.html b/docs/semester_1/assignment-primary/assignment-p-08/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-primary/assignment-p-09/index.html b/docs/semester_1/assignment-primary/assignment-p-09/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-primary/assignment-p-10/index.html b/docs/semester_1/assignment-primary/assignment-p-10/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-primary/assignment-p-11/index.html b/docs/semester_1/assignment-primary/assignment-p-11/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-primary/assignment-p-12_v1/index.html b/docs/semester_1/assignment-primary/assignment-p-12_v1/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-primary/assignment-p-12_v2/index.html b/docs/semester_1/assignment-primary/assignment-p-12_v2/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-primary/assignment-p-13/index.html b/docs/semester_1/assignment-primary/assignment-p-13/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-primary/assignment-p-14_v1/index.html b/docs/semester_1/assignment-primary/assignment-p-14_v1/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-primary/assignment-p-14_v2/index.html b/docs/semester_1/assignment-primary/assignment-p-14_v2/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-primary/assignment-p-15/index.html b/docs/semester_1/assignment-primary/assignment-p-15/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-primary/index.html b/docs/semester_1/assignment-primary/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-secondary/assignment-s-01/index.html b/docs/semester_1/assignment-secondary/assignment-s-01/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-secondary/assignment-s-02/index.html b/docs/semester_1/assignment-secondary/assignment-s-02/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-secondary/assignment-s-03/index.html b/docs/semester_1/assignment-secondary/assignment-s-03/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-secondary/assignment-s-04/index.html b/docs/semester_1/assignment-secondary/assignment-s-04/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-secondary/assignment-s-05/index.html b/docs/semester_1/assignment-secondary/assignment-s-05/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-secondary/assignment-s-06/index.html b/docs/semester_1/assignment-secondary/assignment-s-06/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-secondary/assignment-s-07/index.html b/docs/semester_1/assignment-secondary/assignment-s-07/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-secondary/assignment-s-08/index.html b/docs/semester_1/assignment-secondary/assignment-s-08/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-secondary/assignment-s-09/index.html b/docs/semester_1/assignment-secondary/assignment-s-09/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-secondary/assignment-s-10/index.html b/docs/semester_1/assignment-secondary/assignment-s-10/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-secondary/assignment-s-11/index.html b/docs/semester_1/assignment-secondary/assignment-s-11/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-secondary/assignment-s-12/index.html b/docs/semester_1/assignment-secondary/assignment-s-12/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-secondary/assignment-s-13-1/index.html b/docs/semester_1/assignment-secondary/assignment-s-13-1/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-secondary/assignment-s-13-2/index.html b/docs/semester_1/assignment-secondary/assignment-s-13-2/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-secondary/assignment-s-14/index.html b/docs/semester_1/assignment-secondary/assignment-s-14/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-secondary/assignment-s-15/index.html b/docs/semester_1/assignment-secondary/assignment-s-15/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-secondary/assignment-s-16/index.html b/docs/semester_1/assignment-secondary/assignment-s-16/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-secondary/assignment-s-17/index.html b/docs/semester_1/assignment-secondary/assignment-s-17/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-secondary/assignment-s-18/index.html b/docs/semester_1/assignment-secondary/assignment-s-18/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-secondary/assignment-s-19/index.html b/docs/semester_1/assignment-secondary/assignment-s-19/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-secondary/assignment-s-20/index.html b/docs/semester_1/assignment-secondary/assignment-s-20/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-secondary/assignment-s-21/index.html b/docs/semester_1/assignment-secondary/assignment-s-21/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-secondary/assignment-s-22/index.html b/docs/semester_1/assignment-secondary/assignment-s-22/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-secondary/assignment-s-23/index.html b/docs/semester_1/assignment-secondary/assignment-s-23/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-secondary/assignment-s-24/index.html b/docs/semester_1/assignment-secondary/assignment-s-24/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/assignment-secondary/index.html b/docs/semester_1/assignment-secondary/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/eduincs_exam/Paper-1_05-03-2026/Qn-10/index.html b/docs/semester_1/eduincs_exam/Paper-1_05-03-2026/Qn-10/index.html @@ -8757,6 +8757,8 @@ + + @@ -8871,6 +8873,35 @@ <li class="md-nav__item"> + <a href="../../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/eduincs_exam/Paper-1_05-03-2026/Qn-8/index.html b/docs/semester_1/eduincs_exam/Paper-1_05-03-2026/Qn-8/index.html @@ -8757,6 +8757,8 @@ + + @@ -8871,6 +8873,35 @@ <li class="md-nav__item"> + <a href="../../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/eduincs_exam/Paper-1_05-03-2026/Qn-9/index.html b/docs/semester_1/eduincs_exam/Paper-1_05-03-2026/Qn-9/index.html @@ -8757,6 +8757,8 @@ + + @@ -8871,6 +8873,35 @@ <li class="md-nav__item"> + <a href="../../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/eduincs_exam/Paper-1_05-03-2026/index.html b/docs/semester_1/eduincs_exam/Paper-1_05-03-2026/index.html @@ -8675,6 +8675,8 @@ + + @@ -8789,6 +8791,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/eduincs_exam/Paper-2_05-03-2026/Qn-11/index.html b/docs/semester_1/eduincs_exam/Paper-2_05-03-2026/Qn-11/index.html @@ -8757,6 +8757,8 @@ + + @@ -8871,6 +8873,35 @@ <li class="md-nav__item"> + <a href="../../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/eduincs_exam/Paper-2_05-03-2026/Qn-3/index.html b/docs/semester_1/eduincs_exam/Paper-2_05-03-2026/Qn-3/index.html @@ -8757,6 +8757,8 @@ + + @@ -8871,6 +8873,35 @@ <li class="md-nav__item"> + <a href="../../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/eduincs_exam/Paper-2_05-03-2026/Qn-4/index.html b/docs/semester_1/eduincs_exam/Paper-2_05-03-2026/Qn-4/index.html @@ -8757,6 +8757,8 @@ + + @@ -8871,6 +8873,35 @@ <li class="md-nav__item"> + <a href="../../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/eduincs_exam/Paper-2_05-03-2026/index.html b/docs/semester_1/eduincs_exam/Paper-2_05-03-2026/index.html @@ -8675,6 +8675,8 @@ + + @@ -8789,6 +8791,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/eduincs_exam/index.html b/docs/semester_1/eduincs_exam/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/index.html b/docs/semester_1/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="./practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="./practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/internal-practice/IP-01/index.html b/docs/semester_1/internal-practice/IP-01/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/internal-practice/IP-02/index.html b/docs/semester_1/internal-practice/IP-02/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/internal-practice/IP-03/index.html b/docs/semester_1/internal-practice/IP-03/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/internal-practice/IP-04/index.html b/docs/semester_1/internal-practice/IP-04/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/internal-practice/IP-05/index.html b/docs/semester_1/internal-practice/IP-05/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/internal-practice/IP-06/index.html b/docs/semester_1/internal-practice/IP-06/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/internal-practice/IP-07/index.html b/docs/semester_1/internal-practice/IP-07/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/internal-practice/IP-08/index.html b/docs/semester_1/internal-practice/IP-08/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/internal-practice/IP-09/index.html b/docs/semester_1/internal-practice/IP-09/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/internal-practice/IP-10/index.html b/docs/semester_1/internal-practice/IP-10/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/internal-practice/IP-11/index.html b/docs/semester_1/internal-practice/IP-11/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/internal-practice/IP-12/index.html b/docs/semester_1/internal-practice/IP-12/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/internal-practice/IP-13/index.html b/docs/semester_1/internal-practice/IP-13/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/internal-practice/IP-14/index.html b/docs/semester_1/internal-practice/IP-14/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/internal-practice/IP-15/index.html b/docs/semester_1/internal-practice/IP-15/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/internal-practice/IP-16/index.html b/docs/semester_1/internal-practice/IP-16/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/internal-practice/IP-17/index.html b/docs/semester_1/internal-practice/IP-17/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/internal-practice/IP-18/index.html b/docs/semester_1/internal-practice/IP-18/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/internal-practice/IP-19/index.html b/docs/semester_1/internal-practice/IP-19/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/internal-practice/IP-20/index.html b/docs/semester_1/internal-practice/IP-20/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/internal-practice/index.html b/docs/semester_1/internal-practice/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/khurapati-idea/KI001/index.html b/docs/semester_1/khurapati-idea/KI001/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/khurapati-idea/KI002/index.html b/docs/semester_1/khurapati-idea/KI002/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/khurapati-idea/KI003/index.html b/docs/semester_1/khurapati-idea/KI003/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/khurapati-idea/KI004/index.html b/docs/semester_1/khurapati-idea/KI004/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/khurapati-idea/index.html b/docs/semester_1/khurapati-idea/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/index.html b/docs/semester_1/letusc/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc001/index.html b/docs/semester_1/letusc/luc001/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc002/index.html b/docs/semester_1/letusc/luc002/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc003/index.html b/docs/semester_1/letusc/luc003/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc004/index.html b/docs/semester_1/letusc/luc004/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc005/index.html b/docs/semester_1/letusc/luc005/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc006/index.html b/docs/semester_1/letusc/luc006/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc007/index.html b/docs/semester_1/letusc/luc007/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc008/index.html b/docs/semester_1/letusc/luc008/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc009/index.html b/docs/semester_1/letusc/luc009/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc010/index.html b/docs/semester_1/letusc/luc010/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc011/index.html b/docs/semester_1/letusc/luc011/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc012/index.html b/docs/semester_1/letusc/luc012/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc013/index.html b/docs/semester_1/letusc/luc013/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc014/index.html b/docs/semester_1/letusc/luc014/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc015/index.html b/docs/semester_1/letusc/luc015/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc016/index.html b/docs/semester_1/letusc/luc016/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc017/index.html b/docs/semester_1/letusc/luc017/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc018-logic/index.html b/docs/semester_1/letusc/luc018-logic/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc018/index.html b/docs/semester_1/letusc/luc018/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc019/index.html b/docs/semester_1/letusc/luc019/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc020/index.html b/docs/semester_1/letusc/luc020/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc021/index.html b/docs/semester_1/letusc/luc021/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc022/index.html b/docs/semester_1/letusc/luc022/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc023/index.html b/docs/semester_1/letusc/luc023/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc024/index.html b/docs/semester_1/letusc/luc024/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc025/index.html b/docs/semester_1/letusc/luc025/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc026/index.html b/docs/semester_1/letusc/luc026/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc027/index.html b/docs/semester_1/letusc/luc027/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc028/index.html b/docs/semester_1/letusc/luc028/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc029/index.html b/docs/semester_1/letusc/luc029/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc030/index.html b/docs/semester_1/letusc/luc030/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc031-logic/index.html b/docs/semester_1/letusc/luc031-logic/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc031/index.html b/docs/semester_1/letusc/luc031/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc032/index.html b/docs/semester_1/letusc/luc032/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc033/index.html b/docs/semester_1/letusc/luc033/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc034/index.html b/docs/semester_1/letusc/luc034/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc035/index.html b/docs/semester_1/letusc/luc035/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc036/index.html b/docs/semester_1/letusc/luc036/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc037/index.html b/docs/semester_1/letusc/luc037/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc038/index.html b/docs/semester_1/letusc/luc038/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc039/index.html b/docs/semester_1/letusc/luc039/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc040-logic/index.html b/docs/semester_1/letusc/luc040-logic/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc040/index.html b/docs/semester_1/letusc/luc040/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc041/index.html b/docs/semester_1/letusc/luc041/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc042/index.html b/docs/semester_1/letusc/luc042/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc043/index.html b/docs/semester_1/letusc/luc043/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc044/index.html b/docs/semester_1/letusc/luc044/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc045/index.html b/docs/semester_1/letusc/luc045/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc046/index.html b/docs/semester_1/letusc/luc046/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc047/index.html b/docs/semester_1/letusc/luc047/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc048/index.html b/docs/semester_1/letusc/luc048/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc049/index.html b/docs/semester_1/letusc/luc049/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc050/index.html b/docs/semester_1/letusc/luc050/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc051/index.html b/docs/semester_1/letusc/luc051/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc052/index.html b/docs/semester_1/letusc/luc052/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc053/index.html b/docs/semester_1/letusc/luc053/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc054/index.html b/docs/semester_1/letusc/luc054/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc055/index.html b/docs/semester_1/letusc/luc055/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc056/index.html b/docs/semester_1/letusc/luc056/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc057/index.html b/docs/semester_1/letusc/luc057/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc058/index.html b/docs/semester_1/letusc/luc058/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc059/index.html b/docs/semester_1/letusc/luc059/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc060/index.html b/docs/semester_1/letusc/luc060/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc061/index.html b/docs/semester_1/letusc/luc061/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc062/index.html b/docs/semester_1/letusc/luc062/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc063/index.html b/docs/semester_1/letusc/luc063/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc064/index.html b/docs/semester_1/letusc/luc064/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc065/index.html b/docs/semester_1/letusc/luc065/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc066/index.html b/docs/semester_1/letusc/luc066/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc067/index.html b/docs/semester_1/letusc/luc067/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc068/index.html b/docs/semester_1/letusc/luc068/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc069/index.html b/docs/semester_1/letusc/luc069/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc070/index.html b/docs/semester_1/letusc/luc070/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc071/index.html b/docs/semester_1/letusc/luc071/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc072/index.html b/docs/semester_1/letusc/luc072/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc073/index.html b/docs/semester_1/letusc/luc073/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc074/index.html b/docs/semester_1/letusc/luc074/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc075/index.html b/docs/semester_1/letusc/luc075/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc076/index.html b/docs/semester_1/letusc/luc076/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc077/index.html b/docs/semester_1/letusc/luc077/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc078/index.html b/docs/semester_1/letusc/luc078/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc079/index.html b/docs/semester_1/letusc/luc079/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc080/index.html b/docs/semester_1/letusc/luc080/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc081/index.html b/docs/semester_1/letusc/luc081/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc082/index.html b/docs/semester_1/letusc/luc082/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc083/index.html b/docs/semester_1/letusc/luc083/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc084/index.html b/docs/semester_1/letusc/luc084/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc085/index.html b/docs/semester_1/letusc/luc085/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc086/index.html b/docs/semester_1/letusc/luc086/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc087/index.html b/docs/semester_1/letusc/luc087/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc088/index.html b/docs/semester_1/letusc/luc088/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc089/index.html b/docs/semester_1/letusc/luc089/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc090/index.html b/docs/semester_1/letusc/luc090/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc091/index.html b/docs/semester_1/letusc/luc091/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc092/index.html b/docs/semester_1/letusc/luc092/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc093/index.html b/docs/semester_1/letusc/luc093/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc094/index.html b/docs/semester_1/letusc/luc094/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc095/index.html b/docs/semester_1/letusc/luc095/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc096/index.html b/docs/semester_1/letusc/luc096/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc097/index.html b/docs/semester_1/letusc/luc097/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc098/index.html b/docs/semester_1/letusc/luc098/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc099/index.html b/docs/semester_1/letusc/luc099/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc100/index.html b/docs/semester_1/letusc/luc100/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc101/index.html b/docs/semester_1/letusc/luc101/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc102/index.html b/docs/semester_1/letusc/luc102/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc103/index.html b/docs/semester_1/letusc/luc103/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc104/index.html b/docs/semester_1/letusc/luc104/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc105/index.html b/docs/semester_1/letusc/luc105/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc106/index.html b/docs/semester_1/letusc/luc106/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc107/index.html b/docs/semester_1/letusc/luc107/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc108/index.html b/docs/semester_1/letusc/luc108/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc109/index.html b/docs/semester_1/letusc/luc109/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc110/index.html b/docs/semester_1/letusc/luc110/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc111/index.html b/docs/semester_1/letusc/luc111/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc112/index.html b/docs/semester_1/letusc/luc112/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc113/index.html b/docs/semester_1/letusc/luc113/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc114/index.html b/docs/semester_1/letusc/luc114/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc115/index.html b/docs/semester_1/letusc/luc115/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc116/index.html b/docs/semester_1/letusc/luc116/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc117/index.html b/docs/semester_1/letusc/luc117/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc118/index.html b/docs/semester_1/letusc/luc118/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/luc119/index.html b/docs/semester_1/letusc/luc119/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/lucproblem001/index.html b/docs/semester_1/letusc/lucproblem001/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/lucproblem002/index.html b/docs/semester_1/letusc/lucproblem002/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/lucproblem003/index.html b/docs/semester_1/letusc/lucproblem003/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/lucproblem004/index.html b/docs/semester_1/letusc/lucproblem004/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/lucproblem005/index.html b/docs/semester_1/letusc/lucproblem005/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/lucproblem006/index.html b/docs/semester_1/letusc/lucproblem006/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/lucproblem007/index.html b/docs/semester_1/letusc/lucproblem007/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/lucproblem008/index.html b/docs/semester_1/letusc/lucproblem008/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/lucproblem009/index.html b/docs/semester_1/letusc/lucproblem009/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/lucproblem010-complex/index.html b/docs/semester_1/letusc/lucproblem010-complex/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/lucproblem010/index.html b/docs/semester_1/letusc/lucproblem010/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/lucproblem011/index.html b/docs/semester_1/letusc/lucproblem011/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/lucproblem012/index.html b/docs/semester_1/letusc/lucproblem012/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/lucproblem013/index.html b/docs/semester_1/letusc/lucproblem013/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/lucproblem014-short/index.html b/docs/semester_1/letusc/lucproblem014-short/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/lucproblem014/index.html b/docs/semester_1/letusc/lucproblem014/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/lucproblem015/index.html b/docs/semester_1/letusc/lucproblem015/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/letusc/lucproblem016/index.html b/docs/semester_1/letusc/lucproblem016/index.html @@ -8755,6 +8755,8 @@ + + @@ -8869,6 +8871,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/model_questions/index.html b/docs/semester_1/model_questions/index.html @@ -8863,6 +8863,8 @@ + + @@ -8977,6 +8979,35 @@ <li class="md-nav__item"> + <a href="../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/practice-c/external_1/index.html b/docs/semester_1/practice-c/external_1/index.html @@ -8673,6 +8673,8 @@ + + @@ -8858,6 +8860,35 @@ <li class="md-nav__item"> + <a href="../external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../pc-ip-01/" class="md-nav__link"> @@ -15109,6 +15140,8 @@ + + diff --git a/docs/semester_1/practice-c/external_2/index.html b/docs/semester_1/practice-c/external_2/index.html @@ -16,7 +16,7 @@ <link rel="prev" href="../external_1/"> - <link rel="next" href="../pc-ip-01/"> + <link rel="next" href="../external_3/"> @@ -8673,6 +8673,8 @@ + + @@ -8858,6 +8860,35 @@ <li class="md-nav__item"> + <a href="../external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../pc-ip-01/" class="md-nav__link"> @@ -15109,6 +15140,8 @@ + + @@ -15441,13 +15474,13 @@ function copyAndClose(){closeActionSheet();setTimeout(function(){copyPageUrl();} - <a href="../pc-ip-01/" class="md-footer__link md-footer__link--next" aria-label="Next: pc-ip-01.c"> + <a href="../external_3/" class="md-footer__link md-footer__link--next" aria-label="Next: external_3.c"> <div class="md-footer__title"> <span class="md-footer__direction"> Next </span> <div class="md-ellipsis"> - pc-ip-01.c + external_3.c </div> </div> <div class="md-footer__button md-icon"> diff --git a/docs/semester_1/practice-c/external_3/index.html b/docs/semester_1/practice-c/external_3/index.html @@ -0,0 +1,15578 @@ + +<!doctype html> +<html lang="en" class="no-js"> + <head> + + <meta charset="utf-8"> + <meta name="viewport" content="width=device-width,initial-scale=1"> + + <meta name="description" content="C program source code for external_3.c"> + + + + <link rel="canonical" href="https://amit.is-a.dev/semester_1/practice-c/external_3/"> + + + <link rel="prev" href="../external_2/"> + + + <link rel="next" href="../pc-ip-01/"> + + + + + + <link rel="icon" href="../../../stylesheets/logo.png"> + <meta name="generator" content="zensical-0.0.43"> + + + + <title>external_3.c - BSc Code Index · v3.3.6</title> + + + + + + + <link rel="stylesheet" href="../../../assets/stylesheets/modern/main.fba56155.min.css"> + + + + + <link rel="stylesheet" href="../../../assets/stylesheets/modern/palette.dfe2e883.min.css"> + + + + + + + + + + + + + <link rel="preconnect" href="https://fonts.gstatic.com" crossorigin> + <link rel="stylesheet" href="https://fonts.googleapis.com/css?family=Lexend:300,300i,400,400i,500,500i,700,700i%7CFira+Code:400,400i,700,700i&display=fallback"> + <style>:root{--md-text-font:"Lexend";--md-code-font:"Fira Code"}</style> + + + + <link rel="stylesheet" href="../../../stylesheets/extra.css"> + + <script>__md_scope=new URL("../../..",location),__md_scope.pathname.endsWith("/")||(__md_scope=new URL(__md_scope.pathname+"/",location)),__md_hash=e=>[...e].reduce(((e,t)=>(e<<5)-e+t.charCodeAt(0)),0),__md_get=(e,t=localStorage,_=__md_scope)=>JSON.parse(t.getItem(_.pathname+"."+e)),__md_set=(e,t,_=localStorage,a=__md_scope)=>{try{_.setItem(a.pathname+"."+e,JSON.stringify(t))}catch(e){}},document.documentElement.setAttribute("data-platform",navigator.platform)</script> + + + + + + </head> + + + + + + + + + + <body dir="ltr" data-md-color-scheme="default" data-md-color-primary="deep-purple" data-md-color-accent="purple"> + + + <input class="md-toggle" data-md-toggle="drawer" type="checkbox" id="__drawer" autocomplete="off"> + <input class="md-toggle" data-md-toggle="search" type="checkbox" id="__search" autocomplete="off"> + <label class="md-overlay" for="__drawer" aria-label="Navigation"></label> + <div data-md-component="skip"> + + + <a href="#external_3c" class="md-skip"> + Skip to content + </a> + + </div> + <div data-md-component="announce"> + + <aside class="md-banner"> + <div class="md-banner__inner md-grid md-typeset"> + + <button class="md-banner__button md-icon" aria-label="Don't show this again"> + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-x" viewBox="0 0 24 24"><path d="M18 6 6 18M6 6l12 12"/></svg> + </button> + + + By using this site, you agree to the <a href="/terms/">Terms of Use</a>. + + </div> + + <script>var el=document.querySelector("[data-md-component=announce]");if(el){var content=el.querySelector(".md-typeset");__md_hash(content.innerHTML)===__md_get("__announce")&&(el.hidden=!0)}</script> + + </aside> + + </div> + + + + + + +<header class="md-header md-header--shadow" data-md-component="header"> + <nav class="md-header__inner md-grid" aria-label="Header"> + <a href="../../.." title="BSc Code Index · v3.3.6" class="md-header__button md-logo" aria-label="BSc Code Index · v3.3.6" data-md-component="logo"> + + <img src="../../../stylesheets/logo.svg" alt="BSc Code Index · v3.3.6"> + + </a> + <label class="md-header__button md-icon" for="__drawer" aria-label="Navigation"> + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-menu" viewBox="0 0 24 24"><path d="M4 5h16M4 12h16M4 19h16"/></svg> + </label> + <div class="md-header__title" data-md-component="header-title"> + <div class="md-header__ellipsis"> + <div class="md-header__topic"> + <span class="md-ellipsis"> + BSc Code Index · v3.3.6 + </span> + </div> + <div class="md-header__topic" data-md-component="header-topic"> + <span class="md-ellipsis"> + + external_3.c + + </span> + </div> + </div> + </div> + + + <form class="md-header__option" data-md-component="palette"> + + + + + <input class="md-option" data-md-color-media="(prefers-color-scheme: light)" data-md-color-scheme="default" data-md-color-primary="deep-purple" data-md-color-accent="purple" aria-label="Switch to dark mode" type="radio" name="__palette" id="__palette_0"> + + <label class="md-header__button md-icon" title="Switch to dark mode" for="__palette_1" hidden> + <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="m17.75 4.09-2.53 1.94.91 3.06-2.63-1.81-2.63 1.81.91-3.06-2.53-1.94L12.44 4l1.06-3 1.06 3zm3.5 6.91-1.64 1.25.59 1.98-1.7-1.17-1.7 1.17.59-1.98L15.75 11l2.06-.05L18.5 9l.69 1.95zm-2.28 4.95c.83-.08 1.72 1.1 1.19 1.85-.32.45-.66.87-1.08 1.27C15.17 23 8.84 23 4.94 19.07c-3.91-3.9-3.91-10.24 0-14.14.4-.4.82-.76 1.27-1.08.75-.53 1.93.36 1.85 1.19-.27 2.86.69 5.83 2.89 8.02a9.96 9.96 0 0 0 8.02 2.89m-1.64 2.02a12.08 12.08 0 0 1-7.8-3.47c-2.17-2.19-3.33-5-3.49-7.82-2.81 3.14-2.7 7.96.31 10.98 3.02 3.01 7.84 3.12 10.98.31"/></svg> + </label> + + + + + + <input class="md-option" data-md-color-media="(prefers-color-scheme: dark)" data-md-color-scheme="slate" data-md-color-primary="black" data-md-color-accent="orange" aria-label="Switch to light mode" type="radio" name="__palette" id="__palette_1"> + + <label class="md-header__button md-icon" title="Switch to light mode" for="__palette_0" hidden> + <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M12 7a5 5 0 0 1 5 5 5 5 0 0 1-5 5 5 5 0 0 1-5-5 5 5 0 0 1 5-5m0 2a3 3 0 0 0-3 3 3 3 0 0 0 3 3 3 3 0 0 0 3-3 3 3 0 0 0-3-3m0-7 2.39 3.42C13.65 5.15 12.84 5 12 5s-1.65.15-2.39.42zM3.34 7l4.16-.35A7.2 7.2 0 0 0 5.94 8.5c-.44.74-.69 1.5-.83 2.29zm.02 10 1.76-3.77a7.131 7.131 0 0 0 2.38 4.14zM20.65 7l-1.77 3.79a7.02 7.02 0 0 0-2.38-4.15zm-.01 10-4.14.36c.59-.51 1.12-1.14 1.54-1.86.42-.73.69-1.5.83-2.29zM12 22l-2.41-3.44c.74.27 1.55.44 2.41.44.82 0 1.63-.17 2.37-.44z"/></svg> + </label> + + +</form> + + + + <script>var palette=__md_get("__palette");if(palette&&palette.color){if("(prefers-color-scheme)"===palette.color.media){var media=matchMedia("(prefers-color-scheme: light)"),input=document.querySelector(media.matches?"[data-md-color-media='(prefers-color-scheme: light)']":"[data-md-color-media='(prefers-color-scheme: dark)']");palette.color.media=input.getAttribute("data-md-color-media"),palette.color.scheme=input.getAttribute("data-md-color-scheme"),palette.color.primary=input.getAttribute("data-md-color-primary"),palette.color.accent=input.getAttribute("data-md-color-accent")}for(var[key,value]of Object.entries(palette.color))document.body.setAttribute("data-md-color-"+key,value)}</script> + + + + + + <label class="md-header__button md-icon" for="__search" aria-label="Search"> + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-search" viewBox="0 0 24 24"><path d="m21 21-4.34-4.34"/><circle cx="11" cy="11" r="8"/></svg> + </label> + <div class="md-search" data-md-component="search" role="dialog" aria-label="Search"> + <button type="button" class="md-search__button"> + Search + </button> +</div> + + + <div class="md-header__source"> + + <a href="https://github.com/notamitgamer/bsc" title="Go to repository" class="md-source" data-md-component="source"> + <div class="md-source__icon md-icon"> + + <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 448 512"><!--! Font Awesome Free 7.2.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2026 Fonticons, Inc.--><path fill="currentColor" d="M439.6 236.1 244 40.5c-5.4-5.5-12.8-8.5-20.4-8.5s-15 3-20.4 8.4L162.5 81l51.5 51.5c27.1-9.1 52.7 16.8 43.4 43.7l49.7 49.7c34.2-11.8 61.2 31 35.5 56.7-26.5 26.5-70.2-2.9-56-37.3L240.3 199v121.9c25.3 12.5 22.3 41.8 9.1 55-6.4 6.4-15.2 10.1-24.3 10.1s-17.8-3.6-24.3-10.1c-17.6-17.6-11.1-46.9 11.2-56v-123c-20.8-8.5-24.6-30.7-18.6-45L142.6 101 8.5 235.1C3 240.6 0 247.9 0 255.5s3 15 8.5 20.4l195.6 195.7c5.4 5.4 12.7 8.4 20.4 8.4s15-3 20.4-8.4l194.7-194.7c5.4-5.4 8.4-12.8 8.4-20.4s-3-15-8.4-20.4"/></svg> + </div> + <div class="md-source__repository"> + notamitgamer/bsc + </div> +</a> + + </div> + </nav> + +</header> + + <div class="md-container" data-md-component="container"> + + + + + + + <main class="md-main" data-md-component="main"> + <div class="md-main__inner md-grid"> + + + + <div class="md-sidebar md-sidebar--primary" data-md-component="sidebar" data-md-type="navigation" > + <div class="md-sidebar__scrollwrap"> + <div class="md-sidebar__inner"> + + + + +<nav class="md-nav md-nav--primary" aria-label="Navigation" data-md-level="0"> + <label class="md-nav__title" for="__drawer"> + <a href="../../.." title="BSc Code Index · v3.3.6" class="md-nav__button md-logo" aria-label="BSc Code Index · v3.3.6" data-md-component="logo"> + + <img src="../../../stylesheets/logo.svg" alt="BSc Code Index · v3.3.6"> + + </a> + BSc Code Index · v3.3.6 + </label> + + <div class="md-nav__source"> + <a href="https://github.com/notamitgamer/bsc" title="Go to repository" class="md-source" data-md-component="source"> + <div class="md-source__icon md-icon"> + + <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 448 512"><!--! Font Awesome Free 7.2.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2026 Fonticons, Inc.--><path fill="currentColor" d="M439.6 236.1 244 40.5c-5.4-5.5-12.8-8.5-20.4-8.5s-15 3-20.4 8.4L162.5 81l51.5 51.5c27.1-9.1 52.7 16.8 43.4 43.7l49.7 49.7c34.2-11.8 61.2 31 35.5 56.7-26.5 26.5-70.2-2.9-56-37.3L240.3 199v121.9c25.3 12.5 22.3 41.8 9.1 55-6.4 6.4-15.2 10.1-24.3 10.1s-17.8-3.6-24.3-10.1c-17.6-17.6-11.1-46.9 11.2-56v-123c-20.8-8.5-24.6-30.7-18.6-45L142.6 101 8.5 235.1C3 240.6 0 247.9 0 255.5s3 15 8.5 20.4l195.6 195.7c5.4 5.4 12.7 8.4 20.4 8.4s15-3 20.4-8.4l194.7-194.7c5.4-5.4 8.4-12.8 8.4-20.4s-3-15-8.4-20.4"/></svg> + </div> + <div class="md-source__repository"> + notamitgamer/bsc + </div> +</a> + </div> + + <ul class="md-nav__list" data-md-scrollfix> + + + + + + + + <li class="md-nav__item"> + <a href="../../.." class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-house" viewBox="0 0 24 24"><path d="M15 21v-8a1 1 0 0 0-1-1h-4a1 1 0 0 0-1 1v8"/><path d="M3 10a2 2 0 0 1 .709-1.528l7-6a2 2 0 0 1 2.582 0l7 6A2 2 0 0 1 21 10v9a2 2 0 0 1-2 2H5a2 2 0 0 1-2-2z"/></svg> + + <span class="md-ellipsis"> + + + BSc Code Index + + + </span> + + + + </a> + </li> + + + + + + + + + + <li class="md-nav__item"> + <a href="../../../CODE_OF_CONDUCT/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-handshake" viewBox="0 0 24 24"><path d="m11 17 2 2a1 1 0 1 0 3-3"/><path d="m14 14 2.5 2.5a1 1 0 1 0 3-3l-3.88-3.88a3 3 0 0 0-4.24 0l-.88.88a1 1 0 1 1-3-3l2.81-2.81a5.79 5.79 0 0 1 7.06-.87l.47.28a2 2 0 0 0 1.42.25L21 4"/><path d="m21 3 1 11h-2M3 3 2 14l6.5 6.5a1 1 0 1 0 3-3M3 4h8"/></svg> + + <span class="md-ellipsis"> + + + Code of Conduct + + + </span> + + + + </a> + </li> + + + + + + + + + + <li class="md-nav__item"> + <a href="../../../CONTRIBUTING/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-users" viewBox="0 0 24 24"><path d="M16 21v-2a4 4 0 0 0-4-4H6a4 4 0 0 0-4 4v2M16 3.128a4 4 0 0 1 0 7.744M22 21v-2a4 4 0 0 0-3-3.87"/><circle cx="9" cy="7" r="4"/></svg> + + <span class="md-ellipsis"> + + + Contributing to bsc + + + </span> + + + + </a> + </li> + + + + + + + + + + <li class="md-nav__item"> + <a href="../../../LICENSE/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-scale" viewBox="0 0 24 24"><path d="M12 3v18M19 8l3 8a5 5 0 0 1-6 0zV7"/><path d="M3 7h1a17 17 0 0 0 8-2 17 17 0 0 0 8 2h1M5 8l3 8a5 5 0 0 1-6 0zV7M7 21h10"/></svg> + + <span class="md-ellipsis"> + + + LICENSE + + + </span> + + + + </a> + </li> + + + + + + + + + + <li class="md-nav__item"> + <a href="../../../SECURITY/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-shield-check" viewBox="0 0 24 24"><path d="M20 13c0 5-3.5 7.5-7.66 8.95a1 1 0 0 1-.67-.01C7.5 20.5 4 18 4 13V6a1 1 0 0 1 1-1c2 0 4.5-1.2 6.24-2.72a1.17 1.17 0 0 1 1.52 0C14.51 3.81 17 5 19 5a1 1 0 0 1 1 1z"/><path d="m9 12 2 2 4-4"/></svg> + + <span class="md-ellipsis"> + + + Security Policy + + + </span> + + + + </a> + </li> + + + + + + + + + + <li class="md-nav__item"> + <a href="../../../credits/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-hand-helping" viewBox="0 0 24 24"><path d="M11 12h2a2 2 0 1 0 0-4h-3c-.6 0-1.1.2-1.4.6L3 14"/><path d="m7 18 1.6-1.4c.3-.4.8-.6 1.4-.6h4c1.1 0 2.1-.4 2.8-1.2l4.6-4.4a2 2 0 0 0-2.75-2.91l-4.2 3.9M2 13l6 6"/></svg> + + <span class="md-ellipsis"> + + + Acknowledgments + + + </span> + + + + </a> + </li> + + + + + + + + + + <li class="md-nav__item"> + <a href="../../../faq/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-table-of-contents" viewBox="0 0 24 24"><path d="M16 5H3M16 12H3M16 19H3M21 5h.01M21 12h.01M21 19h.01"/></svg> + + <span class="md-ellipsis"> + + + Frequently Asked Questions (FAQ) + + + </span> + + + + </a> + </li> + + + + + + + + + + <li class="md-nav__item"> + <a href="../../../quickstart/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-rocket" viewBox="0 0 24 24"><path d="M12 15v5s3.03-.55 4-2c1.08-1.62 0-5 0-5M4.5 16.5c-1.5 1.26-2 5-2 5s3.74-.5 5-2c.71-.84.7-2.13-.09-2.91a2.18 2.18 0 0 0-2.91-.09"/><path d="M9 12a22 22 0 0 1 2-3.95A12.88 12.88 0 0 1 22 2c0 2.72-.78 7.5-6 11a22.4 22.4 0 0 1-4 2z"/><path d="M9 12H4s.55-3.03 2-4c1.62-1.08 5 .05 5 .05"/></svg> + + <span class="md-ellipsis"> + + + Quick Start Guide + + + </span> + + + + </a> + </li> + + + + + + + + + + <li class="md-nav__item"> + <a href="../../../terms/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-text" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 9H8M16 13H8M16 17H8"/></svg> + + <span class="md-ellipsis"> + + + Terms of Use + + + </span> + + + + </a> + </li> + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + <li class="md-nav__item md-nav__item--active md-nav__item--section md-nav__item--nested"> + + + + <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_10" checked> + + + <div class="md-nav__link md-nav__container"> + <a href="../../" class="md-nav__link "> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-component" viewBox="0 0 24 24"><path d="M15.536 11.293a1 1 0 0 0 0 1.414l2.376 2.377a1 1 0 0 0 1.414 0l2.377-2.377a1 1 0 0 0 0-1.414l-2.377-2.377a1 1 0 0 0-1.414 0zM2.297 11.293a1 1 0 0 0 0 1.414l2.377 2.377a1 1 0 0 0 1.414 0l2.377-2.377a1 1 0 0 0 0-1.414L6.088 8.916a1 1 0 0 0-1.414 0zM8.916 17.912a1 1 0 0 0 0 1.415l2.377 2.376a1 1 0 0 0 1.414 0l2.377-2.376a1 1 0 0 0 0-1.415l-2.377-2.376a1 1 0 0 0-1.414 0zM8.916 4.674a1 1 0 0 0 0 1.414l2.377 2.376a1 1 0 0 0 1.414 0l2.377-2.376a1 1 0 0 0 0-1.414l-2.377-2.377a1 1 0 0 0-1.414 0z"/></svg> + + <span class="md-ellipsis"> + + + Semester 1 + + + </span> + + + + </a> + + + <label class="md-nav__link " for="__nav_10" id="__nav_10_label" tabindex=""> + <span class="md-nav__icon md-icon"></span> + </label> + + </div> + + <nav class="md-nav" data-md-level="1" aria-labelledby="__nav_10_label" aria-expanded="true"> + <label class="md-nav__title" for="__nav_10"> + <span class="md-nav__icon md-icon"></span> + + + Semester 1 + + </label> + <ul class="md-nav__list" data-md-scrollfix> + + + + + + + + + + <li class="md-nav__item"> + <a href="../../model_questions/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-badge" viewBox="0 0 24 24"><path d="M13 22h5a2 2 0 0 0 2-2V8a2.4 2.4 0 0 0-.706-1.706l-3.588-3.588A2.4 2.4 0 0 0 14 2H6a2 2 0 0 0-2 2v3.3"/><path d="M14 2v5a1 1 0 0 0 1 1h5M7.69 16.479l1.29 4.88a.5.5 0 0 1-.698.591l-1.843-.849a1 1 0 0 0-.879.001l-1.846.85a.5.5 0 0 1-.692-.593l1.29-4.88"/><circle cx="6" cy="14" r="3"/></svg> + + <span class="md-ellipsis"> + + + Model Questions: Computer Fundamentals and Programming with C + + + </span> + + + + </a> + </li> + + + + + + + + + + + + + + + + + + + + + + + + + + + + <li class="md-nav__item md-nav__item--nested"> + + + + <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_10_3" > + + + <div class="md-nav__link md-nav__container"> + <a href="../../R/" class="md-nav__link "> + + + + <span class="md-ellipsis"> + + + R + + + </span> + + + + </a> + + + <label class="md-nav__link " for="__nav_10_3" id="__nav_10_3_label" tabindex="0"> + <span class="md-nav__icon md-icon"></span> + </label> + + </div> + + <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_10_3_label" aria-expanded="false"> + <label class="md-nav__title" for="__nav_10_3"> + <span class="md-nav__icon md-icon"></span> + + + R + + </label> + <ul class="md-nav__list" data-md-scrollfix> + + + + + + + + + + <li class="md-nav__item"> + <a href="../../R/temp/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + temp.r + + + </span> + + + + </a> + </li> + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + <li class="md-nav__item md-nav__item--nested"> + + + + <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_10_3_3" > + + + <div class="md-nav__link md-nav__container"> + <a href="../../R/Code/" class="md-nav__link "> + + + + <span class="md-ellipsis"> + + + Code + + + </span> + + + + </a> + + + <label class="md-nav__link " for="__nav_10_3_3" id="__nav_10_3_3_label" tabindex="0"> + <span class="md-nav__icon md-icon"></span> + </label> + + </div> + + <nav class="md-nav" data-md-level="3" aria-labelledby="__nav_10_3_3_label" aria-expanded="false"> + <label class="md-nav__title" for="__nav_10_3_3"> + <span class="md-nav__icon md-icon"></span> + + + Code + + </label> + <ul class="md-nav__list" data-md-scrollfix> + + + + + + + + + + <li class="md-nav__item"> + <a href="../../R/Code/R_Code-1/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + R_Code-1.r + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../R/Code/R_Code-10/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + R_Code-10.r + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../R/Code/R_Code-11/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + R_Code-11.r + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../R/Code/R_Code-12/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + R_Code-12.r + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../R/Code/R_Code-13/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + R_Code-13.r + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../R/Code/R_Code-14/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + R_Code-14.r + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../R/Code/R_Code-15/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + R_Code-15.r + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../R/Code/R_Code-2/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + R_Code-2.r + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../R/Code/R_Code-4/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + R_Code-4.r + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../R/Code/R_Code-5/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + R_Code-5.r + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../R/Code/R_Code-6/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + R_Code-6.r + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../R/Code/R_Code-7/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + R_Code-7.r + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../R/Code/R_Code-8/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + R_Code-8.r + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../R/Code/R_Code-9/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + R_Code-9.r + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../R/Code/R_Prac-1/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + R_Prac-1.r + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../R/Code/R_Prac-2/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + R_Prac-2.r + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../R/Code/R_Prac-3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + R_Prac-3.r + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../R/Code/R_Prac-4/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + R_Prac-4.r + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../R/Code/R_Prac-5/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + R_Prac-5.r + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../R/Code/R_Prac-6/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + R_Prac-6.r + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../R/Code/R_code-3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + R_code-3.r + + + </span> + + + + </a> + </li> + + + + + </ul> + </nav> + + </li> + + + + + </ul> + </nav> + + </li> + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + <li class="md-nav__item md-nav__item--nested"> + + + + <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_10_4" > + + + <div class="md-nav__link md-nav__container"> + <a href="../../assignment-primary/" class="md-nav__link "> + + + + <span class="md-ellipsis"> + + + Assignment primary + + + </span> + + + + </a> + + + <label class="md-nav__link " for="__nav_10_4" id="__nav_10_4_label" tabindex="0"> + <span class="md-nav__icon md-icon"></span> + </label> + + </div> + + <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_10_4_label" aria-expanded="false"> + <label class="md-nav__title" for="__nav_10_4"> + <span class="md-nav__icon md-icon"></span> + + + Assignment primary + + </label> + <ul class="md-nav__list" data-md-scrollfix> + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-primary/assignment-p-01/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-p-01.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-primary/assignment-p-02/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-p-02.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-primary/assignment-p-03/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-p-03.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-primary/assignment-p-04/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-p-04.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-primary/assignment-p-05/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-p-05.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-primary/assignment-p-06/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-p-06.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-primary/assignment-p-07/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-p-07.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-primary/assignment-p-08/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-p-08.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-primary/assignment-p-09/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-p-09.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-primary/assignment-p-10/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-p-10.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-primary/assignment-p-11/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-p-11.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-primary/assignment-p-12_v1/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-p-12_v1.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-primary/assignment-p-12_v2/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-p-12_v2.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-primary/assignment-p-13/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-p-13.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-primary/assignment-p-14_v1/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-p-14_v1.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-primary/assignment-p-14_v2/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-p-14_v2.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-primary/assignment-p-15/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-p-15.c + + + </span> + + + + </a> + </li> + + + + + </ul> + </nav> + + </li> + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + <li class="md-nav__item md-nav__item--nested"> + + + + <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_10_5" > + + + <div class="md-nav__link md-nav__container"> + <a href="../../assignment-secondary/" class="md-nav__link "> + + + + <span class="md-ellipsis"> + + + Assignment secondary + + + </span> + + + + </a> + + + <label class="md-nav__link " for="__nav_10_5" id="__nav_10_5_label" tabindex="0"> + <span class="md-nav__icon md-icon"></span> + </label> + + </div> + + <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_10_5_label" aria-expanded="false"> + <label class="md-nav__title" for="__nav_10_5"> + <span class="md-nav__icon md-icon"></span> + + + Assignment secondary + + </label> + <ul class="md-nav__list" data-md-scrollfix> + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-secondary/assignment-s-01/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-s-01.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-secondary/assignment-s-02/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-s-02.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-secondary/assignment-s-03/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-s-03.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-secondary/assignment-s-04/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-s-04.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-secondary/assignment-s-05/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-s-05.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-secondary/assignment-s-06/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-s-06.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-secondary/assignment-s-07/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-s-07.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-secondary/assignment-s-08/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-s-08.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-secondary/assignment-s-09/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-s-09.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-secondary/assignment-s-10/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-s-10.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-secondary/assignment-s-11/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-s-11.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-secondary/assignment-s-12/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-s-12.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-secondary/assignment-s-13-1/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-s-13-1.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-secondary/assignment-s-13-2/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-s-13-2.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-secondary/assignment-s-14/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-s-14.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-secondary/assignment-s-15/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-s-15.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-secondary/assignment-s-16/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-s-16.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-secondary/assignment-s-17/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-s-17.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-secondary/assignment-s-18/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-s-18.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-secondary/assignment-s-19/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-s-19.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-secondary/assignment-s-20/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-s-20.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-secondary/assignment-s-21/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-s-21.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-secondary/assignment-s-22/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-s-22.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-secondary/assignment-s-23/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-s-23.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../assignment-secondary/assignment-s-24/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + assignment-s-24.c + + + </span> + + + + </a> + </li> + + + + + </ul> + </nav> + + </li> + + + + + + + + + + + + + + + + + + + + + + + + + + + + <li class="md-nav__item md-nav__item--nested"> + + + + <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_10_6" > + + + <div class="md-nav__link md-nav__container"> + <a href="../../eduincs_exam/" class="md-nav__link "> + + + + <span class="md-ellipsis"> + + + Eduincs exam + + + </span> + + + + </a> + + + <label class="md-nav__link " for="__nav_10_6" id="__nav_10_6_label" tabindex="0"> + <span class="md-nav__icon md-icon"></span> + </label> + + </div> + + <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_10_6_label" aria-expanded="false"> + <label class="md-nav__title" for="__nav_10_6"> + <span class="md-nav__icon md-icon"></span> + + + Eduincs exam + + </label> + <ul class="md-nav__list" data-md-scrollfix> + + + + + + + + + + + + + + + + + + + + + + + + + + + + + <li class="md-nav__item md-nav__item--nested"> + + + + <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_10_6_2" > + + + <div class="md-nav__link md-nav__container"> + <a href="../../eduincs_exam/Paper-1_05-03-2026/" class="md-nav__link "> + + + + <span class="md-ellipsis"> + + + Paper 1 05 03 2026 + + + </span> + + + + </a> + + + <label class="md-nav__link " for="__nav_10_6_2" id="__nav_10_6_2_label" tabindex="0"> + <span class="md-nav__icon md-icon"></span> + </label> + + </div> + + <nav class="md-nav" data-md-level="3" aria-labelledby="__nav_10_6_2_label" aria-expanded="false"> + <label class="md-nav__title" for="__nav_10_6_2"> + <span class="md-nav__icon md-icon"></span> + + + Paper 1 05 03 2026 + + </label> + <ul class="md-nav__list" data-md-scrollfix> + + + + + + + + + + <li class="md-nav__item"> + <a href="../../eduincs_exam/Paper-1_05-03-2026/Qn-10/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + Qn-10.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../eduincs_exam/Paper-1_05-03-2026/Qn-8/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + Qn-8.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../eduincs_exam/Paper-1_05-03-2026/Qn-9/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + Qn-9.c + + + </span> + + + + </a> + </li> + + + + + </ul> + </nav> + + </li> + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + <li class="md-nav__item md-nav__item--nested"> + + + + <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_10_6_3" > + + + <div class="md-nav__link md-nav__container"> + <a href="../../eduincs_exam/Paper-2_05-03-2026/" class="md-nav__link "> + + + + <span class="md-ellipsis"> + + + Paper 2 05 03 2026 + + + </span> + + + + </a> + + + <label class="md-nav__link " for="__nav_10_6_3" id="__nav_10_6_3_label" tabindex="0"> + <span class="md-nav__icon md-icon"></span> + </label> + + </div> + + <nav class="md-nav" data-md-level="3" aria-labelledby="__nav_10_6_3_label" aria-expanded="false"> + <label class="md-nav__title" for="__nav_10_6_3"> + <span class="md-nav__icon md-icon"></span> + + + Paper 2 05 03 2026 + + </label> + <ul class="md-nav__list" data-md-scrollfix> + + + + + + + + + + <li class="md-nav__item"> + <a href="../../eduincs_exam/Paper-2_05-03-2026/Qn-11/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + Qn-11.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../eduincs_exam/Paper-2_05-03-2026/Qn-3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + Qn-3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../eduincs_exam/Paper-2_05-03-2026/Qn-4/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + Qn-4.c + + + </span> + + + + </a> + </li> + + + + + </ul> + </nav> + + </li> + + + + + </ul> + </nav> + + </li> + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + <li class="md-nav__item md-nav__item--nested"> + + + + <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_10_7" > + + + <div class="md-nav__link md-nav__container"> + <a href="../../internal-practice/" class="md-nav__link "> + + + + <span class="md-ellipsis"> + + + Internal practice + + + </span> + + + + </a> + + + <label class="md-nav__link " for="__nav_10_7" id="__nav_10_7_label" tabindex="0"> + <span class="md-nav__icon md-icon"></span> + </label> + + </div> + + <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_10_7_label" aria-expanded="false"> + <label class="md-nav__title" for="__nav_10_7"> + <span class="md-nav__icon md-icon"></span> + + + Internal practice + + </label> + <ul class="md-nav__list" data-md-scrollfix> + + + + + + + + + + <li class="md-nav__item"> + <a href="../../internal-practice/IP-01/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + IP-01.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../internal-practice/IP-02/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + IP-02.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../internal-practice/IP-03/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + IP-03.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../internal-practice/IP-04/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + IP-04.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../internal-practice/IP-05/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + IP-05.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../internal-practice/IP-06/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + IP-06.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../internal-practice/IP-07/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + IP-07.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../internal-practice/IP-08/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + IP-08.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../internal-practice/IP-09/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + IP-09.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../internal-practice/IP-10/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + IP-10.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../internal-practice/IP-11/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + IP-11.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../internal-practice/IP-12/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + IP-12.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../internal-practice/IP-13/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + IP-13.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../internal-practice/IP-14/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + IP-14.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../internal-practice/IP-15/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + IP-15.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../internal-practice/IP-16/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + IP-16.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../internal-practice/IP-17/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + IP-17.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../internal-practice/IP-18/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + IP-18.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../internal-practice/IP-19/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + IP-19.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../internal-practice/IP-20/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + IP-20.c + + + </span> + + + + </a> + </li> + + + + + </ul> + </nav> + + </li> + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + <li class="md-nav__item md-nav__item--nested"> + + + + <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_10_8" > + + + <div class="md-nav__link md-nav__container"> + <a href="../../khurapati-idea/" class="md-nav__link "> + + + + <span class="md-ellipsis"> + + + Khurapati idea + + + </span> + + + + </a> + + + <label class="md-nav__link " for="__nav_10_8" id="__nav_10_8_label" tabindex="0"> + <span class="md-nav__icon md-icon"></span> + </label> + + </div> + + <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_10_8_label" aria-expanded="false"> + <label class="md-nav__title" for="__nav_10_8"> + <span class="md-nav__icon md-icon"></span> + + + Khurapati idea + + </label> + <ul class="md-nav__list" data-md-scrollfix> + + + + + + + + + + <li class="md-nav__item"> + <a href="../../khurapati-idea/KI001/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + KI001.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../khurapati-idea/KI002/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + KI002.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../khurapati-idea/KI003/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + KI003.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../khurapati-idea/KI004/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + KI004.c + + + </span> + + + + </a> + </li> + + + + + </ul> + </nav> + + </li> + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + <li class="md-nav__item md-nav__item--nested"> + + + + <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_10_9" > + + + <div class="md-nav__link md-nav__container"> + <a href="../../letusc/" class="md-nav__link "> + + + + <span class="md-ellipsis"> + + + Letusc + + + </span> + + + + </a> + + + <label class="md-nav__link " for="__nav_10_9" id="__nav_10_9_label" tabindex="0"> + <span class="md-nav__icon md-icon"></span> + </label> + + </div> + + <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_10_9_label" aria-expanded="false"> + <label class="md-nav__title" for="__nav_10_9"> + <span class="md-nav__icon md-icon"></span> + + + Letusc + + </label> + <ul class="md-nav__list" data-md-scrollfix> + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc001/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc001.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc002/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc002.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc003/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc003.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc004/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc004.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc005/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc005.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc006/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc006.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc007/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc007.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc008/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc008.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc009/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc009.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc010/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc010.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc011/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc011.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc012/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc012.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc013/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc013.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc014/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc014.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc015/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc015.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc016/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc016.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc017/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc017.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc018-logic/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc018-logic.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc018/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc018.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc019/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc019.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc020/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc020.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc021/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc021.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc022/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc022.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc023/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc023.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc024/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc024.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc025/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc025.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc026/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc026.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc027/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc027.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc028/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc028.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc029/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc029.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc030/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc030.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc031-logic/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc031-logic.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc031/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc031.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc032/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc032.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc033/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc033.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc034/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc034.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc035/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc035.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc036/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc036.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc037/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc037.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc038/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc038.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc039/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc039.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc040-logic/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc040-logic.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc040/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc040.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc041/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc041.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc042/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc042.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc043/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc043.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc044/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc044.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc045/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc045.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc046/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc046.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc047/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc047.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc048/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc048.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc049/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc049.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc050/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc050.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc051/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc051.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc052/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc052.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc053/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc053.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc054/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc054.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc055/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc055.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc056/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc056.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc057/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc057.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc058/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc058.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc059/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc059.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc060/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc060.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc061/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc061.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc062/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc062.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc063/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc063.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc064/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc064.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc065/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc065.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc066/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc066.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc067/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc067.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc068/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc068.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc069/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc069.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc070/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc070.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc071/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc071.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc072/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc072.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc073/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc073.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc074/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc074.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc075/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc075.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc076/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc076.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc077/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc077.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc078/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc078.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc079/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc079.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc080/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc080.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc081/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc081.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc082/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc082.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc083/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc083.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc084/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc084.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc085/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc085.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc086/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc086.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc087/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc087.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc088/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc088.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc089/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc089.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc090/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc090.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc091/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc091.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc092/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc092.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc093/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc093.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc094/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc094.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc095/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc095.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc096/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc096.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc097/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc097.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc098/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc098.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc099/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc099.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc100/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc100.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc101/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc101.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc102/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc102.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc103/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc103.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc104/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc104.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc105/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc105.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc106/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc106.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc107/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc107.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc108/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc108.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc109/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc109.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc110/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc110.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc111/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc111.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc112/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc112.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc113/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc113.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc114/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc114.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc115/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc115.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc116/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc116.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc117/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc117.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc118/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc118.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/luc119/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + luc119.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/lucproblem001/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + lucproblem001.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/lucproblem002/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + lucproblem002.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/lucproblem003/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + lucproblem003.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/lucproblem004/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + lucproblem004.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/lucproblem005/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + lucproblem005.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/lucproblem006/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + lucproblem006.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/lucproblem007/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + lucproblem007.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/lucproblem008/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + lucproblem008.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/lucproblem009/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + lucproblem009.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/lucproblem010-complex/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + lucproblem010-complex.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/lucproblem010/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + lucproblem010.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/lucproblem011/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + lucproblem011.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/lucproblem012/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + lucproblem012.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/lucproblem013/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + lucproblem013.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/lucproblem014-short/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + lucproblem014-short.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/lucproblem014/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + lucproblem014.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/lucproblem015/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + lucproblem015.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../letusc/lucproblem016/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + lucproblem016.c + + + </span> + + + + </a> + </li> + + + + + </ul> + </nav> + + </li> + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + <li class="md-nav__item md-nav__item--active md-nav__item--nested"> + + + + <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_10_10" checked> + + + <div class="md-nav__link md-nav__container"> + <a href="../" class="md-nav__link "> + + + + <span class="md-ellipsis"> + + + Practice c + + + </span> + + + + </a> + + + <label class="md-nav__link " for="__nav_10_10" id="__nav_10_10_label" tabindex="0"> + <span class="md-nav__icon md-icon"></span> + </label> + + </div> + + <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_10_10_label" aria-expanded="true"> + <label class="md-nav__title" for="__nav_10_10"> + <span class="md-nav__icon md-icon"></span> + + + Practice c + + </label> + <ul class="md-nav__list" data-md-scrollfix> + + + + + + + + + + <li class="md-nav__item"> + <a href="../external_1/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_1.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../external_2/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_2.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + + + <li class="md-nav__item md-nav__item--active"> + + + + + + + + <label class="md-nav__link md-nav__link--active" for="__toc"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + <span class="md-nav__icon md-icon"></span> + </label> + + <a href="././" class="md-nav__link md-nav__link--active"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + + + + +<nav class="md-nav md-nav--secondary" aria-label="On this page"> + + + + + + + <label class="md-nav__title" for="__toc"> + <span class="md-nav__icon md-icon"></span> + On this page + </label> + <ul class="md-nav__list" data-md-component="toc" data-md-scrollfix> + + <li class="md-nav__item"> + <a href="#actions" class="md-nav__link"> + <span class="md-ellipsis"> + <span class="md-typeset"> + Actions + </span> + </span> + </a> + +</li> + + <li class="md-nav__item"> + <a href="#source-code" class="md-nav__link"> + <span class="md-ellipsis"> + <span class="md-typeset"> + Source Code + </span> + </span> + </a> + +</li> + + </ul> + +</nav> + + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../pc-ip-01/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + pc-ip-01.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../pc-ip-02/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + pc-ip-02.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../pc-ip-03/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + pc-ip-03.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../pc-ip-04/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + pc-ip-04.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../pc-ip-05/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + pc-ip-05.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../pc-ip-06/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + pc-ip-06.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../pc-ip-07/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + pc-ip-07.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../pc-ip-08/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + pc-ip-08.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../pc-ip-09/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + pc-ip-09.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../pc-ip-10/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + pc-ip-10.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../pc-ip-11/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + pc-ip-11.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../pc-ip-12/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + pc-ip-12.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../pc-ip-13/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + pc-ip-13.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../pc-ip-14/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + pc-ip-14.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../pc-ip-15/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + pc-ip-15.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../pc-ip-16/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + pc-ip-16.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../pc-ip-17/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + pc-ip-17.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../pc-ip-18/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + pc-ip-18.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../pc-ip-19/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + pc-ip-19.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../pc-ip-20/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + pc-ip-20.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../pc001/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + pc001.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../pc002/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + pc002.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../pc003/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + pc003.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../pc004/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + pc004.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../pc005/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + pc005.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../pc006/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + pc006.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../pc007/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + pc007.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../pc008/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + pc008.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../pc009/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + pc009.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../pc010/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + pc010.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../pc011/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + pc011.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../pc012/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + pc012.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../pc013/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + pc013.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../pc014/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + pc014.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../pc015/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + pc015.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../pc016/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + pc016.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../pc017/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + pc017.c + + + </span> + + + + </a> + </li> + + + + + </ul> + </nav> + + </li> + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + <li class="md-nav__item md-nav__item--nested"> + + + + <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_10_11" > + + + <div class="md-nav__link md-nav__container"> + <a href="../../temp/" class="md-nav__link "> + + + + <span class="md-ellipsis"> + + + Temp + + + </span> + + + + </a> + + + <label class="md-nav__link " for="__nav_10_11" id="__nav_10_11_label" tabindex="0"> + <span class="md-nav__icon md-icon"></span> + </label> + + </div> + + <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_10_11_label" aria-expanded="false"> + <label class="md-nav__title" for="__nav_10_11"> + <span class="md-nav__icon md-icon"></span> + + + Temp + + </label> + <ul class="md-nav__list" data-md-scrollfix> + + + + + + + + + + <li class="md-nav__item"> + <a href="../../temp/maheswar01/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + maheswar01.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../temp/maheswar02/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + maheswar02.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../temp/sudipto1/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + sudipto1.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../temp/sudiptoown01/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + sudiptoown01.c + + + </span> + + + + </a> + </li> + + + + + </ul> + </nav> + + </li> + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + <li class="md-nav__item md-nav__item--nested"> + + + + <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_10_12" > + + + <div class="md-nav__link md-nav__container"> + <a href="../../tuition-c/" class="md-nav__link "> + + + + <span class="md-ellipsis"> + + + Tuition c + + + </span> + + + + </a> + + + <label class="md-nav__link " for="__nav_10_12" id="__nav_10_12_label" tabindex="0"> + <span class="md-nav__icon md-icon"></span> + </label> + + </div> + + <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_10_12_label" aria-expanded="false"> + <label class="md-nav__title" for="__nav_10_12"> + <span class="md-nav__icon md-icon"></span> + + + Tuition c + + </label> + <ul class="md-nav__list" data-md-scrollfix> + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-001/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-001.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-002/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-002.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-003/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-003.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-004/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-004.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-005/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-005.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-006/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-006.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-007/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-007.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-008/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-008.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-009/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-009.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-010/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-010.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-011/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-011.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-012/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-012.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-013/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-013.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-014/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-014.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-015/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-015.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-016/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-016.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-017/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-017.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-018/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-018.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-019/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-019.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-020/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-020.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-021/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-021.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-022/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-022.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-023/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-023.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-024/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-024.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-025/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-025.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-026/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-026.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-027/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-027.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-028/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-028.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-029/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-029.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-030/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-030.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-031/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-031.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-032/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-032.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-033/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-033.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-034/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-034.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-035/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-035.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-036/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-036.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-037/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-037.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-038/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-038.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-039/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-039.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-040/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-040.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-041/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-041.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-PRAC-042/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-PRAC-042.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-S-001/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-S-001.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-S-002/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-S-002.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-S-003/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-S-003.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-S-004/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-S-004.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-S-005/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-S-005.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-S-006/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-S-006.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-S-007/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-S-007.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-S-008/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-S-008.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-S-009/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-S-009.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-S-010/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-S-010.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-S-011/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-S-011.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-S-012/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-S-012.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-S-013/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-S-013.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-S-014/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-S-014.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-SPS-001/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-SPS-001.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-SPS-002/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-SPS-002.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-SPS-003/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-SPS-003.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-SPS-004/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-SPS-004.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-SPS-005/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-SPS-005.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-SPS-006/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-SPS-006.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-SPS-007/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-SPS-007.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/APC-SPS-008/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + APC-SPS-008.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P001/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P001.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P002/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P002.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P003/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P003.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P004/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P004.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P005/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P005.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P006/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P006.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P007/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P007.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P008/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P008.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P009/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P009.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P010/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P010.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P011/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P011.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P012/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P012.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P013/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P013.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P014/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P014.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P015/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P015.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P016/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P016.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P017/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P017.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P018/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P018.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P019/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P019.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P020/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P020.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P021/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P021.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P022/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P022.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P023/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P023.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P024/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P024.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P025/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P025.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P026/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P026.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P027/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P027.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P028/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P028.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P029/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P029.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P030/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P030.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P031/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P031.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P032/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P032.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P033/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P033.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P034/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P034.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P035/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P035.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P036/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P036.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P037/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P037.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P038/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P038.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P039/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P039.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P040/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P040.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P041/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P041.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P042/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P042.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P043/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P043.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P044/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P044.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P045/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P045.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P046/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P046.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P047/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P047.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P048/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P048.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P049/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P049.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P050-SHORT/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P050-SHORT.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P050/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P050.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P051/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P051.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P052/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P052.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P053/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P053.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P054/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P054.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P055/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P055.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P056/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P056.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P057/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P057.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P058/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P058.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P059/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P059.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P060/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P060.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P061/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P061.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P062/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P062.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P063/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P063.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P064/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P064.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P065/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P065.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P066/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P066.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P067/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P067.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P068/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P068.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P069/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P069.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> + <a href="../../tuition-c/P070/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + P070.c + + + </span> + + + + </a> + </li> + + + + + </ul> + </nav> + + </li> + + + + + </ul> + </nav> + + </li> + + + + + + + + + + + + + + + + + + + + + + + + + + <li class="md-nav__item md-nav__item--section md-nav__item--nested"> + + + + <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_11" > + + + <div class="md-nav__link md-nav__container"> + <a href="../../../semester_2/" class="md-nav__link "> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-component" viewBox="0 0 24 24"><path d="M15.536 11.293a1 1 0 0 0 0 1.414l2.376 2.377a1 1 0 0 0 1.414 0l2.377-2.377a1 1 0 0 0 0-1.414l-2.377-2.377a1 1 0 0 0-1.414 0zM2.297 11.293a1 1 0 0 0 0 1.414l2.377 2.377a1 1 0 0 0 1.414 0l2.377-2.377a1 1 0 0 0 0-1.414L6.088 8.916a1 1 0 0 0-1.414 0zM8.916 17.912a1 1 0 0 0 0 1.415l2.377 2.376a1 1 0 0 0 1.414 0l2.377-2.376a1 1 0 0 0 0-1.415l-2.377-2.376a1 1 0 0 0-1.414 0zM8.916 4.674a1 1 0 0 0 0 1.414l2.377 2.376a1 1 0 0 0 1.414 0l2.377-2.376a1 1 0 0 0 0-1.414l-2.377-2.377a1 1 0 0 0-1.414 0z"/></svg> + + <span class="md-ellipsis"> + + + Semester 2 + + + </span> + + + + </a> + + </div> + + <nav class="md-nav" data-md-level="1" aria-labelledby="__nav_11_label" aria-expanded="false"> + <label class="md-nav__title" for="__nav_11"> + <span class="md-nav__icon md-icon"></span> + + + Semester 2 + + </label> + <ul class="md-nav__list" data-md-scrollfix> + + + + </ul> + </nav> + + </li> + + + + + + + + + + + + + + + + + + + + + + + + + + <li class="md-nav__item md-nav__item--section md-nav__item--nested"> + + + + <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_12" > + + + <div class="md-nav__link md-nav__container"> + <a href="../../../semester_3/" class="md-nav__link "> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-component" viewBox="0 0 24 24"><path d="M15.536 11.293a1 1 0 0 0 0 1.414l2.376 2.377a1 1 0 0 0 1.414 0l2.377-2.377a1 1 0 0 0 0-1.414l-2.377-2.377a1 1 0 0 0-1.414 0zM2.297 11.293a1 1 0 0 0 0 1.414l2.377 2.377a1 1 0 0 0 1.414 0l2.377-2.377a1 1 0 0 0 0-1.414L6.088 8.916a1 1 0 0 0-1.414 0zM8.916 17.912a1 1 0 0 0 0 1.415l2.377 2.376a1 1 0 0 0 1.414 0l2.377-2.376a1 1 0 0 0 0-1.415l-2.377-2.376a1 1 0 0 0-1.414 0zM8.916 4.674a1 1 0 0 0 0 1.414l2.377 2.376a1 1 0 0 0 1.414 0l2.377-2.376a1 1 0 0 0 0-1.414l-2.377-2.377a1 1 0 0 0-1.414 0z"/></svg> + + <span class="md-ellipsis"> + + + Semester 3 + + + </span> + + + + </a> + + </div> + + <nav class="md-nav" data-md-level="1" aria-labelledby="__nav_12_label" aria-expanded="false"> + <label class="md-nav__title" for="__nav_12"> + <span class="md-nav__icon md-icon"></span> + + + Semester 3 + + </label> + <ul class="md-nav__list" data-md-scrollfix> + + + + </ul> + </nav> + + </li> + + + + + + + + + + + + + + + + + + + + + + + + + + <li class="md-nav__item md-nav__item--section md-nav__item--nested"> + + + + <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_13" > + + + <div class="md-nav__link md-nav__container"> + <a href="../../../semester_4/" class="md-nav__link "> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-component" viewBox="0 0 24 24"><path d="M15.536 11.293a1 1 0 0 0 0 1.414l2.376 2.377a1 1 0 0 0 1.414 0l2.377-2.377a1 1 0 0 0 0-1.414l-2.377-2.377a1 1 0 0 0-1.414 0zM2.297 11.293a1 1 0 0 0 0 1.414l2.377 2.377a1 1 0 0 0 1.414 0l2.377-2.377a1 1 0 0 0 0-1.414L6.088 8.916a1 1 0 0 0-1.414 0zM8.916 17.912a1 1 0 0 0 0 1.415l2.377 2.376a1 1 0 0 0 1.414 0l2.377-2.376a1 1 0 0 0 0-1.415l-2.377-2.376a1 1 0 0 0-1.414 0zM8.916 4.674a1 1 0 0 0 0 1.414l2.377 2.376a1 1 0 0 0 1.414 0l2.377-2.376a1 1 0 0 0 0-1.414l-2.377-2.377a1 1 0 0 0-1.414 0z"/></svg> + + <span class="md-ellipsis"> + + + Semester 4 + + + </span> + + + + </a> + + </div> + + <nav class="md-nav" data-md-level="1" aria-labelledby="__nav_13_label" aria-expanded="false"> + <label class="md-nav__title" for="__nav_13"> + <span class="md-nav__icon md-icon"></span> + + + Semester 4 + + </label> + <ul class="md-nav__list" data-md-scrollfix> + + + + </ul> + </nav> + + </li> + + + + + + + + + + + + + + + + + + + + + + + + + + <li class="md-nav__item md-nav__item--section md-nav__item--nested"> + + + + <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_14" > + + + <div class="md-nav__link md-nav__container"> + <a href="../../../semester_5/" class="md-nav__link "> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-component" viewBox="0 0 24 24"><path d="M15.536 11.293a1 1 0 0 0 0 1.414l2.376 2.377a1 1 0 0 0 1.414 0l2.377-2.377a1 1 0 0 0 0-1.414l-2.377-2.377a1 1 0 0 0-1.414 0zM2.297 11.293a1 1 0 0 0 0 1.414l2.377 2.377a1 1 0 0 0 1.414 0l2.377-2.377a1 1 0 0 0 0-1.414L6.088 8.916a1 1 0 0 0-1.414 0zM8.916 17.912a1 1 0 0 0 0 1.415l2.377 2.376a1 1 0 0 0 1.414 0l2.377-2.376a1 1 0 0 0 0-1.415l-2.377-2.376a1 1 0 0 0-1.414 0zM8.916 4.674a1 1 0 0 0 0 1.414l2.377 2.376a1 1 0 0 0 1.414 0l2.377-2.376a1 1 0 0 0 0-1.414l-2.377-2.377a1 1 0 0 0-1.414 0z"/></svg> + + <span class="md-ellipsis"> + + + Semester 5 + + + </span> + + + + </a> + + </div> + + <nav class="md-nav" data-md-level="1" aria-labelledby="__nav_14_label" aria-expanded="false"> + <label class="md-nav__title" for="__nav_14"> + <span class="md-nav__icon md-icon"></span> + + + Semester 5 + + </label> + <ul class="md-nav__list" data-md-scrollfix> + + + + </ul> + </nav> + + </li> + + + + + + + + + + + + + + + + + + + + + + + + + + <li class="md-nav__item md-nav__item--section md-nav__item--nested"> + + + + <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_15" > + + + <div class="md-nav__link md-nav__container"> + <a href="../../../semester_6/" class="md-nav__link "> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-component" viewBox="0 0 24 24"><path d="M15.536 11.293a1 1 0 0 0 0 1.414l2.376 2.377a1 1 0 0 0 1.414 0l2.377-2.377a1 1 0 0 0 0-1.414l-2.377-2.377a1 1 0 0 0-1.414 0zM2.297 11.293a1 1 0 0 0 0 1.414l2.377 2.377a1 1 0 0 0 1.414 0l2.377-2.377a1 1 0 0 0 0-1.414L6.088 8.916a1 1 0 0 0-1.414 0zM8.916 17.912a1 1 0 0 0 0 1.415l2.377 2.376a1 1 0 0 0 1.414 0l2.377-2.376a1 1 0 0 0 0-1.415l-2.377-2.376a1 1 0 0 0-1.414 0zM8.916 4.674a1 1 0 0 0 0 1.414l2.377 2.376a1 1 0 0 0 1.414 0l2.377-2.376a1 1 0 0 0 0-1.414l-2.377-2.377a1 1 0 0 0-1.414 0z"/></svg> + + <span class="md-ellipsis"> + + + Semester 6 + + + </span> + + + + </a> + + </div> + + <nav class="md-nav" data-md-level="1" aria-labelledby="__nav_15_label" aria-expanded="false"> + <label class="md-nav__title" for="__nav_15"> + <span class="md-nav__icon md-icon"></span> + + + Semester 6 + + </label> + <ul class="md-nav__list" data-md-scrollfix> + + + + </ul> + </nav> + + </li> + + + + + + + + + + + + + + + + + + + + + + + + + + <li class="md-nav__item md-nav__item--section md-nav__item--nested"> + + + + <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_16" > + + + <div class="md-nav__link md-nav__container"> + <a href="../../../semester_7/" class="md-nav__link "> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-component" viewBox="0 0 24 24"><path d="M15.536 11.293a1 1 0 0 0 0 1.414l2.376 2.377a1 1 0 0 0 1.414 0l2.377-2.377a1 1 0 0 0 0-1.414l-2.377-2.377a1 1 0 0 0-1.414 0zM2.297 11.293a1 1 0 0 0 0 1.414l2.377 2.377a1 1 0 0 0 1.414 0l2.377-2.377a1 1 0 0 0 0-1.414L6.088 8.916a1 1 0 0 0-1.414 0zM8.916 17.912a1 1 0 0 0 0 1.415l2.377 2.376a1 1 0 0 0 1.414 0l2.377-2.376a1 1 0 0 0 0-1.415l-2.377-2.376a1 1 0 0 0-1.414 0zM8.916 4.674a1 1 0 0 0 0 1.414l2.377 2.376a1 1 0 0 0 1.414 0l2.377-2.376a1 1 0 0 0 0-1.414l-2.377-2.377a1 1 0 0 0-1.414 0z"/></svg> + + <span class="md-ellipsis"> + + + Semester 7 + + + </span> + + + + </a> + + </div> + + <nav class="md-nav" data-md-level="1" aria-labelledby="__nav_16_label" aria-expanded="false"> + <label class="md-nav__title" for="__nav_16"> + <span class="md-nav__icon md-icon"></span> + + + Semester 7 + + </label> + <ul class="md-nav__list" data-md-scrollfix> + + + + </ul> + </nav> + + </li> + + + + + + + + + + + + + + + + + + + + + + + + + + <li class="md-nav__item md-nav__item--section md-nav__item--nested"> + + + + <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_17" > + + + <div class="md-nav__link md-nav__container"> + <a href="../../../semester_8/" class="md-nav__link "> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-component" viewBox="0 0 24 24"><path d="M15.536 11.293a1 1 0 0 0 0 1.414l2.376 2.377a1 1 0 0 0 1.414 0l2.377-2.377a1 1 0 0 0 0-1.414l-2.377-2.377a1 1 0 0 0-1.414 0zM2.297 11.293a1 1 0 0 0 0 1.414l2.377 2.377a1 1 0 0 0 1.414 0l2.377-2.377a1 1 0 0 0 0-1.414L6.088 8.916a1 1 0 0 0-1.414 0zM8.916 17.912a1 1 0 0 0 0 1.415l2.377 2.376a1 1 0 0 0 1.414 0l2.377-2.376a1 1 0 0 0 0-1.415l-2.377-2.376a1 1 0 0 0-1.414 0zM8.916 4.674a1 1 0 0 0 0 1.414l2.377 2.376a1 1 0 0 0 1.414 0l2.377-2.376a1 1 0 0 0 0-1.414l-2.377-2.377a1 1 0 0 0-1.414 0z"/></svg> + + <span class="md-ellipsis"> + + + Semester 8 + + + </span> + + + + </a> + + </div> + + <nav class="md-nav" data-md-level="1" aria-labelledby="__nav_17_label" aria-expanded="false"> + <label class="md-nav__title" for="__nav_17"> + <span class="md-nav__icon md-icon"></span> + + + Semester 8 + + </label> + <ul class="md-nav__list" data-md-scrollfix> + + + + </ul> + </nav> + + </li> + + + + </ul> +</nav> + </div> + </div> + </div> + + + + <div class="md-sidebar md-sidebar--secondary" data-md-component="sidebar" data-md-type="toc" > + <div class="md-sidebar__scrollwrap"> + + + + + + + + <input class="md-nav__toggle md-toggle" type="checkbox" id="__toc"> + <div class="md-sidebar-button__wrapper"> + <label class="md-sidebar-button" for="__toc"></label> + </div> + + + <div class="md-sidebar__inner"> + + + +<nav class="md-nav md-nav--secondary" aria-label="On this page"> + + + + + + + <label class="md-nav__title" for="__toc"> + <span class="md-nav__icon md-icon"></span> + On this page + </label> + <ul class="md-nav__list" data-md-component="toc" data-md-scrollfix> + + <li class="md-nav__item"> + <a href="#actions" class="md-nav__link"> + <span class="md-ellipsis"> + <span class="md-typeset"> + Actions + </span> + </span> + </a> + +</li> + + <li class="md-nav__item"> + <a href="#source-code" class="md-nav__link"> + <span class="md-ellipsis"> + <span class="md-typeset"> + Source Code + </span> + </span> + </a> + +</li> + + </ul> + +</nav> + </div> + </div> + </div> + + + + <div class="md-content" data-md-component="content"> + + + + + + + + + <nav class="md-path" aria-label="Navigation" > + <ol class="md-path__list"> + + + + + <li class="md-path__item"> + <a href="../../.." class="md-path__link"> + + + <span class="md-ellipsis"> + BSc Code Index + </span> + + </a> + </li> + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + <li class="md-path__item"> + <a href="../../" class="md-path__link"> + + + <span class="md-ellipsis"> + Semester 1 + </span> + + </a> + </li> + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + <li class="md-path__item"> + <a href="../" class="md-path__link"> + + + <span class="md-ellipsis"> + Practice c + </span> + + </a> + </li> + + + + + </ol> + </nav> + + + <article class="md-content__inner md-typeset"> + + <link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/@tabler/icons-webfont@latest/tabler-icons.min.css"> + + <!-- ── Desktop dropdown ── --> + <div class="custom-dropdown" id="quickActionsDropdown"> + <button class="custom-dropdown-btn" id="ddBtn" aria-haspopup="true" aria-expanded="false" onclick="toggleDropdown(event)"> + <span class="ti ti-bolt" aria-hidden="true"></span> + Quick actions + <span class="ti ti-chevron-right chevron" aria-hidden="true"></span> + </button> + <div class="custom-dropdown-content" role="menu"> + <a href="/" role="menuitem"> + <span class="ti ti-home item-icon" aria-hidden="true"></span> + <span class="item-label">Home</span> + </a> + <a href="/tags/" role="menuitem" onclick="focusSearch(event)"> + <span class="ti ti-search item-icon" aria-hidden="true"></span> + <span class="item-label">Search</span> + </a> + <div class="dropdown-divider"></div> + <div class="dropdown-section-label">Repository</div> + <a href="https://github.com/notamitgamer/bsc" target="_blank" rel="noopener" role="menuitem"> + <span class="ti ti-brand-github item-icon" aria-hidden="true"></span> + <span class="item-label">View repository</span> + </a> + <a href="https://github.com/notamitgamer/bsc/pulls" target="_blank" rel="noopener" role="menuitem"> + <span class="ti ti-git-pull-request item-icon" aria-hidden="true"></span> + <span class="item-label">Submit a PR</span> + </a> + <a href="https://github.com/notamitgamer/bsc/issues/new" target="_blank" rel="noopener" role="menuitem"> + <span class="ti ti-bug item-icon" aria-hidden="true"></span> + <span class="item-label">Report a bug</span> + <span class="item-badge">Issues</span> + </a> + <div class="dropdown-divider"></div> + <div class="dropdown-section-label">Developer</div> + <a href="https://amit.is-a.dev" target="_blank" rel="noopener" role="menuitem"> + <span class="ti ti-briefcase item-icon" aria-hidden="true"></span> + <span class="item-label">Portfolio</span> + </a> + <a href="https://github.com/notamitgamer" target="_blank" rel="noopener" role="menuitem"> + <span class="ti ti-brand-github item-icon" aria-hidden="true"></span> + <span class="item-label">GitHub profile</span> + </a> + </div> + </div> + + <!-- ── Mobile bottom sheet ── --> + <div class="dd-backdrop" id="ddBackdrop" onclick="closeSheet()"></div> + <div class="dd-sheet" id="ddSheet" role="dialog" aria-modal="true" aria-label="Quick actions"> + <div class="dd-sheet-handle"></div> + <div class="dd-sheet-title"> + <span class="ti ti-bolt" aria-hidden="true"></span> + Quick actions + </div> + <a href="/" onclick="closeSheet()"> + <span class="ti ti-home item-icon" aria-hidden="true"></span> + <span class="item-label">Home</span> + </a> + <a href="/terms" onclick="closeSheet()"> + <span class="ti ti-file-text item-icon" aria-hidden="true"></span> + <span class="item-label">terms</span> + </a> + <div class="dropdown-divider"></div> + <div class="dropdown-section-label">Repository</div> + <a href="https://github.com/notamitgamer/bsc" target="_blank" rel="noopener" onclick="closeSheet()"> + <span class="ti ti-brand-github item-icon" aria-hidden="true"></span> + <span class="item-label">View repository</span> + </a> + <a href="https://github.com/notamitgamer/bsc/pulls" target="_blank" rel="noopener" onclick="closeSheet()"> + <span class="ti ti-git-pull-request item-icon" aria-hidden="true"></span> + <span class="item-label">Submit a PR</span> + </a> + <a href="https://github.com/notamitgamer/bsc/issues/new" target="_blank" rel="noopener" onclick="closeSheet()"> + <span class="ti ti-bug item-icon" aria-hidden="true"></span> + <span class="item-label">Report a bug</span> + <span class="item-badge">Issues</span> + </a> + <div class="dropdown-divider"></div> + <div class="dropdown-section-label">Developer</div> + <a href="https://amit.is-a.dev" target="_blank" rel="noopener" onclick="closeSheet()"> + <span class="ti ti-briefcase item-icon" aria-hidden="true"></span> + <span class="item-label">Portfolio</span> + </a> + <a href="https://github.com/notamitgamer" target="_blank" rel="noopener" onclick="closeSheet()"> + <span class="ti ti-brand-github item-icon" aria-hidden="true"></span> + <span class="item-label">GitHub profile</span> + </a> + </div> + + <script> + function toggleDropdown(event) { + event.stopPropagation(); + var dd = document.getElementById('quickActionsDropdown'); + var isOpen = dd.classList.toggle('open'); + document.getElementById('ddBtn').setAttribute('aria-expanded', isOpen); + if (window.innerWidth < 768) { + if (isOpen) { openSheet(); } else { closeSheet(); } + } + } + + function openSheet() { + var backdrop = document.getElementById('ddBackdrop'); + var sheet = document.getElementById('ddSheet'); + backdrop.style.display = 'block'; + sheet.style.display = 'block'; + document.body.style.overflow = 'hidden'; + requestAnimationFrame(function() { + backdrop.classList.add('visible'); + sheet.classList.add('visible'); + }); + } + + function closeSheet() { + var backdrop = document.getElementById('ddBackdrop'); + var sheet = document.getElementById('ddSheet'); + var dd = document.getElementById('quickActionsDropdown'); + var btn = document.getElementById('ddBtn'); + backdrop.classList.remove('visible'); + sheet.classList.remove('visible'); + dd.classList.remove('open'); + if (btn) btn.setAttribute('aria-expanded', 'false'); + document.body.style.overflow = ''; + setTimeout(function() { + backdrop.style.display = 'none'; + sheet.style.display = 'none'; + }, 300); + } + + function focusSearch(event) { + event.preventDefault(); + var input = document.querySelector('.md-search__input'); + if (input) { + input.focus(); + // Close dropdown too + document.getElementById('quickActionsDropdown').classList.remove('open'); + document.getElementById('ddBtn').setAttribute('aria-expanded', 'false'); + } + } + + if (!window.dropdownListenerAdded) { + document.addEventListener('click', function(event) { + var dd = document.getElementById('quickActionsDropdown'); + var btn = document.getElementById('ddBtn'); + if (dd && !dd.contains(event.target)) { + dd.classList.remove('open'); + if (btn) btn.setAttribute('aria-expanded', 'false'); + } + }); + + document.addEventListener('keydown', function(event) { + if (event.key === 'Escape') { + var dd = document.getElementById('quickActionsDropdown'); + var btn = document.getElementById('ddBtn'); + if (dd && dd.classList.contains('open')) { + dd.classList.remove('open'); + if (btn) { btn.setAttribute('aria-expanded', 'false'); btn.focus(); } + } + closeSheet(); + } + }); + + window.dropdownListenerAdded = true; + } + </script> + + + + + <a href="https://github.com/notamitgamer/bsc/edit/main/docs-new/semester_1/practice-c/external_3.md" title="Edit this page" class="md-content__button md-icon" rel="edit"> + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-pen" viewBox="0 0 24 24"><path d="M12.659 22H18a2 2 0 0 0 2-2V8a2.4 2.4 0 0 0-.706-1.706l-3.588-3.588A2.4 2.4 0 0 0 14 2H6a2 2 0 0 0-2 2v9.34"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10.378 12.622a1 1 0 0 1 3 3.003L8.36 20.637a2 2 0 0 1-.854.506l-2.867.837a.5.5 0 0 1-.62-.62l.836-2.869a2 2 0 0 1 .506-.853z"/></svg> + </a> + + + + + + <a href="https://github.com/notamitgamer/bsc/raw/main/docs-new/semester_1/practice-c/external_3.md" title="View source of this page" class="md-content__button md-icon"> + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code-2" viewBox="0 0 24 24"><path d="M4 12.15V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.706.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2h-3.35"/><path d="M14 2v5a1 1 0 0 0 1 1h5M5 16l-3 3 3 3M9 22l3-3-3-3"/></svg> + </a> + + + +<h1 id="external_3c"><code>external_3.c</code><a class="headerlink" href="#external_3c" title="Permanent link">¶</a></h1> +<h2 id="actions">Actions<a class="headerlink" href="#actions" title="Permanent link">¶</a></h2> +<div class="action-buttons-desktop"> +<a href="https://raw.usercontent.amit.is-a.dev/semester_1/practice-c/external_3.c" class="md-button" target="_blank" rel="noopener">Raw</a> +<a href="https://github.com/notamitgamer/bsc/blob/main/semester_1/practice-c/external_3.c" class="md-button" target="_blank" rel="noopener">View on GitHub</a> +<button class="md-button" type="button" onclick="copyPageUrl()">Copy URL</button> +</div> + +<blockquote> +<p>You can print or save this file by opening Raw and using your browser.</p> +</blockquote> +<div class="action-buttons-mobile"> +<button class="md-button" onclick="openActionSheet()">Actions</button> +</div> + +<div class="dd-backdrop" id="actionBackdrop" onclick="closeActionSheet()"></div> +<div class="dd-sheet" id="actionSheet" role="dialog" aria-modal="true" aria-label="Actions"> + <div class="dd-sheet-handle"></div> + <div class="dd-sheet-title"><span class="ti ti-bolt" aria-hidden="true"></span> Actions</div> + <a href="https://raw.usercontent.amit.is-a.dev/semester_1/practice-c/external_3.c" target="_blank" rel="noopener" onclick="closeActionSheet()"> + <span class="ti ti-file-code item-icon" aria-hidden="true"></span> + <span class="item-label">Raw</span> + </a> + <a href="https://github.com/notamitgamer/bsc/blob/main/semester_1/practice-c/external_3.c" target="_blank" rel="noopener" onclick="closeActionSheet()"> + <span class="ti ti-brand-github item-icon" aria-hidden="true"></span> + <span class="item-label">View on GitHub</span> + </a> + <a href="javascript:void(0)" onclick="copyAndClose()"> + <span class="ti ti-copy item-icon" aria-hidden="true"></span> + <span class="item-label">Copy URL</span> + </a> +</div> + +<script> +function openActionSheet(){var b=document.getElementById("actionBackdrop"),s=document.getElementById("actionSheet");b.style.display="block";s.style.display="block";document.body.style.overflow="hidden";requestAnimationFrame(function(){b.classList.add("visible");s.classList.add("visible");});} +function closeActionSheet(){var b=document.getElementById("actionBackdrop"),s=document.getElementById("actionSheet");b.classList.remove("visible");s.classList.remove("visible");document.body.style.overflow="";setTimeout(function(){b.style.display="none";s.style.display="none";},300);} +function copyPageUrl(){var btn=document.querySelector(".action-buttons-desktop .md-button:last-child");try{navigator.clipboard.writeText(window.location.href).then(function(){if(btn){var o=btn.textContent;btn.textContent="Copied!";setTimeout(function(){btn.textContent=o;},1800);}}).catch(function(){fallbackCopy();});}catch(e){fallbackCopy();}} +function fallbackCopy(){var ta=document.createElement("textarea");ta.value=window.location.href;ta.style.position="fixed";ta.style.opacity="0";document.body.appendChild(ta);ta.focus();ta.select();try{document.execCommand("copy");}catch(e){}document.body.removeChild(ta);} +function copyAndClose(){closeActionSheet();setTimeout(function(){copyPageUrl();},320);} +</script> + +<h2 id="source-code">Source Code<a class="headerlink" href="#source-code" title="Permanent link">¶</a></h2> +<div data-search-exclude="true"> +<div class="language-c highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="cp">#include</span><span class="cpf"><stdio.h></span> +</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a> +</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a><span class="kt">int</span><span class="w"> </span><span class="nf">sum</span><span class="p">(</span><span class="kt">int</span><span class="p">);</span> +</span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a> +</span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a><span class="kt">int</span><span class="w"> </span><span class="nf">main</span><span class="p">()</span><span class="w"> </span><span class="p">{</span> +</span><span id="__span-0-6"><a id="__codelineno-0-6" name="__codelineno-0-6" href="#__codelineno-0-6"></a><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">n</span><span class="p">;</span> +</span><span id="__span-0-7"><a id="__codelineno-0-7" name="__codelineno-0-7" href="#__codelineno-0-7"></a><span class="w"> </span><span class="n">printf</span><span class="p">(</span><span class="s">"Enter the value for n: "</span><span class="p">);</span> +</span><span id="__span-0-8"><a id="__codelineno-0-8" name="__codelineno-0-8" href="#__codelineno-0-8"></a><span class="w"> </span><span class="n">scanf</span><span class="p">(</span><span class="s">"%d"</span><span class="p">,</span><span class="w"> </span><span class="o">&</span><span class="n">n</span><span class="p">);</span> +</span><span id="__span-0-9"><a id="__codelineno-0-9" name="__codelineno-0-9" href="#__codelineno-0-9"></a><span class="w"> </span><span class="n">printf</span><span class="p">(</span><span class="s">"</span><span class="se">\n</span><span class="s">Sum of the first n terms= %d"</span><span class="p">,</span><span class="w"> </span><span class="n">sum</span><span class="p">(</span><span class="n">n</span><span class="p">));</span> +</span><span id="__span-0-10"><a id="__codelineno-0-10" name="__codelineno-0-10" href="#__codelineno-0-10"></a><span class="w"> </span><span class="k">return</span><span class="w"> </span><span class="mi">0</span><span class="p">;</span> +</span><span id="__span-0-11"><a id="__codelineno-0-11" name="__codelineno-0-11" href="#__codelineno-0-11"></a><span class="p">}</span> +</span><span id="__span-0-12"><a id="__codelineno-0-12" name="__codelineno-0-12" href="#__codelineno-0-12"></a> +</span><span id="__span-0-13"><a id="__codelineno-0-13" name="__codelineno-0-13" href="#__codelineno-0-13"></a><span class="kt">int</span><span class="w"> </span><span class="nf">sum</span><span class="p">(</span><span class="kt">int</span><span class="w"> </span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="p">{</span> +</span><span id="__span-0-14"><a id="__codelineno-0-14" name="__codelineno-0-14" href="#__codelineno-0-14"></a><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">i</span><span class="p">,</span><span class="w"> </span><span class="n">res</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span><span class="p">;</span> +</span><span id="__span-0-15"><a id="__codelineno-0-15" name="__codelineno-0-15" href="#__codelineno-0-15"></a><span class="w"> </span><span class="k">for</span><span class="p">(</span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span><span class="p">;</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="o"><=</span><span class="w"> </span><span class="n">n</span><span class="p">;</span><span class="w"> </span><span class="n">i</span><span class="o">++</span><span class="p">)</span><span class="w"> </span><span class="p">{</span> +</span><span id="__span-0-16"><a id="__codelineno-0-16" name="__codelineno-0-16" href="#__codelineno-0-16"></a><span class="w"> </span><span class="k">if</span><span class="p">(</span><span class="n">i</span><span class="w"> </span><span class="o">%</span><span class="w"> </span><span class="mi">2</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="p">{</span> +</span><span id="__span-0-17"><a id="__codelineno-0-17" name="__codelineno-0-17" href="#__codelineno-0-17"></a><span class="w"> </span><span class="n">res</span><span class="w"> </span><span class="o">-=</span><span class="w"> </span><span class="n">i</span><span class="p">;</span> +</span><span id="__span-0-18"><a id="__codelineno-0-18" name="__codelineno-0-18" href="#__codelineno-0-18"></a><span class="w"> </span><span class="k">continue</span><span class="p">;</span> +</span><span id="__span-0-19"><a id="__codelineno-0-19" name="__codelineno-0-19" href="#__codelineno-0-19"></a><span class="w"> </span><span class="p">}</span> +</span><span id="__span-0-20"><a id="__codelineno-0-20" name="__codelineno-0-20" href="#__codelineno-0-20"></a><span class="w"> </span><span class="n">res</span><span class="w"> </span><span class="o">+=</span><span class="w"> </span><span class="n">i</span><span class="p">;</span> +</span><span id="__span-0-21"><a id="__codelineno-0-21" name="__codelineno-0-21" href="#__codelineno-0-21"></a><span class="w"> </span><span class="p">}</span> +</span><span id="__span-0-22"><a id="__codelineno-0-22" name="__codelineno-0-22" href="#__codelineno-0-22"></a><span class="w"> </span><span class="k">return</span><span class="w"> </span><span class="n">res</span><span class="p">;</span> +</span><span id="__span-0-23"><a id="__codelineno-0-23" name="__codelineno-0-23" href="#__codelineno-0-23"></a><span class="p">}</span> +</span></code></pre></div> +</div> + + + + + + + + + + + + + + + + + + + + </article> + </div> + + +<script>var target=document.getElementById(location.hash.slice(1));target&&target.name&&(target.checked=target.name.startsWith("__tabbed_"))</script> + </div> + + <button type="button" class="md-top md-icon" data-md-component="top" hidden> + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-circle-arrow-up" viewBox="0 0 24 24"><circle cx="12" cy="12" r="10"/><path d="m16 12-4-4-4 4M12 16V8"/></svg> + Back to top +</button> + + </main> + + <footer class="md-footer"> + + + + <nav class="md-footer__inner md-grid" aria-label="Footer" > + + + <a href="../external_2/" class="md-footer__link md-footer__link--prev" aria-label="Previous: external_2.c"> + <div class="md-footer__button md-icon"> + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-arrow-left" viewBox="0 0 24 24"><path d="m12 19-7-7 7-7M19 12H5"/></svg> + </div> + <div class="md-footer__title"> + <span class="md-footer__direction"> + Previous + </span> + <div class="md-ellipsis"> + external_2.c + </div> + </div> + </a> + + + + <a href="../pc-ip-01/" class="md-footer__link md-footer__link--next" aria-label="Next: pc-ip-01.c"> + <div class="md-footer__title"> + <span class="md-footer__direction"> + Next + </span> + <div class="md-ellipsis"> + pc-ip-01.c + </div> + </div> + <div class="md-footer__button md-icon"> + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-arrow-right" viewBox="0 0 24 24"><path d="M5 12h14M12 5l7 7-7 7"/></svg> + </div> + </a> + + </nav> + + + <div class="md-footer-meta md-typeset"> + <div class="md-footer-meta__inner md-grid"> + <div class="md-copyright"> + + <div class="md-copyright__highlight"> + Copyright © 2025–2026 <a href="https://amit.is-a.dev" target="_blank">amit.is-a.dev</a> / <a href="https://github.com/notamitgamer" target="_blank">notamitgamer</a> <br> <a href="https://github.com/notamitgamer/bsc/blob/main/LICENSE" target="_blank">MIT License</a> + + </div> + + +</div> + + +<div class="md-social"> + + + + + + + + + <a href="https://github.com/notamitgamer" target="_blank" rel="noopener" title="github.com" class="md-social__link"> + <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512"><!--! Font Awesome Free 7.2.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2026 Fonticons, Inc.--><path fill="currentColor" d="M173.9 397.4c0 2-2.3 3.6-5.2 3.6-3.3.3-5.6-1.3-5.6-3.6 0-2 2.3-3.6 5.2-3.6 3-.3 5.6 1.3 5.6 3.6m-31.1-4.5c-.7 2 1.3 4.3 4.3 4.9 2.6 1 5.6 0 6.2-2s-1.3-4.3-4.3-5.2c-2.6-.7-5.5.3-6.2 2.3m44.2-1.7c-2.9.7-4.9 2.6-4.6 4.9.3 2 2.9 3.3 5.9 2.6 2.9-.7 4.9-2.6 4.6-4.6-.3-1.9-3-3.2-5.9-2.9M252.8 8C114.1 8 8 113.3 8 252c0 110.9 69.8 205.8 169.5 239.2 12.8 2.3 17.3-5.6 17.3-12.1 0-6.2-.3-40.4-.3-61.4 0 0-70 15-84.7-29.8 0 0-11.4-29.1-27.8-36.6 0 0-22.9-15.7 1.6-15.4 0 0 24.9 2 38.6 25.8 21.9 38.6 58.6 27.5 72.9 20.9 2.3-16 8.8-27.1 16-33.7-55.9-6.2-112.3-14.3-112.3-110.5 0-27.5 7.6-41.3 23.6-58.9-2.6-6.5-11.1-33.3 2.6-67.9 20.9-6.5 69 27 69 27 20-5.6 41.5-8.5 62.8-8.5s42.8 2.9 62.8 8.5c0 0 48.1-33.6 69-27 13.7 34.7 5.2 61.4 2.6 67.9 16 17.7 25.8 31.5 25.8 58.9 0 96.5-58.9 104.2-114.8 110.5 9.2 7.9 17 22.9 17 46.4 0 33.7-.3 75.4-.3 83.6 0 6.5 4.6 14.4 17.3 12.1C436.2 457.8 504 362.9 504 252 504 113.3 391.5 8 252.8 8M105.2 352.9c-1.3 1-1 3.3.7 5.2 1.6 1.6 3.9 2.3 5.2 1 1.3-1 1-3.3-.7-5.2-1.6-1.6-3.9-2.3-5.2-1m-10.8-8.1c-.7 1.3.3 2.9 2.3 3.9 1.6 1 3.6.7 4.3-.7.7-1.3-.3-2.9-2.3-3.9-2-.6-3.6-.3-4.3.7m32.4 35.6c-1.6 1.3-1 4.3 1.3 6.2 2.3 2.3 5.2 2.6 6.5 1 1.3-1.3.7-4.3-1.3-6.2-2.2-2.3-5.2-2.6-6.5-1m-11.4-14.7c-1.6 1-1.6 3.6 0 5.9s4.3 3.3 5.6 2.3c1.6-1.3 1.6-3.9 0-6.2-1.4-2.3-4-3.3-5.6-2"/></svg> + </a> + + + + + + + + + <a href="https://discord.com/users/1274721760088166495" target="_blank" rel="noopener" title="discord.com" class="md-social__link"> + <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 576 512"><!--! Font Awesome Free 7.2.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2026 Fonticons, Inc.--><path fill="currentColor" d="M492.5 69.8c-.2-.3-.4-.6-.8-.7-38.1-17.5-78.4-30-119.7-37.1-.4-.1-.8 0-1.1.1s-.6.4-.8.8c-5.5 9.9-10.5 20.2-14.9 30.6-44.6-6.8-89.9-6.8-134.4 0-4.5-10.5-9.5-20.7-15.1-30.6-.2-.3-.5-.6-.8-.8s-.7-.2-1.1-.2C162.5 39 122.2 51.5 84.1 69c-.3.1-.6.4-.8.7C7.1 183.5-13.8 294.6-3.6 404.2c0 .3.1.5.2.8s.3.4.5.6c44.4 32.9 94 58 146.8 74.2.4.1.8.1 1.1 0s.7-.4.9-.7c11.3-15.4 21.4-31.8 30-48.8.1-.2.2-.5.2-.8s0-.5-.1-.8-.2-.5-.4-.6-.4-.3-.7-.4c-15.8-6.1-31.2-13.4-45.9-21.9-.3-.2-.5-.4-.7-.6s-.3-.6-.3-.9 0-.6.2-.9.3-.5.6-.7c3.1-2.3 6.2-4.7 9.1-7.1.3-.2.6-.4.9-.4s.7 0 1 .1c96.2 43.9 200.4 43.9 295.5 0 .3-.1.7-.2 1-.2s.7.2.9.4c2.9 2.4 6 4.9 9.1 7.2.2.2.4.4.6.7s.2.6.2.9-.1.6-.3.9-.4.5-.6.6c-14.7 8.6-30 15.9-45.9 21.8-.2.1-.5.2-.7.4s-.3.4-.4.7-.1.5-.1.8.1.5.2.8c8.8 17 18.8 33.3 30 48.8.2.3.6.6.9.7s.8.1 1.1 0c52.9-16.2 102.6-41.3 147.1-74.2.2-.2.4-.4.5-.6s.2-.5.2-.8c12.3-126.8-20.5-236.9-86.9-334.5zm-302 267.7c-29 0-52.8-26.6-52.8-59.2s23.4-59.2 52.8-59.2c29.7 0 53.3 26.8 52.8 59.2 0 32.7-23.4 59.2-52.8 59.2m195.4 0c-29 0-52.8-26.6-52.8-59.2s23.4-59.2 52.8-59.2c29.7 0 53.3 26.8 52.8 59.2 0 32.7-23.2 59.2-52.8 59.2"/></svg> + </a> + + + + + + + + + <a href="https://bsky.app/profile/amit.is-a.dev" target="_blank" rel="noopener" title="bsky.app" class="md-social__link"> + <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 576 512"><!--! Font Awesome Free 7.2.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2026 Fonticons, Inc.--><path fill="currentColor" d="M407.8 294.7c-3.3-.4-6.7-.8-10-1.3 3.4.4 6.7.9 10 1.3M288 227.1c-26.1-50.7-97.1-145.2-163.1-191.8C61.6-9.4 37.5-1.7 21.6 5.5 3.3 13.8 0 41.9 0 58.4S9.1 194 15 213.9c19.5 65.7 89.1 87.9 153.2 80.7 3.3-.5 6.6-.9 10-1.4-3.3.5-6.6 1-10 1.4-93.9 14-177.3 48.2-67.9 169.9C220.6 589.1 265.1 437.8 288 361.1c22.9 76.7 49.2 222.5 185.6 103.4 102.4-103.4 28.1-156-65.8-169.9-3.3-.4-6.7-.8-10-1.3 3.4.4 6.7.9 10 1.3 64.1 7.1 133.6-15.1 153.2-80.7C566.9 194 576 75 576 58.4s-3.3-44.7-21.6-52.9c-15.8-7.1-40-14.9-103.2 29.8C385.1 81.9 314.1 176.4 288 227.1"/></svg> + </a> + + + + + + + + + <a href="https://x.com/notamitgamer" target="_blank" rel="noopener" title="x.com" class="md-social__link"> + <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 448 512"><!--! Font Awesome Free 7.2.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2026 Fonticons, Inc.--><path fill="currentColor" d="M357.2 48h70.6L273.6 224.2 455 464H313L201.7 318.6 74.5 464H3.8l164.9-188.5L-5.2 48h145.6l100.5 132.9zm-24.8 373.8h39.1L119.1 88h-42z"/></svg> + </a> + +</div> + + </div> + </div> +</footer> + + </div> + <div class="md-dialog" data-md-component="dialog"> + <div class="md-dialog__inner md-typeset"></div> + </div> + + + + + + <script id="__config" type="application/json">{"annotate":null,"base":"../../..","features":["navigation.sections","navigation.indexes","navigation.top","navigation.footer","toc.follow","search.highlight","search.suggest","content.code.copy","content.code.annotate","navigation.path","search.share","content.tooltips","content.action.edit","content.action.view","header.autohide","navigation.instant","announce.dismiss"],"search":"../../../assets/javascripts/workers/search.e2d2d235.min.js","tags":null,"translations":{"clipboard.copied":"Copied to clipboard","clipboard.copy":"Copy to clipboard","search.result.more.one":"1 more on this page","search.result.more.other":"# more on this page","search.result.none":"No matching documents","search.result.one":"1 matching document","search.result.other":"# matching documents","search.result.placeholder":"Type to start searching","search.result.term.missing":"Missing","select.version":"Select version"},"version":null}</script> + + + <script src="../../../assets/javascripts/bundle.6e5f0216.min.js"></script> + + + </body> +</html>+ \ No newline at end of file diff --git a/docs/semester_1/practice-c/index.html b/docs/semester_1/practice-c/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="./external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="./pc-ip-01/" class="md-nav__link"> @@ -15027,6 +15058,8 @@ + + @@ -15259,186 +15292,191 @@ </tr> <tr> <td>3</td> +<td><code>external_3.c</code></td> +<td><a href="external_3/">View Code</a></td> +</tr> +<tr> +<td>4</td> <td><code>pc-ip-01.c</code></td> <td><a href="pc-ip-01/">View Code</a></td> </tr> <tr> -<td>4</td> +<td>5</td> <td><code>pc-ip-02.c</code></td> <td><a href="pc-ip-02/">View Code</a></td> </tr> <tr> -<td>5</td> +<td>6</td> <td><code>pc-ip-03.c</code></td> <td><a href="pc-ip-03/">View Code</a></td> </tr> <tr> -<td>6</td> +<td>7</td> <td><code>pc-ip-04.c</code></td> <td><a href="pc-ip-04/">View Code</a></td> </tr> <tr> -<td>7</td> +<td>8</td> <td><code>pc-ip-05.c</code></td> <td><a href="pc-ip-05/">View Code</a></td> </tr> <tr> -<td>8</td> +<td>9</td> <td><code>pc-ip-06.c</code></td> <td><a href="pc-ip-06/">View Code</a></td> </tr> <tr> -<td>9</td> +<td>10</td> <td><code>pc-ip-07.c</code></td> <td><a href="pc-ip-07/">View Code</a></td> </tr> <tr> -<td>10</td> +<td>11</td> <td><code>pc-ip-08.c</code></td> <td><a href="pc-ip-08/">View Code</a></td> </tr> <tr> -<td>11</td> +<td>12</td> <td><code>pc-ip-09.c</code></td> <td><a href="pc-ip-09/">View Code</a></td> </tr> <tr> -<td>12</td> +<td>13</td> <td><code>pc-ip-10.c</code></td> <td><a href="pc-ip-10/">View Code</a></td> </tr> <tr> -<td>13</td> +<td>14</td> <td><code>pc-ip-11.c</code></td> <td><a href="pc-ip-11/">View Code</a></td> </tr> <tr> -<td>14</td> +<td>15</td> <td><code>pc-ip-12.c</code></td> <td><a href="pc-ip-12/">View Code</a></td> </tr> <tr> -<td>15</td> +<td>16</td> <td><code>pc-ip-13.c</code></td> <td><a href="pc-ip-13/">View Code</a></td> </tr> <tr> -<td>16</td> +<td>17</td> <td><code>pc-ip-14.c</code></td> <td><a href="pc-ip-14/">View Code</a></td> </tr> <tr> -<td>17</td> +<td>18</td> <td><code>pc-ip-15.c</code></td> <td><a href="pc-ip-15/">View Code</a></td> </tr> <tr> -<td>18</td> +<td>19</td> <td><code>pc-ip-16.c</code></td> <td><a href="pc-ip-16/">View Code</a></td> </tr> <tr> -<td>19</td> +<td>20</td> <td><code>pc-ip-17.c</code></td> <td><a href="pc-ip-17/">View Code</a></td> </tr> <tr> -<td>20</td> +<td>21</td> <td><code>pc-ip-18.c</code></td> <td><a href="pc-ip-18/">View Code</a></td> </tr> <tr> -<td>21</td> +<td>22</td> <td><code>pc-ip-19.c</code></td> <td><a href="pc-ip-19/">View Code</a></td> </tr> <tr> -<td>22</td> +<td>23</td> <td><code>pc-ip-20.c</code></td> <td><a href="pc-ip-20/">View Code</a></td> </tr> <tr> -<td>23</td> +<td>24</td> <td><code>pc001.c</code></td> <td><a href="pc001/">View Code</a></td> </tr> <tr> -<td>24</td> +<td>25</td> <td><code>pc002.c</code></td> <td><a href="pc002/">View Code</a></td> </tr> <tr> -<td>25</td> +<td>26</td> <td><code>pc003.c</code></td> <td><a href="pc003/">View Code</a></td> </tr> <tr> -<td>26</td> +<td>27</td> <td><code>pc004.c</code></td> <td><a href="pc004/">View Code</a></td> </tr> <tr> -<td>27</td> +<td>28</td> <td><code>pc005.c</code></td> <td><a href="pc005/">View Code</a></td> </tr> <tr> -<td>28</td> +<td>29</td> <td><code>pc006.c</code></td> <td><a href="pc006/">View Code</a></td> </tr> <tr> -<td>29</td> +<td>30</td> <td><code>pc007.c</code></td> <td><a href="pc007/">View Code</a></td> </tr> <tr> -<td>30</td> +<td>31</td> <td><code>pc008.c</code></td> <td><a href="pc008/">View Code</a></td> </tr> <tr> -<td>31</td> +<td>32</td> <td><code>pc009.c</code></td> <td><a href="pc009/">View Code</a></td> </tr> <tr> -<td>32</td> +<td>33</td> <td><code>pc010.c</code></td> <td><a href="pc010/">View Code</a></td> </tr> <tr> -<td>33</td> +<td>34</td> <td><code>pc011.c</code></td> <td><a href="pc011/">View Code</a></td> </tr> <tr> -<td>34</td> +<td>35</td> <td><code>pc012.c</code></td> <td><a href="pc012/">View Code</a></td> </tr> <tr> -<td>35</td> +<td>36</td> <td><code>pc013.c</code></td> <td><a href="pc013/">View Code</a></td> </tr> <tr> -<td>36</td> +<td>37</td> <td><code>pc014.c</code></td> <td><a href="pc014/">View Code</a></td> </tr> <tr> -<td>37</td> +<td>38</td> <td><code>pc015.c</code></td> <td><a href="pc015/">View Code</a></td> </tr> <tr> -<td>38</td> +<td>39</td> <td><code>pc016.c</code></td> <td><a href="pc016/">View Code</a></td> </tr> <tr> -<td>39</td> +<td>40</td> <td><code>pc017.c</code></td> <td><a href="pc017/">View Code</a></td> </tr> diff --git a/docs/semester_1/practice-c/pc-ip-01/index.html b/docs/semester_1/practice-c/pc-ip-01/index.html @@ -13,7 +13,7 @@ <link rel="canonical" href="https://amit.is-a.dev/semester_1/practice-c/pc-ip-01/"> - <link rel="prev" href="../external_2/"> + <link rel="prev" href="../external_3/"> <link rel="next" href="../pc-ip-02/"> @@ -8673,6 +8673,8 @@ + + @@ -8784,6 +8786,35 @@ + + + <li class="md-nav__item"> + <a href="../external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + @@ -15131,6 +15162,8 @@ + + @@ -15492,7 +15525,7 @@ function copyAndClose(){closeActionSheet();setTimeout(function(){copyPageUrl();} <nav class="md-footer__inner md-grid" aria-label="Footer" > - <a href="../external_2/" class="md-footer__link md-footer__link--prev" aria-label="Previous: external_2.c"> + <a href="../external_3/" class="md-footer__link md-footer__link--prev" aria-label="Previous: external_3.c"> <div class="md-footer__button md-icon"> <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-arrow-left" viewBox="0 0 24 24"><path d="m12 19-7-7 7-7M19 12H5"/></svg> @@ -15502,7 +15535,7 @@ function copyAndClose(){closeActionSheet();setTimeout(function(){copyPageUrl();} Previous </span> <div class="md-ellipsis"> - external_2.c + external_3.c </div> </div> </a> diff --git a/docs/semester_1/practice-c/pc-ip-02/index.html b/docs/semester_1/practice-c/pc-ip-02/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../pc-ip-01/" class="md-nav__link"> @@ -15131,6 +15162,8 @@ + + diff --git a/docs/semester_1/practice-c/pc-ip-03/index.html b/docs/semester_1/practice-c/pc-ip-03/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../pc-ip-01/" class="md-nav__link"> @@ -15131,6 +15162,8 @@ + + diff --git a/docs/semester_1/practice-c/pc-ip-04/index.html b/docs/semester_1/practice-c/pc-ip-04/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../pc-ip-01/" class="md-nav__link"> @@ -15131,6 +15162,8 @@ + + diff --git a/docs/semester_1/practice-c/pc-ip-05/index.html b/docs/semester_1/practice-c/pc-ip-05/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../pc-ip-01/" class="md-nav__link"> @@ -15131,6 +15162,8 @@ + + diff --git a/docs/semester_1/practice-c/pc-ip-06/index.html b/docs/semester_1/practice-c/pc-ip-06/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../pc-ip-01/" class="md-nav__link"> @@ -15131,6 +15162,8 @@ + + diff --git a/docs/semester_1/practice-c/pc-ip-07/index.html b/docs/semester_1/practice-c/pc-ip-07/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../pc-ip-01/" class="md-nav__link"> @@ -15131,6 +15162,8 @@ + + diff --git a/docs/semester_1/practice-c/pc-ip-08/index.html b/docs/semester_1/practice-c/pc-ip-08/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../pc-ip-01/" class="md-nav__link"> @@ -15131,6 +15162,8 @@ + + diff --git a/docs/semester_1/practice-c/pc-ip-09/index.html b/docs/semester_1/practice-c/pc-ip-09/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../pc-ip-01/" class="md-nav__link"> @@ -15131,6 +15162,8 @@ + + diff --git a/docs/semester_1/practice-c/pc-ip-10/index.html b/docs/semester_1/practice-c/pc-ip-10/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../pc-ip-01/" class="md-nav__link"> @@ -15131,6 +15162,8 @@ + + diff --git a/docs/semester_1/practice-c/pc-ip-11/index.html b/docs/semester_1/practice-c/pc-ip-11/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../pc-ip-01/" class="md-nav__link"> @@ -15131,6 +15162,8 @@ + + diff --git a/docs/semester_1/practice-c/pc-ip-12/index.html b/docs/semester_1/practice-c/pc-ip-12/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../pc-ip-01/" class="md-nav__link"> @@ -15131,6 +15162,8 @@ + + diff --git a/docs/semester_1/practice-c/pc-ip-13/index.html b/docs/semester_1/practice-c/pc-ip-13/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../pc-ip-01/" class="md-nav__link"> @@ -15131,6 +15162,8 @@ + + diff --git a/docs/semester_1/practice-c/pc-ip-14/index.html b/docs/semester_1/practice-c/pc-ip-14/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../pc-ip-01/" class="md-nav__link"> @@ -15131,6 +15162,8 @@ + + diff --git a/docs/semester_1/practice-c/pc-ip-15/index.html b/docs/semester_1/practice-c/pc-ip-15/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../pc-ip-01/" class="md-nav__link"> @@ -15131,6 +15162,8 @@ + + diff --git a/docs/semester_1/practice-c/pc-ip-16/index.html b/docs/semester_1/practice-c/pc-ip-16/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../pc-ip-01/" class="md-nav__link"> @@ -15131,6 +15162,8 @@ + + diff --git a/docs/semester_1/practice-c/pc-ip-17/index.html b/docs/semester_1/practice-c/pc-ip-17/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../pc-ip-01/" class="md-nav__link"> @@ -15131,6 +15162,8 @@ + + diff --git a/docs/semester_1/practice-c/pc-ip-18/index.html b/docs/semester_1/practice-c/pc-ip-18/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../pc-ip-01/" class="md-nav__link"> @@ -15131,6 +15162,8 @@ + + diff --git a/docs/semester_1/practice-c/pc-ip-19/index.html b/docs/semester_1/practice-c/pc-ip-19/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../pc-ip-01/" class="md-nav__link"> @@ -15131,6 +15162,8 @@ + + diff --git a/docs/semester_1/practice-c/pc-ip-20/index.html b/docs/semester_1/practice-c/pc-ip-20/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../pc-ip-01/" class="md-nav__link"> @@ -15131,6 +15162,8 @@ + + diff --git a/docs/semester_1/practice-c/pc001/index.html b/docs/semester_1/practice-c/pc001/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../pc-ip-01/" class="md-nav__link"> @@ -15131,6 +15162,8 @@ + + diff --git a/docs/semester_1/practice-c/pc002/index.html b/docs/semester_1/practice-c/pc002/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../pc-ip-01/" class="md-nav__link"> @@ -15131,6 +15162,8 @@ + + diff --git a/docs/semester_1/practice-c/pc003/index.html b/docs/semester_1/practice-c/pc003/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../pc-ip-01/" class="md-nav__link"> @@ -15131,6 +15162,8 @@ + + diff --git a/docs/semester_1/practice-c/pc004/index.html b/docs/semester_1/practice-c/pc004/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../pc-ip-01/" class="md-nav__link"> @@ -15131,6 +15162,8 @@ + + diff --git a/docs/semester_1/practice-c/pc005/index.html b/docs/semester_1/practice-c/pc005/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../pc-ip-01/" class="md-nav__link"> @@ -15131,6 +15162,8 @@ + + diff --git a/docs/semester_1/practice-c/pc006/index.html b/docs/semester_1/practice-c/pc006/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../pc-ip-01/" class="md-nav__link"> @@ -15131,6 +15162,8 @@ + + diff --git a/docs/semester_1/practice-c/pc007/index.html b/docs/semester_1/practice-c/pc007/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../pc-ip-01/" class="md-nav__link"> @@ -15131,6 +15162,8 @@ + + diff --git a/docs/semester_1/practice-c/pc008/index.html b/docs/semester_1/practice-c/pc008/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../pc-ip-01/" class="md-nav__link"> @@ -15131,6 +15162,8 @@ + + diff --git a/docs/semester_1/practice-c/pc009/index.html b/docs/semester_1/practice-c/pc009/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../pc-ip-01/" class="md-nav__link"> @@ -15131,6 +15162,8 @@ + + diff --git a/docs/semester_1/practice-c/pc010/index.html b/docs/semester_1/practice-c/pc010/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../pc-ip-01/" class="md-nav__link"> @@ -15131,6 +15162,8 @@ + + diff --git a/docs/semester_1/practice-c/pc011/index.html b/docs/semester_1/practice-c/pc011/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../pc-ip-01/" class="md-nav__link"> @@ -15131,6 +15162,8 @@ + + diff --git a/docs/semester_1/practice-c/pc012/index.html b/docs/semester_1/practice-c/pc012/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../pc-ip-01/" class="md-nav__link"> @@ -15131,6 +15162,8 @@ + + diff --git a/docs/semester_1/practice-c/pc013/index.html b/docs/semester_1/practice-c/pc013/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../pc-ip-01/" class="md-nav__link"> @@ -15131,6 +15162,8 @@ + + diff --git a/docs/semester_1/practice-c/pc014/index.html b/docs/semester_1/practice-c/pc014/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../pc-ip-01/" class="md-nav__link"> @@ -15131,6 +15162,8 @@ + + diff --git a/docs/semester_1/practice-c/pc015/index.html b/docs/semester_1/practice-c/pc015/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../pc-ip-01/" class="md-nav__link"> @@ -15131,6 +15162,8 @@ + + diff --git a/docs/semester_1/practice-c/pc016/index.html b/docs/semester_1/practice-c/pc016/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../pc-ip-01/" class="md-nav__link"> @@ -15131,6 +15162,8 @@ + + diff --git a/docs/semester_1/practice-c/pc017/index.html b/docs/semester_1/practice-c/pc017/index.html @@ -8673,6 +8673,8 @@ + + @@ -8787,6 +8789,35 @@ <li class="md-nav__item"> + <a href="../external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../pc-ip-01/" class="md-nav__link"> @@ -15131,6 +15162,8 @@ + + diff --git a/docs/semester_1/temp/index.html b/docs/semester_1/temp/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/temp/maheswar01/index.html b/docs/semester_1/temp/maheswar01/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/temp/maheswar02/index.html b/docs/semester_1/temp/maheswar02/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/temp/sudipto1/index.html b/docs/semester_1/temp/sudipto1/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/temp/sudiptoown01/index.html b/docs/semester_1/temp/sudiptoown01/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-001/index.html b/docs/semester_1/tuition-c/APC-PRAC-001/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-002/index.html b/docs/semester_1/tuition-c/APC-PRAC-002/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-003/index.html b/docs/semester_1/tuition-c/APC-PRAC-003/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-004/index.html b/docs/semester_1/tuition-c/APC-PRAC-004/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-005/index.html b/docs/semester_1/tuition-c/APC-PRAC-005/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-006/index.html b/docs/semester_1/tuition-c/APC-PRAC-006/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-007/index.html b/docs/semester_1/tuition-c/APC-PRAC-007/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-008/index.html b/docs/semester_1/tuition-c/APC-PRAC-008/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-009/index.html b/docs/semester_1/tuition-c/APC-PRAC-009/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-010/index.html b/docs/semester_1/tuition-c/APC-PRAC-010/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-011/index.html b/docs/semester_1/tuition-c/APC-PRAC-011/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-012/index.html b/docs/semester_1/tuition-c/APC-PRAC-012/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-013/index.html b/docs/semester_1/tuition-c/APC-PRAC-013/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-014/index.html b/docs/semester_1/tuition-c/APC-PRAC-014/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-015/index.html b/docs/semester_1/tuition-c/APC-PRAC-015/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-016/index.html b/docs/semester_1/tuition-c/APC-PRAC-016/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-017/index.html b/docs/semester_1/tuition-c/APC-PRAC-017/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-018/index.html b/docs/semester_1/tuition-c/APC-PRAC-018/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-019/index.html b/docs/semester_1/tuition-c/APC-PRAC-019/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-020/index.html b/docs/semester_1/tuition-c/APC-PRAC-020/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-021/index.html b/docs/semester_1/tuition-c/APC-PRAC-021/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-022/index.html b/docs/semester_1/tuition-c/APC-PRAC-022/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-023/index.html b/docs/semester_1/tuition-c/APC-PRAC-023/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-024/index.html b/docs/semester_1/tuition-c/APC-PRAC-024/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-025/index.html b/docs/semester_1/tuition-c/APC-PRAC-025/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-026/index.html b/docs/semester_1/tuition-c/APC-PRAC-026/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-027/index.html b/docs/semester_1/tuition-c/APC-PRAC-027/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-028/index.html b/docs/semester_1/tuition-c/APC-PRAC-028/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-029/index.html b/docs/semester_1/tuition-c/APC-PRAC-029/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-030/index.html b/docs/semester_1/tuition-c/APC-PRAC-030/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-031/index.html b/docs/semester_1/tuition-c/APC-PRAC-031/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-032/index.html b/docs/semester_1/tuition-c/APC-PRAC-032/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-033/index.html b/docs/semester_1/tuition-c/APC-PRAC-033/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-034/index.html b/docs/semester_1/tuition-c/APC-PRAC-034/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-035/index.html b/docs/semester_1/tuition-c/APC-PRAC-035/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-036/index.html b/docs/semester_1/tuition-c/APC-PRAC-036/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-037/index.html b/docs/semester_1/tuition-c/APC-PRAC-037/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-038/index.html b/docs/semester_1/tuition-c/APC-PRAC-038/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-039/index.html b/docs/semester_1/tuition-c/APC-PRAC-039/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-040/index.html b/docs/semester_1/tuition-c/APC-PRAC-040/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-041/index.html b/docs/semester_1/tuition-c/APC-PRAC-041/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-PRAC-042/index.html b/docs/semester_1/tuition-c/APC-PRAC-042/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-S-001/index.html b/docs/semester_1/tuition-c/APC-S-001/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-S-002/index.html b/docs/semester_1/tuition-c/APC-S-002/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-S-003/index.html b/docs/semester_1/tuition-c/APC-S-003/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-S-004/index.html b/docs/semester_1/tuition-c/APC-S-004/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-S-005/index.html b/docs/semester_1/tuition-c/APC-S-005/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-S-006/index.html b/docs/semester_1/tuition-c/APC-S-006/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-S-007/index.html b/docs/semester_1/tuition-c/APC-S-007/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-S-008/index.html b/docs/semester_1/tuition-c/APC-S-008/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-S-009/index.html b/docs/semester_1/tuition-c/APC-S-009/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-S-010/index.html b/docs/semester_1/tuition-c/APC-S-010/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-S-011/index.html b/docs/semester_1/tuition-c/APC-S-011/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-S-012/index.html b/docs/semester_1/tuition-c/APC-S-012/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-S-013/index.html b/docs/semester_1/tuition-c/APC-S-013/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-S-014/index.html b/docs/semester_1/tuition-c/APC-S-014/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-SPS-001/index.html b/docs/semester_1/tuition-c/APC-SPS-001/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-SPS-002/index.html b/docs/semester_1/tuition-c/APC-SPS-002/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-SPS-003/index.html b/docs/semester_1/tuition-c/APC-SPS-003/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-SPS-004/index.html b/docs/semester_1/tuition-c/APC-SPS-004/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-SPS-005/index.html b/docs/semester_1/tuition-c/APC-SPS-005/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-SPS-006/index.html b/docs/semester_1/tuition-c/APC-SPS-006/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-SPS-007/index.html b/docs/semester_1/tuition-c/APC-SPS-007/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/APC-SPS-008/index.html b/docs/semester_1/tuition-c/APC-SPS-008/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P001/index.html b/docs/semester_1/tuition-c/P001/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P002/index.html b/docs/semester_1/tuition-c/P002/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P003/index.html b/docs/semester_1/tuition-c/P003/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P004/index.html b/docs/semester_1/tuition-c/P004/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P005/index.html b/docs/semester_1/tuition-c/P005/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P006/index.html b/docs/semester_1/tuition-c/P006/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P007/index.html b/docs/semester_1/tuition-c/P007/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P008/index.html b/docs/semester_1/tuition-c/P008/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P009/index.html b/docs/semester_1/tuition-c/P009/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P010/index.html b/docs/semester_1/tuition-c/P010/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P011/index.html b/docs/semester_1/tuition-c/P011/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P012/index.html b/docs/semester_1/tuition-c/P012/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P013/index.html b/docs/semester_1/tuition-c/P013/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P014/index.html b/docs/semester_1/tuition-c/P014/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P015/index.html b/docs/semester_1/tuition-c/P015/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P016/index.html b/docs/semester_1/tuition-c/P016/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P017/index.html b/docs/semester_1/tuition-c/P017/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P018/index.html b/docs/semester_1/tuition-c/P018/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P019/index.html b/docs/semester_1/tuition-c/P019/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P020/index.html b/docs/semester_1/tuition-c/P020/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P021/index.html b/docs/semester_1/tuition-c/P021/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P022/index.html b/docs/semester_1/tuition-c/P022/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P023/index.html b/docs/semester_1/tuition-c/P023/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P024/index.html b/docs/semester_1/tuition-c/P024/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P025/index.html b/docs/semester_1/tuition-c/P025/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P026/index.html b/docs/semester_1/tuition-c/P026/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P027/index.html b/docs/semester_1/tuition-c/P027/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P028/index.html b/docs/semester_1/tuition-c/P028/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P029/index.html b/docs/semester_1/tuition-c/P029/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P030/index.html b/docs/semester_1/tuition-c/P030/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P031/index.html b/docs/semester_1/tuition-c/P031/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P032/index.html b/docs/semester_1/tuition-c/P032/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P033/index.html b/docs/semester_1/tuition-c/P033/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P034/index.html b/docs/semester_1/tuition-c/P034/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P035/index.html b/docs/semester_1/tuition-c/P035/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P036/index.html b/docs/semester_1/tuition-c/P036/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P037/index.html b/docs/semester_1/tuition-c/P037/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P038/index.html b/docs/semester_1/tuition-c/P038/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P039/index.html b/docs/semester_1/tuition-c/P039/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P040/index.html b/docs/semester_1/tuition-c/P040/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P041/index.html b/docs/semester_1/tuition-c/P041/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P042/index.html b/docs/semester_1/tuition-c/P042/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P043/index.html b/docs/semester_1/tuition-c/P043/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P044/index.html b/docs/semester_1/tuition-c/P044/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P045/index.html b/docs/semester_1/tuition-c/P045/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P046/index.html b/docs/semester_1/tuition-c/P046/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P047/index.html b/docs/semester_1/tuition-c/P047/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P048/index.html b/docs/semester_1/tuition-c/P048/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P049/index.html b/docs/semester_1/tuition-c/P049/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P050-SHORT/index.html b/docs/semester_1/tuition-c/P050-SHORT/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P050/index.html b/docs/semester_1/tuition-c/P050/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P051/index.html b/docs/semester_1/tuition-c/P051/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P052/index.html b/docs/semester_1/tuition-c/P052/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P053/index.html b/docs/semester_1/tuition-c/P053/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P054/index.html b/docs/semester_1/tuition-c/P054/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P055/index.html b/docs/semester_1/tuition-c/P055/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P056/index.html b/docs/semester_1/tuition-c/P056/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P057/index.html b/docs/semester_1/tuition-c/P057/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P058/index.html b/docs/semester_1/tuition-c/P058/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P059/index.html b/docs/semester_1/tuition-c/P059/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P060/index.html b/docs/semester_1/tuition-c/P060/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P061/index.html b/docs/semester_1/tuition-c/P061/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P062/index.html b/docs/semester_1/tuition-c/P062/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P063/index.html b/docs/semester_1/tuition-c/P063/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P064/index.html b/docs/semester_1/tuition-c/P064/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P065/index.html b/docs/semester_1/tuition-c/P065/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P066/index.html b/docs/semester_1/tuition-c/P066/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P067/index.html b/docs/semester_1/tuition-c/P067/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P068/index.html b/docs/semester_1/tuition-c/P068/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P069/index.html b/docs/semester_1/tuition-c/P069/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/P070/index.html b/docs/semester_1/tuition-c/P070/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_1/tuition-c/index.html b/docs/semester_1/tuition-c/index.html @@ -8671,6 +8671,8 @@ + + @@ -8785,6 +8787,35 @@ <li class="md-nav__item"> + <a href="../practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_2/index.html b/docs/semester_2/index.html @@ -8669,6 +8669,8 @@ + + @@ -8783,6 +8785,35 @@ <li class="md-nav__item"> + <a href="../semester_1/practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../semester_1/practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_3/index.html b/docs/semester_3/index.html @@ -8669,6 +8669,8 @@ + + @@ -8783,6 +8785,35 @@ <li class="md-nav__item"> + <a href="../semester_1/practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../semester_1/practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_4/index.html b/docs/semester_4/index.html @@ -8669,6 +8669,8 @@ + + @@ -8783,6 +8785,35 @@ <li class="md-nav__item"> + <a href="../semester_1/practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../semester_1/practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_5/index.html b/docs/semester_5/index.html @@ -8669,6 +8669,8 @@ + + @@ -8783,6 +8785,35 @@ <li class="md-nav__item"> + <a href="../semester_1/practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../semester_1/practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_6/index.html b/docs/semester_6/index.html @@ -8669,6 +8669,8 @@ + + @@ -8783,6 +8785,35 @@ <li class="md-nav__item"> + <a href="../semester_1/practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../semester_1/practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_7/index.html b/docs/semester_7/index.html @@ -8669,6 +8669,8 @@ + + @@ -8783,6 +8785,35 @@ <li class="md-nav__item"> + <a href="../semester_1/practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../semester_1/practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/semester_8/index.html b/docs/semester_8/index.html @@ -8667,6 +8667,8 @@ + + @@ -8781,6 +8783,35 @@ <li class="md-nav__item"> + <a href="../semester_1/practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../semester_1/practice-c/pc-ip-01/" class="md-nav__link"> diff --git a/docs/sitemap.xml b/docs/sitemap.xml @@ -775,6 +775,9 @@ <loc>https://amit.is-a.dev/semester_1/practice-c/external_2/</loc> </url> <url> + <loc>https://amit.is-a.dev/semester_1/practice-c/external_3/</loc> + </url> + <url> <loc>https://amit.is-a.dev/semester_1/practice-c/pc-ip-01/</loc> </url> <url> diff --git a/docs/terms/index.html b/docs/terms/index.html @@ -8883,6 +8883,8 @@ + + @@ -8997,6 +8999,35 @@ <li class="md-nav__item"> + <a href="../semester_1/practice-c/external_3/" class="md-nav__link"> + + + + <svg xmlns="http://www.w3.org/2000/svg" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-file-code" viewBox="0 0 24 24"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5M10 12.5 8 15l2 2.5M14 12.5l2 2.5-2 2.5"/></svg> + + <span class="md-ellipsis"> + + + external_3.c + + + </span> + + + + </a> + </li> + + + + + + + + + + + <li class="md-nav__item"> <a href="../semester_1/practice-c/pc-ip-01/" class="md-nav__link">