981. Which relationship sets can’t match the E-R diagram?

Databases • ER Modeling • AUG 2016

982. Correct matching: I.Specialization II.Generalization III.Aggregation IV.Mapping cardinalities to A∪, B#, C⊆, D relationships.

Databases • ER modeling • AUG 2016

983. T1⋈T2 on P=A; left-outer-join; T1⋈T2 on P=A and R=C. Tuple counts?

Databases • Joins • AUG 2016

984. Normalization is NOT for which purpose?

Databases • Normalization • AUG 2016

985. For R(A,B,C) with FDs A→B, C→AB, which true? I. decompose into (C,A)&(A,B) is lossless. II. decompose into (A,B)&(B,C) is lossy.

Databases • Normalization • AUG 2016

986. Which are True for OODBMS vs RDBMS? I. avoids impedance mismatch. II. avoids phantom problem. III. higher concurrency. IV. faster object access.

Databases • Object s • AUG 2016

987. Regarding relational model statements (a),(b),(c), which are true?

Databases • Relational Theory • AUG 2016

988. DBMS lets users access data via which language?

Databases • SQL • AUG 2016

989. Which SQL query on R(A,B) is illegal?

Databases • SQL Grouping • AUG 2016

990. One EXCEPT and EXCEPT ALL cardinalities?

Databases • SQL set operators • AUG 2016

991. The Boolean function ¬(¬p∧q)∧¬(¬p∧¬q) ∨ (p∧r) simplifies to which?

Discrete Structures and Optimization • Boolean Algebra • AUG 2016

992. Which logic operation does this combinational circuit perform?

Discrete Structures and Optimization • Combinational Circuits • AUG 2016

993. The output of the following combinational circuit is :

Discrete Structures and Optimization • Combinational circuits • AUG 2016

994. What is the probability that a random bit-string of length 10 is a palindrome?

Discrete Structures and Optimization • Combinatorics • AUG 2016

995. Match (Controlled Inverter, Full adder, Half adder, Binary adder) to codes a b c d.

Discrete Structures and Optimization • Digital Logic • AUG 2016

996. Evaluate prefix `* + 3 + 3 – 3 + 3 3 3`.

Discrete Structures and Optimization • Expression Evaluation • AUG 2016

997. Given the compound proposition ¬(p∧q) ↔ (¬p∨¬q), what are its prefix and postfix forms?

Discrete Structures and Optimization • Expression Trees • AUG 2016

998. Number of length-4 strings by regex `(0+1+2+3+)*`?

Discrete Structures and Optimization • Formal Languages • AUG 2016

999. Given graphs G₁ and G₂, which has an Euler circuit?

Discrete Structures and Optimization • Graph Theory • AUG 2016

1000. The Karnaugh map simplifies to which Boolean sum?

Discrete Structures and Optimization • K-Map Simplification • AUG 2016