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

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
by

1 Answer

Answer :

(A) BUTAEEZ
by

Related questions

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.

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

Encrypt the plain text Message “EXTRANET” using Transposition cipher technique with the following key: Image Using ‘Z’ as bogus character. (A) TAXERTZENZ (B) EXTRANETZZ (C) EZXZTRZANZET (D) EXTZRANZETZ

Description : Encrypt the plain text Message “EXTRANET” using Transposition cipher technique with the following key: Using ‘Z’ as bogus character. (A) TAXERTZENZ (B) EXTRANETZZ (C) EZXZTRZANZET (D) EXTZRANZETZ

Last Answer : (A) TAXERTZENZ 

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. 

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

In link state routing algorithm after construction of link state packets, new routes are computed using: (1) DES algorithm (2) Dijkstra's algorithm (3) RSA algorithm (4) Packets

Description : In link state routing algorithm after construction of link state packets, new routes are computed using: (1) DES algorithm (2) Dijkstra's algorithm (3) RSA algorithm (4) Packets 

Last Answer : Answer: 2

What is the process of changing plain-text into cipher-text called?

Description : What is the process of changing plain-text into cipher-text called?

Last Answer : What is the answer ?

At the lower layer of SSL, a protocol for transferring data using a variety of predefined cipher and authentication combinations called the ………………. A) SSL handshake protocol B) SSL authentication protocol C) SSL record protocol D) SSL cipher protocol

Description : At the lower layer of SSL, a protocol for transferring data using a variety of predefined cipher and authentication combinations called the ………………. A) SSL handshake protocol B) SSL authentication protocol C) SSL record protocol D) SSL cipher protocol

Last Answer : C) SSL record protocol

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.

A message “COMPUTERNETWORK” encrypted(ignore quotes)using columnar transposition cipher with a key “LAYER”. The encrypted message is: (A) CTTOEWMROPNRUEK (B) MROUEKCTTPNROEW (C) OEWPNRCTTUEKMRO (D) UEKPNRMROOEWCTT

Description : A message “COMPUTERNETWORK” encrypted(ignore quotes)using columnar transposition cipher with a key “LAYER”. The encrypted message is: (A) CTTOEWMROPNRUEK (B) MROUEKCTTPNROEW (C) OEWPNRCTTUEKMRO (D) UEKPNRMROOEWCTT

Last Answer : (C) OEWPNRCTTUEKMRO

PQ and RS are two equal and parallel line segments.Any points M not lying on PQ or RS is joined to Q and S and lines through P parallel to SM meet at N.Prove that line segments MN and PQ are equal and parallel to each other. -Maths 9th

Description : PQ and RS are two equal and parallel line segments.Any points M not lying on PQ or RS is joined to Q and S and lines through P parallel to SM meet at N.Prove that line segments MN and PQ are equal and parallel to each other. -Maths 9th

Last Answer : hope its clear

Suppose that the virtual Address space has eight pages and physical memory with four page frames. If LRU page replacement algorithm is used, .............. number of page faults occur with the reference string. 0 2 1 3 5 4 6 3 7 4 7 3 3 5 5 3 1 1 1 7 2 3 4 1 (A) 11 (B) 12 (C) 10 (D) 9

Description : Suppose that the virtual Address space has eight pages and physical memory with four page frames. If LRU page replacement algorithm is used, .............. number of page faults occur with the reference string. 0 2 1 3 5 4 6 3 7 4 7 3 3 5 5 3 1 1 1 7 2 3 4 1 (A) 11 (B) 12 (C) 10 (D) 9

Last Answer : (A) 11

Message can be sent more securely using DES by a. encrypting plain text by a different randomly selected key for each transmission b. encrypting plain text by a different random key for each message transmission and sending the key to the receiver using a public key system c. using an algorithm to implement DES instead of using hardware d. designing DES with high security and not publicizing algorithm used by it

Description : Message can be sent more securely using DES by a. encrypting plain text by a different randomly selected key for each transmission b. encrypting plain text by a different random key for each ... instead of using hardware d. designing DES with high security and not publicizing algorithm used by it  

