What does the following C function compute? Discover.
int some fun(int n)
{
if(n%2 == 0)
return 2;
int d, s = sqrt(n);
2
for(d = 3; d <= s; d = d+2)
if(n%d == 0)
return d;
return n;
}
This C function appears to compute the smallest prime factor of a given integer `n`. Here's how it works:
1. If `n` is even (`n % 2 == 0`), the function immediately returns `2`, which is the smallest prime factor of any even number.
2. If ______ __________ ___ _______ _________ ____ ________ ____ ____ ______ __________.
____ _________ _______ _________ _________ _____ ____.
_______ ____ _______ ________ ___ _____ _____.
________ _____ ______ __________ _______ ______ ____ ___ ___.
____ _________ _________ ________ ____ ________.
__________ _______ ______ _________ ___ ________ _________ __________ __________ __________.
____ _____ _________ _____ _________ ______ __________ ___ _____.
_____ ___ _________ ___ _________ ________.
_____ _______ _________ _______ ______ _________ ________.
___ __________ ____ _____ __________ ____ __________ ______ ________ ___ ____ ___.
____ __________ _______ _______ ____ ______ ___ _____ _________.
______ __________ ______ ________ ___ __________ ______ ________ _________ ____.
_____ _______ ______ ______ _________ __________ _________ ________ ___ ____.
_________ ________ ________ ___ ____ ________ ___.
___ ___ _______ ________ ____ ____ ___ _______ ________.
________ __________ __________ _______ _________ ________.
_____ __________ _____ _____.
Get Full Answer on WhatsApp
A C program contains the following statements:
char u, v = ‘A’;
char *pu, *pv = &v;
*pv = v+1;
u = *pv + 1;
pu = &u;
Suppose each character occupies one byte of memory. If the value assigned to u is stored in (hexadecimal) address F8C and the value assigned to v is stored in the address F8D, then
i) What value is represented by &v?
ii) What value is assigned to pv?
iii) What value is represented by *pv?
iv) What value is assigned to u?
v) What value is represented by &u?
vi) What value is assigned to pu?
Explain the use of the string library functions strncpy() and strncat(), with the help of an example for each.
Explain the meaning of the terms garbage collection, fragmentation, relocation and compaction.
Explain how will you read a three-dimensional array using for loops.
Suppose you wish to solve the equation for x. Rearrange this equation to get an appropriate fixed point iteration method. Then write a program to get an approximate value of the root of the equation. The initial guess must be entered by the user. Your programme must be able to flag a warning message if the initial guess is too far from the exact root. In that case, your program must be able to suggest an initial guess to the user. Terminate the program and print the current value of the root as soon as the difference between two successive approximations becomes smaller than 0.005
Write a C program which reads a line of text from keyboard, and writes the line to a file with lower case letters converted to upper case and vice-versa
Consider the following structure declaration of a doubly linked list:
struct dlink
{
int nodeid;
dlink *next;
dlink *prev;
} dlink t;
A pointer of the head of the linked list is maintained as a global variable, whose
definition is
dlink t *head;
The function remove element(dlink t *rp) defined below needs to remove the
node pointed to rp and adjust the head. The first node’s prev and the last node’s
next are NULL.
remove element(dlink t *rp)
{
rp->prev->next = rp->next;
rp->next->prev = rp->prev;
if(head == rp)
head = rp->next;
}
Explain whether the function remove element() works properly or not.