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

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

1 Answer

Answer :

D) Predicate
by

Related questions

The regular expression corresponding to the language L where L={x∈{0,1}* | x ends with 1 and does not contain substring 00 } is: (A) (1 + 01)* (10 + 01) (B) (1 + 01)* 01 (C) (1 + 01)* (1 + 01) (D) (10 + 01)* 01

Description : The regular expression corresponding to the language L where L={x∈{0,1}* | x ends with 1 and does not contain substring 00 } is: (A) (1 + 01)* (10 + 01) (B) (1 + 01)* 01 (C) (1 + 01)* (1 + 01) (D) (10 + 01)* 01

Last Answer : (C) (1 + 01)* (1 + 01) 

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 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

……………..specifies a search condition for a group or an aggregate. A) GROUP BY Clause B) HAVING Clause C) FROM Clause D) WHERE Clause

Description : ……………..specifies a search condition for a group or an aggregate. A) GROUP BY Clause B) HAVING Clause C) FROM Clause D) WHERE Clause

Last Answer : B) HAVING Clause

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

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

.............. 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

Description : .............. 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

Last Answer : (B) First-order

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 

Drop Table cannot be used to drop a table referenced by a …………… constraint. A) Local Key B) Primary Key C) Composite Key D) Foreign Key

Description : Drop Table cannot be used to drop a table referenced by a …………… constraint. A) Local Key B) Primary Key C) Composite Key D) Foreign Key

Last Answer : D) Foreign Key

Drop Table cannot be used to drop a Table referenced by .................. constraint. (a) Primary key (b) Sub key (c) Super key (d) Foreign key (A) (a) (B) (a), (b) and (c) (C) (d) (D) (a) and (d)

Description : Drop Table cannot be used to drop a Table referenced by .................. constraint. (a) Primary key (b) Sub key (c) Super key (d) Foreign key (A) (a) (B) (a), (b) and (c) (C) (d) (D) (a) and (d)

Last Answer : (C) (d)

Consider the following two commands C1 and C2 on the relation R from an SQL database: C1: drop table R; C2: delete from R; Which of the following statements is TRUE? I. Both C1 and C2 delete the schema for R. II. C2 retains relation R, but deletes all tuples in R. III. C1 deletes not only all tuples of R, but also the schema for R. (A) I only (B) I and II only (C) II and III only (D) I, II and III

Description : Consider the following two commands C1 and C2 on the relation R from an SQL database:  C1: drop table R; C2: delete from R; Which of the following statements is TRUE? I. Both C1 and C2 delete the schema for R. II. C2 ... R. (A) I only (B) I and II only (C) II and III only (D) I, II and III

Last Answer : (C) II and III only

System.in.read() is being used, the program must specify the .................. clause. A) throws.java.out.IOException B) throws.java.in.IOException C) throws.java.io.IOException D) throws.java.io.InException

Description : System.in.read() is being used, the program must specify the .................. clause. A) throws.java.out.IOException B) throws.java.in.IOException C) throws.java.io.IOException D) throws.java.io.InException

Last Answer : C) throws.java.io.IOException

In snapshot, …………………. clause tells oracle how long to wait between refreshes. A) Complete B) Force C) Next D) Refresh

Description : In snapshot, …………………. clause tells oracle how long to wait between refreshes. A) Complete B) Force C) Next D) Refresh

Last Answer : D) Refresh

……………… clause is an additional filter that is applied to the result. A) Select B) Group-by C) Having D) Order by

Description : ……………… clause is an additional filter that is applied to the result. A) Select B) Group-by C) Having D) Order by

Last Answer : C) Having

‘AS’ clause is used in SQL for (A) Selection operation. (B) Rename operation. (C) Join operation. (D) Projection operation.

Description : ‘AS’ clause is used in SQL for (A) Selection operation. (B) Rename operation. (C) Join operation. (D) Projection operation.

Last Answer : (B) Rename operation.

Which one of the following is true? (A) The resolvent of two Horn clauses is not a Horn clause. (B) The resolvent of two Horn clauses is a Horn Clause. (C) If we resolve a negated goal G against a fact or rule A to get Clause C then C has positive literal and non null-goal. (D) If we resolve a negated goal G against a fact or rule A to get clause C then C has positive literal or null goal.