Last Answer : b. encrypting plain text by a different random key for each message transmission and sending the key to the receiver using a public key system

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

On the upper layer of SSL, a protocol for initial authentication and transfer of encryption keys, called the ………………… A) SSL handshake protocol B) SSL authentication protocol C) SSL record protocol D) SSL cipher protocol

Description : On the upper layer of SSL, a protocol for initial authentication and transfer of encryption keys, called the ………………… A) SSL handshake protocol B) SSL authentication protocol C) SSL record protocol D) SSL cipher protocol

Last Answer : A) SSL handshake protocol

Given two sorted list of size 'm' and 'n' respectively. The number of comparison needed in the worst case by the merge sort algorithm will be (A) m x n (B) max (m, n) (C) min (m, n) (D) m + n – 1

Description : Given two sorted list of size 'm' and 'n' respectively. The number of comparison needed in the worst case by the merge sort algorithm will be (A) m x n (B) max (m, n) (C) min (m, n) (D) m + n – 1

Last Answer :  (D) m + n – 1

Encrypted data is referred as cipher text. -Technology

Description : Encrypted data is referred as cipher text. -Technology

Last Answer : TrueEncrypted data is presented in coded form. So, it is known as cipher text.

Triple DES uses a. 168 bit keys on 64-bit blocks of plain text b. Working on 64-bit blocks of plain text and 56 bit keys by applying DES algorithm for three rounds. c. Works with 144 bit blocks of plain text and applies DES algorithm once. d. Uses 128 bit blocks of plain text and 112 bit keys and apply DES algorithm thrice.

Description : Triple DES uses a. 168 bit keys on 64-bit blocks of plain text b. Working on 64-bit blocks of plain text and 56 bit keys by applying DES algorithm for three rounds. c. Works with 144 bit ... algorithm once. d. Uses 128 bit blocks of plain text and 112 bit keys and apply DES algorithm thrice. 

Last Answer : b. Working on 64-bit blocks of plain text and 56 bit keys by applying DES algorithm for three rounds. 

Explain about RSA algorithm.

Description : Explain about RSA algorithm.

Last Answer : ∙ Public key Encryption technique. ∙ Encryption algorithm ∙ Decryption algorithm ∙ Security in RSA

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

When two concurrent and coplaner forces P and Q act at an angle of 180?, their resultant will be a a.moment equal to PQ b.couple c.(P-Q) d.107 dynes e.zero

Description : When two concurrent and coplaner forces P and Q act at an angle of 180?, their resultant will be a a.moment equal to PQ b.couple c.(P-Q) d.107 dynes e.zero

Last Answer : c. (P-Q)

ABCD is a quadrilateral in which P, Q, R and S are mid-points of the sides AB, BC, CD and DA (see Fig 8.29). AC is a diagonal. Show that: (i) SR || AC and SR = 1/2 AC (ii) PQ = SR (iii) PQRS is a parallelogram. -Maths 9th

Description : ABCD is a quadrilateral in which P, Q, R and S are mid-points of the sides AB, BC, CD and DA (see Fig 8.29). AC is a diagonal. Show that: (i) SR || AC and SR = 1/2 AC (ii) PQ = SR (iii) PQRS is a parallelogram. -Maths 9th

Last Answer : . Solution: (i) In ΔDAC, R is the mid point of DC and S is the mid point of DA. Thus by mid point theorem, SR || AC and SR = ½ AC (ii) In ΔBAC, P is the mid point of AB and Q is the mid point of BC. ... ----- from question (ii) ⇒ SR || PQ - from (i) and (ii) also, PQ = SR , PQRS is a parallelogram.

Points P and Q have been taken on opposite sides AB and CD, respectively of a parallelogram ABCD such that AP = CQ. Show that AC and PQ bisect each other. -Maths 9th

Description : Points P and Q have been taken on opposite sides AB and CD, respectively of a parallelogram ABCD such that AP = CQ. Show that AC and PQ bisect each other. -Maths 9th

Last Answer : According to question parallelogram ABCD such that AP = CQ.

