UGC NET CS 2016 Aug – III


Question 1
A ripple counter is a (n):
A
Synchronous Counter
B
Asynchronous counter
C
Parallel counter
D
None of the above
Digital Logic & Number representation    UGC NET CS 2016 Aug - III    Sequential circuits    
Discuss it


Question 1 Explanation: 
A ripple counter is an Asynchronous counter. For more information Refer:Counters in Digital Logic Option (B) is correct.
Question 2
8085 microprocessor has ____ bit ALU.
A
32
B
16
C
8
D
4
Microprocessor    UGC NET CS 2016 Aug - III    
Discuss it


Question 2 Explanation: 
8085 microprocessor has 8 bit ALU. 8086 microprocessor has 16 bit ALU. So, option (C) is correct.
Question 3
The register that stores the bits required to mask the interrupts is ______.
A
Status register
B
Interrupt service register
C
Interrupt mask register
D
Interrupt request register
Computer Organization and Architecture    UGC NET CS 2016 Aug - III    CPU control design and Interfaces    
Discuss it


Question 3 Explanation: 
The register that stores the bits required to mask the interrupts is Interrupt mask register. The register that stores the bits required for Status is Status register The register that stores the bits required to service the interrupts is Interrupt service register The register that stores the bits required to request the interrupts is Interrupt request register So, option (C) is correct.
Question 4
Which of the following in 8085 microprocessor performs HL = HL + HL?
A
DAD D
B
DAD H
C
DAD B
D
DAD SP
Microprocessor    UGC NET CS 2016 Aug - III    
Discuss it


Question 4 Explanation: 
DAD will perform Double addition (16 bit) between HL pair and any other pair of register. Among HL, BC, DE and SP; B, H and D register will be used first. So, DAD H will do HL = HL + HL; DAD B will do HL = HL + BC; DAD D will do HL = HL + DE; SP is stack pointer and it is not a pair register, DAD SP will do HL = HL + SP; So, option (B) is correct.
Question 5
In ______ addressing mode, the operands are stored in the memory. The address of the corresponding memory location is given in a register which is specified in the instruction.
A
Register direct
B
Register indirect
C
Base indexed
D
Displacement
Computer Organization and Architecture    UGC NET CS 2016 Aug - III    CPU control design and Interfaces    
Discuss it


Question 5 Explanation: 
In register indirect addressing mode, the operands are stored in the memory. The address of the corresponding memory location is given in a register which is specified in the instruction. For more information on addressing mode Refer:Addressing Modes Option (B) is correct.
Question 6
The output of the following combinational circuit 6 (1) is:
A
X . Y
B
X + Y
C
X ⊕ Y
D
(X ⊕ Y)`
Digital Logic & Number representation    UGC NET CS 2016 Aug - III    Combinational Circuits    
Discuss it


Question 6 Explanation: 
6 (2) So, option (D) is correct.
Question 7
Which of the following statements is/are True regarding some advantages that an object-oriented DBMS (OODBMS) offers over a relational database ? I. An OODBMS avoids the “impedance mismatch” problem. II. An OODBMS avoids the “phantom” problem. III. An OODBMS provides higher performance concurrency control than most relational databases. IV. An OODBMS provides faster access to individual data objects once they have been read from disk.
A
II and III only
B
I and IV only
C
I, II, and III only
D
I, III and IV only
Database Design(Normal Forms)    UGC NET CS 2016 Aug - III    
Discuss it


Question 7 Explanation: 
  • An OODBMS avoids the “impedance mismatch” problem.Correct.
  • An OODBMS doesn't avoids the “phantom” problem.
  • An OODBMS doesn't provides higher performance concurrency control than most relational databases. Since it is distributed.
  • An OODBMS provides faster access to individual data objects once they have been read from disk.Correct
  • SO, option (B) is correct.
Question 8
The Global conceptual Schema in a distributed database contains information about global relations. The condition that all the data of the global relation must be mapped into the fragments, that is, it must not happen that a data item which belongs to a global relation does not belong to any fragment, is called:
A
Disjointness condition
B
Completeness condition
C
Reconstruction condition
D
Aggregation condition
UGC NET CS 2016 Aug - III    
Discuss it


Question 8 Explanation: 
The condition that all the data of the global relation must be mapped into the fragments, that is, it must not happen that a data item which belongs to a global relation does not belong to any fragment, is called Completeness condition. In distributed system it is convenient that fragment to be disjoint, so that the replication of data can be controlled explicitly at the allocation level.this is called Disjointness condition To reconstruct any global relation from its fragment is called Reconstruction condition. The formation of no. of fragments into a cluster is called Aggregation condition. So, option (B) is correct.
Question 9
Suppose database table T1(P, R) currently has tuples {(10, 5), (15, 8), (25, 6)} and table T2 (A, C) currently has {(10, 6), (25, 3), (10, 5)}. Consider the following three relational algebra queries RA1, RA2 and RA3: RA1 : T1T1.P = T2.A T2 where ⨝is natural join symbol RA2 : T1T1.P = T2.A T2 where ⟕ is left outer join symbol RA3 : T1T1.P = T2.A and T1.R = T2.CT2 The number of tuples in the resulting table of RA1, RA2 and RA3 are given by:
A
2, 4, 2 respectively
B
2, 3, 2 respectively
C
3, 3, 1 respectively
D
3, 4, 1 respectively
ER and Relational Models    UGC NET CS 2016 Aug - III    
Discuss it


Question 9 Explanation: 
RA1 : T1T1.P = T2.A T2 where ⨝is natural join symbol. It will result 3 tuples:
P = A R C
10 5 6
10 5 5
25 6 3
RA2 : T1T1.P = T2.A T2 where ⟕ is left outer join symbol. It will rewult in 4 tuples.
P = A R C
10 5 6
10 5 5
15 8 Null
25 6 3
RA3 : T1T1.P = T2.A and T1.R = T2.CT2. It will result in 1 tuple.
P = A R = C
10 5
So, option (D) is correct.
Question 10
Consider the table R with attributes A, B and C. The functional dependencies that hold on R are : A → B, C → AB. Which of the following statements is/are True ? I. The decomposition of R into R1(C, A) and R2(A, B) is lossless. II. The decomposition of R into R1(A, B) and R2(B, C) is lossy.
A
Only I
B
Only II
C
Both I and II
D
Neither I nor II
Transactions and concurrency control    UGC NET CS 2016 Aug - III    
Discuss it


Question 10 Explanation: 
Decomposition of R into R1(C, A) and R2(A, B) is lossless. Because C → A, A → B. So, C → AB can be derived and there is no loss. Decomposition of R into R1(A, B) and R2(B, C) is lossy. Because A → B, C → B are derived but we can't derive C → AB, So it is lossy. So, option (C) is correct.
There are 75 questions to complete.


My Personal Notes arrow_drop_up


Writing code in comment? Please use ide.geeksforgeeks.org, generate link and share the link here.