Which of the following control expressions are valid for an if statement? A) An integer expression B) A Boolean expression C) Either A or B D) Neither A nor B

Which of the following control expressions are valid for an if statement?
A) An integer expression
B) A Boolean expression
C) Either A or B
D) Neither A nor B
by

1 Answer

Answer :

B) A Boolean expression
by

Related questions

Which of the following control expressions are valid for an if statement? A) An integer expression B) A Boolean expression C) Either A or B D) Neither A nor B

Description : Which of the following control expressions are valid for an if statement? A) An integer expression B) A Boolean expression C) Either A or B D) Neither A nor B

Last Answer : B) A Boolean expression

Which of the following control expressions are valid for an if statement? A) an integer expression B) a Boolean expression C) either A or B D) Neither A nor B

Description : Which of the following control expressions are valid for an if statement? A) an integer expression B) a Boolean expression C) either A or B D) Neither A nor B

Last Answer : B) a Boolean expression

Consider the following statements : (a) Boolean expressions and logic networks correspond to labelled acyclic digraphs. (b) Optimal Boolean expressions may not correspond to simplest networks. (c) Choosing essential blocks first in a Karnaugh map and then greedily choosing the largest remaining blocks to cover may not give an optimal expression. Which of these statement(s) is/ are correct? (A) (a) only (B) (b) only (C) (a) and (b) (D) (a), (b) and (c)

Description : Consider the following statements : (a) Boolean expressions and logic networks correspond to labelled acyclic digraphs. (b) Optimal Boolean expressions may not correspond to simplest networks. (c) Choosing essential blocks first in a Karnaugh map ... (b) only (C) (a) and (b) (D) (a), (b) and (c)

Last Answer : (D) (a), (b) and (c) 

Consider the following statements related to compiler construction: I. Lexical Analysis is specified by context-free grammars and implemented by pushdown automata. II. Syntax Analysis is specified by regular expressions and implemented by finite-state machine. Which of the above statement(s) is/are correct? (1) Only l (2) Only ll (3) Both I and II (4) Neither I nor Il

Description : Consider the following statements related to compiler construction: I. Lexical Analysis is specified by context-free grammars and implemented by pushdown automata. II. Syntax Analysis is specified by regular expressions and implemented by ... Only l (2) Only ll (3) Both I and II (4) Neither I nor Il

Last Answer : Answer: 4

In java, ............. can only test for equality, where as ............ can evaluate any type of the Boolean expression. A) switch, if B) if, switch C) if, break D) continue, if

Description : In java, ............. can only test for equality, where as ............ can evaluate any type of the Boolean expression. A) switch, if B) if, switch C) if, break D) continue, if

Last Answer : A) switch, if

A Boolean operator Ө is defined as follows: 1Ө1=1, 1Ө0=0, 0Ө1=0 and 0Ө0=1 What will be the truth value of the expression (xӨy)Өz = xӨ(yӨz)? (A) Always false (B) Always true (C) Sometimes true (D) True when x, y, z are all true

Description : A Boolean operator Ө is defined as follows: 1Ө1=1, 1Ө0=0, 0Ө1=0 and 0Ө0=1 What will be the truth value of the expression (xӨy)Өz = xӨ(yӨz)? (A) Always false (B) Always true (C) Sometimes true (D) True when x, y, z are all true

Last Answer : (B) Always true

The dual of a Boolean expression is obtained by interchanging (A) Boolean sums and Boolean products (B) Boolean sums and Boolean products or interchanging 0's and 1's (C) Boolean sums and Boolean products and interchanging 0's & 1's (D) Interchanging 0's and 1's

Description : The dual of a Boolean expression is obtained by interchanging (A) Boolean sums and Boolean products (B) Boolean sums and Boolean products or interchanging 0's and 1's (C) Boolean sums and Boolean products and interchanging 0's & 1's (D) Interchanging 0's and 1's

Last Answer : (C) Boolean sums and Boolean products and interchanging 0's & 1's

What is the output Boolean expression for a NOR gate with R and T as inputs?

Description : What is the output Boolean expression for a NOR gate with R and T as inputs?

Last Answer : (R +T)’

Which of the following statement(s) is/are TRUE with regard to software testing? I. Regression testing technique ensures that the software product runs correctly after the changes during maintenance. II. Equivalence partitioning is a white-box testing technique that divides the input domain of a program into classes of data from which test cases can be derived. (1) only I (2) only II (3) both I and II (4) neither I nor II

