Which of the following is a linear data structure?

Which of the following is not back tracking algorithm?

Straight insertion sort is a:

Which one of the following correctly determines the solution of the recurrence relation given below with T(1) = 1?

T(n)= 2T(n/4) + n1/2 

Which of the following algorithms are used to find the shortest path from a source node to all other nodes in a weighted graph?

Overflow condition in linked list means ?

What is the time and space complexity of accessing an element in an array with a known index?

Which of The Following Options Represent the Correct Time Complexity if The Run Time of an Algorithm is Represented by the Following Relation :

if n <=3 then T(n) = n

else T(n) = T(n/3) + cn

A program P reads in 500 integers in the range [0,100] representing the scores of 500 students. It then prints the frequency of each score above 50. What would be the best way for P to store the frequencies?

Take a stack and a queue. The following elements 8,4,5,6,7,9 are to be push in stack and enqueue in queue.

Follow the following instructions :

1. pop an element in stack
2. dequeue, an element in queue
3. pop an element from stack and enqueue the same element in queue
4. dequeue an element from queue and push the same element in stack

What is the top element in a stack?