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

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
by

1 Answer

Answer :

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

Related questions

Which raster locations would be chosen by Bresenham’s algorithm when scan converting a line from (1, 1) to (8, 5) ?

Description : Which raster locations would be chosen by Bresenham’s algorithm when scan converting a line from (1, 1) to (8, 5) ?

Last Answer : Answer: C

The end points of a given line are (0, 0) and (6, 18). Compute each value of y as x steps from 0 to 3, by using equation of straight line : (A) For x=0, y=0; x=1, y=3; x=2, y=6; x=3, y=9 (B) For x=0, y=1; x=1, y=3; x=2, y=4; x=3, y=9 (C) For x=0, y=2; x=1, y=3; x=2, y=6; x=3, y=9 (D) For x=0, y=0; x=1, y=3; x=2, y=4; x=3, y=6

Description : The end points of a given line are (0, 0) and (6, 18). Compute each value of y as x steps from 0 to 3, by using equation of straight line : (A) For x=0, y=0; x=1, y=3; x=2, y=6; x=3, y=9 (B) For x=0, y=1; x=1, y=3; x=2, ... x=1, y=3; x=2, y=6; x=3, y=9 (D) For x=0, y=0; x=1, y=3; x=2, y=4; x=3, y=6

Last Answer : Answer: A

Rephrase the Bresenham’s algorithm to plot 1/8th of the circle and write the algorithm required to plot the same.

Description : Rephrase the Bresenham’s algorithm to plot 1/8th of the circle and write the algorithm required to plot the same.

Last Answer : The key feature of circle that it is highly symmetric. So, for whole 360 degree of circle we will divide it in 8-parts each octant of 45 degree. In order to that we will use Bresenham's Circle Algorithm for calculation of the ... Call Putpixel (Y + h, -X - k). Call Putpixel (-Y + h,-X + k).

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

Consider a line AB with A = (0,0) and B = (8, 4). Apply a simple DDA algorithm and compute the first four plots on this line. (1) [(0, 0), (1, 1), (2, 1), (3, 2)] (2) [(0, 0), (1, 1.5), (2, 2), (3, 3)] (3) [(0, 0), (1, 1), (2, 2.5), (3, 3)] (4) [(0, 0), (1, 2), (2, 2), (3, 2)]

Description : Consider a line AB with A = (0,0) and B = (8, 4). Apply a simple DDA algorithm and compute the first four plots on this line. (1) [(0, 0), (1, 1), (2, 1), (3, 2)] (2) [(0, 0), (1, 1.5), (2, 2), (3, 3)] (3) [(0, 0), (1, 1), (2, 2.5), (3, 3)] (4) [(0, 0), (1, 2), (2, 2), (3, 2)]

Last Answer : [(0, 0), (1, 1), (2, 1), (3, 2)] 

If r is the radius of a circle and d is its diameter is an equivalent formula for the circumference C 2r?

Description : If r is the radius of a circle and d is its diameter is an equivalent formula for the circumference C 2r?

Last Answer : Circumference of a circle: 2*pi*radius or diameter*pi

If r is the radius of a circle and d is its diameter is an equivalent formula for the circumference C 2r?

Description : If r is the radius of a circle and d is its diameter is an equivalent formula for the circumference C 2r?

Last Answer : Circumference of a circle: 2*pi*radius or diameter*pi

Compute the value of adding the following two fuzzy integers: A = {(0.3,1), (0.6,2), (1,3), (0.7,4), (0.2,5)} B = {(0.5,11), (1,12), (0.5,13)} Where fuzzy addition is defined as μA+B(z) = maxx+y=z (min(μA(x), μB(x))) Then, f(A+B) is equal to (A) {(0.5,12), (0.6,13), (1,14), (0.7,15), (0.7,16), (1,17), (1,18)} (B) {(0.5,12), (0.6,13), (1,14), (1,15), (1,16), (1,17), (1,18)} (C) {(0.3,12), (0.5,13), (0.5,14), (1,15), (0.7,16), (0.5,17), (0.2,18)} (D) {(0.3,12), (0.5,13), (0.6,14), (1,15), (0.7,16), (0.5,17), (0.2,18)}

