Bissoy
Login
Get Advice on Live Video Call
Earn $ Cash $ with
consultations on Bissoy App
What is the problem in the following C declarations?<br><pre><code class="c-program">int func(int);double func(int);int func(float);</code></pre>
A
A function with same name cannot have different signatures
B
A function with same name cannot have different return types
C
A function with same name cannot have different number of parameters
D
All of the mentioned
Correct Answer:
All of the mentioned
"Too often we try to solve human problem with non-human tools and in terms of non-human data. It is my simple thesis that a human problem requires a human solution. First we have to learn to recognise a human problem when we see one; and second, upon recognising it, we have to learn to deal with it as such and not as it were something else. A human problem to be brought to a human solution requires human data and human tools". Who said this?
A
Max Weber
B
FJ Roethlisberger
C
Taylor
D
LD White
Consider the following statements.
1. A transport problem is said to be a balanced problem if the number of origins and destination is equal.
2. Dual theory of simplex method of LP can be used to solve a game theory problem.
3. CPM is often referred to as time cost trade off.
4. Time is not the only variable in PERT.
5. In a single channel queueing models, μ = λ, infinitequeue will build up.
A
Statements 2, 3 and 4 are true, other are not
B
Statements 2, 3 and 5 are true, other are not
C
Statements 1, 2 and 3 are true, other are not
D
All the statements are false
A problem in mathematics is given to three students A, B and C. If the probability of A solving the problem is 1⁄2 and B not solving it is 1⁄4. The whole probability of the problem being solved is 63⁄64 then what is the probability of solving it?
A
1⁄2
B
7⁄8
C
1⁄64
D
1⁄8
The longest increasing subsequence problem is a problem to find the length of a subsequence from a sequence of array elements such that the subsequence is sorted in increasing order and it’s length is maximum. This problem can be solved using __________
A
Recursion
B
Dynamic programming
C
Brute force
D
Recursion, Dynamic programming, Brute force
Given a rod of length n and the selling prices of all pieces smaller than equal to n, find the most beneficial way of cutting the rod into smaller pieces. This problem is called the rod cutting problem. Which of these methods can be used to solve the rod cutting problem?
A
Brute force
B
Dynamic programming
C
Recursion
D
Brute force, Dynamic programming and Recursion
To eliminate the inaccuracy problem in planning problem or partial order planning problem we can use ___________________ data structure/s.
A
Stacks
B
Queue
C
BST (Binary Search Tree)
D
Planning Graphs
Consider the given statement/s to be true and decide which of the given conclusions/assumptions can definitely be drawn from the given statement. Statement: All states having dams face no water problem.
One of the states has no dam. Conclusions: I. It may be facing water problem.
II. Dams solve water problem.
A
Only conclusion I follows
B
Only conclusion II follows
C
Both conclusion I and conclusion II follow
D
Neither conclusion I nor conclusion II follows
Read the passage carefully and choose the best answer to each question out of the four alternatives and click the button corresponding to it.
Dyslexia is a perceptual disorder often occurring in persons of normal, or even above average intelligence. The reader is unable to perceive correctly what is on a page. Letters and numbers often appear reversed: "b" seems to be "d","quite" is "quiet" and "from" is "form". The reader tends to leave out letters or words or insert words or letters that are not there. Vowel and consonant sounds may be confused. Many dyslexics are lefthanded or able to write with either hand. They often confuse left and right. Learning to speak may also be delayed beyond infancy. The condition seems to be inherited. It may persist into adulthood. However, with early recognition and specialized approaches to teaching reading, most dyslexics can learn to read. Some researchers believe that latent dyslexia may be aggravated by the way reading is taught. The modern wholeword, or lookandsay, method seems to be more of a hindrance to learning for dyslexics than it is for ordinary pupils. The phonetic method of teaching students to learn letters and sound them out appears to achieve better reading results. The problem of words that cannot be sounded out such as rough, laugh or through is not solved by phonetics. These words must simply be memorized. However, for children with dyslexia the problem can be compounded by the failure of parents or teachers to recognize the condition. This can easily lead to emotional problems for dyslexic children, who cannot understand their failure to keep up with their classmates.
The problem of perception can be compounded by the failure of parents and teachers to
A
provide treatment
B
recognize the condition
C
correct the child at infancy
D
understand the child
Given an array, check if the array can be divided into two subsets such that the sum of elements of the two subsets is equal. This is the balanced partition problem. Which of the following methods can be used to solve the balanced partition problem?
A
Dynamic programming
B
Recursion
C
Brute force
D
Dynamic programming, Recursion, Brute force
You are given n dice each having f faces. You have to find the number of ways in which a sum of S can be achieved. This is the dice throw problem. Which of the following methods can be used to solve the dice throw problem?
A
Brute force
B
Recursion
C
Dynamic programming
D
Brute force, Recursion and Dynamic Programming