.............. predicate calculus allows quantified variables to refer to objects in the domain of discourse and not to predicates or functions. (A) Zero-order (B) First-order (C) Second-order (D) High-order

.............. predicate calculus allows quantified variables to refer to objects in the domain of discourse and not to predicates or functions. (A) Zero-order (B) First-order (C) Second-order (D) High-order
by

1 Answer

Answer :

(B) First-order
by

Related questions

The adjective “first-order” distinguishes first-order logic from ___________ in which there are predicates having predicates or functions as arguments, or in which one or both of predicate quantifiers or function quantifiers are permitted. a) Representational Verification b) Representational Adequacy c) Higher Order Logic d) Inferential Efficiency

Description : The adjective first-order distinguishes first-order logic from ___________ in which there are predicates having predicates or functions as arguments, or in which one or both of ... Representational Verification b) Representational Adequacy c) Higher Order Logic d) Inferential Efficiency

Last Answer : c) Higher Order Logic

Let P(m,n) be the statement “m divides n” where the Universe of discourse for both the variables is the set of positive integers. Determine the truth values of the following propositions. (a) ∃m ∀n P(m,n) (b) ∀n P(1,n) (c) ∀m ∀n P(m,n) (A) (a)-True; (b)-True; (c)-False (B) (a)-True; (b)-False; (c)-False (C) (a)-False; (b)-False; (c)-False (D) (a)-True; (b)-True; (c)-True

Description : Let P(m,n) be the statement m divides n where the Universe of discourse for both the variables is the set of positive integers. Determine the truth values of the following propositions. (a) ∃m ∀n P(m,n) (b) ∀n P(1,n) ( ... -False (C) (a)-False; (b)-False; (c)-False (D) (a)-True; (b)-True; (c)-True

Last Answer : Answer: A

…………. Refer to the names of variables, functions, arrays, classes etc. created by the programmer. A) Keywords B) Identifiers C) Constraints D) Strings

Description : …………. Refer to the names of variables, functions, arrays, classes etc. created by the programmer. A) Keywords B) Identifiers C) Constraints D) Strings

Last Answer : B) Identifiers

State True or False. i) A satic function can have access to only other static members (functions or variables) declared in the same class. ii) A static member function can be called using the class name (instead of its objects) A) True, True B) True, False C) False, True D) False, False

Description : State True or False. i) A satic function can have access to only other static members (functions or variables) declared in the same class. ii) A static member function can be called using the class name (instead of its objects) A) True, True B) True, False C) False, True D) False, False

Last Answer : B) True, False

What is the condition of variables in first-order literals? a) Existentially quantified b) Universally quantified c) Both Existentially & Universally quantified d) None of the mentioned

Description : What is the condition of variables in first-order literals? a) Existentially quantified b) Universally quantified c) Both Existentially & Universally quantified d) None of the mentioned

Last Answer : b) Universally quantified

First Order Logic is also known as ___________ a) First Order Predicate Calculus b) Quantification Theory c) Lower Order Calculus d) All of the mentioned

Description : First Order Logic is also known as ___________ a) First Order Predicate Calculus b) Quantification Theory c) Lower Order Calculus d) All of the mentioned

Last Answer : d) All of the mentioned

For like predicate which of the following is true. i) % matches zero of more characters. ii) _ matches exactly one character. A) i-only B) ii-only C) Both of them D) None of them

Description : For like predicate which of the following is true. i) % matches zero of more characters. ii) _ matches exactly one character. A) i-only B) ii-only C) Both of them D) None of them

Last Answer : C) Both of them

Which of the following characteristics of constructor are true. i) They should be declared in the public section. ii) They are invoked automatically when the objects are created. iii) They do not have return type and void also. iv) We cannot refer their address. v) Constructors cannot virtual. A) Only i, ii, iii and v B) Only ii, iii, iv, and v C) Only i, iii, iv and v D) All i, ii, iii, iv and v

Description : Which of the following characteristics of constructor are true. i) They should be declared in the public section. ii) They are invoked automatically when the objects are created. iii) They do not have return type and void also. ... and v C) Only i, iii, iv and v D) All i, ii, iii, iv and v

Last Answer : D) All i, ii, iii, iv and v

