Crowdly

canonique conjonctive

simplement conjonctive

simplement disjonctive

Suppose .

What form does this equation take?

canonical disjunctive normal form

disjunctive normal form

canonical conjunctive normal form

conjunctive normal form

int compare_squares(t_square sq1, t_square sq2) described earlier that compares two squares sq1 and sq2 based on their area, under what condition should we swap the squares arr[j] and arr[j-1] ?

We would like to sort an array of squares arr

based on their area using the insertion sort algorithm as described in the course.

Assuming you have the function

If compare_squares(arr[j], arr[j-1]) > 0.

If compare_squares(arr[j], arr[j-1]) < 0.

If compare_squares(arr[j], arr[j-1]) != 0.

If compare_squares(arr[j], arr[j-1]) == 0.

A function int area(t_square sq) that computes the area of the square sq is given.

We would like to define a function int compare_squares(t_square sq1, t_square sq2) that compares two squares sq1 and sq2 based on their area. It returns a negative integer if sq1 has a smaller area than sq2, a positive integer if sq1 has a larger area than sq2, and 0 if both squares have the same area.

Among the following definitions, which one is correct ?

int compare_squares(t_square * sq1, t_square * sq2) {
    int a1 = area(*sq1);
    int a2 = area(*sq2);
    return a1 < a2;
}

int compare_squares(t_square sq1, t_square sq2) {
    int a1 = area(sq1);
    int a2 = area(sq2);
    return a1 < a2;
}

int compare_squares(t_square sq1, t_square sq2) {
    int a1 = area(sq1);
    int a2 = area(sq2);
    return a1 - a2;
}

int compare_squares(t_square * sq1, t_square * sq2) {
    int a1 = area(sq1);
    int a2 = area(sq2);
    return a1 - a2;
}

Consider the following sequence of instructions :

t_square ** squares = (t_square **)malloc(10 * sizeof(t_square *));
for (int i = 0; i < 10; i++) {
    squares[i] = create_square(0 , i + 1, i + 1);
}

Among the following statements, which ones are true ?

To access the square with side 7, you need to write squares[6]->side.

squares is an array of 10 t_square *

squares is a matrix of t_square.

squares[0].top_left->x = 4; modifies the x field of the top left corner of squares[0].

The print_square function displays the information of a square of type t_square: the coordinates of its top left corner and its side. Among the following definitions, which one is correct ?

void print_square(t_square * c) {
    printf("top_left: (%d, %d)\n", c->top_left.x, c->top_left.y);
    printf("side: %d\n", c->side);
}

void print_square(t_square * c) {
    printf("top_left: (%d, %d)\n", c.top_left->x, c.top_left->y);
    printf("side: %d\n", c.side);
}

void print_square(t_square c) {
    printf("top_left: (%d, %d)\n", c->top_left->x, c->top_left->y);
    printf("side: %d\n", c->side);
}

50%

void print_square(t_square c) {
    printf("top_left: (%d, %d)\n", c.top_left->x, c.top_left->y);
    printf("side: %d\n", c.side);
}

int compare_squares(t_square sq1, t_square sq2) décrite précédemment qui compare deux carrés sq1 et sq2 en fonction de leur aire, à quelle condition doit-on échanger les carrés tab[j] et tab[j-1] ?

On souhaite trier un tableau de carrés tab

en fonction de leur aire avec l'algorithme du tri par insertion telle qu'il est décrit dans le cours.

En supposant que vous disposez de la fonction

Si compare_squares(tab[j], tab[j-1]) > 0.

Si compare_squares(tab[j], tab[j-1]) < 0.

Si compare_squares(tab[j], tab[j-1]) != 0.

Si compare_squares(tab[j], tab[j-1]) == 0.

Une fonction int area(t_square sq) qui calcule l'aire du carré sq vous est donnée.

On souhaite écrire une fonction int compare_squares(t_square sq1, t_square sq2) qui compare deux carrés sq1 et sq2 en fonction de leur aire. Elle renvoie un entier négatif si sq1 a une aire plus petite que sq2, un entier positif si sq1 a une aire plus grande que sq2 et 0 si les deux carrés ont la même aire.

Parmi les définitions suivantes, laquelle est correcte ?

int compare_squares(t_square * sq1, t_square * sq2) {
    int a1 = area(*sq1);
    int a2 = area(*sq2);
    return a1 < a2;
}

int compare_squares(t_square sq1, t_square sq2) {
    int a1 = area(sq1);
    int a2 = area(sq2);
    return a1 < a2;
}

int compare_squares(t_square sq1, t_square sq2) {
    int a1 = area(sq1);
    int a2 = area(sq2);
    return a1 - a2;
}

int compare_squares(t_square * sq1, t_square * sq2) {
    int a1 = area(sq1);
    int a2 = area(sq2);
    return a1 - a2;
}