#include #include struct Day { char *dayName; int date; char *activity; }; void create(struct Day *day) { day - >dayName = (char *)malloc(sizeof(char) * 20); day - >activity = (char *)malloc(sizeof(char) * 100); printf("Enter the day name: "); scanf("%s", day - >dayName); printf("Enter the date: "); scanf("%d", &day - >date); printf("Enter the activity for the day: "); scanf(" %[^ \ n]s", day - >activity); } void read(struct Day *calendar, int size) { for (int i = 0; i < size; i++) { printf("Enter details for Day %d: \ n", i + 1); create(&calendar[i]); } } void display(struct Day *calendar, int size) { printf(" \ nWeek's Activity Details: \ n"); for (int i = 0; i < size; i++) { printf("Day %d: \ n", i + 1); printf("Day Name: %s \ n", calendar[i].dayName); printf("Date: %d \ n", calendar[i].date); printf("Activity: %s \ n", calendar[i].activity); printf(" \ n"); } } void freeMemory(struct Day *calendar, int size) { for (int i = 0; i < size; i++) { free(calendar[i].dayName); free(calendar[i].activity); } } int main() { int size; printf("Enter the number of days in the week: "); scanf("%d", &size); struct Day *calendar = (struct Day *)malloc(sizeof(struct Day) * size); if (calendar == NULL) { printf("Memory allocation failed. Exiting program. \ n"); return 1; } read(calendar, size); display(calendar, size); freeMemory(calendar, size); free(calendar); return 0; } 2 #include #include #define MAX 200 void findAndReplace(char str[], char pat[], char rep[]); int main() { char str[MAX], pat[MAX], rep[MAX]; printf("Enter the main string (STR): "); fgets(str, MAX, stdin); str[strcspn(str, " \ n")] = ' \ 0'; // remove newline printf("Enter the pattern string (PAT): "); fgets(pat, MAX, stdin); pat[strcspn(pat, " \ n")] = ' \ 0'; printf("Enter the replace string (REP): "); fgets(rep, MAX, stdin); rep[strcspn(rep, " \ n")] = ' \ 0'; findAndReplace(str, pat, rep); return 0; } void findAndReplace(char str[], char pat[], char rep[]) { char result[MAX]; int i, j, k; int found = 0; int lenSTR = strlen(str); int lenPAT = strlen(pat); int lenREP = strlen(rep); i = j = 0; while (i < lenSTR) { // check if substring matches pattern for (k = 0; k < lenPAT && (i + k) < lenSTR && str[i + k] == pat[k]; k++); if (k == lenPAT) { // pattern found found = 1; strcpy(&result[j], rep); j += lenREP; i += lenPAT; } else { // copy normal character result[j++] = str[i++]; } } result[j] = ' \ 0'; if (found) printf(" \ nUpdated string after replacement: \ n%s \ n", result); else printf(" \ nPattern not found in the main string. \ n"); } 3 #include #include #include #define MAX 5 // Maximum size of stack int stack[MAX]; int top = - 1; void push(int element); int pop(); void display(); void checkPalindrome(); void isOverflow(); void isUnderflow(); int main() { int choice, element; while (1) { printf(" \ n --- STACK OPERATIONS MENU --- \ n"); printf("1. Push an element onto stack \ n"); printf("2. Pop an element from stack \ n"); printf("3. Check Palindrome using Stack \ n"); printf("4. Demonstrate Overflow and Underflow \ n"); printf("5. Display Stack \ n"); printf("6. Exit \ n"); printf("Enter your choice: "); scanf("%d", &choice); switch (choice) { case 1: printf("Enter element to push: "); scanf("%d", &element); push(element); break; case 2: element = pop(); if (element != - 1) printf("Popped element: %d \ n", element); break; case 3: checkPalindrome(); break; case 4: isOverflow(); isUnderflow(); break; case 5: display(); break; case 6: printf("Exiting program... \ n"); exit(0); default: printf("Invalid choice! Try again. \ n"); } } return 0; } // Function to push element into stack void push(int element) { if (top == MAX - 1) { printf("Stack Overflow! Cannot push %d \ n", element); } else { stack[++top] = element; printf("%d pushed to stack. \ n", element); } } // Function to pop element from stack int pop() { if (top == - 1) { printf("Stack Underflow! Cannot pop. \ n"); return - 1; } else { return stack[top -- ]; } } // Function to display stack elements void display() { if (top == - 1) { printf("Stack is empty! \ n"); } else { printf("Stack elements (top to bottom): "); for (int i = top; i >= 0; i -- ) printf("%d ", stack[i]); printf(" \ n"); } } stack void checkPalindrome() { char str[50]; int tempTop = - 1; char tempStack[50]; printf("Enter a string to check palindrome: "); scanf("%s", str); int len = strlen(str); // Push all characters into stack for (int i = 0; i < len; i++) tempStack[++tempTop] = str[i]; // Pop and compare int isPal = 1; for (int i = 0; i < len; i++) { if (str[i] != tempStack[tempTop -- ]) { isPal = 0; break; } } if (isPal) printf("'%s' is a Palindrome. \ n", str); else printf("'%s' is NOT a Palindrome. \ n", str); } // Function to demonstrate overflow void isOverflow() { printf(" \ n --- Demonstrating Overflow --- \ n"); top = - 1; for (int i = 0; i < MAX + 1; i++) push(i); } // Function to demonstrate underflow void isUnderflow() { printf(" \ n --- Demonstrating Underflow --- \ n"); top = - 1; pop(); } 4. #include #include #include #define MAX 100 char stack[MAX]; int top = - 1; void push(char sym) { stack[++top] = sym; } char pop() { return stack[top -- ]; } char peek() { return (top == - 1) ? ' \ 0' : stack[top]; } int precedence(char op) { switch (op) { case '^': return 3; case '*': case '/': case '%': return 2; case '+': case ' - ': return 1; default: return 0; } } int isOperator(char sym) { return (sym == '+' || sym == ' - ' || sym == '*' || sym == '/' || sym == '%' || sym == '^'); } void infixToPostfix(char infix[], char postfix[]) { int i, j = 0; char sym; for (i = 0; infix[i] != ' \ 0'; i++) { sym = infix[i]; if (sym == ' ' || sym == ' \ t') continue; else if (isalnum(sym)) postfix[j++] = sym; else if (sym == '(') push(sym); else if (sym == ')') { while (peek() != '(') postfix[j++] = pop(); pop(); // remove '(' } else if (isOperator(sym)) { while (top != - 1 && ((precedence(peek()) > precedence(sym)) || (precedence(peek()) == precedence(sym) && sym != '^')) &&peek() != '(') { postfix[j++] = pop(); } push(sym); } } while (top != - 1) postfix[j++] = pop(); postfix[j] = ' \ 0'; } int main() { char infix[MAX], postfix[MAX]; printf("Enter infix expression: "); scanf("%[^ \ n]", infix); infixToPostfix(infix, postfix); printf("Postfix expression: %s \ n", postfix); return 0; } 5. #include #include // for pow() #include // for isdigit() #define MAX 100 int stack[MAX]; int top = - 1; void push(int val) { stack[++top] = val; } int pop() { return stack[top -- ]; } int evaluatePostfix(char exp[]) { int i, op1, op2, res; for (i = 0; exp[i] != ' \ 0'; i++) { char ch = exp[i]; if (isdigit(ch)) { // convert char digit to int push(ch - '0'); } else if (ch == ' ') { continue; // skip spaces } else { op2 = pop(); op1 = pop(); switch (ch) { case '+': res = op1 + op2; break; case ' - ': res = op1 - op2; break; case '*': res = op1 * op2; break; case '/': res = op1 / op2; break; case '%': res = op1 % op2; break; case '^': res = pow(op1, op2); break; } push(res); } } return pop(); // Final result } // ---------- (b) TOWER OF HANOI ---------- void towerOfHanoi(int n, char from, char to, char aux) { if (n == 1) { printf("Move disk 1 from %c → %c \ n", from, to); return; } towerOfHanoi(n - 1, from, aux, to); printf("Move disk %d from %c → %c \ n", n, from, to); towerOfHanoi(n - 1, aux, to, from); } // ---------- MAIN MENU ---------- int main() { int choice, n; char exp[100]; while (1) { printf(" \ n===== STACK APPLICATIONS ===== \ n"); printf("1. Evaluate Postfix Expression \ n"); printf("2. Solve Tower of Hanoi \ n"); printf("3. Exit \ n"); printf("Enter your choice: "); scanf("%d", &choice); getchar(); // consume newline switch (choice) { case 1: printf("Enter a postfix expression (use single digits & spaces): "); fgets(exp, sizeof(exp), stdin); printf("Result = %d \ n", evaluatePostfix(exp)); break; case 2: printf("Enter number of disks: "); scanf("%d", &n); printf(" \ nSteps to solve Tower of Hanoi with %d disks: \ n", n); towerOfHanoi(n, 'A', 'C', 'B'); break; case 3: printf("Exiting... \ n"); return 0; default: printf("Invalid choice! Try again. \ n"); } } } 6. #include #include #define MAX 5 char queue[MAX]; int front = - 1, rear = - 1; void insert(char element); void delete(); void display(); int main() { int choice; char element; while (1) { printf(" \ n ----- Circular Queue Menu ----- \ n"); printf("1. Insert an Element \ n"); printf("2. Delete an Element \ n"); printf("3. Display the Queue \ n"); printf("4. Exit \ n"); printf(" -------------------------------- \ n"); printf("Enter your choice: "); scanf("%d", &choice); switch (choice) { case 1: printf("Enter the character to insert: "); scanf(" %c", &element); insert(element); break; case 2: delete(); break; case 3: display(); break; case 4: printf("Exiting program... \ n"); exit(0); default: printf("Invalid choice! Please try again. \ n"); } } return 0; } void insert(char element) { // Check for overflow if ((front == 0 && rear == MAX - 1) || (front == rear + 1)) { printf("Queue Overflow! Cannot insert '%c'. \ n", element); return; } if (front == - 1) front = rear = 0; else if (rear == MAX - 1) rear = 0; else rear++; queue[rear] = element; printf("Inserted '%c' into the queue. \ n", element); } void delete() { if (front == - 1) { printf("Queue Underflow! No elements to delete. \ n"); return; } char deletedElement = queue[front]; if (front == rear) front = rear = - 1; else if (front == MAX - 1) front = 0; else front++; printf("Deleted element: '%c' \ n", deletedElement); } void display() { if (front == - 1) { printf("Queue is empty. \ n"); return; } printf("Queue elements: "); int i = front; while (1) { printf("%c ", queue[i]); if (i == rear) break; i = (i + 1) % MAX; } printf(" \ n"); printf("Front = %d, Rear = %d \ n", front, rear); } 7. #include #include #include struct Student { char usn[20], name[50], programme[20], phno[15]; int sem; struct Student *next; }; struct Student *first = NULL; // changed from head → first // Function to create a new node struct Student* createNode() { struct Student *newNode = (struct Student*)malloc(sizeof(struct Student)); if (!newNode) { printf("Memory allocation failed! \ n"); exit(1); } printf("Enter USN: "); scanf("%s", newNode - >usn); printf("Enter Name: "); scanf("%s", newNode - >name); printf("Enter Programme: "); scanf("%s", newNode - >programme); printf("Enter Semester: "); scanf("%d", &newNode - >sem); printf("Enter Phone Number: "); scanf("%s", newNode - >phno); newNode - >next = NULL; return newNode; } // a) Create SLL using front insertion void createFront(int n) { struct Student *newNode; for (int i = 0; i < n; i++) { printf(" \ nEnter details of Student %d \ n", i + 1); newNode = createNode(); newNode - >next = first; first = newNode; } printf(" \ nSLL created using front insertion. \ n"); } // b) Display SLL and count nodes void display() { struct Student *temp = first; int count = 0; if (temp == NULL) { printf(" \ nList is Empty. \ n"); return; } printf(" \ n ----- Student List ----- \ n"); while (temp != NULL) { printf(" \ nUSN: %s \ nName: %s \ nProgramme: %s \ nSem: %d \ nPhone: %s \ n", temp - >usn, temp - >name, temp - >programme, temp - >sem, temp - >phno); temp = temp - >next; count++; } printf(" \ nTotal number of nodes: %d \ n", count); } // c) Insert at End void insertEnd() { struct Student *newNode = createNode(); if (first == NULL) { first = newNode; return; } struct Student *temp = first; while (temp - >next != NULL) temp = temp - >next; temp - >next = newNode; } void deleteEnd() { if (first == NULL) { printf(" \ nList is Empty! \ n"); return; } struct Student *temp = first; if (temp - >next == NULL) { free(temp); first = NULL; printf(" \ nLast node deleted. \ n"); return; } struct Student *prev = NULL; while (temp - >next != NULL) { prev = temp; temp = temp - >next; } prev - >next = NULL; free(temp); printf(" \ nNode deleted from end. \ n"); void insertFront() { struct Student *newNode = createNode(); newNode - >next = first; first = newNode; printf(" \ nNode inserted at front. \ n"); } void deleteFront() { if (first == NULL) { printf(" \ nList is Empty! \ n"); return; } struct Student *temp = first; first = first - >next; printf(" \ nDeleted node with USN: %s \ n", temp - >usn); free(temp); } int main() { int choice, n; while (1) { printf(" \ n ----- SLL MENU ----- \ n"); printf("1. Create SLL using front insertion \ n"); printf("2. Display and count nodes \ n"); printf("3. Insert at End \ n"); printf("4. Delete from End \ n"); printf("5. Insert at Front (Push) \ n"); printf("6. Delete from Front (Pop) \ n"); printf("7. Exit \ n"); printf("Enter your choice: "); scanf("%d", &choice);

Segnala un abuso

Dettagli PDF

Informazioni sul contatto

DSA

dddf

fdfdrdfd