How do you declare a pointer to an integer in C?
- int ptr;
- int* ptr;
- int_pointer ptr;
- pointer(int) p;
To declare a pointer to an integer in C, you use the format int* ptr;. This declares a pointer variable named ptr that can store the address of an integer.
You are working on a software project in C++ that requires sorting a list of items in multiple ways. How could you leverage function overloading to achieve this?
- Define multiple functions with the same name but different parameters for each sorting method.
- Implement a single function with the most generic sorting algorithm to handle all sorting needs.
- Use inline functions for sorting, allowing for multiple sorting methods within one function.
- Utilize global variables to store sorting methods for easy access and reuse.
Function overloading in C++ allows you to define multiple functions with the same name but different parameters, enabling the use of various sorting methods for different data types.
You're developing an embedded system with limited memory and need to define several constants representing the states of a system. Which C construct would be most appropriate to use?
- Using functions
- Using global variables
- Using local variables
- Using macros
In an embedded system with limited memory, using macros would be most appropriate for defining constants as they are preprocessor directives and are more memory-efficient than global or local variables. Functions are not used for constants.
When declaring a variable in C, what does the 'static' keyword do to the variable's lifetime?
- Doesn't affect it
- Extends it
- Initializes it
- Shortens it
The 'static' keyword in C extends the lifetime of a variable, allowing it to retain its value between function calls, making it suitable for data that persists.
What is the time complexity of the bubble sort algorithm in the best case?
- O(1)
- O(log n)
- O(n)
- O(n^2)
The best-case time complexity of the bubble sort algorithm is O(n) when the array is already sorted, and no swaps are required during the pass.
When would it be beneficial to use a function pointer instead of a direct function call?
- Dynamically choosing a function to execute
- Enhancing compile-time error checking
- Reducing code complexity
- Simplifying code structure
Using a function pointer is beneficial when you need to dynamically choose a function to execute at runtime. It offers flexibility and is useful in various scenarios.
Which function is used to close a file that has been opened using fopen?
- fclose
- fopen
- fread
- fwrite
The fclose function is used to close a file that has been opened using fopen. This is important to release system resources and ensure data is properly saved.
What is the primary purpose of using pointers in a C function?
- To allocate memory dynamically
- To execute loops
- To perform arithmetic operations
- To store character data
Pointers in C allow you to allocate memory dynamically. They are often used to work with data structures, dynamic memory allocation, and creating flexible functions.
You are developing an application that needs to represent a value that could either be an integer or a floating-point number. How could you efficiently represent this data using C?
- Using a linked list
- Using a structure
- Using a union
- Using an array
In C, a union allows you to efficiently represent data that can be either an integer or a floating-point number, as it allows sharing the same memory location for different data types. Arrays, structures, and linked lists are not suitable for this purpose.
Using a union can lead to efficient memory usage when you need to store different ________ at different times.
- data types
- members
- structures
- values
When you use a union, you can store different data types in the same memory location, depending on the specific member you access. This can help save memory when you need to handle various types of data at different times.
In C programming, what is tail recursion?
- A recursion that involves a loop
- A recursion with a base case at the beginning
- A recursion with a base case at the end
- A recursion with no base case
Tail recursion in C is a type of recursion where the base case is located at the end of the recursive function. This means that the recursive call is the last operation in the function, making it more efficient and easier for the compiler to optimize.
An array of structures in C allows you to store multiple records, where each record can have ________ of different data types.
- Elements
- Fields
- Files
- Functions
An array of structures allows you to store multiple records, where each record can have fields of different data types. Fields represent the individual members of each structure.