Question:
Given f(x)=1-f(2-x), then ∫20 f(X)dx=?
Given f(x)=1-f(2-x), then ∫20 f(X)dx=?
Updated On: Feb 12, 2024
- 1
- -1
- 0
- 2
Hide Solution
Verified By Collegedunia
The Correct Option is A
Solution and Explanation
The correct option is(A): 1
Was this answer helpful?
0
0
Top Questions on Numerical Estimation
- In the following series, identify the number that needs to be changed to form the Fibonacci series. 1, 1, 2, 3, 6, 8, 13, 21,...
- GATE CE - 2024
- General Aptitude
- Numerical Estimation
- In the sequence \( 6, 9, 14, x, 30, 41 \), a possible value of \( x \) is:
- GATE CS - 2024
- General Aptitude
- Numerical Estimation
- Consider a permutation sampled uniformly at random from the set of all permutations of \( \{1, 2, 3, \dots, n\} \) for some \( n \geq 4 \). Let \( X \) be the event that 1 occurs before 2 in the permutation, and \( Y \) the event that 3 occurs before 4. Which one of the following statements is TRUE?
- GATE CS - 2024
- General Aptitude
- Numerical Estimation
- A cube is to be cut into 8 pieces of equal size and shape Here each cut should be straight and it should not stop till it reaches the other end of the cube The minimum number of such cuts required?
- GATE CS - 2024
- General Aptitude
- Numerical Estimation
- \(∫_{x=0}^a ∫^{y=1}_{y=\sqrt\frac{x}{a}}\) \(e^{y^3}\) dy dx=(e-1) then the value of a is
- GATE CS - 2024
- General Aptitude
- Numerical Estimation
View More Questions
Questions Asked in GATE CS exam
- With respect to a TCP connection between a client and a server, which of the following is true?
- GATE CS - 2026
- Computer Networks
- Let $P, Q, R, S$ be relational schemas. Let ``$\rightarrow$'' indicate a functional dependency (FD) in this context. Which of the following best describes the meaning of a functional dependency?
- GATE CS - 2026
- Database Management Systems
- Let a Non-deterministic Finite Automaton (NFA) have 6 states over a finite alphabet. Which of the following cannot be the number of states in a minimal Deterministic Finite Automaton (DFA) that is equivalent to this NFA?
- GATE CS - 2026
- Theory of Computations
- A certain processor uses a fully associative cache of size 16 kB. The cache block size is 16 bytes. Assume that the main memory is byte addressable and uses a 32-bit address. How many bits are required for the Tag and the Index fields respectively in the addresses generated by the processor?
- GATE CS - 2026
- Computer Organization and Architecture
- Consider $Z = X - Y$, where $X$, $Y$ and $Z$ are all in sign-magnitude form. $X$ and $Y$ are each represented in $n$ bits. To avoid overflow, the representation of $Z$ would require a minimum of:
- GATE CS - 2026
- Computer Organization and Architecture
View More Questions