"lf my computations are correct and I pay the electric bill, then I will run out of money. If I don't pay the electric bill, the power will be turned off. Therefore, if I don't run out of money and the power is still on, then my computations are incorrect." Convert this argument into logical notations using the variables c, b, r, p for propositions of computations, electric bills, out of money and the power respectively. (Where ¬ means NOT) (A) if (c∧b) → r and ¬b → ¬p, then (¬r∧p)→¬c (B) if (c∨b) → r and ¬b → ¬p, then (r∧p)→c (C) if (c∧b) → r and ¬p → ¬b, then (¬r∨p)→¬c (D) if (c∨b) → r and ¬b → ¬p, then (¬r∧p)→¬c

"lf my computations are correct and I pay the electric bill, then I will run out of money. If I don't pay the electric bill, the power will be turned off. Therefore, if I don't run out of money and the power is still on, then my computations are incorrect."

Convert this argument into logical notations using the variables c, b, r, p for propositions of computations, electric bills, out of money and the power respectively. (Where ¬ means NOT)

 (A) if (c∧b) → r and ¬b → ¬p, then (¬r∧p)→¬c

(B) if (c∨b) → r and ¬b → ¬p, then (r∧p)→c

(C) if (c∧b) → r and ¬p → ¬b, then (¬r∨p)→¬c

(D) if (c∨b) → r and ¬b → ¬p, then (¬r∧p)→¬c
by

1 Answer

Answer :

(A) if (c∧b) → r and ¬b → ¬p, then (¬r∧p)→¬c
by

Related questions

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

Which of the following shall be a compound proposition involving the propositions p, q and r, that is true when exactly two of the p, q and r are true and is false otherwise? (A) (p∨q∧˥r) ∨ (p∨q∧r) ∧ (˥p∧q∨r) (B) (p∧q∨r) ∧ (p∧q∧r) ∨ (˥q∨˥p∧˥r) (C) (p∧q∧˥r) ∨ (p∨˥q∧r) ∨ (˥p∧q∧r) (D) (p∨r∧q) ∨ (p∧q∧r) ∨ (˥p∧q∧r)

Description : Which of the following shall be a compound proposition involving the propositions p, q and r, that is true when exactly two of the p, q and r are true and is false otherwise? (A) (p∨q∧˥r) ∨ (p∨q∧r) ∧ (˥p∧q∨r) (B) ... ) ∨ (˥q∨˥p∧˥r) (C) (p∧q∧˥r) ∨ (p∨˥q∧r) ∨ (˥p∧q∧r) (D) (p∨r∧q) ∨ (p∧q∧r) ∨ (˥p∧q∧r) 

Last Answer : (C) (p∧q∧˥r) ∨ (p∨˥q∧r) ∨ (˥p∧q∧r)

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 the following statements: (a) Revised simplex method requires lesser computations than the simplex method. (b) Revised simplex method automatically generates the inverse of the current basis matrix. (c) Less number of entries are needed in each table of revised simplex method than usual simplex method. Which of these statements are correct? (A) (a) and (b) only (B) (a) and (c) only (C) (b) and (c) only (D) (a), (b) and (c)

Description : Consider the following statements: (a) Revised simplex method requires lesser computations than the simplex method. (b) Revised simplex method automatically generates the inverse of the current basis matrix. (c) Less number of entries are needed ... c) only (C) (b) and (c) only (D) (a), (b) and (c)

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

Loop unrolling is a code optimization technique: (A) that avoids tests at every iteration of the loop (B) that improves performance by decreasing the number of instructions in a basic block. (C) that exchanges inner loops with outer loops (D) that reorders operations to allow multiple computations to happen in parallel.

Description : Loop unrolling is a code optimization technique: (A) that avoids tests at every iteration of the loop (B) that improves performance by decreasing the number of instructions in a basic block. ... loops with outer loops (D) that reorders operations to allow multiple computations to happen in parallel.

Last Answer : (A) that avoids tests at every iteration of the loop

Taps P, Q and R can fill a tank in 3, 4 and 5 hours respectively. If all the taps are opened together and after 30 minutes taps Q and R are turned off, find the total time in which the tank is full. A) 2(3/8)hrs B) 1(1/7)hrs C) 2(13/40)hrs D) 3(13/43)hrs

Description : Taps P, Q and R can fill a tank in 3, 4 and 5 hours respectively. If all the taps are opened together and after 30 minutes taps Q and R are turned off, find the total time in which the tank is full. A) 2(3/8)hrs B) 1(1/7)hrs C) 2(13/40)hrs D) 3(13/43)hrs

Last Answer : C In 1 hr P, Q, R = 1/3+1/4+1/5 = 20+15+12/60 = 47/60 Filled in 30m = 47/120 Remaining = 1-47/120 =73/120 Tap P = 3*73/120= 219/120 Total = 219/120+1/2 =219+60 /120= 279/120= 2 13/40 hrs

"lf a large diamond is cut up into little bits, it will lose its value just as an army is divided up into small units of soldiers, it loses its strength." The argument put above may be called as (A) Analogical (B) Deductive (C) Statistical (D) Casual

Description : "lf a large diamond is cut up into little bits, it will lose its value just as an army is divided up into small units of soldiers, it loses its strength." The argument put above may be called as (A) Analogical (B) Deductive (C) Statistical (D) Casual

Last Answer : (A) Analogical

The VLF and LF bauds use .............. propagation for communication. (A) Ground (B) Sky (C) Line of sight (D) Space

Description : The VLF and LF bauds use .............. propagation for communication. (A) Ground (B) Sky (C) Line of sight (D) Space

Last Answer : Answer: A Explanation: VLF (Very Low Frequency) LF (Low Frequency) In general there are three type of propagation.1.Ground Propagation 2.Sky propagation 3.Line-of-sight propagation ... portion of the atmosphere. These low-frequency signals travel in all directions from the transmitting antenna.

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 

A memory management system has 64 pages with 512 bytes page size. Physical memory consists of 32 page frames. Number of bits required in logical and physical address are respectively: (1) 14 and 15 (2) 14 and 29 (3) 15 and 14 (4) 16 and 32

Description : A memory management system has 64 pages with 512 bytes page size. Physical memory consists of 32 page frames. Number of bits required in logical and physical address are respectively: (1) 14 and 15 (2) 14 and 29 (3) 15 and 14 (4) 16 and 32

Last Answer : (3) 15 and 14

Let us assume that you construct ordered tree to represent the compound proposition (~(p˄q))↔(~p˅~q). Then, the prefix expression and post-fix expression determined using this ordered tree are given as ........... and ............. respectively. (A) ↔~˄pq˅ ~~pq, pq˄~p~q~˅↔ (B) ↔~˄pq˅ ~p~q, pq˄~p~q~˅↔ (C) ↔~˄pq˅ ~~pq, pq˄~p~ ~q˅↔ (D) ↔~˄pq˅ ~p~q, pq˄~p~~q˅↔

Description : Let us assume that you construct ordered tree to represent the compound proposition (~(p˄q))↔(~p˅~q). Then, the prefix expression and post-fix expression determined using this ordered tree are given as ........... and .......... ... ~p~q~˅↔ (C) ↔~˄pq˅ ~~pq, pq˄~p~ ~q˅↔ (D) ↔~˄pq˅ ~p~q, pq˄~p~~q˅↔

Last Answer : (B) ↔~˄pq˅ ~p~q, pq˄~p~q~˅↔

Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively transition table as given below Image The minimum number of states required in Deterministic Finite Automation (DFA) equivalent to NFA is (A) 5 (B) 4 (C) 3 (D) 2

Description : Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively transition table as given below  The minimum number of states required in Deterministic Finite Automation (DFA) equivalent to NFA is (A) 5 (B) 4 (C) 3 (D) 2

Last Answer : (C) 3 

What error will be generated if a space is given between the logical AND operator (&&)? Will it be a compile-time or a run-time error?

Description : What error will be generated if a space is given between the logical AND operator (&&)? Will it be a compile-time or a run-time error?

Last Answer : Example: if(5>2 & & 6

What would happen if "String[]args" is not included as argument in the main method. A) No error B) Compilation error C) Program won't run D) Program exit

Description : What would happen if "String[]args" is not included as argument in the main method. A) No error B) Compilation error C) Program won't run D) Program exit

Last Answer : C) Program won't run

Horn clauses are special kinds of propositions which can be described as (A) Single atomic proposition on left side. (B) Single or multiple atomic proposition on left side. (C) A single atomic proposition on left side and a single atomic proposition on right side. (D) A single atomic proposition on left side or an empty left side.

