How many edges does a n-vertex triangle-free graph contain?

The operation of processing each element in a list is known as

Which of the following data structures implements the heap data structure?

Which sorting algorithm has the best time complexity for sorting a random linked list?

Which of the following problems cannot be solved by the backtracking method?

In a complete k-ary tree, every internal node has exactly k children or no child. The number of leaves in such a tree with n internal nodes is:

The primary factor used to determine the efficiency of an algorithm is:

Consider the weighted undirected graph with 4 vertices, where the weight of edge {i, j} g is given by the entry W_ij in the matrix W

The largest possible integer value of x, for which at least one shortest path between some pair of vertices will contain the edge with weight x is

What does the following recursive function do?

void my_function(int n)
{
    if(n == 0)
    return;
    my_function(n-1);
    printf("%d ",n);
}
int main()
{
    my_function(5);
    return 0;
}

What is the Hamiltonian path problem?