Context: smart planner using array,function,switch case,loop in c programming language not using any thing else

To create a smart planner using arrays, functions, switch-case statements, and loops in C programming, follow these steps:

1. Break Down the Problem

1. Define the purpose of the smart planner (e.g., scheduling tasks, reminders).
2. Determine the data to store (e.g., task names, deadlines).
3. Decide on the functionalities (e.g., add task, view tasks, delete task).
4. Identify how user input will influence the program (e.g., menu options).

2. Relevant Concepts

• Arrays: To store tasks and their details.
• Functions: To define operations like adding and viewing tasks.
• Switch-Case Statements: To handle user menu options.
• Loops: To continuously display the menu and take user input until a certain condition is met.

3. Analysis and Detail

Here’s an example code structure:

#include <stdio.h>
#include <string.h>

#define MAX_TASKS 100
#define TASK_NAME_LENGTH 50

// Declare arrays to hold tasks
char tasks[MAX_TASKS][TASK_NAME_LENGTH];
int taskCount = 0;

// Function prototypes
void addTask();
void viewTasks();
void deleteTask();

int main() {
    int choice;
    
    do {
        // Display menu
        printf("Smart Planner Menu:\n");
        printf("1. Add Task\n");
        printf("2. View Tasks\n");
        printf("3. Delete Task\n");
        printf("4. Exit\n");
        printf("Enter your choice: ");
        scanf("%d", &choice);
        
        switch (choice) {
            case 1:
                addTask();
                break;
            case 2:
                viewTasks();
                break;
            case 3:
                deleteTask();
                break;
            case 4:
                printf("Exiting the planner.\n");
                break;
            default:
                printf("Invalid choice! Please try again.\n");
        }
    } while (choice != 4);
    
    return 0;
}

// Function to add a task
void addTask() {
    if (taskCount < MAX_TASKS) {
        printf("Enter task name: ");
        scanf(" %[^\n]", tasks[taskCount]); // allows for spaces
        taskCount++;
        printf("Task added successfully!\n");
    } else {
        printf("Task limit reached!\n");
    }
}

// Function to view tasks
void viewTasks() {
    if (taskCount == 0) {
        printf("No tasks available.\n");
    } else {
        printf("Tasks:\n");
        for (int i = 0; i < taskCount; i++) {
            printf("%d: %s\n", i + 1, tasks[i]);
        }
    }
}

// Function to delete a task
void deleteTask() {
    int index;
    printf("Enter task number to delete: ");
    scanf("%d", &index);
    
    if (index > 0 && index <= taskCount) {
        for (int i = index - 1; i < taskCount - 1; i++) {
            strcpy(tasks[i], tasks[i + 1]); // Shift tasks to the left
        }
        taskCount--;
        printf("Task deleted successfully!\n");
    } else {
        printf("Invalid task number!\n");
    }
}

4. Verify and Summarize

• The code consists of a loop that displays a menu until the user chooses to exit.
• The tasks are managed using an array.
• Functions are used to encapsulate adding, viewing, and deleting tasks.
• The switch-case statement allows for easy management of different menu options.

Final Answer

Use the provided C code structure to implement a smart planner that utilizes arrays, functions, switch-case statements, and loops effectively. Adjust the MAX_TASKS define if you need to allow for more tasks.