When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. List of unsolved problems in computer science - Wikipedia

    en.wikipedia.org/wiki/List_of_unsolved_problems...

    The problem to determine all positive integers such that the concatenation of and in base uses at most distinct characters for and fixed [citation needed] and many other problems in the coding theory are also the unsolved problems in mathematics.

  3. Silly window syndrome - Wikipedia

    en.wikipedia.org/wiki/Silly_window_syndrome

    Silly window syndrome (SWS) is a problem in computer networking caused by poorly implemented TCP flow control. A serious problem can arise in the sliding window operation when the sending application program creates data slowly, the receiving application program consumes data slowly, or both.

  4. Criticism of Java - Wikipedia

    en.wikipedia.org/wiki/Criticism_of_Java

    The Java programming language and Java software platform have been criticized for design choices including the implementation of generics, forced object-oriented programming, the handling of unsigned numbers, the implementation of floating-point arithmetic, and a history of security vulnerabilities in the primary Java VM implementation, HotSpot.

  5. Coding interview - Wikipedia

    en.wikipedia.org/wiki/Coding_interview

    Some questions involve projects that the candidate has worked on in the past. A coding interview is intended to seek out creative thinkers and those who can adapt their solutions to rapidly changing and dynamic scenarios. [citation needed] Typical questions that a candidate might be asked to answer during the second-round interview include: [7]

  6. Readers–writers problem - Wikipedia

    en.wikipedia.org/wiki/Readers–writers_problem

    Therefore, the third readers–writers problem is sometimes proposed, which adds the constraint that no thread shall be allowed to starve; that is, the operation of obtaining a lock on the shared data will always terminate in a bounded amount of time. A solution with fairness for both readers and writers might be as follows:

  7. Multiple inheritance - Wikipedia

    en.wikipedia.org/wiki/Multiple_inheritance

    The "diamond problem" (sometimes referred to as the "Deadly Diamond of Death" [6]) is an ambiguity that arises when two classes B and C inherit from A, and class D inherits from both B and C. If there is a method in A that B and C have overridden , and D does not override it, then which version of the method does D inherit: that of B, or that of C?

  8. Dynamic time warping - Wikipedia

    en.wikipedia.org/wiki/Dynamic_time_warping

    The windows that classical DTW uses to constrain alignments introduce a step function. Any warping of the path is allowed within the window and none beyond it. In contrast, ADTW employs an additive penalty that is incurred each time that the path is warped. Any amount of warping is allowed, but each warping action incurs a direct penalty.

  9. Sleeping barber problem - Wikipedia

    en.wikipedia.org/wiki/Sleeping_barber_problem

    There are several possible solutions, but all solutions require a mutex, which ensures that only one of the participants can change state at once.The barber must acquire the room status mutex before checking for customers and release it when they begin either to sleep or cut hair; a customer must acquire it before entering the shop and release it once they are sitting in a waiting room or ...