Skip to content

Instantly share code, notes, and snippets.

View Rajssss's full-sized avatar
🎯
Writing Drivers

Rajesh Kumbhakar Rajssss

🎯
Writing Drivers
View GitHub Profile
@Rajssss
Rajssss / grade.c
Created February 12, 2019 02:54
grade.c
#include <stdio.h>
int main()
{
float phy,chem,math,a;
char c,g;
printf("\nEnter choice \n\t1.If_Else\n\t2.Switch_case\n\t=>");
scanf("%c",&c);
#include<stdio.h>
int main()
{
int a;
printf("\nEnter year=>");
scanf("%d",&a);
(a%100==0)?(a%400==0?printf("\nLeap\n"):printf("\nNot Leap\n")):(a%4==0?printf("\nLeap\n"):printf("\nNot Leap\n"));
}
#include<stdio.h>
#include"multiIO.h"
int main()
{
i2no();
printf("\nSo two No. are=>%f %f",a[0],b[1]);
return 0;
}
float product(float x, float y)
{
static float product;
product=x*y;
printf("\nProduct=%f",product);
}
float root(float x, float y, float z)
{
static float D;
#include<stdio.h>
int main()
{
int x, y;
printf("Enter 5 digit No. =>");
scanf("%d", &x);
printf("Reverse of the No. %d is =>", x);
#include <stdio.h>
#include <stdlib.h>
#include <ctype.h>
#include <string.h>
typedef struct student
{
int roll;
float marks;
char Name[25];
char Gender;
#include <stdio.h>
int main()
{
int A[10], a, b, t1=0, t2=0, count=0;
printf("Enter elements of array =>");
for(int i=0; i<10; i++)
{
@Rajssss
Rajssss / Add_Two_Poly_LL
Last active August 7, 2019 12:20
C Programe to Add Two Polynomials in Linked List....
#include<stdio.h>
#include<stdlib.h>
#include<unistd.h>
struct Poly
{
int Coeff;
int Pow;
struct Poly *next;
} *first, *second, *Sum;
@Rajssss
Rajssss / Insert_Delete_LL
Last active August 7, 2019 12:19
Go through the code first and read the comments....
#include<stdio.h>
#include<stdlib.h>
struct Node
{
int A;
struct Node *next;
} *first;
typedef struct Node Node;
@Rajssss
Rajssss / Doubly_Circular_LL
Created August 10, 2019 14:06
C programm of Doubly Linked List + Circular Linked List, With Display and Reverse Display capabilities...
#include<stdio.h>
#include<stdlib.h>
struct Node
{
int A;
struct Node *next;
struct Node *prev;
} *first, *last;