Match the following types of variables with the corresponding programming languages: (a) Static variables (i) Local variables in Pascal (b) Stack dynamic (ii) All variables in APL (c) Explicit heap dynamic (iii) Fortran 77 (d) Implicit heap dynamic (iv) All objects in JAVA Codes: (a) (b) (c) (d) (A) (i) (iii) (iv) (ii) (B) (iv) (i) (iii) (ii) (C) (iii) (i) (iv) (ii) (D) (ii) (i) (iii) (iv)

Description : Match the following types of variables with the corresponding programming languages: (a) Static variables (i) Local variables in Pascal (b) Stack dynamic (ii) All variables in APL (c) Explicit heap dynamic (iii) Fortran 77 (d) Implicit ... (ii) (C) (iii) (i) (iv) (ii) (D) (ii) (i) (iii) (iv)

Last Answer : (C) (iii) (i) (iv) (ii) 

PROLOG is an AI programming language which solves problems with a form of symbolic logic known as predicate calculus. It was developed in 1972 at the University of Marseilles by a team of specialists. Can you name the person who headed this team? A : Alain colmerauer B : Niklaus Wirth C : Seymour papert D : John McCarthy

Description : PROLOG is an AI programming language which solves problems with a form of symbolic logic known as predicate calculus. It was developed in 1972 at the University of Marseilles by a team of specialists. Can you ... this team? A : Alain colmerauer B : Niklaus Wirth C : Seymour papert D : John McCarthy

Last Answer : A : Alain colmerauer

PROLOG is an AI programming language which solves problems with a form of symbolic logic known as ______. A. Propositional logic B. Tautology C. Predicate calculus D. Temporal logic

Description : PROLOG is an AI programming language which solves problems with a form of symbolic logic known as ______. A. Propositional logic B. Tautology C. Predicate calculus D. Temporal logic

Last Answer : C. Predicate calculus

The concept derived from ________ level are propositional logic, tautology, predicate calculus, model, temporal logic. A. Cognition level B. Logic level C. Functional level D. All of above

Description : The concept derived from ________ level are propositional logic, tautology, predicate calculus, model, temporal logic. A. Cognition level B. Logic level C. Functional level D. All of above

Last Answer : B. Logic level

PROLOG is an AI programming language which solves problems with a form of symbolic logic known as ______. A. Propositional logic B. Tautology C. Predicate calculus D. Temporal logic

Description : PROLOG is an AI programming language which solves problems with a form of symbolic logic known as ______. A. Propositional logic B. Tautology C. Predicate calculus D. Temporal logic

Last Answer : C. Predicate calculus 

The concept derived from ________ level are propositional logic, tautology, predicate calculus, model, temporal logic. A. Cognition level B. Logic level C. Functional level D. All of above

Description : The concept derived from ________ level are propositional logic, tautology, predicate calculus, model, temporal logic. A. Cognition level B. Logic level C. Functional level D. All of above

Last Answer : B. Logic level 

Some of the situations where inline expansion may not work are: A) For functions returning values, if a loop, a switch or goto exists. B) If functions contain static variables and they are re-cursive. C) For functions not returning values, if return statement exist. D) All of the above.

Description : Some of the situations where inline expansion may not work are: A) For functions returning values, if a loop, a switch or goto exists. B) If functions contain static variables and they are re-cursive. C) For functions not returning values, if return statement exist. D) All of the above.

Last Answer : D) All of the above.

…………… is a way to bind the data and its associated functions together which allows the data and functions to be hidden. A) Structure B) Class C) Enum D) Both A and B

Description : …………… is a way to bind the data and its associated functions together which allows the data and functions to be hidden. A) Structure B) Class C) Enum D) Both A and B

Last Answer : B) Class

Which one of the following is correct for overloaded functions in C++? (1) Compiler sets up a separate function for every definition of function. (2) Compiler does not set up a separate function for every definition of function. (3) Overloaded functions cannot handle different types of objects. (4) Overloaded functions cannot have same number of arguments.

Description : Which one of the following is correct for overloaded functions in C++? (1) Compiler sets up a separate function for every definition of function. (2) Compiler does not set up a ... functions cannot handle different types of objects. (4) Overloaded functions cannot have same number of arguments.

