commit 4833d9bec2347ad2ca58a0e8b689eda4de5c52e7
parent 26f3660742cd1ffbd6357a21c3f1f0dbc1ee8ff9
Author: Amit Dutta <amitdutta4255@gmail.com>
Date: Sat, 13 Dec 2025 20:17:07 +0530
[2025-12-13] .
Diffstat:
| M | docs/index.html | | | 102 | +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ |
| A | tuition-c/P060.c | | | 88 | +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ |
2 files changed, 190 insertions(+), 0 deletions(-)
diff --git a/docs/index.html b/docs/index.html
@@ -20052,6 +20052,108 @@ int array_sum(int a[], int n)
}</div>
</div>
+ <div class="file-item flex items-center justify-between px-3 py-2 hover:bg-white hover:shadow-sm rounded-lg transition-all group border border-transparent hover:border-slate-100 mb-1">
+ <div class="flex items-center gap-2.5 min-w-0 cursor-pointer flex-1" onclick="showCode('code-tuition-c-P060-c', 'P060.c', 'https://github.com/notamitgamer/bsc/blob/main/tuition-c/P060.c')">
+ <svg class="w-4 h-4 text-slate-400" fill="none" viewBox="0 0 24 24" stroke="currentColor">
+ <path stroke-linecap="round" stroke-linejoin="round" stroke-width="2" d="M9 12h6m-6 4h6m2 5H7a2 2 0 01-2-2V5a2 2 0 012-2h5.586a1 1 0 01.707.293l5.414 5.414a1 1 0 01.293.707V19a2 2 0 01-2 2z" />
+ </svg>
+ <span class="text-sm text-slate-600 font-medium group-hover:text-blue-600 truncate">P060.c</span>
+ </div>
+ <div class="flex items-center gap-2 opacity-0 group-hover:opacity-100 transition-opacity">
+ <a href="https://github.com/notamitgamer/bsc/blob/main/tuition-c/P060.c" target="_blank" class="p-1.5 text-slate-400 hover:text-slate-700 hover:bg-slate-100 rounded-md" title="View on GitHub">
+ <svg class="w-4 h-4" fill="currentColor" viewBox="0 0 24 24"><path fill-rule="evenodd" d="M12 2C6.477 2 2 6.484 2 12.017c0 4.425 2.865 8.18 6.839 9.504.5.092.682-.217.682-.483 0-.237-.008-.868-.013-1.703-2.782.605-3.369-1.343-3.369-1.343-.454-1.158-1.11-1.466-1.11-1.466-.908-.62.069-.608.069-.608 1.003.07 1.531 1.032 1.531 1.032.892 1.53 2.341 1.088 2.91.832.092-.647.35-1.088.636-1.338-2.22-.253-4.555-1.113-4.555-4.951 0-1.093.39-2.126 1.029-2.935-.103-.253-.446-1.372.097-2.897 0 0 .84-.27 2.75 1.026A9.564 9.564 0 0112 6.844c.85.004 1.705.115 2.504.337 1.909-1.296 2.747-1.027 2.747-1.027.546 1.525.202 2.644.1 2.897.64.809 1.026 1.841 1.026 2.935 0 3.847-2.337 4.687-4.565 4.935.359.309.678.92.678 1.855 0 1.338-.012 2.419-.012 2.747 0 .268.18.58.688.482A10.019 10.019 0 0022 12.017C22 6.484 17.522 2 12 2z" clip-rule="evenodd"></path></svg>
+ </a>
+ </div>
+ <!-- Embedded Code Storage -->
+ <div id="code-tuition-c-P060-c" style="display:none;">/*
+ * ======================================================================================
+ * COPYRIGHT (C) 2025 AMIT DUTTA. ALL RIGHTS RESERVED.
+ * ======================================================================================
+ * Repository: https://github.com/notamitgamer
+ * Author : Amit Dutta
+ * License : EDUCATIONAL SOURCE-AVAILABLE LICENSE (ESAL-1.0)
+ * ======================================================================================
+ *
+ * [ IMPORTANT LEGAL NOTICE ]
+ *
+ * 1. PROPRIETARY STATUS:
+ * This software ("The Software") is the intellectual property of Amit Dutta.
+ * It is NOT "Open Source" in the traditional sense. It is "Source-Available"
+ * for educational observation only.
+ *
+ * 2. ACADEMIC INTEGRITY & RESTRICTION:
+ * The use of this code, in whole or in part, for the purpose of submitting
+ * academic assignments, projects, lab reports, or examinations at
+ * WEST BENGAL STATE UNIVERSITY (WBSU) or any other educational institution
+ * is STRICTLY PROHIBITED.
+ *
+ * >>> VIOLATION OF THIS CLAUSE WILL BE REPORTED AS ACADEMIC MISCONDUCT. <<<
+ *
+ * 3. PERMISSIONS:
+ * You are granted a revocable license to:
+ * - Read and study the code to understand algorithms.
+ * - Compile and run the code locally for personal testing.
+ *
+ * 4. NO WARRANTY:
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND.
+ *
+ * ======================================================================================
+ */
+
+/* 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. */
+
+#include <stdio.h>
+
+int count_occurrences(int[], int, int);
+void inputarr(int[], int);
+
+int main()
+{
+ int n, arr[20], target, found;
+ printf("Enter the n (Max: 20): ");
+ scanf("%d", &n);
+ inputarr(arr, n);
+ printf("Enter the target: ");
+ scanf("%d", &target);
+ found = count_occurrences(arr, n, target);
+ if (found)
+ {
+ printf("\n%d found %d times.", target, found);
+ }
+ else
+ {
+ printf("\n%d is not found.", target);
+ }
+ return 0;
+}
+
+void inputarr(int arr[], int n)
+{
+ int i;
+ for (i = 0; i < n; i++)
+ {
+ printf("Enter element %d: ", i + 1);
+ scanf("%d", &arr[i]);
+ }
+}
+
+int count_occurrences(int arr[], int n, int target)
+{
+ int count = 0;
+ int i;
+ for (i = 0; i < n; i++)
+ {
+ if (arr[i] == target)
+ {
+ count++;
+ }
+ }
+ return count;
+}</div>
+ </div>
+
</div>
</div>
diff --git a/tuition-c/P060.c b/tuition-c/P060.c
@@ -0,0 +1,87 @@
+/*
+ * ======================================================================================
+ * COPYRIGHT (C) 2025 AMIT DUTTA. ALL RIGHTS RESERVED.
+ * ======================================================================================
+ * Repository: https://github.com/notamitgamer
+ * Author : Amit Dutta
+ * License : EDUCATIONAL SOURCE-AVAILABLE LICENSE (ESAL-1.0)
+ * ======================================================================================
+ *
+ * [ IMPORTANT LEGAL NOTICE ]
+ *
+ * 1. PROPRIETARY STATUS:
+ * This software ("The Software") is the intellectual property of Amit Dutta.
+ * It is NOT "Open Source" in the traditional sense. It is "Source-Available"
+ * for educational observation only.
+ *
+ * 2. ACADEMIC INTEGRITY & RESTRICTION:
+ * The use of this code, in whole or in part, for the purpose of submitting
+ * academic assignments, projects, lab reports, or examinations at
+ * WEST BENGAL STATE UNIVERSITY (WBSU) or any other educational institution
+ * is STRICTLY PROHIBITED.
+ *
+ * >>> VIOLATION OF THIS CLAUSE WILL BE REPORTED AS ACADEMIC MISCONDUCT. <<<
+ *
+ * 3. PERMISSIONS:
+ * You are granted a revocable license to:
+ * - Read and study the code to understand algorithms.
+ * - Compile and run the code locally for personal testing.
+ *
+ * 4. NO WARRANTY:
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND.
+ *
+ * ======================================================================================
+ */
+
+/* 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. */
+
+#include <stdio.h>
+
+int count_occurrences(int[], int, int);
+void inputarr(int[], int);
+
+int main()
+{
+ int n, arr[20], target, found;
+ printf("Enter the n (Max: 20): ");
+ scanf("%d", &n);
+ inputarr(arr, n);
+ printf("Enter the target: ");
+ scanf("%d", &target);
+ found = count_occurrences(arr, n, target);
+ if (found)
+ {
+ printf("\n%d found %d times.", target, found);
+ }
+ else
+ {
+ printf("\n%d is not found.", target);
+ }
+ return 0;
+}
+
+void inputarr(int arr[], int n)
+{
+ int i;
+ for (i = 0; i < n; i++)
+ {
+ printf("Enter element %d: ", i + 1);
+ scanf("%d", &arr[i]);
+ }
+}
+
+int count_occurrences(int arr[], int n, int target)
+{
+ int count = 0;
+ int i;
+ for (i = 0; i < n; i++)
+ {
+ if (arr[i] == target)
+ {
+ count++;
+ }
+ }
+ return count;
+}+
\ No newline at end of file