Description : Compute the value of adding the following two fuzzy integers: A = {(0.3,1), (0.6,2), (1,3), (0.7,4), (0.2,5)} B = {(0.5,11), (1,12), (0.5,13)} Where fuzzy addition is defined as μA+B(z) = maxx+y=z (min(μA(x), μB( ... ,18)} (D) {(0.3,12), (0.5,13), (0.6,14), (1,15), (0.7,16), (0.5,17), (0.2,18)}

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

In a binary Hamming code the number of check digits is r then number of message digits is equal to: (A) 2r-1 (B) 2r-r-1 (C) 2r-r+1 (D) 2r+r-1

Description : In a binary Hamming code the number of check digits is r then number of message digits is equal to: (A) 2r-1 (B) 2r-r-1 (C) 2r-r+1 (D) 2r+r-1

Last Answer : (B) 2r-r-1

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

What is The area of a circle depending on the radius. Use the equation A(r) r2 to compute A(7). Round your answer to the nearest hundredth.?

Description : What is The area of a circle depending on the radius. Use the equation A(r) r2 to compute A(7). Round your answer to the nearest hundredth.?

Last Answer : The area of a circle is: pi times radius squared

What is The area of a circle depending on the radius. Use the equation A(r) r2 to compute A(7). Round your answer to the nearest hundredth.?

Description : What is The area of a circle depending on the radius. Use the equation A(r) r2 to compute A(7). Round your answer to the nearest hundredth.?

Last Answer : The area of a circle is: pi times radius squared

Which of the following statements is not true about disk-arm scheduling algorithms ? (A) SSTF (shortest seek time first) algorithm increases performance of FCFS. (B) The number of requests for disk service are not influenced by file allocation method. (C) Caching the directories and index blocks in main memory can also help in reducing disk arm movements. (D) SCAN and C-SCAN algorithms are less likely to have a starvation problem.

Description : Which of the following statements is not true about disk-arm scheduling algorithms ? (A) SSTF (shortest seek time first) algorithm increases performance of FCFS. (B) The number of requests for disk ... arm movements. (D) SCAN and C-SCAN algorithms are less likely to have a starvation problem.

Last Answer : (B) The number of requests for disk service are not influenced by file allocation method.

The radius of Gyration (k) for Rim Type Flywheel having radius ‘r’ is given by 1. k = 2r 2. k = r/2 3. k = r 4. k = r/3

Description : The radius of Gyration (k) for Rim Type Flywheel having radius ‘r’ is given by 1. k = 2r 2. k = r/2 3. k = r 4. k = r/3

Last Answer : 3. k = r

A proton moves in a uniform magnetic field in a circular path of radius R. If the energy of proton is doubled then the new radius becomes a) R √2 b) 2R c) R 2 d) √2 R

Description : A proton moves in a uniform magnetic field in a circular path of radius R. If the energy of proton is doubled then the new radius becomes a) R √2 b) 2R c) R 2 d) √2 R

Last Answer : d) √2 R

Consider a full-adder with the following input values: (a) x=1, y=0 and Ci(carry input) = 0 (b) x=0, y=1 and Ci = 1 Compute the values of S(sum) and C0 (carry output) for the above input values. (A) S=1 , C0= 0 and S=0 , C0= 1 (B) S=0 , C0= 0 and S=1 , C0= 1 (C) S=1 , C0= 1 and S=0 , C0= 0 (D) S=0 , C0= 1 and S=1 , C0= 0

Description : Consider a full-adder with the following input values: (a) x=1, y=0 and Ci(carry input) = 0 (b) x=0, y=1 and Ci = 1 Compute the values of S(sum) and C0 (carry output) for the above input values. (A) S=1 , C0= 0 and ... C0= 1 (C) S=1 , C0= 1 and S=0 , C0= 0 (D) S=0 , C0= 1 and S=1 , C0= 0

Last Answer : (A) S=1 , C0= 0 and S=0 , C0= 1

. In case of turbulent flow of fluid through a circular pipe, the (A) Mean flow velocity is about 0.5 times the maximum velocity (B) Velocity profile becomes flatter and flatter with increasing Reynolds number (C) Point of maximum instability exists at a distance of 2r/3 from the pipe wall (r = pipe radius) (D) Skin friction drag, shear stresses, random orientation of fluid particles and slope of velocity profile at the wall are more

Description : . In case of turbulent flow of fluid through a circular pipe, the (A) Mean flow velocity is about 0.5 times the maximum velocity (B) Velocity profile becomes flatter and flatter with ... , shear stresses, random orientation of fluid particles and slope of velocity profile at the wall are more

Last Answer : (D) Skin friction drag, shear stresses, random orientation of fluid particles and slope of velocity profile at the wall are more

Centroid of the are of circle shown in adjacement figure is a.r sin (?/2)/2 ?, 0 b.r sin (?)/?, 0 c.2 r sin (?/2)/?, 0 d.107 dynes e.2r sin (?)/?, 0

Description : Centroid of the are of circle shown in adjacement figure is a.r sin (?/2)/2 ?, 0 b.r sin (?)/?, 0 c.2 r sin (?/2)/?, 0 d.107 dynes e.2r sin (?)/?, 0

Last Answer : c. 2 r sin (?/2)/?, 0

For every context free grammar (G) there exists an algorithm that passes any w ∈ L(G) in number of steps proportional to (A) ln|w| (B) |w| (C) |w|2 (D) |w|3