Last Answer : Answer: 1

The ..................... is essentially used to search for patterns in target string. A) Like Predicate B) Null Predicate C) In Predicate D) Out Predicate

Description : The ..................... is essentially used to search for patterns in target string. A) Like Predicate B) Null Predicate C) In Predicate D) Out Predicate

Last Answer : A) Like Predicate

…………….. is the complex search criteria in the where clause. A) Substring B) Drop Table C) Predict D) Predicate

Description : …………….. is the complex search criteria in the where clause. A) Substring B) Drop Table C) Predict D) Predicate

Last Answer : D) Predicate

…………….. is used to determine whether of a table contains duplicate rows. A) Unique predicate B) Like Predicate C) Null predicate D) In predicate

Description : …………….. is used to determine whether of a table contains duplicate rows. A) Unique predicate B) Like Predicate C) Null predicate D) In predicate

Last Answer : A) Unique predicate

Given a flow graph with 10 nodes, 13 edges and one connected components, the number of regions and the number of predicate (decision) nodes in the flow graph will be (A) 4, 5 (B) 5, 4 (C) 3, 1 (D) 13, 8

Description : Given a flow graph with 10 nodes, 13 edges and one connected components, the number of regions and the number of predicate (decision) nodes in the flow graph will be (A) 4, 5 (B) 5, 4 (C) 3, 1 (D) 13, 8

Last Answer : (B) 5, 4

Which one of the following is used to compute cyclomatic complexity ? (A) The number of regions – 1 (B) E – N + 1, where E is the number of flow graph edges and N is the number of flow graph nodes. (C) P – 1, where P is the number of predicate nodes in the flow graph G. (D) P + 1, where P is the number of predicate nodes in the flow graph G.

Description : Which one of the following is used to compute cyclomatic complexity ? (A) The number of regions - 1 (B) E - N + 1, where E is the number of flow graph edges and N is the number of flow graph nodes. (C) ... in the flow graph G. (D) P + 1, where P is the number of predicate nodes in the flow graph G.

Last Answer : (D) P + 1, where P is the number of predicate nodes in the flow graph G.

An Assertion is a predicate expressing a condition we wish database to always satisfy. The correct syntax for Assertion is : (A) CREATE ASSERTION ‘ASSERTION Name’ CHECK ‘Predicate’ (B) CREATE ASSERTION ‘ASSERTION NAME’ (C) CREATE ASSERTION, CHECK Predicate (D) SELECT ASSERTION

Description : An Assertion is a predicate expressing a condition we wish database to always satisfy. The correct syntax for Assertion is : (A) CREATE ASSERTION ‘ASSERTION Name’ CHECK ‘Predicate’ (B) CREATE ASSERTION ‘ASSERTION NAME’ (C) CREATE ASSERTION, CHECK Predicate (D) SELECT ASSERTION

Last Answer : (A) CREATE ASSERTION ‘ASSERTION Name’ CHECK ‘Predicate’ 

The cyclomatic complexity of a flow graph V(G), in terms of predicate nodes is: (A) P + 1 (B) P - 1 (C) P - 2 (D) P + 2 Where P is number of predicate nodes in flow graph V(G).

Description : The cyclomatic complexity of a flow graph V(G), in terms of predicate nodes is: (A) P + 1 (B) P - 1 (C) P - 2 (D) P + 2 Where P is number of predicate nodes in flow graph V(G).

Last Answer : (A) P + 1 

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)

How does Tuple-oriented relational calculus differ from domain-oriented relational calculus?

Description : How does Tuple-oriented relational calculus differ from domain-oriented relational calculus?

Last Answer : The tuple-oriented calculus uses a tuple variables i.e., variable whose only permitted values are tuples of that relation. E.g. QUEL The domain-oriented calculus has domain variables i.e., variables that range over the underlying domains instead of over relation. E.g. ILL, DEDUCE.

A proposition in which the predicate refers to all individual objects denoted by the subject is called A) Particular B) Negative C) Disjunctive D) Universal.

Description : A proposition in which the predicate refers to all individual objects denoted by the subject is called A) Particular B) Negative C) Disjunctive D) Universal.

