Which of the following is not the type of queue?
#Linked list stack get mentain minimum number full#
A normal queue, if implemented using an array of size MAX_SIZE, gets full when?.A data structure in which elements can be inserted or deleted at/from both ends but not in the middle is?.If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed? The data structure required for Breadth First Traversal on a graph is?.A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as _.If the elements “A”, “B”, “C” and “D” are placed in a stack and are deleted one at a time, what is the order of removal?.The type of expression in which operator succeeds its operands is?.
Which of the following is not an inherent application of stack?.Which of the following statement(s) about stack data structure is/are NOT correct?Ī) Linked List are used for implementing Stacksī) Top of the Stack always contain the new nodeĭ) Null link is present in the last node at the bottom of the stack Thus Postfix Expression is A B D ^ + E F – / G +. ‘/’ is present in stack.Ī B D ^ + E F – / G +. Solution : The given infix expression is (A + B ⋀ D)/(E – F)+G. Convert the following infix expressions into its equivalent postfix expressions. Solution : The postfix expression is evaluated using stack. The result of evaluating the postfix expression 5, 4, 6, +, *, 4, 9, 3, /, +, * is?.Which data structure is used for implementing recursion?.The prefix form of an infix expression (p + q) – (r * t) is?.What is the result of the following operation?.
Which of the following is not the application of stack?ī) Tracking of local variables at run timeĭ) Data Transfer between two asynchronous process.What is the meaning of this statement?ī) Stack entries may be compared with the ‘<‘ operationĬ) The entries are stored in a linked listĭ) There is a Sequential entry that is one by one Pushing an element into stack already having five elements and stack size of 5, then stack becomes _.In a stack, if a user tries to remove an element from an empty stack it is called _.Process of inserting an element in stack is called _.If elements of the data structure form a sequence of the list then it is called as.Which is Primitive data type from these?.
0 kommentar(er)