Description : Horn clauses are special kinds of propositions which can be described as (A) Single atomic proposition on left side. (B) Single or multiple atomic proposition on left side. (C) A single atomic ... proposition on right side. (D) A single atomic proposition on left side or an empty left side.

Last Answer : (D) A single atomic proposition on left side or an empty left side.

Consider the compound propositions given below as: (a) p˅~(p˄q) (b) (p˄~q)˅~(p˄q) (c) p˄(q˅r) Which of the above propositions are tautologies? (A) (a) and (c) (B) (b) and (c) (C) (a) and (b) (D) (a), (b) and (c)

Description : Consider the compound propositions given below as: (a) p˅~(p˄q) (b) (p˄~q)˅~(p˄q) (c) p˄(q˅r) Which of the above propositions are tautologies? (A) (a) and (c) (B) (b) and (c) (C) (a) and (b) (D) (a), (b) and (c)

Last Answer : Answer: Marks to all

Logical reasoning is based on: (A) Truth of involved propositions (B) Valid relation among the involved propositions (C) Employment of symbolic language (D) Employment of ordinary language

Description : Logical reasoning is based on: (A) Truth of involved propositions (B) Valid relation among the involved propositions (C) Employment of symbolic language (D) Employment of ordinary language

Last Answer : (B) Valid relation among the involved propositions

Both premises and conclusion of an argument are _______. A) Commands B) Propositions C) Exclamations D) Questions.

Description : Both premises and conclusion of an argument are _______. A) Commands B) Propositions C) Exclamations  D) Questions.  

Last Answer : B) Propositions 

Propositions which supports the conclusion of an argument are called A) Inferences B) Premises C) Terms D) Concepts.

Description : Propositions which supports the conclusion of an argument are called  A) Inferences B) Premises C) Terms D) Concepts.

Last Answer : B) Premises 

A Cluster of propositions with a structure that exhibits some inference is called (A) An inference (B) An argument (C) An explanation (D) A valid argument

Description : A Cluster of propositions with a structure that exhibits some inference is called (A) An inference (B) An argument (C) An explanation (D) A valid argument

Last Answer : Answer: B

When in a group of propositions, one proposition is claimed to follow from the others, that group of propositions is called (A) An argument (B) A valid argument (C) An explanation (D) An invalid argument

Description : When in a group of propositions, one proposition is claimed to follow from the others, that group of propositions is called (A) An argument (B) A valid argument (C) An explanation (D) An invalid argument

Last Answer : (A) An argument

Where does the degree of belief is applied? a) Propositions b) Literals c) Variables d) Statements

Description : Where does the degree of belief is applied? a) Propositions b) Literals c) Variables d) Statements

Last Answer : a) Propositions

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)=Φ 

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.

The dimensions of rate constant for reaction 3A → B are (l/gm mole)/min. Therefore the reaction order is (A) 0 (B) 1 (C) 2 (D) 3

Description : The dimensions of rate constant for reaction 3A → B are (l/gm mole)/min. Therefore the reaction order is (A) 0 (B) 1 (C) 2 (D) 3

Last Answer : (C) 2

What "cool" sportcars (50-100k €/$) are there?

Description : What "cool" sportcars (50-100k €/$) are there?

Last Answer : After not finding some sort of a list on the internet, I thought, duck it, lets try answers. Thanks for the answers!

Below are the few steps given for scan-converting a circle using Bresenham's Algorithm. Which of the given steps is not correct? (1) Compute d = 3 – 2r (where r is radius) (2) Stop if x> y (3) If d<0, then d=4x+6 and x=x+1 (4) If d≥0,then d=4 *(x-y)+10, x=x+1 and y=y+1

Description : Below are the few steps given for scan-converting a circle using Bresenham's Algorithm. Which of the given steps is not correct? (1) Compute d = 3 – 2r (where r is radius) (2) Stop if x> y (3) If d

Last Answer : If d≥0,then d=4 *(x-y)+10, x=x+1 and y=y+1

The grammar with production rules S → aSb |SS|λ generates language L given by: (A) L = {w∈{a, b}* | na(w) = nb(w) and na(v) ≥ nb(v) where v is any prefix of w} (B) L = {w∈{a, b}* | na(w) = nb(w) and na(v) ≤ nb(v) where v is any prefix of w} (C) L = {w∈{a, b}* | na(w) ≠ nb(w) and na(v) ≥ nb(v) where v is any prefix of w} (D) L = {w∈{a, b}* | na(w) ≠ nb(w) and na(v) ≤ nb(v) where v is any prefix of w}

