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

37/59

Page

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

Q721

Quickselect is an in-place algorithm?

Select an option to see the answer and solution.

Q722

What will be the slope of the line perpendicular to the line 6x-3y-16=0?

Select an option to see the answer and solution.

Q723

In the not recently used algorithm, what do the R bits and M bits refer to?

Select an option to see the answer and solution.

Q724

While choosing the value of a and m (m is the no. of alphabets) in affine cipher it must be ensured that?

Select an option to see the answer and solution.

Q725

To find an eulerian circuit in the graph by fleury's algorithm, always begin with the vertex having an odd degree.

Select an option to see the answer and solution.

Q726

The number of scalar additions and subtractions used in Strassen's matrix multiplication algorithm is . . . . . . . .

Select an option to see the answer and solution.

Q727

What is the name given to the algorithm depicted in the pseudo code below?

procedure generate(n : integer, Arr : array):
    if n = 1 then
          output(Arr)
    else
        for i = 0; i <= n - 2; i ++ do
            generate(n - 1, Arr)
            if n is even then
                swap(Arr[i], Arr[n-1])
            else
                swap(Arr[0], Arr[n-1])
            end if
        end for
        generate(n - 1, Arr )
    end if

Select an option to see the answer and solution.

Q728

Which of the following is not a property of the bipartite graph?

Select an option to see the answer and solution.

Q729

Which of the following is not an Eigen value of the adjacency matrix of the complete bipartite graph?

Select an option to see the answer and solution.

Q730

What is the time complexity of the following recursive implementation to find the sum of digits of a number n?

#include<stdio.h>
int recursive_sum_of_digits(int n)
{
      if(n == 0)
        return 0;
      return _________;
}
int main()
{
      int n = 1201;
      int ans = recursive_sum_of_digits(n);
      printf("%d",ans);
      return 0;
}

Select an option to see the answer and solution.

Q731

Atbash cipher is an example of?

Select an option to see the answer and solution.

Q732

Which one of the following problem types does inclusion-exclusion principle belong to?

Select an option to see the answer and solution.

Q733

Which approach is based on computing the distance between each pair of distinct points and finding a pair with the smallest distance?

Select an option to see the answer and solution.

Q734

Consider the following algorithm to find the solution of the activity selection problem. Which of the following option is best suited to fill the blank?

Sort the given activity List 
display the first activity 
set i = 1
for j = 1 to n-1 do
  if begin time of activity[j] >= completion of activity[i] then
      ___________
      i = j

Select an option to see the answer and solution.

Q735

What can be the maximum sum of digits for a 4 digit number?

Select an option to see the answer and solution.

Q736

Can binary search be applied on a sorted linked list in O(Logn) time?

Select an option to see the answer and solution.

Q737

What will be the time complexity of the code to reverse stack recursively?

Select an option to see the answer and solution.

Q738

Who formulated quick hull algorithm?

Select an option to see the answer and solution.

Q739

The number of elements in the power set increases when there are duplicates present in the set.

Select an option to see the answer and solution.

Q740

Pigpen cipher is less secure than a vigenere cipher.

Select an option to see the answer and solution.

Prev 35 36 37 38 39 Next