Miscellaneous on Data Structures MCQ question and answer with solution Page-4 section-2

Section 1 Section 2 Section 3 Section 4 Section 5 Section 6 Section 7 Section 8 Section 9 Section 10 Section 11 Section 12

31.
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.

A. 12

B. 16

C. 10

D. 14

Answer & Solution Discuss in Board Save for Later

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

A. (1/5,2/5)

B. (2/25,5/25)

C. (68/25,-49/25)

D. (-49/25,68/25)

Answer & Solution Discuss in Board Save for Later

33.
What is the purpose of using function srand()?

A. to set the seed of rand() function

B. to generate random numbers

C. to enable rand() function

D. to improve efficiency of rand()

Answer & Solution Discuss in Board Save for Later

34.
Problems that cannot be solved by any algorithm are called?

A. tractable problems

B. intractable problems

C. undecidable problems

D. decidable problems

Answer & Solution Discuss in Board Save for Later

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

A. True

B. False

Answer & Solution Discuss in Board Save for Later

36.

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
}

A. O(V + E)

B. O(V)

C. O(V log V)

D. O(V log E)

Answer & Solution Discuss in Board Save for Later

37.
When is a graph said to be bipartite?

A. If it can be divided into two independent sets A and B such that each edge connects a vertex from to A to B

B. If the graph is connected and it has odd number of vertices

C. If the graph is disconnected

D. If the graph has at least n/2 vertices whose degree is greater than n/2

Answer & Solution Discuss in Board Save for Later

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

A. perpendicular to any one of the two vectors involved in cross product

B. perpendicular to the plane containing both vectors

C. parallel to to any one of the two vectors involved in cross product

D. parallel to the plane containing both vectors

Answer & Solution Discuss in Board Save for Later

39.
Recursive selection sort is a comparison based sort.

A. true

B. false

Answer & Solution Discuss in Board Save for Later

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

A. O(1)

B. O(n)

C. O(log n)

D. O(n log n)

Answer & Solution Discuss in Board Save for Later

1 2 3 4 5 6 7 8 9 10

Miscellaneous on Data Structures MCQ question and answer with solution

31. 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.

Answer & Solution

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

Answer & Solution

33. What is the purpose of using function srand()?

Answer & Solution

34. Problems that cannot be solved by any algorithm are called?

Answer & Solution

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

Answer & Solution

Answer & Solution

37. When is a graph said to be bipartite?

Answer & Solution

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

Answer & Solution

39. Recursive selection sort is a comparison based sort.

Answer & Solution

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

Answer & Solution

Read More Section(Miscellaneous on Data Structures)

31.
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.

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

33.
What is the purpose of using function srand()?

34.
Problems that cannot be solved by any algorithm are called?

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

37.
When is a graph said to be bipartite?

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

39.
Recursive selection sort is a comparison based sort.

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