Write a C program that uses functions to perform the following Operations Reading a complex number, Writing a complex number, Addition of two complex numbers, Multiplication of two complex numbers

 #include <stdio.h>


// Define a structure to represent a complex number

typedef struct {

    float real;

    float imag;

} Complex;


// Function to read a complex number

Complex readComplex() {

    Complex c;

    printf("Enter real part: ");

    scanf("%f", &c.real);

    printf("Enter imaginary part: ");

    scanf("%f", &c.imag);

    return c;

}


// Function to write (print) a complex number

void writeComplex(Complex c) {

    if (c.imag >= 0)

        printf("%.2f + %.2fi\n", c.real, c.imag);

    else

        printf("%.2f - %.2fi\n", c.real, -c.imag);

}


// Function to add two complex numbers

Complex addComplex(Complex c1, Complex c2) {

    Complex result;

    result.real = c1.real + c2.real;

    result.imag = c1.imag + c2.imag;

    return result;

}


// Function to multiply two complex numbers

Complex multiplyComplex(Complex c1, Complex c2) {

    Complex result;

    result.real = c1.real * c2.real - c1.imag * c2.imag;

    result.imag = c1.real * c2.imag + c1.imag * c2.real;

    return result;

}


int main() {

    Complex c1, c2, sum, product;


    printf("Enter the first complex number:\n");

    c1 = readComplex();

    

    printf("Enter the second complex number:\n");

    c2 = readComplex();


    // Display the complex numbers

    printf("First complex number: ");

    writeComplex(c1);

    

    printf("Second complex number: ");

    writeComplex(c2);


    // Perform addition

    sum = addComplex(c1, c2);

    printf("Sum of the complex numbers: ");

    writeComplex(sum);


    // Perform multiplication

    product = multiplyComplex(c1, c2);

    printf("Product of the complex numbers: ");

    writeComplex(product);


    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