Ram Gopal Gupta

#include<stdio.h>

#include<conio.h>

#include<malloc.h>

struct node

{

int num;

struct node *next;

struct node *prev;

};

typedef struct node Node;

Node *temp,*start=NULL,*p;

void input();

void output();

void revoutput();

void insert();

void delet();

void main()

{

int choice;

clrscr();

do

{

printf(“\n 1 Creat\n”);

printf(“\n 2 Display\n”);

printf(“\n 3 Rev Display\n”);

printf(“\n 4 Insert\n”);

printf(“\n 5 Delete\n”);

printf(“\n 6 Exit\n”);

printf(“\n please enter your choice:- “);

scanf(“%d”,&choice);

switch(choice)

{

case 1: input();

break;

case 2: output();

break;

case 3: revoutput();

break;

case 4:insert();

break;

case 5:delet();

break;

case 6: exit(0);

}

}while(choice!=6);

getch();

}

void input()

{

temp=(Node*)malloc(sizeof(Node));

printf(“\n Enter a number:-“);

scanf(“%d”,&temp->num);

if(start==NULL)

{

temp->prev=NULL;

start=temp;

temp->next=NULL;

p=temp;

}

else

{

temp->next=NULL;

temp->prev=p;

p->next=temp;

p=temp;

}

}

void output()

{

temp=start;

printf(“\n Value of list\n”);

while(temp!=NULL)

{

printf(“%d\n”,temp->num);

temp=temp->next;

}

}

void revoutput()

{

Node *t,*r;

r=start;

printf(“\n Value in Rev orderlist list\n”);

while(r!=NULL)

{

t=r;

r=r->next;

}

while(t!=NULL)

{

printf(“%d\n”,t->num);

t=t->prev;

}

}

void insert()

{

int i,n;

Node *t;

printf(“\n enter the position where u want to insert:-“);

scanf(“%d”,&n);

temp=start;

p=(Node*)malloc(sizeof(Node));

printf(“\nEnter a new number:-“);

scanf(“%d”,&p->num);

if(n==1)

{

p->prev=NULL;

p->next=temp;

start=p;

temp->prev=p;

}

else

{

for(i=2;i<n;i++)

{

temp=temp->next;

}

p->next=temp->next;

temp->next=p;

p->prev=temp;

p->next->prev=p;

}

}

void delet()

{

int n;

Node *p;

printf(“\n Enter the value u want to delet:-“);

scanf(“%d”,&n);

temp= start;

while(temp!=NULL)

{

if(temp->num==n)

{

if(temp==start)

{

start=temp->next;

start->prev=NULL;

}

else

{

p->next=temp->next;

temp->next->prev=p;

}

free(temp);

break;

}

p=temp;

temp=temp->next;

}

}

#include<stdio.h>

#include<conio.h>

#include<stdlib.h>

struct node

{

int num;

struct node *next;

}*start=NULL;

typedef struct node NODE;

NODE *temp,*p;

void insert();

void display();

void insertend();

void delnode();

void main()

{

int cho,data;

clrscr();

do

{

printf(“\n 1.insert”);

printf(“\n 2.display”);

printf(“\n 3.insertend”);

printf(“\n4.delnode”);

printf(“\n5.exit”);

printf(“\nenter your choice”);

scanf(“%d”,&cho);

switch(cho)

{

case 1:insert();

break;

case 2:display();

break;

case 3:insertend();

break;

case 4:delnode();

break;

case 5:exit(0);

}

}

while(cho!=5);

getch();

}

void insert()

{

temp=(NODE*)malloc(sizeof(NODE));

printf(“enter a no”);

scanf(“%d”,&temp->num);

if(start==NULL)

{

temp->next=NULL;

start=temp;

p=temp;

}

else

{

temp->next=NULL;

p->next=temp;

p=temp;

}

}

void display()

{

NODE *temp;

for(temp=start;temp!=NULL;temp=temp->next)

printf(“\nno=%d,address=%d”,temp->num,temp->next);

}

void insertend()