In trapezium ABCD, AB || DC and L is the mid-point of BC. Through L, a line PQ || AD has been drawn which meets AB in P and DC produced in Q. -Maths 9th

Description : In trapezium ABCD, AB || DC and L is the mid-point of BC. Through L, a line PQ || AD has been drawn which meets AB in P and DC produced in Q. -Maths 9th

Last Answer : According to question prove that ar (ABCD) = ar (APQD).

If bisectors of opposite angles of a cyclic quadrilateral ABCD intersect the circle, circumscribing it at the points P and Q, prove that PQ is a diameter of the circle. -Maths 9th

Description : If bisectors of opposite angles of a cyclic quadrilateral ABCD intersect the circle, circumscribing it at the points P and Q, prove that PQ is a diameter of the circle. -Maths 9th

Last Answer : Given, ABCD is a cyclic quadrilateral. DP and QB are the bisectors of ∠D and ∠B, respectively. To prove PQ is the diameter of a circle. Construction Join QD and QC.

Points P and Q have been taken on opposite sides AB and CD, respectively of a parallelogram ABCD such that AP = CQ. Show that AC and PQ bisect each other. -Maths 9th

Description : Points P and Q have been taken on opposite sides AB and CD, respectively of a parallelogram ABCD such that AP = CQ. Show that AC and PQ bisect each other. -Maths 9th

Last Answer : According to question parallelogram ABCD such that AP = CQ.

In trapezium ABCD, AB || DC and L is the mid-point of BC. Through L, a line PQ || AD has been drawn which meets AB in P and DC produced in Q. -Maths 9th

Description : In trapezium ABCD, AB || DC and L is the mid-point of BC. Through L, a line PQ || AD has been drawn which meets AB in P and DC produced in Q. -Maths 9th

Last Answer : According to question prove that ar (ABCD) = ar (APQD).

If bisectors of opposite angles of a cyclic quadrilateral ABCD intersect the circle, circumscribing it at the points P and Q, prove that PQ is a diameter of the circle. -Maths 9th

Description : If bisectors of opposite angles of a cyclic quadrilateral ABCD intersect the circle, circumscribing it at the points P and Q, prove that PQ is a diameter of the circle. -Maths 9th

Last Answer : Given, ABCD is a cyclic quadrilateral. DP and QB are the bisectors of ∠D and ∠B, respectively. To prove PQ is the diameter of a circle. Construction Join QD and QC.

If P, Q and R are three points on a line and Q is between P and R,then prove that PR - QR= PQ. -Maths 9th

Description : If P, Q and R are three points on a line and Q is between P and R,then prove that PR - QR= PQ. -Maths 9th

Last Answer : Solution :-

Two circles with centre O and O' intersect at two points A and B. A line PQ is drawn parallel to OO' through B intersecting the circles at P and Q. Prove that PQ = 2 OO'. -Maths 9th

Description : Two circles with centre O and O' intersect at two points A and B. A line PQ is drawn parallel to OO' through B intersecting the circles at P and Q. Prove that PQ = 2 OO'. -Maths 9th

Last Answer : Solution :- Construction: Draw two circles having centres O and O' intersecting at points A and B. Draw a parallel line PQ to OO' ... iii) Again, OO' = MN [As OO' NM is a rectangle] ...(iv) ⇒ 2OO' = PQ Hence proved.

In angle PQR angle P = 80 .If PQ =PR find angle Q and angle R -Maths 9th

Description : In angle PQR angle P = 80 .If PQ =PR find angle Q and angle R -Maths 9th

Last Answer : a triangle includes 3 angles summing up as 180° so 180 =

How do i do this question The gradient of the line joining (-13) to (pq) is -2. The gradient of the line joining (pq) to (52) is -1. Calculate the values of p and q?

Description : How do i do this question The gradient of the line joining (-13) to (pq) is -2. The gradient of the line joining (pq) to (52) is -1. Calculate the values of p and q?

Last Answer : If you mean point of (-1, 3) with a gradient of -2 and point (5,2) with a gradient of -1 then as straight line equations they workout as y = -2x+1 and y = -x+4 respectively.As to the values of p and q not enough information has beengiven.

