commit 816e835456b731ee20685b70ce306f59ebe176b5
parent 504522914df3b4d94e96ee711f09d37d863d382a
Author: Amit Dutta <amitdutta4255@gmail.com>
Date: Sat, 20 Jun 2026 15:09:29 +0530
added some algo
Diffstat:
15 files changed, 248 insertions(+), 104 deletions(-)
diff --git a/docs-new/.vitepress/theme/components/TermsBanner.vue b/docs-new/.vitepress/theme/components/TermsBanner.vue
@@ -64,7 +64,7 @@ const acceptTerms = () => {
pointer-events: auto;
width: 100%;
min-height: 33.33dvh;
- background-color: #3e63ddf6;
+ background-color: #5c6bc8f6;
color: #ffffff;
padding: 32px 24px calc(24px + env(safe-area-inset-bottom)) 24px;
box-shadow: 0 -10px 30px rgba(0, 0, 0, 0.15);
@@ -125,7 +125,7 @@ const acceptTerms = () => {
.banner-btn {
background-color: #ffffff;
- color: #3E63DD;
+ color: #5c6bc8;
padding: 12px 28px;
border-radius: 6px;
font-size: 14px;
diff --git a/docs-new/.vitepress/theme/style.css b/docs-new/.vitepress/theme/style.css
@@ -178,18 +178,24 @@
}
:root {
+ --vp-c-brand-1: #a8b1ff;
+ --vp-c-brand-2: #8b97ff;
+ --vp-c-brand-3: #6e7eff;
+ --vp-c-brand: #a8b1ff;
+
--vp-home-hero-image-background-image: linear-gradient(
-45deg,
- #ec9822 50%,
- #fae6b8 50%
- );
+ #a8b1ff 50%,
+ #dde0ff 50%
+ );
--vp-home-hero-image-filter: blur(100px);
--vp-home-hero-name-color: transparent;
--vp-home-hero-name-background: -webkit-linear-gradient(
120deg,
- #ec9822 30%,
- #fae6b8
+ #a8b1ff 30%,
+ #dde0ff
);
+
--vp-font-family-base: 'Lexend', ui-sans-serif, system-ui, -apple-system, BlinkMacSystemFont, "Segoe UI", Roboto, "Helvetica Neue", Arial, sans-serif;
}
@@ -207,4 +213,18 @@
}
::-webkit-scrollbar-thumb:hover {
background: var(--vp-c-brand-1);
+}
+
+.dark ::-webkit-scrollbar-track {
+ background: var(--vp-c-bg-soft);
+}
+
+::selection {
+ background: #a8b1ff33;
+ color: var(--vp-c-text-1);
+}
+
+.VPFeature:hover {
+ border-color: var(--vp-c-brand-1) !important;
+ transition: border-color 0.2s;
}
\ No newline at end of file
diff --git a/docs-new/credits.md b/docs-new/credits.md
@@ -7,7 +7,7 @@ title: '<svg xmlns="http://www.w3.org/2000/svg" width="16" height="16" viewBox="
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.amit.is-a.dev` possible:
* **[is-a.dev](https://is-a.dev)**: For providing the sleek, developer-centric domain name completely free of charge, giving this project a professional home.
-* **[Hugging Face](https://huggingface.co)**: For securely and reliably storing the extensive collection of raw C programming files.
+* **[Hugging Face](https://huggingface.co)**: For securely and reliably storing the extensive collection of raw programming files.
* **[Cloudflare](https://www.cloudflare.com/)**: For handling the backend routing, DNS, and caching, seamlessly bridging the domain to ensure Hugging Face serves the code files swiftly and securely.
* **[GitHub](https://github.com/) & [GitHub Pages](https://pages.github.com/)**: For securely storing the entire open-source repository (including all code and markdown files) and providing lightning-fast, dependable web hosting for the compiled site.
* **[VitePress](https://vitepress.dev/)**: 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.
diff --git a/docs-new/faq.md b/docs-new/faq.md
@@ -13,7 +13,7 @@ A live archive of BSc Computer Science practical codes following the WBSU curric
**Amit Dutta**
### 3. Where is the source code hosted?
-On GitHub: <a href="https://github.com/notamitgamer/bsc">https://github.com/notamitgamer/bsc</a>
+On GitHub: https://github.com/notamitgamer/bsc
### 4. Can I use this code?
Yes, under the MIT License.
@@ -65,5 +65,4 @@ The project is continuously updated.
As the academic journey progresses.
### 17. Where can I report issues?
-On GitHub Issues:
-<a href="https://github.com/notamitgamer/bsc/issues">https://github.com/notamitgamer/bsc/issues</a>-
\ No newline at end of file
+On GitHub Issues: https://github.com/notamitgamer/bsc/issues+
\ No newline at end of file
diff --git a/docs-new/index.md b/docs-new/index.md
@@ -4,7 +4,7 @@ layout: home
hero:
name: "BSc Code Index"
text: "Coursework from WBSU"
- tagline: Comprehensive codebase and practical archives following the 4-year NEP-CCF structure under WBSU at Acharya Prafulla Chandra College.
+ tagline: Comprehensive codebase and practical archives following the 4-year NEP-CCF structure under WBSU at Acharya Prafulla Chandra College.<br><br>• MIT licensed
actions:
- theme: brand
text: Browse Semester 2 (Ongoing)
@@ -28,9 +28,14 @@ features:
title: Searchable by Problem
details: Every page is indexed by its problem statement. Search what you need to solve, find the reference instantly.
- - icon: '<svg viewBox="0 -0.5 24 24" id="meteor-icon-kit__solid-github" width="24" height="24" fill="none" xmlns="http://www.w3.org/2000/svg"><g id="SVGRepo_bgCarrier" stroke-width="0"></g><g id="SVGRepo_tracerCarrier" stroke-linecap="round" stroke-linejoin="round"></g><g id="SVGRepo_iconCarrier"><path fill-rule="evenodd" clip-rule="evenodd" d="M12.2047 0.00001C6.56031 -0.005731 1.74628 4.08615 0.842541 9.6577C-0.061195 15.2293 3.2126 20.6331 8.56941 22.4118C9.14823 22.5177 9.35294 22.1577 9.35294 21.8541C9.35294 21.5506 9.35294 20.8588 9.35294 19.8988C6.14117 20.5977 5.46353 18.3529 5.46353 18.3529C5.25046 17.6572 4.79779 17.0595 4.18588 16.6659C3.14823 15.96 4.27059 15.96 4.27059 15.96C5.00761 16.0641 5.65578 16.5014 6.02823 17.1459C6.34368 17.7179 6.87393 18.1406 7.50179 18.3208C8.12965 18.5009 8.8034 18.4236 9.37411 18.1059C9.41842 17.5252 9.66876 16.9794 10.08 16.5671C7.5247 16.2777 4.84235 15.2894 4.84235 10.92C4.82481 9.7786 5.24688 8.67412 6.02117 7.8353C5.67632 6.84285 5.71662 5.7571 6.13412 4.79295C6.13412 4.79295 7.10117 4.48236 9.29647 5.97177C11.1816 5.45419 13.1713 5.45419 15.0565 5.97177C17.2518 4.48236 18.2118 4.79295 18.2118 4.79295C18.6351 5.74689 18.6854 6.82486 18.3529 7.81412C19.1272 8.65294 19.5493 9.7574 19.5318 10.8988C19.5318 15.3177 16.8424 16.2847 14.28 16.5459C14.8359 17.1047 15.1218 17.8774 15.0635 18.6635C15.0635 20.2024 15.0635 21.4447 15.0635 21.8188C15.0635 22.1929 15.2682 22.4824 15.8541 22.3694C21.1473 20.5447 24.3569 15.1728 23.4554 9.6469C22.5539 4.1211 17.8034 0.04779 12.2047 0.00001z" fill="#758CA3"></path></g></svg>'
+ - icon: '<svg xmlns="http://www.w3.org/2000/svg" width="24" height="24" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2" stroke-linecap="round" stroke-linejoin="round" class="lucide lucide-network-icon lucide-network"><rect x="16" y="16" width="6" height="6" rx="1"/><rect x="2" y="16" width="6" height="6" rx="1"/><rect x="9" y="2" width="6" height="6" rx="1"/><path d="M5 16v-3a1 1 0 0 1 1-1h12a1 1 0 0 1 1 1v3"/><path d="M12 12V8"/></svg>'
+ title: Algorithms Included
+ details: Semester 2 onwards includes written algorithm documentation alongside source code — step-by-step logic, pseudocode, and complexity analysis.
+
+ - icon: '<svg viewBox="0 -0.5 24 24" id="meteor-icon-kit__solid-github" width="24" height="24" fill="none" xmlns="http://www.w3.org/2000/svg"><g id="SVGRepo_bgCarrier" stroke-width="0"></g><g id="SVGRepo_tracerCarrier" stroke-linecap="round" stroke-linejoin="round"></g><g id="SVGRepo_iconCarrier"><path fill-rule="evenodd" clip-rule="evenodd" d="M12.2047 0.00001C6.56031 -0.005731 1.74628 4.08615 0.842541 9.6577C-0.061195 15.2293 3.2126 20.6331 8.56941 22.4118C9.14823 22.5177 9.35294 22.1577 9.35294 21.8541C9.35294 21.5506 9.35294 20.8588 9.35294 19.8988C6.14117 20.5977 5.46353 18.3529 5.46353 18.3529C5.25046 17.6572 4.79779 17.0595 4.18588 16.6659C3.14823 15.96 4.27059 15.96 4.27059 15.96C5.00761 16.0641 5.65578 16.5014 6.02823 17.1459C6.34368 17.7179 6.87393 18.1406 7.50179 18.3208C8.12965 18.5009 8.8034 18.4236 9.37411 18.1059C9.41842 17.5252 9.66876 16.9794 10.08 16.5671C7.5247 16.2777 4.84235 15.2894 4.84235 10.92C4.82481 9.7786 5.24688 8.67412 6.02117 7.8353C5.67632 6.84285 5.71662 5.7571 6.13412 4.79295C6.13412 4.79295 7.10117 4.48236 9.29647 5.97177C11.1816 5.45419 13.1713 5.45419 15.0565 5.97177C17.2518 4.48236 18.2118 4.79295 18.2118 4.79295C18.6351 5.74689 18.6854 6.82486 18.3529 7.81412C19.1272 8.65294 19.5493 9.7574 19.5318 10.8988C19.5318 15.3177 16.8424 16.2847 14.28 16.5459C14.8359 17.1047 15.1218 17.8774 15.0635 18.6635C15.0635 20.2024 15.0635 21.4447 15.0635 21.8188C15.0635 22.1929 15.2682 22.4824 15.8541 22.3694C21.1473 20.5447 24.3569 15.1728 23.4554 9.6469C22.5539 4.1211 17.8034 0.04779 12.2047 0.00001z" fill="currentColor"></path></g></svg>'
title: Open Source
details: MIT licensed. Free to read, reference, and contribute to. All source available on GitHub.
+ link: https://github.com/notamitgamer/bsc/blob/main/LICENSE
---
## Roadmap & Progress
@@ -68,18 +73,25 @@ Download R from [CRAN](https://cran.r-project.org/) and use [RStudio](https://po
## Academic Integrity
-This repository is intended strictly for learning and reference.
+This repository exists to help you **learn**, not to help you cheat. Every resource here — programs, algorithms, notes, PDFs, and more — represents real coursework from an active BSc Honors CS degree. Use it as a reference to understand how problems are approached and solved, not as a shortcut to copy from.
-- Study the implementations to understand the underlying concepts
-- Direct copy-pasting for college submissions is strongly discouraged
-- The best approach is to understand the logic, then rewrite it yourself
+::: warning Please read before using
+- **Study, don't copy** — read the code, understand the logic, then write your own implementation from scratch
+- **Understand the why** — if you can't explain what the code does line by line, you haven't learned anything
+- **Submissions are your responsibility** — direct copy-pasting for college assignments is academic misconduct under most university policies, including WBSU
+- **You will be caught** — plagiarism detection tools are widely used; copied code is easily flagged
+:::
-The author holds no liability for academic misconduct resulting from misuse of this content. See the [Terms of Use](/terms).
+The author bears no liability for academic misconduct arising from misuse of this content. By using this site you agree to the [Terms of Use](/terms).
## About
-**Amit Dutta** — [@notamitgamer](https://github.com/notamitgamer) — [amit.is-a.dev](https://amit.is-a.dev)
+This project is maintained by **Amit Dutta**, a BSc Computer Science student at Acharya Prafulla Chandra College under the West Bengal State University (WBSU), documenting coursework across all 8 semesters of the NEP-CCF curriculum.
-* Personal Email: [amitdutta4255@gmail.com](mailto:amitdutta4255@gmail.com)
-* Work Email: [mail@amit.is-a.dev](mailto:mail@amit.is-a.dev)
-* License: [MIT](https://github.com/notamitgamer/bsc/blob/main/LICENSE)-
\ No newline at end of file
+| Contact | Details |
+|---|---|
+| **GitHub** | [@notamitgamer](https://github.com/notamitgamer) |
+| **Website** | [amit.is-a.dev](https://amit.is-a.dev) |
+| **Personal Email** | [amitdutta4255@gmail.com](mailto:amitdutta4255@gmail.com) |
+| **Work Email** | [mail@amit.is-a.dev](mailto:mail@amit.is-a.dev) |
+| **License** | [MIT](https://github.com/notamitgamer/bsc/blob/main/LICENSE) |+
\ No newline at end of file
diff --git a/docs-new/public/logo.svg b/docs-new/public/logo.svg
@@ -1 +1 @@
-<svg xmlns="http://www.w3.org/2000/svg" width="30" height="30" viewBox="0 0 24 24" fill="none" stroke="#FF9F1C" stroke-width="2" stroke-linecap="round" stroke-linejoin="round" class="lucide lucide-book-open-text-icon lucide-book-open-text"><path d="M12 7v14"/><path d="M16 12h2"/><path d="M16 8h2"/><path d="M3 18a1 1 0 0 1-1-1V4a1 1 0 0 1 1-1h5a4 4 0 0 1 4 4 4 4 0 0 1 4-4h5a1 1 0 0 1 1 1v13a1 1 0 0 1-1 1h-6a3 3 0 0 0-3 3 3 3 0 0 0-3-3z"/><path d="M6 12h2"/><path d="M6 8h2"/></svg>-
\ No newline at end of file
+<svg xmlns="http://www.w3.org/2000/svg" width="30" height="30" viewBox="0 0 24 24" fill="none" stroke="#a8b1ff" stroke-width="2" stroke-linecap="round" stroke-linejoin="round" class="lucide lucide-book-open-text-icon lucide-book-open-text"><path d="M12 7v14"/><path d="M16 12h2"/><path d="M16 8h2"/><path d="M3 18a1 1 0 0 1-1-1V4a1 1 0 0 1 1-1h5a4 4 0 0 1 4 4 4 4 0 0 1 4-4h5a1 1 0 0 1 1 1v13a1 1 0 0 1-1 1h-6a3 3 0 0 0-3 3 3 3 0 0 0-3-3z"/><path d="M6 12h2"/><path d="M6 8h2"/></svg>+
\ No newline at end of file
diff --git a/docs-new/public/logo_large.svg b/docs-new/public/logo_large.svg
@@ -1 +1 @@
-<svg xmlns="http://www.w3.org/2000/svg" width="300" height="300" viewBox="0 0 24 24" fill="none" stroke="#FF9F1C" stroke-width="2" stroke-linecap="round" stroke-linejoin="round" class="lucide lucide-book-open-text-icon lucide-book-open-text"><path d="M12 7v14"/><path d="M16 12h2"/><path d="M16 8h2"/><path d="M3 18a1 1 0 0 1-1-1V4a1 1 0 0 1 1-1h5a4 4 0 0 1 4 4 4 4 0 0 1 4-4h5a1 1 0 0 1 1 1v13a1 1 0 0 1-1 1h-6a3 3 0 0 0-3 3 3 3 0 0 0-3-3z"/><path d="M6 12h2"/><path d="M6 8h2"/></svg>-
\ No newline at end of file
+<svg xmlns="http://www.w3.org/2000/svg" width="300" height="300" viewBox="0 0 24 24" fill="none" stroke="#a8b1ff" stroke-width="2" stroke-linecap="round" stroke-linejoin="round" class="lucide lucide-book-open-text-icon lucide-book-open-text"><path d="M12 7v14"/><path d="M16 12h2"/><path d="M16 8h2"/><path d="M3 18a1 1 0 0 1-1-1V4a1 1 0 0 1 1-1h5a4 4 0 0 1 4 4 4 4 0 0 1 4-4h5a1 1 0 0 1 1 1v13a1 1 0 0 1-1 1h-6a3 3 0 0 0-3 3 3 3 0 0 0-3-3z"/><path d="M6 12h2"/><path d="M6 8h2"/></svg>+
\ No newline at end of file
diff --git a/docs-new/semester_2/algorithm/algo_01.md b/docs-new/semester_2/algorithm/algo_01.md
@@ -0,0 +1,28 @@
+---
+title: '<svg xmlns="http://www.w3.org/2000/svg" width="16" height="16" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2" stroke-linecap="round" stroke-linejoin="round" style="display:inline; margin-bottom:-2px; margin-right:6px;" class="lucide lucide-binary"><rect x="14" y="14" width="4" height="6" rx="2"/><rect x="6" y="4" width="4" height="6" rx="2"/><path d="M6 20h4"/><path d="M14 10h4"/><path d="M6 14h2v6"/><path d="M14 4h2v6"/></svg> algo_01'
+description: 'Write an algorithm to traverse a singly linked list.'
+---
+
+# algo_01
+
+### Problem Statement
+
+::: tip Problem Statement
+Write an algorithm to traverse a singly linked list.
+:::
+
+## Algorithm
+```
+procedure traverce(head)
+begin
+ if(head = NULL)
+ write("List is empty");
+ else
+ ptr <- head;
+ while(ptr != NULL)
+ write(info(ptr));
+ ptr <- next(ptr);
+ end while
+ end if
+end procedure
+```+
\ No newline at end of file
diff --git a/docs-new/semester_2/algorithm/index.md b/docs-new/semester_2/algorithm/index.md
@@ -0,0 +1,10 @@
+# Algorithm
+
+Files and sub-folders in **Algorithm**.
+
+## Files
+
+| # | File | Link |
+|---|---|---|
+| 1 | `algo_01` | [View Algorithm](algo_01.md) |
+
diff --git a/docs-new/semester_2/index.md b/docs-new/semester_2/index.md
@@ -18,6 +18,7 @@ This folder contains all my current academic work, including practicals, assignm
| 1 | Practice | [Open Folder](practice/index.md) |
| 2 | Tuition | [Open Folder](tuition/index.md) |
| 3 | Python | [Open Folder](python/index.md) |
+| 4 | Algorithm | [Open Folder](algorithm/index.md) |
## Directory Structure
diff --git a/docs-new/semester_2/python/code_01.md b/docs-new/semester_2/python/code_01.md
@@ -1,63 +0,0 @@
----
-title: '<svg xmlns="http://www.w3.org/2000/svg" width="16" height="16" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2" stroke-linecap="round" stroke-linejoin="round" style="display:inline; margin-bottom:-2px; margin-right:6px;"><path d="M6 22a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h8a2.4 2.4 0 0 1 1.704.706l3.588 3.588A2.4 2.4 0 0 1 20 8v12a2 2 0 0 1-2 2z"/><path d="M14 2v5a1 1 0 0 0 1 1h5"/><path d="M10 12a1 1 0 0 0-1 1v1a1 1 0 0 1-1 1 1 1 0 0 1 1 1v1a1 1 0 0 0 1 1"/><path d="M14 18a1 1 0 0 0 1-1v-1a1 1 0 0 1 1-1 1 1 0 0 1-1-1v-1a1 1 0 0 0-1-1"/></svg> code_01.py'
-description: 'Coming back to basics after months.'
----
-
-# code_01.py
-
-### Metadata
-
-- **Author** — Amit Dutta (amitdutta4255@gmail.com)
-- **Last updated** — 18 Jun 2026
-- **License** — [MIT](https://github.com/notamitgamer/bsc/blob/main/LICENSE)
-
-
-### Problem Statement
-
-::: tip Problem Statement
-Coming back to basics after months.
-:::
-
-## Source Code
-
-<div style="display:flex;gap:12px;margin-bottom:12px;">
- <a href="https://github.com/notamitgamer/bsc/blob/main/semester_2/python/code/code_01.py" target="_blank" rel="noopener noreferrer" style="display:inline-flex;align-items:center;gap:6px;font-size:0.85rem; text-decoration:none;color:var(--vp-c-brand);">
- <svg xmlns="http://www.w3.org/2000/svg" width="15" height="15" viewBox="0 0 24 24" fill="currentColor" style="vertical-align:middle;">
- <path d="M12 0C5.37 0 0 5.373 0 12c0 5.303 3.438 9.8 8.205 11.387.6.113.82-.258 .82-.577v-2.234c-3.338.726-4.033-1.416-4.033-1.416-.546-1.387-1.333-1.757 -1.333-1.757-1.089-.745.083-.729.083-.729 1.205.084 1.84 1.236 1.84 1.236 1.07 1.835 2.809 1.305 3.495.998.108-.776.417-1.305.76-1.605-2.665-.3 -5.466-1.332-5.466-5.93 0-1.31.465-2.38 1.235-3.22-.135-.303-.54-1.523 .105-3.176 0 0 1.005-.322 3.3 1.23.96-.267 1.98-.399 3-.405 1.02.006 2.04.138 3 .405 2.28-1.552 3.285-1.23 3.285-1.23.645 1.653.24 2.873 .12 3.176.765.84 1.23 1.91 1.23 3.22 0 4.61-2.805 5.625-5.475 5.92 .42.36.81 1.096.81 2.22v3.293c0 .319.21.694.825.576C20.565 21.795 24 17.298 24 12c0-6.627-5.373-12-12-12z"/>
- </svg>
- View on GitHub
- </a>
- <a href="https://raw.usercontent.amit.is-a.dev/semester_2/python/code/code_01.py" target="_blank" rel="noopener noreferrer" style="display:inline-flex;align-items:center;gap:6px;font-size:0.85rem; text-decoration:none;color:var(--vp-c-text-2);">
- <svg xmlns="http://www.w3.org/2000/svg" width="14" height="14" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2" stroke-linecap="round" stroke-linejoin="round" style="vertical-align:middle;">
- <path d="M21 15v4a2 2 0 0 1-2 2H5a2 2 0 0 1-2-2v-4"/>
- <polyline points="7 10 12 15 17 10"/>
- <line x1="12" y1="15" x2="12" y2="3"/>
- </svg>
- Download Raw
- </a>
-</div>
-
-::: info Printing the code
-To print this file, open it on GitHub and click **Raw** before printing, or use the **Download Raw** button above and print directly from that page.
-:::
-```python [code_01.py]
-# Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 18 Jun 2026
-# Repo: https://github.com/notamitgamer/bsc
-# License: MIT
-
-# Coming back to basics after months.
-
-n = int(input("How many numbers? "))
-even_count = 0
-odd_count = 0
-
-for i in range(n):
- num = int(input("Enter a number: "))
- if num % 2 == 0:
- even_count += 1
- else:
- odd_count += 1
-
-print("Even numbers:", even_count)
-print("Odd numbers:", odd_count)
-```
diff --git a/docs-new/semester_2/python/index.md b/docs-new/semester_2/python/index.md
@@ -6,11 +6,4 @@ Files and sub-folders in **Python**.
| # | Folder | Link |
|---|---|---|
-| 1 | Code | [Open](code/index.md) |
-
-## Files
-
-| # | File | Link |
-|---|---|---|
-| 1 | `code_01.py` | [View Code](code_01.md) |
-
+| 1 | Code | [Open](code/index.md) |+
\ No newline at end of file
diff --git a/docs-new/terms.md b/docs-new/terms.md
@@ -6,6 +6,8 @@ title: '<svg xmlns="http://www.w3.org/2000/svg" width="16" height="16" viewBox="
These Terms govern your use of this website and all associated content, including source code, documentation, and generated materials.
+***Last updated date is shown at the bottom of this page, reflecting the most recent revision.***
+
## About This Project
**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](https://github.com/notamitgamer)) as a personal academic reference for students.
@@ -36,11 +38,12 @@ No guarantee is made regarding long-term availability or maintenance.
## Academic Integrity
-This repository is intended strictly for **learning and reference**.
+This repository exists to help you **learn**, not to help you cheat. Every resource here — programs, algorithms, notes, PDFs, and more — represents real coursework from an active BSc Honors CS degree. Use it as a reference to understand how problems are approached and solved, not as a shortcut to copy from.
-- You are solely responsible for how you use this code
-- Copying code directly for academic submissions is strongly discouraged
-- Any plagiarism, cheating, or misuse is entirely your own responsibility
+- **Study, don't copy** — read the code, understand the logic, then write your own implementation from scratch
+- **Understand the why** — if you can't explain what the code does line by line, you haven't learned anything
+- **Submissions are your responsibility** — direct copy-pasting for college assignments is academic misconduct under most university policies, including WBSU
+- **You will be caught** — plagiarism detection tools are widely used; copied code is easily flagged
The author holds **no liability** for academic misconduct resulting from misuse of this content.
@@ -87,7 +90,7 @@ This website may rely on third-party platforms such as GitHub and hosting provid
## Updates to Terms
-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.
+Changes take effect upon the next deployment. The last updated date at the bottom of this page reflects the most recent revision. Returning users will be notified via the consent banner.
## Governing Law
diff --git a/docs-new/vitepress_to_github.md b/docs-new/vitepress_to_github.md
@@ -0,0 +1,115 @@
+---
+title: 'VitePress → GitHub Converter'
+description: 'Convert VitePress markdown syntax to GitHub-compatible markdown instantly.'
+---
+
+# VitePress → GitHub Converter
+
+Paste your VitePress `.md` content on the left, hit **Convert**, and copy the GitHub-ready output on the right.
+
+<script setup>
+import { ref } from 'vue'
+
+const input = ref('')
+const output = ref('')
+const copied = ref(false)
+
+function convert() {
+ let out = input.value
+
+ out = out.replace(/^---[\s\S]*?---\n?/m, '')
+
+ out = out.replace(/:::[ \t]*tip[ \t]*(.*?)\n([\s\S]*?):::/g, (_, label, body) => {
+ const lines = body.trim().split('\n').map(l => '> ' + l).join('\n')
+ return '> [!TIP]\n' + lines
+ })
+ out = out.replace(/:::[ \t]*warning[ \t]*(.*?)\n([\s\S]*?):::/g, (_, label, body) => {
+ const lines = body.trim().split('\n').map(l => '> ' + l).join('\n')
+ return '> [!WARNING]\n' + lines
+ })
+ out = out.replace(/:::[ \t]*danger[ \t]*(.*?)\n([\s\S]*?):::/g, (_, label, body) => {
+ const lines = body.trim().split('\n').map(l => '> ' + l).join('\n')
+ return '> [!CAUTION]\n' + lines
+ })
+ out = out.replace(/:::[ \t]*info[ \t]*(.*?)\n([\s\S]*?):::/g, (_, label, body) => {
+ const lines = body.trim().split('\n').map(l => '> ' + l).join('\n')
+ return '> [!NOTE]\n' + lines
+ })
+
+ out = out.replace(/\$([^$\n]+)\$/g, '`$1`')
+
+ output.value = out.trim()
+}
+
+function copyOutput() {
+ if (!output.value) return
+ navigator.clipboard.writeText(output.value).then(() => {
+ copied.value = true
+ setTimeout(() => { copied.value = false }, 1800)
+ })
+}
+
+function clear() {
+ input.value = ''
+ output.value = ''
+}
+</script>
+
+<div class="converter">
+ <div class="converter-grid">
+ <div class="converter-panel">
+ <label>VitePress markdown</label>
+ <textarea v-model="input" placeholder="Paste your VitePress .md content here..."></textarea>
+ <div class="converter-actions">
+ <button class="bsc-btn bsc-btn-primary" @click="convert">Convert</button>
+ <button class="bsc-btn" @click="clear">Clear</button>
+ </div>
+ </div>
+ <div class="converter-panel">
+ <label>GitHub markdown</label>
+ <textarea :value="output" readonly placeholder="GitHub-compatible output will appear here..."></textarea>
+ <div class="converter-actions">
+ <button class="bsc-btn" @click="copyOutput">{{ copied ? 'Copied!' : 'Copy' }}</button>
+ </div>
+ </div>
+ </div>
+</div>
+
+<style scoped>
+.converter { margin-top: 1.5rem; }
+.converter-grid {
+ display: grid;
+ grid-template-columns: 1fr 1fr;
+ gap: 16px;
+}
+.converter-panel {
+ display: flex;
+ flex-direction: column;
+ gap: 8px;
+}
+.converter-panel label {
+ font-size: 13px;
+ color: var(--vp-c-text-2);
+ font-weight: 500;
+}
+.converter-panel textarea {
+ width: 100%;
+ height: 360px;
+ font-family: var(--vp-font-family-mono);
+ font-size: 12px;
+ resize: vertical;
+ box-sizing: border-box;
+ background: var(--vp-c-bg-soft);
+ color: var(--vp-c-text-1);
+ border: 1px solid var(--vp-c-divider);
+ border-radius: 8px;
+ padding: 10px 12px;
+}
+.converter-actions {
+ display: flex;
+ gap: 8px;
+}
+@media (max-width: 600px) {
+ .converter-grid { grid-template-columns: 1fr; }
+}
+</style>+
\ No newline at end of file
diff --git a/semester_2/Algorithms/algo_01.md b/semester_2/Algorithms/algo_01.md
@@ -0,0 +1,22 @@
+# algo_01
+
+### Problem Statement
+
+> [!TIP]
+> Write an algorithm to traverse a singly linked list.
+
+## Algorithm
+```
+procedure traverce(head)
+begin
+ if(head = NULL)
+ write("List is empty");
+ else
+ ptr <- head;
+ while(ptr != NULL)
+ write(info(ptr));
+ ptr <- next(ptr);
+ end while
+ end if
+end procedure
+```+
\ No newline at end of file
