Which data structure is fastest for inserting elements?

Which algorithm is able to detect negative cycles in directed graphs?

What is the result of a Depth First Search (DFS) traversal of a graph?

In a linked list, there is an extra element at the head of the list called a _____.

Which of the following sorting algorithms is not considered an internal sort?

The Stoer-Wagner algorithm is used to solve which problem?

What is the objective of the knapsack problem?

Suppose the numbers 7, 5, 1, 8, 3, 6, 0, 9, 4, 2 are inserted in that order into an initially empty binary search tree. The binary search tree uses the usual ordering on natural numbers. What is the in-order traversal sequence of the resultant tree?

According to the inclusion-exclusion principle:

In C, 1D array of int can be defined as follows and both are correct:

int array1D[4] = {1,2,3,4};
int array1D[] = {1,2,3,4};

But given the following definitions (along with initialization) of 2D arrays:

int array2D[2][4] = {1,2,3,4,5,6,7,8}; /* (i) */
int array2D[][4] = {1,2,3,4,5,6,7,8}; /* (ii) */
int array2D[2][] = {1,2,3,4,5,6,7,8}; /* (iii) */
int array2D[][] = {1,2,3,4,5,6,7,8}; /* (iv) */