Description : Which of the following statement(s) is/are TRUE with regard to software testing? I. Regression testing technique ensures that the software product runs correctly after the changes during maintenance. II. Equivalence partitioning is a ... (1) only I (2) only II (3) both I and II (4) neither I nor II

Last Answer : (1) only I 

Which of the following statement(s) with regard to an abstract class in JAVA is/are TRUE? I. An abstract class is one that is not used to create objects. II. An abstract class is designed only to act as a base class to be inherited by other classes. (1) Only l (2) Only II (3) Neither I nor II (4) Both l and II

Description : Which of the following statement(s) with regard to an abstract class in JAVA is/are TRUE? I. An abstract class is one that is not used to create objects. II. An abstract class is designed only to act as a base class ... by other classes. (1) Only l (2) Only II (3) Neither I nor II (4) Both l and II

Last Answer : Both l and II

Which of the following statement(s) regarding a linker software is/are true? I. A function of a linker is to combine several object modules into a single load module. II. A function of a linker is to replace absolute references in an object module by symbolic references to locations in other modules. (1) Only I (2) Only II (3) Both I and II (4) Neither I nor Il

Description : Which of the following statement(s) regarding a linker software is/are true? I. A function of a linker is to combine several object modules into a single load module. II. A function of a linker is to replace absolute ... modules. (1) Only I (2) Only II (3) Both I and II (4) Neither I nor Il

Last Answer : Answer: 1

Which of the following conclusions is logically valid based on statement given below? Statement: Most of the Indian states existed before independence. Conclusions: (I) Some Indian States existed before independence. (II) All Indian States did not exist before independence. (A) only (I) is implied (B) only (II) is implied (C) Both (I) and (II) are implied (D) Neither (I) nor (II) is implied

Description : Which of the following conclusions is logically valid based on statement given below? Statement: Most of the Indian states existed before independence. Conclusions: (I) Some Indian States existed before independence. (II) ... ) Both (I) and (II) are implied (D) Neither (I) nor (II) is implied

Last Answer : (B) only (II) is implied

Which of the following conclusions is logically valid based on statement given below? Statement: Most teachers are hard working. Conclusions: (I) Some teachers are hard working. (II) Some teachers are not hard working. (A) Only (I) is implied (B) Only (II) is implied (C) Both (I) and (II) are implied (D) Neither (I) nor (II) is implied

Description : Which of the following conclusions is logically valid based on statement given below? Statement: Most teachers are hard working. Conclusions: (I) Some teachers are hard working. (II) Some teachers are not hard working. ... (C) Both (I) and (II) are implied (D) Neither (I) nor (II) is implied

Last Answer : (C) Both (I) and (II) are implied

What is the type of inf? a) Boolean b) Integer c) Float d) Complex

Description : What is the type of inf? a) Boolean b) Integer c) Float d) Complex

Last Answer : Boolean

Which of the following arguments are not valid? (a) “If Gora gets the job and works hard, then he will be promoted. If Gora gets promotion, then he will be happy. He will not be happy, therefore, either he will not get the job or he will not work hard”. (b) “Either Puneet is not guilty or Pankaj is telling the truth. Pankaj is not telling the truth, therefore, Puneet is not guilty”. (c) If n is a real number such that n>1, then n2>1. Suppose that n2>1, then n>1. Codes: (A) (a) and (c) (B) (b) and (c) (C) (a), (b) and (c) (D) (a) and (b)

Description : Which of the following arguments are not valid? (a) If Gora gets the job and works hard, then he will be promoted. If Gora gets promotion, then he will be happy. He will not be happy, therefore, either he will not get the job or he ... and (c) (B) (b) and (c) (C) (a), (b) and (c) (D) (a) and (b)

Last Answer : Answer: B Explanation: (a) P: Gora gets the job  Q: Gora works hard  R: Gora gets promotion  S: Gora will be happy The argument can bet written as  (P˄Q)→R  R→S  ¬S ... also be written as: ((P˅Q)˄¬P)→Q where P, and Q are propositions expressed in some formal system.

