Skip to main content

Application for correction name in the result sheet free sample format

Mashkawat Ahsan Leave a comment

To
The Exam Controller
Exam Department
[[University Detail]]

Subject : Application for correction my name in the result sheet.

Sir,

With due respect to state that, I am the student of [[department]] [[]]th batch, [[]]th semester of your university. I like to inform you that, my name in the result sheet is [[wrong name]] instead of [[right name]].
Therefore, I pray and hope that you would take necessary steps to correction my name and oblige thereby.

Yours Sincerely

name
[[department]] [[]]th batch, [[]]th semester
ID: [[]]

Application for re-arrange Exam sample format

Mashkawat Ahsan Leave a comment

[[Date]]

To
The Registrar
[[University details]]

Subject : Application for re-arrange the [[Final/Mid-term/Quiz]] Exam.

Sir,

With due respect to state that, we the undersigned students of [[Department name]], [[]]th batch, [[]]th semester of your university. We like to inform you that we did not attend in the [[name]] exam for [[reason]]. So we are requesting you to re-arrange the exam.

In this circumstance, we pray and hope that you would be kind enough to give us a chance to participate in the exam by re-arranging the exam and oblige thereby.

Sincerely Yours,
The Students of [[]]th Batch
[[]]th Semester, [[Department name]]

Request for Internship Free Sample format

Mashkawat Ahsan Leave a comment

[[University Letterhead]]

Date: 01-11-2020

To : [[Company details]]

From: Dean, [[University details]]

Subject: Request for Internship.

Dear Sir
I have the pleasure to introduce [[Student Name]] bearing [[Student ID]], a student of [[Department/year/semester]] of this university. He requires undergoing an internship program as a part of his academic attainment. The internship program is designed for the student’s application of theoretical knowledge in the domain of the practical world. It’s a [[twelve week]] internship program of carrying [[6 credits]]. The student concerned pleasantly selected your esteemed organization for this purpose. He has been advised to produce identity card to you as mentioned above. You are requested not to allow any body without proper identity.

Your kind and sincere cooperation in this respect will be highly appreciated.

Thanks and regards.

[[signature]]
………………………………
[[Dean Name]]
Dean

Structure within Function in C

Mashkawat Ahsan Leave a comment 
#include<stdio.h>
 #include<conio.h>
   struct stores
    {
      char name[20];
      float price;
      int quantity;
      };
      struct stores update(struct stores product, float p, int q)
      {
	product.price+=p;
	product.quantity+=q;
	return(product);
      }
      float mul(struct stores stock)
      {
       return(stock.price*stock.quantity);
      }
    void main(void)
     {
       clrscr();
       float p_inc,value;
       int q_inc;
       static struct stores item={"XYZ",25.75,12};
       printf("\n Input inc values:\n");
       printf("\n Price inc  and Quantity inc\n\n");
       scanf("%f %d",&p_inc,&q_inc);
       item=update(item,p_inc,q_inc);
       printf("Update values of item\n\n");
       printf("name     :%s\n",item.name);
       printf("Price     :%f\n",item.price);
       printf("Quantity   :%d\n",item.quantity);
       value=mul(item);
       printf("\n values of the item =%f\n",value);
       getch();
     }

Pattern Matching in C

Mashkawat Ahsan Leave a comment 
#include<stdio.h>
#include<conio.h>
#include<string.h>
#include<stdlib.h>
void main()
	{
	int i,j,k=-1,s,r,max,comp=0;
	char t[50],p[50],c;
	clrscr();
	printf("ENTER TEXT = ");gets(t);s=strlen(t);
	PATTERN:
	printf("ENTER PATTERN = ");gets(p);r=strlen(p);
	max=s-r+1;
	//SEARCHING FOR PATTERN//
	for(i=0;i<=max;i++)
		{
		for(j=0;j<r;j++)
			{
			k=i;
			if(p[j]==t[i+j])
				{
				comp++;
				if(comp==r)
					{
					goto LOCK;
					}
				}
			else
				{
				k=-1;
				comp=0;
				break;
				}
			}
		}
	LOCK:
	if(k>-1)
		{
		printf("\nPATTERN IS AT LOCATION %d",k+1);
		}
	else
		{
		printf("\n\aSORRY PATTERN CANN'T FIND.");
		}
	printf("\nFIND PATTERN AGAIN ? (Y/N)..");
	c=getch();
	if(c=='y'||c=='Y')
		{
		k=-1;
		comp=0;
		goto PATTERN;
		}
	else
		exit(0);
	}

