edited by
11,616 views
24 24 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}$$

4 Answers

Best answer
39 39 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 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
1 flag:
✌ Low quality (Tankut “pointer data type related to dynamic data structure”)
Position:
Show:

Related questions

20 20 votes
2 2 answers
5.7k
5.7k views
Misbah Ghaya asked Nov 23, 2016
5,734 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.
40 40 votes
4 answers 4 answers
20.6k
20.6k views
Misbah Ghaya asked Nov 19, 2016
20,585 views
Match the pairs in the following questions:$$\begin{array}{|ll|ll|} \hline (a) & \text{Lexical analysis} & (p) & \text{DAG's} \\\hline (b) & \text{Code optimization} & (...
6 6 votes
2 answers 2 answers
3.2k
3.2k views
Misbah Ghaya asked Nov 25, 2016
3,199 views
What does the following program output?program module (input, output); var a:array [1...5] of integer; i, j: integer; procedure unknown (var b: integer, var c: integer); ...
32 32 votes
2 answers 2 answers
10.5k
10.5k views
Misbah Ghaya asked Nov 19, 2016
10,452 views
The number of rooted binary trees with $n$ nodes is,Equal to the number of ways of multiplying $(n+1)$ matrices.Equal to the number of ways of arranging $n$ out of $2 n$ ...