Gujarat Technological University, Computer Engineering, 3rd Sem, Database Management System Papers

Advertisements

The Gujarat Technological University or GTU is a reputed university and has many dignified colleges of the state under it.  The NACC (National Assessment Accreditation Council) has assigned a B++ ranking to GTU. Database Management System is an important subject in the field of technology. It is software that controls the organization, storage, security, integrity and retrieval of data in an organization or institution.

Sectional Division

There is no sectional division in this paper and all the questions are aligned serially.

Pattern Of The Question Paper

The paper carries has no sections or divisions. There are a total of five questions in this paper. Each question in the paper has two sub questions in it and these questions are further subdivided into two or more parts and may contain choices also. The marks of each question are assigned at the end of the question. The marks of these sub parts of the question are not fixed but all the five questions have a total of fourteen marks each.

Marks Allocation

The total mark in this paper is seventy. There are five questions in this paper. All the five questions are of fourteen marks each, summing up to a total of seventy marks. These five questions have two sub questions, each having two or more sub-parts whose marks are not fixed. It may vary from one to seven.

Time Duration

The time allocated for this paper is two and a half hours.

Download Gujarat Technological University, Computer Engineering, 3rd Sem, Database Management System Papers

 
Advertisements







 

Do you have any question? Please ask:

Questions will be answered on our Forum section

3 Responses to “Gujarat Technological University, Computer Engineering, 3rd Sem, Database Management System Papers”

  1. 3
    hetal patel:

    hi,there.i m student of B.E. computer eng. & i want last 3 years paper as per GTU syllabus… my sub. r [maths, phy.,CPU,cs,EME,ECE]

  2. 2
    poonam:

    compute the closure of the following set F of functional dependencies for relation schema r(A,B,C,D,E).
    A->BC
    CD->E
    B->D
    E->A
    list the candidate keys for R.

  3. 1
    ghanashyam:

    pleaseeeeeee i want pgecet previous solved question papers