Bissoy.com
Doctors Medicines MCQs Q&A

Which of the following operator takes only integer operands?

Which of the following operator takes only integer operands? Correct Answer %

In C, the modulus operator (%) takes only integer operands. It is used to find the remainder when one integer is divided by another. This operator is specifically designed for integer arithmetic.

Option A (+) represents the addition operator, which can take both integer and floating-point operands.
Option B (*) represents the multiplication operator, which can take both integer and floating-point operands.
Option C (/) represents the division operator, which can take both integer and floating-point operands.
Option E (None of these) is incorrect because % is the operator that specifically takes only integer operands; the other options can take both integer and floating-point operands.

Related Questions

A particular BNF definition for a “word” is given by the following rules. ∷ = | | ∷ = |  ∷ = |  ∷ = a | b | c | ….. |y| z  ∷ = 0 |1|2| …… | 9 Which of the following lexical entries can be derived from < word > ? l. pick II. picks lll. c44
The following code segment is executed on a processor which allows only register operands in its instructions. Each instruction can have atmost two source operands and one destination operand. Assume that all variables are dead after this code segment. c = a + b; d = c * a; e = c + a; x = c * c; if (x > a) {     y = a * a; } else {      d = d * d;      e = e * e; } Suppose the instruction set architecture of the processor has only two registers. The only allowed compiler optimization is code motion, which moves statements from one place to another while preserving correctness. What is the minimum number of spills to memory in the compiled code?
The following code segment is executed on a processor which allows only register operands in its instructions. Each instruction can have atmost two source operands and one destination operand. Assume that all variables are dead after this code segment. c = a + b; d = c * a; e = c + a; x = c * c; if (x > a) {     y = a * a; } else {      d = d * d;      e = e * e; } What is the minimum number of registers needed in the instruction set architecture of the processor to compile this code segment without any spill to memory? Do not apply any optimization other than optimizing register allocation.
Suppliers(Sid: integer, sname:string, city:string, street:string) Parts(pid:integer, pname:string, color:string) Catalog(sid:integer, pid:integer, cost:real) Consider the following relational query on the above database: SELECT S.sname FROM Suppliers S  WHERE S.sid NOT IN (SELECT C.sid FROM Catalog C WHERE C.pid NOT IN (SELECT P.pid FROM Parts P WHERE P.color < > ‘blue’)) Assume that relations corresponding to the above schema are not empty. Which of the following is the correct interpretation of the above query?
Consider the following relational schema. Students(rollno: integer, sname: string) Courses(courseno: integer, cname: string) Registration(rollno: integer, courseno: integer, percent: real) Which of the following queries are equivalent to this query in English? “Find the distinct names of all students who score more than 90% in the course numbered 107” (I) SELECT DISTINCT S.sname FROM Students as S, Registration as R WHERE R.rollno=S.rollno AND R.courseno=107 AND R.percent >90 (II) Πsname (σcourseno = 107∧percent>90 (Registration ⋈ Students)) (III) {T | ∃S ∈ Students, ∃R ∈ Registration (S.rollno = R.rollno ∧R. courseno = 107 ∧ R.percent > 90 ∧ T.sname = S. sname)} (IV) {〈SN〉 | ∃SR∃RP(〈SR, SN〉 ∈ Students ∧ 〈SR, 107, RP〉 ∈ Registration ∧ RP > 90)}
Which of the following operators takes only integer operands?
The sum o three integers is 40. The largest integer is 3 times the middle integer, and the smallest integer is 23 less than the largest integer. what is the product of the three integers?
When a certain positive integer P is divided by another positive integer, the remainder is $${r_{1}}$$ . When a second positive integer Q is divided by the same integer, the remainder is $${r_{2}}$$ and when (P + Q) is divided by the same divisor, the remainder is $${r_{3}}$$ . Then the divisor may be :
Consider two binary operators ‘↑’ and ‘↓’ with the precedence of operator ↓ being lower than that of the operator ↑. Operator ↑ is right associative while operator ↓ is left associative. Which one of the following represents the parse tree for expression (7↓3↑4↑3↓2)?
Consider two binary operators ‘↑’ and ‘↓’ with the precedence of operator ↓being lower than that of the operator ↑. Operator ↑ is right associative while operator ↓ is left associative. Which one of the following represents the parse tree for expression (7 ↓ 3 ↑ 4 ↑ 3 ↓ 2)?