commit 43b5428920b166884fa613cacfc0118af2a9e9c4
parent 4a4a3aa52a0b158264af1ef7cabdb81e233ba46f
Author: Amit Dutta <amitdutta4255@gmail.com>
Date: Wed, 19 Nov 2025 18:02:22 +0530
new -19112025 _tuition-c/APC-S-011, 012
Diffstat:
3 files changed, 169 insertions(+), 1 deletion(-)
diff --git a/docs/index.html b/docs/index.html
@@ -4775,7 +4775,7 @@ int main()
<div class="flex items-center">
<svg class="w-6 h-6 text-blue-500 mr-4 flex-shrink-0" fill="none" stroke="currentColor" viewBox="0 0 24 24" xmlns="http://www.w3.org/2000/svg"><path stroke-linecap="round" stroke-linejoin="round" stroke-width="2" d="M3 7v10a2 2 0 002 2h14a2 2 0 002-2V9a2 2 0 00-2-2h-6l-2-2H5a2 2 0 00-2 2z"></path></svg>
<span class="font-medium text-gray-800">tuition-c</span>
- <span class="ml-2 text-sm text-gray-500">(106 files)</span>
+ <span class="ml-2 text-sm text-gray-500">(108 files)</span>
</div>
<div class="flex items-center space-x-4">
<a href="https://github.com/notamitgamer/bsc/tree/main/tuition-c" target="_blank" class="p-1 rounded-full text-gray-500 hover:bg-gray-200 hover:text-gray-800 transition-colors" onclick="event.stopPropagation()" title="View folder on GitHub">
@@ -6582,6 +6582,104 @@ int main()
<li>
<div class="flex items-center p-3 pl-8 hover:bg-gray-50 transition-colors duration-200">
<svg class="w-6 h-6 text-green-500 mr-4 flex-shrink-0" fill="none" stroke="currentColor" viewBox="0 0 24 24" xmlns="http://www.w3.org/2000/svg"><path stroke-linecap="round" stroke-linejoin="round" stroke-width="2" d="M7 21h10a2 2 0 002-2V9.414a1 1 0 00-.293-.707l-5.414-5.414A1 1 0 0012.586 3H7a2 2 0 00-2 2v14a2 2 0 002 2z"></path></svg>
+ <span class="text-gray-700">APC-S-011.c</span>
+ <div class="ml-auto flex items-center space-x-4">
+ <a href="https://github.com/notamitgamer/bsc/blob/main/tuition-c/APC-S-011.c" target="_blank" class="p-1 rounded-full text-gray-500 hover:bg-gray-200 hover:text-gray-800 transition-colors" title="View file on GitHub">
+ <svg class="w-6 h-6" fill="currentColor" viewBox="0 0 24 24" aria-hidden="true"><path fill-rule="evenodd" d="M12 2C6.477 2 2 6.477 2 12c0 4.418 2.865 8.168 6.839 9.492.5.092.682-.217.682-.482 0-.237-.009-.868-.014-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-1.988 1.031-2.688-.103-.253-.446-1.272.098-2.65 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.379.203 2.398.1 2.651.64.7 1.03 1.595 1.03 2.688 0 3.848-2.338 4.695-4.566 4.942.359.308.678.92.678 1.855 0 1.338-.012 2.419-.012 2.747 0 .268.18.58.688.482A10.001 10.001 0 0022 12c0-5.523-4.477-10-10-10z" clip-rule="evenodd"></path></svg>
+ </a>
+ <button onclick="showCode('code-tuition-c-APC-S-011_c', 'APC-S-011.c')" class="text-green-600 font-semibold text-sm hover:underline">View Code</button>
+ </div>
+ </div>
+ <div id="code-tuition-c-APC-S-011_c" class="hidden" data-github-url="https://github.com/notamitgamer/bsc/blob/main/tuition-c/APC-S-011.c">
+ <pre><code class="language-c">/* Linear search */
+/* Author: Amit Dutta, Date: 19-11-2025 */
+
+#include <stdio.h>
+
+int main()
+{
+ int elementCount, i, keyElement;
+
+ printf("Enter the number of element you want to add: ");
+ scanf("%d", &elementCount);
+
+ int elements[elementCount];
+
+ for (i = 0; i < elementCount; i++)
+ {
+ printf("Enter Element %d: ", i + 1);
+ scanf("%d", &elements[i]);
+ }
+
+ printf("\nEnter the Key Element you want to search: ");
+ scanf("%d", &keyElement);
+ for (i = 0; i < elementCount; i++)
+ if (elements[i] == keyElement)
+ {
+ printf("\nKey Element %d is found in %d position.", keyElement, i);
+ return 0;
+ }
+ printf("\nKey Element %d is not found.", keyElement);
+ return 0;
+}</code></pre>
+ </div>
+ </li>
+
+ <li>
+ <div class="flex items-center p-3 pl-8 hover:bg-gray-50 transition-colors duration-200">
+ <svg class="w-6 h-6 text-green-500 mr-4 flex-shrink-0" fill="none" stroke="currentColor" viewBox="0 0 24 24" xmlns="http://www.w3.org/2000/svg"><path stroke-linecap="round" stroke-linejoin="round" stroke-width="2" d="M7 21h10a2 2 0 002-2V9.414a1 1 0 00-.293-.707l-5.414-5.414A1 1 0 0012.586 3H7a2 2 0 00-2 2v14a2 2 0 002 2z"></path></svg>
+ <span class="text-gray-700">APC-S-012.c</span>
+ <div class="ml-auto flex items-center space-x-4">
+ <a href="https://github.com/notamitgamer/bsc/blob/main/tuition-c/APC-S-012.c" target="_blank" class="p-1 rounded-full text-gray-500 hover:bg-gray-200 hover:text-gray-800 transition-colors" title="View file on GitHub">
+ <svg class="w-6 h-6" fill="currentColor" viewBox="0 0 24 24" aria-hidden="true"><path fill-rule="evenodd" d="M12 2C6.477 2 2 6.477 2 12c0 4.418 2.865 8.168 6.839 9.492.5.092.682-.217.682-.482 0-.237-.009-.868-.014-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-1.988 1.031-2.688-.103-.253-.446-1.272.098-2.65 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.379.203 2.398.1 2.651.64.7 1.03 1.595 1.03 2.688 0 3.848-2.338 4.695-4.566 4.942.359.308.678.92.678 1.855 0 1.338-.012 2.419-.012 2.747 0 .268.18.58.688.482A10.001 10.001 0 0022 12c0-5.523-4.477-10-10-10z" clip-rule="evenodd"></path></svg>
+ </a>
+ <button onclick="showCode('code-tuition-c-APC-S-012_c', 'APC-S-012.c')" class="text-green-600 font-semibold text-sm hover:underline">View Code</button>
+ </div>
+ </div>
+ <div id="code-tuition-c-APC-S-012_c" class="hidden" data-github-url="https://github.com/notamitgamer/bsc/blob/main/tuition-c/APC-S-012.c">
+ <pre><code class="language-c">/* Write a program to check if a matrix is a sparx matrix. */
+/* Author: Amit Dutta, Date: 19-11-2025 */
+
+#include <stdio.h>
+
+int main()
+{
+ int i, j, row, col, count = 0;
+
+ printf("Enter the number of rows and columns in the matrix: ");
+ scanf("%d %d", &row, &col);
+
+ int matrix[row][col];
+
+ for (i = 0; i < row; i++)
+ for (j = 0; j < col; j++)
+ {
+ printf("Postion %d%d: ", i, j);
+ scanf("%d", &matrix[i][j]);
+ if (matrix[i][j] == 0)
+ count++;
+ }
+
+ printf("\nEntered Matrix: \n");
+ for (i = 0; i < row; i++)
+ {
+ for (j = 0; j < col; j++)
+ printf("%d ", matrix[i][j]);
+ printf("\n");
+ }
+
+ if (count > (row * col) / 2)
+ printf("\nEntered matrix is a Sparx Matrix.");
+ else
+ printf("\nEntered matrix is not a Sparx Matrix");
+ return 0;
+}</code></pre>
+ </div>
+ </li>
+
+ <li>
+ <div class="flex items-center p-3 pl-8 hover:bg-gray-50 transition-colors duration-200">
+ <svg class="w-6 h-6 text-green-500 mr-4 flex-shrink-0" fill="none" stroke="currentColor" viewBox="0 0 24 24" xmlns="http://www.w3.org/2000/svg"><path stroke-linecap="round" stroke-linejoin="round" stroke-width="2" d="M7 21h10a2 2 0 002-2V9.414a1 1 0 00-.293-.707l-5.414-5.414A1 1 0 0012.586 3H7a2 2 0 00-2 2v14a2 2 0 002 2z"></path></svg>
<span class="text-gray-700">APC-SPS-001.c</span>
<div class="ml-auto flex items-center space-x-4">
<a href="https://github.com/notamitgamer/bsc/blob/main/tuition-c/APC-SPS-001.c" target="_blank" class="p-1 rounded-full text-gray-500 hover:bg-gray-200 hover:text-gray-800 transition-colors" title="View file on GitHub">
diff --git a/tuition-c/APC-S-011.c b/tuition-c/APC-S-011.c
@@ -0,0 +1,31 @@
+/* Linear search */
+/* Author: Amit Dutta, Date: 19-11-2025 */
+
+#include <stdio.h>
+
+int main()
+{
+ int elementCount, i, keyElement;
+
+ printf("Enter the number of element you want to add: ");
+ scanf("%d", &elementCount);
+
+ int elements[elementCount];
+
+ for (i = 0; i < elementCount; i++)
+ {
+ printf("Enter Element %d: ", i + 1);
+ scanf("%d", &elements[i]);
+ }
+
+ printf("\nEnter the Key Element you want to search: ");
+ scanf("%d", &keyElement);
+ for (i = 0; i < elementCount; i++)
+ if (elements[i] == keyElement)
+ {
+ printf("\nKey Element %d is found in %d position.", keyElement, i);
+ return 0;
+ }
+ printf("\nKey Element %d is not found.", keyElement);
+ return 0;
+}+
\ No newline at end of file
diff --git a/tuition-c/APC-S-012.c b/tuition-c/APC-S-012.c
@@ -0,0 +1,37 @@
+/* Write a program to check if a matrix is a sparx matrix. */
+/* Author: Amit Dutta, Date: 19-11-2025 */
+
+#include <stdio.h>
+
+int main()
+{
+ int i, j, row, col, count = 0;
+
+ printf("Enter the number of rows and columns in the matrix: ");
+ scanf("%d %d", &row, &col);
+
+ int matrix[row][col];
+
+ for (i = 0; i < row; i++)
+ for (j = 0; j < col; j++)
+ {
+ printf("Postion %d%d: ", i, j);
+ scanf("%d", &matrix[i][j]);
+ if (matrix[i][j] == 0)
+ count++;
+ }
+
+ printf("\nEntered Matrix: \n");
+ for (i = 0; i < row; i++)
+ {
+ for (j = 0; j < col; j++)
+ printf("%d ", matrix[i][j]);
+ printf("\n");
+ }
+
+ if (count > (row * col) / 2)
+ printf("\nEntered matrix is a Sparx Matrix.");
+ else
+ printf("\nEntered matrix is not a Sparx Matrix");
+ return 0;
+}+
\ No newline at end of file