Description : For every context free grammar (G) there exists an algorithm that passes any w ∈ L(G) in number of steps proportional to (A) ln|w| (B) |w| (C) |w|2 (D) |w|3

Last Answer : (D) |w|3

Weight of a person at a height of 2R from the centre of the earth, where R is the radius of the earth- (1) remains same (2) becomes half (3) becomes twice (4) becomes one-fourth

Description : Weight of a person at a height of 2R from the centre of the earth, where R is the radius of the earth- (1) remains same (2) becomes half (3) becomes twice (4) becomes one-fourth

Last Answer : (4) becomes one-fourth Explanation: The gravitational force is proportional to 1/R2, where R is the distance from the centre of the Earth. So at a height of 2R from the centre of the earth, the corresponding weight would be one-fourth of the original weight.

Velocity of escape is equal to A. r × √(2g); where r: radius of Earth or any other planet for that matter, g: gravitational field strength B. g × √(2r); where r: radius of Earth or any other planet for that matter, g: gravitational field strength C. √(2g) ⁄ r; where r: radius of Earth or any other planet for that matter, g: gravitational field strength D. √(2gr); where r: radius of Earth or any other planet for that matter, g: gravitational field strength

Description : Velocity of escape is equal to A. r √(2g); where r: radius of Earth or any other planet for that matter, g: gravitational field strength B. g √(2r); where r: radius of ... (2gr); where r: radius of Earth or any other planet for that matter, g: gravitational field strength

Last Answer : √(2gr); where r: radius of Earth or any other planet for that matter, g: gravitational field strength

The centre of percussion of a solid cylinder of radius r resting on a horizontal plane will be (A) r/2 (B) 2r/3 (C) r/A (D) 3r/2

Description : The centre of percussion of a solid cylinder of radius r resting on a horizontal plane will be  (A) r/2  (B) 2r/3  (C) r/A (D) 3r/2 

Last Answer : (D) 3r/2 

If L is the length of a moving vehicle and R is the radius of curve, the extra mechanical width b to be provided on horizontal curves, (A) L/R (B) L/2R (C) L²/2R (D) L/3R

Description : If L is the length of a moving vehicle and R is the radius of curve, the extra mechanical width b to be provided on horizontal curves, (A) L/R (B) L/2R (C) L²/2R (D) L/3R

Last Answer : Answer: Option C

What is the center and the radius of the circle x2 plus y2 -4x -6y -3 equals 0?

Description : What is the center and the radius of the circle x2 plus y2 -4x -6y -3 equals 0?

Last Answer : Equation of circle: x^2 +y^2 -4x -6y -3 = 0Completing the squares: (x-2)^2 +(y-3)^2 = 16 square unitsTherefore center of circle is at (2, 3) and its radius is 4units

Consider the reference string 0 1 2 3 0 1 4 0 1 2 3 4 If FIFO page replacement algorithm is used, then the number of page faults with three page frames and four page frames are .......... and ........... respectively. (A) 10, 9 (B) 9, 9 (C) 10, 10 (D) 9, 10

Description : Consider the reference string 0 1 2 3 0 1 4 0 1 2 3 4 If FIFO page replacement algorithm is used, then the number of page faults with three page frames and four page frames are .......... and ........... respectively. (A) 10, 9 (B) 9, 9 (C) 10, 10 (D) 9, 10

Last Answer : (D) 9, 10

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

Consider a disk queue with request for input/output to block on cylinders 98, 183, 37, 122, 14, 124, 65, 67 in that order. Assume that disk head is initially positioned at cylinder 53 and moving towards cylinder number 0. The total number of head movements using Shortest Seek Time First (SSTF) and SCAN algorithms are respectively (A) 236 and 252 cylinders (B) 640 and 236 cylinders (C) 235 and 640 cylinders (D) 235 and 252 cylinders

Description : Consider a disk queue with request for input/output to block on cylinders  98, 183, 37, 122, 14, 124, 65, 67  in that order. Assume that disk head is initially positioned at cylinder 53 and moving ... and 252 cylinders (B) 640 and 236 cylinders (C) 235 and 640 cylinders (D) 235 and 252 cylinders

Last Answer : Answer: 236 and 208 cylinders Explanation: SSTF Initial head position =53 The closest queue to initial head position=65 head moves from 53 to 65=12 head moves from 65 to 67=2 head moves from 67 ... 122=24 head moves from 122 to 124=2 head moves from 124 to 183=59 Total head movement=208 

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

If the radius of a sphere is 2r, then its volume will be -Maths 9th

Description : If the radius of a sphere is 2r, then its volume will be -Maths 9th

Last Answer : As, r=2r Volume of sphere = 4​/3π(2r)^3 =32/3​πr^3

If the radius of a sphere is 2r, then its volume will be -Maths 9th

