1181. Which statement about MST of G is false?

Data Structures and Algorithms • MST properties • NOV 2017

1182. Worst-case running time of merge-sort on n strings of length n is:

Data Structures and Algorithms • Sorting algorithms • NOV 2017

1183. Which in-order traversal matches the given postorder of BST?

Data Structures and Algorithms • Tree traversals • NOV 2017

1184. Which SQL command changes fields in a record?

Databases • DML • NOV 2017

1185. Match RDBMS integrity types:

Databases • Integrity constraints • NOV 2017

1186. In RDBMS, different classes of relations created to prevent anomalies via?

Databases • Normalization • NOV 2017

1187. In SQL, which is an aggregate function?

Databases • SQL functions • NOV 2017

1188. Which is/are true regarding ‘view’ in DBMS?

Databases • Views • NOV 2017

1189. Find the Boolean product A⊙B of the two matrices.

Discrete Structures and Optimization • Boolean algebra & matrices • NOV 2017

1190. The value of F in the given combinational circuit is:

Discrete Structures and Optimization • Combinational circuits • NOV 2017

1191. Use Kruskal’s algorithm to find a minimal spanning tree for the graph. The list of edges in order chosen is?

Discrete Structures and Optimization • Graph algorithms (MST) • NOV 2017

1192. The Boolean function with the Karnaugh map shown is:

Discrete Structures and Optimization • Karnaugh map simplification • NOV 2017

1193. The Octal equivalent of the binary number 1011101011 is:

Discrete Structures and Optimization • Number systems & conversions • NOV 2017

1194. If the time is now 4 O’clock, what will be the time after 101 hours from now?

Discrete Structures and Optimization • Number systems & modular arithmetic • NOV 2017

1195. How many distinguishable permutations of the letters in the word BANANA are there?

Discrete Structures and Optimization • Permutations & combinations • NOV 2017

1196. Let m=(313)₄ and n=(322)₄. Find the base 4 expansion of m+n.

Discrete Structures and Optimization • Positional number systems • NOV 2017

1197. Negation of the proposition ∃ x H(x) is:

Discrete Structures and Optimization • Predicate logic • NOV 2017

1198. Let P and Q be propositions. ¬(P↔Q) is equivalent to:

Discrete Structures and Optimization • Propositional logic • NOV 2017

1199. Which module gives CPU control to process selected by short-term scheduler?

Operating System • CPU scheduling • NOV 2017

1200. In which disk algorithm does head move end-to-end and return without serving?

Operating System • Disk scheduling • NOV 2017