Other Math Answers

a 20 kbps device is connected to a processor. the interrupt overhead is 10 microseconds. what is the minimum performance achieved when interrupt initiated data transfer is used instead of programmed i/o?

Which of the following is a regular language?
(A) L1 = Set of balanced parenthesis where alphabet sigma={(,)}
(B) L2 = Set of all unary strings |sigma| = 1 of lengths equal to Fibonacci numbers
greater than 5 (i.e. 8, 13, 21, . . . .)
(C) L3 = Kleene closure of the language in option (B)
(D) None of these

A two level memory is having 140 ns average access time without the level and 30 ns with level. If the fastest memory access time is 20 ns the what will be the hit ratio?

Determine the deflection u (x, t) of a vibrating string of length L, which has its ends fixed,
corresponding to a zero initial velocity and an initial deflection given by the function
f(x)=A(x) for 0<=X<=L/4
=AL/4 for L/4<=X<=3L/4
=A(L-X) for 3L/4<=X<=L

A cylinder with a diameter 1.0 m is stands in water with its axis vertical. When depressed
slightly and released, it oscillates with a time period of 2 s. Determine the mass of the
cylinder.

A two level memory is having 140ns average access time without the level 30ns with level. If the fastest memory access time is 20ns. What is hit ratio?

show that the curvilinear coordinate system defined by the following equation is orthogonal :
X=UVcosA
Y=UVsinA
Z=(u^2-v^2)/2

Which of the following problems is decidable?
a. whether the tape alphabet has at least two symbols
b. whether a turing machine with 12 tapes will accept an infinite set
c. for ever string w the turing machine accepts it also accepts w^R.
d. whether a turing machine will ever print three consecutive 1′s

Which of the following problems is decidable?
a. whether a turing machine ever leaves a particular cell it it scanning
b.whether a turing machine started on blank tape will ever halt
c. whether a turing machine accepts at least two strings
d. whether a turing machine accepts a finite set

Whcih of the following problems is decidable?
a. whether a turing machine has at least three states
b. whether a turing machine will ever halt
c. whether a turing machine will ever print a symbol
d. whether a turing machine will ever enter a designated state