Priority queue data structure is required to convert the infix to prefix notation. True False QUESTION 15 Big O notation tells how the speed of an algorithm relates to the number of items. True False QUESTION 16 The term priority in a priority queue means that the highest priority items are inserted first. True O False QUESTION 17 The contents of a queue can be wrapped around (circular), while stack cannot. True False Ordered arrays offer slow insertion but fast searching. True False QUESTION 19 Data structure can be used as a programmers tool. True wa False QUESTION 20 Reversing a string is an example of a queue application. True False QUESTION 21 If two elements in the priority queue have the same priority, FIFO principle will be used. True False QUESTION 22 The time complexity of enqueue operation in Queue is 0(1). True False QUESTION 23 An algorithm is a procedure for carrying out a particular task. True False