In RSA public key cryptosystem suppose n=p*q where p and q are primes. (e,n) and (d,n) are public and private keys respectively. Let M be an integer such that 0<M<n and ɸ(n)=(p-1)(q-1). Which of the following equations represent RSA public key cryptosystem? I. C≡Me (mod n), M≡(C)d(mod n) II. ed≡1(mod n) III. ed≡(mod ɸ(n)) IV. C≡Me (mod ɸn), M≡Cd(mod ɸn) Codes: (1) I and II (2) I and III (3) II and III (4) I and IV

In RSA public key cryptosystem suppose n=p*q where p and q are primes. (e,n) and (d,n) are public and private keys respectively. Let M be an integer such that 0<M<n and ɸ(n)=(p-1)(q-1).

Which of the following equations represent RSA public key cryptosystem?

I. C≡Me (mod n), M≡(C)d(mod n)

II. ed≡1(mod n)

III. ed≡(mod ɸ(n))

IV. C≡Me (mod ɸn), M≡Cd(mod ɸn)

Codes:

(1) I and II

(2) I and III

(3) II and III

(4) I and IV 
by

1 Answer

Answer :

(2) I and III 
by

Related questions

Find the false statement: (A) In Modern Cryptography, symmetric key algorithms use same key both for Encryption and Decryption. (B) The Symmetric cipher DES (Data Encryption Standard) was widely used in the industry for security product. (C) The AES (Advanced Encryption Standard) cryptosystem allows variable key lengths of size 56 bits and 124 bits. (D) Public key algorithms use two different keys for Encryption and Decryption.

Description : Find the false statement: (A) In Modern Cryptography, symmetric key algorithms use same key both for Encryption and Decryption. (B) The Symmetric cipher DES (Data Encryption Standard) was widely used ... and 124 bits. (D) Public key algorithms use two different keys for Encryption and Decryption.

Last Answer : (C) The AES (Advanced Encryption Standard) cryptosystem allows variable key lengths of size 56 bits and 124 bits.

Using the RSA public key crypto system, if p=13, q=31 and d=7, then the value of e is (A) 101 (B) 105 (C) 103 (D) 107

Description : Using the RSA public key crypto system, if p=13, q=31 and d=7, then the value of e is (A) 101 (B) 105 (C) 103 (D) 107

Last Answer : (C) 103 Explanation: Basic RSA Algorithm: 1. Choose two primes, p & q. 2. Compute n=p*q and z=(p-1)*(q-1). 3. Choose a number relatively prime to z and call it d. 4. Find e such that e*d= ... each of these in turn by 7 to see which is divisible by 7, we find that 721/7 = 103, hence e = 103. 

Public key encryption method is a system a. which uses a set of public keys one for each participant in e-Commerce b. in which each person who wants to communicate has two keys; a private key known to him only and a public key which is publicized to enable others to send message to him. c. which uses the RSA coding system. d. which is a standard for use in e-Commerce.

Description : Public key encryption method is a system a. which uses a set of public keys one for each participant in e-Commerce b. in which each person who wants to communicate has two keys; a private key known to him ... him. c. which uses the RSA coding system. d. which is a standard for use in e-Commerce.  

Last Answer : b. in which each person who wants to communicate has two keys; a private key known to him only and a public key which is publicized to enable others to send message to him.

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

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~˅↔

Using data p=3, q=11, n=pq, d=7 in RSA algorithm find the cipher text of the given plain text SUZANNE (A) BUTAEEZ (B) SUZANNE (C) XYZABCD (D) ABCDXYZ

Description : Using data p=3, q=11, n=pq, d=7 in RSA algorithm find the cipher text of the given plain text SUZANNE (A) BUTAEEZ (B) SUZANNE (C) XYZABCD (D) ABCDXYZ

Last Answer : (A) BUTAEEZ

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

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

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

In RSA algorithm,if p=5,q=7,e=7and message=3. What will be the value of ciphertext ?

Description : In RSA algorithm,if p=5,q=7,e=7and message=3. What will be the value of ciphertext ?

Last Answer : 17

Using p=3, q=13, d=7 and e=3 in the RSA algorithm, what is the value of ciphertext for a plain text 5? (A) 13 (B) 21 (C) 26 (D) 33

Description : Using p=3, q=13, d=7 and e=3 in the RSA algorithm, what is the value of ciphertext for a plain text 5? (A) 13 (B) 21 (C) 26 (D) 33

Last Answer : Answer: Marks to all Explanation: p=3, q=13, d=7, e=3, M=5, C=? C = Me mod n n = p*q  = 3*13 = 39 C = 53 mod 39 = 8 Answer is 8.

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.

Consider a hash table of size m=100 and the hash function h(k) = floor(m(kA mod 1)) for A = (√5 − 1)/2 = 0.618033. Compute the location to which the key k = 123456 is placed in hash table. (A) 77 (B) 82 (C) 88 (D) 89

Description : Consider a hash table of size m=100 and the hash function h(k) = floor(m(kA mod 1)) for A = (√5 − 1)/2 = 0.618033. Compute the location to which the key k = 123456 is placed in hash table. (A) 77 (B) 82 (C) 88 (D) 89

Last Answer : (C) 88

If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n ≤ m, the expected number of collisions involving a particular key K is (A) less than 1 (B) less than lg n (C) greater than 1 (D) greater than lg n

Description : If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n ≤ m, the expected number of collisions involving a particular key K is (A) less than 1 (B) less than lg n (C) greater than 1 (D) greater than lg n

Last Answer : (A) less than 1

If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n≤m, the expected number of collisions involving a particular key x is less than ................... (1) 1 (2) 1/n (3) 1/m (4) n/m

Description : If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n≤m, the expected number of collisions involving a particular key x is less than ................... (1) 1 (2) 1/n (3) 1/m (4) n/m

Last Answer : Answer: 1

A three dimensional array in ‘C’ is declared as int A[x][y][z]. Here, the address of an item at the location A[p][q][r] can be computed as follows (where w is the word length of an integer): (A) &A[0][0][0]+w(y*z*q+z*p+r) (B) &A[0][0][0]+w(y*z*p+z*q+r) (C) &A[0][0][0]+w(x*y*p+z*q+r) (D) &A[0][0][0]+w(x*y*q+z*p+r)

Description : A three dimensional array in C' is declared as int A[x][y][z]. Here, the address of an item at the location A[p][q][r] can be computed as follows (where w is the word length of an integer): (A) &A[0][0][0]+w(y*z*q+z*p+r) (B) &A ... *q+r) (C) &A[0][0][0]+w(x*y*p+z*q+r) (D) &A[0][0][0]+w(x*y*q+z*p+r)

Last Answer : Answer: B

Let M and N be two entities in an E-R diagram with simple single vale attributes. R1 and R2 are two relationship between M and N, whereas R1 is one-to-many and R2 is many-to-many. The minimum number of tables required to represent M, N, R1 and R2 in the relational model are .......... (1) 4 (2) 6 (3) 7 (4) 3

Description : Let M and N be two entities in an E-R diagram with simple single vale attributes. R1 and R2 are two relationship between M and N, whereas R1 is one-to-many and R2 is many-to-many. The minimum number of tables required to ... and R2 in the relational model are .......... (1) 4 (2) 6 (3) 7 (4) 3

Last Answer : Answer: 4

Solve the following equations (where `[*]` dentoes greatest integer function and `{*}` represent fractional part function) `(i) 2[x]+3[x]=4x-1` `(ii)

Description : Solve the following equations (where `[*]` dentoes greatest integer function and `{*}` represent fractional part function) `(i) 2[x]+3[x]=4x-1` `(ii)

Last Answer : Solve the following equations (where `[*]` dentoes greatest integer function and `{*}` represent fractional part function) ... }` `(iii) [x]+2{-x}=3x`

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

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) 

If there are N people in the world and are using secret key encryption/decryption for privacy purpose, then number of secret keys required will be: (A) N (B) (N-1) (C) N(N-1)/2 (D) N(N+1)/2

Description : If there are N people in the world and are using secret key encryption/decryption for privacy purpose, then number of secret keys required will be: (A) N (B) (N-1) (C) N(N-1)/2 (D) N(N+1)/2

Last Answer : (C) N(N-1)/2 

Java Servlet i) is key component of server side java development ii) is a small pluggable extension to a server that enhances functionality iii) runs only in Windows Operating System iv) allows developers to customize any java enabled server A) i, ii & iii are ture B) i, iii & iv are true C) ii, iii & iv are true D) i, ii & iv are true

Description : Java Servlet i) is key component of server side java development ii) is a small pluggable extension to a server that enhances functionality iii) runs only in Windows Operating System iv) allows developers to customize any java ... & iv are true C) ii, iii & iv are true D) i, ii & iv are true

Last Answer : D) i, ii & iv are true

The key considerations involved in the feasibility analysis is include i) Economical ii) Technical iii) Behavioral iv) Personal A) i, ii, iv B) i, ii, iii C) ii, iii, iv D) All of the above

Description : The key considerations involved in the feasibility analysis is include i) Economical ii) Technical iii) Behavioral iv) Personal A) i, ii, iv B) i, ii, iii C) ii, iii, iv D) All of the above

Last Answer : B) i, ii, iii

Consider the following ER diagram: Image The minimum number of tables required to represent M, N, P, R1, R2 is (A) 2 (B) 3 (C) 4 (D) 5

Description : Consider the following ER diagram:  The minimum number of tables required to represent M, N, P, R1, R2 is (A) 2 (B) 3 (C) 4 (D) 5

Last Answer : (A) 2 

Assuming there are n keys and each keys is in the range [0, m-1]. The run time of bucket sort is (A) O(n) (B) O(n lgn) (C) O(n lgm) (D) O(n+m)

Description : Assuming there are n keys and each keys is in the range [0, m-1]. The run time of bucket sort is (A) O(n) (B) O(n lgn) (C) O(n lgm) (D) O(n+m)

Last Answer : (D) O(n+m)

In a relational database model, NULL values can be used for all but which one of the following? (A) To allow duplicate tuples in the table by filling the primary key column(s) with NULL. (B) To avoid confusion with actual legitimate data values like 0 (zero) for integer columns and ‘’ (the empty string) for string columns. (C) To leave columns in a tuple marked as “unknown” when the actual value is unknown. (D) To fill a column in a tuple when that column does not really “exist” for that particular tuple.

Description : In a relational database model, NULL values can be used for all but which one of the following? (A) To allow duplicate tuples in the table by filling the primary key column(s) with NULL. (B) To ... D) To fill a column in a tuple when that column does not really exist for that particular tuple.

Last Answer : (A) To allow duplicate tuples in the table by filling the primary key column(s) with NULL.

Solve the following equations (where `[*]` denotes greatest integer function and `{*}` represent fractional part function and sgn represents signum fu

Description : Solve the following equations (where `[*]` denotes greatest integer function and `{*}` represent fractional part function and sgn represents signum fu

Last Answer : Solve the following equations (where `[*]` denotes greatest integer function and `{*}` represent fractional part function ... 2[x]=3x`, `0 le x le 2`

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

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

Which of the following strings would match the regular expression: p+[3-5]*[xyz]? I. p443y Il. p6y III. 3xyz IV. p35z V. p353535x Vl. ppp5 (1) I, III and Vl only (2) IV, V and VI only (3) II, IV and V only (4) I, IV and V only

Description : Which of the following strings would match the regular expression: p+[3-5]*[xyz]? I. p443y Il. p6y III. 3xyz IV. p35z V. p353535x Vl. ppp5 (1) I, III and Vl only (2) IV, V and VI only (3) II, IV and V only (4) I, IV and V only

Last Answer : Answer: 4

State true of false. i) Public can only be assigned to class ii) Protected protects a statement iii) Protected method is never accessible outside the package iv) Friendly variable may be accessible outside class A) i-true, ii-true, iii-false, iv-true B) i-true, ii-false, iii-true, iv-false C) i-false, ii-true, iii-false, iv-false D) i-true, ii-false, iii-false, iv-true

Description : State true of false. i) Public can only be assigned to class ii) Protected protects a statement iii) Protected method is never accessible outside the package iv) Friendly variable may be accessible outside class A) i- ... -false, ii-true, iii-false, iv-false D) i-true, ii-false, iii-false, iv-true

Last Answer : C) i-false, ii-true, iii-false, iv-false

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

The number of function points of a proposed system is calculated as 500. Suppose that the system is planned to be developed in Java and the LOC/FP ratio of Java is 50. Estimate the effort (E) required to complete the project using the effort formula of basic COCOMO given below: E = a(KLOC)b Assume that the values of a and b are 2.5 and 1.0 respectively. (A) 25 person months (B) 75 person months (C) 62.5 person months (D) 72.5 person months

Description : The number of function points of a proposed system is calculated as 500. Suppose that the system is planned to be developed in Java and the LOC/FP ratio of Java is 50. Estimate the effort (E) required to ... ) 25 person months (B) 75 person months (C) 62.5 person months (D) 72.5 person months

Last Answer : (C) 62.5 person months 

What steps shall be required to rotate an object about the point P1 (as shown in fig.1) and its placement such that what was at P1 is now reduced and is at P2 (as shown in fig.2). Image I. Translate P1 to origin II. Scale as required III. Rotate IV. Translate to the final position P2. (A) I,II and III (B) II,III and IV (C) I,III and IV (D) All of the above

Description : What steps shall be required to rotate an object about the point P1 (as shown in fig.1) and its placement such that what was at P1 is now reduced and is at P2 (as shown in fig.2). I. Translate P1 to origin II. ... (A) I,II and III (B) II,III and IV (C) I,III and IV (D) All of the above

Last Answer : Answer: Marks given to all

Suppose there are n stations in a slotted LAN. Each station attempts to transmit with a probability P in each time slot. The probability that only one station transmits in a given slot is .................. (1) nP(1-P)n-1 (2) nP (3) P(1-P)n-1 (4) nP(1-P)n-1

Description : Suppose there are n stations in a slotted LAN. Each station attempts to transmit with a probability P in each time slot. The probability that only one station transmits in a given slot is .................. (1) nP(1-P)n-1 (2) nP (3) P(1-P)n-1 (4) nP(1-P)n-1

Last Answer :  nP(1-P)n-1

Slash and Burn Agriculture' is known by specific name in different states of India. Match the shaded states marked in the given map with codes given in the table (Different names of Slash and Burn Agriculture) and select the correct answer using the code given below. B D A C Table (Di ffer ent Names of Slash and Bur n Agr i cult ur e) I. Bringa II. Waltre III. Dahiya IV. Kuruwa (1) A-III, B-IV, C-II, D-I (2) A-III, B-II, C-IV, D-I (3) A-I, B-IV, C-II, D-III (4) A-I, B-II, C-IV, D-III

Description : Slash and Burn Agriculture' is known by specific name in different states of India. Match the shaded states marked in the given map with codes given in the table (Different names of Slash and Burn Agriculture) and select the correct answer ... ) A-I, B-IV, C-II, D-III (4) A-I, B-II, C-IV, D-III

Last Answer : (4) A-I, B-II, C-IV, D-III

What is an encryption system that uses two keys: a public key that everyone can have and a private key for only the recipient? a. Encryption b. Public key encryption c. Intrusion‐detection software d. Security‐auditing software

Description : What is an encryption system that uses two keys: a public key that everyone can have and a private key for only the recipient? a. Encryption b. Public key encryption c. Intrusion‐detection software d. Security‐auditing software

Last Answer : b. Public key encryption

Public key encryption uses multiple keys. One key is used to encrypt data, while another is used to decrypt data. The key used to encrypt data is called the _____ key, while the key used to decrypt data is called the _____ key. a. encryption, decryption b. private, public c. encryption, public d. public, private

Description : Public key encryption uses multiple keys. One key is used to encrypt data, while another is used to decrypt data. The key used to encrypt data is called the _____ key, while the key used to ... the _____ key. a. encryption, decryption b. private, public c. encryption, public d. public, private

Last Answer : d. public, private

In cheque payment protocol, the purchase order form is signed by purchaser using a. his public key b. his private key c. his private key using his signature hardware d. various public keys

Description : In cheque payment protocol, the purchase order form is signed by purchaser using a. his public key b. his private key c. his private key using his signature hardware d. various public keys

Last Answer : c. his private key using his signature hardware  

The responsibility of a certification authority for digital signature is to authenticate the a. hash function used b. private keys of subscribers c. public keys of subscribers d. key used in DES

Description : The responsibility of a certification authority for digital signature is to authenticate the a. hash function used b. private keys of subscribers c. public keys of subscribers d. key used in DES 

Last Answer : c. public keys of subscribers  

Public key system is useful because a. it uses two keys. b. there is no key distribution problem as public key can be kept in a commonly accessible database. c. private key can be kept secret. d. it is a symmetric key system.

Description : Public key system is useful because a. it uses two keys. b. there is no key distribution problem as public key can be kept in a commonly accessible database. c. private key can be kept secret. d. it is a symmetric key system. 

Last Answer : b. there is no key distribution problem as public key can be kept in a commonly accessible database.  

By symmetric key encryption we mean a. one private key is used for both encryption and decryption b. private and public key used are symmetric c. only public keys are used for encryption d. only symmetric key is used for encryption

Description : By symmetric key encryption we mean a. one private key is used for both encryption and decryption b. private and public key used are symmetric c. only public keys are used for encryption d. only symmetric key is used for encryption

Last Answer : D

Solve for `x` (where `[*]` denotes greatest integer function and `{*}` represent fractional part function) `(i) [2x]=1` `(ii) {x}^(2)+[x]=2` `(iii) 6{

Description : Solve for `x` (where `[*]` denotes greatest integer function and `{*}` represent fractional part function) `(i) [2x]=1` `(ii) {x}^(2)+[x]=2` `(iii) 6{

Last Answer : Solve for `x` (where `[*]` denotes greatest integer function and `{*}` represent fractional part function) `(i) [2x]=1 ... 0` `(iv) 6{x}^(2)-5{x}-1=0`

Suppose you are given a binary tree with n nodes, such that each node has exactly either zero or two children. The maximum height of the tree will be (A) n/2 - 1 (B) n/2 + 1 (C) (n-1)/2 (D) (n+1)/2

Description : Suppose you are given a binary tree with n nodes, such that each node has exactly either zero or two children. The maximum height of the tree will be (A) n/2 - 1 (B) n/2 + 1 (C) (n-1)/2 (D) (n+1)/2

Last Answer : (C) (n-1)/2

The hash function used in double hashing is of the form: (A) h(k, i)=(h1(k)+h2(k)+i)mod m (B) h(k, i)=(h1(k)+h2(k)-i)mod m (C) h(k, i)=(h1(k)+ih2(k))mod m (D) h(k, i)=(h1(k)-ih2(k))mod m

Description : The hash function used in double hashing is of the form: (A) h(k, i)=(h1(k)+h2(k)+i)mod m (B) h(k, i)=(h1(k)+h2(k)-i)mod m (C) h(k, i)=(h1(k)+ih2(k))mod m (D) h(k, i)=(h1(k)-ih2(k))mod m

Last Answer : Answer: C

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

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

Last Answer : (A) 5 

River Alaknanda forms confluences (Prayags) in Uttrakhand. Match the codes given in Figure with Table (Prayags) and select the correct answer using the code given below. Figure Table (Pr ayags) D A L A K N A N D A C B A I. Karn Prayag II. Rudra Prayag III. Nand Prayag IV. Vishnu Prayag

Description : River Alaknanda forms confluences (Prayags) in Uttrakhand. Match the codes given in Figure with Table (Prayags) and select the correct answer using the code given below. Figure Table (Pr ayags) D A L A K N A N D A C B A I. Karn Prayag II. Rudra Prayag III. Nand Prayag IV. Vishnu Prayag

Last Answer : (1) A-II, B-I, C-III, D-IV

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. 

n the following human pedigree, the filled symbols represent the affected individuals. Identify the type of given pedigree. (i) (ii) (iii) (iv) (a) Autosomal recessive (b) X-linked dominant (c) Autosomal dominant (d) X-linked recessive

Description : n the following human pedigree, the filled symbols represent the affected individuals. Identify the type of given pedigree. (i) (ii) (iii) (iv) (a) Autosomal recessive (b) X-linked dominant (c) Autosomal dominant (d) X-linked recessive

Last Answer : (a) Autosomal recessive