Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

In the question two statements are given, followed by two conclusions, I and II. You have to consider the statements to be true even if it seems to beat variance from commonly known facts. You have to decide which of the given conclusions, if any, follows from the given statements. Statement I: All threads are strings. Statement II: All fibres are threads. Conclusion I: All strings are fibres. Conclusion II: All fibres are strings.
In the question two statements are given, followed by two conclusions, I and II. You have to consider the statements to be true even if it seems to beat variance from commonly known facts. You have to decide which of the given conclusions, if any, follows from the given statements. Statement I: All threads are strings Statement II: All fibres are threads Conclusion I: All strings are fibres Conclusion II: All fibres are strings
Two n bit binary strings, S1 and S2 are chosen randomly with uniform probability. The probability that the Hamming distance between these strings (the number of bit positions where the two strings differ) is equal to d is
Which of the following are methods of calculating goodwill?
1. Average profit method
2. Super profit method
3. Log method
4. Sum of years digit method
5. Capitalisation of average profit method
6. Capitalisation of super profit method
7. FIFO method
Select the correct answer:
In PHP, the difference between double quote and single quote is that variables . . . . in single quoted strings whereas they . . . . . in double quoted strings.
Consider the following Deterministic Finite Automaton M. Let S denote the set of eight-bit strings whose second, third, sixth and seventh bits are 1. The number of strings in S that are accepted by M is
Consider the following grammar G: P → Q + R | Q – R | Q | R Q → q | r R → r | s where P, Q, and R are non-terminal symbols, and q, r, and s are terminal symbols. Which of the following statement(s) is/are correct? S1. LL(1) can parse all strings that are generated using grammar G S2. LR(1) can parse all strings that are generated using grammar G
A language with string manipulation facilities uses the following operations. head(s) - returns the first character of the strings tail(s) - returns all but the first character of the strings concat (s1, s2) - concatenates string s1 with s2. The output of concat (head(s), head(tail(tail(s)))), where s is acbc is
Consider the set of strings on {0,1} in which, every substring of 3 symbols has at most two zeros. For example, 001110 and 011001 are in the language, but 100010 is not. All strings of length less than 3 are also in the language. A partially completed DFA that accepts this language is shown below. The missing arcs in the DFA are
Given below are three statements followed by two conclusions । and II. You have to consider the statements to be true even if they seem to be at variance from commonly known facts. Decide which of the conclusions follow from the statements. Statements: 1. No guitar is a violin. 2. All violins are strings 3. No string is metal. Conclusion: I. No string being violin is a possibility. II. Some guitars are not strings.