GPL - Gate Question |

X Close

You need to enable javascript to view this page properly.

Branch

All

Loading

1.

Consider the function f defined below.
struct item {
int data;
struct item * next;
};
int f(struct item *p) {
return ((p == NULL) || (p ->next == NULL) ||
((p->data <= p -> next -> data) &&
f(p-> next)));
}
For a given linked list p, the function f returns 1 if and only if [2 marks]
(A) the list is empty or has exactly one element
(B) the elements in the list are sorted in non-decreasing order of data value
(C) the elements in the list are sorted in non-increasing order of data value
(D) not all elements in the list have the same data value

last reply by CpjJwWHV • 14 years ago • asked in Computer Science And Engineering, 2003

View Comments [1 Reply]
2.

Consider the C program shown below.
#include <stdio.h>
#define print(x) printf(”%d “, x)
int x;
void Q(int z) {
z += x; print(z);
}
void P(int *y) {
int x = *y+2;
Q(x); *y = x-1;
print(x);
}
main(void) {
x = 5;
P(&x)
print(x);
}
The output of this program is [2 marks]
(A) 12 7 6
(B) 22 12 11
(C) 14 6 6
(D) 7 6 6

last reply by CpjJwWHV • 14 years ago • asked in Computer Science And Engineering, 2003

View Comments [1 Reply]
3.

In the following C program fragment, j, k, n and TwoLog_n are integer variables, and A is an array of integers. The variable n is initialized to an integer ≥3, and TwoLog_n is initialized to the value of 2*Γlog₂n‾|
for (k=3; k <= n; k++)
A[k] = 0;
for (k=2; k <= TwoLog_n; k++)
for (j=k+1; j <= n; j++)
A[j] = A[j] || (j%k);
for (j=3; j <= n; j++)
if (!A[j]) printf(”%d ”,j);
The set of numbers printed by this program fragment is [2 marks]

asked in Computer Science And Engineering, 2003

View Comments [0 Reply]
4.

Consider three data items D1, D2, and D3, and the following execution schedule of transactions T1, T2, and T3. In the diagram, R(D) and W(D) denote the actions reading and writing the data item D respectively.

Which of the following statements is correct? [2 marks]
(A) The schedule is serializable as T2; T3; T1
(B) The schedule is serializable as T2; T1; T3
(C) The schedule is serializable as T3; T2; T1
(D) The schedule is not serializable

asked in Computer Science And Engineering, 2003

View Comments [0 Reply]
5.

Consider the following functional dependencies in a database.
Date_of_Birth -> Age Age -> Eligibility
Name -> Roll_number Roll_number -> Name
Course_number -> Course_name Course_number -> Instructor
(Roll_number, Course_number) -> Grade
The relation (Roll_number, Name, Date_of_birth, Age) is [2 marks]
(A) in second normal form but not in third normal form
(B) in third normal form but not in BCNF
(C) in BCNF
(D) in none of the above

last reply by CpjJwWHV • 14 years ago • asked in Computer Science And Engineering, 2003

View Comments [1 Reply]
6.

Consider the set of relations shown below and the SQL query that follows.
Students: (Roll_number, Name, Date_of_birth)
Courses: (Course number, Course_name, Instructor)
Grades: (Roll_number, Course_number, Grade)
select distinct Name
from Students, Courses, Grades
where Students. Roll_number = Grades.Roll_number
and Courses.Instructor = Korth
and Courses.Course_number = Grades.Course_number
and Grades.grade = A
Which of the following sets is computed by the above query? [2 marks]
(A) Names of students who have got an A grade in all courses taught by Korth
(B) Names of students who have got an A grade in all courses
(C) Names of students who have got an A grade in at least one of the courses taught by Korth
(D) None of the above

asked in Computer Science And Engineering, 2003

View Comments [0 Reply]

85 1 2 3 ›› ... 15

High Frequency Word List with Mnemonics

GPL Dictionary is fast way to learn words with mnemonics.
It contains high frequency word list which are mostly asked in various examinations.
It is dedicated for student appearing for PSUs, GRE, UPSC or any other exams in which vocabulary test is taken.
User can save their own mnemonics (key and link).

Check Now