Computer Science and Information Technology
2017 · Paper 1
Take it one question at a time. Try an answer, then check your understanding.
Complete GATE CSE 2017 Paper 1 overview, original pages and practice · Timed previous-paper practice
Questions 46–48 of 65. Imported answers require review unless explicitly marked reviewed.
Question 46
Open questionCSNAT2 marksNeeds review
Consider a database that has the relation schema CR(StudentName, CourseName). An instance of the schema CR is as given below.
StudentName | CourseName |
|---|---|
SA | CA |
SA | CB |
SA | CC |
SB | CB |
SB | CC |
SC | CA |
SC | CB |
SC | CC |
SD | CA |
SD | CB |
SD | CC |
SD | CD |
SE | CD |
SE | CA |
SE | CB |
SF | CA |
SF | CB |
SF | CC |
The following query is made on the database
The number of rows in
is __________.Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerQuestion 47
Open questionCSNAT2 marksNeeds review
The number of integers between 1 and 500 (both inclusive) that are divisible by 3 or 5 or 7 is __________.
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerQuestion 48
Open questionCSNAT2 marksNeeds review
Let
be an array of 31 numbers consisting of a sequence of 0’s followed by a sequence of 1’s. The problem is to find the smallest index
such that
is 1 by probing the minimum number of locations in
. The worst case number of probes performed by an optimal algorithm is __________.Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer