A relation R={A,B,C,D,E,F,G} is given with following set of functional dependencies: F={AD→E, BE→F, B→C, AF→G} Which of the following is a candidate key? (A) A (B) AB (C) ABC (D) ABD

A relation R={A,B,C,D,E,F,G} is given with following set of functional dependencies: F={AD→E, BE→F, B→C, AF→G} Which of the following is a candidate key? (A) A (B) AB (C) ABC (D) ABD
by

1 Answer

Answer :

Answer: D
by

Related questions

For a database relation R(A,B,C,D) where the domains of A,B,C and D include only atomic values, only the following functional dependencies and those that can be inferred from them are: A→C B→D The relation R is in ................ (1) First normal form but not in second normal form (2) Both in first normal form as well as in second normal form (3) Second normal form but not in third normal form (4) Both in second normal form as well as in third normal form

Description : For a database relation R(A,B,C,D) where the domains of A,B,C and D include only atomic values, only the following functional dependencies and those that can be inferred from them are: A→C B→D The ... form but not in third normal form (4) Both in second normal form as well as in third normal form

Last Answer : First normal form but not in second normal form

Let R be the rectangular window against which the lines are to be clipped using 2D Sutherland-Cohen line clipping algorithm. The rectangular window has lower left-hand corner at (-5,1) and upper righthand corner at (3,7). Consider the following three lines for clipping with the given end point co-ordinates: Line AB: A(-6,2) and B(-1,8) Line CD: C(-1,5) and D(4,8) Line EF: E(-2,3) and F(1,2) Which of the following line(s) is/are candidate for clipping? (A) AB (B) CD (C) EF (D) AB and CD

Description : Let R be the rectangular window against which the lines are to be clipped using 2D Sutherland-Cohen line clipping algorithm. The rectangular window has lower left-hand corner at (-5,1) and upper righthand corner at (3,7). ... s) is/are candidate for clipping? (A) AB (B) CD (C) EF (D) AB and CD

Last Answer : (D) AB and CD

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

Convert the following infix expression into its equivalent post fix expression (A + B^ D) / (E – F) + G (A) ABD^ + EF – / G+ (B) ABD + ^EF – / G+ (C) ABD + ^EF / – G+ (D) ABD^ + EF / – G+

Description : Convert the following infix expression into its equivalent post fix expression (A + B^ D) / (E – F) + G (A) ABD^ + EF – / G+ (B) ABD + ^EF – / G+ (C) ABD + ^EF / – G+ (D) ABD^ + EF / – G+

Last Answer : (A + B^ D) / (E – F) + G

Relational database schema normalization is NOT for: (A) reducing the number of joins required to satisfy a query. (B) eliminating uncontrolled redundancy of data stored in the database. (C) eliminating number of anomalies that could otherwise occur with inserts and deletes. (D) ensuring that functional dependencies are enforced.

Description : Relational database schema normalization is NOT for: (A) reducing the number of joins required to satisfy a query. (B) eliminating uncontrolled redundancy of data stored in the database. (C) ... could otherwise occur with inserts and deletes. (D) ensuring that functional dependencies are enforced. 

Last Answer : reducing the number of joins required to satisfy a query.

Consider the following database table having A, B, C and D as its four attributes and four possible candidate keys (I, II, III and IV) for this table: Image I: {B} II: {B, C} III: {A, D} IV: {C, D} If different symbols stand for different values in the table (e.g., d1 is definitely not equal to d2), then which of the above could not be the candidate key for the database table? (A) I and III only (B) III and IV only (C) II only (D) I only

Description : Consider the following database table having A, B, C and D as its four attributes and four possible candidate keys (I, II, III and IV) for this table: I: {B} II: {B, C} III: {A, D} IV: {C, D} If ... the database table? (A) I and III only (B) III and IV only (C) II only (D) I only

Last Answer : (C) II only

Which one is correct w.r.t. RDBMS? (1) primary key ⊆ super key ⊆ candidate key (2) primary key ⊆ candidate key ⊆ super key (3) super key ⊆ candidate key ⊆ primary key (4) super key ⊆ primary key ⊆ candidate key

Description : Which one is correct w.r.t. RDBMS? (1) primary key ⊆ super key ⊆ candidate key (2) primary key ⊆ candidate key ⊆ super key (3) super key ⊆ candidate key ⊆ primary key (4) super key ⊆ primary key ⊆ candidate key

Last Answer : Answer: 2

For a database relation R(a, b, c, d) where the domains of a, b, c, d include only the atomic values. The functional dependency a → c, b → d holds in the following relation (A) In 1NF not in 2NF (B) In 2NF not in 3NF (C) In 3NF (D) In 1NF

Description : For a database relation R(a, b, c, d) where the domains of a, b, c, d include only the atomic values. The functional dependency a → c, b → d holds in the following relation (A) In 1NF not in 2NF (B) In 2NF not in 3NF (C) In 3NF (D) In 1NF

Last Answer : (A) In 1NF not in 2NF 

Let pk(R) denotes primary key of relation R. A many-to-one relationship that exists between two relations R1 and R2 can be expressed as follows: (1) pk(R2)→pk(R1) (2) pk(R1)→pk(R2) (3) pk(R2)→R1∩R2 (4) pk(R1)→R1∩R2

Description : Let pk(R) denotes primary key of relation R. A many-to-one relationship that exists between two relations R1 and R2 can be expressed as follows: (1) pk(R2)→pk(R1) (2) pk(R1)→pk(R2) (3) pk(R2)→R1∩R2 (4) pk(R1)→R1∩R2

Last Answer : Answer: 2

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’

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

In Fig. 4.6, if ABC and ABD are equilateral triangles then find the coordinates of C and D. -Maths 9th

Description : In Fig. 4.6, if ABC and ABD are equilateral triangles then find the coordinates of C and D. -Maths 9th

Last Answer : Solution :-

............. is a combination of two of more attributes used as a primary key A) Composite Key B) Alternate Key C) Candidate Key D) Foreign Key

Description : ............. is a combination of two of more attributes used as a primary key A) Composite Key B) Alternate Key C) Candidate Key D) Foreign Key

Last Answer : A) Composite Key

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

The candidate key is that you choose to identify each row uniquely is called …………….. A) Alternet Key B) Primary Key C) Foreign Key D) None of the above

Description : The candidate key is that you choose to identify each row uniquely is called …………….. A) Alternet Key B) Primary Key C) Foreign Key D) None of the above

Last Answer : B) Primary Key

Let f and g be the functions from the set of integers to the set integers defined by f(x) = 2x + 3 and g(x) = 3x + 2 Then the composition of f and g and g and f is given as (A) 6x + 7, 6x + 11 (B) 6x + 11, 6x + 7 (C) 5x + 5, 5x + 5 (D) None of the above

Description : Let f and g be the functions from the set of integers to the set integers defined by f(x) = 2x + 3 and g(x) = 3x + 2 Then the composition of f and g and g and f is given as (A) 6x + 7, 6x + 11 (B) 6x + 11, 6x + 7 (C) 5x + 5, 5x + 5 (D) None of the above

Last Answer : (A) 6x + 7, 6x + 11 Explanation: fog(x)=f(g(x))=f(3x+2)=2(3x+2)+3=6x+7 gof(x)=g(f(x))=g(2x+3)=3(2x+3)+2=6x+11

Consider a system with seven processes A through G and six resources R through W. Resource ownership is as follows: process A holds R and wants T process B holds nothing but wants T process C holds nothing but wants S process D holds U and wants S & T process E holds T and wants V process F holds W and wants S process G holds V and wants U Is the system deadlocked ? If yes, ............. processes are deadlocked. (A) No (B) Yes, A, B, C (C) Yes, D, E, G (D) Yes, A, B, F

Description : Consider a system with seven processes A through G and six resources R through W. Resource ownership is as follows: process A holds R and wants T process B holds nothing but wants T process C holds nothing but wants S process D holds U ... No (B) Yes, A, B, C (C) Yes, D, E, G (D) Yes, A, B, F

Last Answer : (C) Yes, D, E, G

Which of the following statement is true? (1) A Primary key is also a candidate key (2) Each relation has at least one foreign key (3) Foreign keys can’t have null values (4) A Primary key is also an alternate key

Description : Which of the following statement is true? (1) A Primary key is also a candidate key (2) Each relation has at least one foreign key (3) Foreign keys can’t have null values (4) A Primary key is also an alternate key

Last Answer : Foreign keys can’t have null values

D, E and F are respectively the mid-points of the sides AB, BC and CA of a triangle ABC. -Maths 9th

Description : D, E and F are respectively the mid-points of the sides AB, BC and CA of a triangle ABC. -Maths 9th

Last Answer : Since the segment joining the mid points of any two sides of a triangle is half the third side and parallel to it. DE = 1 / 2 AC ⇒ DE = AF = CF EF = 1 / 2 AB ⇒ EF = AD = BD DF = 1 ... △DEF ≅ △AFD Thus, △DEF ≅ △CFE ≅ △BDE ≅ △AFD Hence, △ABC is divided into four congruent triangles.

In the fig, D, E and F are, respectively the mid-points of sides BC, CA and AB of an equilateral triangle ABC. -Maths 9th

Description : In the fig, D, E and F are, respectively the mid-points of sides BC, CA and AB of an equilateral triangle ABC. -Maths 9th

Last Answer : Since line segment joining the mid-points of two sides of a triangle is half of the third side. Therefore, D and E are mid-points of BC and AC respectively. ⇒ DE = 1 / 2 AB --- (i) E and F are the mid - ... CA ⇒ DE = EF = FD [using (i) , (ii) , (iii) ] Hence, DEF is an equilateral triangle .

D, E and F are respectively the mid-points of the sides AB, BC and CA of a triangle ABC. -Maths 9th

Description : D, E and F are respectively the mid-points of the sides AB, BC and CA of a triangle ABC. -Maths 9th

Last Answer : Since the segment joining the mid points of any two sides of a triangle is half the third side and parallel to it. DE = 1 / 2 AC ⇒ DE = AF = CF EF = 1 / 2 AB ⇒ EF = AD = BD DF = 1 ... △DEF ≅ △AFD Thus, △DEF ≅ △CFE ≅ △BDE ≅ △AFD Hence, △ABC is divided into four congruent triangles.

In the fig, D, E and F are, respectively the mid-points of sides BC, CA and AB of an equilateral triangle ABC. -Maths 9th

Description : In the fig, D, E and F are, respectively the mid-points of sides BC, CA and AB of an equilateral triangle ABC. -Maths 9th

Last Answer : Since line segment joining the mid-points of two sides of a triangle is half of the third side. Therefore, D and E are mid-points of BC and AC respectively. ⇒ DE = 1 / 2 AB --- (i) E and F are the mid - ... CA ⇒ DE = EF = FD [using (i) , (ii) , (iii) ] Hence, DEF is an equilateral triangle .

D,E and F are the mid-points of the sides BC,CA and AB,respectively of an equilateral triangle ABC.Show that △DEF is also an euilateral triangle -Maths 9th

Description : D,E and F are the mid-points of the sides BC,CA and AB,respectively of an equilateral triangle ABC.Show that △DEF is also an euilateral triangle -Maths 9th

Last Answer : Solution :-

Let ABC be a triangle. Let D, E, F be points respectively on segments BC, CA, AB such that AD, BE and CF concur at point K. -Maths 9th

Description : Let ABC be a triangle. Let D, E, F be points respectively on segments BC, CA, AB such that AD, BE and CF concur at point K. -Maths 9th

Last Answer : answer:

Suppose ORACLE relation R(A, B) currently has tuples {(1, 2), (1, 3), (3, 4)} and relation S(B, C) currently has {(2, 5), (4, 6), (7, 8)}. Consider the following two SQL queries SQ1 and SQ2 : SQ1 : Select * From R Full Join S On R.B=S.B; SQ2 : Select * From R Inner Join S On R.B=S.B; The numbers of tuples in the result of the SQL query SQ1 and the SQL query SQ2 are given by : (A) 2 and 6 respectively (B) 6 and 2 respectively (C) 2 and 4 respectively (D) 4 and 2 respectively

Description : Suppose ORACLE relation R(A, B) currently has tuples {(1, 2), (1, 3), (3, 4)} and relation S(B, C) currently has {(2, 5), (4, 6), (7, 8)}. Consider the following two SQL queries SQ1 and SQ2 ... (A) 2 and 6 respectively (B) 6 and 2 respectively (C) 2 and 4 respectively (D) 4 and 2 respectively

Last Answer : (D) 4 and 2 respectively

Let R and S be two fuzzy relations defined as: Image Then, the resulting relation, T, which relates elements of universe x to elements of universe z using max-min composition is given by

Description : Let R and S be two fuzzy relations defined as: Then, the resulting relation, T, which relates elements of universe x to elements of universe z using max-min composition is given by

Last Answer : Answer: C

In RDBMS, the constraint that no key attribute (column) may be NULL is referred to as: (A) Referential integrity (B) Multi-valued dependency (C) Entity Integrity (D) Functional dependency

Description : In RDBMS, the constraint that no key attribute (column) may be NULL is referred to as: (A) Referential integrity (B) Multi-valued dependency (C) Entity Integrity (D) Functional dependency

Last Answer : (C) Entity Integrity

On the set R of all real numbers, a relation R is defined by R = {(a, b) : 1 + ab > 0}. Then R is -Maths 9th

Description : On the set R of all real numbers, a relation R is defined by R = {(a, b) : 1 + ab > 0}. Then R is -Maths 9th

Last Answer : (a) Reflexive and symmetric only(a, a) ∈ R ⇒ 1 + a . a = 1 + a2 > 0 V real numbers a ⇒ R is reflexive (a, b) ∈ R ⇒ 1 + ab > 0 ⇒ 1 + ba > 0 ⇒ (b, a) ∈ R ⇒ R is symmetricWe observe that \(\big(1,rac{1}{2}\big) ... }{2},-1\big)\) ∈ Rbut (1, - 1) ∉ R as 1 + 1 (-1) = 0 \( ot>\) 0 ⇒ R is not transitive.

Consider the following Entity-Relationship (E-R) diagram and three possible relationship sets (I, II and III) for this E-R diagram: Image If different symbols stand for different values (e.g., t1 is definitely not equal to t2), then which of the above could not be the relationship set for the E-R diagram ? (A) I only (B) I and II only (C) II only (D) I, II and III

Description : Consider the following Entity-Relationship (E-R) diagram and three possible relationship sets (I, II and III) for this E-R diagram: If different symbols stand for different values (e.g., t1 is definitely not equal to t2 ... diagram ? (A) I only (B) I and II only (C) II only (D) I, II and III

Last Answer : (A) I only

A .................. normal form normalization will be needed where all attributes in a relation tuple are not functionally dependent only on the key attribute. A) First B) Second C) Third D) Fourth

Description : A .................. normal form normalization will be needed where all attributes in a relation tuple are not functionally dependent only on the key attribute. A) First B) Second C) Third D) Fourth

Last Answer : C) Third

The Relation Vendor Order (V_no, V_ord_no, V_name, Qty_sup, unit_price) is in 2NF because : (A) Non key attribute V_name is dependent on V_no which is part of composite key (B) Non key attribute V_name is dependent on Qty_sup (C) key attribute Qty_sup is dependent on primary_key unit price (D) key attribute V_ord_no is dependent on primary_key unit price

Description : The Relation Vendor Order (V_no, V_ord_no, V_name, Qty_sup, unit_price) is in 2NF because : (A) Non key attribute V_name is dependent on V_no which is part of composite key (B) ... Qty_sup is dependent on primary_key unit price (D) key attribute V_ord_no is dependent on primary_key unit price

Last Answer : (A) Non key attribute V_name is dependent on V_no which is part of composite key

Given the symbols A, B, C, D, E, F, G and H with the probabilities 1/30, 1/30, 1/30, 2/30, 3/30, 5/30, 5/30 and 12/30 respectively. The average Huffman code size in bits per symbol is: (A) 67/30 (B) 70/34 (C) 76/30 (D) 78/30

