List of top Questions asked in AP PGECET

Based on the following schema,
sailors (sailor-id, sailpr-name, age):
boats (boat-id, boat-name, colour):
reserves (sailor id, boat id, day);
What does the following SQL query imply?
SELECT S.sailor_name FROM sailors S WHERE S.sailor_id IN
(SELECT R.sailor_id FROM reserves R WHERE R.boat_id >= 103);

End to end connectivity is provided from host to host in which one of the following layers?
Maximum data rate of a channel for noiseless 3 kHz binary channel is
The Hamming distance between 11001011 and 10000111 is
To verify a digital signature, we need the ..........

Match the following:
"Physical layer & e. Bit ii. & Data link layer & d. Frame iii. & Network layer & b. Datagram "

In the standard Ethernet, if the maximum propagation time is 25.6 µs, then the minimum size of the frame is
The network topology with highest reliability is
Which among the following protocols uses UDP as a transport layer protocol?
a. FTP b. SNMP c. SMTP d. TFTP e. HTTP
Based on the following schema,
sailors (sailor-id, sailpr-name, age):
boats (boat-id, boat-name, colour):
reserves (sailor id, boat id, day);
Which of the following SQL queries returns all the ages of sailors whose names begin and end with ‘B’ and have at least three characters?
The concept of serializability in a database management system is related to
The method of linear probing is related to which one of the following?
In a DBMS, a candidate which is not a primary key is called
In an RDBMS, data is represented as a set of
If a relation is in BCNF, then it is in
Referential integrity refers to which one of the following?
The number of CODD rules which characterize an RDBMS is
Which one of the following is not an operating system?
Which of the following is not a DBMS?
Order the following complexities in the increasing order: $ O(n^2), O(n^3), O(\log n), O(n \log n) $
Which one of the following statements is true?
Which of the following problems is in P?
A problem P is known to be NP-complete and Q and R are two problems such that Q is polynomial time reducible to P and P is polynomial time reducible to R. Which one of the following is true?
The Travelling Salesman’s is an example of which of the following class of problems?
Which of the following is an example of divide and conquer strategy?