If the mean of P, Q,R is A and PQ + QR + RP =0, then the mean of p^2,Q^2,R^2 is. A) 2A^2 B) 4A^2 C) A^2 D) 3A^2

Description : If the mean of P, Q,R is A and PQ + QR + RP =0, then the mean of p^2,Q^2,R^2 is. A) 2A^2 B) 4A^2 C) A^2 D) 3A^2

Last Answer : D) We have (P + Q + R)/3 = A P+Q+R = 3A (P+Q+R)^2 = 9A^2 P^2+Q^2+R^2 + 2 (PQ + QR + PR) = 9A^2 P^2+Q^2+R^2 = 9A^2 Required mean = (P^2+Q^2+R^2)/3 = 9A^2/3= 3A^2

If h* represents an estimate of the cost of getting from the current node N to the goal node and h represents actual cost of getting from current node to the goal node, then A* algorithm gives an optimal solution if (A) h* us equal to h (B) h* overestimates h (C) h* underestimates h (D) none of these

Description : If h* represents an estimate of the cost of getting from the current node N to the goal node and h represents actual cost of getting from current node to the goal node, then A* algorithm gives an optimal solution ... h* us equal to h (B) h* overestimates h (C) h* underestimates h (D) none of these

Last Answer : (C) h* underestimates h

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

Let A and B be two fuzzy integers defined as: A={(1,0.3), (2,0.6), (3,1), (4,0.7), (5,0.2)} B={(10,0.5), (11,1), (12,0.5)} Using fuzzy arithmetic operation given by Image (A) {(11,0.8), (13,1), (15,1)} (B) {(11,0.3), (12,0.5), (13,1), (14,1), (15,1), (16,0.5), (17,0.2)} (C) {(11,0.3), (12,0.5), (13,0.6), (14,1), (15,1), (16,0.5), (17,0.2)} (D) {(11,0.3), (12,0.5), (13,0.6), (14,1), (15,0.7), (16,0.5), (17,0.2)}

Description : Let A and B be two fuzzy integers defined as: A={(1,0.3), (2,0.6), (3,1), (4,0.7), (5,0.2)} B={(10,0.5), (11,1), (12,0.5)} Using fuzzy arithmetic operation given by (A) {(11,0.8), (13,1), (15,1)} ( ... ,0.2)} (D) {(11,0.3), (12,0.5), (13,0.6), (14,1), (15,0.7), (16,0.5), (17,0.2)}

Last Answer : (D) {(11,0.3), (12,0.5), (13,0.6), (14,1), (15,0.7), (16,0.5), (17,0.2)}

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

What is cipher text ?

Description : What is cipher text ?

Last Answer : The next encrypted message is cipher text , which is not readable by humans.

In Propositional Logic, given P and P→Q, we can infer ........... (A) ~Q (B) Q (C) P∧Q (D) ~P∧Q

Description : In Propositional Logic, given P and P→Q, we can infer ........... (A) ~Q (B) Q (C) P∧Q (D) ~P∧Q 

Last Answer : (B) Q 

At the lower layer of SSL, a protocol for transferring data using a variety of predefined cipher and authentication combinations called the ………………. A) SSL handshake protocol B) SSL authentication protocol C) SSL record protocol D) SSL cipher protocol

Description : At the lower layer of SSL, a protocol for transferring data using a variety of predefined cipher and authentication combinations called the ………………. A) SSL handshake protocol B) SSL authentication protocol C) SSL record protocol D) SSL cipher protocol

Last Answer : C) SSL record protocol

Are Suzanne and Julianne malveaux sisters?

Description : Are Suzanne and Julianne malveaux sisters?

Last Answer : Need answer

Consider three CPU intensive processes P1, P2, P3 which require 20, 10 and 30 units of time, arrive at times 1, 3 and 7 respectively. Suppose operating system is implementing Shortest Remaining Time first (preemptive scheduling) algorithm, then .............. context switches are required (suppose context switch at the beginning of Ready queue and at the end of Ready queue are not counted). (A) 3 (B) 2 (C) 4 (D) 5

