







Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Solutions to three programming questions related to data structures. The first question involves generating an output using a single linked list, the second question deals with converting postfix to infix notation, and the third question is about writing a c program to generate a specific pattern. The program code and its corresponding output.
Typology: Exams
1 / 13
This page cannot be seen from the preview
Don't miss anything!








PROGRAM: #include<stdio.h> #include<conio.h> struct node { int number; struct nodep; }h,f,t;
scanf(โ%cโ,&c); }while(c==โyโ); t->p=NULL; t=f; printf(โ\n the values of the linked list are:โ); while(t!=NULL) { printf(โ%dโ,t->number); t=t->p; } printf(โ\n|---------------------------------------------------------------------|โ); printf(โ\n|<<<<<<<<<<<<<<BU17050 9 >>>>>>>>>>>>>>>>>>>|โ); printf(โ\n|<<<<<<<<<<<<<<R.SURESH>>>>>>>>>>>>>>>>>>|โ); printf(โ\n|---------------------------------------------------------------------|โ); } OUTPUT:
CONVERSION: ijk+-lm-no-p+/*
โl-mโ โi-j+kโ /* โn-o+pโ โl-mโ โi-j+kโ
PROGRAM: #include<stdio.h> main() { printf(โ\n|_______________________________________________|โ); printf(โ\n|<<<<<<<<
PROGRAM: #include<stdio.h> #include<conio.h> void main()
printf(โ\n|-----------------------------------------------------------------------|โ); printf(โ\n|<<<<<<<<