Oops! That page can't be found.

Back to homepage

Directions to Solve

Each sentences below consist of a word or a phrase which is bold. It is followed by four words or phrases. Select the word or pharse which is closes to the OPPOSITE in meaning of the bold word or phrase.

Q1: He abandoned his family.

A saved

B pleased

C supported

D encouraged

Q2: What will be the output of the program?

#include<stdio.h>
#define MIN(x, y) (x<y)? x : y;
int main()
{
    int x=3, y=4, z;
    z = MIN(x+y/2, y-1);
    if(z > 0)
        printf('%d\n', z);
    return 0;
}

A 4

B No output

C 0

D 3

Q3: The comments in ADHL are enclosed between # characters.

A False

B True

Q4: The expressions, , are equivalent.

A False

B True

Q5: The output of a NAND gate is the inverse of the output for an AND gate for all possible input combinations.

A False

B True

Q6: NOR gates can be used to construct AND gates.

A True

B False

Q7: The commutative law of Boolean addition states that A + B = A · B.

A True

B False

Q8:
The figure given below is an example of the implementation of AND-OR-INVERT logic.

A True

B False

Q9: The OR gate performs like two switches wired in a series.

A False

B True

Q10: The inputs to an AND gate are: A = 1, B = 0, C = 1. The output will be LOW.

A False

B True

Oops! That page can't be found.

Q1: He abandoned his family.

Q2: What will be the output of the program?
`#include<stdio.h> #define MIN(x, y) (x<y)? x : y; int main() { int x=3, y=4, z; z = MIN(x+y/2, y-1); if(z > 0) printf('%d\n', z); return 0; }`

Q3: The comments in ADHL are enclosed between # characters.

Q4: The expressions, , are equivalent.

Q5: The output of a NAND gate is the inverse of the output for an AND gate for all possible input combinations.

Q6: NOR gates can be used to construct AND gates.

Q7: The commutative law of Boolean addition states that A + B = A · B.

Q8:
The figure given below is an example of the implementation of AND-OR-INVERT logic.

Q9: The OR gate performs like two switches wired in a series.

Q10: The inputs to an AND gate are: A = 1, B = 0, C = 1. The output will be LOW.

Quick Links

Newsletter

404 Not Found

Oops! That page can't be found.

Q1: He abandoned his family.

Solution

Q2: What will be the output of the program? #include<stdio.h> #define MIN(x, y) (x<y)? x : y; int main() { int x=3, y=4, z; z = MIN(x+y/2, y-1); if(z > 0) printf('%d\n', z); return 0; }

Solution

Q3: The comments in ADHL are enclosed between # characters.

Solution

Q4: The expressions, , are equivalent.

Solution

Q5: The output of a NAND gate is the inverse of the output for an AND gate for all possible input combinations.

Solution

Q6: NOR gates can be used to construct AND gates.

Solution

Q7: The commutative law of Boolean addition states that A + B = A · B.

Solution

Q8: The figure given below is an example of the implementation of AND-OR-INVERT logic.

Solution

Q9: The OR gate performs like two switches wired in a series.

Solution

Q10: The inputs to an AND gate are: A = 1, B = 0, C = 1. The output will be LOW.

Solution

Q2: What will be the output of the program?
`#include<stdio.h> #define MIN(x, y) (x<y)? x : y; int main() { int x=3, y=4, z; z = MIN(x+y/2, y-1); if(z > 0) printf('%d\n', z); return 0; }`

Q8:
The figure given below is an example of the implementation of AND-OR-INVERT logic.