Question 10942 – Programming
March 13, 2024
Access-Control-Methods
March 14, 2024
Question 10942 – Programming
March 13, 2024
Access-Control-Methods
March 14, 2024

Question 9668 – Linked-List

Consider the function f defined below.

    struct item {
        int data;
        struct item * next;
};
int f(struct item *p) {
    return ((p == NULL) || (p->next == NULL) ||
            ((P->data <= p->next->data) &&
            f(p->next)));
} 

For a given linked list p, the function f returns 1 if and only if

Correct Answer: B

Question 6 Explanation: 
It return a value ‘1’ when the elements in the list are presented in sorted order and non-decreasing order of data value.
A
the list is empty or has exactly one element
B
the elements in the list are sorted in non-decreasing order of data value
C
the elements in the list are sorted in non-increasing order of data value
D
not all elements in the list have the same data value

Leave a Reply

Your email address will not be published. Required fields are marked *