Description : Given the symbols A, B, C, D, E, F, G and H with the probabilities 1/30, 1/30, 1/30, 2/30, 3/30, 5/30, 5/30 and 12/30 respectively. The average Huffman code size in bits per symbol is: (A) 67/30 (B) 70/34 (C) 76/30 (D) 78/30

Last Answer : (C) 76/30

What does this mean? on trying to update/install some default programs I got this: Unmet dependencies. Try 'apt-get -f install' with no packages (or specify a solution).

Description : What does this mean? on trying to update/install some default programs I got this: Unmet dependencies. Try 'apt-get -f install' with no packages (or specify a solution).

Last Answer : sounds like you are installing a debian based linux on your pc, right? what flavor? apt-get is a debian package manager and the -f tells it to attempt to install even if integrity checks fail.

The relation schemas R1 and R2 form a Lossless join decomposition of R if and only if: (a) R1⋂R2→(R1-R2) (b) R1→R2 (c) R1⋂R2→(R2-R1) (d) R2→R1⋂R2 (A) (a) and (b) happens (B) (a) and (d) happens (C) (a) and (c) happens (D) (b) and (c) happens

Description : The relation schemas R1 and R2 form a Lossless join decomposition of R if and only if: (a) R1⋂R2→(R1-R2) (b) R1→R2 (c) R1⋂R2→(R2-R1) (d) R2→R1⋂R2 (A) (a) and (b) happens (B) (a) and (d) happens (C) (a) and (c) happens (D) (b) and (c) happens

Last Answer : (C) (a) and (c) happens 

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

Which of the following provides the best description of an entity type? (A) A specific concrete object with a defined set of processes (e.g. Jatin with diabetes) (B) A value given to a particular attribute (e.g. height-230 cm) (C) A thing that we wish to collect data about zero or more, possibly real world examples of it may exist. (D) A template for a group of things with the same set of characteristics that may exist in the real world

Description : Which of the following provides the best description of an entity type? (A) A specific concrete object with a defined set of processes (e.g. Jatin with diabetes) (B) A value given to a ... template for a group of things with the same set of characteristics that may exist in the real world

Last Answer : Answer: D

An instance of a relation is a time varying set of …………………. A) Tuples B) Rows C) Both of them D) None of them

Description : An instance of a relation is a time varying set of …………………. A) Tuples B) Rows C) Both of them D) None of them

Last Answer : C) Both of them

The relation "divides" on a set of positive integers is .................. (A) Symmetric and transitive (B) Anti symmetric and transitive (C) Symmetric only (D) Transitive only

Description : The relation "divides" on a set of positive integers is .................. (A) Symmetric and transitive (B) Anti symmetric and transitive (C) Symmetric only (D) Transitive only

Last Answer : (B) Anti symmetric and transitive Explanation: The ‘divide’ operation is antisymmetric because if a divides b does not necessarily implies that b divides a. If a divides b and b divides c then a divides c. So, it is transitive as well.

Consider the formula in image processing RD = 1 - (1/CR) Where CR = n1/n2 CR is called as compression ratio n1 and n2 denotes the number of information carrying units in two datasets that represent the same information. In this situation RD is called as relative ................ of the first data set. (A) Data Compression (B) Data Redundancy (C) Data Relation (D) Data Representation

Description : Consider the formula in image processing RD = 1 - (1/CR) Where CR = n1/n2 CR is called as compression ratio n1 and n2 denotes the number of information carrying units in two datasets that represent ... . (A) Data Compression (B) Data Redundancy (C) Data Relation (D) Data Representation

Last Answer : (B) Data Redundancy

The reverse polish notation equivalent to the infix expression ((A + B) * C + D)/(E + F + G) (A) A B + C * D + EF + G + / (B) A B + C D * + E F + G + / (C) A B + C * D + E F G + +/ (D) A B + C * D + E + F G + /