In relation to expression defined in Section 3 of the Indian Evidence Act which of the following statement is not correct a) Facts include not only physical fact but also psychological facts b) Court includes arbitrators c) An inscription on a store is a document d) A fact is said to be not proved when it is neither proved nor disapproved

Description : In relation to expression defined in Section 3 of the Indian Evidence Act which of  the following statement is not correct a) Facts include not only physical fact but also psychological facts b) Court ... a document d) A fact is said to be not proved when it is neither proved nor disapproved

Last Answer : b) Court includes arbitrators

If f(x, y) is a digital image, then x, y and amplitude values of f are (A) Finite (B) Infinite (C) Neither finite nor infinite (D) None of the above

Description : If f(x, y) is a digital image, then x, y and amplitude values of f are (A) Finite (B) Infinite (C) Neither finite nor infinite (D) None of the above

Last Answer : (A) Finite

A pushdown automation M = (Q, Σ, Γ, δ, q0, z, F) is set to be deterministic subject to which of the following condition(s), for every q ∈ Q, a ∈ Σ ∪ {λ} and b ∈ Γ (s1) δ(q, a, b) contains at most one element (s2) if δ(q, λ, b) is not empty then δ(q, c, b) must be empty for every c ∈ Σ (A) only s1 (B) only s2 (C) both s1 and s2 (D) neither s1 nor s2

Description : A pushdown automation M = (Q, Σ, Γ, δ, q0, z, F) is set to be deterministic subject to which of the following condition(s), for every q ∈ Q, a ∈ Σ ∪ {λ} and b ∈ Γ (s1) δ(q, a, b) contains at most one ... ) must be empty for every c ∈ Σ (A) only s1 (B) only s2 (C) both s1 and s2 (D) neither s1 nor s2

Last Answer : (C) both s1 and s2

Consider the table Student(stuid, name, course, marks). Which one of the following two queries is correct to find the highest marks student in course 5? Q.1. Select S.stuid From student S Where not exists (select * from student e where e course='5' and e marks ≥ s marks) Q.2. Select S.stuid From student S Where s.marks > any (select distinct marks from student S where s.couse = 5) (A) Q.1 (B) Q.2 (C) Both Q.1 and Q.2 (D) Neither Q.1 nor Q.2

Description : Consider the table Student(stuid, name, course, marks). Which one of the following two queries is correct to find the highest marks student in course 5? Q.1. Select S.stuid From student S Where not exists (select * from student ... ) Q.1 (B) Q.2 (C) Both Q.1 and Q.2 (D) Neither Q.1 nor Q.2

Last Answer : (B) Q.2 Explanation: First query gives stuid of students whose marks are greater than all students taking course 5. Second query gives stuid of students whose marks are greater than any student taking ... comparison is between maximum of marks by any student in course 5. So the answer is option D.

Which of the following concurrency protocol ensures both conflict serializability and freedom from deadlock : I. 2-phase locking II. Time phase ordering (A) Both I & II (B) II only (C) I only (D) Neither I nor II

Description : Which of the following concurrency protocol ensures both conflict serializability and freedom from deadlock : I. 2-phase locking II. Time phase ordering (A) Both I & II (B) II only (C) I only (D) Neither I nor II

Last Answer : (B) II only

Which of the following concurrency protocol ensures both conflict serializability and freedom from deadlock ? (a) 2-phase Locking (b) Time stamp - ordering (A) Both (a) and (b) (B) (a) only (C) (b) only (D) Neither (a) nor (b)

Description : Which of the following concurrency protocol ensures both conflict serializability and freedom from deadlock ? (a) 2-phase Locking (b) Time stamp - ordering (A) Both (a) and (b) (B) (a) only (C) (b) only (D) Neither (a) nor (b)

Last Answer : (C) (b) only

Which of the following is/are correct with reference to Abstract class and interface ? (a) A class can inherit only one Abstract class but may inherit several interfaces. (b) An Abstract class can provide complete and default code but an interface has no code. Codes : (A) (a) is true (B) (b) is true (C) Both (a) and (b) are true (D) Neither (a) nor (b) is true

Description : Which of the following is/are correct with reference to Abstract class and interface ? (a) A class can inherit only one Abstract class but may inherit several interfaces. (b) An Abstract class can provide complete and default ... true (C) Both (a) and (b) are true (D) Neither (a) nor (b) is true

Last Answer : Answer: C

