Home / MCQ Bank / Computer

Computer Modules And Mixins In Ruby Difficulty: Medium

Consider the brute force implementation of the rod cutting problem in which all the possible cuts are found and the maximum value is calculated. What is the time complexity of this brute force implementation? What is the size of *ptr in a 32-bit machine (Assuming initialization as int *ptr = 10;)? What does Rhino do when the getter and setter methods exist? What is the byte capacity of a drum which is 5 inch high, 10 inch diameter, and which has 60 tracks per inch and bit density of 800 bits per inch? What are the updated values of high and low in the array if the element being searched is lower than the value at calculated index in interpolation search? (pos = current position)