In: Computer Science
For each of the following statements, circle either T if the statement is true or F if the statement is false.
1.In Tower Of Hanoi with 5 disks, the minimum number of
moves the disks
from one tower to another is
32
Answer) F (Because 2^5 -1=31 moves required)
2. A server-printer uses a stack to organize printing requests.
Answer) F
3. A linked list dynamically grows as needed and has no capacity limitations.
Answer) T
4. Circular queue is empty when the rear_cnt equal front_cnt-1.
Answer) F ( it is check for full circular queue)
5.Last element added to a queue is the first one removed.
Answer) F (because Queues are data structures that follow the First In First Out (FIFO) i.e. the first element that is added to the queue is the first one to be removed.)
6.The single link list is empty when head equal tail.
Answer) F (because
0 Nodes in list: The 'head' and 'tail' are both null.
1 Node in list: The 'head' and 'tail' are both set, to the same node.)
7.The UNDO function in MS-Excel use the queue concept.
Answer) F (because it uses stack concept)
8.The 7th number of Fibonacci numbers is 31.
Answer) F ( because the write ans is 8; 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, ...)