Description : Which one of the following is true? (A) The resolvent of two Horn clauses is not a Horn clause. (B) The resolvent of two Horn clauses is a Horn Clause. (C) If we resolve a negated goal G against a ... negated goal G against a fact or rule A to get clause C then C has positive literal or null goal. 

Last Answer : (B) The resolvent of two Horn clauses is a Horn Clause.

Which of the following is false for the programming language PROLOG? (A) A PROLOG variable can only be assigned to a value once (B) PROLOG is a Strongly Typed Language. (C) The scope of a variable in PROLOG is a single clause or rule. (D) the scope of a variable in PROLOG is a Single Query

Description : Which of the following is false for the programming language PROLOG? (A) A PROLOG variable can only be assigned to a value once (B) PROLOG is a Strongly Typed Language. (C) The scope of a variable in PROLOG is a single clause or rule. (D) the scope of a variable in PROLOG is a Single Query

Last Answer : (B) PROLOG is a Strongly Typed Language.

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 

To predict failure in design components which failure criteria is not assumed, when mean stress and stress amplitude are nonzero? a. Goodman criterion b. Soderberg criteria c. Gerber criteria d. None of the above

Description : To predict failure in design components which failure criteria is not assumed, when mean stress and stress amplitude are nonzero? a. Goodman criterion b. Soderberg criteria c. Gerber criteria d. None of the above

Last Answer : d. None of the above

Given an open address hash table with load factor a < 1, the expected number of probes in a successful search is (A) Atmost 1/α ln (1-α/α) (B) Atmost 1/α ln (1/1-α) (C) Atleast 1/α ln (1/1-α) (D) Atleast 1/α ln (α/1-α)

Description : Given an open address hash table with load factor a < 1, the expected number of probes in a successful search is (A) Atmost 1/α ln (1-α/α) (B) Atmost 1/α ln (1/1-α) (C) Atleast 1/α ln (1/1-α) (D) Atleast 1/α ln (α/1-α)

Last Answer : (B) Atmost 1/α ln (1/1-α)

Considering the same string “Preoccupied” Write SQL commands to display: (a) the position of the substring ‘cup’ in the string “Preoccupied” -Technology

Description : Considering the same string “Preoccupied” Write SQL commands to display: (a) the position of the substring ‘cup’ in the string “Preoccupied” -Technology

Last Answer : (a)select instr 'Preoccupied' , ‘ 'cup'));(b)select left 'Preoccupied',4);

Python: find the index of a string in the list of strings which contains a substring -Web-Development

Description : Python: find the index of a string in the list of strings which contains a substring -Web-Development

Last Answer : answer:

Statement of scope and objectives, opportunities and performance criteria …………. A) Problem definition B) System analysis C) System Design D) Documentation

Description : Statement of scope and objectives, opportunities and performance criteria …………. A) Problem definition B) System analysis C) System Design D) Documentation

Last Answer : A) Problem definition

Identify the criteria for designing database from the point of view of user A) No redundancy B) No inapplicable attributes C) Uniformity in naming & definitions of the data items D) All of the above

Description : Identify the criteria for designing database from the point of view of user A) No redundancy B) No inapplicable attributes C) Uniformity in naming & definitions of the data items D) All of the above

Last Answer : D) All of the above

A relational database developer refers to a record as (A) a criteria. (B) a relation. (C) a tuple. (D) an attribute.

Description : A relational database developer refers to a record as (A) a criteria. (B) a relation. (C) a tuple. (D) an attribute.

Last Answer : C) a tuple

A scheduling Algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (lowest priority). The scheduler re-evaluates the process priority for every 'T' time units and decides next process to be scheduled. If the process have no I/O operations and all arrive at time zero, then the scheduler implements .............. criteria. (A) Priority scheduling (B) Round Robin Scheduling (C) Shortest Job First (D) FCFS

Description : A scheduling Algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (lowest priority). The scheduler re-evaluates the process priority for every 'T' time ... (A) Priority scheduling (B) Round Robin Scheduling (C) Shortest Job First (D) FCFS

