Dark Mode

Answers by Jitendra Verma

1 vote

1

MIT Course
For each group of functions, sort the functions in increasing order of asymptotic (big-O) complexity: ... its an exponential function, but since the power is to 1.000001, it is growing very slowly, since base is tending to 1 only. Someone please check this.

answered in Algorithms May 6, 2017

6.5k views

3 votes

2

solve the recurrence using any method just solve it
T(n) = 100 T (n/99) + log(n!) Answer is T(n) = θ (n log n) a)answer is justified b)answer is not justified c)cannot be determined d)none

answered in Algorithms May 6, 2017

3.0k views

1 vote

3

GATE IT 2008 | Question: 39
Consider a CPU where all the instructions require $7$ clock cycles to complete execution. There are $140$ instructions in the instruction set. It is found that $125$ control signals are needed to be generated by the control unit. While designing the horizontal ... size of the control word and control address register? $125, 7$ $125, 10$ $135, 9$ $135, 10$

answered in CO and Architecture Aug 29, 2016

14.1k views

18 votes

4

GATE CSE 2003 | Question: 4
Let $A$ be a sequence of $8$ distinct integers sorted in ascending order. How many distinct pairs of sequences, $B$ and $C$ are there such that each is sorted in ascending order, $B$ has $5$ and $C$ has $3$ elements, and the result of merging $B$ and $C$ gives $A$ $2$ $30$ $56$ $256$

answered in Combinatory Jul 23, 2016

10.7k views

3 votes

5

MadeEasy Test Series: Operating System - Disk Scheduling
Consider the following disk request sequence for a disk with 100 tracks. 98, 183, 37, 122, 14, 124, 65, 65, 67 Head pointer starting at 53 (current position of R/W heads) and moving in left direction.Find the number of head movements in cylinders using SCAN scheduling.

answered in Operating System Mar 16, 2016

1.7k views