GPL - Gate Question |

X Close

You need to enable javascript to view this page properly.

Branch

All

Loading

25.

Database table by name Loan_Records is given below.

Borrower Bank_Manager Loan_Amount

Ramesh Sunderajan 10000.00

Suresh Ramgopal 5000.00

Mahesh Sunderajan 7000.00

What is the output of the following SQL query?
SELECT count(*)
FROM(
(SELECT Borrower, Bank_Manager FROM Loan_Records) AS S
NATURAL JOIN
(SELECT Bank_Manager, Loan_Amount FROM Loan_Records) AS T
); [2 marks]
(A) 3
(B) 9
(C) 5
(D) 6

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

View Comments [11 Reply]
26.

Consider the two binary operators ‘↑’ and ‘↓’ with the precedence of operator ↓ being lower than that of the operator ↑. Operator ↑ is right associative while operator ↓ is left associative. Which one of the following represents the parse tree for expression (7↓3↑4↑3↓2)? [2 marks]

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

View Comments [4 Reply]
27.

Consider the languages L1, L2 and L3 as given below.
L1 = {0^p1^q | p,q ∈ N}
L2 = {0^p1^q | p,q ∈ N and p =q}
L3 = {0^p1^q0^r | p,q,r ∈ N and p = q = r}
Which of the following statements is NOT TRUE? [2 marks]
(A) Push Down Automata (PDA) can be used to recognize L1 and L2
(B) L1 is a regular language
(C) All the three languages are context free
(D) Turing machines can be used to recognize all the languages

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

View Comments [2 Reply]
28.

On a non-pipelined sequential processor, a program segment, which is a part of the interrupt service routine, is given to transfer 500 bytes from an I/O device to memory.
Initialize the address register
Initialize the count to 500
Loop: Load a byte from device
Store in memory at address given by address register
Increment the address register
Decrement the count
If count ! = 0 go to LOOP
Assume that each statement in this program is equivalent to a machine instruction which takes one clock cycle to execute if it is a non-load/store instruction. The load-store instructions take two clock cycles to execute.
The designer of the system also has an alternate approach of using the DMA controller to implement the same transfer. The DMA controller requires 20 clock cycles for initialization and other overheads. Each DMA transfer cycle takes two clock cycles to transfer one byte of data from the device to the memory.
What is the approximate speedup when the DMA controller based design is used in place of the interrupt driven program based input-output? [2 marks]
(A) 3.4
(B) 4.4
(C) 5.1
(D) 6.7

asked in Computer Science And Engineering, 2011

View Comments [0 Reply]
29.

We are given a set of n distinct elements and an unlabeled binary tree with n nodes. In how many ways can we populate the tree with the given set so that it becomes a binary search tree? [2 marks]
(A) 0
(B) 1
(C) n!
(D) ²ⁿC_n /(n+1)

last reply by CpjJwWHV • 13 years ago • asked in Computer Science And Engineering, 2011

View Comments [2 Reply]
30.

Which one of the following options is CORRECT given three positive integers x, y and z, and a predicate
P(x) = ¬(x=1) Λ ∀y(∃z(x=y*z) ⇒ (y = x) ∨ (y = 1)) [2 marks]
(A) P(x) being true means that x is a prime number
(B) P(x) being true means that x is a number other than 1
(C) P(x) is always true irrespective of the value of x
(D) P(x) being true means that x has exactly two factors other than 1 and x

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

View Comments [1 Reply]

801 1 ...‹‹3 45 6 7 ›› ... 134

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