Last Answer : (B) Round Robin Scheduling

If the Disk head is located initially at track 32, find the number of disk moves required with FCFS scheduling criteria if the disk queue of I/O blocks requests are: 98, 37, 14, 124, 65, 67 (A) 320 (B) 322 (C) 321 (D) 319

Description : If the Disk head is located initially at track 32, find the number of disk moves required with FCFS scheduling criteria if the disk queue of I/O blocks requests are: 98, 37, 14, 124, 65, 67 (A) 320 (B) 322 (C) 321 (D) 319

Last Answer : (C) 321

Some of the criteria for calculation of priority of a process are: a. Processor utilization by an individual process. b. Weight assigned to a user or group of users. c. Processor utilization by a user or group of processes. In fair share scheduler, priority is calculated based on: (1) only (a) and (b) (2) only (a) and (c) (3) (a), (b) and (c) (4) only (b) and (c)

Description : Some of the criteria for calculation of priority of a process are: a. Processor utilization by an individual process. b. Weight assigned to a user or group of users. c. Processor utilization by a user or group of processes. In fair share ... (a) and (c) (3) (a), (b) and (c) (4) only (b) and (c)

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

which of the following is a complex sentence that contains a dependent adverbial clause? -General Knowledge

Description : which of the following is a complex sentence that contains a dependent adverbial clause? -General Knowledge

Last Answer : A complex sentence that contains a dependent adverbial clause is: Mark expects the photo to arrive when the letter arrives.

Reynolds number for water flow through a tube of I.D. 5 cm is 1500. If a liquid of 5 centipoise viscosity and 0.8 specific gravity flows in the same pipe at the same velocity, then the pressure drop will (A) Increase (B) Decrease (C) Remain same (D) Data insufficient to predict pressure drop

Description : Reynolds number for water flow through a tube of I.D. 5 cm is 1500. If a liquid of 5 centipoise viscosity and 0.8 specific gravity flows in the same pipe at the same velocity, then the pressure drop will (A) Increase (B) Decrease (C) Remain same (D) Data insufficient to predict pressure drop

Last Answer : (A) Increase

Two fluids are flowing through two similar pipes of the same diameter. The Reynold's number is same. For the same flow rate if the viscosity of a fluid is reduced to half the value of the first fluid, the pressure drop will (A) Increase (B) Decrease (C) Remain unchanged (D) Data insufficient to predict relative pressure drop

Description : Two fluids are flowing through two similar pipes of the same diameter. The Reynold's number is same. For the same flow rate if the viscosity of a fluid is reduced to half the value of the ... (A) Increase (B) Decrease (C) Remain unchanged (D) Data insufficient to predict relative pressure drop

Last Answer : (B) Decrease

The value of `Delta_(0) " for " [Ti(H_(2)O)_(6)]^(3+)` is found to be 240 kJ `mol^(-1)` then predict the colour of the complex using the following tab

Description : The value of `Delta_(0) " for " [Ti(H_(2)O)_(6)]^(3+)` is found to be 240 kJ `mol^(-1)` then predict the colour of the complex using the following tab

Last Answer : The value of `Delta_(0) " for " [Ti(H_(2)O)_(6)]^(3+)` is found to be 240 kJ `mol^(-1)` then ... -34)J-sec,N_(A)=6xx10^(23)c=3xx10^(8) m//sec)`

Which of the following is/are the DDL statements? A) Create B) Drop C) Alter D) All of the above

Description : Which of the following is/are the DDL statements? A) Create B) Drop C) Alter D) All of the above

Last Answer : D) All of the above

To delete a database ................... command is used A) delete database database_name B) Delete database_name C) drop database database_name D) drop database_name

Description : To delete a database ................... command is used A) delete database database_name B) Delete database_name C) drop database database_name D) drop database_name

Last Answer : C) drop database database_name

How many LONG columns are allowed in a table ? Is it possible to use LONG columns in WHERE clause or ORDER BY ?

Description : How many LONG columns are allowed in a table ? Is it possible to use LONG columns in WHERE clause or ORDER BY ?