Which of the following are facts about a top-down software testing approach? I. Top-down testing typically requires the tester to build method stubs. II. Top-down testing typically requires the tester to build test drivers. (1) only I (2) Only II (3) Both I and II (4) Neither I nor II

Description : Which of the following are facts about a top-down software testing approach? I. Top-down testing typically requires the tester to build method stubs. II. Top-down testing typically requires the tester to build test drivers. (1) only I (2) Only II (3) Both I and II (4) Neither I nor II

Last Answer : (1) only I

Abstraction and encapsulation are fundamental principles that underlie the object oriented approach to software development. What can you say about the following two statements? I. Abstraction allows us to focus on what something does without considering the complexities of how it works. II. Encapsulation allows us to consider complex ideas while ignoring irrelevant detail that would confuse us. (1) Neither I nor II is correct. (2) Both I and II are correct. (3) Only II is correct. (4) Only I is correct.

Description : Abstraction and encapsulation are fundamental principles that underlie the object oriented approach to software development. What can you say about the following two statements? I. Abstraction allows us to focus on what something ... and II are correct. (3) Only II is correct. (4) Only I is correct.

Last Answer : (1) Neither I nor II is correct.

Consider a schema R(MNPQ) and functional dependencies M→N, P→Q. Then the decomposition of R into R1(MN) and R2(PQ) is ............. (1) Dependency preserving but not lossless join. (2) Dependency preserving and lossless join (3) Lossless join but not dependency preserving (4) Neither dependency preserving nor lossless join.

Description : Consider a schema R(MNPQ) and functional dependencies M→N, P→Q. Then the decomposition of R into R1(MN) and R2(PQ) is ............. (1) Dependency preserving but not lossless ... and lossless join (3) Lossless join but not dependency preserving (4) Neither dependency preserving nor lossless join. 

Last Answer : Answer: 1

Professional skepticism a. Assumes that management is either dishonest or assumes unquestioned honesty. b. Either assumes that management is honest or dishonest. c. Neither assumes that management is dishonest nor assumes unquestioned honesty. d. None of the above is a correct statement

Description : Professional skepticism a. Assumes that management is either dishonest or assumes unquestioned honesty. b. Either assumes that management is honest or dishonest. c. Neither assumes that management is dishonest nor assumes unquestioned honesty. d. None of the above is a correct statement

Last Answer : Neither assumes that management is dishonest nor assumes unquestioned honesty.

In java, string is a ............. A) primitive data type B) abstract data type C) combination of boolean D) None of the above

Description : In java, string is a ............. A) primitive data type B) abstract data type C) combination of boolean D) None of the above

Last Answer : B) abstract data type

The simplified function in product of sums of Boolean function F(W, X, Y, Z) = Σ(0, 1, 2, 5, 8, 9, 10) is (A) (W' + X') (Y' + Z') (X' + Z) (B) (W' + X') (Y' + Z') (X' + Z') (C) (W' + X') (Y' + Z) (X' + Z) (D) (W' + X') (Y + Z') (X' + Z)

Description : The simplified function in product of sums of Boolean function F(W, X, Y, Z) = Σ(0, 1, 2, 5, 8, 9, 10) is (A) (W' + X') (Y' + Z') (X' + Z) (B) (W' + X') (Y' + Z') (X' + Z') (C) (W' + X') (Y' + Z) (X' + Z) (D) (W' + X') (Y + Z') (X' + Z)

Last Answer : (A) (W' + X') (Y' + Z') (X' + Z)

The simplified form of a Boolean equation (AB’+AB’C+AC)(A’C’+B’) is : (A) AB’ (B) AB’C (C) A’B (D) ABC

Description : The simplified form of a Boolean equation (AB’+AB’C+AC)(A’C’+B’) is : (A) AB’ (B) AB’C (C) A’B (D) ABC

Last Answer : (A) AB’

Simplified Boolean equation for the following truth table is: Image(A) F = yz’ + y’z (B) F = xy’ + x’y (C) F = x’z + xz’ (D) F = x’z + xz’ + xyz

Description : Simplified Boolean equation for the following truth table is: (A) F = yz’ + y’z (B) F = xy’ + x’y (C) F = x’z + xz’ (D) F = x’z + xz’ + xyz 

Last Answer : (C) F = x’z + xz’ 

The Karnaugh map for a Boolean function is given as Image The simplified Boolean equation for the above Karnaugh Map is (A) AB + CD + AB’ + AD (B) AB + AC + AD + BCD (C) AB + AD + BC + ACD (D) AB + AC + BC + BCD

Description : The Karnaugh map for a Boolean function is given as The simplified Boolean equation for the above Karnaugh Map is (A) AB + CD + AB’ + AD (B) AB + AC + AD + BCD (C) AB + AD + BC + ACD (D) AB + AC + BC + BCD

Last Answer : (B) AB + AC + AD + BCD

Which is/are the application(s) of stack A) Function calls B) Large number Arithmetic C) Evaluation of arithmetic expressions D) All of the above

