Which of the operations is simpler in the doubly linked list than it is in the simple linked list?

Which of the following formulae in big-Oh notation best represents the expression n2+35n+6?

The operation for removing an entry from a stack is traditionally called _______.

Which queue allows insertion and deletion at both ends?

What kind of initialization needs to be done for a chained hash table?

The number of nodes in the largest maximal independent set of the complete bipartite graph K(4,2) is_____ .

Suppose each set is represented as a linked list with elements in arbitrary order. Which of the operations among union, intersection, membership, cardinality will be the slowest?

Is it possible to create a doubly linked list using only one pointer with every node.

What should be added in place of "/*ADD A STATEMENT HERE*/", so that the function correctly reverses a linked list.

In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is

Which of these is the correct big -Oh expression for 1+2+3+...+n?