GPL - Gate Question |

X Close

You need to enable javascript to view this page properly.

Branch

All

Loading

667.

A computer system uses 32-bit virtual address, and 32-bit physical address. The physical memory is byte addressable, and the page size is 4 kbytes. It is decided to use two level page tables to translate from virtual address to physical address. Equal number of bits should be used for indexing first level and second level page table, and the size of each page table entry is 4 bytes.
(a) Give a diagram showing how a virtual address would be translated to a physical address.
(b) What is the number of page table entries that can be contained in each page?
(c) How many bits are available for storing protection and other information in each page table entry?
[5 marks]

asked in Computer Science And Engineering, 2002

View Comments [0 Reply]
668.

The following table refers to search times for a key in B-trees and B⁺-trees.

B-tree
B-tree
B⁺-tree B⁺-tree

Successful Search
Unsuccessful search
Successful Search
Unsuccessful search

X₁ X₂ X₃ X₄

A successful search means that the key exists in the database and unsuccessful means that it is not present in the database. Each of the entries X₁, X₂, X₃ and X₄ can have a value of either Constant or Variable. Constant means that the search time is the same, independent of the specific key value, where Variable means that it is dependent on the specific key value chosen for the search.
Give the correct values for the entries X₁, X₂, X₃ and X₄ (for example X₁ = Constant, X₂= Constant, X₃ = Constant, X₄= Constant).

(b) Relation R(A,B) has the following view defined on it:
CREATE VIEW V AS
(SELECT R1.A,R2.B
FROM R AS R1, R AS R2
WHERE R1.B=R2.A)
(i) The current contents of relation R are shown below. What are the contents of the view V?

A B

1 2

2 3

2 4

4 5

6 7

6 8

9 10

(ii) The tuples (2,11) and (11,6) are now inserted into R. What are the additional tupels that are inserted in V?
[5 marks]

asked in Computer Science And Engineering, 2002

View Comments [0 Reply]
669.

For relation R = (L, M, N , O, P), the following dependencies hold:
M -> O, NO -> P, P -> L and L -> MN
R is decomposed into R₁ =(L, M, N , P) and R₂ = (M, O).
(a) Is the above decomposition a lossless-join decomposition? Explain.
(b) Is the above decomposition dependency-preserving? If not, list all the dependencies that are not preserved.
(c) What is the highest normal form satisfied by the above decomposition?
[5 marks]

asked in Computer Science And Engineering, 2002

View Comments [0 Reply]
670.

A university placement center maintains a relational database of companies that
interview students on campus and make job offers to those successful in the interview. The schema of the database is given below:
COMPANY (cname, clocation) STUDENT (scrollno, sname, sdegree)
INTERVIEW (cname, srollno, idate) OFFER (cname,srollno, osalary)
The COMPANY relation gives the name and location of the company. The STUDENT relation gives the student’s roll number, name and the degree program for which the student is registered in the university. The INTERVIEW relation gives the date on which a students is interviewed by a company. The OFFER relation gives the salary offered to a student who is successful in a company’s interview. The key for each relation is indicated by the underlined attributes.
(a) Write relational algebra expressions (using only the operator ⋈,σ,π,∪,- )
for the following queries:
(i) List the rollnumbers and names of those students who attended at least one interview but did not receive any job offer.
(ii) List the rollnumbers and names of students who went for interviews and received job offers from every company with which they interviewed.
(b) Write an SQL query to list, for each degree program in which more than five students were offered jobs, the name of the degree and the average offered salary of students in this degree program.
[5 marks]

asked in Computer Science And Engineering, 2002

View Comments [0 Reply]
671.

The aim of the following question is to prove that the language {M | M is the code of a Turing Machine which, irrespective of the input, halts and outputs a 1}, is undecidable. This is to be done by reducing form the language {M', x M' halts on x}, which is known to be undecidable. In parts (a) and (b) describe the 2 main steps in the construction of M. in part (c) describe the key propery which relates the behaviour of M on its input w to the behaviour of M' on x.
(a) On input w, what is the first step that M must make?
(b) On input w, based on the outcome of the first step, what is the second step that M must make?
(c) What key property relates the behaviour of M on w to the behaviour of M' on x?
[5 marks]

asked in Computer Science And Engineering, 2002

View Comments [0 Reply]
672.

(a) In how many ways can a given positive integer n ≥ 2 be expressed as the sum of 2 positive integers (which are not necessarily distinct). For example, for n = 3, the number of ways is 2, i.e., 1+2, 2+1. Give only the answer without any explanation.
(b) In how many ways can a given positive integer n ≥ 3 be expressed as the sum of 3 positive integers (which are not necessarily distinct). For example, for n = 4, the number of ways is 3, i.e., 1+2+1, 2+1+1. Give only the answer without any explanation.
(c) In how many ways can a given positive integer n ≥ k be expressed as the sum of k positive integers (which are not necessarily distinct)? Give only the answer without explanation.
[5 marks]

asked in Computer Science And Engineering, 2002

View Comments [0 Reply]

801 1 ...‹‹110 111112 113 114 ›› ... 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