commit 2a083009703b6cfa42bee6719787f814b3d73b23 parent 7c8b005ba60cd910a718d205c1a112bacd2ccdd7 Author: Amit Dutta <mail@amit.is-a.dev> Date: Wed, 26 Aug 2026 19:53:25 +0530 Merge pull request #90 from notamitgamer/remove-author-headers Remove author/date/repo/license headers from source files Diffstat:
446 files changed, 440 insertions(+), 3665 deletions(-)
diff --git a/semester_1/R/Code/R_Code-1.r b/semester_1/R/Code/R_Code-1.r @@ -1,7 +1,3 @@ -# Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 19 Mar 2026 -# Repo: https://github.com/notamitgamer/bsc -# License: MIT - # R allows you to assign values to variables in three different ways. # Write three lines of code assigning the string "R is fun" to a variable @@ -9,4 +5,4 @@ simple = "R is fun" left <- "R is fun" -"R is fun" -> right- \ No newline at end of file +"R is fun" -> right diff --git a/semester_1/R/Code/R_Code-10.r b/semester_1/R/Code/R_Code-10.r @@ -1,11 +1,7 @@ -# Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 20 Mar 2026 -# Repo: https://github.com/notamitgamer/bsc -# License: MIT - # 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. score <- c(45, 26, 89, 21, 75, 99, 13, 68, 85) -ifelse(score < 50, "Fail", "Pass")- \ No newline at end of file +ifelse(score < 50, "Fail", "Pass") diff --git a/semester_1/R/Code/R_Code-11.r b/semester_1/R/Code/R_Code-11.r @@ -1,7 +1,3 @@ -# Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 20 Mar 2026 -# Repo: https://github.com/notamitgamer/bsc -# License: MIT - # 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. diff --git a/semester_1/R/Code/R_Code-12.r b/semester_1/R/Code/R_Code-12.r @@ -1,7 +1,3 @@ -# Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 20 Mar 2026 -# Repo: https://github.com/notamitgamer/bsc -# License: MIT - # 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 @@ -11,4 +7,4 @@ calculate_area <- function(length, width = 5) { print(length * width) } -calculate_area(12)- \ No newline at end of file +calculate_area(12) diff --git a/semester_1/R/Code/R_Code-13.r b/semester_1/R/Code/R_Code-13.r @@ -1,7 +1,3 @@ -# Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 20 Mar 2026 -# Repo: https://github.com/notamitgamer/bsc -# License: MIT - # 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 @@ -10,4 +6,4 @@ student_record <- list("Amit Dutta", 95, c(95, 96)) print(student_record) student_record <- append(student_record, TRUE) -print(student_record)- \ No newline at end of file +print(student_record) diff --git a/semester_1/R/Code/R_Code-14.r b/semester_1/R/Code/R_Code-14.r @@ -1,7 +1,3 @@ -# Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 20 Mar 2026 -# Repo: https://github.com/notamitgamer/bsc -# License: MIT - # 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." @@ -14,4 +10,4 @@ if(temperature > 30) { print("Perfect weather") } else { print("It is quite cold.") -}- \ No newline at end of file +} diff --git a/semester_1/R/Code/R_Code-2.r b/semester_1/R/Code/R_Code-2.r @@ -1,9 +1,5 @@ -# Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 19 Mar 2026 -# Repo: https://github.com/notamitgamer/bsc -# License: MIT - # 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"? num <- 12L -print(class(num))- \ No newline at end of file +print(class(num)) diff --git a/semester_1/R/Code/R_Code-4.r b/semester_1/R/Code/R_Code-4.r @@ -1,7 +1,3 @@ -# Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 19 Mar 2026 -# Repo: https://github.com/notamitgamer/bsc -# License: MIT - # 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.". @@ -13,4 +9,4 @@ if (age < 0) { print("Not eligible to vote.") } else { print("Eligible to vote.") -}- \ No newline at end of file +} diff --git a/semester_1/R/Code/R_Code-5.r b/semester_1/R/Code/R_Code-5.r @@ -1,10 +1,6 @@ -# Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 19 Mar 2026 -# Repo: https://github.com/notamitgamer/bsc -# License: MIT - # 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. x <- c(12, 9, 23, 14) -ifelse(x %% 2 == 0, "EVEN", "ODD")- \ No newline at end of file +ifelse(x %% 2 == 0, "EVEN", "ODD") diff --git a/semester_1/R/Code/R_Code-6.r b/semester_1/R/Code/R_Code-6.r @@ -1,7 +1,3 @@ -# Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 19 Mar 2026 -# Repo: https://github.com/notamitgamer/bsc -# License: MIT - # 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 @@ -14,4 +10,4 @@ while (TRUE) { } print(number) number = number + 1 -}- \ No newline at end of file +} diff --git a/semester_1/R/Code/R_Code-7.r b/semester_1/R/Code/R_Code-7.r @@ -1,10 +1,6 @@ -# Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 19 Mar 2026 -# Repo: https://github.com/notamitgamer/bsc -# License: MIT - # 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. s <- rep(c(1:5), times= 2) -print(s)- \ No newline at end of file +print(s) diff --git a/semester_1/R/Code/R_Code-8.r b/semester_1/R/Code/R_Code-8.r @@ -1,7 +1,3 @@ -# Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 19 Mar 2026 -# Repo: https://github.com/notamitgamer/bsc -# License: MIT - # 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. diff --git a/semester_1/R/Code/R_Code-9.r b/semester_1/R/Code/R_Code-9.r @@ -1,7 +1,3 @@ -# Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 19 Mar 2026 -# Repo: https://github.com/notamitgamer/bsc -# License: MIT - # 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). @@ -12,4 +8,4 @@ power <- function (a = 2, b) { a <- 2 b <- 3 print(power(a, b)) -print(power("b" = b))- \ No newline at end of file +print(power("b" = b)) diff --git a/semester_1/R/Code/R_Prac-1.r b/semester_1/R/Code/R_Prac-1.r @@ -1,7 +1,3 @@ -# Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 25 Mar 2026 -# Repo: https://github.com/notamitgamer/bsc -# License: MIT - # Write a R program to print numbers from 1 to 5. i = 1 @@ -10,4 +6,4 @@ while(i <= 5) { i = i + 1 } # or we can use -print(1:5)- \ No newline at end of file +print(1:5) diff --git a/semester_1/R/Code/R_Prac-2.r b/semester_1/R/Code/R_Prac-2.r @@ -1,9 +1,5 @@ -# Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 25 Mar 2026 -# Repo: https://github.com/notamitgamer/bsc -# License: MIT - # Check whether a number is even or odd. num <- readline(prompt="Enter the number: ") num <- as.integer(num) -print(paste(num, "is", ifelse(num %% 2 == 0, "EVEN", "ODD"), "number."))- \ No newline at end of file +print(paste(num, "is", ifelse(num %% 2 == 0, "EVEN", "ODD"), "number.")) diff --git a/semester_1/R/Code/R_Prac-3.r b/semester_1/R/Code/R_Prac-3.r @@ -1,10 +1,6 @@ -# Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 25 Mar 2026 -# Repo: https://github.com/notamitgamer/bsc -# License: MIT - # Print elements of vector using for loop. sample <- c(1:6) for(elem in sample) { print(elem) -}- \ No newline at end of file +} diff --git a/semester_1/R/Code/R_Prac-4.r b/semester_1/R/Code/R_Prac-4.r @@ -1,7 +1,3 @@ -# Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 25 Mar 2026 -# Repo: https://github.com/notamitgamer/bsc -# License: MIT - # Program to add two numbers in R program. num1 <- as.double(readline(prompt="Enter 1st number: ")) @@ -9,4 +5,4 @@ num2 <- as.double(readline(prompt="Enter 2nd number: ")) if(is.na(num1) || is.na(num2)) { stop("You did not enter a valid number.") } -print(paste("Result", num1 + num2))- \ No newline at end of file +print(paste("Result", num1 + num2)) diff --git a/semester_1/R/Code/R_Prac-5.r b/semester_1/R/Code/R_Prac-5.r @@ -1,7 +1,3 @@ -# Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 25 Mar 2026 -# Repo: https://github.com/notamitgamer/bsc -# License: MIT - # Program to count the number of even numbers stored inside a vector of numbers. print("Enter your numbers: ") @@ -12,4 +8,4 @@ for(i in nums) { count = count + 1 } } -print(paste("Even Count=", count))- \ No newline at end of file +print(paste("Even Count=", count)) diff --git a/semester_1/R/Code/R_Prac-6.r b/semester_1/R/Code/R_Prac-6.r @@ -1,7 +1,3 @@ -# Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 25 Mar 2026 -# Repo: https://github.com/notamitgamer/bsc -# License: MIT - # Program to access List elements, modify a List Element, add items to List, # Remove items from a List, length of List. @@ -21,4 +17,4 @@ l[3] <- NULL print("after deleting a element: ") print(l) -print(paste("length of the list after modifing:", length(l)))- \ No newline at end of file +print(paste("length of the list after modifing:", length(l))) diff --git a/semester_1/R/Code/R_code-3.r b/semester_1/R/Code/R_code-3.r @@ -1,10 +1,6 @@ -# Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 19 Mar 2026 -# Repo: https://github.com/notamitgamer/bsc -# License: MIT - # 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. company <- "Programiz" -print(paste0("welcome to", company))- \ No newline at end of file +print(paste0("welcome to", company)) diff --git a/semester_1/assignment-primary/assignment-p-01.c b/semester_1/assignment-primary/assignment-p-01.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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. */ diff --git a/semester_1/assignment-primary/assignment-p-02.c b/semester_1/assignment-primary/assignment-p-02.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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, diff --git a/semester_1/assignment-primary/assignment-p-03.c b/semester_1/assignment-primary/assignment-p-03.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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 diff --git a/semester_1/assignment-primary/assignment-p-04.c b/semester_1/assignment-primary/assignment-p-04.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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. */ diff --git a/semester_1/assignment-primary/assignment-p-05.c b/semester_1/assignment-primary/assignment-p-05.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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. */ @@ -54,4 +47,4 @@ void reverseArray(int arr[], int size) { printf("Position: %d, Value: %d\n", i, arr[i]); } -}- \ No newline at end of file +} diff --git a/semester_1/assignment-primary/assignment-p-06.c b/semester_1/assignment-primary/assignment-p-06.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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. */ @@ -46,4 +39,4 @@ int findLargest(int arr[], int size) } } return largest; -}- \ No newline at end of file +} diff --git a/semester_1/assignment-primary/assignment-p-07.c b/semester_1/assignment-primary/assignment-p-07.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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 @@ -111,4 +104,4 @@ int binarySearch(int arr[], int size, int target) } } return -1; -}- \ No newline at end of file +} diff --git a/semester_1/assignment-primary/assignment-p-08.c b/semester_1/assignment-primary/assignment-p-08.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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. */ diff --git a/semester_1/assignment-primary/assignment-p-09.c b/semester_1/assignment-primary/assignment-p-09.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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. */ @@ -27,4 +21,4 @@ int setBit(int num, int position) { int mask = 1 << position; return num | mask; -}- \ No newline at end of file +} diff --git a/semester_1/assignment-primary/assignment-p-10.c b/semester_1/assignment-primary/assignment-p-10.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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 diff --git a/semester_1/assignment-primary/assignment-p-11.c b/semester_1/assignment-primary/assignment-p-11.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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 diff --git a/semester_1/assignment-primary/assignment-p-12_v1.c b/semester_1/assignment-primary/assignment-p-12_v1.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a C program that takes multiple integers as command-line arguments and finds the maximum and minimum value among them. */ @@ -52,4 +45,4 @@ int main(int argc, char *argv[]) printf("The maximum value is: %d\n", max_val); printf("The minimum value is: %d\n", min_val); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/assignment-primary/assignment-p-12_v2.c b/semester_1/assignment-primary/assignment-p-12_v2.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 06 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a C program that takes multiple integers as command-line arguments and finds the maximum and minimum value among them. */ @@ -37,4 +30,4 @@ int main(int argc, char *argv[]) printf("The maximum value is: %d\n", max_val); printf("The minimum value is: %d\n", min_val); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/assignment-primary/assignment-p-13.c b/semester_1/assignment-primary/assignment-p-13.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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 @@ -54,4 +47,4 @@ int isPalindrome(char str[]) end--; } return 1; -}- \ No newline at end of file +} diff --git a/semester_1/assignment-primary/assignment-p-14_v1.c b/semester_1/assignment-primary/assignment-p-14_v1.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a C program that opens its own source code file, reads its contents, and then prints the contents to the console. */ @@ -61,4 +54,4 @@ int main(int argc, char *argv[]) free(FILENAME); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/assignment-primary/assignment-p-14_v2.c b/semester_1/assignment-primary/assignment-p-14_v2.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a C program that opens its own source code file, reads its contents, and then prints the contents to the console. */ @@ -37,4 +30,4 @@ int main() fclose(code); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/assignment-primary/assignment-p-15.c b/semester_1/assignment-primary/assignment-p-15.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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 @@ -65,4 +58,4 @@ int main() fclose(evenfile); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/assignment-secondary/assignment-s-01.c b/semester_1/assignment-secondary/assignment-s-01.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to compute the sum and product of digits of an integer using user defined functions. */ @@ -42,4 +36,4 @@ int product_of_digits(int num) num /= 10; } return product; -}- \ No newline at end of file +} diff --git a/semester_1/assignment-secondary/assignment-s-02.c b/semester_1/assignment-secondary/assignment-s-02.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to reverse a non-negative integer using a function. */ #include <stdio.h> @@ -33,4 +27,4 @@ int reverse(int num) num /= 10; } return rev; -}- \ No newline at end of file +} diff --git a/semester_1/assignment-secondary/assignment-s-03.c b/semester_1/assignment-secondary/assignment-s-03.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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+… */ @@ -36,4 +30,4 @@ int sum_of_series(int n) } } return sum; -}- \ No newline at end of file +} diff --git a/semester_1/assignment-secondary/assignment-s-04.c b/semester_1/assignment-secondary/assignment-s-04.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a function to check whether a number is prime or not. Use the same function to generate all prime numbers less than 100. */ @@ -56,4 +49,4 @@ int isPrime(int n) } } return 1; -}- \ No newline at end of file +} diff --git a/semester_1/assignment-secondary/assignment-s-05.c b/semester_1/assignment-secondary/assignment-s-05.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a function to check whether a given string is a palindrome. Use this function to determine whether an entered string is Palindrome. */ @@ -63,4 +56,4 @@ int isPalindrome(char str[]) } return 1; -}- \ No newline at end of file +} diff --git a/semester_1/assignment-secondary/assignment-s-06.c b/semester_1/assignment-secondary/assignment-s-06.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program using a function to compute and display all factors of a given number. */ #include <stdio.h> @@ -39,4 +33,4 @@ void display_factors(int num) { for (i = 1; i <= temp; i++) if (temp % i == 0) printf(" %d", -i); -}- \ No newline at end of file +} diff --git a/semester_1/assignment-secondary/assignment-s-07.c b/semester_1/assignment-secondary/assignment-s-07.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to swap two numbers using a macro (#define). */ // IMPOSSIBLE @@ -43,4 +37,4 @@ int main() { printf("Number 2 (num2): %d\n", num2); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/assignment-secondary/assignment-s-08.c b/semester_1/assignment-secondary/assignment-s-08.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program that counts the number of occurrences of each alphabet (A-Z, a-z) in the text entered using Command-Line Arguments. */ @@ -42,4 +36,4 @@ int main(int argc, char *argv[]) } } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/assignment-secondary/assignment-s-09.c b/semester_1/assignment-secondary/assignment-s-09.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 17 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to swap two numbers using pointers (user-defined function). */ #include <stdio.h> @@ -30,4 +24,4 @@ void swap(int *a, int *b) *a = *a ^ *b; *b = *a ^ *b; *a = *a ^ *b; -}- \ No newline at end of file +} diff --git a/semester_1/assignment-secondary/assignment-s-10.c b/semester_1/assignment-secondary/assignment-s-10.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 17 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to swap two numbers using pointers (user-defined function). */ #include <stdio.h> @@ -30,4 +24,4 @@ void swap(int *a, int *b) *a = *a ^ *b; *b = *a ^ *b; *a = *a ^ *b; -}- \ No newline at end of file +} diff --git a/semester_1/assignment-secondary/assignment-s-11.c b/semester_1/assignment-secondary/assignment-s-11.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 17 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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(). */ @@ -27,4 +21,4 @@ void area_circumference(double r, double *area, double *circumference) { *area = M_PI * r * r; *circumference = 2 * M_PI * r; -}- \ No newline at end of file +} diff --git a/semester_1/assignment-secondary/assignment-s-12.c b/semester_1/assignment-secondary/assignment-s-12.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 17 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to find the sum of n elements entered by the user. Use dynamic memory allocation (malloc() or calloc()). */ @@ -43,4 +37,4 @@ int sum_elem(int arr[], int n) sum += arr[i]; } return sum; -}- \ No newline at end of file +} diff --git a/semester_1/assignment-secondary/assignment-s-13-1.c b/semester_1/assignment-secondary/assignment-s-13-1.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 19 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a function that reverses the elements of an array in place, using only a single pointer argument, and return void. */ @@ -64,4 +57,4 @@ void reverse(int *arr) start++; end--; } -}- \ No newline at end of file +} diff --git a/semester_1/assignment-secondary/assignment-s-13-2.c b/semester_1/assignment-secondary/assignment-s-13-2.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 19 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a function that reverses the elements of an array in place, using only a single pointer argument, and return void. */ @@ -68,4 +61,4 @@ void reverse(struct Array *array) start++; end--; } -}- \ No newline at end of file +} diff --git a/semester_1/assignment-secondary/assignment-s-14.c b/semester_1/assignment-secondary/assignment-s-14.c @@ -1,11 +1,4 @@ /* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 20 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - -/* Write a menu-driven program to perform the following string operations: a. Show address of each character b. Concatenate two strings without using strcat() @@ -280,4 +273,4 @@ void reverse(char str[]) end--; } printf("%s\n", result); -}- \ No newline at end of file +} diff --git a/semester_1/assignment-secondary/assignment-s-15.c b/semester_1/assignment-secondary/assignment-s-15.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 21 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program to merge two sorted integer arrays to form a single sorted array. */ #include <stdio.h> @@ -53,4 +46,4 @@ void merge(int a[], int n1, int b[], int n2) printf(" %d", c[i]); } free(c); -}- \ No newline at end of file +} diff --git a/semester_1/assignment-secondary/assignment-s-16.c b/semester_1/assignment-secondary/assignment-s-16.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 21 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program that reads 10 integers into an array (using pointers), and prints the array in ascending and descending order. */ @@ -73,4 +66,4 @@ void print(int *arr, int n) printf(" %d", *(temp + i)); } free(temp); -}- \ No newline at end of file +} diff --git a/semester_1/assignment-secondary/assignment-s-17.c b/semester_1/assignment-secondary/assignment-s-17.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 21 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program to display the Fibonacci series (i) using recursion (ii) using iteration @@ -90,4 +83,4 @@ void fib_ite_print(int n) t1 = t2; t2 = temp + t2; } -}- \ No newline at end of file +} diff --git a/semester_1/assignment-secondary/assignment-s-18.c b/semester_1/assignment-secondary/assignment-s-18.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 22 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program to calculate the factorial of a number (i) using recursion (ii) using iteration @@ -69,4 +62,4 @@ long long int fact_ite(int n) result *= i; } return result; -}- \ No newline at end of file +} diff --git a/semester_1/assignment-secondary/assignment-s-19.c b/semester_1/assignment-secondary/assignment-s-19.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 22 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program to calculate the GCD of two numbers (i) using recursion (ii) without recursion @@ -65,4 +58,4 @@ int gcd_ite(int a, int b) a = temp; } return a; -}- \ No newline at end of file +} diff --git a/semester_1/assignment-secondary/assignment-s-20.c b/semester_1/assignment-secondary/assignment-s-20.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 22 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a menu-driven program to perform the following matrix operations using 2-D arrays and functions: a. Sum @@ -323,4 +316,4 @@ void transpose(int **matrix, int rows, int cols) } display(r, cols, rows); clear(r, cols); -}- \ No newline at end of file +} diff --git a/semester_1/assignment-secondary/assignment-s-21.c b/semester_1/assignment-secondary/assignment-s-21.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 21 Jan 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program to copy the contents of a text file to another file, after removing all white spaces (spaces, tabs, newlines). */ @@ -77,4 +70,4 @@ int main() free(newFilename); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/assignment-secondary/assignment-s-22.c b/semester_1/assignment-secondary/assignment-s-22.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 18 Jan 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program using structures to add two distances in meter-kilometer format. */ #include <stdio.h> @@ -35,4 +29,4 @@ void total_distance(struct distance dis[]) result_km += result_m / 1000; result_m = result_m % 1000; printf("Total distance: %d KM, %d M", result_km, result_m); -}- \ No newline at end of file +} diff --git a/semester_1/assignment-secondary/assignment-s-23.c b/semester_1/assignment-secondary/assignment-s-23.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 18 Jan 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to add two complex numbers using structures. */ #include <stdio.h> @@ -25,4 +19,4 @@ int main() printf("Result = %-2g + %-2.2g", a.real + b.real, a.imaginary + b.imaginary); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/assignment-secondary/assignment-s-24.c b/semester_1/assignment-secondary/assignment-s-24.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 18 Jan 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to calculate the difference between two time periods using structures. */ #include <stdio.h> @@ -36,4 +30,4 @@ int main() printf("\nTime difference: %ld Hour(s) %ld Minutes(s) %ld Second(s).", tdif / 3600, (tdif % 3600) / 60, (tdif % 3600) % 60); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/eduincs_exam/Paper-1_05-03-2026/Qn-10.c b/semester_1/eduincs_exam/Paper-1_05-03-2026/Qn-10.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 06 Mar 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a C program to find the maximum element in each row of a 2D array and print the result. */ diff --git a/semester_1/eduincs_exam/Paper-1_05-03-2026/Qn-8.c b/semester_1/eduincs_exam/Paper-1_05-03-2026/Qn-8.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 06 Mar 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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 */ @@ -56,4 +49,4 @@ void print(int row, int col, int arr[row][col]) } printf("\n"); } -}- \ No newline at end of file +} diff --git a/semester_1/eduincs_exam/Paper-1_05-03-2026/Qn-9.c b/semester_1/eduincs_exam/Paper-1_05-03-2026/Qn-9.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 06 Mar 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a C program to find sum of all elements in a given 2D array. */ #include <stdio.h> @@ -38,4 +31,4 @@ int findSum(int row, int col, int arr[row][col]) } } return sum; -}- \ No newline at end of file +} diff --git a/semester_1/eduincs_exam/Paper-2_05-03-2026/Qn-11.c b/semester_1/eduincs_exam/Paper-2_05-03-2026/Qn-11.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 06 Mar 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program to explain, how an array of stucture can you defined and accessed. */ #include <stdio.h> @@ -51,4 +44,4 @@ int main() { } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/eduincs_exam/Paper-2_05-03-2026/Qn-3.c b/semester_1/eduincs_exam/Paper-2_05-03-2026/Qn-3.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 06 Mar 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program to search an element from an array using linear search technique using malloc() and free() for memory allocation and deallocation. */ @@ -63,4 +56,4 @@ int linearSearch(int arr[], int size, int target) } } return -1; -}- \ No newline at end of file +} diff --git a/semester_1/eduincs_exam/Paper-2_05-03-2026/Qn-4.c b/semester_1/eduincs_exam/Paper-2_05-03-2026/Qn-4.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 06 Mar 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program to check a string is palindrome or not using user-defined function. */ @@ -41,4 +34,4 @@ bool isPalindrome(char str[]) { right--; } return true; -}- \ No newline at end of file +} diff --git a/semester_1/internal-practice/IP-01.c b/semester_1/internal-practice/IP-01.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 03 Jan 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to compute the sum and product of digits of an integer using user defined functions. */ @@ -42,4 +36,4 @@ int product_of_digits(int num) num /= 10; } return product; -}- \ No newline at end of file +} diff --git a/semester_1/internal-practice/IP-02.c b/semester_1/internal-practice/IP-02.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 03 Jan 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to reverse a non-negative integer using a function. */ #include <stdio.h> @@ -33,4 +27,4 @@ int reverse(int num) num /= 10; } return rev; -}- \ No newline at end of file +} diff --git a/semester_1/internal-practice/IP-03.c b/semester_1/internal-practice/IP-03.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 03 Jan 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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+… */ @@ -36,4 +30,4 @@ int sum_of_series(int n) } } return sum; -}- \ No newline at end of file +} diff --git a/semester_1/internal-practice/IP-04.c b/semester_1/internal-practice/IP-04.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 03 Jan 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a function to check whether a number is prime or not. Use the same function to generate all prime numbers less than 100. */ @@ -56,4 +49,4 @@ int isPrime(int n) } } return 1; -}- \ No newline at end of file +} diff --git a/semester_1/internal-practice/IP-05.c b/semester_1/internal-practice/IP-05.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 03 Jan 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a function to check whether a given string is a palindrome. Use this function to determine whether an entered string is Palindrome. */ @@ -63,4 +56,4 @@ int isPalindrome(char str[]) } return 1; -}- \ No newline at end of file +} diff --git a/semester_1/internal-practice/IP-06.c b/semester_1/internal-practice/IP-06.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 03 Jan 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program using a function to compute and display all factors of a given number. */ #include <stdio.h> @@ -39,4 +33,4 @@ void display_factors(int num) { for (i = 1; i <= temp; i++) if (temp % i == 0) printf(" %d", -i); -}- \ No newline at end of file +} diff --git a/semester_1/internal-practice/IP-07.c b/semester_1/internal-practice/IP-07.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 03 Jan 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to swap two numbers using pointers (user-defined function). */ #include <stdio.h> @@ -30,4 +24,4 @@ void swap(int *a, int *b) *a = *a ^ *b; *b = *a ^ *b; *a = *a ^ *b; -}- \ No newline at end of file +} diff --git a/semester_1/internal-practice/IP-08.c b/semester_1/internal-practice/IP-08.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 03 Jan 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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(). */ @@ -27,4 +21,4 @@ void area_circumference(double r, double *area, double *circumference) { *area = M_PI * r * r; *circumference = 2 * M_PI * r; -}- \ No newline at end of file +} diff --git a/semester_1/internal-practice/IP-09.c b/semester_1/internal-practice/IP-09.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 03 Jan 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to find the sum of n elements entered by the user. Use dynamic memory allocation (malloc() or calloc()). */ @@ -43,4 +37,4 @@ int sum_elem(int arr[], int n) sum += arr[i]; } return sum; -}- \ No newline at end of file +} diff --git a/semester_1/internal-practice/IP-10.c b/semester_1/internal-practice/IP-10.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 03 Jan 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a function that reverses the elements of an array in place, using only a single pointer argument, and return void. */ @@ -74,4 +67,4 @@ void reverse(int *n) temp /= 10; } *n = rev; -}- \ No newline at end of file +} diff --git a/semester_1/internal-practice/IP-11.c b/semester_1/internal-practice/IP-11.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 03 Jan 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program to merge two sorted integer arrays to form a single sorted array. */ #include <stdio.h> @@ -53,4 +46,4 @@ void merge(int a[], int n1, int b[], int n2) printf(" %d", c[i]); } free(c); -}- \ No newline at end of file +} diff --git a/semester_1/internal-practice/IP-12.c b/semester_1/internal-practice/IP-12.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 03 Jan 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program that reads 10 integers into an array (using pointers), and prints the array in ascending and descending order. */ @@ -73,4 +66,4 @@ void print(int *arr, int n) printf(" %d", *(temp + i)); } free(temp); -}- \ No newline at end of file +} diff --git a/semester_1/internal-practice/IP-13.c b/semester_1/internal-practice/IP-13.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 03 Jan 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program to display the Fibonacci series (i) using recursion (ii) using iteration @@ -90,4 +83,4 @@ void fib_ite_print(int n) t1 = t2; t2 = temp + t2; } -}- \ No newline at end of file +} diff --git a/semester_1/internal-practice/IP-14.c b/semester_1/internal-practice/IP-14.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 03 Jan 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program to calculate the factorial of a number (i) using recursion (ii) using iteration @@ -69,4 +62,4 @@ long long int fact_ite(int n) result *= i; } return result; -}- \ No newline at end of file +} diff --git a/semester_1/internal-practice/IP-15.c b/semester_1/internal-practice/IP-15.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 03 Jan 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program to calculate the GCD of two numbers (i) using recursion (ii) without recursion @@ -65,4 +58,4 @@ int gcd_ite(int a, int b) a = temp; } return a; -}- \ No newline at end of file +} diff --git a/semester_1/internal-practice/IP-16.c b/semester_1/internal-practice/IP-16.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 03 Jan 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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, diff --git a/semester_1/internal-practice/IP-17.c b/semester_1/internal-practice/IP-17.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 03 Jan 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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 diff --git a/semester_1/internal-practice/IP-18.c b/semester_1/internal-practice/IP-18.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 03 Jan 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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. */ @@ -46,4 +39,4 @@ int findLargest(int arr[], int size) } } return largest; -}- \ No newline at end of file +} diff --git a/semester_1/internal-practice/IP-19.c b/semester_1/internal-practice/IP-19.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 03 Jan 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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 @@ -111,4 +104,4 @@ int binarySearch(int arr[], int size, int target) } } return -1; -}- \ No newline at end of file +} diff --git a/semester_1/internal-practice/IP-20.c b/semester_1/internal-practice/IP-20.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 03 Jan 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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. */ @@ -54,4 +47,4 @@ void reverseArray(int arr[], int size) { printf("Position: %d, Value: %d\n", i, arr[i]); } -}- \ No newline at end of file +} diff --git a/semester_1/khurapati-idea/KI001.c b/semester_1/khurapati-idea/KI001.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - // khurapati idea no. : 1 // Idea : we can use the side effect of printf function to get length of any string or number @@ -27,4 +21,4 @@ int main() len += printf("Your input : %s", a); // here the "Your input : ", this 13 characters are extra printf("\nLength : %d", len); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/khurapati-idea/KI002.c b/semester_1/khurapati-idea/KI002.c @@ -1,10 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - - /* Plan - checking for edge case */ #include <stdio.h> @@ -17,4 +10,4 @@ int main() printf("i = %d\n", i); } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/khurapati-idea/KI003.c b/semester_1/khurapati-idea/KI003.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 24 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Bubble sort (with swap) */ #include <stdio.h> @@ -210,4 +203,4 @@ int dsort(int *arr, int n) } free(temp); return swapCount; -}- \ No newline at end of file +} diff --git a/semester_1/khurapati-idea/KI004.c b/semester_1/khurapati-idea/KI004.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 27 Jan 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Trying to write code only with emoji */ #include<stdio.h> @@ -26,4 +20,4 @@ 👍😂😁%d😁, &num🤣😍 ❤️😂😁Entered number: %d😁, num🤣😍 🙌 0😍 -😘- \ No newline at end of file +😘 diff --git a/semester_1/khurapati-idea/interpeter.py b/semester_1/khurapati-idea/interpeter.py @@ -1,9 +1,3 @@ -# Author : Amit Dutta <amitdutta4255@gmail.com> -# Date : 06 Feb 2026 -# Repo : https://github.com/notamitgamer/bsc -# License : MIT License (See the LICENSE file for details) -# Copyright (c) 2026 Amit Dutta - import sys import os import subprocess @@ -82,4 +76,4 @@ def run_universal_compiler(): os.remove(temp_file) if __name__ == "__main__": - run_universal_compiler()- \ No newline at end of file + run_universal_compiler() diff --git a/semester_1/letusc/interest.h b/semester_1/letusc/interest.h @@ -1,7 +1,2 @@ -/* - * Author : Amit Dutta - * File : interest.h - */ - #define SIMPLE_INTEREST(p, r, t) ((p * r * t) / 100.0) #define AMOUNT(p, si) (p + si) diff --git a/semester_1/letusc/luc001.c b/semester_1/letusc/luc001.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Temperature of a city in fahrenheit degrees is input through the keyboard. WAP to convert this temperature into Centigrade degrees. */ diff --git a/semester_1/letusc/luc002.c b/semester_1/letusc/luc002.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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 diff --git a/semester_1/letusc/luc003.c b/semester_1/letusc/luc003.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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 diff --git a/semester_1/letusc/luc004.c b/semester_1/letusc/luc004.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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 %) */ @@ -28,4 +22,4 @@ int main() } printf("\nSum of the digit '%d' is : %d", temp, result); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc005.c b/semester_1/letusc/luc005.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to recive Cartesian co-ordinates (x, y) of a point and convert them into Polar co-ordinates (r, phi) @@ -21,4 +15,4 @@ int main() phi = atan2(y, x); printf("\nPolar Co-Ordinates are : (%g, %g Rad)", r, phi); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc006.c b/semester_1/letusc/luc006.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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 @@ -29,4 +23,4 @@ int main() d = 3963 * acos(sin(l1) * sin(l2) + cos(l1) * cos(l2) * cos(g2 - g1)); printf("Distance in nautical miles : %g", d); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc007.c b/semester_1/letusc/luc007.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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. @@ -22,4 +16,4 @@ int main() wcf = 35.74 + (0.6215 * t) + (((0.4275 * t) - 35.75) * pow(v, 0.16)); printf("\nWind-chill factor (wcf) : %g", wcf); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc008.c b/semester_1/letusc/luc008.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* If value of an angle is input through the keyboard, write a program to print all its trigonometric ratios. */ /* Let Us C, Chap - 2, Page - 37, Qn No.: G(e) */ @@ -31,4 +25,4 @@ int main() "\ncot = %g", rsin, rcos, rtan, rcosec, rsec, rcot); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc009.c b/semester_1/letusc/luc009.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Two numbers are input through the keyboard into two locations C and D. Write a program to interchange the contents of C and D. */ /* Let Us C, Chap - 2, Page - 37, Qn No.: G(d) */ @@ -24,4 +18,4 @@ int main() printf("\nA = %g (Memory location = %p)", a, &a); printf("\nB = %g (Memory location = %p)", b, &b); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc010.c b/semester_1/letusc/luc010.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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. */ @@ -32,4 +26,4 @@ int main() else printf("\nOrigianl and reversed numbers are not equal."); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc011.c b/semester_1/letusc/luc011.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* If ages of Ram, Shyam and Ajay are input through the keyboard, write a program to determine the youngest of the three. */ /* Let Us C, Chap- 3, Page - 53, Qn No.: f(b) */ @@ -23,4 +17,4 @@ int main() if (ajay < ram && ajay < shyam) printf("\nAjay is the youngest. Age : %d", ajay); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc012.c b/semester_1/letusc/luc012.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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. */ @@ -21,4 +15,4 @@ int main() else printf("\nThis Triangle is not valid. Sum of the angles : %g", sum); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc013.c b/semester_1/letusc/luc013.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to find the absolute value of a number entered through the keyboard. */ /* Let Us C, Chap- 3, Page - 53, Qn No.: f(d) */ @@ -18,4 +12,4 @@ int main() num = abs(num); printf("\nAbsolute value of the input is : %g", num); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc014.c b/semester_1/letusc/luc014.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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 @@ -25,4 +19,4 @@ int main() else printf("\nThe area of the rectangle is same as it's perimeter."); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc015.c b/semester_1/letusc/luc015.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Given three points (x1, y1), (x2, y2), and (x3, y3), write a program to check if the three poins fall on one straight line. */ /* Let Us C, Chap- 3, Page - 53, Qn No.: f(f) */ @@ -28,4 +22,4 @@ int main() else printf("\nA(%g, %g), B(%g, %g) and C(%g, %g) points doesn't fall on one straight line.", x1, y1, x2, y2, x3, y3); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc016.c b/semester_1/letusc/luc016.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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.) */ @@ -45,4 +38,4 @@ int main() printf("The point P(%g, %g) lies OUTSIDE THE CIRCLE.\n", x, y); } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc017.c b/semester_1/letusc/luc017.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Given a point (x, y), write a program to find out if it lies on X-axis, Y-axis or origin. */ /* Let Us C, Chap- 3, Page - 53, Qn No.: f(h) */ @@ -25,4 +19,4 @@ int main() else printf("\nThe point P(%g, %g) lies in a QUADRANT (not on an axis or the origin).", x, y); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc018-logic.c b/semester_1/letusc/luc018-logic.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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. */ /* Let Us C, Chap- 3, Page - 53, Qn No.: f(i) */ @@ -90,4 +83,4 @@ int main() { printf("\nOn January 1st, %lld, the day was: **%s**.\n", year, day_names[day_index]); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc018.c b/semester_1/letusc/luc018.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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. */ @@ -38,4 +32,4 @@ int main() { day_index = (total_days + 1) % 7; printf("\nOn January 1st, %lld, the day was: %s.\n", year, day_names[day_index]); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc019.c b/semester_1/letusc/luc019.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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. */ @@ -55,4 +48,4 @@ int main() else printf("\nEntered triangle is NOT a RIGHT-ANGLED triangle."); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc020.c b/semester_1/letusc/luc020.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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, @@ -66,4 +59,4 @@ int main() printf("\nRGB color (%g, %g, %g) equivalent to CMYK color (%g, %g, %g, %g).", r, g, b, c, m, y, k); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc021.c b/semester_1/letusc/luc021.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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 @@ -72,4 +65,4 @@ int main() } /* I did not used this long variable names. I used very short just the first letter of the word. -After writting the whole program, I just renamed the valiables. This is possible in Visual Stdio Code. */- \ No newline at end of file +After writting the whole program, I just renamed the valiables. This is possible in Visual Stdio Code. */ diff --git a/semester_1/letusc/luc022.c b/semester_1/letusc/luc022.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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 @@ -46,4 +39,4 @@ int main() else printf("\nBMI Catagory : Unclassified"); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc023.c b/semester_1/letusc/luc023.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Using conditional operators determine : (1) Whether the character entered through the keyboard is a lower case alphabet or not. @@ -23,4 +17,4 @@ int main() (inp >= 'a' && inp <= 'z' || inp >= 'A' && inp <= 'Z' || inp >= '0' && inp <= '9') ? "NOT" : ""); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc024.c b/semester_1/letusc/luc024.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program using conditional operators to determine whether a year entered through the keyboard is a leap year or not. */ /* Let Us C, Chap- 4, Page - 72, Qn No.: E(b) */ @@ -16,4 +10,4 @@ int main() scanf("%d", &year); printf("\nYear %d is %s a Leapyear.", year, (year % 400 == 0 || year % 4 == 0 && year % 100 != 0) ? "" : "NOT"); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc025.c b/semester_1/letusc/luc025.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to find the greates of the three numbers entered through the keyboard. Use conditional operators. */ /* Let Us C, Chap- 4, Page - 72, Qn No.: E(c) */ @@ -17,4 +11,4 @@ int main() printf("\nGreatest of the three number '%g', '%g' and '%g' is : '%g'", num1, num2, num3, (num1 > num2 && num1 > num3) ? num1 : ((num2 > num1 && num2 > num3) ? num2 : num3)); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc026.c b/semester_1/letusc/luc026.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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. */ /* Let Us C, Chap- 4, Page - 73, Qn No.: E(d) */ @@ -27,4 +21,4 @@ int main() printf("\nsum of squares of sine and cosine of this angle is equal to 1.") : printf("\nsum of squares of sine and cosine of this angle is NOT equal to 1."); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc027.c b/semester_1/letusc/luc027.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Rewrite the folowing program using conditional operations #include<stdio.h> int main() @@ -32,4 +26,4 @@ int main() (sal >= 25000 && sal <= 40000) ? printf("Manager\n") : ((sal >= 15000 && sal < 25000) ? printf("Accountant\n") : printf("Clerk\n")); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc028.c b/semester_1/letusc/luc028.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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. */ /* Let Us C, Chap- 5, Page - 87, Qn No.: B(a) */ @@ -20,4 +14,4 @@ int main() i++; } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc029.c b/semester_1/letusc/luc029.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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 @@ -31,4 +25,4 @@ int main() num++; } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc030.c b/semester_1/letusc/luc030.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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 : @@ -77,4 +70,4 @@ int main() printf("The computer wins.\n"); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc031-logic.c b/semester_1/letusc/luc031-logic.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program to enter numbers till the user wants. At the end it should display the count of positive, negative and zeros entered. */ /* Let Us C, Chap- 5, Page - 87, Qn No.: B(d) */ @@ -103,4 +96,4 @@ int main() { printf("====================================\n"); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc031.c b/semester_1/letusc/luc031.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to enter numbers till the user wants. At the end it should display the count of positive, negative and zeros entered. */ /* Let Us C, Chap- 5, Page - 87, Qn No.: B(d) */ @@ -42,4 +36,4 @@ int main() printf("Zeroes entered: %d\n", zero_count); printf("Total numbers recorded: %d\n", positive_count + negative_count + zero_count); printf("====================================\n"); -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc032.c b/semester_1/letusc/luc032.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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 @@ -33,4 +27,4 @@ int main() index--; } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc033.c b/semester_1/letusc/luc033.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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. */ @@ -41,4 +35,4 @@ int main() printf("\nSmallest number in the set : %d", min); printf("\nRange : %d", range); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc034.c b/semester_1/letusc/luc034.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to print the multiplication table of the number entered by the user. The table should get displayed in the following form : @@ -22,4 +16,4 @@ int main() for (i = 1; i <= 10; i++) printf("%d * %d = %d\n", num, i, num * i); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc035.c b/semester_1/letusc/luc035.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* According to a study, the approximate level of intelligence of a person can be calculated using the following formula. i = 2 + (y + 0.5x) @@ -27,4 +21,4 @@ int main() printf("-----------------------\n"); } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc036.c b/semester_1/letusc/luc036.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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 @@ -37,4 +31,4 @@ int main() printf("\nInterest : %.2f\nTotal Amount : %.2f\n\n", interest, totalAmount); } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc037.c b/semester_1/letusc/luc037.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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 @@ -31,4 +25,4 @@ int main() scanf("%lf", &x); printf("\nResult : %g", series(x)); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc038.c b/semester_1/letusc/luc038.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to generate all Pythagorean Triplets with slide length less than or equal to 30. */ /* Let Us C, Chap- 6, Page - 106, Qn No.: B(e) */ @@ -28,4 +22,4 @@ int main() } } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc039.c b/semester_1/letusc/luc039.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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 @@ -21,4 +15,4 @@ int main() printf("%d year ago : %d\n", i, population); } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc040-logic.c b/semester_1/letusc/luc040-logic.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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 diff --git a/semester_1/letusc/luc040.c b/semester_1/letusc/luc040.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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 @@ -68,4 +61,4 @@ int main() printf("Search complete."); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc041.c b/semester_1/letusc/luc041.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to print 24 hours of day with suitable suffixes like AM, PM, Noon and Midnight. */ /* Let Us C, Chap- 6, Page - 106, Qn No.: B(h) */ @@ -25,4 +19,4 @@ int main() printf("%02d:00\tPM\n", hour - 12); } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc042.c b/semester_1/letusc/luc042.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to produce the following output : 1 2 3 @@ -40,4 +34,4 @@ int main() printf("\n"); } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc043.c b/semester_1/letusc/luc043.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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. @@ -65,4 +58,4 @@ int main() printf("\nStudent will get %d grace marks.", graceMarks); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc044.c b/semester_1/letusc/luc044.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Any year is entered through the keyboard. Write a function to determine whether the year is aleap year or not. */ /* Let Us C, Chap- 8, Page - 144, Qn No.: C(1) */ @@ -30,4 +24,4 @@ int main() else printf("\nYear %d is not a Leap Year.", year); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc045.c b/semester_1/letusc/luc045.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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 @@ -66,4 +59,4 @@ int main() } findPrimeFactors(n); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc046.c b/semester_1/letusc/luc046.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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 @@ -36,4 +30,4 @@ void circularShift(int *x, int *y, int *z) *z = *y; *y = *x; *x = temp; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc047.c b/semester_1/letusc/luc047.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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() @@ -33,4 +27,4 @@ void convertWeight(double weightKG, double *weightGram, double *weightPound, dou *weightGram = weightKG * 1000.0; *weightPound = weightKG * 2.2046226218; *weightTON = weightKG / 1000.0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc048.c b/semester_1/letusc/luc048.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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 @@ -181,4 +174,4 @@ Enter the co-ordinates of Test Point (Ex.: 3,5): 101.10,201.20 Test Point (101.1, 201.2) is inside ABC. -*/- \ No newline at end of file +*/ diff --git a/semester_1/letusc/luc049.c b/semester_1/letusc/luc049.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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 @@ -57,4 +50,4 @@ void binary_rec(int n) binary_rec(n / 2); printf("%d", n % 2); -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc050.c b/semester_1/letusc/luc050.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a recursive function to obtain the sum of first 25 natural numbers. */ /* Let Us C, Chap- 10 (Recursive), Qn No.: B(b) */ @@ -34,4 +27,4 @@ int get_sum(int n) return 0; else return n + get_sum(n - 1); -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc051.c b/semester_1/letusc/luc051.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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. */ /* Let Us C, Chap- 10 (Recursive), Qn No.: B(c) */ @@ -38,4 +31,4 @@ void hanoi(int n, char from_rod, char aux_rod, char to_rod) hanoi(n - 1, from_rod, to_rod, aux_rod); printf("Move disk %d from rod %c to rod %c\n", n, from_rod, to_rod); hanoi(n - 1, aux_rod, from_rod, to_rod); -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc052.c b/semester_1/letusc/luc052.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* If a macro is not getting expanded as per your expectation, how will you find out how is it being expanded by the preprocessor? */ /* Let Us C, Chap- 12 (The C Preprocessor), Qn No.: C(a) */ @@ -23,4 +16,4 @@ int main() printf("This outputs the file after preprocessing stage.\n"); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc053.c b/semester_1/letusc/luc053.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write macro definitions for: Mean, Absolute value, Uppercase to Lowercase, Biggest of three. */ /* Let Us C, Chap- 12 (The C Preprocessor), Qn No.: C(b) */ @@ -43,4 +36,4 @@ int main() printf("Biggest: %d\n", MAX(a, b, c)); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc054.c b/semester_1/letusc/luc054.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Use 'interest.h' macros to calculate Simple Interest and Amount. */ /* Let Us C, Chap- 12 (The C Preprocessor), Qn No.: C(c) */ @@ -32,4 +25,4 @@ int main() printf("Total Amount: %.2f\n", amt); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc055.c b/semester_1/letusc/luc055.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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. */ @@ -46,4 +39,4 @@ int main() printf("Odd: %d\n", odd); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc056.c b/semester_1/letusc/luc056.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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. */ @@ -47,4 +40,4 @@ int main() printf("\nThe array is NOT symmetric.\n"); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc057.c b/semester_1/letusc/luc057.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program using pointers to find the smallest number in an array of 25 integers. */ @@ -44,4 +37,4 @@ int main() printf("\nSmallest number is: %d\n", min); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc058.c b/semester_1/letusc/luc058.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Implement the Insertion Sort algorithm shown in Figure 13.3 on a set of 25 numbers. */ @@ -59,4 +52,4 @@ void insertion_sort(int *arr, int n) } arr[j + 1] = key; } -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc059.c b/semester_1/letusc/luc059.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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(). */ @@ -46,4 +39,4 @@ void modify(int *a, int n) { a[i] = a[i] * 3; } -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc060.c b/semester_1/letusc/luc060.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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 */ @@ -43,4 +36,4 @@ int main() printf("Standard Deviation: %.2f\n", std_dev); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc061.c b/semester_1/letusc/luc061.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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. */ @@ -48,4 +41,4 @@ int main() printf("\nLargest Plot is No. %d with Area: %.2f\n", max_index, max_area); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc062.c b/semester_1/letusc/luc062.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* For the following set of n data points (x, y), write a program to compute the correlation coefficient r. */ @@ -47,4 +40,4 @@ int main() printf("Correlation coefficient (r) = %.4f\n", r); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc063.c b/semester_1/letusc/luc063.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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). */ @@ -42,4 +35,4 @@ int main() printf("\nTotal distance from first to last point: %.2f\n", total_distance); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc064.c b/semester_1/letusc/luc064.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Simulate a Dequeue (Double Ended Queue) using an array. Support: retrieve left, retrieve right, insert left, insert right. Use pointers left and right. */ @@ -180,4 +173,4 @@ void display(int *dq, int left, int right) i++; } printf("\n"); -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc065.c b/semester_1/letusc/luc065.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program to find if a square matrix is symmetric. */ @@ -55,4 +48,4 @@ int main() printf("\nThe matrix is NOT Symmetric.\n"); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc066.c b/semester_1/letusc/luc066.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program to add two 6 x 6 matrices. */ @@ -55,4 +48,4 @@ int main() } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc067.c b/semester_1/letusc/luc067.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program to multiply any two 3 x 3 matrices. */ @@ -60,4 +53,4 @@ int main() } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc068.c b/semester_1/letusc/luc068.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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. */ @@ -74,4 +67,4 @@ void print_row(int *p, int n) printf("%d ", p[i]); } printf("\n"); -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc069.c b/semester_1/letusc/luc069.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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? */ @@ -33,4 +26,4 @@ int main() printf("str4: %s\n", str4); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc070.c b/semester_1/letusc/luc070.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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). */ @@ -56,4 +49,4 @@ int main() printf("The ISBN number is Incorrect.\n"); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc071.c b/semester_1/letusc/luc071.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program that receives a 16-digit Credit Card number and checks whether it is valid using the Luhn algorithm variant described. */ @@ -60,4 +53,4 @@ int main() printf("The Credit Card number is Invalid.\n"); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc072.c b/semester_1/letusc/luc072.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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? */ @@ -63,4 +56,4 @@ int main() printf(" (Calculation: 4 rows * 17 columns * 1 byte)\n"); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc073.c b/semester_1/letusc/luc073.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program to delete all vowels from a sentence. Assume that the sentence is not more than 80 characters long. */ @@ -46,4 +39,4 @@ int main() printf("Sentence without vowels: %s\n", res); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc074.c b/semester_1/letusc/luc074.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program that will read a line and delete from it all occurrences of the word 'the'. */ @@ -57,4 +50,4 @@ int main() printf("Text after removing 'the': %s\n", res); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc075.c b/semester_1/letusc/luc075.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program that stores a set of names of individuals and abbreviates the first and middle name to their first letter. */ @@ -74,4 +67,4 @@ int main() } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc076.c b/semester_1/letusc/luc076.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program to count the number of occurrences of any two vowels in succession in a line of text. */ @@ -46,4 +39,4 @@ int main() printf("\n\nTotal number of successive vowels: %d\n", count); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc077.c b/semester_1/letusc/luc077.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program that receives an integer (less than or equal to nine digits in length) and prints out the number in words. */ @@ -72,4 +65,4 @@ void convert(long n, char *suffix) { printf("%s", suffix); } -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc078.c b/semester_1/letusc/luc078.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Create a structure 'student' (Roll, Name, Dept, Course, Year). Write functions to print names by join year and print data by roll number. */ /* Let Us C, Chap- 17 (Structures), Qn No.: B(a) */ @@ -81,4 +74,4 @@ void print_by_roll(struct student *s, int n, int roll) } } printf("Student with Roll %d not found.\n", roll); -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc079.c b/semester_1/letusc/luc079.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Create a structure for bank customers (Acc no, Name, Balance). Write functions to print low balance customers and handle deposits/withdrawals. */ /* Let Us C, Chap- 17 (Structures), Qn No.: B(b) */ @@ -99,4 +92,4 @@ void transaction(struct customer *c, int n, int acc, float amount, int code) } } if (!found) printf("Account number not found.\n"); -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc080.c b/semester_1/letusc/luc080.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Automobile engine parts (Serial AA0-FF9, Year, Material, Qty). Retrieve parts between serial numbers BB1 and CC6. */ /* Let Us C, Chap- 17 (Structures), Qn No.: B(c) */ @@ -60,4 +53,4 @@ void retrieve_parts(struct part *p, int n) p[i].serial, p[i].mfg_year, p[i].material, p[i].quantity); } } -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc081.c b/semester_1/letusc/luc081.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Create structure for Cricketers (Name, Age, Tests, Avg Runs). Sort 20 records by average runs using qsort(). */ /* Let Us C, Chap- 17 (Structures), Qn No.: B(d) */ @@ -59,4 +52,4 @@ int main() printf("%s: %.2f\n", team[i].name, team[i].avg_runs); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc082.c b/semester_1/letusc/luc082.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Structure 'employee' (Code, Name, Date of Joining). Display names of employees with tenure >= 3 years. */ /* Let Us C, Chap- 17 (Structures), Qn No.: B(e) */ @@ -65,4 +58,4 @@ int main() } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc083.c b/semester_1/letusc/luc083.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Library menu-driven program (Add, Display, List by Author, List by Title, Count, List sorted). */ /* Let Us C, Chap- 17 (Structures), Qn No.: B(f) */ @@ -134,4 +127,4 @@ void sort_by_acc(struct library *lib, int count) } } } -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc084.c b/semester_1/letusc/luc084.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Define a function that compares two given dates. Return 0 if equal, otherwise return 1. */ /* Let Us C, Chap- 17 (Structures), Qn No.: B(g) */ @@ -50,4 +43,4 @@ int compare_dates(struct date d1, struct date d2) return 0; else return 1; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc085.c b/semester_1/letusc/luc085.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Suppose a file contains student records (Name, Age). Write a program to read these records and display them in sorted order by name. */ /* Let Us C, Chap- 19 (File Input/Output), Qn No.: B(a) */ @@ -78,4 +71,4 @@ void create_dummy_data() fwrite(data, sizeof(struct student), 5, fp); fclose(fp); } -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc086.c b/semester_1/letusc/luc086.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program to copy contents of one file to another. While doing so replace all lowercase characters to their equivalent uppercase characters. */ /* Let Us C, Chap- 19 (File Input/Output), Qn No.: B(b) */ @@ -65,4 +58,4 @@ void create_source_file() fprintf(fp, "This is a sample text.\nIt contains Lowercase letters.\n"); fclose(fp); } -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc087.c b/semester_1/letusc/luc087.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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. */ /* Let Us C, Chap- 19 (File Input/Output), Qn No.: B(c) */ @@ -84,4 +77,4 @@ void create_sample_files() fclose(f1); fclose(f2); -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc088.c b/semester_1/letusc/luc088.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program to encrypt/decrypt a file using: (1) Offset cipher (2) Substitution cipher. */ /* Let Us C, Chap- 19 (File Input/Output), Qn No.: B(d) */ @@ -71,4 +64,4 @@ void create_plain_file() fprintf(fp, "SECRET MESSAGE"); fclose(fp); } -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc089.c b/semester_1/letusc/luc089.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Update 'CUSTOMER.DAT' balance using 'TRANSACTIONS.DAT' (Deposit/Withdrawal). Ensure balance doesn't fall below Rs. 100 on withdrawal. */ /* Let Us C, Chap- 19 (File Input/Output), Qn No.: B(e) */ @@ -114,4 +107,4 @@ void create_files() fwrite(c, sizeof(struct customer), 3, f1); fwrite(t, sizeof(struct trans), 3, f2); fclose(f1); fclose(f2); -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc090.c b/semester_1/letusc/luc090.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Read employee records (code, name, date, salary), sort them by Date of Joining, and write to a target file. */ /* Let Us C, Chap- 19 (File Input/Output), Qn No.: B(f) */ @@ -85,4 +78,4 @@ void create_emp_file() FILE *f = fopen("employee.dat", "wb"); fwrite(data, sizeof(struct emp_clean), 3, f); fclose(f); -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc091.c b/semester_1/letusc/luc091.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Read 'blood donors' file (Name, Address, Age, Blood Type). Print donors with Age < 25 and Blood Type 2. */ /* Let Us C, Chap- 19 (File Input/Output), Qn No.: B(g) */ @@ -65,4 +58,4 @@ void create_donor_file() FILE *f = fopen("donors.dat", "wb"); fwrite(data, sizeof(struct donor), 4, f); fclose(f); -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc092.c b/semester_1/letusc/luc092.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program to store names in a file. Display the n-th name in the list, where n is read from the keyboard. */ /* Let Us C, Chap- 19 (File Input/Output), Qn No.: B(h) */ @@ -58,4 +51,4 @@ void create_name_file() FILE *f = fopen("names.txt", "w"); fprintf(f, "Alice\nBob\nCharlie\nDavid\nEve\nFrank\n"); fclose(f); -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc093.c b/semester_1/letusc/luc093.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Update Master file (Roll, Name) using Transaction file (Roll, Code Add/Delete). Both files are sorted by Roll. */ /* Let Us C, Chap- 19 (File Input/Output), Qn No.: B(i) */ @@ -127,4 +120,4 @@ void create_files() FILE *f2 = fopen("TRANS_ROLL.DAT", "wb"); fwrite(t, sizeof(struct trans), 3, f2); fclose(f2); -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc094.c b/semester_1/letusc/luc094.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Read a text file, delete the words 'a', 'the', 'an' and replace each with a blank space. Write to new file. */ /* Let Us C, Chap- 19 (File Input/Output), Qn No.: B(j) */ @@ -62,4 +55,4 @@ void create_article_file() FILE *f = fopen("articles.txt", "w"); fprintf(f, "The quick brown fox jumps over a lazy dog. It was an honour."); fclose(f); -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc095.c b/semester_1/letusc/luc095.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program that can read a file and display its contents. The file name should be supplied as a command-line argument. */ /* Let Us C, Chap- 20 (More Issues In Input/Output), Qn No.: A(a) */ @@ -45,4 +38,4 @@ int main(int argc, char *argv[]) fclose(fp); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc096.c b/semester_1/letusc/luc096.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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. */ /* Let Us C, Chap- 20 (More Issues In Input/Output), Qn No.: A(b) */ @@ -56,4 +49,4 @@ int main(int argc, char *argv[]) fclose(fs); fclose(ft); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc097.c b/semester_1/letusc/luc097.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program using command-line arguments to search for a word in a file and replace it with the specified word.\nUsage: change <old word> <new word> <filename> */ /* Let Us C, Chap- 20 (More Issues In Input/Output), Qn No.: A(c) */ @@ -98,4 +91,4 @@ void replace_all(char *str, const char *old_w, const char *new_w, FILE *ft) // Write the remainder of the line fputs(str, ft); -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc098.c b/semester_1/letusc/luc098.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a calculator utility using command line arguments.\nUsage: calc <switch> <n> <m>\nwhere switch is arithmetic operator or comparison operator. */ /* Let Us C, Chap- 20 (More Issues In Input/Output), Qn No.: A(d) */ @@ -76,4 +69,4 @@ int main(int argc, char *argv[]) } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc099.c b/semester_1/letusc/luc099.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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. */ /* Let Us C, Chap- 21 (Operations on Bits), Qn No.: A(a) */ @@ -46,4 +39,4 @@ int main() printf("Result: The college did NOT win the trophy.\n"); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc100.c b/semester_1/letusc/luc100.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Determine if an animal is Carnivore/Herbivore and its type (Canine, Feline, Cetacean, Marsupial) based on bits in an integer. */ /* Let Us C, Chap- 21 (Operations on Bits), Qn No.: A(b) */ @@ -44,4 +37,4 @@ int main() printf("\n"); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc101.c b/semester_1/letusc/luc101.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Decode student information (Year, Stream, Room No) packed into an integer array. */ /* Let Us C, Chap- 21 (Operations on Bits), Qn No.: A(c) */ @@ -52,4 +45,4 @@ int main() } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc102.c b/semester_1/letusc/luc102.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* What will be the output of the provided program segment involving bitwise operators? */ /* Let Us C, Chap- 21 (Operations on Bits), Qn No.: A(d) */ @@ -31,4 +24,4 @@ int main() printf("n = %d o = %d p = %d\n", n, o, p); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc103.c b/semester_1/letusc/luc103.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* What is the hexadecimal equivalent of the following binary numbers? */ /* Let Us C, Chap- 21 (Operations on Bits), Qn No.: B(a) */ @@ -32,4 +25,4 @@ int main() /* Note: Binary literals (0b...) are a standard C extension (GCC) and part of C23 standard. */ return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc104.c b/semester_1/letusc/luc104.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Rewrite expressions using bitwise compound assignment operators. */ /* Let Us C, Chap- 21 (Operations on Bits), Qn No.: B(b) */ @@ -39,4 +32,4 @@ int main() printf("c <<= 2 -> %d\n", c); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc105.c b/semester_1/letusc/luc105.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a function checkbits(x, p, n) which returns true if all 'n' bits starting from position 'p' are turned on. */ /* Let Us C, Chap- 21 (Operations on Bits), Qn No.: B(c) */ @@ -48,4 +41,4 @@ int checkbits(unsigned int x, int p, int n) // Check if bits in x match the mask return (x & mask) == mask; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc106.c b/semester_1/letusc/luc106.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program to scan an 8-bit number and check whether its 3rd, 6th and 7th bit is on. */ /* Let Us C, Chap- 21 (Operations on Bits), Qn No.: B(d) */ @@ -34,4 +27,4 @@ int main() printf("Bits 3, 6, and 7 are NOT all on.\n"); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc107.c b/semester_1/letusc/luc107.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Receive an unsigned 16-bit integer and exchange the contents of its 2 bytes using bitwise operators. */ /* Let Us C, Chap- 21 (Operations on Bits), Qn No.: B(e) */ @@ -33,4 +26,4 @@ int main() printf("Swapped: %hu (Hex: 0x%04X)\n", swapped, swapped); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc108.c b/semester_1/letusc/luc108.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Receive an 8-bit number and exchange its higher 4 bits with lower 4 bits. */ /* Let Us C, Chap- 21 (Operations on Bits), Qn No.: B(f) */ @@ -33,4 +26,4 @@ int main() printf("Swapped: %d (Hex: 0x%02X)\n", swapped, swapped); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc109.c b/semester_1/letusc/luc109.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Receive an 8-bit number and set its odd bits to 1. */ /* Let Us C, Chap- 21 (Operations on Bits), Qn No.: B(g) */ @@ -33,4 +26,4 @@ int main() printf("Result: 0x%02X\n", res); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc110.c b/semester_1/letusc/luc110.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Receive an 8-bit number. Check if 3rd and 5th bits are ON. If yes, put them OFF. */ /* Let Us C, Chap- 21 (Operations on Bits), Qn No.: B(h) */ @@ -39,4 +32,4 @@ int main() printf("Final Value: %d (0x%02X)\n", num, num); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc111.c b/semester_1/letusc/luc111.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Receive an 8-bit number. Check if 3rd and 5th bits are OFF. If yes, put them ON. */ /* Let Us C, Chap- 21 (Operations on Bits), Qn No.: B(i) */ @@ -38,4 +31,4 @@ int main() printf("Final Value: %d (0x%02X)\n", num, num); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc112.c b/semester_1/letusc/luc112.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Rewrite the showbits() function using the _BV macro. */ /* Let Us C, Chap- 21 (Operations on Bits), Qn No.: B(j) */ @@ -48,4 +41,4 @@ void showbits(unsigned char n) else printf("1"); } -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc113.c b/semester_1/letusc/luc113.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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. */ /* Let Us C, Chap- 22 (Miscellaneous Features), Qn No.: C(a) */ @@ -83,4 +76,4 @@ int compare_dates(const void *a, const void *b) // Tertiary sort by Day return e1->doj.day - e2->doj.day; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc114.c b/semester_1/letusc/luc114.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Store insurance policy holder info (gender, minor/major, policy name, duration) using bit-fields. */ /* Let Us C, Chap- 22 (Miscellaneous Features), Qn No.: C(b) */ @@ -60,4 +53,4 @@ int main() // Note: Size will be policy_name size + padding + integer size containing the bits return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc115.c b/semester_1/letusc/luc115.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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." @@ -210,4 +203,4 @@ int main() { if (!same) printf("(Even a small change in input creates a completely different hash)\n"); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc116.c b/semester_1/letusc/luc116.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Compile any C program into a .EXE or a .out file. Obtain SHA256 checksum of the file. */ /* Let Us C, Chap- 23 (Security Programming), Qn No.: D(b) */ @@ -167,4 +160,4 @@ int main(int argc, char *argv[]) { printf("\n"); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc117.c b/semester_1/letusc/luc117.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program to convert a given text into an audio file using OpenAI Audio API (TTS). */ /* Let Us C, Chap- 24 (Interaction with ChatGPT through C), Qn No.: B(a) */ @@ -89,4 +82,4 @@ int main(void) { curl_global_cleanup(); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc118.c b/semester_1/letusc/luc118.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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. */ /* Let Us C, Chap- 24 (Interaction with ChatGPT through C), Qn No.: B(b) */ @@ -68,4 +61,4 @@ int main(void) { curl_easy_cleanup(curl); } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/luc119.c b/semester_1/letusc/luc119.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 08 Feb 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program to analyse a given sentence to detect the mood of the sentence using OpenAI Chat Completion API. */ /* Let Us C, Chap- 24 (Interaction with ChatGPT through C), Qn No.: B(c) */ @@ -74,4 +67,4 @@ int main(void) { curl_easy_cleanup(curl); } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/lucproblem001.c b/semester_1/letusc/lucproblem001.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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 @@ -35,4 +29,4 @@ int main() nonotes = nonotes + n; printf("\nthe smallest number of notes that will combine to give Rs. %d : %d", temp, nonotes); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/lucproblem002.c b/semester_1/letusc/lucproblem002.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* A year is entered through the keyboard, write a program to determine whether the year is leap or not. Use the logical operators && and || . */ @@ -20,4 +14,4 @@ int main() else printf("\nYear %d is not a leapyear.", year); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/lucproblem003.c b/semester_1/letusc/lucproblem003.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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. @@ -32,4 +26,4 @@ int main() || inp >= 91 && inp <= 96 || inp >= 123 && inp <= 127) printf("\nInput '%c' is a SPECIAL SYMBOL.", inp); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/lucproblem004.c b/semester_1/letusc/lucproblem004.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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 @@ -27,4 +21,4 @@ int main() else printf("\nThis triangle is not valid."); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/lucproblem005.c b/semester_1/letusc/lucproblem005.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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. */ @@ -40,4 +34,4 @@ int main() printf("\n\tEmployee %d did not work any overtime.\n\n", i); i++; // changing to next employee } -}- \ No newline at end of file +} diff --git a/semester_1/letusc/lucproblem006.c b/semester_1/letusc/lucproblem006.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to find the factorial value of any number entered through the keyboard. */ /* Let Us C, Chap - 5, Page - 84, Problem 5.2 */ @@ -39,4 +33,4 @@ int main() } printf("\nFactorial of %d : %d", num, fact); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/lucproblem007.c b/semester_1/letusc/lucproblem007.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Two numbers are entered through the keyboard. Write a program to find the value of one number raised to the power of another */ /* Let Us C, Chap - 5, Page - 84, Problem 5.3 */ @@ -40,4 +34,4 @@ int main() } printf("\n%g to the power of %d is : %g", num, power, result); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/lucproblem008.c b/semester_1/letusc/lucproblem008.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a problem to print all the prime numbers from 1 to 300. */ /* Let Us C, Chap - 6, Page - 101, Problem 6.1 */ @@ -39,4 +33,4 @@ int main() } } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/lucproblem009.c b/semester_1/letusc/lucproblem009.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to add first seven terms of the following series using a for loop. 1 / 1! + 2 / 2! + 3 / 3! + ... @@ -23,4 +17,4 @@ int main() } printf("Sum of the series : %g", sum); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/lucproblem010-complex.c b/semester_1/letusc/lucproblem010-complex.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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). diff --git a/semester_1/letusc/lucproblem010.c b/semester_1/letusc/lucproblem010.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program to generate all combination of 1, 2 and 3 using for loop. */ /* Let Us C, Chap - 6, Page - 103, Problem 6.3 */ @@ -57,4 +50,4 @@ int main() } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/lucproblem011.c b/semester_1/letusc/lucproblem011.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a menu driven program which has following options : 1. Factorial of a number 2. Prime or not @@ -197,4 +190,4 @@ int main() break; } } -}- \ No newline at end of file +} diff --git a/semester_1/letusc/lucproblem012.c b/semester_1/letusc/lucproblem012.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a Function power(a, b), to calculate the value of a raised to b */ /* Let Us C, Chap - 8, Page - 141, Problem 8.2 */ @@ -32,4 +26,4 @@ int main() result = power(a, b); printf("Result of %g^%d = %g", a, b, result); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/lucproblem013.c b/semester_1/letusc/lucproblem013.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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 */ @@ -40,4 +34,4 @@ int main() scanf("%d", &year); romanise(year); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/lucproblem014-short.c b/semester_1/letusc/lucproblem014-short.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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() */ @@ -64,4 +57,4 @@ void stats(double *sum, double *average, double *standardDeviation) *sum = tempSum; *average = tempAverage; *standardDeviation = tempStandardDeviation; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/lucproblem014.c b/semester_1/letusc/lucproblem014.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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() */ @@ -106,4 +99,4 @@ void stats(double *sum, double *average, double *standardDeviation) *sum = tempSum; *average = tempAverage; *standardDeviation = tempStandardDeviation; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/lucproblem015.c b/semester_1/letusc/lucproblem015.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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. */ /* Let Us C, Chap - 9, Page 159, Problem 9.2 */ @@ -48,4 +41,4 @@ void bothPowerFactorial(double a, int b, int n, double *resultPower, long long * *resultPower = tempResultPower; *resultFactorial = tempResultFactorial; -}- \ No newline at end of file +} diff --git a/semester_1/letusc/lucproblem016.c b/semester_1/letusc/lucproblem016.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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? @@ -43,4 +37,4 @@ int main() printf("------------------------------\n"); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/practice-c/pc-ip-01.c b/semester_1/practice-c/pc-ip-01.c @@ -1,11 +1,4 @@ /* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 05 Jan 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - -/* * Question 1: * Write a program to compute the sum and product of digits of an integer using user-defined functions. */ @@ -49,4 +42,4 @@ int product(int num) num /= 10; } return result; -}- \ No newline at end of file +} diff --git a/semester_1/practice-c/pc-ip-02.c b/semester_1/practice-c/pc-ip-02.c @@ -1,10 +1,4 @@ /* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 05 Jan 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - -/* * Question 2: * Write a program to reverse a non-negative integer using a function. */ @@ -36,4 +30,4 @@ int reverse(int num) num /= 10; } return result; -}- \ No newline at end of file +} diff --git a/semester_1/practice-c/pc-ip-03.c b/semester_1/practice-c/pc-ip-03.c @@ -1,10 +1,4 @@ /* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 05 Jan 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - -/* * 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+... */ @@ -37,4 +31,4 @@ int series(int n) } } return result; -}- \ No newline at end of file +} diff --git a/semester_1/practice-c/pc-ip-04.c b/semester_1/practice-c/pc-ip-04.c @@ -1,11 +1,4 @@ /* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 05 Jan 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - -/* * 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. */ @@ -55,4 +48,4 @@ int isPrime(int n) } } return 1; -}- \ No newline at end of file +} diff --git a/semester_1/practice-c/pc-ip-05.c b/semester_1/practice-c/pc-ip-05.c @@ -1,11 +1,4 @@ /* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 05 Jan 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - -/* * 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. */ @@ -53,4 +46,4 @@ int isPalindrome(char str[]) high--; } return 1; -}- \ No newline at end of file +} diff --git a/semester_1/practice-c/pc-ip-06.c b/semester_1/practice-c/pc-ip-06.c @@ -1,10 +1,4 @@ /* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 05 Jan 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - -/* * Question 6: * Write a program using a function to compute and display all factors of a given number. */ @@ -33,4 +27,4 @@ void printFactors(int n) printf(" %d", i); } } -}- \ No newline at end of file +} diff --git a/semester_1/practice-c/pc-ip-07.c b/semester_1/practice-c/pc-ip-07.c @@ -1,10 +1,4 @@ /* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 05 Jan 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - -/* * Question 7: * Write a program to swap two numbers using pointers using user-defined function. */ @@ -33,4 +27,4 @@ void swap(int *a, int *b) int temp = *a; *a = *b; *b = temp; -}- \ No newline at end of file +} diff --git a/semester_1/practice-c/pc-ip-08.c b/semester_1/practice-c/pc-ip-08.c @@ -1,10 +1,4 @@ /* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 05 Jan 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - -/* * 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(). */ @@ -29,4 +23,4 @@ void area_circumference(double r, double *area, double *cir) { *area = M_PI * r * r; *cir = 2 * M_PI * r; -}- \ No newline at end of file +} diff --git a/semester_1/practice-c/pc-ip-09.c b/semester_1/practice-c/pc-ip-09.c @@ -1,11 +1,4 @@ /* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 05 Jan 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - -/* * Question 9: * Write a program to find the sum of n elements entered by the user. Use dynamic memory allocation (malloc() or calloc()). */ @@ -71,4 +64,4 @@ double sum(double arr[], int n) sum += arr[i]; } return sum; -}- \ No newline at end of file +} diff --git a/semester_1/practice-c/pc-ip-10.c b/semester_1/practice-c/pc-ip-10.c @@ -1,11 +1,4 @@ /* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 05 Jan 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - -/* * Question 10: * Write a function that reverses each elements of an array in place, using only a single pointer argument, and return void. */ @@ -76,4 +69,4 @@ void reverse(int *n) temp /= 10; } *n = rev; -}- \ No newline at end of file +} diff --git a/semester_1/practice-c/pc-ip-11.c b/semester_1/practice-c/pc-ip-11.c @@ -1,11 +1,4 @@ /* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 05 Jan 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - -/* * Question 11: * Write a program to merge two sorted integer arrays to form a single sorted array. */ @@ -105,4 +98,4 @@ void merge(int arra[], int a, int arrb[], int b) printf("\nMerged Array: "); printArray(arr, n); free(arr); -}- \ No newline at end of file +} diff --git a/semester_1/practice-c/pc-ip-12.c b/semester_1/practice-c/pc-ip-12.c @@ -1,11 +1,4 @@ /* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 05 Jan 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - -/* * Question 12: * Write a program that reads 10 integers into an array (using pointers), and prints the array in ascending and descending order. */ @@ -84,4 +77,4 @@ void bubble_sort(int arr[], int n) } } } -}- \ No newline at end of file +} diff --git a/semester_1/practice-c/pc-ip-13.c b/semester_1/practice-c/pc-ip-13.c @@ -1,11 +1,4 @@ /* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 05 Jan 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - -/* * Question 13: * Write a program to display the Fibonacci series using recursive function and iterative function. */ @@ -67,4 +60,4 @@ long long int fib_rec(int n) { return fib_rec(n - 1) + fib_rec(n - 2); } -}- \ No newline at end of file +} diff --git a/semester_1/practice-c/pc-ip-14.c b/semester_1/practice-c/pc-ip-14.c @@ -1,10 +1,4 @@ /* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 05 Jan 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - -/* * Question 14: * Write a program to calculate the factorial of a number using recursive and iterative function. */ @@ -44,4 +38,4 @@ long long int fact_rec(int n) { return n * fact_rec(n - 1); } -}- \ No newline at end of file +} diff --git a/semester_1/practice-c/pc-ip-15.c b/semester_1/practice-c/pc-ip-15.c @@ -1,11 +1,4 @@ /* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 05 Jan 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - -/* * Question 15: * Write a program to calculate the GCD of two numbers using recursive and iterative function. */ @@ -47,4 +40,4 @@ int gcd_rec(int a, int b) { return gcd_rec(b % a, a); } -}- \ No newline at end of file +} diff --git a/semester_1/practice-c/pc-ip-16.c b/semester_1/practice-c/pc-ip-16.c @@ -1,11 +1,4 @@ /* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 05 Jan 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - -/* * Question 16: * Write a C program that includes a user-defined function named isArmstrong with the signature int isArmstrong(int num);. */ @@ -48,4 +41,4 @@ int isArmstrong(int num) temp /= 10; } return result == num; -}- \ No newline at end of file +} diff --git a/semester_1/practice-c/pc-ip-17.c b/semester_1/practice-c/pc-ip-17.c @@ -1,10 +1,4 @@ /* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 05 Jan 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - -/* * Question 17: * Write a C program that includes a user-defined function named isPerfect with the signature int isPerfect(int num);. */ @@ -40,4 +34,4 @@ int isPerfect(int n) } } return sum == n; -}- \ No newline at end of file +} diff --git a/semester_1/practice-c/pc-ip-18.c b/semester_1/practice-c/pc-ip-18.c @@ -1,11 +1,4 @@ /* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 05 Jan 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - -/* * Question 18: * Write a C program that includes a user-defined function named findLargest with the signature int findLargest(int arr[], int size);. */ @@ -77,4 +70,4 @@ int findLargest(int arr[], int size) } } return largest; -}- \ No newline at end of file +} diff --git a/semester_1/practice-c/pc-ip-19.c b/semester_1/practice-c/pc-ip-19.c @@ -1,11 +1,4 @@ /* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 05 Jan 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - -/* * 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);. */ @@ -94,4 +87,4 @@ int binarySearch(int arr[], int size, int target) } } return -1; -}- \ No newline at end of file +} diff --git a/semester_1/practice-c/pc-ip-20.c b/semester_1/practice-c/pc-ip-20.c @@ -1,11 +1,4 @@ /* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 05 Jan 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - -/* * 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);. */ @@ -67,4 +60,4 @@ void reverseArray(int arr[], int size) { i++; j--; } -}- \ No newline at end of file +} diff --git a/semester_1/practice-c/pc001.c b/semester_1/practice-c/pc001.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Pattern : 1 1 2 @@ -28,4 +22,4 @@ int main() printf("\n"); } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/practice-c/pc002.c b/semester_1/practice-c/pc002.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Pattern : 1 2 3 4 5 6 7 8 9 @@ -30,4 +24,4 @@ int main() printf("\n"); } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/practice-c/pc003.c b/semester_1/practice-c/pc003.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Pattern : 1 2 4 @@ -28,4 +22,4 @@ int main() printf("\n"); } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/practice-c/pc004.c b/semester_1/practice-c/pc004.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Pattern : 5 4 3 2 1 4 3 2 1 @@ -32,4 +26,4 @@ int main() printf("\n"); } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/practice-c/pc005.c b/semester_1/practice-c/pc005.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Pattern : 1 1 2 @@ -33,4 +27,4 @@ int main() printf("\n"); } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/practice-c/pc006.c b/semester_1/practice-c/pc006.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Prime number check */ #include <stdio.h> @@ -45,4 +38,4 @@ int main() } printf("\nInput %d is a prime number.", num); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/practice-c/pc007.c b/semester_1/practice-c/pc007.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Armstrong number check only for three digit */ #include <stdio.h> @@ -33,4 +27,4 @@ int main() else printf("\nInput %d is not a armstrong number.", num); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/practice-c/pc008.c b/semester_1/practice-c/pc008.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Factorial upto N */ #include <stdio.h> @@ -32,4 +26,4 @@ int main() fact *= i; printf("\nFactorial of %d : %lld", n, fact); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/practice-c/pc009.c b/semester_1/practice-c/pc009.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Sum of digit */ #include <stdio.h> @@ -24,4 +18,4 @@ int main() } printf("\nSum of the digit %d : %d", num, sumOfDigit); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/practice-c/pc010.c b/semester_1/practice-c/pc010.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Reverse a number */ #include <stdio.h> @@ -24,4 +18,4 @@ int main() } printf("\nReverse of the number %d : %d", num, rev); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/practice-c/pc011.c b/semester_1/practice-c/pc011.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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 @@ -53,4 +46,4 @@ int main() } printf("\nTotal Palindrome number found inside the range (%d to %d) : %d", lBound, uBound, palindromeCount); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/practice-c/pc012.c b/semester_1/practice-c/pc012.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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. */ /* Author: Amit Dutta, Date: 02-12-2025 */ @@ -53,4 +46,4 @@ void charCounter(char str[], int *vowelCount, int *consonantCount) *vowelCount = tempVowelCount; *consonantCount = tempConsonantCount; -}- \ No newline at end of file +} diff --git a/semester_1/practice-c/pc013.c b/semester_1/practice-c/pc013.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 29 Mar 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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); @@ -85,4 +79,4 @@ void displayDetails(Book *book) void updatePrice(struct Book *book, float newPrice) { book->price = newPrice; -}- \ No newline at end of file +} diff --git a/semester_1/practice-c/pc014.c b/semester_1/practice-c/pc014.c @@ -1,64 +1,58 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 30 Mar 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - -/* 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. -*/ - -#include<stdio.h> -#include<stdlib.h> -#include<string.h> - -#define FILENAME "students.txt" - -typedef struct Student { - int roll; - char name[20]; - float marks; -} Stu; - -void printDetails(Stu *, int); -float calculateTotal(struct Student [], int); - -int main() { - FILE *input = NULL; - Stu stu[3]; - int i = 0; - - input = fopen(FILENAME, "r"); - if(input == NULL) { - printf("\nError opening file %s. Please try again.", FILENAME); - exit(1); - } - - while(i < 3 && (fscanf(input, "%d %s %f", &stu[i].roll, &stu[i].name, &stu[i].marks) == 3)) i++; - printDetails(stu, 3); - printf("\n\nTotal Marks: %g", calculateTotal(stu, 3)); - fclose(input); - return 0; -} - -float calculateTotal(struct Student stu[], int n) { - if(n <= 0) { - return 0; - } - return stu[n - 1].marks + calculateTotal(stu, n-1); -} - -void printDetails(Stu *stu, int n) { - int i; - printf("\n== Student Details =="); - for(i = 0; i < n; i++) { - printf("\nStudent Roll: %d" - "\nStudent Name: %s" - "\nStudent Marks: %g\n", - stu[i].roll, stu[i].name, stu[i].marks); - } -} +/* 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. +*/ + +#include<stdio.h> +#include<stdlib.h> +#include<string.h> + +#define FILENAME "students.txt" + +typedef struct Student { + int roll; + char name[20]; + float marks; +} Stu; + +void printDetails(Stu *, int); +float calculateTotal(struct Student [], int); + +int main() { + FILE *input = NULL; + Stu stu[3]; + int i = 0; + + input = fopen(FILENAME, "r"); + if(input == NULL) { + printf("\nError opening file %s. Please try again.", FILENAME); + exit(1); + } + + while(i < 3 && (fscanf(input, "%d %s %f", &stu[i].roll, &stu[i].name, &stu[i].marks) == 3)) i++; + printDetails(stu, 3); + printf("\n\nTotal Marks: %g", calculateTotal(stu, 3)); + fclose(input); + return 0; +} + +float calculateTotal(struct Student stu[], int n) { + if(n <= 0) { + return 0; + } + return stu[n - 1].marks + calculateTotal(stu, n-1); +} + +void printDetails(Stu *stu, int n) { + int i; + printf("\n== Student Details =="); + for(i = 0; i < n; i++) { + printf("\nStudent Roll: %d" + "\nStudent Name: %s" + "\nStudent Marks: %g\n", + stu[i].roll, stu[i].name, stu[i].marks); + } +} diff --git a/semester_1/practice-c/pc015.c b/semester_1/practice-c/pc015.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 30 Mar 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a C program to reverse a string using a recursive function. */ #include<stdio.h> diff --git a/semester_1/practice-c/pc016.c b/semester_1/practice-c/pc016.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 31 Mar 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a c program that records book data from user and stores them in to a file. */ #include <stdio.h> diff --git a/semester_1/practice-c/pc017.c b/semester_1/practice-c/pc017.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 21 Apr 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to calculate the difference between two time periods using structures. */ #include <stdio.h> diff --git a/semester_1/temp/sudipto1.c b/semester_1/temp/sudipto1.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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 @@ -155,4 +148,4 @@ int main() printf("\nEnter next set of states: "); } printf("\nSecurity system shutting down.\n"); -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-PRAC-001.c b/semester_1/tuition-c/APC-PRAC-001.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* WAP to calculate area and perimeter of a rectangle by accepting length and breadth as input. */ @@ -19,4 +13,3 @@ int main() { return 0; } - diff --git a/semester_1/tuition-c/APC-PRAC-002.c b/semester_1/tuition-c/APC-PRAC-002.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* WAP to calculate area of a circle using math library method. Take radius of the circle as input. */ @@ -17,4 +11,4 @@ int main() area = M_PI * pow(r, 2); printf("\nArea of the circle : %g", area); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-PRAC-003.c b/semester_1/tuition-c/APC-PRAC-003.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* WAP to accept diagonal of a square and calculate area, parimeter */ #include <stdio.h> @@ -20,4 +14,4 @@ int main() "\nPerimeter of the square : %g", area, peri); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-PRAC-004.c b/semester_1/tuition-c/APC-PRAC-004.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* WAP to calculate and display radius of a circle by taking the area as input. */ #include <stdio.h> @@ -16,4 +10,4 @@ int main() r = sqrt(area / M_PI); printf("\nRadius of the circle : %g", r); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-PRAC-005.c b/semester_1/tuition-c/APC-PRAC-005.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* WAP a program that accept number of days as input and represent it as years, months and days. */ @@ -20,4 +14,4 @@ int main() days = days % 30; printf("%d Days = %d Years, %d Months, %d Days", temp, years, months, days); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-PRAC-006.c b/semester_1/tuition-c/APC-PRAC-006.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* WAP that accept seconds as input and represent it an hours, minutes and seconds. */ #include <stdio.h> @@ -19,4 +13,4 @@ int main() sec = sec % 60; printf("\n%d Seconds = %d Hours, %d Minutes, %d Seconds.", temp, hours, minutes, sec); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-PRAC-007.c b/semester_1/tuition-c/APC-PRAC-007.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* WAP that accept basic salary of an employee and display gross salary, net salary generated by below formula. DA = 25% of the basic salary. @@ -28,4 +22,4 @@ int main() "\nNet Salary : %g", gs, ns); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-PRAC-008.c b/semester_1/tuition-c/APC-PRAC-008.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* WAP to multiply and divide a number by 4 without using multiplication and division operator. */ @@ -19,4 +13,4 @@ int main() "\nDivision : %d", multi, div); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-PRAC-009.c b/semester_1/tuition-c/APC-PRAC-009.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* WAP to swap two integer variable without using Third variable. */ #include <stdio.h> @@ -16,4 +10,4 @@ int main() a = a ^ b; printf("\nAfter swap : A = %d and B = %d", a, b); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-PRAC-010.c b/semester_1/tuition-c/APC-PRAC-010.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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. @@ -19,4 +13,4 @@ int main() result = (1 / pow(a, 3)) + (1 / pow((b + 2), 3)) + (1 / (pow(c, 4) + sqrt(2))); printf("\nResult = %g", result); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-PRAC-011.c b/semester_1/tuition-c/APC-PRAC-011.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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 */ @@ -29,4 +23,4 @@ int main() else printf("\nInput %d is not a perfect square number.", num); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-PRAC-012.c b/semester_1/tuition-c/APC-PRAC-012.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to input three integer and find out second largest */ #include <stdio.h> @@ -21,4 +15,4 @@ int main() secondLargest = c; printf("\nSecond Largest : %d", secondLargest); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-PRAC-013.c b/semester_1/tuition-c/APC-PRAC-013.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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 */ @@ -34,4 +28,4 @@ int main() printf("\nYou entered a wrong choice."); return 1; } -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-PRAC-014.c b/semester_1/tuition-c/APC-PRAC-014.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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 @@ -37,4 +31,4 @@ int main() si = (p * t * r) / 100; printf("\nMaturity Amount : %d", si + p); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-PRAC-015.c b/semester_1/tuition-c/APC-PRAC-015.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to display all numbers between lb (lower bound) and up (upper bound) which ends with digit 7 or divisible by 7. */ // File Name - amit0611202501.c (LAB), APC-PRAC-015.c (Local) @@ -36,4 +30,4 @@ int main() } } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-PRAC-016.c b/semester_1/tuition-c/APC-PRAC-016.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to check palindrome number. */ // File Name - amit0611202502.c (LAB), APC-PRAC-016.c (Local) @@ -29,4 +23,4 @@ int main() else printf("\nInput %d is not a palindrome number.", num); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-PRAC-017.c b/semester_1/tuition-c/APC-PRAC-017.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to check perfect number. */ // File Name - amit0611202503.c (LAB), APC-PRAC-017.c (Local) @@ -30,4 +24,4 @@ int main() else printf("\nInput %d is NOT a Perfect Number.", num); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-PRAC-018.c b/semester_1/tuition-c/APC-PRAC-018.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to check Automorphic Number. */ // File Name - amit0611202504.c (LAB), APC-PRAC-018.c (Local) @@ -33,4 +27,4 @@ int main() else printf("\nInput %d is a Automorphic Number.", num); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-PRAC-019.c b/semester_1/tuition-c/APC-PRAC-019.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to find hcf of two numbers */ // File Name - amit0711202501.c (LAB), APC-PRAC-019.c (Local) @@ -27,4 +21,4 @@ int main() } printf("\nHCF of %d and %d is : %d\n", temp_a, temp_b, a); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-PRAC-020.c b/semester_1/tuition-c/APC-PRAC-020.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to check if two number is co-prime or not */ // File Name - amit0711202502.c (LAB), APC-PRAC-020.c (Local) @@ -30,4 +24,4 @@ int main() else printf("\n%d and %d is NOT co-prime\n", temp_a, temp_b); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-PRAC-021.c b/semester_1/tuition-c/APC-PRAC-021.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to check special number (sum of digit + product of digit = original number) */ // File Name - amit0711202503.c (LAB), APC-PRAC-021.c (Local) @@ -31,4 +25,4 @@ int main() else printf("\nInput %d is not a special number.", num); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-PRAC-022.c b/semester_1/tuition-c/APC-PRAC-022.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program to accept a number and check whether the number is twisted prime or not */ // File Name - amit0711202504.c (LAB), APC-PRAC-022.c (Local) @@ -57,4 +50,4 @@ int main() else printf("\nInput %d is not a twisted prime number.", num); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-PRAC-023.c b/semester_1/tuition-c/APC-PRAC-023.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Pattern : (a) 1, -3, 5, -7, 9, -11, ... upto n times (b) 0, 3, 8, 15, ... upto n times @@ -46,4 +39,4 @@ int main() printf(" %d", temp); } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-PRAC-024.c b/semester_1/tuition-c/APC-PRAC-024.c @@ -1,10 +1,4 @@ /* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - -/* Pattern: 1 2 1 diff --git a/semester_1/tuition-c/APC-PRAC-025.c b/semester_1/tuition-c/APC-PRAC-025.c @@ -1,10 +1,4 @@ /* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - -/* Pattern: 5 4 3 2 1 5 4 3 2 diff --git a/semester_1/tuition-c/APC-PRAC-026.c b/semester_1/tuition-c/APC-PRAC-026.c @@ -1,10 +1,4 @@ /* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - -/* Pattern: 5 5 4 diff --git a/semester_1/tuition-c/APC-PRAC-027.c b/semester_1/tuition-c/APC-PRAC-027.c @@ -1,10 +1,4 @@ /* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - -/* Pattern: 1 2 3 4 5 2 3 4 5 diff --git a/semester_1/tuition-c/APC-PRAC-028.c b/semester_1/tuition-c/APC-PRAC-028.c @@ -1,10 +1,4 @@ /* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - -/* Pattern: 1 2 3 diff --git a/semester_1/tuition-c/APC-PRAC-029.c b/semester_1/tuition-c/APC-PRAC-029.c @@ -1,10 +1,4 @@ /* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - -/* Pattern: 1 1 0 diff --git a/semester_1/tuition-c/APC-PRAC-030.c b/semester_1/tuition-c/APC-PRAC-030.c @@ -1,10 +1,4 @@ /* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - -/* Pattern: # @ @ diff --git a/semester_1/tuition-c/APC-PRAC-031.c b/semester_1/tuition-c/APC-PRAC-031.c @@ -1,10 +1,4 @@ /* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - -/* Pattern: 1 2 3 4 5 6 7 8 9 diff --git a/semester_1/tuition-c/APC-PRAC-032.c b/semester_1/tuition-c/APC-PRAC-032.c @@ -1,10 +1,4 @@ /* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - -/* Pattern: A B B diff --git a/semester_1/tuition-c/APC-PRAC-033.c b/semester_1/tuition-c/APC-PRAC-033.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Print the factorial of the digits off a number */ /* Auhtor: Amit Dutta, Date: 20-11-2025 */ @@ -40,4 +34,4 @@ int main() temp /= 10; } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-PRAC-034.c b/semester_1/tuition-c/APC-PRAC-034.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Take a Range as input from user and print the prime number between it. */ /* Auhtor: Amit Dutta, Date: 20-11-2025 */ @@ -41,4 +35,4 @@ int main() if (isPrime(i)) printf("%d ", i); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-PRAC-035.c b/semester_1/tuition-c/APC-PRAC-035.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Print all the 3 and 4 digit palindrome number. */ /* Auhtor: Amit Dutta, Date: 20-11-2025 */ @@ -37,4 +31,4 @@ int main() if (palindromeCheck(i)) printf("%d ", i); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-PRAC-036.c b/semester_1/tuition-c/APC-PRAC-036.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Check krishnamurty number. */ /* Auhtor: Amit Dutta, Date: 20-11-2025 */ @@ -49,4 +42,4 @@ int main() else printf("\ninput %d is not a Krishnamurty number.", n); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-PRAC-037.c b/semester_1/tuition-c/APC-PRAC-037.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Show all the armstrong number between a range. */ /* Author: Amit Dutta, Date: 21-11-2025 */ @@ -49,4 +42,4 @@ int main() } printf("\n\nCount: %d\n", count); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-PRAC-038.c b/semester_1/tuition-c/APC-PRAC-038.c @@ -1,10 +1,4 @@ /* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - -/* 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. */ @@ -35,4 +29,4 @@ int main() } printf("\nCount: %d\n", count); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-PRAC-039.c b/semester_1/tuition-c/APC-PRAC-039.c @@ -1,10 +1,4 @@ /* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - -/* 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) */ @@ -38,4 +32,4 @@ int main() } printf("\n\nCount: %d\n", count); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-PRAC-040.c b/semester_1/tuition-c/APC-PRAC-040.c @@ -1,10 +1,4 @@ /* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - -/* Write a C program to count how many numbers between 100 and 999 have all distinct digits (e.g., 123, 709, 981). */ /* Author: Amit Dutta, Date: 21-11-2025 */ @@ -32,4 +26,4 @@ int main() } printf("\nCount: %d\n", count); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-PRAC-041.c b/semester_1/tuition-c/APC-PRAC-041.c @@ -1,11 +1,4 @@ /* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - -/* 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) */ @@ -52,4 +45,4 @@ int main() } printf("\nCount; %d", count); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-PRAC-042.c b/semester_1/tuition-c/APC-PRAC-042.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a function to check whether a given string is a palindrome. Use this function to determine whether an entered string is Palindrome. */ @@ -63,4 +56,4 @@ int isPalindrome(char str[]) } return 1; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-S-001.c b/semester_1/tuition-c/APC-S-001.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - #include<stdio.h> int main() { int a = 9, b = 4, c; diff --git a/semester_1/tuition-c/APC-S-002.c b/semester_1/tuition-c/APC-S-002.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - #include<stdio.h> int main() { int a = 5, b = 5, c = 10; diff --git a/semester_1/tuition-c/APC-S-003.c b/semester_1/tuition-c/APC-S-003.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - #include <stdio.h> int main() { int a = 5, b = 5, c = 10, result; diff --git a/semester_1/tuition-c/APC-S-004.c b/semester_1/tuition-c/APC-S-004.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Program to print first 10 natural numbers using while loop. */ /* @@ -28,4 +22,4 @@ void main() x++; } getch(); -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-S-005.c b/semester_1/tuition-c/APC-S-005.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write to reverse a number. */ /* @@ -31,4 +25,4 @@ void main() } printf("Reversed Number : %d", reverse); getch(); -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-S-006.c b/semester_1/tuition-c/APC-S-006.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to print first 10 multiple of 5 */ /* @@ -28,4 +22,4 @@ void main() i++; } getch(); -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-S-007.c b/semester_1/tuition-c/APC-S-007.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program the sum of first 10 natural numbers. */ /* @@ -27,4 +21,4 @@ void main() } printf("\nSum of the first natural number : %d", sum); getch(); -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-S-008.c b/semester_1/tuition-c/APC-S-008.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program to print the sum of two matrix as input given by the user. */ /* Author: Amit Dutta, Date: 18-11-2025 */ @@ -61,4 +54,4 @@ int main() } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-S-009.c b/semester_1/tuition-c/APC-S-009.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program to find the upper and lower triangular matrix. */ /* Author: Amit Dutta, Date: 18-11-2025 */ @@ -66,4 +59,4 @@ int main() } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-S-010.c b/semester_1/tuition-c/APC-S-010.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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 */ @@ -41,4 +35,4 @@ int main() printf("%d ", b[i]); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-S-011.c b/semester_1/tuition-c/APC-S-011.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Linear search */ /* Author: Amit Dutta, Date: 19-11-2025 */ @@ -34,4 +28,4 @@ int main() } printf("\nKey Element %d is not found.", keyElement); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-S-012.c b/semester_1/tuition-c/APC-S-012.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to check if a matrix is a sparx matrix. */ /* Author: Amit Dutta, Date: 19-11-2025 */ @@ -40,4 +34,4 @@ int main() else printf("\nEntered matrix is not a Sparx Matrix"); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-S-013.c b/semester_1/tuition-c/APC-S-013.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a fuction to calculate the average of an array */ /* Author: Amit Dutta, Date: 26-11-2025 */ diff --git a/semester_1/tuition-c/APC-S-014.c b/semester_1/tuition-c/APC-S-014.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 14 Jan 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to store roll no, name and marks of 5 students then print it. use structure */ #include <stdio.h> @@ -37,4 +31,4 @@ int main() printf("%-10d %-20s %-10.2f\n", s[i].roll_no, s[i].name, s[i].marks); } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/APC-SPS-001.c b/semester_1/tuition-c/APC-SPS-001.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - // WAP to perform arithmatic operation on integer data #include<stdio.h> diff --git a/semester_1/tuition-c/APC-SPS-002.c b/semester_1/tuition-c/APC-SPS-002.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* WAP to swap two integers. Display both numbers before and after swap */ diff --git a/semester_1/tuition-c/APC-SPS-003.c b/semester_1/tuition-c/APC-SPS-003.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Bitwise AND '&' */ #include<stdio.h> diff --git a/semester_1/tuition-c/APC-SPS-004.c b/semester_1/tuition-c/APC-SPS-004.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - #include<stdio.h> int main() { int x = 25, y = 19, z; diff --git a/semester_1/tuition-c/APC-SPS-005.c b/semester_1/tuition-c/APC-SPS-005.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Bitwise OR '|' */ #include<stdio.h> diff --git a/semester_1/tuition-c/APC-SPS-006.c b/semester_1/tuition-c/APC-SPS-006.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Bitwise NOT '~' */ #include<stdio.h> diff --git a/semester_1/tuition-c/APC-SPS-007.c b/semester_1/tuition-c/APC-SPS-007.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* WAP to check a number is even or odd using bitwise operator */ #include<stdio.h> diff --git a/semester_1/tuition-c/APC-SPS-008.c b/semester_1/tuition-c/APC-SPS-008.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* WAP to calculate area of circle by accepting radius as input */ /* Author : Amit Dutta, Date : 15th September, 2025 */ diff --git a/semester_1/tuition-c/P001.c b/semester_1/tuition-c/P001.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - //sample code #include<stdio.h> diff --git a/semester_1/tuition-c/P002.c b/semester_1/tuition-c/P002.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - //sample code with a new line charecter #include<stdio.h> diff --git a/semester_1/tuition-c/P003.c b/semester_1/tuition-c/P003.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - //WAP to perform addtion and multiplication of two integer numbers #include<stdio.h> diff --git a/semester_1/tuition-c/P004.c b/semester_1/tuition-c/P004.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* WAP to find and display the value of given expression : ((x+3)/4) - ((2x+4)/3) taking the value of x = 5 */ diff --git a/semester_1/tuition-c/P005.c b/semester_1/tuition-c/P005.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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. */ diff --git a/semester_1/tuition-c/P006.c b/semester_1/tuition-c/P006.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* The normal temperature of human body is 98.6 Degree Fahrenheit. WAP to convert the temperature to Degree Celcius and display the output. */ diff --git a/semester_1/tuition-c/P007.c b/semester_1/tuition-c/P007.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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 diff --git a/semester_1/tuition-c/P008.c b/semester_1/tuition-c/P008.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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. diff --git a/semester_1/tuition-c/P009.c b/semester_1/tuition-c/P009.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* WAP to calculate gross and net salary by accepting basic salary as input. IMP : DA = 30% of Basic Pay diff --git a/semester_1/tuition-c/P010.c b/semester_1/tuition-c/P010.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* WAP to find and display the difference between compound Interest and Simple Interest. Take principle amount as input. diff --git a/semester_1/tuition-c/P011.c b/semester_1/tuition-c/P011.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* The time period of a simple pendulam is given by the formula : t = 2 * pi * square_root(l / g) diff --git a/semester_1/tuition-c/P012.c b/semester_1/tuition-c/P012.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* WAP to swap two integer variable without using third variable */ // using Approch Mode : simple, slow, time consuming diff --git a/semester_1/tuition-c/P013.c b/semester_1/tuition-c/P013.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* WAP to swap two integer variable without using third variable */ // using Approch Mode : complex, fast, less time consumimg diff --git a/semester_1/tuition-c/P014.c b/semester_1/tuition-c/P014.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* WAP to accept the diagonal of square. Find and display the area and perimeter of the square. */ diff --git a/semester_1/tuition-c/P015.c b/semester_1/tuition-c/P015.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /*WAP to accept number of days and display it after converting into number of years, months and days */ diff --git a/semester_1/tuition-c/P016.c b/semester_1/tuition-c/P016.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* WAP to calculate and display radius of a circle by taking the area as input */ diff --git a/semester_1/tuition-c/P017.c b/semester_1/tuition-c/P017.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Find maximum between three number. */ #include <stdio.h> @@ -19,4 +13,4 @@ int main() max = c; printf("Maximum : %d", max); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P018.c b/semester_1/tuition-c/P018.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* WAP to input the cost price and selling price and calculate profit, profit percentage, loss percentage or display the manage nither profit nor loss. */ @@ -29,4 +23,4 @@ int main() else printf("Neither loss nor Profit."); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P019.c b/semester_1/tuition-c/P019.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* WAP to input the distance covered and calculate the amount to be paid by the passanger. Distance Rate @@ -29,4 +23,4 @@ int main() amt = 90.0 + 200.0 + 100.0 + (dis - 25.0) * 9; printf("\nAmount to be paid : %g", amt); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P020.c b/semester_1/tuition-c/P020.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* WAP to calculate and display the maturity amount taking the sum and number of days as input. No. of Days Rate of Interest @@ -30,4 +24,4 @@ int main() amt = s + i; printf("Amount to be paid : %g", amt); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P021.c b/semester_1/tuition-c/P021.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* WAP to input a positive number and check if it is a perfect square number or not. */ // This code has not been compiled. @@ -24,4 +18,4 @@ int main() else printf("\nThis is not a perfect square."); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P022.c b/semester_1/tuition-c/P022.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* WAP to find out smallest of three numbers without using if_else block. */ // This code has not been compiled. // If you find any issues, please create a new issue on GitHub regarding them. @@ -18,4 +12,4 @@ int main() : c; printf("Minimum = %d", min); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P023.c b/semester_1/tuition-c/P023.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* WAP to input the total cost and compute the amount to be paid by the customer. */ // This code has not been compiled. @@ -25,4 +19,4 @@ int main() amt = cost * 0.8; printf("\nAmount to be paid : %g", amt); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P024.c b/semester_1/tuition-c/P024.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* WAP to check whether a year is leapyear or not. */ // This code has not been compiled. // If you find any issues, please create a new issue on GitHub regarding them. @@ -21,4 +15,4 @@ int main() else printf("\nYear %d is not a leapyear.", year); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P025.c b/semester_1/tuition-c/P025.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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 @@ -32,4 +26,4 @@ int main() amt = amt * 1.20; printf("\nAmount to be paid : %g", amt); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P026.c b/semester_1/tuition-c/P026.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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 @@ -38,4 +32,4 @@ int main() return 1; } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P027.c b/semester_1/tuition-c/P027.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Purchase Discount on Discount on Amount Laptop Desktop -------- ----------- ----------- @@ -70,4 +63,4 @@ int main() return 1; } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P028.c b/semester_1/tuition-c/P028.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* WAP to calculate factorial of a number */ #include <stdio.h> @@ -33,4 +27,4 @@ int main() } printf("Factorial of %d : %d", num, fact); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P029.c b/semester_1/tuition-c/P029.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* WAP to perform addition of first n natural numbers. sum = 1 + 2 + 3 + ... */ #include <stdio.h> @@ -28,4 +22,4 @@ int main() } printf("\nResult : %d", result); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P030.c b/semester_1/tuition-c/P030.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Display the first 15 terms of the series. */ #include <stdio.h> diff --git a/semester_1/tuition-c/P031.c b/semester_1/tuition-c/P031.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Find the sum of the series */ #include <stdio.h> @@ -43,4 +37,4 @@ int main() } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P032.c b/semester_1/tuition-c/P032.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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*/ @@ -24,4 +18,4 @@ int main() else printf("\nIt is not a Niven number."); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P033.c b/semester_1/tuition-c/P033.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* WAP to calculate the sum of even digits and odd digits. Number will be provided by user. */ #include <stdio.h> @@ -25,4 +19,4 @@ int main() "\nSum of odd : %d", even, odd); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P034.c b/semester_1/tuition-c/P034.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Get sum of even position digit and odd position digit */ /* Counting starts from the rightmost digit as position 1 (Odd). */ @@ -27,4 +21,4 @@ int main() "\nSum of odd position digits : %d", even, odd); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P035.c b/semester_1/tuition-c/P035.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* WAP to input an int number and display the product of the successors of even digits of the number entered by user. */ @@ -30,4 +24,4 @@ int main() else printf("\nThe product of the successors of even digits of the number %d is : %d", n, res); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P036.c b/semester_1/tuition-c/P036.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* sum = a + (a^2)/2 + (a^3)/3 + ... + (a^n)/n */ #include <stdio.h> @@ -19,4 +13,4 @@ int main() sum += pow(a, i) / i; printf("\nSum = %g", sum); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P037.c b/semester_1/tuition-c/P037.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* sum = 1 + 1+2/1*2 + 1+2+3/1*2*3 + ... + 1+2+3+...+n/1*2*3*...*n */ #include <stdio.h> @@ -22,4 +16,4 @@ int main() } printf("\nSum = %g", sum); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P038.c b/semester_1/tuition-c/P038.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program to check prime number */ #include <stdio.h> @@ -59,4 +52,4 @@ int main() printf("\nInput %d is a prime number.", num); } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P039.c b/semester_1/tuition-c/P039.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to print all the factors of a postive integer */ #include <stdio.h> @@ -22,4 +16,4 @@ int main() } } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P040.c b/semester_1/tuition-c/P040.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to calculate HCF of two positive number */ #include <stdio.h> @@ -20,4 +14,4 @@ int main() } printf("HCF = %d", a); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P041.c b/semester_1/tuition-c/P041.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to enter two numbers and check they are co-prime or not. co-prime when HCF = 1 */ @@ -31,4 +25,4 @@ int main() printf("\n(%d, %d) is not co-prime.", temp_a, temp_b); } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P042.c b/semester_1/tuition-c/P042.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program to accept a number and check whether the number is twisted prime or not. */ @@ -58,4 +51,4 @@ int main() printf("\n%d is non prime.", n); } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P043.c b/semester_1/tuition-c/P043.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to check palindrome number. */ #include <stdio.h> @@ -28,4 +22,4 @@ int main() printf("%d is not a palindrome number.", num); } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P044.c b/semester_1/tuition-c/P044.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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 @@ -80,4 +73,4 @@ int main() } printf("\nInput %d is not a Pronic Number.", num); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P045.c b/semester_1/tuition-c/P045.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Make this pattern for input n. Pattern : 1 @@ -29,4 +23,4 @@ int main() printf("\n"); } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P046.c b/semester_1/tuition-c/P046.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Make this pattern for input n. Pattern : 1 @@ -29,4 +23,4 @@ int main() printf("\n"); } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P047.c b/semester_1/tuition-c/P047.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Make this pattern for input n. Pattern : 5 diff --git a/semester_1/tuition-c/P048.c b/semester_1/tuition-c/P048.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Make this pattern for input n no of row. Pattern : 1 diff --git a/semester_1/tuition-c/P049.c b/semester_1/tuition-c/P049.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Make this pattern for input n no of row. Pattern : # diff --git a/semester_1/tuition-c/P050-SHORT.c b/semester_1/tuition-c/P050-SHORT.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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. */ @@ -34,4 +28,4 @@ int main() else printf(" is Not a Disarium Number."); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P050.c b/semester_1/tuition-c/P050.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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. */ @@ -38,4 +32,4 @@ int main() else printf("\nInput %d is Not a Disarium Number.", num); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P051.c b/semester_1/tuition-c/P051.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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 */ @@ -30,4 +24,4 @@ int main() else printf("\nInput %d and %d is Not Amicable Pair.", a, b); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P052.c b/semester_1/tuition-c/P052.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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) */ @@ -25,4 +19,4 @@ int main() } printf("%d", sum); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P053.c b/semester_1/tuition-c/P053.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Print all pattern */ // This code has not been compiled. @@ -160,4 +153,4 @@ int main() } return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P054.c b/semester_1/tuition-c/P054.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* WAP to check Krishnamurty number using user defined methods/functions. */ // This code has not been compiled. @@ -45,4 +38,4 @@ int main() else printf("\nInput %d is not a Krishnamurty number.", n); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P055.c b/semester_1/tuition-c/P055.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* WAP to print n terms of Fibbonacci Series (Starting from term 0) */ // This code has not been compiled. @@ -40,4 +34,4 @@ int main() scanf("%d", &n); printFibonacci(n); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P056.c b/semester_1/tuition-c/P056.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* WAP to swap the value of a and b using user defined method. */ // This code has not been compiled. @@ -28,4 +22,4 @@ int main() swap(&a, &b); printf("\nAfter swap A: %d, B: %d", a, b); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P057.c b/semester_1/tuition-c/P057.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* WAP to display the series using user defined method. 0, 7, 26, 63, ... upto n terms using void series(int n) */ @@ -29,4 +23,4 @@ int main() scanf("%d", &n); series(n); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P058.c b/semester_1/tuition-c/P058.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* WAP to display ASCII code of Alphabets (A - Z) using void displayASCII() */ // This code has not been compiled. @@ -24,4 +18,4 @@ int main() { displayASCII(); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P059.c b/semester_1/tuition-c/P059.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 12 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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); @@ -66,4 +59,4 @@ int array_sum(int a[], int n) for (i = 0; i < n; i++) sum += a[i]; return sum; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P060.c b/semester_1/tuition-c/P060.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 13 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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. */ @@ -56,4 +49,4 @@ int count_occurrences(int arr[], int n, int target) } } return count; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P061.c b/semester_1/tuition-c/P061.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 14 Dec 2025 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* 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. */ @@ -43,4 +37,4 @@ int sumEven(int arr[], int n) } } return sum_even; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P062.c b/semester_1/tuition-c/P062.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 16 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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. */ @@ -63,4 +56,4 @@ int findLargest(int arr[], int n) } } return largest; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P063.c b/semester_1/tuition-c/P063.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 16 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* 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. */ @@ -56,4 +49,4 @@ int isNiven(int num) temp /= 10; } return num % sum == 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P064.c b/semester_1/tuition-c/P064.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 21 Dec 2025 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program to merge two sorted integer arrays to form a single sorted array. */ #include <stdio.h> @@ -53,4 +46,4 @@ void merge(int a[], int n1, int b[], int n2) printf(" %d", c[i]); } free(c); -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P065.c b/semester_1/tuition-c/P065.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 12 Jan 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to reverse a string */ #include <stdio.h> @@ -37,4 +31,4 @@ void str_rev(char str[]) i++; j--; } -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P066.c b/semester_1/tuition-c/P066.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 14 Jan 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* WAP to find the length of a string using i) Library Method ii) User defined method @@ -32,4 +26,4 @@ int main() printf("Length of the string: %d", len); printf("\nLength of the string (U-D): %d", len); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P067.c b/semester_1/tuition-c/P067.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 14 Jan 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program using function which concatenates two string s1 and s2 in to a third string */ #include <stdio.h> @@ -34,4 +28,4 @@ int main() char *s3 = NULL; string_concat(s3, s1, s2); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P068.c b/semester_1/tuition-c/P068.c @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 14 Jan 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a c program that perform the operation of strcmp() */ #include <stdio.h> @@ -43,4 +37,4 @@ int main() printf("Result 1 = %d", string_compare1(str1, str2)); printf("\nResult 2 = %d", string_compare2(str1, str2)); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P069.c b/semester_1/tuition-c/P069.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 14 Jan 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program using user defined method to implement the following JAVA PROG Mastery -> JPM java prog mastery -> JPM @@ -64,4 +57,4 @@ int main() _short_1(str); _short_2(str); return 0; -}- \ No newline at end of file +} diff --git a/semester_1/tuition-c/P070.c b/semester_1/tuition-c/P070.c @@ -1,10 +1,3 @@ -/* - * Author : Amit Dutta <amitdutta4255@gmail.com> - * Date : 24 Jan 2026 - * Repo : https://github.com/notamitgamer/bsc - * License : MIT License (See the LICENSE file for details) - */ - /* Write a program to perform addition of two complex number having fields 'real' and 'img' of type integer. */ @@ -50,4 +43,4 @@ int main() printf("\nResult: \n"); display(c3); return 0; -}- \ No newline at end of file +} diff --git a/semester_2/assignments/assignment_01.cpp b/semester_2/assignments/assignment_01.cpp @@ -1,8 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ /* Write a program to implement a Diagonal Matrix a Lower Triangular Matrix, an Upper Triangular Matrix, and a Symmetric Matrix using a one-dimensional array. */ diff --git a/semester_2/assignments/assignment_02.cpp b/semester_2/assignments/assignment_02.cpp @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta <amitdutta4255@gmail.com> | Date: 12 Aug 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Linked List all operation */ #include<iostream> @@ -437,4 +431,4 @@ int main() { 0 -1 -*/- \ No newline at end of file +*/ diff --git a/semester_2/eduincs/pgrm_001.cpp b/semester_2/eduincs/pgrm_001.cpp @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 29 Jun 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* hello world */ #include<iostream> @@ -12,4 +6,4 @@ int main() { cout << "hello, world!" << endl; cout << "Now we are at void"; return 0; -}- \ No newline at end of file +} diff --git a/semester_2/eduincs/pgrm_002.cpp b/semester_2/eduincs/pgrm_002.cpp @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 29 Jun 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Taking input */ #include<iostream> @@ -14,4 +8,4 @@ int main() { cin >> n; cout << "You entered: " << n; return 0; -}- \ No newline at end of file +} diff --git a/semester_2/eduincs/pgrm_003.cpp b/semester_2/eduincs/pgrm_003.cpp @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 29 Jun 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* class - object */ #include<iostream> @@ -30,4 +24,4 @@ int main() { cout << "Name: " << p.name << endl; cout << "Age: " << p.age; return 0; -}- \ No newline at end of file +} diff --git a/semester_2/eduincs/pgrm_004.cpp b/semester_2/eduincs/pgrm_004.cpp @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 29 Jun 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to calculate area and circumference of a circle. */ #include<iostream> @@ -44,4 +38,4 @@ int main() { cout << "Area: " << c.area() << endl; cout << "Circumference: " << c.cir() << endl; return 0; -}- \ No newline at end of file +} diff --git a/semester_2/eduincs/pgrm_005.cpp b/semester_2/eduincs/pgrm_005.cpp @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta <amitdutta4255@gmail.com> | Date: 29 Jun 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program to calculate area and perimeter of a rectangle. */ #include<iostream> @@ -46,4 +40,4 @@ int main() { rec.getData(); rec.display(); return 0; -}- \ No newline at end of file +} diff --git a/semester_2/eduincs/pgrm_006.cpp b/semester_2/eduincs/pgrm_006.cpp @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta <amitdutta4255@gmail.com> | Date: 06 Jul 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program in cpp to implement linear search using private instance variable and public member methods. */ #include <iostream> @@ -56,4 +50,4 @@ int main() { cin >> key; obj.lsearch(key); return 0; -}- \ No newline at end of file +} diff --git a/semester_2/eduincs/pgrm_007.cpp b/semester_2/eduincs/pgrm_007.cpp @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta <amitdutta4255@gmail.com> | Date: 06 Jul 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Right a program to calculate sum and product of array elements. */ #include <iostream> @@ -62,4 +56,4 @@ int main() { ao.getData(); ao.display(); return 0; -}- \ No newline at end of file +} diff --git a/semester_2/eduincs/pgrm_008.cpp b/semester_2/eduincs/pgrm_008.cpp @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta <amitdutta4255@gmail.com> | Date: 06 Jul 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Function Overloading. */ #include <iostream> @@ -28,4 +22,4 @@ int main() { cout << "10 + 20 + 30 : " << obj.add(10, 20, 30) << endl; cout << "12.5 + 10.5 : " << obj.add(10.5f, 12.5f) << endl; return 0; -}- \ No newline at end of file +} diff --git a/semester_2/eduincs/pgrm_009.cpp b/semester_2/eduincs/pgrm_009.cpp @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta <amitdutta4255@gmail.com> | Date: 10 Jul 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* WAP in cpp to overload the following functions int max(int a, int b); int max(int a, int b, int c); @@ -36,4 +30,4 @@ int main() { cout << "Between 10, 20, 30: " << obj.max(10, 20, 30) << endl; cout << "Between 11.5, 10.5: " << obj.max(11.5f, 10.5f) << endl; return 0; -}- \ No newline at end of file +} diff --git a/semester_2/eduincs/pgrm_010.cpp b/semester_2/eduincs/pgrm_010.cpp @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta <amitdutta4255@gmail.com> | Date: 10 Jul 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Default argument */ #include<iostream> @@ -21,4 +15,4 @@ int main() { cout << "Principle and Time = " << obj.simpleInterest(10000, 8.0f) << endl; cout << "Principle, Time and Rate of Interest = " << obj.simpleInterest(10000, 8.0f, 5.0f) << endl; return 0; -}- \ No newline at end of file +} diff --git a/semester_2/eduincs/pgrm_011.cpp b/semester_2/eduincs/pgrm_011.cpp @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta <amitdutta4255@gmail.com> | Date: 10 Jul 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* call by value, call by address, call by reference */ #include<iostream> @@ -72,4 +66,4 @@ int main() { obj.getData(); obj.test(); return 0; -}- \ No newline at end of file +} diff --git a/semester_2/eduincs/pgrm_012.cpp b/semester_2/eduincs/pgrm_012.cpp @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta <amitdutta4255@gmail.com> | Date: 10 Jul 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Linear search in cpp */ #include<iostream> @@ -48,4 +42,4 @@ int main() { cout << "Element not found." << endl; } return 0; -}- \ No newline at end of file +} diff --git a/semester_2/eduincs/pgrm_013.cpp b/semester_2/eduincs/pgrm_013.cpp @@ -1,8 +1,3 @@ -/* - * Author: Amit Dutta <amitdutta4255@gmail.com> - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ /* in-line and non-inline functions */ #include<iostream> diff --git a/semester_2/eduincs/pgrm_014.cpp b/semester_2/eduincs/pgrm_014.cpp @@ -1,8 +1,3 @@ -/* - * Author: Amit Dutta <amitdutta4255@gmail.com> - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ /* `this` pointer */ #include<iostream> diff --git a/semester_2/eduincs/pgrm_015.cpp b/semester_2/eduincs/pgrm_015.cpp @@ -1,8 +1,3 @@ -/* - * Author: Amit Dutta <mail@amit.is-a.dev> - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ /* `friend` function */ #include<iostream> diff --git a/semester_2/eduincs/pgrm_016.cpp b/semester_2/eduincs/pgrm_016.cpp @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta <amitdutta4255@gmail.com> | Date: 07 Aug 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a program in c++ to implement stack using a class stack with number variables, functions, constructor, destructor. */ #include<iostream> @@ -89,4 +83,4 @@ int main() { cout << "\nPopped element is: " << obj.pop(); cout << "\nPopped element is: " << obj.pop(); // trying to underflow return 0; -}- \ No newline at end of file +} diff --git a/semester_2/eduincs/pgrm_017.cpp b/semester_2/eduincs/pgrm_017.cpp @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta <amitdutta4255@gmail.com> | Date: 25 Aug 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Copy Constructor */ #include<iostream> diff --git a/semester_2/practice/prac_001.cpp b/semester_2/practice/prac_001.cpp @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 18 Jun 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Trying to remember after a year. */ #include <iostream> @@ -20,4 +14,4 @@ int main() { cout << endl; return 0; -}- \ No newline at end of file +} diff --git a/semester_2/practice/prac_002.cpp b/semester_2/practice/prac_002.cpp @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 22 Jun 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* design a class circle.take radius as input, calculate the area */ #include <iostream> @@ -37,4 +31,4 @@ int main() { z.calculation(); z.output(); return 0; -}- \ No newline at end of file +} diff --git a/semester_2/practice/prac_003.cpp b/semester_2/practice/prac_003.cpp @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 22 Jun 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Addition of two inputs */ #include <iostream> @@ -39,4 +33,4 @@ int main() { z.calculation(); z.output(); return 0; -}- \ No newline at end of file +} diff --git a/semester_2/practice/prac_004.cpp b/semester_2/practice/prac_004.cpp @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 22 Jun 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* check even or odd */ #include <iostream> @@ -38,4 +32,4 @@ int main() { a.input(); a.calcdisp(); return 0; -}- \ No newline at end of file +} diff --git a/semester_2/practice/prac_005.cpp b/semester_2/practice/prac_005.cpp @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 22 Jun 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* check prime or not */ #include <iostream> @@ -42,4 +36,4 @@ int main() { z.getinput(); z.calcdisp(); return 0; -}- \ No newline at end of file +} diff --git a/semester_2/practice/prac_006.cpp b/semester_2/practice/prac_006.cpp @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 22 Jun 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* factorial */ #include <iostream> @@ -40,4 +34,4 @@ int main() { z.calc(); z.diplay(); return 0; -}- \ No newline at end of file +} diff --git a/semester_2/practice/prac_007.cpp b/semester_2/practice/prac_007.cpp @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 22 Jun 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* sum of natural numbers upto n */ #include <iostream> @@ -39,4 +33,4 @@ int main() { z.calc(); z.output(); return 0; -}- \ No newline at end of file +} diff --git a/semester_2/practice/prac_008.cpp b/semester_2/practice/prac_008.cpp @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 22 Jun 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* number reverse */ #include <iostream> @@ -37,4 +31,4 @@ int main() { z.input(); z.calc(); return 0; -}- \ No newline at end of file +} diff --git a/semester_2/practice/prac_009.cpp b/semester_2/practice/prac_009.cpp @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 22 Jun 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* sum of digits */ #include <iostream> @@ -41,4 +35,4 @@ int main() { z.calc(); z.output(); return 0; -}- \ No newline at end of file +} diff --git a/semester_2/practice/prac_010.cpp b/semester_2/practice/prac_010.cpp @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 22 Jun 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* check odd or even */ #include <iostream> @@ -39,4 +33,4 @@ int main() { a.input(); a.calcdisp(); return 0; -}- \ No newline at end of file +} diff --git a/semester_2/practice/prac_011.cpp b/semester_2/practice/prac_011.cpp @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 22 Jun 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* average of elements */ #include <iostream> @@ -53,4 +47,4 @@ int main() { z.calculation(); z.output(); return 0; -}- \ No newline at end of file +} diff --git a/semester_2/practice/prac_012.cpp b/semester_2/practice/prac_012.cpp @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 22 Jun 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* factorial using loop */ #include <iostream> @@ -39,4 +33,4 @@ int main() { z.calc(); z.output(); return 0; -}- \ No newline at end of file +} diff --git a/semester_2/python/code_01.py b/semester_2/python/code_01.py @@ -1,7 +1,3 @@ -# 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? ")) @@ -16,4 +12,4 @@ for i in range(n): odd_count += 1 print("Even numbers:", even_count) -print("Odd numbers:", odd_count)- \ No newline at end of file +print("Odd numbers:", odd_count) diff --git a/semester_2/tuition/apc_001.cpp b/semester_2/tuition/apc_001.cpp @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta (amitdutta4255@gmail.com) | Date: 18 Jun 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Tring to remember after a year. */ #include <iostream> @@ -21,4 +15,4 @@ int main() { cout << "Total numbers entered: " << count << endl; return 0; -}- \ No newline at end of file +} diff --git a/semester_2/tuition/apc_002.cpp b/semester_2/tuition/apc_002.cpp @@ -1,9 +1,3 @@ -/* - * Author: Amit Dutta <amitdutta4255@gmail.com> | Date: 01 Aug 2026 - * Repo: https://github.com/notamitgamer/bsc - * License: MIT - */ - /* Write a C++ program to add two polynomial equations and display the resultant polynomial. */ #include<iostream> @@ -160,4 +154,4 @@ int main() { mains obj; obj.doAll(); return 0; -}- \ No newline at end of file +} diff --git a/utils/bsc_md/builders.py b/utils/bsc_md/builders.py @@ -1,5 +1,5 @@ from .config import ALGO_ICON_SVG, FILE_ICON_SVG -from .formatting import esc_yaml, esc_html, format_author_html, format_tags_yaml +from .formatting import esc_yaml, esc_html, format_tags_yaml def build_algo_md(filename_base, title, problem_statement, body_lines, source_path="", tags=None): @@ -54,7 +54,7 @@ def build_algo_md(filename_base, title, problem_statement, body_lines, source_pa return "\n".join(fm + body) -def build_md(filename, lang_label, fence_lang, author, date, repo, license_str, +def build_md(filename, lang_label, fence_lang, problem_statement, code, rel_url, tags=None): desc = problem_statement if problem_statement else f"{lang_label} program — {filename}" @@ -95,17 +95,4 @@ def build_md(filename, lang_label, fence_lang, author, date, repo, license_str, "", ] - meta_parts = [] - if author: - meta_parts.append(f"● Author - {format_author_html(author)}") - if date: - meta_parts.append(f"Updated - {esc_html(date)}") - - if meta_parts: - body += [ - f'<div style="font-size:0.8rem;color:var(--vp-c-text-3);margin-bottom:16px;">' - f'{" · ".join(meta_parts)}</div>', - "", - ] - return '\n'.join(fm_lines + body) diff --git a/utils/bsc_md/formatting.py b/utils/bsc_md/formatting.py @@ -42,23 +42,3 @@ def format_tags_yaml(tags: list) -> str: def esc_html(s: str) -> str: """Escape characters that break Vue template compilation in VitePress.""" return s.replace('&', '&').replace('<', '<').replace('>', '>') - -def format_author(author: str) -> str: - """Return a mailto markdown link if the author string contains an email. - Handles both 'Name <email>' and 'Name (email)' formats.""" - m = re.search(r'(.*?)\s*[<(]([^<>()]+@[^<>()]+)[>)]', author) - if m: - name = esc_html(m.group(1).strip()) - email = esc_html(m.group(2).strip()) - return f"[{name}](mailto:{email})" - return esc_html(author) - -def format_author_html(author: str) -> str: - """Return an HTML <a> mailto link if the author string contains an email. - Handles both 'Name <email>' and 'Name (email)' formats.""" - m = re.search(r'(.*?)\s*[<(]([^<>()]+@[^<>()]+)[>)]', author) - if m: - name = esc_html(m.group(1).strip()) - email = esc_html(m.group(2).strip()) - return f'<a href="mailto:{email}" style="color:var(--vp-c-text-3);">{name}</a>' - return esc_html(author) diff --git a/utils/bsc_md/parsers.py b/utils/bsc_md/parsers.py @@ -34,26 +34,7 @@ def parse_c_style(content): lines = content.splitlines() n = len(lines) i = 0 - author = date = repo = license_str = problem_statement = "" - - while i < n and not lines[i].strip(): - i += 1 - - # Extract metadata block - if i < n and lines[i].strip().startswith('/*'): - block, i = read_block_comment(lines, i) - for line in block: - # Handles both newline-per-field and pipe-separated formats - parts = [p.strip() for p in line.split('|')] - for part in parts: - if ':' in part: - key, _, val = part.partition(':') - key = key.strip().lower() - val = val.strip() - if 'author' in key: author = val - elif 'date' in key: date = val - elif 'repo' in key: repo = val - elif 'license' in key: license_str = val + problem_statement = "" while i < n and not lines[i].strip(): i += 1 @@ -75,34 +56,14 @@ def parse_c_style(content): break code = '\n'.join(lines[code_start:]).strip() if code_start is not None else content.strip() - return author, date, repo, license_str, problem_statement, code + return problem_statement, code def parse_hash_style(content): lines = content.splitlines() n = len(lines) i = 0 - author = date = repo = license_str = problem_statement = "" - - while i < n and not lines[i].strip(): - i += 1 - - # Extract metadata block - meta_lines = [] - while i < n and lines[i].strip().startswith('#'): - meta_lines.append(lines[i].strip()[1:].strip()) - i += 1 - - for raw_line in meta_lines: - for part in raw_line.split('|'): - if ':' in part: - key, _, val = part.partition(':') - key = key.strip().lower() - val = val.strip() - if 'author' in key: author = val - elif 'date' in key: date = val - elif 'repo' in key: repo = val - elif 'license' in key: license_str = val + problem_statement = "" while i < n and not lines[i].strip(): i += 1 @@ -119,7 +80,7 @@ def parse_hash_style(content): problem_statement = ' '.join(ps_lines).strip() code = content.strip() - return author, date, repo, license_str, problem_statement, code + return problem_statement, code def parse_algo_md(content): diff --git a/utils/bsc_md/pipeline.py b/utils/bsc_md/pipeline.py @@ -91,13 +91,13 @@ def run(): filename = os.path.basename(full_path) if lang_info['style'] == 'c': - author, date, repo, license_str, problem_statement, code = parse_c_style(content) + problem_statement, code = parse_c_style(content) else: - author, date, repo, license_str, problem_statement, code = parse_hash_style(content) + problem_statement, code = parse_hash_style(content) file_tags = derive_tags(rel_path, lang_info['label']) md_content = build_md( - filename, lang_info['label'], lang_info['fence'], author, date, repo, license_str, + filename, lang_info['label'], lang_info['fence'], problem_statement, code, rel_url, file_tags, ) diff --git a/utils/deploy_pipeline.py b/utils/deploy_pipeline.py @@ -1,9 +1,3 @@ -# Author : Amit Dutta <amitdutta4255@gmail.com> -# Date : 06 Feb 2026 -# Repo : https://github.com/notamitgamer/bsc -# License : MIT License (See the LICENSE file for details) -# Copyright (c) 2026 Amit Dutta - import os import subprocess import shutil @@ -306,4 +300,4 @@ def main(): print("\n=== PIPELINE FINISHED ===") if __name__ == "__main__": - main()- \ No newline at end of file + main()