Description : Which is/are the application(s) of stack A) Function calls B) Large number Arithmetic C) Evaluation of arithmetic expressions D) All of the above

Last Answer : D) All of the above

Refer the points as listed below: (a) What are the operator precedence rules ? (b) What are the operator associativity rules ? (c) What is the order of operand evaluation ? (d) Are there restrictions on operand evaluation side effects ? Which of the above must be considered as primary design issues for arithmetic expressions ? (A) (a), (b) and (c) (B) (a), (c) and (d) (C) (a), (b) and (d) (D) (a), (b), (c) and (d)

Description : Refer the points as listed below: (a) What are the operator precedence rules ? (b) What are the operator associativity rules ? (c) What is the order of operand evaluation ? (d) Are there restrictions on operand evaluation side effects ? ... (d) (C) (a), (b) and (d) (D) (a), (b), (c) and (d)

Last Answer : (D) (a), (b), (c) and (d)

Which of the following logic expressions is incorrect? (A) 1 ⊕ 0 = 1 (B) 1 ⊕ 1 ⊕ 1 = 1 (C) 1 ⊕ 1 ⊕ 0 = 1 (D) 1 ⊕ 1 = 1

Description : Which of the following logic expressions is incorrect? (A) 1 ⊕ 0 = 1 (B) 1 ⊕ 1 ⊕ 1 = 1 (C) 1 ⊕ 1 ⊕ 0 = 1 (D) 1 ⊕ 1 = 1

Last Answer : (C) 1 ⊕ 1 ⊕ 0 = 1

One aspect that has to be dealt with by the integrity subsystem is to ensure that only valid values can be assigned to each data items. This is referred to as A) Data Security B) Domain access C) Data Control

Description : One aspect that has to be dealt with by the integrity subsystem is to ensure that only valid values can be assigned to each data items. This is referred to as A) Data Security B) Domain access C) Data Control

Last Answer : C) Data Control

Work done may be calculated by the expression ∫ p dA for __________ processes. (A) Non-flow reversible (B) Adiabatic (C) Both (A) and (B) (D) Neither (A) nor (B)

Description : Work done may be calculated by the expression ∫ p dA for __________ processes. (A) Non-flow reversible (B) Adiabatic (C) Both (A) and (B) (D) Neither (A) nor (B)

Last Answer : (C) Both (A) and (B)

Why do you write ‘Integer.parseInt(br.readLine())’?

Description : Why do you write ‘Integer.parseInt(br.readLine())’?

Last Answer : A: The inputs in a java program comes in the form of String objects which are read using the br.readLine() function. Now if we want the input in integer form, we have to convert it into integer using the parseInt() function of the Integer wrapper class.

If a variable is declared final, it must include ...................... value. A) integer B) no C) initial D) float

Description : If a variable is declared final, it must include ...................... value. A) integer B) no C) initial D) float

Last Answer : C) initial

A method name myMethod( ) that needs two integer arguments is declared as A) public void myMethod( ); B) public void myMethod(int a, int b); C) public void myMethod(int a, b); D) public int myMethod(a, b);

Description : A method name myMethod( ) that needs two integer arguments is declared as A) public void myMethod( ); B) public void myMethod(int a, int b); C) public void myMethod(int a, b); D) public int myMethod(a, b);

Last Answer : B) public void myMethod(int a, int

If an integer occupies 4 bytes and a character occupies 1 byte of memory, each element of the following structure would occupy how many bytes ? struct name { int age; char name[30]; }; A) 30 B) 32 C) 34 D) 36

