221. Merging log n lists of size n log n each takes time:

Data Structures and Algorithms • Multiway Merge • DEC 2012

222. If T(n)=2T(⌊n/2⌋)+n, then T(n)=

Data Structures and Algorithms • Recurrences • DEC 2012

223. In the given sequential circuit starting 00, after 4 clocks Q1Q0=

Data Structures and Algorithms • Sequential Circuits • DEC 2012

224. Which permutation is achievable with a size-3 stack from 1,2,3,4,5?

Data Structures and Algorithms • Stack Permutations • DEC 2012

225. Max keys in a B-tree of order m and depth d is?

Databases • B-Tree Properties • DEC 2012

226. UWA communicates records between?

Databases • DBMS Interfaces • DEC 2012

227. In DML, RECONNECT cannot be used with which set?

Databases • DML Statements • DEC 2012

228. Which is true about BCNF and 3NF?

Databases • Normal Forms • DEC 2012

229. Query distinct posting pairs with same skill and p1

Databases • SQL Queries • DEC 2012

230. (Duplicate of Q791) Query posting pairs; which SQL?

Databases • SQL Queries • DEC 2012

231. Which abstraction level describes how data are stored?

Databases • DBMS Architecture: Schemas • DEC 2012

232. Referential integrity refers to:

Databases • DBMS Integrity Constraints • DEC 2012

233. Third normal form is based on:

Databases • Normalization: 3NF • DEC 2012

234. For a lossless decomposition R→R₁,R₂, R₁∩R₂→R₁ or R₂ must hold.

Databases • Normalization: Lossless Decomposition • DEC 2012

235. Operation commutative but not associative is?

Discrete Structures and Optimization • Boolean Algebra • DEC 2012

236. Chain letter: each forwards to 4; stops after 100 non-senders. Total seen & senders?

Discrete Structures and Optimization • Tree Counting • DEC 2012

237. Ways to place n distinct objects into k boxes with n_i in box i is

Discrete Structures and Optimization • Combinatorics • DEC 2012

238. The Mandelbrot set uses iteration x_{n+1}=x_n²+z with

Discrete Structures and Optimization • Complex Dynamics • DEC 2012

239. Given graphs A (K₃,₃) and B (K₅), which are planar?

Discrete Structures and Optimization • Graph Theory: Planarity • DEC 2012

240. Solutions to x1+x2+x3=11 with x1≥1,x2≥2,x3≥3 is

Discrete Structures and Optimization • Integer Partitions • DEC 2012