edited by
8,356 views
17 votes
17 votes
Match the pairs in the following questions:$$\begin{array}{ll|ll}\hline (a) & \text{Pointer data type} & (p) & \text{Type conversion} \\\hline  (b) & \text{Activation record} & (q) & \text{Dynamic data structure} \\\hline   (c) & \text{Repeat-until} & (r)  & \text{Recursion} \\\hline (d) & \text{Coercion} & (s)  & \text{ Nondeterministic loop }  \\\hline \end{array}$$
edited by

3 Answers

Best answer
29 votes
29 votes
$$\begin{array}{|ll|ll|}\hline (a) & \text{Pointer data type} & (q) & \text{Dynamic data structure} \\\hline  (b) & \text{Activation record} & (r) & \text{Recursion} \\\hline   (c) & \text{Repeat-until} & (s)  & \text{Nondeterministic loop} \\\hline (d) & \text{Coercion} & (p)  & \text{Type conversion}  \\\hline \end{array}$$
edited by
7 votes
7 votes
coercion means changing an entity : so Type conversion d-p.

repeat untill - non deterministic loop c-s.

activation record means part of stack  :so recursion.

pointer data type :type conversion

Related questions

17 votes
17 votes
2 answers
1
makhdoom ghaya asked Nov 23, 2016
4,294 views
State whether the following statements are TRUE or FALSE with reason:The Link-load-and-go loading scheme required less storage space than the link-and-go loading scheme.
29 votes
29 votes
3 answers
2
makhdoom ghaya asked Nov 19, 2016
14,264 views
Match the pairs in the following questions:$$\begin{array}{ll|ll} (a) & \text{Lexical analysis} & (p) & \text{DAG's} \\\hline (b) & \text{Code optimization} & (q) & \tex...
21 votes
21 votes
2 answers
4
makhdoom ghaya asked Nov 19, 2016
3,855 views
Match the pairs in the following questions:$$\begin{array}{|ll|ll|}\hline (a) & \text{Groups} & (p) & \text{Associativity} \\\hline (b) & \text{Semigroups} & (q) & \text...