Description : The grammar with production rules S → aSb |SS|λ generates language L given by: (A) L = {w∈{a, b}* | na(w) = nb(w) and na(v) ≥ nb(v) where v is any prefix of w} (B) L = {w∈{a, b}* | na(w) = nb(w) and na(v ... (D) L = {w∈{a, b}* | na(w) ≠ nb(w) and na(v) ≤ nb(v) where v is any prefix of w}

Last Answer : (A) L = {w∈{a, b}* | na(w) = nb(w) and na(v) ≥ nb(v) where v is any prefix of w} 

In propositional logic P↔Q is equivalent to (Where ~ denotes NOT): (A) ~(P∨Q)∧~(Q∨P) (B) (~P∨Q)∧(~Q∨P) (C) (P∨Q)∧(Q∨P) (D) ~(P∨Q)→~(Q∨P)

Description : In propositional logic P↔Q is equivalent to (Where ~ denotes NOT): (A) ~(P∨Q)∧~(Q∨P) (B) (~P∨Q)∧(~Q∨P) (C) (P∨Q)∧(Q∨P) (D) ~(P∨Q)→~(Q∨P)

Last Answer : (B) (~P∨Q)∧(~Q∨P)

Which of the following addresses is used to deliver a message to the correct application program running on a host? (A) Port (B) IP (C) Logical (D) Physical

Description : Which of the following addresses is used to deliver a message to the correct application program running on a host? (A) Port (B) IP (C) Logical (D) Physical

Last Answer : (A) Port 

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

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

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

If n and r are non-negative integers and n≥r, then p(n + 1, r) equals to (A) P(n,r)(n+1) / (n+1-r) (B) P(n,r)(n+1) / (n-1+r) (C) p(n,r)(n-1) / (n+1-r) (D) p(n,r)(n+1) / (n+1+r)

Description : If n and r are non-negative integers and n≥r, then p(n + 1, r) equals to (A) P(n,r)(n+1) / (n+1-r) (B) P(n,r)(n+1) / (n-1+r) (C) p(n,r)(n-1) / (n+1-r) (D) p(n,r)(n+1) / (n+1+r)

Last Answer : (A) P(n,r)(n+1) / (n+1-r)  Explanation: p(n, r) = n!/(n-r)! p( n+1, r) = (n+1)!/(n+1-r)! = (n+1) n! /(n+1-r) (n-r)! = P(n, r)(n+1)/(n+1-r)

yo presented by hx of syncope when he do excurses and there was hix of same complain when he on rest . and there is chest pain on ex. There was ejection systolic murmur 2-4 degree most side is lower lf sternum not radiating to other site increase when he lying down and there is non specific s and t changing and there is lf atrium enlargement Aortic stenosis p.s hypertrophic cardiomyopathy constrictive cardiomyopathy

Description : yo presented by hx of syncope when he do excurses and there was hix of same complain when he on rest . and there is chest pain on ex. There was ejection systolic murmur ... t changing and there is lf atrium enlargement Aortic stenosis p.s hypertrophic cardiomyopathy constrictive cardiomyopathy

Last Answer : Aortic stenosis

When signed numbers are used in binary arithmetic, then which one of the following notations would have unique representation for zero. (A) Sign-magnitude. (B) 1’s complement. (C) 2’s complement. (D) 9’s complement.

Description : When signed numbers are used in binary arithmetic, then which one of the following notations would have unique representation for zero. (A) Sign-magnitude. (B) 1’s complement. (C) 2’s complement. (D) 9’s complement.

Last Answer : (A) Sign-magnitude.

Molecularity of an elementary reaction, P + Q → R + S is (A) 1 (B) 2 (C) 3 (D) 4

Description : Molecularity of an elementary reaction, P + Q → R + S is (A) 1 (B) 2 (C) 3 (D) 4

Last Answer : (D) 4

In a queue, the initial values of front pointer f rare pointer r should be ….. and …….. respectively. A) 0 and 1 B) 0 and -1 C) -1 and 0 D) 1 and 0

Description : In a queue, the initial values of front pointer f rare pointer r should be ….. and …….. respectively. A) 0 and 1 B) 0 and -1 C) -1 and 0 D) 1 and 0

Last Answer : B) 0 and -1

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

When you are invited for a feast, then you have the idea that Options: A) Do wastage of food in order to pay the gift or money on the occasion B) It is an opportunity to take food outside home, therefore, enjoy it with whole family C) That families should join such parties on the basis of relations and affinity D) Never waste any food particle whether you are at home or in feast

Description : When you are invited for a feast, then you have the idea that Options: A) Do wastage of food in order to pay the gift or money on the occasion B) It is an opportunity to take food ... the basis of relations and affinity D) Never waste any food particle whether you are at home or in feast

Last Answer : C) That families should join such parties on the basis of relations and affinity 

(2) experience collision less frequently Explanation: When an electric field is applied, both the valence electrons and the free electrons move in the same direction. The hole direction is opposite to that of valence electron but the mobility is the same. Even for the same electric field, valence electrons cannot move as freely as the free electrons because its movement is restricted due to collisions. Therefore, the velocity of valence electrons is less compared to free electrons. In other words, the velocity of holes is less compared to free electrons. This means mobility is also less for a hole compared to free electron.

Description : (2) experience collision less frequently Explanation: When an electric field is applied, both the valence electrons and the free electrons move in the same direction. The hole direction is opposite to that ... to free electrons. This means mobility is also less for a hole compared to free electron.

Last Answer : Carbon dioxide is called a greenhouse gas because - (1) its concentration remains always higher than other gases (2) it is used in photosynthesis (3) it absorbs infrared radiation (4) it emits visible radiation

Consider the fractional knapsack instance n = 4, (p1, p2, p3, p4) = (10, 10, 12, 18), (w1, w2, w3, w4) = (2, 4, 6, 9) and M = 15. The maximum profit is given by (Assume p and w denotes profit and weight of objects respectively) (A) 40 (B) 38 (C) 32 (D) 30

Description : Consider the fractional knapsack instance n = 4, (p1, p2, p3, p4) = (10, 10, 12, 18), (w1, w2, w3, w4) = (2, 4, 6, 9) and M = 15. The maximum profit is given by (Assume p and w denotes profit and weight of objects respectively) (A) 40 (B) 38 (C) 32 (D) 30

Last Answer : (B) 38

The distributed system is a collection of (P) and communication is achieved in distributed system by (Q) , where (P) and (Q) are : (A) Loosely coupled hardware on tightly coupled software and disk sharing, respectively. (B) Tightly coupled hardware on loosely coupled software and shared memory, respectively. (C) Tightly coupled software on loosely coupled hardware and message passing ,respectively. (D) Loosely coupled software on tightly coupled hardware and file sharing, respectively.

Description : The distributed system is a collection of (P) and communication is achieved in distributed system by (Q) , where (P) and (Q) are : (A) Loosely coupled hardware on tightly ... message passing ,respectively. (D) Loosely coupled software on tightly coupled hardware and file sharing, respectively.

Last Answer : (C) Tightly coupled software on loosely coupled hardware and message passing ,respectively. 

If services/facilities are available as a result of your being a member of an organisation, but you choose not to use them, do you therefore have a good argument for paying a reduced membership fee?

Description : If services/facilities are available as a result of your being a member of an organisation, but you choose not to use them, do you therefore have a good argument for paying a reduced membership fee?

Last Answer : answer:It is unreasonable for an organization to have to fine tune its membership fees, unless there is a large minority with the same issues. What’s “subs to go towards areas other than those…” mean?

All Indians are hardworking All Keralites are Indians Therefore, All Keralites are hardworking The above argument is A) Invalid B) False C) Valid D) True

Description : All Indians are hardworking All Keralites are Indians Therefore, All Keralites are hardworking The above argument is A) Invalid B) False C) Valid D) True 

Last Answer : C) Valid 

“All thugs are murderers Therefore all Indians are murderers”. The fallacy committed by above argument is A) Illicit minor B) Illicit major C) Ambiguous major D) Undistributed middle.

Description : “All thugs are murderers  Therefore all Indians are murderers”.  The fallacy committed by above argument is  A) Illicit minor  B) Illicit major  C) Ambiguous major  D) Undistributed middle. 

Last Answer : A) Illicit minor