CS 159 Lab 5

36 Karteikartenvon Rusty
Diese Karteikarten lernenKostenlos · Spaced Repetition · iPhone, Android, Mac & Web

Alle Karten

1
In downward communication (passing by value) it is only a copy of the data that is sent from the calling function to the called function.
T
2
It is not possible to access a variable in the calling function by its identifier when inside the called function.
T
3
Given the address of a variable the called function can access and manipulate the value of a variable in thecalling function.
T
4
The called function must declare a special type of variable known as a pointer to store a memory address that is sent from the calling function.
T
5
To obtain the address of a variable use the address operator (&).
T
6
The asterisk (*) when used in a variable declaration indicates that such variables are not data variables but address (pointer) variables which can store the addresses of other variables in the program.
T
7
The asterisk has two different uses, declaring an address variable (pointer) and indirectly accessing the data (in the memory location to which the variable points).
T
8
When only one data item needs to be returned to the calling function then we should use the standard return statement rather than passing a single parameter by address.
T
9
The scope of an object determines the region of the program in which it is visible (and defined).
T
10
A variable declared in the local declaration section of a function has a scope that extends until the end of that function.
T
11
Objects with a global scope are visible (defined) everywhere in the program.
T
12
It is poor programming style to reuse identifiers within the same scope.
T
13
A structure chart should be created after your program has been written.
F
14
A structure chart should be created before your program has been written.
T
15
Each rectangle on a structure chart represents the user-defined and standard library functions used in a program.
F
16
Each rectangle on a structure chart represents the user-defined functions used in a program.
T
17
No code is contained in a structure chart as it only demonstrates the function flow of the program.
T
18
A structure chart may show the data that is exchanged between functions.
T
19
Functional cohesion is a measure of how closely the processes in a function are related.
T
20
A function that does one and only one process is functionally cohesive.
T
21
It is a good design practice to limit user-defined functions to only a single task.
T
22
It is a good design practice to not repeat the logic of one function in other functions of the program.
T
23
It is a good design practice to design a user-defined function such that it is testable apart from the rest of the program.
T
24
It is possible to determine if any parameters are passed to a function by address from the declaration statement of the function.
T
25
It is never possible to determine if any parameters are passed to a function by address from an example call to the function.
F
26
It is possible to determine if any parameters are passed to a function by address from an example call to the function using the address operator.
T
27
It is possible to determine if any parameters are passed to a function by address based on the first line of the definition of the function (also known as the function header).
T
28
A function that passes at least one parameter by address must pass them all by address.
F
29
A function that passes at least one parameter by address does not pass them all by address.
T
30
All functions that utilize pass by address must be void functions.
F
31
All functions that utilize pass by address may not always be void functions based on whatever value the user wants to be returned (it could be a different variable being returned and not the one being passed by address).
T
32
One benefit of pass by address is that it allows multiple changes to be made in a function and to have those changes available in the calling function.
T
33
With the use of pass by address it is now permissible for a function to be written to complete several subtasks of the program.
F
34
With the use of pass by address it is still not permissible for a function to be written to complete several subtasks of the program.
T
35
When working with a parameter that has been passed by address it is unnecessary to use the & (address) operator in the scanf because the parameter already represents a memory location.
T
36
The * and & operators are inverse operations of each other.
T
Alle 36 Karten kostenlos lernen

Mehr Karteikarten: Informatik

342w Final Study Guide39 KartenInformatik · EnglischBagoidA+ Port Numbers And Explanation34 KartenInformatik · EnglischChristianSecondary Storage – Disk Scheduling Algorithms28 KartenInformatik · Englisch—Griffith—Windows Command Prompt Commands for Comptia A+ 110222 KartenInformatik · Englischeinem OutLearn-Studierenden1.4.1 DATA TYPES17 KartenInformatik · EnglischSabs2023Heap Sort and Binary Heaps11 KartenInformatik · EnglischMariaNetwork Routing206 KartenInformatik · EnglischManethelData Communications Midterm Exam126 KartenInformatik · EnglischDiandreiMobile Computing: Smartphones and Wearables87 KartenInformatik · EnglischliamEthernet Standards70 KartenInformatik · EnglischManethelGENERAL SYSTEM MODEL OF A FIRM59 KartenInformatik · EnglischKathleenImpact of Computing Study Guide48 KartenInformatik · EnglischSg

Alle Decks: Informatik

Lerne diese Decks in der App

Kostenlos auf iPhone, Android, Mac und im Web. Füge jedes Deck mit einem Tipp zu deinem Konto hinzu.

Laden im App StoreJetzt bei Google Play
Alle 36 Karten kostenlos lernen