{

int i,n;

printf(“Enter no that after node is inserted”);

scanf(“%d”,&n);

p=(NODE*)malloc(sizeof(NODE));

printf(“Enter element “);

scanf(“%d”,&p->num);

temp=start;

for(i=1;i<n;i++)

{

temp=temp->next;

}

if(n==0)

{

p->next=temp;

start=p;

}

else

{

p->next=temp->next;

temp->next=p;

}

}

void delnode()

{

NODE *p;

int data;

printf(“Enter element to be delete”);

scanf(“%d”,&data);

temp=start;

p=start;

while(temp!=NULL)

{

if(temp->num==data)

{

if(temp==start)

{

start=temp->next;

}

else

{

p->next=temp->next;

}

free(temp);

break;

}

p=temp;

temp=temp->next;

}

}

#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
typedef struct node
{
int n;
struct node *link;
}NODE;
void main()
{
int c;
NODE *temp,*start=NULL,*p;
clrscr();
//temp=(NODE *)malloc(sizeof(NODE));

while(1)
{
printf("\n\t 1. PUSH\n\t 2. POP");
printf("\n\t 3. DISPLAY\n\t 4. EXIT");
printf("\n\t ENTER ANY CHOICE\t");
scanf("%d",&c);
switch(c)
{
case 1: printf("\n\t ENTER ANY NUMBER\t");
temp=(NODE *)malloc(sizeof(NODE));
scanf("%d",&temp->n);
if(start==NULL)
{
temp->link=NULL;
start=temp;
p=temp;
}
else
{
temp->link=NULL;
p->link=temp;
p=temp;
}
break;
case 2: if(start==NULL)
printf("\n\tEMPTY LIST");
else
printf("\n\t %d IS DELETED",start->n);
start=start->link;
break;
case 3: temp=start;
while(temp!=NULL)
{
printf("\n\t\t%d",temp->n);
temp=temp->link;
}
break;
case 4:exit(1);
default:printf("\n\t YOU ENTERED AN INVALID CHOICE");
printf("\n\nPLEASE TRY AGAIN……….\t");

}
}
getch();
}

#include<stdio.h>

#include<malloc.h>

void main(){

struct node

{

int num;

struct node *next;

}*start=NULL;

typedef struct node NODE;

NODE *p, *first=NULL,*temp;

char choice;

clrscr();

do{

p=(NODE*) malloc(sizeof(NODE));

printf(“Enter the data item\n”);

scanf(“%d”,&p->num);

if(first==NULL){

p->next=NULL;

temp=p;

first=p;

}

else{

temp->next=p;

p->next=NULL;

temp=p;

}

printf(“Do you want to continue (type y or n) ?\n”);

fflush(stdin);

scanf(“%c”,&choice);

}while(choice==’y’ || choice==’Y’);

printf(“Status of Link List is ——————–\n”);

temp=first;

while(temp!=NULL){

printf(“%d\n”,temp->num);

temp=temp->next;

}

//printf(“Number of Nodes in the list = %d\n”,count);

getch();

}

#include<stdio.h>
#include<conio.h>
#define maxsize 5
int Q[maxsize];
void main(){
int front=-1,rear=-1;
int item,i;
char ch=’y’;
do{
printf("Enter Item into Q: ");
scanf("%d",&item);
if(rear>=maxsize-1){
printf("\n Queue oveflow");
}
else{
rear=rear+1;
Q[rear]=item;
}
if(front==-1){
front=0;
}
printf("Do u want to continue: ");
fflush(stdin);
scanf("%c",&ch);
}while(ch==’y’||ch==’Y’);
printf("Do u want to delete item from Q: ");
fflush(stdin);
scanf("%c",&ch);
while(ch==’y’){
if(front<0){
printf("Q is Empty ");
}
else{
item=Q[front];
printf("Deleteed item is: %d\n",item);
front=front+1;
}
if(front>rear){
front=rear=-1;
}
printf("Do u want to delete item from Q: ");
fflush(stdin);
scanf("%c",&ch);
}
/*printf("————–DISPLAY VALUES FROM Q——–");
for(i=front;i<=rear;i++){
printf("%d\n",Q[i]);

}*/
}

#include<stdio.h>

#include<conio.h>

#include<malloc.h>

struct node

{

int data;

struct node *link;

};

void push(struct node**, int);

int pop(struct node **);

void traverse(struct node**);

void delstack(struct node**);

void main()

