You can implement a stack using only a pointer Select one Tr

You can implement a stack using only a pointer

Select one:

True

False

To enforce a precondition you can use the following:

Select one:

a. do a goto

b. More than one answer is correct

c. assert

d. throw an exception

Converting infix to postfix, the operands stay in the same order

Select one:

True

False

You can use a stack for the following except for:

Select one:

a. traverse a linked-list

b. search a map

c. convert infix to postfix

d. no answer is correct

A recursive call to the function will generate an activation record

Select one:

True

False

Solution

1.

Statement : You can implement a stack using only a pointer.

Statement is false.

Reason : Stacks not only implemented using pointers but also use arrays.

2.

To enforce a precondition you can use :

More than one statement is true.

Option b is correct choice.

3.

Statement : Converting infix to postfix, the operands stay in the same order..

The above statement is true.

4.

We can not use a stack for the search a map.

Option b is correct choice.

5.

Statement : A recursive call to the function will generate an activation record.

Statement is true.

In this activation record using recusive call the proces of approach is like last-in-first-out behavior.