Assuming that the disk head is located initially at 32, find the number of disk moves required with FCFS if the disk queue of I/O block requests are 98, 37, 14, 124, 65, 67: (A) 310 (B) 324 (C) 320 (D) 321

Assuming that the disk head is located initially at 32, find the number of disk moves required with FCFS if the disk queue of I/O block requests are 98, 37, 14, 124, 65, 67: (A) 310 (B) 324 (C) 320 (D) 321
by

1 Answer

Answer :

(D) 321
by

Related questions

If the Disk head is located initially at track 32, find the number of disk moves required with FCFS scheduling criteria if the disk queue of I/O blocks requests are: 98, 37, 14, 124, 65, 67 (A) 320 (B) 322 (C) 321 (D) 319

Description : If the Disk head is located initially at track 32, find the number of disk moves required with FCFS scheduling criteria if the disk queue of I/O blocks requests are: 98, 37, 14, 124, 65, 67 (A) 320 (B) 322 (C) 321 (D) 319

Last Answer : (C) 321

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 

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

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.

A scheduling Algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (lowest priority). The scheduler re-evaluates the process priority for every 'T' time units and decides next process to be scheduled. If the process have no I/O operations and all arrive at time zero, then the scheduler implements .............. criteria. (A) Priority scheduling (B) Round Robin Scheduling (C) Shortest Job First (D) FCFS

Description : A scheduling Algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (lowest priority). The scheduler re-evaluates the process priority for every 'T' time ... (A) Priority scheduling (B) Round Robin Scheduling (C) Shortest Job First (D) FCFS

Last Answer : (B) Round Robin Scheduling

The Constitution of India provides for an Election Commission under Article - (1) 321 (2) 322 (3) 323 (4) 324

Description : The Constitution of India provides for an Election Commission under Article - (1) 321 (2) 322 (3) 323 (4) 324

Last Answer : (4) 324 Explanation: Constitution of India provides for an election commission under article 324. Article 321 empowers power to extend functions of Public service commission. Under article 322 expenses of public service commission mentioned.

The order of a leaf node in a B+ tree is the maximum number of children it can have. Suppose that block size is 1 kilobytes, the child pointer takes 7 bytes long and search field value takes 14 bytes long. The order of the leaf node is ............ (1) 16 (2) 63 (3) 64 (4) 65

Description : The order of a leaf node in a B+ tree is the maximum number of children it can have. Suppose that block size is 1 kilobytes, the child pointer takes 7 bytes long and search field value takes 14 bytes long. The order of the leaf node is ............ (1) 16 (2) 63 (3) 64 (4) 65

Last Answer : Answer: All

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

Why did this happen to me ? I struggled a lot with 320 questions and 321 answers with 960 and monthly guru points were 982. Now why did my points decrease ? I want a solution.

Description : Why did this happen to me ? I struggled a lot with 320 questions and 321 answers with 960 and monthly guru points were 982. Now why did my points decrease ? I want a solution.

Last Answer : Did you answer a question incorrectly ? If not, why did you cut your points ?

Find the next number in the following series: 2, 5, 10, 17, 26, 37, 50, ? (A) 63 (B) 65 (C) 67 (D) 69

Description : Find the next number in the following series: 2, 5, 10, 17, 26, 37, 50, ? (A) 63 (B) 65 (C) 67 (D) 69

Last Answer : Answer: B

Which number is missing in the following series ? 2, 5, 10, 17, 26, 37, 50, ? (A) 63 (B) 65 (C) 67 (D) 69

Description : Which number is missing in the following series ? 2, 5, 10, 17, 26, 37, 50, ? (A) 63 (B) 65 (C) 67 (D) 69

Last Answer : Answer: B Observe that 2, 5, 10, 17, 26, 37, 50, ? There is difference between two number is 3, 5, 7, 9, 11, 13 So next is 50 +15=65

The Election Commission is established under the Article – (1) Article-355 (2) Artacie-256 (3) Article-324 (4) Article-320

Description : The Election Commission is established under the Article – (1) Article-355 (2) Artacie-256 (3) Article-324 (4) Article-320

Last Answer : (3) Article-324 Explanation: Under Article 324 of the Indian Constitution, the superintendence, direction and control of elections to both Houses of Parliament and State Legislatures is vested in ... the Commission to conduct the elections to the offices of the President and VicePresident of India.

How much space will be required to store the bit map of a 1.3 GB disk with 512 bytes block size ? (A) 332.8 KB (B) 83.6 KB (C) 266.2 KB (D) 256.6 KB

Description : How much space will be required to store the bit map of a 1.3 GB disk with 512 bytes block size ? (A) 332.8 KB (B) 83.6 KB (C) 266.2 KB (D) 256.6 KB

Last Answer : (A) 332.8 KB