{

struct node *s=NULL;

int i;

clrscr();

push(&s,8);

push(&s,20);

push(&s,-4);

push(&s,15);

push(&s,18);

push(&s,12);

push(&s,16);

push(&s,25);

push(&s,0);

push(&s,10);

push(&s,100);

//traverse(&s);

i=pop(&s);

printf(“\nItem popped: %d”,i);

i=pop(&s);

printf(“\nItem popped: %d”,i);

i=pop(&s);

printf(“\nItem popped: %d”,i);

i=pop(&s);

printf(“\nItem popped: %d”,i);

i=pop(&s);

printf(“\nItem popped: %d”,i);

i=pop(&s);

printf(“\nItem popped: %d”,i);

i=pop(&s);

printf(“\nItem popped: %d”,i);

i=pop(&s);

printf(“\nItem popped: %d”,i);

i=pop(&s);

printf(“\nItem popped: %d”,i);

i=pop(&s);

printf(“\nItem popped: %d”,i);

i=pop(&s);

printf(“\nItem popped: %d\n”,i);

traverse(&s);

delstack(&s);

}

void push(struct node **top,int item){

struct node *temp;

temp=(struct node*) malloc(sizeof(struct node));

if(temp==NULL)

{

printf(“\nStack is full”);

}

temp->data=item;

temp->link=*top;

*top=temp;

}

int pop(struct node **top){

struct node *temp;

int item;

if(*top==NULL){

printf(“\n Stack is empty”);

return NULL;

}

temp=*top;

item=temp->data;

*top=(*top)->link;

free(temp);

return item;

}

void delstack(struct node **top){

struct node *temp;

if(*top==NULL)

return;

while(*top!=NULL){

temp=*top;

*top=(*top)->link;

free(temp);

}

}

void traverse(struct node**top){

struct node *temp;

int item;

if(*top==NULL){

printf(“\n Stack is empty”);

return;

}

while(*top!=NULL){

temp=*top;

item=temp->data;

*top=(*top)->link;

printf(“%d\n”,item);

}

}

#include<stdio.h>
#include<conio.h>
struct stack
{
int no;
struct stack *next;
}*top=NULL;
typedef struct stack st;
void push();
void pop();
void traverse();
void main(){
int choice;
char ch;
clrscr();
do
{
printf("\n1 push");
printf("\n2 pop");
printf("\n3 traverse");
printf("\n4 exit");
printf("\n Enter your choice: ");
scanf("%d",&choice);
switch(choice)
{
case 1: push();
break;
case 2: pop();
break;
case 3: traverse();
break;
case 4: exit(0);
}
}while(choice !=4);
}
void push()
{
st *p;
p=(st*) malloc(sizeof(st));
printf("\n Enter the element to be inserted");
scanf("%d",&p->no);
p->next=top;
top=p;
}

void pop(){
st* p;
p=top;
if(top==NULL)
printf("Stack is already empty");
else
{
top=top->next;
printf("\n The deleted element is %d",p->no);
free (p);
}
}
void traverse()
{
st *p;
p=top;
while(p!=NULL)
{
printf("\nno = %d",p->no);
p=p->next;
}
printf("\nno = %d",p->no);
}

#include<stdio.h>

#include<conio.h>

void push();

void pop();

void traverse();

int stack[5];

int top=-1;

void main(){

int choice;

char ch;

clrscr();

do

{

printf(“\n1 push”);

printf(“\n2 pop”);

printf(“\n3 traverse”);

printf(“\n4 exit”);

printf(“\n Enter your choice: “);

scanf(“%d”,&choice);

switch(choice)

{

case 1: push();

break;

case 2: pop();

break;

case 3: traverse();

break;

case 4: exit(0);

}

}while(choice !=4);

}

void push()

{

int item;

if(top==4)

printf(“\n The stack is full”);

else{

printf(“\n Enter the element to be inserted”);

scanf(“%d”,&item);

top=top+1;

stack[top]=item;

}

}

void pop(){

int item;

if(top==-1){

printf(“The stack is Empty”);

}

else{

item=stack[top];

top=top-1;

printf(“\n The deleted element is %d”,item);

}

}

void traverse()

