Recent content by 22990atinesh

  1. 22990atinesh

    Approximating logarithmic series

    Thanks Everybody I get it :)
  2. 22990atinesh

    Approximating logarithmic series

    logarithm is base 2
  3. 22990atinesh

    Approximating logarithmic series

    Actually I've seen lots of places where they have done it See the below link at example the guy has done the same thing http://clrs.skanev.com/04/problems/03.html
  4. 22990atinesh

    Approximating logarithmic series

    Please check this link http://sarielhp.org/teach/2003/b_273/notes/12_recc.pdf
  5. 22990atinesh

    Approximating logarithmic series

    Can anybody tell me how this is possible
  6. 22990atinesh

    Solving recurrence by changing variables

    Consider the below recurrence ##T(n) = 2 T(\sqrt(n)) + \log n## substituting ##\log n = m \implies n = 2^m## ##T(2^m) = 2 T(2^{\frac{m}{2}}) + m## substituting ##S(k) = T(2^m)## I'm getting below equation ##S(k) = 2 S(\frac{k}{2}) + m## How can I change 'm' to 'k' in above equation.
  7. 22990atinesh

    How to calculate Clock Skew of nodes in a distributed system

    How do you come up with 200 μs, that's what I'm not getting. Can you please elaborate your procedure.
  8. 22990atinesh

    Numerical Problem on Processor Pool Model

    Consider the case of a distributed computing system based on the processor-pool model that has ##P## processors in the pool. In this system, suppose a user start a computing job that involves compilation of a program consisting of ##F## source file ##(F < P)##. Assume that at this time the user...
  9. 22990atinesh

    How to calculate Clock Skew of nodes in a distributed system

    Can you please elaborate it little bit more How you have calculated clock skew. First of all : I think Clock Skew should be 200 ms in place of 200 μs. Secondly: By your method, I'm getting maximum clock skew as 0.56 s by considering ##N_2## and ##N_3## Thirdly: Can I use this method Maximum...
  10. 22990atinesh

    How to calculate Clock Skew of nodes in a distributed system

    A distributed system has 3 nodes ##N_1##, ##N_2## and ##N_3##, each having its own clock. The clocks of nodes ##N_1##, ##N_2## and ##N_3## tick 800, 810 and 795 times/ms. The system uses the external synchronization mechanism, in which all 3 nodes receive the real time every 30 seconds from...
  11. 22990atinesh

    How to prove that (log logn)×(log log log n) = Ω(logn)

    Is ##\log \log n \times \log \log \log n = \Omega(\log n)## How can we prove it. Actually I'm trying to prove that ##f(n) = \lceil(\log \log n)\rceil !## is polynomially bounded. It means ##c_1 n^{k_1} \leq f(n) \leq c_2 n^{k_2} \quad \forall n > n_0## ##m_1 \log n \leq \log [f(n)] \leq m_2...
  12. 22990atinesh

    Prove Set Identity: A⋂(B⊕C)=(A⋂B)⊕(A⋂C)

    I understand your approach. But I want to prove it through Set identities.
  13. 22990atinesh

    Prove Set Identity: A⋂(B⊕C)=(A⋂B)⊕(A⋂C)

    Homework Statement Prove that ##A\cap(B\Delta C)=(A\cap B)\Delta(A\cap C)## Homework EquationsThe Attempt at a Solution [/B] L.H.S.=##A\cap(B\Delta C)## =##A\cap[(B - C) \cup (C - B)]## =##A\cap[(B \cap \bar{C}) \cup (C \cap \bar{B})]## =##[A\cap (B \cap \bar{C})] \cup [A\cap (C \cap...
  14. 22990atinesh

    Counting Problem : A code consists of at-most two....

    Homework Statement A code consists of at-most two identical letters followed by at-most four identical digits. The code must have atleast one letter and one digit. How many distinct codes can be generated using letters A-Z and digits 1-9. Homework EquationsThe Attempt at a Solution //One...
  15. 22990atinesh

    Find Value of I in Ohm's Law Circuit

    Homework Statement In the circuit shown the value of I in ampere is [img=http://s28.postimg.org/5adobnb95/Capture.jpg] Homework Equations ## V = I R ## The Attempt at a Solution Leaving 4 ohm above resistor Equivalent R will be ##R_{eq} = \frac{4*4}{4+4} + 4 + 1.6 = 7.6## ##I = \frac{V}{R}##...
Back
Top