What is the worst-case running time of the Rabin-Karp algorithm?

What is the number of edges present in a complete graph with n vertices?

A mono-alphabetic cipher is a type of:

Consider a simple undirected graph of 10 vertices. If the graph is disconnected, then the maximum number of edges it can have is

Which of the following algorithms cannot be designed without recursion?

The branch and bound algorithm can be used to solve the

In a tree data structure, which property states that the value in a node is greater than every value in its children?

Which of the following applications makes use of a circular linked list?

Assume that the operators +, -, ×, and ^ have the following order of precedence from highest to lowest: ^, ×, +, -. Also, assume that the operators +, -, and × are left-associative, while ^ is right-associative.
The postfix expression for the infix expression a + b × c - d ^ e ^ f is: