How many stacks are required for evaluating a prefix expression?

The process of inserting an element into a stack is called?

The minimum number of queues needed to implement a priority queue is

The number of priority queue operations used in Dijkstra's algorithm is ________.

A binary tree T has 20 leaves. The number of nodes in T having two children is

#include

int main()

{

char s1[7] = "1234", *p;

p = s1 + 2;

*p = '0' ;

printf ("%s", s1);

}

Pre-order traversal in a binary tree is similar to which type of traversal?

Quicksort

Which of the following partitioning method in QuickSort maintains the stability of elements?

A graph is self-complementary if it is isomorphic to its complement. For all self-complementary graphs on n vertices, n is

The FIFO (First-In, First-Out) page replacement algorithm associates with each page the time when the page was brought into memory.