{

int i;

if(top==-1){

printf(“The stack is Empty”);

}

else{

for(i=top;i>=0;i–){

printf(“\n%d”, stack[i]);

}

}

}

#include<stdio.h>

#include<conio.h>

void main(){

char ch;char fname[100];

FILE *fp;int count=0;

printf(“\n Enter File name from read data: “);

gets(fname);

fp=fopen(fname,”r”);

printf(“\n\n The content of the text file is: \n\n”);

while(!feof(fp)){

ch=getc(fp);

switch(ch){

case ‘a’:

case ‘A’:

case ‘e’:

case ‘E’:

case ‘i’:

case ‘I’:

case ‘o’:

case ‘O’:

case ‘u’:

case ‘U’:

count++;

}

printf(“%c”,ch);

}

printf(“\n\n count=%d “,count);

fclose(fp);

}

#include<stdio.h>

#include<conio.h>

void main(){

char ch;char fname[100],tname[100];

FILE *fp,*tp;

int i;

printf(“\n Enter File name want to copy: “);

gets(fname);

printf(“\n Enter File name where want to copy: “);

gets(tname);

fp=fopen(fname,”r”);

tp=fopen(tname,”w+”);

printf(“\n Copy in process…\n\n”);

while(!feof(fp)){

ch=getc(fp);

putc(ch,tp);

}

printf(“\nCopied Successfull\n”);

rewind(tp);

while(!feof(tp)){

ch=getc(tp);

printf(“%c”,ch);

}

fclose(fp);

fclose(tp);

}

#include<stdio.h>

#include<conio.h>

#include<ctype.h>

struct emp_record{

int eno;

char ename[20];

float bpay;

}erec;

FILE *efile;

//———————————————-

void main(){

void createfile(void);

void readfile(void);

void appendrec(void);

void modirec(void);

void deleterec(void);

int n;

do

{

printf(“\n\t Main Menu”);

printf(“\n\t Press 1 – file creation”);

printf(“\n\t Press 2 – reading”);

printf(“\n\t Press 3 – appending”);

printf(“\n\t Press 4 – modify a record”);

printf(“\n\t Press 5 – delete a record”);

printf(“\n\t Press 6 – quit”);

printf(“\n\n Enter your choice: “);

scanf(“%d”,&n);

switch(n){

case 1: createfile();

break;

case 2: readfile();

break;

case 3: appendrec();

break;

case 4: modirec();

break;

case 5: deleterec();

break;

case 6: exit(0);

break;

}

}while(n != 6);

}

//———END MAIN————————-

//—————- file creation ————–

void createfile(void){

char choice=’y’;

efile=fopen(“employ.dat”,”w”);

fflush(stdin);

while(toupper(choice)==’Y’){

printf(“\n Enter the employee No: “);

scanf(“%d”,&erec.eno);

printf(“\n Enter the employee Name: “);

scanf(“%s”,erec.ename);

printf(“\n Enter the employee Basic Pay: “);

scanf(“%f”,&erec.bpay);

fwrite(&erec,sizeof(erec),1,efile);

printf(“\n Press y – to continue “);

printf(“\n Any other key to stop. “);

choice=getche();

}

fclose(efile);

}

//————————————————–

//—————- Read file ———————–

void readfile(void){

efile=fopen(“employ.dat”,”r”);

printf(“\n—————————————–“);

printf(“\nEmp No. Employee Name Basic Pay”);

printf(“\n—————————————–“);

fread(&erec,sizeof(erec),1,efile);

while(!feof(efile))

{

printf(“\n %d \t %-20s %-0.2f”,erec.eno,erec.ename,erec.bpay);

fread(&erec,sizeof(erec),1,efile);

}

printf(“\n—————————————–\n”);

fclose(efile);

printf(“\n Press ant key to continue …”);

getch();

}

//——————————————————

//————— Append records ———————–

void appendrec(void){

char choice=’y’;

efile=fopen(“employ.dat”,”a”);

fflush(stdin);

while(toupper(choice)==’Y’){

printf(“\n Enter the employee No: “);

scanf(“%d”,&erec.eno);

printf(“\n Enter the employee Name: “);

scanf(“%s”,erec.ename);

printf(“\n Enter the employee Basic Pay: “);

scanf(“%f”,&erec.bpay);

fwrite(&erec,sizeof(erec),1,efile);

printf(“\n Press y – to continue “);

printf(“\n Any other key to stop. “);

choice=getche();

}

fclose(efile);

}

