Select the correct option to test your answer:
More Computer Questions
What is the rule for encryption in playfair cipher if the letters in a pair does not appear in same row or column?
Which of the following algorithms can be used to find all-pairs shortest paths in a graph?
What is the space complexity of the recursive implementation used to convert a decimal number to its binary equivalent? #include<stdio.h> int arr[31], len = 0; void recursive_dec_to_bin(int n) { if(n == 0 && len == 0) { arr[len++] = 0; return; } if(n == 0) return; arr[len++] = n % 2; recursive_dec_to_bin(n/2); }
The greedy algorithm can find a minimal vertex cover in polynomial time for which among the following?
Which of the following measurement is relative to font-size of the root element?