Write a c program to store records of n students based on roll_no, name, gender and 5 subject marks Calculate percentage each student using 5 subjects., Display the student list according to their percentages

 #include <stdio.h>

#include <stdlib.h>

#include <string.h>


// Define a structure to represent a student

typedef struct {

    int roll_no;

    char name[50];

    char gender;

    int marks[5];

    float percentage;

} Student;


// Function to read student details

void readStudent(Student *student) {

    printf("Enter roll number: ");

    scanf("%d", &student->roll_no);

    printf("Enter name: ");

    scanf(" %[^\n]%*c", student->name);  // Read string with spaces

    printf("Enter gender (M/F): ");

    scanf(" %c", &student->gender);

    printf("Enter marks for 5 subjects: ");

    for (int i = 0; i < 5; i++) {

        scanf("%d", &student->marks[i]);

    }

}


// Function to calculate percentage

void calculatePercentage(Student *student) {

    int total = 0;

    for (int i = 0; i < 5; i++) {

        total += student->marks[i];

    }

    student->percentage = total / 5.0;

}


// Function to display student details

void displayStudent(Student student) {

    printf("Roll No: %d\n", student.roll_no);

    printf("Name: %s\n", student.name);

    printf("Gender: %c\n", student.gender);

    printf("Marks: ");

    for (int i = 0; i < 5; i++) {

        printf("%d ", student.marks[i]);

    }

    printf("\nPercentage: %.2f\n", student.percentage);

}


// Comparator function for qsort to sort students by percentage

int compareByPercentage(const void *a, const void *b) {

    Student *studentA = (Student *)a;

    Student *studentB = (Student *)b;

    return (studentB->percentage - studentA->percentage) * 100;  // Multiply by 100 to avoid float comparison issues

}


int main() {

    int n;

    printf("Enter the number of students: ");

    scanf("%d", &n);


    Student *students = (Student *)malloc(n * sizeof(Student));


    // Read student details and calculate percentages

    for (int i = 0; i < n; i++) {

        printf("\nEnter details for student %d:\n", i + 1);

        readStudent(&students[i]);

        calculatePercentage(&students[i]);

    }


    // Sort students by percentage

    qsort(students, n, sizeof(Student), compareByPercentage);


    // Display student list sorted by percentage

    printf("\nStudent list sorted by percentage:\n");

    for (int i = 0; i < n; i++) {

        displayStudent(students[i]);

        printf("\n");

    }


    free(students);

    return 0;

}


Comments

Post a Comment

Popular posts from this blog

Write a c program to Create a Circular Linked list and perform Following Operations A. Insertion At Beginning B. Insertion At End C. Insertion After a particular node Insertion Before a particular node E. Insertion at specific position F. Search a particular node G. Return a particular node H. Deletion at the beginning I. Deletion at the end J. Deletion after a particular node K. Deletion before a particular node L. Delete a particular node M. Deletion at a specific position

#include <stdio.h> #include <stdlib.h> // Define the structure for a node in the linked list struct Node {     int data;     struct Node* next; }; // Function to create a new node with given data struct Node* createNode(int data) {     struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));     newNode->data = data;     newNode->next = NULL;     return newNode; } // Function to insert a node at the beginning of the linked list void insertAtBeginning(struct Node** head, int data) {     struct Node* newNode = createNode(data);     newNode->next = *head;     *head = newNode; } // Function to insert a node at the end of the linked list void insertAtEnd(struct Node** head, int data) {     struct Node* newNode = createNode(data);     if (*head == NULL) {         *head = newNode;         return;     } ...
Read more

Write a c program to check whether the created linked list is palindrome or not

 #include <stdio.h> #include <stdlib.h> #include <stdbool.h> // Define the structure for a node in the linked list struct Node {     int data;     struct Node* next; }; // Function to create a new node with given data struct Node* createNode(int data) {     struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));     newNode->data = data;     newNode->next = NULL;     return newNode; } // Function to insert a node at the end of the linked list void insertAtEnd(struct Node** head, int data) {     struct Node* newNode = createNode(data);     if (*head == NULL) {         *head = newNode;         return;     }     struct Node* temp = *head;     while (temp->next != NULL) {         temp = temp->next;     }     temp->next = newNode; } // Function to print the ...
Read more

Write a c program to Create a Circular single Linked list and perform Following Operations A. Insertion After a particular node B. Insertion Before a particular node C. Search a particular node D. Return a particular node E. Deletion before a particular node F. Delete a particular node

 #include <stdio.h> #include <stdlib.h> // Define the structure for a node in the circular linked list struct Node {     int data;     struct Node* next; }; // Function to create a new node with given data struct Node* createNode(int data) {     struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));     newNode->data = data;     newNode->next = NULL;     return newNode; } // Function to insert a node at the beginning of the circular linked list void insertAtBeginning(struct Node** head, int data) {     struct Node* newNode = createNode(data);     if (*head == NULL) {         newNode->next = newNode;         *head = newNode;     } else {         struct Node* temp = *head;         while (temp->next != *head) {             temp = temp->next;   ...
Read more