# Data structure/Data Structure MCQ questions and answer Sample Test,Sample questions

## Question: ` If the graph is represented as an adjacency matrix then the time complexity of Kruskal’s algorithm is ____________`

1.O(E log V)

2.O(VlogE)

3.O(V2)

4.O(logE)

Posted Date:-2024-03-03 12:17:44

## Question: `By Strassen’s equation what is wrong in the following equation`

1.p1=(a+d)(e+h)

2.p3=(a-c)(e+f)

3.p2=(-e+g)d

4.p4=(a+b)h

Posted Date:-2024-03-03 12:19:15

## Question: `fractional knapsack is based on ____________method`

1.greedy method

2.branch and bound 2 8 7 1 3 5 6 4

3.dynamic programming

4.divide and conquer

Posted Date:-2024-03-03 12:20:31

## Question: `Queen problem what is the space complexity`

1.O(|V|)

2.O(|E|)

3.O(|V|+|E|)

4.O(|V2|)

Posted Date:-2024-03-03 12:15:59

## Question: `The files x1,x2,x3 are 3 files of length 30,20,10 records each. What is the optimal merge pattern value?`

1.110

2.60

3.90

4.50

Posted Date:-2024-03-03 12:21:24

## Question: ```which is optimal value in the case of fractional knapsack problem, capacity of knapsack is 10 item : 1 2 3 4 5 profit : 12 32 40 30 50 weight : 4 8 2 6 1 ```

1.345

2.384

3.354

4.350

Posted Date:-2024-03-03 12:15:11

## More MCQS

##### R4R Team
R4Rin Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on R4R.in website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!