//——————————————————

//—————- Modify Record ———————–

void modirec(void){

int temp,flag=0,n;

efile=fopen(“employ.dat”,”r+”);

fflush(stdin);

printf(“\n To modify a record”);

printf(“————————“);

printf(“\n Enter the Roll No.”);

scanf(“%d”,&temp);

rewind(efile);

fread(&erec,sizeof(erec),1,efile);

while(!feof(efile) && flag==0){

if(erec.eno==temp)

{

printf(“\n Existing record details “);

printf(“\n %d \t %-20s %-0.2f”,erec.eno,erec.ename,erec.bpay);

fflush(stdin);

printf(“\n\n Enter the modified details “);

printf(“\n——————————–“);

printf(“\n Enter the employee No: “);

scanf(“%d”,&erec.eno);

printf(“\n Enter the employee Name: “);

scanf(“%s”,erec.ename);

printf(“\n Enter the employee Basic Pay: “);

scanf(“%f”,&erec.bpay);

n=sizeof(erec);

fseek(efile,-n,SEEK_CUR);

fwrite(&erec,n,1,efile);

flag=1;

printf(“\n The record has been modified!”);

}

fread(&erec,sizeof(erec),1,efile);

}

fclose(efile);

if(flag==0)

printf(“\n The given record is not present in the file!!!”);

printf(“\n\t press any key to continue … “);

getch();

}

//————————————————

//————– Delete Record ——————-

void deleterec(void){

int temp,flag=0;

FILE *tfile;

efile=fopen(“employ.dat”,”r”);

tfile=fopen(“temp.dat”,”w”);

printf(“\n To delete a record “);

printf(“\n———————“);

printf(“\n Enter the Roll No. “);

fflush(stdin);

scanf(“%d”,&temp);

fread(&erec,sizeof(erec),1,efile);

while(!feof(efile))

{

if(erec.eno == temp)

{

printf(“\n The given record “);

printf(“\n %d \t %-20s %-0.2f”,erec.eno,erec.ename,erec.bpay);

printf(“\n is deleted !!!”);

flag = 1;

}

else{

fwrite(&erec,sizeof(erec),1,tfile);

}

fread(&erec,sizeof(erec),1,efile);

}

fclose(tfile);

fclose(efile);

remove(“employ.dat”);

rename(“temp.dat”,”employ.dat”);

if(flag == 0)

printf(“\n The given record is not present in thr file!!!”);

printf(“\n\t press any key to continue”);

getch();

}

//————————————————

#include<stdio.h>
#include<conio.h>
main() {
int a[10][10],i,j,k,n,m,min,max,col=0,flag=0,sad=0;
clrscr();
printf(“enter order m,n of mxn matrix”);
scanf(“%d %d”,&m,&n);
printf(“enter elements row-wise”);
for(i=0;i<m;i++)  {
for(j=0;j<n;j++)     {
scanf(“%d”,&a[i][j]);
}
}
printf(“\n given matrix is \n\n”);
for(i=0;i<m;i++) {
for(j=0;j<n;j++)
{
printf(“%d\t”,a[i][j]);
}
printf(“\n”);
}

for(i=0;i<m;i++) {
min=a[i][0];
for(j=1;j<n;j++)  {
if(a[i][j]==min)      {
flag=1;
}
if(a[i][j]<min)    {
min=a[i][j];
col=j;
flag=0;
}
}
if(flag==1)
printf(“\n no saddle point for row %d”,i+1);
if(flag==0)       {
max=a[0][col];
for(k=1;k<m;k++)  {
if(a[k][col]==max)   {
flag=1;
break;
}   else   {
if(a[k][col]>max)    {
max=a[k][col];
}
}
}
if(max==min && flag !=1)
{
printf(“\n saddle pt.at (%d,%d)”,i+1,col+1);
sad=1;
}
}   // flag=0;

}
if(sad==0)
printf(“\n no saddle poit in matrix “);

getch();

}

Welcome to Ram Gopal Gupta Blog, to share our knowledge..