The bitwise NOT operator (~) performs a _______ operation on each bit of a number.
- negation
- AND
- OR
- XOR
The bitwise NOT operator (~) inverts each bit of a number. If the bit is 0, it becomes 1, and if it's 1, it becomes 0. This is essentially a negation operation on individual bits.
The return type of a function that does not return any value is specified as _______.
- char
- int
- double
- void
The "void" return type specifies that a function doesn't return a value. It's used when the primary purpose of the function is to perform an action, not produce data.
What happens if you try to delete memory using the delete operator more than once?
- It gets deleted twice
- No effect
- Program crashes
- Memory gets duplicated
Deleting a memory location more than once leads to undefined behavior, most commonly resulting in program crashes. Always ensure memory is deleted once and pointers are set to nullptr afterwards.
In which year was the C++98 standard officially published?
- 1990
- 1995
- 1998
- 2002
The C++98 standard was officially published in 1998. It was the first standardized version of the C++ language, providing a foundation for many modern C++ features and establishing a baseline for future improvements.
How is a friend class defined in C++?
- By inheriting the original class.
- By using the friendship keyword.
- By prefixing the class with the friend keyword.
- By including the class's header file in the original class.
A friend class in C++ is a class that is given permission to access the private and protected members of another class. To declare a class as a friend of another class, the friend keyword is used before the class declaration in the original class.
To read an entire string from a file, instead of a single character, use the _______ function.
- getline
- read
- fetch
- getString
The getline function is used in C++ to read an entire line from an input stream, such as a file. This is particularly useful when dealing with strings that have spaces or when reading full sentences.
What is the significance of the "default" case in a switch-case statement?
- It handles unspecified cases
- It serves as the primary case to be executed
- It is mandatory for all switch-case structures
- Acts as the else part in if-else structures
The "default" case in a switch-case statement is executed when none of the provided "case" conditions match the switch expression's value. It serves as a fallback and handles unspecified or unexpected values, ensuring that the switch has a response for all potential input. It is similar to the "else" in if-else.
The loop do { /* code */ } while(_______); will always execute the code block at least once.
- FALSE
- 1
- TRUE
- sometimes
The "do-while" loop in C++ always executes its body once before checking the condition. So even if the condition in the "while" part is "false", the body of the loop will execute once. This differentiates it from the "while" loop which checks the condition before the first execution.
Which of the following scenarios is most suitable for using a switch-case statement?
- When comparing string values.
- When there are many conditions that can occur in any order.
- When the conditions are based on a range of values.
- When dealing with enumerated values.
The switch-case structure in C++ is best suited for scenarios where a single variable's value needs to be checked against a series of constants, often seen with enumerated values. It's a cleaner and more readable alternative to a long series of if-else statements in such cases.
You are optimizing a recursive algorithm for a real-time system where function call overhead is a critical concern. What strategy might be most effective in reducing the function call overhead while maintaining the logical structure of the algorithm?
- Use inline functions.
- Optimize the algorithm's base cases.
- Introduce parallel processing.
- Rely on external libraries.
Function call overhead is the extra time and resources needed when a function is called. Using inline functions can help reduce this overhead, especially in recursive algorithms, because the function's code gets inserted (or "inlined") at each point where the function is called, eliminating the need for the typical call and return process, which can be resource-intensive.