Vidyalelo
Data Structure · all questions

Miscellaneous on Data Structures
practice.

Practice every MCQ with options. Use Show answers when you want the correct option and solution.

1,171

Questions

7/59

Page

Pick an option on a question to see the right answer and solution.

Which of the following algorithm can be used to detect a cycle in a singly linked list?

Select an option to see the answer and solution.

Which of the following sorting algorithm has best case time complexity of O(n2)?

Select an option to see the answer and solution.

What will be the best case time complexity of recursive selection sort?

Select an option to see the answer and solution.

What is the running time of Chan's algorithm?

Select an option to see the answer and solution.

Which of the following is an application of Euler's totient function?

Select an option to see the answer and solution.

Which of the following statement is not related to quickhull algorithm?

Select an option to see the answer and solution.

Which of the following cipher makes use of linear algebra for encrypting data?

Select an option to see the answer and solution.

Bipartite graph belongs to class 1 graphs.

Select an option to see the answer and solution.

What is the running time of Hershberger algorithm?

Select an option to see the answer and solution.

Which of the following refers to the circuit that uses every edge exactly once, also starts and ends at the same vertex?

Select an option to see the answer and solution.

Consider a reference string:
7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 of frame size 4. Using FIFO algorithm, determine the number of page faults.

Select an option to see the answer and solution.

What will be the co-ordinates of foot of perpendicular line drawn from the point (-1,3) to the line 3x-4y-16=0?

Select an option to see the answer and solution.

What is the purpose of using function srand()?

Select an option to see the answer and solution.

Problems that cannot be solved by any algorithm are called?

Select an option to see the answer and solution.

Least recently used cache has the space complexity of O(n).

Select an option to see the answer and solution.

The pseudocode for the independent set problem is given below. Which of the following gives the time complexity for it?
Independent (G = (V, E))
{
    temp=true
    for every {u, v} in the subset
    {
        check if they have any edge between them
        if edge exists, then set temp as false and break
    }
    If temp is true 
    correct result        
    else 
incorrect
}

Select an option to see the answer and solution.

When is a graph said to be bipartite?

Select an option to see the answer and solution.

The resultant vector from the cross product of two vectors is . . . . . . . .

Select an option to see the answer and solution.

Recursive selection sort is a comparison based sort.

Select an option to see the answer and solution.

Space complexity of recursive solution of tower of hanoi puzzle is . . . . . . . .

Select an option to see the answer and solution.