Multi Delete in C

Mashkawat Ahsan Leave a comment 
#include<stdio.h>
#include<conio.h>
#include<dos.h>
#include <stdlib.h>

void main()
	{
	int i,s,index1,index2,loc,data[50];
	char c;
	clrscr();
	printf("HOW MANY ELEMENT YOU WANT FOR ARRAY:\t");scanf("%d",&index1);
	clrscr();
	printf("START ENTERING VALUE:\n");
	for(i=1;i<=index1;i++)
		{
		printf("data[%d]=",i);
		scanf("%d",&data[i]);
		}
	MULTI_DELET:
	printf("\nENTER LOCATION TO DELET:");scanf("%d",&loc);
	if(loc>index1)
		{
		printf("\n\aLOCATION IS OUT OF RANGE.TRY AGAIN...");
		goto MULTI_DELET;
		}
	printf("HOW MANY INDEX YOU WANT TO DELET:\t");scanf("%d",&index2);
	if(index2>index1)
		{
		printf("\n\aOUT OF RANGE.TRY AGAIN...");
		goto MULTI_DELET;
		}

		//SHIFTING//
	s=index1-(loc+index2);
	for(i=0;i<=s;i++)
		{
		data[loc+i]=data[i+loc+index2];
		}
		//DISPLAY//
	 printf("\nAFTER DELETING");
	 for(i=1;i<=index1-index2;i++)
		{
		printf("\ndata[%d]=%d",i,data[i]);
		}
	 index1=index1-index2;
	 if(index1<=0)
		{
		printf("\n\aSORRY.THERE IS NO MORE ELEMENT TO DISPALY..");
		printf("\n\n\t******* GOOD BYE ********");
		delay(3000);
		exit(1);
		}

	 printf("\nDO IT AGAIN ?(y/n)...");
	 c=getch();
	 if(c=='y'||c=='Y')
		{
		goto MULTI_DELET;
		}
	}

Linked List with Student Information & Count the Number of Node in C

Mashkawat Ahsan Leave a comment 
#include<stdio.h>
#include<conio.h>
#include<stdlib.h>

#define NULL 0

struct linked_list
		{
		int roll;
		char name[20];
		struct linked_list *next;
		};
typedef struct linked_list node;

void create(node *list)
	{
	printf("Enter the ROLL NUMBER:\t");
	scanf("%d",&list->roll);
	if(list->roll<0)
		{
		list->next=NULL;
		}
	else
		{
		printf("Enter the NAME:\t");
		scanf("%c",list->name);
		list->next=(node *)malloc(sizeof(node));
		create(list->next);
		}
	return;
	}

void print(node *list)
	{
	if(list->next!=NULL)
		{
		printf("ROLL NO: %d\n",list->roll);
		printf("ROLL NO: %f\n",list->name);
		print(list->next);
		}
	return;
	}

int count(node *list)
	{
	if(list->next==NULL)
		return(0);
	else
		return(1+count(list->next));
	}
void main(void)
	{
	clrscr();
	node *head;
	head=(node *)malloc(sizeof(node));
	printf("\nTo QUIT, Enter any NEGATIVE NUMBER..\n");
	create(head);
	printf("\n\n");
	printf("\n\tPRINTING THR TOTAL LINK LIST.....");
	print(head);
	printf("THE NUMBER OF NODE IS %d",count(head));
	getch();
	}

Pattern Matching by Function in C

Mashkawat Ahsan Leave a comment 
#include<stdio.h>
#include<conio.h>
#include<string.h>
#include<stdlib.h>

void SEARCHING_PATTERN(char t[50],char p[50])
	{
	int s,r,max,i,j,k=-1,comp=0;
	s=strlen(t);
	r=strlen(p);
	max=s-r+1;
	//SEARCHING FOR PATTERN//
	for(i=0;i<=max;i++)
		{
		for(j=0;j<r;j++)
			{
			k=i;
			if(p[j]==t[i+j])
				{
				comp++;
				if(comp==r)
					{
					goto LOCK;
					}
				}
			else
				{
				k=-1;
				comp=0;
				break;
				}
			}
		}
	LOCK:
	if(k>-1)
		{
		printf("\nPATTERN IS AT LOCATION %d",k+1);
		}
	else
		{
		printf("\n\aSORRY PATTERN CANN'T FIND.");
		}
	}

