Procedural Calls Flashcards

1
Q

are considered the most important innovation in the development of programming languages.

A

Procedures

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

is a self-contained computer program that is incorporated into a large program

A

procedure

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Procedures are also known as …

A

subroutines

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Characteristics of a procedure

A
  1. It allows the same piece of code to be used multiple times.
  2. It improves efficient use of storage space in a system.
  3. It allows large programming tasks to be subdivided into smaller units.
  4. It greatly eases the programming tasks.
  5. A procedure call can appear in another procedure, which allows the nesting procedures to an arbitrary depth.
  6. All procedure call is matched by a return instruction in the called program.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

In order to call a procedure from a variety of points, the processor must save the return address so that the return process can take place correctly. The return address can be stored in a …

A

register, start of the called procedure, or at the top of the stack

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

is a procedure that can be implemented in such a way that more than one process can execute it at the same time without any conflict

A

reentrant procedure

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

This branches from the present location to the procedure

A

Call instruction (CALL)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

A … is an instruction to call a procedure that is in the same code segment as the CALL instruction that calls it.

A

Near CALL

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

is used to call a procedure from a different segment

A

Far CALL

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

This instruction pushes the current IP value onto the stack and causes a jump to the entry point of the procedure by placing the address of the entry point in the IP

A

Call Address

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

This instruction pushes the content of the IP onto the stack and jumps to the offset address in the current code segment

A

Call Label (Near)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

This instruction pushes the content of the IP onto the stack and jumps offset address in any memory location

A

Call Label (Far)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

This instruction pushes the content of the IP onto the stack and jumps to the offset address in the memory register of the current code segment

A

CALL Memory (Near)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

This instruction pushes the content of the IP onto the stack and jumps to the offset address of the register at any memory location

A

CALL Memory (Far)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

This returns the control to the place from which a procedure was called

A

Return instruction (RET)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

This instruction returns the address from a near procedure. The return will be done by replacing the instruction pointer (IP) with a word from the top of the stack

A

RET

17
Q

This instruction returns the address from a far procedure. The return will be done by replacing the stack pointer (SP) with a word at the top of the stack.

A

RETF

18
Q
A