C#

  • C/C++ Program for First Come First Served (FCFS) Scheduling Algorithm
    Here you will get a C/C++ program for first start things out served (fcfs) booking calculation. What is First Come First Served (FCFS) Scheduling Algorithm? First Come First Served (FCFS) is a Non-Preemptive planning calculation. FIFO (First In First Out) technique doles out the need to process in the request in which they demand the processor. The ...
  • C/C++ Program for Priority Scheduling Algorithm
    Here you will get a C and C++ program for need planning calculation. What is Priority Scheduling Algorithm? In need booking calculation each procedure has a need related with it and as each procedure hits the line, it is put away independent on its need so process with higher need is managed first. It ought to be noticed ...
  • C/C++ Program to Read Infinite Numbers and Arrange Them in Ascending Order
    In this program, we are perusing unbounded numbers and afterwards masterminding them in the climbing request. Here vast methods, the program should peruse numbers until a specific number is entered to end the understanding procedure. For our situation we are utilizing – 1 to stop the understanding procedure. As we as of now don’t have the foggiest ...
  • Doubly Linked List in C and C++
    In this instructional exercise, you will find out about the doubly linked list in C and C++. In an independently linked list, we can move/cross just one single way on the grounds that every hub has the location of the following hub as it were. Assume we are in the linked list and we need the ...
  • C/C++ Program to Find GCD of Two Numbers Using Recursion
    Series 0, 1, 1, 2, 3, 5, 8, 13, 21 . . . . . . . is a Fibonacci series. In Fibonacci series, each term is the sum of the two going before terms. The C and C++ program for Fibonacci series utilizing recursion is given beneath. C Program #include<stdio.h> int gcd(int n,int m) { ...
  • C/C++ Program for Fibonacci Series Using Recursion
    Series 0, 1, 1, 2, 3, 5, 8, 13, 21 . . . . . . . is a Fibonacci series. In Fibonacci series, each term is the sum of the two going before terms. The C and C++ program for Fibonacci series utilizing recursion is given beneath. C Program #include<stdio.h> int fibonacci(int n) { ...
  • Permutation of String in C and C++
    Here you will get the program for the stage of string in C and C++. Stage implies every conceivable plan of a given arrangement of numbers or characters. For a string with n characters can have complete n! courses of action. https://youtu.be/AfxHGNRtFac Program for Permutation of String in C #include <stdio.h> #include <string.h> void swap(char *x, char *y) { ...
  • C/C++ Program to Remove Spaces From String
    C Program- #include<stdio.h> int main() { int i,j=0; char str[30]; printf("Enter a String:\n"); gets(str); for(i=0;str[i]!='\0';++i) { if(str[i]!=' ') str[j++]=str[i]; } str[j]='\0'; printf("\nString After Removing Spaces:\n%s",str); return 0; } C++ Program- #include<iostream> #include<stdio.h> using namespace std; int main() { int i,j=0; char str[30]; cout<<"Enter a String:\n"; gets(str); for(i=0;str[i]!='\0';++i) { if(str[i]!=' ') str[j++]=str[i]; } str[j]='\0'; cout<<"\nString After Removing Spaces:\n"<<str; return 0; } Output- Enter a String: i am a gamer String After Removing Spaces: iamagamer
  • C/C++ Program to Find Substring in String (Pattern Matching)
    Here you will get a C and C++ program to discover substring in a string. Example coordinating alludes to discover the position where a string design shows up in a given string. On the off chance that the necessary string is absent in given content, at that point it restores the worth zero. In the ...
  • Program for Quick Sort in C++
    Quick Sort is one of the most productive sorting calculation whose best, most noticeably terrible and normal case time complexities are O (n log n), O (n2) and O (n log n) individually. How does it function? We first pick a turn component. There are different approaches to pick a turn component. Pick the first ...
error: Alert: Content is protected!!