Description : Consider three CPU intensive processes P1, P2, P3 which require 20, 10 and 30 units of time, arrive at times 1, 3 and 7 respectively. Suppose operating system is implementing Shortest Remaining Time first (preemptive scheduling) ... end of Ready queue are not counted). (A) 3 (B) 2 (C) 4 (D) 5

Last Answer : (A) 3

The travelling salesman problem can be solved in: (A) Polynomial time using dynamic programming algorithm (B) Polynomial time using branch-and-bound algorithm (C) Exponential time using dynamic programming algorithm or branch-andbound algorithm. (D) Polynomial time using backtracking algorithm.

Description : The travelling salesman problem can be solved in: (A) Polynomial time using dynamic programming algorithm (B) Polynomial time using branch-and-bound algorithm (C) Exponential time using dynamic programming algorithm or branch-andbound algorithm. (D) Polynomial time using backtracking algorithm.

Last Answer : (C) Exponential time using dynamic programming algorithm or branch-andbound algorithm.

An all-pairs shortest-paths problem is efficiently solved using: (A) Dijkstra' algorithm (B) Bellman-Ford algorithm (C) Kruskal Algorithm (D) Floyd-Warshall algorithm

Description : An all-pairs shortest-paths problem is efficiently solved using: (A) Dijkstra' algorithm (B) Bellman-Ford algorithm (C) Kruskal Algorithm (D) Floyd-Warshall algorithm

Last Answer : (D) Floyd-Warshall algorithm

Consider a disk queue with I/O requests on the following cylinders in their arriving order: 6,10,12,54,97,73,128,15,44,110,34,45 The disk head is assumed to be at cylinder 23 and moving in the direction of decreasing number of cylinders. Total number of cylinders in the disk is 150. The disk head movement using SCAN-scheduling algorithm is: (1) 172 (2) 173 (3) 227 (4) 228

Description : Consider a disk queue with I/O requests on the following cylinders in their arriving order: 6,10,12,54,97,73,128,15,44,110,34,45 The disk head is assumed to be at cylinder 23 and moving in the direction ... . The disk head movement using SCAN-scheduling algorithm is: (1) 172 (2) 173 (3) 227 (4) 228

Last Answer : (2) 173

If the given input array is sorted or nearly sorted, which of the following algorithm gives the best performance? a) Insertion sort b) Selection sort c) Quick sort d) Merge sort

Description : If the given input array is sorted or nearly sorted, which of the following algorithm gives the best performance? a) Insertion sort b) Selection sort c) Quick sort d) Merge sort

Last Answer : a) Insertion sort

Consider the following statements: (a) Depth - first search is used to traverse a rooted tree. (b) Pre - order, Post-order and Inorder are used to list the vertices of an ordered rooted tree. (c) Huffman's algorithm is used to find an optimal binary tree with given weights. (d) Topological sorting provides a labelling such that the parents have larger labels than their children. Which of the above statements are true ? (A) (a) and (b) (B) (c) and (d) (C) (a) , (b) and (c) (D) (a), (b) , (c) and (d)

Description : Consider the following statements: (a) Depth - first search is used to traverse a rooted tree. (b) Pre - order, Post-order and Inorder are used to list the vertices of an ordered rooted tree. (c) Huffman's algorithm is used to find an optimal ... (d) (C) (a) , (b) and (c) (D) (a), (b) , (c) and (d)

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

In the case of parallelization, Amdahl's law states that if P is the proportion of a program that can be made parallel and (1-P) is the proportion that cannot be parallelized, then the maximum speed-up that can be achieved by using N processors is: (A) 1/((1-P)+N.P) (B) 1/((N-1)P+P) (C) 1/((1-P)+P/N) (D) 1/(P+(1-P)/N)

Description : In the case of parallelization, Amdahl's law states that if P is the proportion of a program that can be made parallel and (1-P) is the proportion that cannot be parallelized, then the maximum speed-up that can be achieved by using N processors is ... ((N-1)P+P) (C) 1/((1-P)+P/N) (D) 1/(P+(1-P)/N)

Last Answer : (C) 1/((1-P)+P/N)

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