Dark Mode

Recent activity by Jitendra Verma

2 answers

1

Time complexity

commented in Algorithms May 6, 2017

197 views

1 answer

2

Time complexity
What will be the time complexity of: T(n)=n½ * T(n½) + n ? I tried by substitution by taking m=n^½ but I'm not getting the answer that way.

commented in Algorithms May 6, 2017

202 views

3 answers

3

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

4 answers

4

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.1k views

0 answers

5

Peter Linz Edition 4 Exercise 3.1 Question 5 (Page No. 75)
Find regular expression for $\left \{ a^{n}b^{m}:(n+m)\ is\ even \right \}$.

commented in Theory of Computation Sep 15, 2016

262 views

8 answers

6

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.2k views

4 answers

7

GATE CSE 2004 | Question: 64
Consider the following program segment for a hypothetical CPU having three user registers $R_1, R_2$ and $R_3.$ ... }\\\hline \end{array} The total number of clock cycles required to execute the program is $29$ $24$ $23$ $20$

commented in CO and Architecture Aug 26, 2016

16.0k views

5 answers

8

GATE CSE 2015 Set 3 | Question: 27
Assume that a mergesort algorithm in the worst case takes $30$ seconds for an input of size $64$. Which of the following most closely approximates the maximum input size of a problem that can be solved in $6$ minutes? $256$ $512$ $1024$ $2018$

commented in Algorithms Jul 26, 2016

16.7k views

4 answers

9

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

0 answers

10

How many 8-bit characters can be transmitted per second over a 9600 baud serial communication link?

asked in Computer Networks May 22, 2016

312 views

6 answers

11

GATE CSE 2006 | Question: 67
Consider the relation account (customer, balance) where the customer is a primary key and there are no null values. We would like to rank customers according to decreasing balance. The customer with the largest balance gets rank $1.$ Ties are not broke but ranks are skipped: if ... of the above statements are correct? $2$ and $5$ $1$ and $3$ $1$ and $4$ $3$ and $5$

commented in Databases Apr 24, 2016

16.4k views

2 answers

12

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

1 answer

13

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, 67 Head pointer starting at 53 (current position of R/W heads).Find the number of head movements in cylinders using SSTF scheduling.

answer selected in Operating System Mar 16, 2016

2.9k views

2 answers

14

How many RAM chips & size of decoder required?
How many 256 X 4 RAM chips are required to organize a memory of capacity 32KB ? What is the size of decoder required in this implementation to select a row of chip? Options : (a) 128 , 7 X 128 (b) 256 , 7 X 128 (c) 512 , 7 X 128 (d) 256 , 8 X 256.

commented in CO and Architecture Mar 14, 2016

10.9k views

2 answers

15

MadeEasy Test Series: Operating System - Process Synchronization
Description of Peterson's Algorithm & also for which problem it is used to solve (1) deadlock (2) mutual exclusion (3) Thrashing (4) Paging.

asked in Operating System Mar 11, 2016

2.6k views