In an examination, a student scores 4 marks for every correct answer and loses 1 mark for every wrong answer. If she/he attempts all 60 questions and secures 130 marks, the number of questions she/he attempts wrongly are?
Show Hint
- 38
- 22
- 21
- 37
The Correct Option is B
Solution and Explanation
Let the number of correct answers be \( x \). Then the number of wrong answers will be \( 60 - x \). The total score is calculated as: \[ 4x - (60 - x) = 130 \] Simplifying the equation: \[ 4x - 60 + x = 130 \] \[ 5x - 60 = 130 \] \[ 5x = 190 \] \[ x = 38 \] Thus, the student answered 38 questions correctly. The number of wrong answers is \( 60 - 38 = 22 \).
Step 2: Conclusion.
Hence, the number of wrong answers is 22. Therefore, the correct answer is 2. 22.
Top Questions on Basic Algebra
- Which of the following example expresses the commutative law of multiplication ?
- Bihar Board XII - 2025
- Computer Science
- Basic Algebra
- Which of the following example expresses the commutative law of multiplication ?
- Bihar Board XII - 2025
- Computer Science
- Basic Algebra
The following empirical relationship describes how the number of trees \( N(t) \) in a patch changes over time \( t \): \[ N(t) = -2t^2 + 12t + 24 \] where \( t = 0 \) is when the number of trees were first counted. Given this relationship, the maximum number of trees that occur in the patch is
- GATE EY - 2025
- Mathematics
- Basic Algebra
- A number when multiplied by 18, increased by 357. The number is:
- NCHMCT JEE - 2024
- Quantitative Aptitude
- Basic Algebra
- In a zoo, three lions and four tigers eat 390 kg of food every week. In another zoo, four lions and five tigers eat 500 kg of food every week. Lions and tigers eat different amounts of food, but all individuals of the same species eat the same amount. The amount of food a single lion eats per week is _______ kg. (Answer in integer)
- GATE EY - 2023
- Mathematics
- Basic Algebra
Questions Asked in CUET PG exam
- Which of the following is not the application of Divide and Conquer technique?
- CUET (PG) - 2025
- Algorithms
In C language, mat[i][j] is equivalent to: (where mat[i][j] is a two-dimensional array)
- CUET (PG) - 2025
- Pointers and Arrays
Suppose a minimum spanning tree is to be generated for a graph whose edge weights are given below. Identify the graph which represents a valid minimum spanning tree?
\[\begin{array}{|c|c|}\hline \text{Edges through Vertex points} & \text{Weight of the corresponding Edge} \\ \hline (1,2) & 11 \\ \hline (3,6) & 14 \\ \hline (4,6) & 21 \\ \hline (2,6) & 24 \\ \hline (1,4) & 31 \\ \hline (3,5) & 36 \\ \hline \end{array}\]
Choose the correct answer from the options given below:
- CUET (PG) - 2025
- Graph Theory
Match LIST-I with LIST-II
Choose the correct answer from the options given below:
- CUET (PG) - 2025
- Graph Theory
Consider the following set of processes, assumed to have arrived at time 0 in the order P1, P2, P3, P4, and P5, with the given length of the CPU burst (in milliseconds) and their priority:
\[\begin{array}{|c|c|c|}\hline \text{Process} & \text{Burst Time (ms)} & \text{Priority} \\ \hline \text{P1} & 10 & 3 \\ \hline \text{P2} & 1 & 1 \\ \hline \text{P3} & 4 & 4 \\ \hline \text{P4} & 1 & 2 \\ \hline \text{P5} & 5 & 5 \\ \hline \end{array}\]
Using priority scheduling (where priority 1 denotes the highest priority and priority 5 denotes the lowest priority), find the average waiting time.
- CUET (PG) - 2025
- Scheduling Algorithms