Match the pairs in the following:

List - I

(a) Heap construction
(b) Constructing hash table witn linear probing
(c) AVL Tree construction
(d) Digital tree construction

List - II

(p) $$\Omega \left( {n\log _{10}^n} \right)$$
(q) O(n)
(r) O(n²)
(s) $$\Omega \left( {n\log _2^n} \right)$$

Match the following:

List - I

(a) Lexical Analysis
(b) Code Optimization
(c) Code Generation
(d) Abelian Group

List - II

(p) DAG's
(q) Syntax trees
(r) Push Down automata
(s) Finite automata

Match the followings:

Group-I

(a) Pointer data type
(b) Activation Record
(c) Repeat -Until
(d) Coercion

Group-II

(p) Type Conversion
(q) Dynamic Data Structure
(r) Recursion
(s) Nondeterministic loop

A block -set associative cache memory consists of $$128$$ blocks divided into four block sets. The main memory consists of $$16,384$$ blocks and each blocks contains $$256$$ eight bit words.

(i) How many bits are required for addressing the main memory?

(ii) How many bits are needed to represent the TAG, SET and WORD fields?