progweek3

Question 1

looping

Answer 1

the repetition of the same procees multiple
times until a specific condition is satisfied, then it will stop.
Actually, looping can simplify complex problems into simple ones.

Question 2

while loops, does or does not depend upon the number of iterations?

Answer 2

does not

Question 3

Recursion is

Answer 3

a programming technique in which a function calls itself.

Question 4

In recursion, there is a _ that is (are) tested for
_.

Answer 4

base case (or cases)

upon entry to the function

Question 5

In recursion, there is a _ step (or steps) in which one of the variables is
_ in a way that will lead to the base case.

Answer 5

recursive

passed as an argument

Question 6

The structure type allows us to :

Answer 6

aggregate variables of different types.

Question 7

A header file is

Answer 7

a file with extension .h which contains C function
declarations and macro definitions to be shared between several source
files.

Question 8

here are two types of header files:

Answer 8

files that the programmer writes, and

files that comes with your compiler.

Question 9

In the C language, structures can be _ to functions
and can be _.
You can pass to a self-defined function:

Answer 9

passed as arguments

returned from them

individual members,
an entire structure,
or a pointer to the structure.

Question 10

Abstraction is

Answer 10

a key mechanism that helps to solve problems in general
and to write cleaner, safer, and simpler programs.

Question 11

Computer systems are essentially :

Answer 11

stratifications of layers of abstraction

Question 12

The logic gates in our physical machine take _.

Answer 12

continuous signals and
produce a system which works in binary.

Question 13

The operating systems creates _.

Answer 13

an abstraction of the physical
machine (e.g., providing an abstract version of the memory of the
system, of each device, etc.).

Question 14

Modularization:

Answer 14

When we have a medium/big problem we want to decompose it in
subproblems and use di↵erent modules to solve each subproblem.
These modules then cooperate to solve the original problem.

Question 15

There are essentially two ways to abstract in our programs (independently
on the language we use):

Answer 15

parametrization

specification(API)

Question 16

Parametrisation:

Answer 16

We abstract from some of the data using parameters. E.g., we can define a function bigger(int x, int y) which
works with any integers instead of rewriting the code for each single
pair. This is usually supported by programming languages.

Question 17

Specification (API):

Answer 17

We abstract from the implementation. We
separate declaration and implementation. E.g., when we plan our project we only think about the external behavior of each data type
and function. This is usually not supported by the language itself and
is dealt with informally (essentially done via comments).

Question 18

procedural abstraction:

Answer 18

We split the problem into subproblems that are solved in separate functions.

We use parameters to make functions solve many problems at the same time (make functions less specific).

We use specification to separate implementation and declaration. When we use a function we do not have access to the implementation but just to its specification (what it does but not how it does it).

Question 19

If we apply abstraction via API to data types we obtain the notion of
_.

Answer 19

Abstract Data Type (ADT).

Question 20

A data type is:

Answer 20

A collection of objects, e.g.,{. . . , 1, 0, 1, 2, . . .} for int.
A collection of operations, e.g.,+, *,- , / etc. for int.

Question 21

We abstract from the implementation of the data type. So, an abstractdata type consists of:

Answer 21

the specification of the abstract values in the type and some of
their properties.

the specification of the operations that allow to create, modify and
use these values.

Question 22

A dynamic length stack (dls) of integers is :

Answer 22

a stack whose size can
change dynamically during the execution of the program. The size
changes automatically when elements are added or removed from the stack.

Question 23

dlsInit:

Answer 23

Initializes a new empty dls.

Question 24

push:

Answer 24

Inserts an element into a given dls.

Question 25

pop:

Answer 25

remove the last element that was added to the dls and returns
its value.

Question 26

freeDLS:

Answer 26

Frees all the space used by the given dls.

Question 27

specification of the operations:

Answer 27

dlsInit

push

pop

freeDLS

Question 28

self-referential structure is

Answer 28

a structure that contains a pointer member to a variable of the same type.

Question 29

linked list:

Answer 29

It is a set of dynamically allocated nodes. Each node contains one value
and one pointer. The pointer always points to the next member of the list.

Question 30

A local pointer variable is

Answer 30

used to held the list. It points to the first
element of the the list. If that pointer is NULL, then the list is considered
to be empty.

Question 31

Array / Linked list

Answer 31

stored in a contiguous location/ not stored in a contiguous location

fixed in size/ dynamic in size

memory allocated at compile time / memory allocated at run time

elements may be accessed easily / element accessing may require traversal of the whole list