Prep Hub

UGC NET PAPER 2 COMPUTER SCIENCE – SET 56

UGC NET PAPER 2 COMPUTER SCIENCE – SET 56

Period: JULY 2016


1101. (A) BI/DW used for forecasting and data mining; (B) BI/DW used for analysis of large sales data. Which?

Databases • Data Warehousing & BI • JULY 2016


1102. Which of the following is a semi-join technique?

Databases • Distributed Query Processing: Semi-joins • JULY 2016


1103. In distributed s, location transparency allows users to treat the data as if at one location. A SQL query with location transparency needs to specify:

Databases • Distributed s: Location Transparency • JULY 2016


1104. Given candidate keys {B}, {B,C}, {A,D}, {C,D}, which could not be a key if all attribute symbols are distinct?

Databases • Keys and Superkeys • JULY 2016


1105. Which statement is TRUE? D1: decomposition of R(A,B,C) into R1(A,B) and R2(A,C) is always lossless; D2: decomposition of R(A,B,C,D,E) with AD→B, C→DE, B→AE, AE→C into R1(A,B,D) and R2(A,C,D,E) is lossless.

Databases • Normalization & Lossless Decomposition • JULY 2016


1106. In a relational model, NULL values cannot be used to:?

Databases • Null Semantics • JULY 2016


1107. Which is FALSE about OODB? Objects contain data and methods; They store instructions with data; They handle analytical data better than relational; They store more types and access faster.

Databases • Object-Oriented s • JULY 2016


1108. Consider R(A,B) and S(B,C) and these relational‐algebra queries: I. ΠA,B(R⋈S) II. R⋈ΠB(S) III. R∩(ΠA(R)×ΠB(S)) IV. ΠA,R.B(R×S). Which queries are equivalent?

Databases • Relational Algebra Equivalences • JULY 2016


1109. Which is FALSE in RDBMS: I. Views help access control; II. E-R diagrams model concepts; III. Update anomaly stores unrelated info; IV. SQL is procedural?

Databases • Relational Concepts • JULY 2016


1110. Consider C1: `DROP TABLE R;` C2: `DELETE FROM R;` Which is TRUE: I. Both delete schema; II. C2 retains schema; III. C1 deletes schema?

Databases • SQL Data Definition vs Manipulation • JULY 2016


1111. Given R(A,B,C) and S(B,C,D): R={(1,1,10),(2,2,20),(3,3,30),(4,4,40)}, S={(1,1,100),(2,2,200),(5,5,500)}. SQ1: NATURAL JOIN, SQ2: INNER JOIN USING(B,C). Tuples M,N?

Databases • SQL Joins • JULY 2016


1112. Which of the following XOR identities is incorrect?

Discrete Structures and Optimization • Boolean Algebra – XOR • JULY 2016


1113. Simplify F(x,y,z) given 000→0,001→1,010→0,011→1,100→1,101→0,110→1,111→0.

Discrete Structures and Optimization • Boolean Simplification • JULY 2016


1114. The simplified form of (ĀB + ĀBC + AC)(ĀC + B̄) is?

Discrete Structures and Optimization • Boolean Simplification • JULY 2016


1115. How many full parenthesizations for `A ∩ B – A ∩ B – A`?

Discrete Structures and Optimization • Combinatorics – Parenthesizations • JULY 2016


1116. n-vertex convex polygon triangulation uses T chords and yields triangles. T=?, triangles=?

Discrete Structures and Optimization • Computational Geometry • JULY 2016


1117. Number of spanning trees in K₄ and K₂,₂ respectively?

Discrete Structures and Optimization • Graph Theory • JULY 2016


1118. A clique in a simple undirected graph is a complete subgraph not contained in any larger one. How many cliques are there in the graph shown?

Discrete Structures and Optimization • Graph Theory – Cliques • JULY 2016


1119. Feasible region of LP has _____ property.

Discrete Structures and Optimization • Linear programming • JULY 2016


1120. Number of equivalence relations with exactly 3 classes on 5 elements?

Discrete Structures and Optimization • Partitions • JULY 2016



Disclaimer for MCQ Quiz
This quiz is for educational purposes only…

0 0 votes
Article Rating
Subscribe
Notify of
guest
0 Comments
Oldest
Newest Most Voted
Inline Feedbacks
View all comments
Scroll to Top