ComputerSciencePaperIIIJune2016 (10-7-2016)

UGC NET Previous Year Papers

COMPUTER SCIENCE AND APPLICATIONS

Paper III – June 2016 (10-7-2016)

1.    Which of the following is a sequential circuit ?

(1) Multiplexer

(2) Decoder

(3) Counter

(4) Full adder

Ans: (3)

 

2. 8085 microprocessor has _____ hardware interrupts.

(1) 2

(2) 3

(3) 4

(4) 5

Ans: (4)

 

3. Which of the following in 8085 microprocessor performs

HL = HL + DE ?

(1) DAD D

(2) DAD H

(3) DAD B

(4) DAD SP

Ans: (1)

 

4. The register that stores all interrupt requests is :

(1) Interrupt mask register

(2) Interrupt service register

(3) Interrupt request register

(4) Status register

Ans: (3)

 

5. The _____ addressing mode is similar to register indirect addressing mode, except that an offset is added to the contents of the register. The offset and register are specified in the instruction.

(1) Base indexed

(2) Base indexed plus displacement

(3) Indexed

(4) Displacement

Ans: (4)

 

6. In _____ method, the word is written to the block in both the cache and main memory, in parallel.

(1) Write through

(2) Write back

(3) Write protected

(4) Direct mapping

Ans: (1)

 

7. Which of the following statements concerning Object-Oriented databases is FALSE ?

(1) Objects in an object-oriented database contain not only data but also methods for processing the data.

(2) Object-oriented databases store computational instructions in the same place as the data.

(3) Object-oriented databases are more adapt at handling structured (analytical) data than relational databases.

(4) Object-oriented databases store more types of data than relational databases and access that data faster.

Ans: (3)

 

8. In distributed databases, location transparency allows for database users, programmers and administrators to treat the data as if it is at one location. A SQL query with location transparency needs to specify :

(1) Inheritances

(2) Fragments

(3) Locations

(4) Local formats

Ans: (2)

 

9. Consider the relations R(A, B) and S(B, C) and the following four relational algebra queries over R and S :

I.    ΠA, B (R ⋈ S)

II.   R ⋈ ΠB(S)

III. R ∩ (ΠA(R) × ΠB(S))

IV.  Π A,R.B (R × S) where R⋅B refers to the column B in table R.

One can determine that :

(1) I, III and IV are the same query.

(2) II, III and IV are the same query.

(3) I, II and IV are the same query.

(4) I, II and III are the same query.

Ans: (4)

 

10. Which of the following statements is TRUE ?

D1 : The decomposition of the schema R(A, B, C) into R1(A, B) and R2 (A, C) is always lossless.

D2 : The decomposition of the schema R(A, B, C, D, E) having AD → B, C → DE, B → AE and AE → C, into R1 (A, B, D) and R2 (A, C, D, E) is lossless.

(1) Both D1 and D2

(2) Neither D1 nor D2

(3) Only D1

(4) Only D2

Ans: (4)

 

Pages: 1 2 3 4 5 6 7 8