Q. Identify the data structure which allows deletions at both ends of the list but insertion at only one end.

View solution

Q. In a queue, the initial values of front pointer f rare pointer r should be …….. and ……….. respectively.

View solution

Q. In a circular queue the value of r will be ..

View solution

Q. Which of the following statement is true?

i) Using singly linked lists and circular list, it is not possible to traverse the list backwards.

ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.

View solution

Q. What will be the value of top, if there is a size of stack STACK_SIZE is 5

View solution

Q. ………… is not the operation that can be performed on queue.

View solution

Q. Which of the following is not the type of queue?

View solution

Q. Which is/are the application(s) of stack

View solution

Q. A data structure where elements can be added or removed at either end but not in the middle is called …

View solution

Q. When does top value of the stack changes?

View solution

Q. A ……………….. is a linear list in which insertions and deletions are made to from either end of the structure.

View solution

Q. In a priority queue, insertion and deletion takes place at ………………

View solution

Q. Which of the following is an application of stack?

View solution

Q. Which of the following name does not relate to stacks?

View solution

Q. The term "push" and "pop" is related to the

View solution

Q. A data structure where elements can be added or removed at either end but not in the middle

View solution

Q. Which data structure allows deleting data elements from front and inserting at rear?

View solution

Q. The postfix form of the expression (A + B)∗(C∗D − E)∗F / G is

View solution

Q. What is the postfix form of the following prefix expression -A/B*C$DE ?

View solution

Q. The minimum number of multiplications and additions required to evaluate the polynomial
P = 4x3+3x2-15x+45 is

View solution