Last Answer : Only one LONG columns is allowed. It is not possible to use LONG column in WHERE or ORDER BY clause.

A context diagram is used A) as the first step in developing a detailed DFD of a system B) in systems analysis of very complex systems C) as an aid to system design D) as an aid to programmer

Description : A context diagram is used A) as the first step in developing a detailed DFD of a system B) in systems analysis of very complex systems C) as an aid to system design D) as an aid to programmer

Last Answer : A) as the first step in developing a detailed DFD of a system

It is better to use files than a DBMS when there are (A) Stringent real-time requirements. (B) Multiple users wish to access the data. (C) Complex relationships among data. (D) All of the above. t

Description : It is better to use files than a DBMS when there are (A) Stringent real-time requirements. (B) Multiple users wish to access the data. (C) Complex relationships among data. (D) All of the above.

Last Answer : (B) Multiple users wish to access the data.

Consider the following statements for priority queue: S1: It is a data structure in which the intrinsic ordering of the elements does determine the result of its basic operations. S2: The elements of a priority queue may be complex structures that are ordered on one or several fields. Which of the following is correct? (A) Both S1 and S2 are incorrect. (B) S1 is correct and S2 is incorrect. (C) SI is incorrect and S2 is correct. (D) Both S1 and S2 are correct.

Description : Consider the following statements for priority queue: S1: It is a data structure in which the intrinsic ordering of the elements does determine the result of its basic operations. S2: The elements of a priority queue ... . (C) SI is incorrect and S2 is correct. (D) Both S1 and S2 are correct.

Last Answer : (D) Both S1 and S2 are correct.

An attacker sits between the sender and receiver and captures the information and retransmits to the receiver after some time without altering the information. This attack is called as .............. (A) Denial of service attack (B) Masquarade attack (C) Simple attack (D) Complex attack

Description : An attacker sits between the sender and receiver and captures the information and retransmits to the receiver after some time without altering the information. This attack is called as .............. (A) Denial of service attack (B) Masquarade attack (C) Simple attack (D) Complex attack

Last Answer : (A) Denial of service attack 

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.

Observe the table named “Training” given above carefully and predict the output of the following queries: -Technology

Description : Observe the table named “Training” given above carefully and predict the output of the following queries: -Technology

Last Answer : (i) New DelhiFaridabadGurugram(ii) 2(iii) 11000(iv) Ms. Neena

Observe the given table named “Loan” carefully and predict the output of the following queries: -Technology

Description : Observe the given table named “Loan” carefully and predict the output of the following queries: -Technology

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

What can you predict about an element from its position on the periodic table?

Description : What can you predict about an element from its position on the periodic table?

Last Answer : Its position predicts several useful characteristics:1. The no. of valence electrons/the type of valence orbitals2. The nature of element3. Other Elements having similar chemistry4. rough idea of the ionization enthalpy, electronegativity, andother parametersand many more things

Mention the criteria for the evaluation of search strategy.

Description : Mention the criteria for the evaluation of search strategy.

Last Answer :  There are 4 criteria: Completeness, time complexity, space complexity, optimality

What is the difference between linear and binary search?

Description : What is the difference between linear and binary search?

Last Answer : A: Linear search does not require the array to be sorted, whereas, binary search requires that the array be sorted. Linear search checks for the search item in a linear fashion from the beginning cell till the end, ... tell what is control variable in your loop. So if your loop is for(int i = 1; i

When does Binary search fail?

Description : When does Binary search fail?

Last Answer : A: When the array is not sorted.

In general, the binary search method needs no more than ……………. comparisons. A) [log2n]-1 B) [logn]+1 C) [log2n] D) [log2n]+1

Description : In general, the binary search method needs no more than ……………. comparisons. A) [log2n]-1 B) [logn]+1 C) [log2n] D) [log2n]+1

Last Answer : D) [log2n]+1

State True or False. i) Binary search is used for searching in a sorted array. ii) The time complexity of binary search is O(logn). A) True, False B) False, True C) False, False D) True, True

Description : State True or False. i) Binary search is used for searching in a sorted array. ii) The time complexity of binary search is O(logn). A) True, False B) False, True C) False, False D) True, True

Last Answer : D) True, True