Description : If an integer occupies 4 bytes and a character occupies 1 byte of memory, each element of the following structure would occupy how many bytes ? struct name { int age; char name[30]; }; A) 30 B) 32 C) 34 D) 36

Last Answer : C) 34

An integer constant in C must have A) At least one digit B) At least one decimal point C) A comma along with digits D) Digits separated by commas

Description : An integer constant in C must have A) At least one digit B) At least one decimal point C) A comma along with digits D) Digits separated by commas

Last Answer : A) At least one digit

If a is an integer variable, a=7/3; will return a value A) 2.5 B) 3 C) 0 D) 2

Description : If a is an integer variable, a=7/3; will return a value A) 2.5 B) 3 C) 0 D) 2

Last Answer : D) 2

NULL is (A) the same as 0 for integer (B) the same as blank for character (C) the same as 0 for integer and blank for character (D) not a value

Description : NULL is (A) the same as 0 for integer (B) the same as blank for character (C) the same as 0 for integer and blank for character (D) not a value

Last Answer : (D) not a value

What is the data type of (1)? a) Tuple b) Integer c) List d) Both tuple and integer

Description : What is the data type of (1)? a) Tuple b) Integer c) List d) Both tuple and integer

Last Answer : b) Integer

Bresenham line drawing algorithm is attractive because it uses (A) Real arithmetic only (B) Integer arithmetic only (C) Floating point arithmetic (D) Real and integer arithmetic

Description : Bresenham line drawing algorithm is attractive because it uses (A) Real arithmetic only (B) Integer arithmetic only (C) Floating point arithmetic (D) Real and integer arithmetic

Last Answer : (B) Integer arithmetic only

The correct way to round off a floating number x to an integer value is (A) y = (int)(x+0.5) (B) y = int(x+0.5) (C) y = (int)x+0.5 (D) y = (int)((int)x+0.5)

Description : The correct way to round off a floating number x to an integer value is (A) y = (int)(x+0.5) (B) y = int(x+0.5) (C) y = (int)x+0.5 (D) y = (int)((int)x+0.5)

Last Answer : (A) y = (int)(x+0.5)

A computer program selects an integer in the set {k : 1 ≤ k ≤ 10,00,000} at random and prints out the result. This process is repeated 1 million times. What is the probability that the value k = 1 appears in the printout atleast once ? (A) 0.5 (B) 0.704 (C) 0.632121 (D) 0.68

Description : A computer program selects an integer in the set {k : 1 ≤ k ≤ 10,00,000} at random and prints out the result. This process is repeated 1 million times. What is the probability that the value k = 1 appears in the printout atleast once ? (A) 0.5 (B) 0.704 (C) 0.632121 (D) 0.68

Last Answer : (C) 0.632121

Suppose the function y and a fuzzy integer number around -4 for x are given as y=(x-3)2+2 Around -4={(2,0.3), (3,0.6), (4,1), (5,0.6), (6,0.3)} respectively. Then f(Around - 4) is given by: (A) {(2,0.6), (3,0.3), (6,1), (11,0.3)} (B) {(2,0.6), (3,1), (6,1), (11,0.3)} (C) {(2,0.6), (3,1), (6,0.6), (11,0.3)} (D) {(2,0.6), (3,0.3), (6,0.6), (11,0.3)}

Description : Suppose the function y and a fuzzy integer number around -4 for x are given as y=(x-3)2+2 Around -4={(2,0.3), (3,0.6), (4,1), (5,0.6), (6,0.3)} respectively. Then f(Around - 4) is given by: (A) {(2,0.6), (3,0.3), ... 6), (3,1), (6,0.6), (11,0.3)} (D) {(2,0.6), (3,0.3), (6,0.6), (11,0.3)}

Last Answer : (C) {(2,0.6), (3,1), (6,0.6), (11,0.3)}

Consider the following database table : Create table test( one integer, two integer, primary key(one), unique(two), check(one≥1 and ≤10), check(two≥1 and ≤5) ); How many data records/tuples atmost can this table contain ? (A) 5 (B) 10 (C) 15 (D) 50

Description : Consider the following database table : Create table test( one integer, two integer, primary key(one), unique(two), check(one≥1 and ≤10), check(two≥1 and ≤5) ); How many data records/tuples atmost can this table contain ?  (A) 5 (B) 10 (C) 15 (D) 50

Last Answer : (A) 5