Last Answer : D) Universal. 

An ordinal scale is used to rank order people, objects, or characteristics. a. True b. False

Description : An ordinal scale is used to rank order people, objects, or characteristics. a. True b. False

Last Answer : a. True

In Java variables, if first increment of the variable takes place and then the assignment occurs. This operation is also called ............................. . A) pre increment B) post increment C) incrementation D) pre incrementation

Description : In Java variables, if first increment of the variable takes place and then the assignment occurs. This operation is also called ............................. . A) pre increment B) post increment C) incrementation D) pre incrementation

Last Answer : A) pre increment

14) Carrying out experiments in a laboratory setting allows for control of independent variables that might influence the outcome of an experiment. A DISADVANTAGE of the laboratory setting is: A)difficulty in observing subjects and measuring their reactions B)failure to duplicate all the conditions that affect choices in the marketplace C)difficulty gaining the interest and attention of subjects D)its high cost in comparison with field experimentation

Description : 14) Carrying out experiments in a laboratory setting allows for control of independent variables that might influence the outcome of an experiment. A DISADVANTAGE of the laboratory setting is: ... the interest and attention of subjects D)its high cost in comparison with field experimentation

Last Answer : B)failure to duplicate all the conditions that affect choices in the marketplace

State true or false i) A candidate key is a minimal super key. ii) A candidate key can also refer to as surrogate key. A) i-true, ii-false B) i-false, ii-true C) i-true, ii-true D) i-false, ii-false

Description : State true or false i) A candidate key is a minimal super key. ii) A candidate key can also refer to as surrogate key. A) i-true, ii-false B) i-false, ii-true C) i-true, ii-true D) i-false, ii-false

Last Answer : C) i-true, ii-true

Using which keyword we can access value of the instance variables and class variables of that class inside the method of that class itself. A) super B) final C) this D) either super or this

Description : Using which keyword we can access value of the instance variables and class variables of that class inside the method of that class itself. A) super B) final C) this D) either super or this

Last Answer : C) this

State true or false for Java Program. i) All class variables are instance variables ii) All protected methods are friendly methods A) i-false, ii-false B) i-false, ii-true

Description : State true or false for Java Program. i) All class variables are instance variables ii) All protected methods are friendly methods A) i-false, ii-false B) i-false, ii-true

Last Answer : B) i-false, ii-true

If m and n are int type variables, what will be the result of the expression m% n when m=5 and n=2 ? A) 0 B) 1 C) 2 D) None of the above

Description : If m and n are int type variables, what will be the result of the expression m% n when m=5 and n=2 ? A) 0 B) 1 C) 2 D) None of the above

Last Answer : B) 1

A structure brings together a group of A) items of the same data type B) related data items and variables C) integers with user defined names D) floating points with user defined names

Description : A structure brings together a group of A) items of the same data type B) related data items and variables C) integers with user defined names D) floating points with user defined names

Last Answer : B) related data items and variables

Which of the following is FALSE in C? A) Keywords can be used as variable names B) Variable names can contain a digit C) Variable names do not contain a blank space D) Capital letters can be used in variables

Description : Which of the following is FALSE in C? A) Keywords can be used as variable names B) Variable names can contain a digit C) Variable names do not contain a blank space D) Capital letters can be used in variables

Last Answer : A) Keywords can be used as variable names

Which one of the following describes the syntax of prolog program ? I. Rules and facts are terminated by full stop (.) II. Rules and facts are terminated by semicolon (;) III. Variables names must start with upper case alphabets. IV. Variables names must start with lower case alphabets. Codes : (A) I, II (B) III, IV (C) I, III (D) II, IV

Description : Which one of the following describes the syntax of prolog program ? I. Rules and facts are terminated by full stop (.) II. Rules and facts are terminated by semicolon (;) III. Variables names must start with upper case alphabets. ... alphabets. Codes : (A) I, II (B) III, IV (C) I, III (D) II, IV

Last Answer : (C) I, III

Let Pi and Pj be two processes, R be the set of variables read from memory, and W be the set of variables written to memory. For the concurrent execution of two processes Pi and Pj, which of the following conditions is not true? (A) R(Pi)∩W(Pj)=Φ (B) W(Pi)∩R(Pj)=Φ (C) R(Pi)∩R(Pj)=Φ (D) W(Pi)∩W(Pj)=Φ

