How many distinct solutions are possible for the n-queens problem where n = 8?

Which of the following sorting algorithms is not an in-place algorithm?

What is the worst-case time complexity of sorting n numbers using randomized quicksort?

A statement that unconditionally transfers program control within a function is called a

What are the common approaches used to solve the Travelling Salesman Problem (TSP)?

int main()

{

int x[10]={0,7,8,9,5,4,2,1,5,7};

int *ptr1,*ptr2,*ptr3;

ptr1=&x[3];

ptr2=&x[5];

ptr3=&x[1];

printf("%p\n",(ptr1+ptr2+ptr3));

return 0;

}

What happens when you pop from an empty stack while implementing the Stack ADT in Java?

Which data structure is most suitable for implementing best-first branch and bound strategy?

Which of the following statements are not true?

a) Calloc() function takes two parameters but malloc() function takes only one parameter.

b) Memory allocated by calloc() is initialized to zero while memory allocated by malloc() contains garbage value.

c) The Minimal Spanning Tree of a graph gives the shortest distance between any 2 specified nodes.

How can you effectively detect the presence of cycles in a small circular linked list?