added

Author: tvilight4

a.out

@@ -0,0 +1,39 @@
+#include <stdio.h>
+#include <ctype.h>
+void countAlphabetsAndWords(char str[], int*alphabetCount, int *wordCount) {
+    int inWord = 0;
+    *alphabetCount = 0;
+    *wordCount = 0;
+    for (int i = 0; str[i] != '\0'; i++) {
+        if (isalpha(str[i])) {
+            (*alphabetCount)++;
+        }
+        if (isspace(str[i])) {
+            if (inWord) {
+                inWord = 0;
+                (*wordCount)++;
+            }
+        } else {
+            inWord = 1;
+        }
+    }
+
+    if (inWord) {
+        (*wordCount)++;
+    }
+}
+int main() {
+char str[1000];
+int alphabetCount, wordCount;
+
+printf("Enter a string: ");
+fgets(str, sizeof(str), stdin);
+
+countAlphabetsAndWords(str, &alphabetCount, &wordCount);
+
+printf("Number of alphabets: %d\n", alphabetCount);
+printf("Number of words: %d\n", wordCount);
+
+return 0;
+
+}

cntwords.c

@@ -0,0 +1,17 @@
+#include <stdio.h>
+#include <string.h>
+void concatenateStrings(char str1[], char str2[], char result[]) {
+    strcpy(result, str1);
+    strcat(result, str2);
+}
+int main() {
+    char str1[100], str2[100], result[200];
+    printf("Enter the first string: ");
+    fgets(str1, sizeof(str1), stdin);
+    printf("Enter the second string: ");
+    fgets(str2, sizeof(str2), stdin);
+
+    concatenateStrings(str1, str2, result);
+    printf("Concatenated string: %s", result);
+    return 0;
+}

concat.c

@@ -0,0 +1,51 @@
+#include <stdio.h>
+#define MAX_SIZE 10 // max size for matrix dimensions
+void inputMatrix(int (*matrix)[MAX_SIZE], int rows, int
+cols) {
+printf("enter elements for the %d by %d matrix: \n",
+rows, cols);
+for (int i = 0; i < rows; i++) {
+for (int j = 0; j < cols; j++) {
+printf("Element [%d][%d]: ", i, j);
+scanf("%d", *(matrix + i) + j);
+}
+}
+}
+void multiplyMatrices(int (*mat1)[MAX_SIZE], int
+(*mat2)[MAX_SIZE], int(*result)[MAX_SIZE], int rows1, int
+cols1, int cols2) {
+//initialize the matrix to 0 using pointer arithmetic
+for (int i = 0; i < rows1; i++) {
+for (int j = 0; j < cols2; j++) {
+*(result[i] + j) = 0; //Correct pointer access initialize to 0
+for (int k = 0; k < cols2; k++) {
+*(result[i] + j) += *(mat1[i] +k)*
+*(mat2[k] + j); //matrix multiplication
+}
+}
+}
+}
+void printMatrix(int (*matrix)[MAX_SIZE], int rows, int
+cols) {
+for (int i = 0; i < rows; i++) {
+for (int j = 0; j < cols; j++) {
+printf("%d ", *(*(matrix + i) + j));
+}
+printf("\n");
+}
+}
+int main() {int rows1, cols1, rows2, cols2;
+printf("Enter rows and columns for the first matrix:");
+scanf("%d%d", &rows1, &cols1);
+printf("Enter rows and columns for the second matrix:");
+scanf("%d%d", &rows2, &cols2);
+int mat1[rows1][MAX_SIZE], mat2[rows2][MAX_SIZE],
+result[rows1][cols2];
+inputMatrix(mat1, rows1, cols1);
+inputMatrix(mat2, rows2, cols2);
+multiplyMatrices(mat1, mat2, result, rows1, cols1,
+cols2);
+printf("Result Matrix: \n");
+printMatrix(result, rows1, cols2);
+return 0;
+}

ptr/matrmult.c

@@ -0,0 +1,37 @@
+#include <stdio.h>
+void swap(int* a, int* b)
+{
+int temp = *a;
+*a = *b;
+*b = temp;
+}
+void reverse(int array[], int array_size)
+{
+int *pointer1 = array,
+*pointer2 = array + array_size - 1;
+while (pointer1 < pointer2) {
+swap(pointer1, pointer2);
+pointer1++;
+pointer2--;}
+}
+void print(int* array, int array_size)
+{
+// Length pointing at end of the array
+int *length = array + array_size,
+*position = array;
+printf("Array = ");
+for (position = array; position < length;
+position++)
+printf("%d ", *position);
+}
+int main()
+{
+// Array to hold the values
+int array[] = { 2, 4, -6, 5, 8, -1 };
+printf("Original ");
+print(array, 6);
+printf("Reverse ");
+reverse(array, 6);
+print(array, 6);
+return 0;
+}

ptr/revarr.c

@@ -0,0 +1,35 @@
+#include <stdio.h>
+#include <string.h>
+#include <stdbool.h>
+
+void print(int *p, int n) {
+for (int i=0; i<n; i++) {
+printf("%d\t", *(p+i));
+}
+printf("\n");
+}
+
+void swap(int *a, int *b) {
+int temp;
+temp = *a; // temp holds deferenced value
+*a = *b;
+*b = temp;
+}
+int main() {
+int arr[] = {3, 4, 7, 11};
+int n = sizeof(arr)/sizeof(arr[0]);
+int *ptr = arr;
+print(arr, n);
+int smallest = 0;
+int largest = 0;
+for (int i=0; i<n; i++) {
+if (*(ptr + i) < ptr[smallest]) {
+smallest = i;
+}if (*(ptr + i) > ptr[largest]) {
+largest = i;
+}
+}
+swap(ptr+smallest, ptr+largest);
+print(arr, n);
+return 0;
+}

ptr/swaparr.c

@@ -0,0 +1,42 @@
+#include <stdio.h>
+#include <string.h>
+#include <stdbool.h>
+int main() {
+    char str[50];
+    scanf("%[^\n]s", str);
+    int len = strlen(str);
+    char str2[len];
+    for (int i=0; i<len; i++) {
+        str2[i] = str[len-i-1];
+    }
+    str2[len] = '\0';
+    printf("%s", str2);
+    return 0;
+}
+
+//palindrome checker
+
+#include <stdio.h>
+#include <string.h>
+#include <stdbool.h>
+int main() {
+    char str[50];
+    scanf("%[^\n]s", str);
+    int len = strlen(str);
+    char str2[len];
+    for (int i=0; i<len; i++) {
+        str2[i] = str[len-i-1];
+    }
+
+    int cnt = 1;
+    
+    for (int i=0; i<len; i++) {
+        if (str2[i] != str[i]) {
+            cnt = 0;
+        }
+    }
+    if (cnt == 0) {
+    printf("not a palindrome");
+    } else printf("is a palindrome");
+    return 0;
+}

revstr.c

@@ -0,0 +1,31 @@
+#include <stdio.h>
+#include <string.h>
+void findLength(char str[]) {
+    int length = 0;
+    while (str[length] != '\0') {
+        length++;
+    }
+    if (str[length - 1] == '\n') {
+        length--;
+    }
+    printf("Length of the string '%s' is: %d\n", str, length);
+}
+void compareStrings(char str1[], char str2[]) {
+    int result = strcmp(str1, str2);
+    if (result == 0) {
+        printf("The strings '%s' and '%s' are equal.\n", str1, str2);
+    } else {
+        printf("The strings '%s' and '%s' are not equal.\n", str1, str2);
+    }
+}
+int main() {
+    char str1[100], str2[100];
+    printf("Enter the first string: ");
+    fgets(str1, sizeof(str1), stdin);
+    printf("Enter the second string: ");
+    fgets(str2, sizeof(str2), stdin);
+    findLength(str1);
+    findLength(str2);
+    compareStrings(str1, str2);
+    return 0;
+}

strcmp.c

@@ -0,0 +1,60 @@
+#include <stdio.h>
+#include <string.h>
+#define MAX_FLIGHTS 20
+#define MAX_CODE_LENGTH 4
+struct Flight {
+char startingPoint[MAX_CODE_LENGTH];
+char destination[MAX_CODE_LENGTH];
+int startingTime;
+int arrivalTime;
+int seats;
+};
+void processQuery(struct Flight flights[], int numFlights,
+char queryStart[], char queryDest[]) {
+for (int i = 0; i < numFlights; i++) {
+if (strcmp(flights[i].startingPoint, queryStart)
+== 0 &&
+strcmp(flights[i].destination, queryDest) ==
+0) {
+if (flights[i].seats > 0) {
+flights[i].seats--;
+printf("Flight found: %s -> %s, Starting: %d, Arrival: %d, Seats left: %d\n",
+flights[i].startingPoint,
+flights[i].destination,
+flights[i].startingTime,
+flights[i].arrivalTime, flights[i].seats);
+return;
+}
+}
+}
+printf("Sorry, no available flight found from %s to %s\n", queryStart, queryDest);
+}
+int main() {
+struct Flight flights[MAX_FLIGHTS];
+int numFlights = 20;
+for (int i = 0; i < numFlights; i++) {
+printf("Enter details for flight %d:\n", i + 1);
+printf("Starting point: ");
+scanf("%s", flights[i].startingPoint);
+printf("Destination: ");
+scanf("%s", flights[i].destination);
+printf("Starting time: ");
+scanf("%d", &flights[i].startingTime);
+printf("Arrival time: ");
+scanf("%d", &flights[i].arrivalTime);
+printf("Seats: ");
+scanf("%d", &flights[i].seats);
+}
+char queryStart[MAX_CODE_LENGTH];
+char queryDest[MAX_CODE_LENGTH];
+printf("Enter query in the form 'STARTING POINT-DESTINATION' (or 'exit' to stop):\n");
+while (1) {
+printf("Query: ");
+scanf("%s", queryStart);
+if (strcmp(queryStart, "exit") == 0) break;
+scanf("%s", queryDest);
+processQuery(flights, numFlights, queryStart,
+queryDest);
+}
+return 0;
+}