Description : Let Pi and Pj be two processes, R be the set of variables read from memory, and W be the set of variables written to memory. For the concurrent execution of two processes Pi and Pj, which of the following conditions is not true? (A) R(Pi)∩W(Pj)=Φ (B) W(Pi)∩R(Pj)=Φ (C) R(Pi)∩R(Pj)=Φ (D) W(Pi)∩W(Pj)=Φ

Last Answer : (C) R(Pi)∩R(Pj)=Φ 

In constraint satisfaction problem, constraints can be stated as . (A) Arithmatic equations and inequalities that bind the values of variables (B) Arithmatic equations and inequalities that doesn’t bind any restriction over variables (C) Arithmatic equations that impose restrictions over variables (D) Arithmatic equations that discard constraints over the given variables

Description : In constraint satisfaction problem, constraints can be stated as . (A) Arithmatic equations and inequalities that bind the values of variables (B) Arithmatic equations and inequalities ... impose restrictions over variables (D) Arithmatic equations that discard constraints over the given variables

Last Answer : (A) Arithmatic equations and inequalities that bind the values of variables

A horn clause is ...................... (A) A clause in which no variables occur in the expression (B) A clause that has at least one negative literal (C) A disjunction of a number of literals (D) A clause that has at most one positive literal

Description : A horn clause is ...................... (A) A clause in which no variables occur in the expression (B) A clause that has at least one negative literal (C) A disjunction of a number of literals (D) A clause that has at most one positive literal

Last Answer : (D) A clause that has at most one positive literal 

For a program of k variables, boundary value analysis yields .............. test cases. (A) 4k – 1 (B) 4k (C) 4k + 1 (D) 2k – 1

Description : For a program of k variables, boundary value analysis yields .............. test cases. (A) 4k – 1 (B) 4k (C) 4k + 1 (D) 2k – 1

Last Answer : (C) 4k + 1

In Artificial Intelligence (AI), what is present in the planning graph? (1) Sequence of levels (2) Literals (3) Variables (4) Heuristic estimates

Description : In Artificial Intelligence (AI), what is present in the planning graph? (1) Sequence of levels (2) Literals (3) Variables (4) Heuristic estimates

Last Answer : Sequence of levels

Five jobs A, B, C, D and E are waiting in Ready Queue. Their expected runtimes are 9, 6, 3, 5 and x respectively. All jobs entered in Ready queue at time zero. They must run in ............. order to minimize average response time if 3 < x < 5. (A) B, A, D, E, C (B) C, E, D, B, A (C) E, D, C, B, A (D) C, B, A, E, D

Description : Five jobs A, B, C, D and E are waiting in Ready Queue. Their expected runtimes are 9, 6, 3, 5 and x respectively. All jobs entered in Ready queue at time zero. They must run in ............. order to minimize average response time if 3 < ... , C (B) C, E, D, B, A (C) E, D, C, B, A (D) C, B, A, E, D

Last Answer : (B) C, E, D, B, A

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

Which if the following is not the type of data integrity. A) Key integrity B) Domain integrity C) Entity integrity D) Referential integrity

Description : Which if the following is not the type of data integrity. A) Key integrity B) Domain integrity C) Entity integrity D) Referential integrity

Last Answer : A) Key integrity

………..defines the structure of a relation which consists of a fixed set of attribute-domain pairs. A) Instance B) Schema c) Program D) Super Key

Description : ………..defines the structure of a relation which consists of a fixed set of attribute-domain pairs. A) Instance B) Schema c) Program D) Super Key

Last Answer : B) Schema

DNS can obtain the ................. of host if its domain name is known and vice versa. A) Station address B) IP address C) Port address D) Checksum

Description : DNS can obtain the ................. of host if its domain name is known and vice versa. A) Station address B) IP address C) Port address D) Checksum

Last Answer : B) IP address

A set of possible data values is called (A) attribute. (B) degree. (C) tuple. (D) domain.

Description : A set of possible data values is called (A) attribute. (B) degree. (C) tuple. (D) domain.

Last Answer : D) domain.