Description : The reverse polish notation equivalent to the infix expression ((A + B) * C + D)/(E + F + G) (A) A B + C * D + EF + G + / (B) A B + C D * + E F + G + / (C) A B + C * D + E F G + +/ (D) A B + C * D + E + F G + /

Last Answer : (A) A B + C * D + EF + G + /

In the following graph, discovery time stamps and finishing time stamps of Depth First Search (DFS) are shown as x/y where x is discovery time stamp and y is finishing time stamp. Image It shows which of the following depth first forest? (A) {a,b,e} {c,d,f,g,h} (B) {a,b,e} {c,d,h} {f,g} (C) {a,b,e} {f,g} {c,d} {h} (D) {a,b,c,d} {e,f,g} {h}

Description : In the following graph, discovery time stamps and finishing time stamps of Depth First Search (DFS) are shown as x/y where x is discovery time stamp and y is finishing time stamp.  It shows which of the following depth first forest? (A ... {a,b,e} {f,g} {c,d} {h} (D) {a,b,c,d} {e,f,g} {h}

Last Answer : Answer: A

The seven elements A, B, C, D, E, F and G are pushed onto a stack in reverse order, i.e., starting from G. The stack is popped five times and each element is inserted into a queue. Two elements are deleted from the queue and pushed back onto the stack. Now, one element is popped from the stack. The popped item is ................... (1) A (2) B (3) F (4) G

Description : The seven elements A, B, C, D, E, F and G are pushed onto a stack in reverse order, i.e., starting from G. The stack is popped five times and each element is inserted into a queue. Two elements are deleted from the queue and pushed ... The popped item is ................... (1) A (2) B (3) F (4) G

Last Answer : Answer: 2

An example of the risk involved in development is a) Key personnel may resign before the product is complete b) The manufacturer of critical components (e.g. the hardware associated with a real-time system) may go bankrupt c) Technology changes may render the product obsolete d) Competitors may market a fully functional lower-cost equivalent package e) All of these are risks involved in development.

Description : An example of the risk involved in development is a) Key personnel may resign before the product is complete b) The manufacturer of critical components (e.g. the hardware  associated with a ... a fully functional lower-cost  equivalent package e) All of these are risks involved in development.

Last Answer : e) All of these are risks involved in development.

In the given figure, ABC is an equilateral triangle of side length 30 cm. XY is parallel to BC, XP is parallel to AC and YQ is parallel to AB. -Maths 9th

Description : In the given figure, ABC is an equilateral triangle of side length 30 cm. XY is parallel to BC, XP is parallel to AC and YQ is parallel to AB. -Maths 9th

Last Answer : answer:

A B C is a set of attributes. The functional dependency is as follows AB -> B AC -> C C -> B a) is in 1NF b) is in 2NF c) is in 3NF d) is in BCNF

Description : A B C is a set of attributes. The functional dependency is as follows AB -> B AC -> C C -> B a) is in 1NF b) is in 2NF c) is in 3NF d) is in BCNF

Last Answer : a) is in 1NF

If we convert ∃u ∀v ∀x ∃y (P(f(u),v, x, y) → Q(u,v,y)) to ∀v ∀x (P(f(a),v, x, g(v,x)) → Q(a,v,g(v,x))) This process is known as (A) Simplification (B) Unification (C) Skolemization (D) Resolution

Description : If we convert ∃u ∀v ∀x ∃y (P(f(u),v, x, y) → Q(u,v,y)) to ∀v ∀x (P(f(a),v, x, g(v,x)) → Q(a,v,g(v,x))) This process is known as (A) Simplification (B) Unification (C) Skolemization (D) Resolution

Last Answer : (C) Skolemization

Consider f(N) = g(N) + h(N) Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current node N to the goal node. Then f(N) = h(N) is used in which one of the following algorithms ? (A) A* algorithm (B) AO* algorithm (C) Greedy best first search algorithm (D) Iterative A* algorithm

Description : Consider f(N) = g(N) + h(N) Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current ... ? (A) A* algorithm (B) AO* algorithm (C) Greedy best first search algorithm (D) Iterative A* algorithm

Last Answer : (C) Greedy best first search algorithm