void main()
	{
	int k=-1,comp=0;
	char t[50],p[50],c;
	clrscr();
	printf("ENTER TEXT = ");gets(t);
	PATTERN:
	printf("ENTER PATTERN = ");gets(p);
	SEARCHING_PATTERN(t,p);
	printf("\nFIND PATTERN AGAIN ? (Y/N)..");
	c=getch();
	if(c=='y'||c=='Y')
		{
		k=-1;
		comp=0;
		goto PATTERN;
		}
	else
		exit(0);
	}

Multi-Insert in C

Mashkawat Ahsan Leave a comment 
#include<stdio.h>
#include<stdlib.h>
#include<conio.h>
void main()
	{
	clrscr();
	int i,j,n1,n2,l,v,t,data[50],a[30];
	char c;
	printf("how many element u want:\t");	scanf("%d",&n1);
	for(i=1;i<=n1;i++)
		{
		printf("data[%d]= ",i);	 scanf("%d",&data[i]);
		}
	again:
	printf("\nEnter location to insert:\t");  scanf("%d",&l);
	printf("\nHow many element u want:\t");   scanf("%d",&n2);
	for(i=1;i<=n2;i++)
		{
		printf("a[%d]= ",i);  scanf("%d",&a[i]);
		}
		//shifting//
	for(i=(n1+n2),j=0;i>=n2+l;i--,j++)
		{
		data[i]=data[n1-j];
		}
		//entering value//
	for(i=0;i<n2;i++)
		{
		data[l+i]=a[i+1];
		}
		//display//
	for(i=1;i<=n1+n2;i++)
		{
		printf("data[%d]=%d\n",i,data[i]);
		}
	printf("\ninsert again ? (y/n)..");
	c=getch();
	if(c=='y')
		{
		n1=n1+n2;
		goto again;
		}
	else
		exit(0);
	}

Quick Sort in C

Mashkawat Ahsan Leave a comment 
#include<stdio.h>
#include<conio.h>

int comp=0,s=0;
int quick(int array[],int n,int beg,int end,int loc)
	{
	int left=beg,right=end,temp;
	loc=beg;
	right_to_left:
	while(array[loc]<=array[right] && loc!=right)
		{
		right=right-1;
		comp++;
		}
	if(loc==right)
		return(loc);
	if(array[loc]>array[right])
		{
		s++;
		temp=array[loc];
		array[loc]=array[right];
		array[right]=temp;
		loc=right;
		goto left_to_right;
		}
	left_to_right:
	while(array[left]<=array[loc] && left!=loc)
		{
		left=left+1;
		comp++;
		}
	if(loc==left)
		return (loc);
	if(array[left]>array[loc])
		{
		s++;
		temp=array[loc];
		array[loc]=array[left];
		array[left]=temp;
		loc=left;
		goto right_to_left;
		}
	}
void main()
	{
	int array[30],n,i,top=0,lower[10],upper[10];
	int beg,end,loc;
	printf("HOW MANY ELEMENTYOU WANT: ");
	scanf("%d",&n);
	for(i=1;i<=n;i++)
		{
		printf("array[%d]",i);
		scanf("%d",&array[i]);
		}
	if(n>1)
		{
		top=top+1;
		lower[1]=1;
		upper[1]=n;
		}
	while(top!=0)
		{
		beg=lower[top];
		end=upper[top];
		top=top-1;
		loc=quick(array,n,beg,end,loc);
		if(beg<loc-1)
			{
			top=top+1;
			lower[top]=beg;
			upper[top]=loc-1;
			}
		if(loc+1<end)
			{
			top=top+1;
			lower[top]=loc+1;
			upper[top]=end;
			}
		}
	printf("\nAFTER SORTING");
	for(i=1;i<=n;i++)
		{
		printf("\nARRAY[%d]=%d",i,array[i]);
		}
	getch();
	}