Description : If the radius of a sphere is 2r, then its volume will be -Maths 9th

Last Answer : (d) Given, radius of a sphere = 2r Volume of a sphere =4/3 π(Radius)3 = 4/3 π(2r)3 = 4/3 π 8r3 = (32 πr3)/3 cu units Hence the volume of a sphere is (32 πr3)/3 cu units.

The radius of sphere is 2r, then find its volume. -Maths 9th

Description : The radius of sphere is 2r, then find its volume. -Maths 9th

Last Answer : Volume of the sphere = 4/3.π.(2r)3 = 32/3πr3

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

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

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

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

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

The given figure shows a circle with centre O in which a diameter AB bisects the chord PQ at the point R. If PR = RQ = 8 cm and RB = 4 cm, then find the radius of the circle. -Maths 9th

Description : The given figure shows a circle with centre O in which a diameter AB bisects the chord PQ at the point R. If PR = RQ = 8 cm and RB = 4 cm, then find the radius of the circle. -Maths 9th

Last Answer : Let r be the radius, then OQ = OB = r and OR = (r - 4) ∴ OQ2 = OR2 + RO2 ⇒ r2 = 64 + (r-4)2 ⇒ r2 = 64 + r2 + 16 - 8r ⇒ 8r = 80 ⇒ r = 10 cm

The given figure shows a circle with centre O in which a diameter AB bisects the chord PQ at the point R. If PR = RQ = 8 cm and RB = 4 cm, then find the radius of the circle. -Maths 9th

Description : The given figure shows a circle with centre O in which a diameter AB bisects the chord PQ at the point R. If PR = RQ = 8 cm and RB = 4 cm, then find the radius of the circle. -Maths 9th

Last Answer : Let r be the radius, then OQ = OB = r and OR = (r - 4) ∴ OQ2 = OR2 + RO2 ⇒ r2 = 64 + (r-4)2 ⇒ r2 = 64 + r2 + 16 - 8r ⇒ 8r = 80 ⇒ r = 10 cm

If S, L and R are the arc length, long chord and radius of the sliding circle then the perpendicular distance of the line of the resultant cohesive force, is given by (A) a = S.R/L (B) a = L.S/R (C) a = L.R/S (D) None of these

Description : If S, L and R are the arc length, long chord and radius of the sliding circle then the perpendicular distance of the line of the resultant cohesive force, is given by (A) a = S.R/L (B) a = L.S/R (C) a = L.R/S (D) None of these

Last Answer : (A) a = S.R/L

A disk drive has 100 cylinders, numbered 0 to 99. Disk requests come to the disk driver for cyclinders 12, 26, 24, 4, 42, 8 and 50 in that order. The driver is currently serving a request at cyclinder 24. A seek takes 6 msec per cyclinder moved. How much seek time is needed for shortest seek time first (SSTF) algorithm? (A) 0.984 sec (B) 0.396 sec (C) 0.738 sec (D) 0.42 sec

Description : A disk drive has 100 cylinders, numbered 0 to 99. Disk requests come to the disk driver for cyclinders 12, 26, 24, 4, 42, 8 and 50 in that order. The driver is currently serving a request at cyclinder 24. A seek takes ... (SSTF) algorithm? (A) 0.984 sec (B) 0.396 sec (C) 0.738 sec (D) 0.42 sec

Last Answer : C

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

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

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)

Degree of kinematic indeterminacy of a pin-jointed plane frame is given by (A) 2j - r (B) j - 2r (C) 3j - r (D) 2j + r

Description : Degree of kinematic indeterminacy of a pin-jointed plane frame is given by (A) 2j - r (B) j - 2r (C) 3j - r (D) 2j + r

Last Answer : (A) 2j - r

The total energy of electron in the Bohr orbit is given by the formula, E = a) - ke2 /2r b) - ke2 /2r2 c) - k 2 e/2r d) - ke2 /r

Description : The total energy of electron in the Bohr orbit is given by the formula, E = a) - ke2 /2r b) - ke2 /2r2 c) - k 2 e/2r d) - ke2 /r

Last Answer : a) - ke2 /2r

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 

Suppose there are four processes in execution with 12 instances of a Resource R in a system. The maximum need of each process and current allocation are given below: Image With reference to current allocation, is system safe? If so, what is the safe sequence? (A) No (B) Yes, P1 P2 P3 P4 (C) Yes, P4 P3 P1 P2 (D) Yes, P2 P1 P3 P4

Description : Suppose there are four processes in execution with 12 instances of a Resource R in a system. The maximum need of each process and current allocation are given below: With reference to current allocation, is system safe? If so, ... B) Yes, P1 P2 P3 P4 (C) Yes, P4 P3 P1 P2 (D) Yes, P2 P1 P3 P4

Last Answer : (C) Yes, P4 P3 P1 P2