Ds
[9/17, 8:38 AM] Rudresh Engg: #include <stdio.h>
#include <string.h>
// Structure definition for storing student details
struct Student {
int id; // Student ID
char name[50]; // Student name
int age; // Student age
char address[100]; // Student address
};
int main() {
int n, i;
// Ask user for number of students
printf("Enter number of students: ");
scanf("%d", &n);
// Create an array of Student structures
struct Student students[n];
// Input student details
for(i = 0; i < n; i++) {
printf("\nEnter details of student %d:\n", i+1);
printf("ID: ");
scanf("%d", &students[i].id);
printf("Name: ");
scanf(" %[^\n]", students[i].name); // Read string with spaces
printf("Age: ");
scanf("%d", &students[i].age);
printf("Address: ");
scanf(" %[^\n]", students[i].address); // Read string with spaces
}
// Display the student database
printf("\n--- Student Database ---\n");
for(i = 0; i < n; i++) {
printf("\nID: %d\nName: %s\nAge: %d\nAddress: %s\n",
students[i].id, students[i].name,
students[i].age, students[i].address);
}
return 0;
}
[9/17, 8:38 AM] Rudresh Engg: #include <stdio.h>
#define SIZE 5 // Maximum size of queue
int queue[SIZE]; // Array to store queue elements
int front = -1; // Index of front element
int rear = -1; // Index of rear element
// Function to insert (enqueue) an element into the queue
void enqueue(int value) {
if (rear == SIZE - 1) {
// If rear reaches end, queue is full
printf("Queue Overflow! Cannot insert %d\n", value);
} else {
if (front == -1) front = 0; // First insertion
queue[++rear] = value; // Insert value and increment rear
printf("%d inserted into queue.\n", value);
}
}
// Function to remove (dequeue) an element from the queue
void dequeue() {
if (front == -1 || front > rear) {
// If queue is empty
printf("Queue Underflow! No elements to delete.\n");
} else {
printf("%d deleted from queue.\n", queue[front++]);
// Reset queue when all elements are removed
if (front > rear) {
front = rear = -1;
}
}
}
// Function to display all elements in the queue
void display() {
if (front == -1) {
printf("Queue is Empty.\n");
} else {
printf("Queue elements: ");
for (int i = front; i <= rear; i++) {
printf("%d ", queue[i]);
}
printf("\n");
}
}
int main() {
int choice, value;
// Menu-driven program for queue operations
do {
printf("\n--- Queue Menu ---\n");
printf("1. Enqueue\n2. Dequeue\n3. Display\n4. Exit\n");
printf("Enter your choice: ");
scanf("%d", &choice);
switch(choice) {
case 1:
// Insert element
printf("Enter value to enqueue: ");
scanf("%d", &value);
enqueue(value);
break;
case 2:
// Remove element
dequeue();
break;
case 3:
// Display queue
display();
break;
case 4:
// Exit program
printf("Exiting...\n");
break;
default:
printf("Invalid choice! Please try again.\n");
}
} while(choice != 4);
return 0;
}
Comments
Post a Comment