For determining the moisture content of a soil sample, the following data is available Weight of container = 260 g, Weight of soil sample and = 320 g container, Weight of soil sample (dried) and = 310 g container. The moisture content of the soil sample, is (A) 15 % (B) 18 % (C) 20 % (D) 25 %

Description : For determining the moisture content of a soil sample, the following data is available Weight of container = 260 g, Weight of soil sample and = 320 g container, Weight of soil sample (dried) and = 310 g container. The moisture content of the soil sample, is (A) 15 % (B) 18 % (C) 20 % (D) 25 %

Last Answer : (C) 20 %

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

12 17 32 57 ? 137 a) 98 b) 95 c) 37 d) 92 e) none of these

Description : 12 17 32 57 ? 137 a) 98 b) 95 c) 37 d) 92 e) none of these

Last Answer : The pattern of the number series is 12+5×1=17, 17+5×3=32, 32+5×5=57 57+5×7=92, 92+5×9=137 Answer: d)

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

In a demand paging memory system, page table is held in registers. The time taken to service a page fault is 8 m.sec. if an empty frame is available or if the replaced page is not modified, and it takes 20 m.secs., if the replaced page is modified. What is the average access time to service a page fault assuming that the page to be replaced is modified 70% of the time ? (A) 11.6 m.sec. (B) 16.4 m.sec. (C) 28 m.sec. (D) 14 m.sec.

Description : In a demand paging memory system, page table is held in registers. The time taken to service a page fault is 8 m.sec. if an empty frame is available or if the replaced page is not modified, and it takes 20 m.secs., if the replaced ... ? (A) 11.6 m.sec. (B) 16.4 m.sec. (C) 28 m.sec. (D) 14 m.sec.

Last Answer : (B) 16.4 m.sec. 

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)

X, Y & Z rent a pasture. X puts 20 cows for 5 months , Y puts 24 cows for 7 months and Z puts 30 cows for 3 months for grazing. If the rent of the pasture is Rs. 150, how much must z pay as his share of rent? A) 32 B) 39.65 C) 37.70 D) 35.20

Description : X, Y & Z rent a pasture. X puts 20 cows for 5 months , Y puts 24 cows for 7 months and Z puts 30 cows for 3 months for grazing. If the rent of the pasture is Rs. 150, how much must z pay as his share of rent? A) 32 B) 39.65 C) 37.70 D) 35.20

Last Answer : Answer: C) X : Y : Z = 20* 5 : 24* 7 : 30 * 3 = 100 : 168 : 90 =50 : 84 : 45 Therefore Z’s rent = Rs (150 * 45 / 179) = Rs.(6750/179) Rs.37.70

Round to nearest ten thousand 65,321?

Description : Round to nearest ten thousand 65,321?

Last Answer : 64000

Which of the following has compilation error in C ? (A) int n = 32; (B) char ch = 65; (C) float f= (float) 3.2; (D) none of the above

Description : Which of the following has compilation error in C ? (A) int n = 32; (B) char ch = 65; (C) float f= (float) 3.2; (D) none of the above

Last Answer : D

Which of the following information about the UNIX file system is not correct? (A) Super block contains the number of i-nodes, the number of disk blocks, and the start of the list of free disk blocks. (B) An i-node contains accounting information as well as enough information to locate all the disk blocks that holds the file’s data. (C) Each i-node is 256-bytes long. (D) All the files and directories are stored in data blocks.

Description : Which of the following information about the UNIX file system is not correct? (A) Super block contains the number of i-nodes, the number of disk blocks, and the start of the list of free disk blocks. (B ... Each i-node is 256-bytes long. (D) All the files and directories are stored in data blocks. 

Last Answer : (C) Each i-node is 256-bytes long.

A unix file system has 1-KB blocks and 4-byte disk addresses. What is the maximum file size if i-nodes contain 10 direct entries and one single, double and triple indirect entry each? (A) 32 GB (B) 64 GB (C) 16 GB (D) 1 GB

Description : A unix file system has 1-KB blocks and 4-byte disk addresses. What is the maximum file size if i-nodes contain 10 direct entries and one single, double and triple indirect entry each? (A) 32 GB (B) 64 GB (C) 16 GB (D) 1 GB

Last Answer : (C) 16 GB

A vessel contains milk and water in the ratio of 4:3. If 14 litres of the mixture is drawn and filled with water, the ratio changes to 3:4. How much milk was there in the vessel initially? a) 24 b) 32 c) 40 d) 48 e) None of these

Description : A vessel contains milk and water in the ratio of 4:3. If 14 litres of the mixture is drawn and filled with water, the ratio changes to 3:4. How much milk was there in the vessel initially? a) 24 b) 32 c) 40 d) 48 e) None of these

Last Answer : Answer: B milk = 4x and water = 3x milk = 4x – 14*4/7 and water = 3x – 14*3/7 + 14 4x – 8: 3x + 8 = 3:4 X = 8, so milk = 8*4 = 32 litres

