Success in any field comes only through dedicated efforts and continuous practice. Now, when the question comes to education, the fruits of success are directly proportional to efforts put in. There is hardly anybody who does not wish to get top scores and bag their dream institution, when it comes to GATE exams. For this, only slogging won’t do. There has to be something more that will set you apart from the rest of the crowd. The smartest trick to crack the GATE is, to prepare you with online mock examinations. There are scores of websites that offer various programs under GATE online mock tests. These exams are conducted online and evaluated by experts. The results of these mock exams helps you estimate where you stand against the whole horde of competitors. These mock tests are carefully prepared in the same pattern as the original GATE exams and carefully chart out the possible level of difficulty that should be expected from the papers. Some online companies also categorize their exams in various levels so that a student can gradually move up as he progresses with his preparation. These mock tests are also classified into various subjects such that, a student can choose his preferred area of strength and weakness and evaluate himself accordingly.
Congratulations - you have completed GATE CSE Online Mock Test. You scored 0 points out of 5. Your performance have been rated as 'Failed' Your obtained grade is 'None'
C onsider the following logical inferences. I1: If it rains then the cricket match will not be played. The cricket match was played. Inference: There was no rain. I2: If it rains then the cricket match will not be played. It did not rain. Inference: The cricket match was played. Which of the following is TRUE?
- Both I1 and I2 are correct inferences
- I1 is correct but I2 is not a correct inference
- I1 is not correct but I2 is a correct inference
- Both I1 and I2 are not correct inferences
Which of the following is TRUE?
- Every relation in 3NF is also in BCNF
- A relation R is in 3NF if every non-prime attribute of R is fully functionally dependent on every key of R
- Every relation in BCNF is also in 3NF
- No relation can be in both BCNF and 3NF
Assuming P ≠ NP, which of the following is TRUE? (B) NP-complete ∩ P =
- NP-complete = NP
- NP-complete ∩ P =
- NP-hard = NP
- P = NP-complete
T he worst case running time to search for an element in a balanced binary search tree with n2n elements is
- Θ (n log n)
- Θ (n2n)
- Θ (n)
- Θ (log n)
- A
- B
- C
- D
No comments:
Post a Comment