C++ and C Notes | 1st year | KIIT UNIVERSITY

Contains everything about c and c++ for 1st years. i.e. for 1st semester and 2nd semester.##NOTE FOR DOWNLOAD:: After downloading there maybe an error in opening pdf's. Go to the file location and rename the pdf and give the extension part i.e. ' ....See more

Views: 20233

Added: 1 year ago

1. Assignment - 1 Questions.pdf

Download
Knowledge Score: N/A

Similar Knowledge

This pdf tells us to know about the description of the socket programming which is used in the computer networking
Basic Programming concepts of C
# include<stdio.h> #include<process.h> #define MAX 30 typedef struct dequeue { int data[MAX]; int rear,front; }dequeue; void initialize(dequeue *p); int empty(dequeue *p); int full(dequeue *p); void enqueueR(dequeue *p,int x); void enqueueF(dequeue *p,int x); int dequeueF(dequeue *p); int dequeueR(dequeue *p); void print(dequeue *p); void main() { int i,x,op,n; dequeue q; initialize(&q); do { printf("\n1.Create\n2.Insert(rear)\n3.Insert(front)\n4.Delete(rear)\n5.Delete(front)"); printf("\n6.Print\n7.Exit\n\nEnter your choice:"); scanf("%d",&op); switch(op) { case 1: printf("\nEnter number of elements:"); scanf("%d",&n); initialize(&q); printf("\nEnter the data:"); for(i=0;i<n;i++) { scanf("%d",&x); if(full(&q)) { printf("\nQueue is full!!"); exit(0); } enqueueR(&q,x); } break; case 2: printf("\nEnter element to be inserted:"); scanf("%d",&x); if(full(&q)) { printf("\nQueue is full!!"); exit(0); } enqueueR(&q,x); break; case 3: printf("\nEnter the element to be inserted:"); scanf("%d",&x); if(full(&q)) { printf("\nQueue is full!!"); exit(0); } enqueueF(&q,x); break; case 4: if(empty(&q)) { printf("\nQueue is empty!!"); exit(0); } x=dequeueR(&q); printf("\nElement deleted is %d\n",x); break; case 5: if(empty(&q)) { printf("\nQueue is empty!!"); exit(0); } x=dequeueF(&q); printf("\nElement deleted is %d\n",x); break; case 6: print(&q); break; default: break; } }while(op!=7); } void initialize(dequeue *P) { P->rear=-1; P->front=-1; } int empty(dequeue *P) { if(P->rear==-1) return(1); return(0); } int full(dequeue *P) { if((P->rear+1)%MAX==P->front) return(1); return(0); } void enqueueR(dequeue *P,int x) { if(empty(P)) { P->rear=0; P->front=0; P->data[0]=x; } else { P->rear=(P->rear+1)%MAX; P->data[P->rear]=x; } } void enqueueF(dequeue *P,int x) { if(empty(P)) { P->rear=0; P->front=0; P->data[0]=x; } else { P->front=(P->front-1+MAX)%MAX; P->data[P->front]=x; } } int dequeueF(dequeue *P) { int x; x=P->data[P->front]; if(P->rear==P->front) //delete the last element initialize(P); else P->front=(P->front+1)%MAX; return(x); } int dequeueR(dequeue *P) { int x; x=P->data[P->rear]; if(P->rear==P->front) initialize(P); else P->rear=(P->rear-1+MAX)%MAX; return(x); } void print(dequeue *P) { if(empty(P)) { printf("\nQueue is empty!!"); exit(0); } int i; i=P->front; while(i!=P->rear) { printf("\n%d",P->data[i]); i=(i+1)%MAX; } printf("\n%d\n",P->data[P->rear]); }
Contains everything about c and c++ for 1st years. i.e. for 1st semester and 2nd semester.##NOTE FOR DOWNLOAD:: After downloading there maybe an error in opening pdf's. Go to the file location and rename the pdf and give the extension part i.e. ' .pdf ' .
These files are of c programming. It contains a syllabus copy also. contents in them are 1.Introduction to c 2.History of c 3.Functions 4.Pointers 5.Arrays 6. Structures and files the articles contain all the detailed information about c language necessary for every engineering student. These ppt's are prepared by expert faculty . It contains a detailed explanation of all the c language.
Basic programming in c
Ask a Question
0 Questions (0 Answered)
Satyaki Chakraborti

Satyaki Chakraborti Creator

(No description available)

Suggested Creators

Eedulla Madhuri

Eedulla Madhuri

(No description available)

Rituparna Mazumder

Rituparna Mazumder

(No description available)

Katkam Ashutosh

Katkam Ashutosh

(No description available)

Satyaki Chakraborti