In a three-level indexing system, the first level contains pointers to the second-level index blocks, which in turn point directly to data blocks.

Multi-level indexing in a file system is used to manage large files efficiently by breaking index structures into multiple levels.

If you open a file and add some data to it, which of the following information may be updated in the file's inode?

Consider the following five functions:

char* f1(char* s)
{
  s += 5;
  *s = 0;
  return s; 
}
char* f2(char* s1)
{
  char* s2 = s1;
  s2[5] = '\0';
  return s1; 
}
char* f3(char* s1)
{
  char s2[5] = s1;
  return s2;
}
char* f4(char* s)
{
  return strstr(s, "Hello");
}
char* f5(char* s1)
{
  char* s2 = NULL;
  strncpy(s2, s1, 5);
  return s2;
}

and consider the following variable:

char string[] = "Hello world!";

For each of the functions, choose the appropriate statement when called on string.

Consider the following variable:

Assume that x is a double variable and that f is a pointer to a function taking a double and returning a double.

Tick all the possible calls to f.

Penalty for wrong ticks.

What does the following code print?

#include <stdio.h>
#include <string.h>
void f(char* string)
{
  const size_t size = strlen(string);
  if (size >= 8) string[7] = '\0';
  if (size >= 5) string[4] = 'a';
  puts(string);
}
int main(void) 
{
  f("How qre you?");
  return 0;
}

What is the correct way to define a type funct to point to a function taking a pointer to an int

an returning a pointer to an int?

We want to write a generic function that can add all the elements of an array (of unknown type, e.g. real numbers, complex numbers, vectors, matrices, ...) and get the result of the sum (of unknown type), either as a return value or passed by reference (then returning some error code).

Penalty for wrong ticks.

Select all the correct statements about a void* variable.