The world population growth rate at a certain reference year was 3.5%. Assuming exponential growth of population, after how many years, the population of the world would have increased by a factor 16 ? (A) ~ 80 years (B) ~ 40 years (C) ~ 160 years (D) ~ 320 years

Description : The world population growth rate at a certain reference year was 3.5%. Assuming exponential growth of population, after how many years, the population of the world would have increased by a factor 16 ? (A) ~ 80 years (B) ~ 40 years (C) ~ 160 years (D) ~ 320 years

Last Answer : Answer: A

A UNIX file system has 1 KB block size and 4-byte disk addresses. What is the maximum file size if the inode contains ten direct block entries, one single indirect block entry, one double indirect block entry and one triple indirect block entry? (A) 30 GB (B) 64 GB (C) 16 GB (D) 1 GB

Description : A UNIX file system has 1 KB block size and 4-byte disk addresses. What is the maximum file size if the inode contains ten direct block entries, one single indirect block entry, one double indirect block entry and one triple indirect block entry? (A) 30 GB (B) 64 GB (C) 16 GB (D) 1 GB

Last Answer : (C) 16 GB

................. maintains the list of free disk blocks in the Unix file system. (A) I-node (B) Boot block (C) Super block (D) File allocation table

Description : ................. maintains the list of free disk blocks in the Unix file system. (A) I-node (B) Boot block (C) Super block (D) File allocation table

Last Answer : (C) Super block 

In ............ allocation method for disk block allocation in a file system, insertion and deletion of blocks in a file is easy. (A) Index (B) Linked (C) Contiguous (D) Bit Map

Description : In ............ allocation method for disk block allocation in a file system, insertion and deletion of blocks in a file is easy. (A) Index (B) Linked (C) Contiguous (D) Bit Map

Last Answer : (B) Linked

Consider a disk with 16384 bytes per track having a rotation time of 16 msec and average seek time of 40 msec. What is the time in msec to read a block of 1024 bytes from this disk? (A) 57 msec (B) 49 msec (C) 48 msec (D) 17 msec

Description : Consider a disk with 16384 bytes per track having a rotation time of 16 msec and average seek time of 40 msec. What is the time in msec to read a block of 1024 bytes from this disk? (A) 57 msec (B) 49 msec (C) 48 msec (D) 17 msec

Last Answer : Answer: B

The product of two numbers is 4107. If the H.C.F. of these numbers is 37, then the greater number is: A.124 B.100 C.111 D.175 E.None of these

Description : The product of two numbers is 4107. If the H.C.F. of these numbers is 37, then the greater number is: A.124 B.100 C.111 D.175 E.None of these

Last Answer : Answer – C (111) Explanation – Let the numbers be 37a and 37b. Then, 37a x 37b = 4107 ab = 3. Now, co-primes with product 3 are (1, 3). So, the required numbers are (37 x 1, 37 x 3) i.e., (37, 111). Greater number = 111.

Find the magnetic flux density when a flux of 28 units is enclosed in an area of 15cm. a) 178.33 b) 186.67 c) 192.67 d) 124.33

Description : Find the magnetic flux density when a flux of 28 units is enclosed in an area of 15cm. a) 178.33 b) 186.67 c) 192.67 d) 124.33

Last Answer : b) 186.67

4 male and 6 female do a piece of work in 20 days while 6 male and 4 female can do the same work in16 days. In how many days can 4 male and 2 female do the work? a) 3 62/142 b) 2 18/124 c) 4 81/165 d) 1 67/133

Description : 4 male and 6 female do a piece of work in 20 days while 6 male and 4 female can do the same work in16 days. In how many days can 4 male and 2 female do the work? a) 3 62/142 b) 2 18/124 c) 4 81/165 d) 1 67/133

Last Answer : D Let 1 male's 1 day's work = x 1 female's 1 day's work = y Then 4x + 6y = 1/20 ---------->A 80x + 120y = 1 -----------1 6x + 4y = 1/16 ----------B 96x + 64y = ... (1/400) =132/200+1/200 = 133/200 So 4 male and 2 female together can finish the work in 200/133 = 1 67 /133 days

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50'. What number is missing? -Riddles

Description : 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50'. What number is missing? -Riddles

Last Answer : 22

For a certain gas R = 320 J/kg.K and cv= 0.84kJ/kg.K. Find k?  a. 1.36  b. 1.37  c. 1.38  d. 1.39 formula: k= R / cv+1

Description : For a certain gas R = 320 J/kg.K and cv= 0.84kJ/kg.K. Find k?  a. 1.36  b. 1.37  c. 1.38  d. 1.39 formula: k= R / cv+1

Last Answer : 1.38

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 specific editor has 200 K of program text, 15 K of initial stack, 50 K of initialized data, and 70 K of bootstrap code. If five editors are started simultaneously, how much physical memory is needed if shared text is used ? (A) 1135 K (B) 335 K (C) 1065 K (D) 320 K

Description : A specific editor has 200 K of program text, 15 K of initial stack, 50 K of initialized data, and 70 K of bootstrap code. If five editors are started simultaneously, how much physical memory is needed if shared text is used ? (A) 1135 K (B) 335 K (C) 1065 K (D) 320 K

Last Answer : (B) 335 K

Which of the following is/are the sources for project requests? A) Request from Department managers B) Request from senior executives C) Request from system Analyst D) All of the above

Description : Which of the following is/are the sources for project requests? A) Request from Department managers B) Request from senior executives C) Request from system Analyst D) All of the above

Last Answer : D) All of the above

The Register that stores all interrupt requests is: (A) Interrupt mask register (B) Interrupt service register (C) Interrupt request register (D) Status register

Description : The Register that stores all interrupt requests is: (A) Interrupt mask register (B) Interrupt service register (C) Interrupt request register (D) Status register

Last Answer : (C) Interrupt request register

............. policy selects the disk I/O request that requires the least movement of the disk arm from its current position. A) FSCAN B) SSTF C) SCAN D) C-SCAN

Description : ............. policy selects the disk I/O request that requires the least movement of the disk arm from its current position. A) FSCAN B) SSTF C) SCAN D) C-SCAN

Last Answer : B) SSTF

What is a queue? Give a real life example.

Description : What is a queue? Give a real life example.

Last Answer : A: It is a linear data structure which follows the FIFO (First In First out) pattern. Real life example: Queue at the ticket counter

The …………….. policy segments the disks request queue into sub queues of the length N. A) SCAN B) C-SCAN C) N-Step SCAN D) FSCAN

Description : The …………….. policy segments the disks request queue into sub queues of the length N. A) SCAN B) C-SCAN C) N-Step SCAN D) FSCAN

Last Answer : C) N-Step SCAN

……… is not the operation that can be performed on queue. A) Insertion B) Deletion C) Retrieval D) Traversal

Description : ……… is not the operation that can be performed on queue. A) Insertion B) Deletion C) Retrieval D) Traversal

Last Answer : D) Traversal

In a circular queue the value of r will be .. A) r=r+1 B) r=(r+1)% [QUEUE_SIZE – 1] C) r=(r+1)% QUEUE_SIZE D) r=(r-1)% QUEUE_SIZE

Description : In a circular queue the value of r will be .. A) r=r+1 B) r=(r+1)% [QUEUE_SIZE – 1] C) r=(r+1)% QUEUE_SIZE D) r=(r-1)% QUEUE_SIZE

Last Answer : C) r=(r+1)% QUEUE_SIZE

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

Which of the following is not the type of queue? A) Ordinary queue B) Single ended queue C) Circular queue D) Priority queue

Description : Which of the following is not the type of queue? A) Ordinary queue B) Single ended queue C) Circular queue D) Priority queue

Last Answer : B) Single ended queue

………… is very useful in situation when data have to stored and then retrieved in reverse order. A) Stack B) Queue C) List D) Link list

Description : ………… is very useful in situation when data have to stored and then retrieved in reverse order. A) Stack B) Queue C) List D) Link list

Last Answer : A) Stack

……………. Is a pile in which items are added at one end and removed from the other. A) Stack B) Queue C) List D) None of the above

Description : ……………. Is a pile in which items are added at one end and removed from the other. A) Stack B) Queue C) List D) None of the above

Last Answer : B) Queue

Consider the following statements for priority queue: S1: It is a data structure in which the intrinsic ordering of the elements does determine the result of its basic operations. S2: The elements of a priority queue may be complex structures that are ordered on one or several fields. Which of the following is correct? (A) Both S1 and S2 are incorrect. (B) S1 is correct and S2 is incorrect. (C) SI is incorrect and S2 is correct. (D) Both S1 and S2 are correct.

Description : Consider the following statements for priority queue: S1: It is a data structure in which the intrinsic ordering of the elements does determine the result of its basic operations. S2: The elements of a priority queue ... . (C) SI is incorrect and S2 is correct. (D) Both S1 and S2 are correct.

Last Answer : (D) Both S1 and S2 are correct.

If the queue is implemented with a linked list, keeping track of a front pointer and a rear pointer, which of these pointers will change during an insertion into a non-empty queue? (A) Neither of the pointers change (B) Only front pointer changes (C) Only rear pointer changes (D) Both of the pointers changes

Description : If the queue is implemented with a linked list, keeping track of a front pointer and a rear pointer, which of these pointers will change during an insertion into a non-empty queue? (A) Neither of ... (B) Only front pointer changes (C) Only rear pointer changes (D) Both of the pointers changes

Last Answer : (C) Only rear pointer changes