When a vector has positive divergence, it indicates that the vector quantity has at that point and if the divergence is negative, it indicates __________
The variables in the triggers are declared using
Statements:Some files are not tubs.All buckets are tubs.Some files are mugs.Conclusions:I. Some buckets are files.II. Some files are not buckets.III. Some tubs are not mugs
The ratio of two numbers is 2:3 and the sum of their cubes is 945. The difference of number is
U, V, W, X, Y and Z are six police officers, who are parading in two rows, with three in the front row and three in the back row. Each officer in the back row has one officer exactly in the front of him. W and X are at the extreme ends of two different rows. Y is to the right of U and exactly in front of V. If Z is exactly behind W, then which of the following statements is true
What is the disadvantage of Type-4 Native-Protocol Driver
The person refused to grovel _________ the feet of his master
Statements:Some social workers are generous.Some generous people are rich.Conclusion:I. No social workers is a rich.II. Some rich people are social workers
Statements:All males are children.All children are females.No female is tall.Conclusion:I. All males are females.II. Some children are not tall.III. No male is tall
Statements:Ravi is tall.No tall person is fair.All fair persons are short.Conclusions:I. Ravi is fair.II. Ravi is short.III. Some short are not tall
Statements:All rupees are coins.All coins are minted in the mint.No mint is small.Conclusions:I. All rupees are minted in the mint.II. Some rupees are small.III. No coin is small
Statements All mangoes are sweet.All chocolates are sweet.Conclusions:I. All chocolates are mangoes.II. Some mangoes are chocolates
Statements:Orchids are plants.Bamboos are grasses.Grasses are not trees.Some plants are trees.Conclusions:I. Some Orchids are trees.II. No Bamboo is a tree.III. Some grasses are plants.IV. No grass is a plant
A person wants to visit some places. He starts from a vertex and then wants to visit every place connected to this vertex and so on. What algorithm he should use