Which sorting method is not possible?

What is the term for inserting into a full queue?

For which telegraphy device was the Morse code developed?

What is mean by ‘a’ in the following C operation?

fp = fopen("sample.c", "a");

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

The maximum number of times the decrease key operation is performed in Dijkstra's algorithm will be equal to:

Assume that a mergesort algorithm in the worst case takes 30 seconds for an input of size 64. Which of the following most closely approximates the maximum input size of a problem that can be solved in 6 minutes?

What are the appropriate data structures used by the following algorithms?

1. Depth First Search
2. Breadth First Search
3. Kruskal's Minimum Spanning Tree
4. Prim's Minimum Spanning Tree

Consider the stack:
| 8 |
| 6 |
| 4 |
| 2 |.
When the '+' operator is encountered, what operation is performed?

Consider the following recursive implementation to find the factorial of a number:

int fact(int n)
{
    if(n == 0)
       return 1;
    return n * fact(n - 1);
}
int main()
{
     int n = 10;
     int ans = fact(n);
     printf("%d",ans);
     return 0;
}

Which of the following lines should be inserted to complete the above code?