BARC CS 2018 Nuclear Quiz -3 (Algo)

Attempt now to get your rank among 720 students!

Question 1

Which of the following is used to solve 0/1 knapsack problem?

• ADivide and Conquer
• BDynamic Problem 
• CGreedy Approach
• DNone of these

Question 2

If we sorting an array of 8 integers using quick sort left side, then after finishing the first partitioning the array look like 3 6 2 8 10 12 11 15 then which of the following will be correct?

• AThe pivot is not 8, but it could be 10
• BNeither 8 nor 10 is pivot
• CThe pivot could be either 8,10 or 15
• DNone of these

Question 3

If there is costly swap operation then which of the following have minimum number of swap operations?

• AMerge sort
• BInsertion sort
• CHeap sort
• DSelection sort

Question 4

The adjacency matrix A of the graph G is

• A
• B
• C
• D

Question 5

A hash function is defined as hash = value % 13, what will be the location of the value 67 after insertion of the following value 63, 54, 41, 90, 27, 190 67 ? (Use linear hashing)

• A2
• B3
• C4
• D6

• 720 attempts
• 3 upvotes
• 11 comments