Free Online Test – Algorithm Basic Level Test
Algorithm Basic
Submit Now
0 of 10 questions completed
Questions:
 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
Information
Instruction:
 Total number of questions : 10.
 Time alloted : 30 minutes.
 Each question carry 1 mark, no negative marks.
 DO NOT refresh the page.
 All the best :).
You have already completed the quiz before. Hence you can not start it again.
Quiz is loading...
You must sign in or sign up to start the quiz.
You have to finish following quiz, to start this quiz:
Results
0 of 10 questions answered correctly
Your time:
Time has elapsed
You have reached 0 of 0 Marks, (0)
Average score 

Your score 

Categories
 Algorithm 0%
Pos.  Name  Entered on  Marks  Result 

Table is loading  
No data available  
 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
 Answered
 Review

Question 1 of 10
1. Question
1 MarksFind the time complexity of following recurrence relation?
T(n) = 5T(n47) + O(1) and
T(0)=1Correct
Incorrect

Question 2 of 10
2. Question
1 MarksArrange the following functions according to growth of increasing.
Correct
Incorrect

Question 3 of 10
3. Question
1 MarksConsider the following code :
Search(int n){ if(n<2) then return; else{ s=0; for(i=1;i<=8;i++){ Search(n/2); } for(i=1;i<n*n;i++){ for(j=1;j<n;j=j*2){ s=s+i; } } } }
Assume s is a global variable.Find the complexity of the given Search(n)?
Correct
Incorrect

Question 4 of 10
4. Question
1 MarksWhat will be the time complexity for the following recurrence relation?
T(n)=8T(n^{1/2})+(log n)^{2} if n>2
= 1,OtherwiseCorrect
Incorrect

Question 5 of 10
5. Question
1 MarksWhich of the following sorting techniques have best time complexity, if complexity is measured in terms of number of comparison?
Correct
Incorrect

Question 6 of 10
6. Question
1 MarksThe number of distinct minimum spanning trees for the weighted graph below is _____
Correct
Incorrect

Question 7 of 10
7. Question
1 MarksThe graph shown below has 8 edges with distinct integer edge weights. The minimum spanning tree (MST) is of weight 36 and contains the edges: {(A,C),(B,C),(B,E),(E,F),(D,F)}. The edge weights of only those edges which are in the MST are given in the figure shown below. The minimum possible sum of weights of all 8 edges of this graph is_______________.
Correct
Incorrect

Question 8 of 10
8. Question
1 MarksA file contains characters a,e,i,o,u,s and t with frequencies 10,15,12,3,4,13 and 1 respectively. If we use Huffman Coding for data compression then the average code length will be –
Correct
Incorrect

Question 9 of 10
9. Question
1 MarksFour matrices M1, M2, M3, and M4 have dimensions p x q, q x r, r x s, and s x t respectively can be multiplied in several ways with different number of total scalar multiplications. For example, when multiplied as ((M1 x M2) x (M3 x M4)) total number of scalar multiplications is pqr + rst + prt.
When multiplied as (((M1 x M2) x M3) x M4) the total number of scalar multiplications is pqr + prs + pst.
If p = 10, q = 100, r = 20, s = 5, and t = 80, then what is the minimum number of scalar multiplications needed ?
Correct
Incorrect

Question 10 of 10
10. Question
1 MarksConsider two strings A=“qpqrr” and B=“pqprqrp”. Let x be the length of the longest common subsequence (not necessarily contiguous) between A and B and let y be the number of such longest common subsequences between A and B. Then x+10y= ___.
Correct
Incorrect