Q7Cisp430

Front 1

A is a class and B is a new class derived from A. Also, we have these variables: A a; B b; B b1; B b2;Consider the assignment statement a=b;. Which answer is true?

Back 1

The assignment statement activates the A assignment operator.

Front 2

What is the term used to describe the situation when a derived class provides a function already provided in the base class?

Back 2

Overriding.

Front 3

How are loops represented in an edge-list representation of a graph?

Back 3

A vertex will be on its own edge-list.

Front 4

How many linked lists are used to represent a graph with n nodes and m edges, when using an edge list representation,

Back 4

n

Front 5

There are many potential uses for derived classes, but one of the most frequent uses comes from the is-a relationship. “A is-a B” means that ___________________________________________________.

Back 5

each A object is a particular kind of B object

Front 6

What is the best actions describtion of the the automatic destructor for a derived class?

Back 6

The automatic destructor first calls the destructor for any member variables of the derived class, and then calls the destructor for the base class.

Front 7

Which statement of the following is the most appropriate one?

Back 7

The connection between a derived class and its base class can often be characterized by the is-a relationship. For example, an herbivore is-a particular kind of animal, so it makes sense to implement herbivore as a derived class of the animal base class.

Front 8

Which statement of the following is the most appropriate one?

Back 8

Object-oriented programming supports reusable components by permitting new derived classes to be declared, which automatically inherit all members of an existing base class.

Front 9

the members that the derived class receives from its base class are called ____________________,

Back 9

inherited members

Front 10

What is the initial fish size in the Pond Life Simulation of figure 14.10?

Back 10

300

Front 11

What would be the best implementation of a derived class called daylight_clock? A daylight clock is like a clock except that it has one extra boolean member function to determine whether it is currently daylight. Assume that daylight stretches from 7:00 A.M. through 6:59 P.M.

Back 11

class daylight_clock : public clock{ public: bool is_day( ) const;};bool daylight_clock::is_day( ) const{ if (is_morning( )) return (get_hour( ) >= 7); else return (get_hour( ) < 7);}

Front 12

What does "#include "organism.h"" do in the Figure 14.6?

Back 12

It provides the organism class

Front 13

A vertex in a directed graph has an in-degree, which is the number of edges with v as the target vertex, and an in-degree, which is the number of edges with v as their source vertex. What is the in-degree of Melbourne in the following airline graph?

Back 13

3

Front 14

The degree of a vertex v in an undirected graph is the number of times v is an endpoint of an edge. A loop at the vertex contributes twice to the degree. What is the degree of vertex a in the graph in the margin?

Back 14

5

Front 15

How many loops does the following airline graph have?

Back 15

0

Front 16

Suppose that g is a graph with integer labels. The statements are as following and executed one after another, and i is an integer variable. What is the label of vertex 3 and i at the Point 2 marked here?g[3] = 42; // Point 1i = g[3]; // Point 2i = 43; // Point 3

Back 16

The label is 42 and i is 42.

Front 17

The degree of a vertex v in an undirected graph is the number of times v is an endpoint of an edge. A loop at the vertex contributes twice to the degree. What is the degree of vertex b in the graph in the margin?

Back 17

2

Front 18

Suppose that g is a graph with integer labels. The statements are as following and executed one after another, and i is an integer variable. What is the label of vertex 3 and i at the Point 3 marked here?g[3] = 42; // Point 1i = g[3]; // Point 2i = 43; // Point 3

Back 18

The label is 42 and i is 43.

Front 19

What is the depth-first search of the following graph, starting at Sydney? List the order in which the cities are processed.

Back 19

Sydney, Canberra, Adelaide, Melbourne, Hobart, Perth, Black Stump, Darwin, Brisbane

Front 20

Consider the following adjacency matrix, which node has the highest out-degree?

Back 20

note 0.

Front 21

A is a class and B is a new class derived from A. Also, we have these variables: A a; B b; B b1; B b2;What C++ syntax is used to declare that a class B is derived from class A?

Back 21

class B : public A { ... };

Front 22

A is a class and B is a new class derived from A. Also, we have these variables: A a; B b; B b1; B b2;Consider the declarations above. Suppose there are two functions: f has an argument of type A and g has an argument of type B. Which statement is correct?

Back 22

f(a) is legal, but g(a) is not legal.

Front 23

What graph traversal algorithm uses a queue to keep track of vertices which need to be processed?

Back 23

Breadth-first search

Front 24

A simple graph has no loops. What other property must a simple graph have?

Back 24

It must have no multiple edges.

Front 25

Object-oriented languages provide support that allows programmers to easily create new classes that acquire some or many of their properties from an existing class. The original class is called the ________________.

Back 25

base class

Front 26

What is the benefit of a Well-Written Base Class?

Back 26

With a well-written base class in hand, a programmer can write derived classes without worrying about how the base class accomplishes its work.

Front 27

Suppose a derived class does not declare any constructors of its own. What constructors is it given automatically?

Back 27

The derived class receives an automatic default constructor (which calls the default constructor for the base class and then calls the default constructor for any member variables of the derived class). The derived class also receives an automatic copy constructor (which calls the copy constructor for the base class and then calls the copy constructor for any member variables of the derived class).

Front 28

What is one situation where a virtual member function is required?

Back 28

The base class has a member function f, which activates another member function g. This g member function will be overridden in a derived class. When an object of the derived class activates f, it will use the base class version of f. But within f, we want it to use the overridden g from the derived class.

Front 29

What does "#include "organism.h"" do in the Figure 14.10?

Back 29

It provides herbivore, plant classes

Front 30

If jacket is a derived class of clothes, are the following statements legal? Why or why not? clothes coat;jacket blazer;blazer = coat;

Back 30

The assignment is not legal, because an object of the base class (coat) cannot be used as if it were an object of the derived class.

Front 31

What is AVERAGE_NIBBLES for in the Pond Life Simulation of figure 14.10?

Back 31

Average number of plants nibbled by a fish over one week.

Front 32

What statement about the automatic default constructor is the most accurate?

Back 32

If we don’t declare any constructors for a derived class, then C++ will automatically provide a default constructor. This default constructor will carry out two steps: (1) activate the default constructorfor the base class (to initialize any member variables that the base class uses), then (2) activate default constructors for any new member variables that the derived class has, but the base class does not have.

Front 33

A cycle in a directed graph is a path that begins and ends at the same vertex. The length of the cycle is the number of edges. Which of the following has a length of 5 in the following airline graph?

Back 33

Canberra, Adelaide, Perth, Black Stump, Darwin, Canberra

Front 34

A vertex in a directed graph has an in-degree, which is the number of edges with v as the target vertex, and an in-degree, which is the number of edges with v as their source vertex. What is the out-degree of Sydney in the following airline graph?

Back 34

2

Front 35

Which statement of the following is the most appropriate one?

Back 35

There are two common ways to implement a graph: an adjacency matrix or an edge list. The different implementations have different time performance for common operations such as determining whether two vertices reconnected.

Front 36

Which statement of the following is the most appropriate one?

Back 36

Dijkstra’s algorithm provides an efficient way to determine the shortest path from a given start vertex to every other vertex in a graph with weighted edges.

Front 37

A cycle in a directed graph is a path that begins and ends at the same vertex. The length of the cycle is the number of edges. Which of the following has a length of 3 in the following airline graph?

Back 37

Sydney, Melbourne, Canberra, Sydney

Front 38

What statement about a depth-first or breadth-first search process all vertices in a graph is the most appropriate?

Back 38

They are not always searching and processing all vertices in a graph. A vertex v in a graph will not be processed by a DFS or BFS if there is no path from the start vertex to v.

Front 39

A cycle in a directed graph is a path that begins and ends at the same vertex. The length of the cycle is the number of edges. Which of the following has a length of 3 in the following airline graph?

Back 39

Sydney, Canberra, Brisbane, Sydney

Front 40

Using the Shortest-Path Algorithm to go through the following graph what would be the actual shortest path from vertex 0 to vertex 3?

Back 40

The shortest distance is 11. The path is vertex 0 to vertex 1, vertex 1 to vertex 2, vertex 2 to vertex 3

Front 41

Suppose you were going to quickly implement a Stack class as a derived class. Why would it be likely that the base class would be a private base class?

Back 41

You would not want to have all of the base classes public member functions be public member functions of the stack.

Front 42

If a class B is derived from A, then which of the following terms describes A?

Back 42

All of the above

Front 43

Which of the following statements is true?

Back 43

Graph vertices may be linked in any manner.

Front 44

If G is an directed graph with 20 vertices, how many boolean values will be needed to represent G using an adjacency matrix?

Back 44

400

Front 45

What is alpha-beta pruning?

Back 45

Alpha-beta pruning is the process of stopping an evaluation, such as a minimax search, if it cannot produce a better solution than one that has already been determined.

Front 46

Relationships are drawn in a tree called an ________________________. In this tree, each base class is placed as the parent of its derived classes.

Back 46

object hierarchy tree

Front 47

Object-oriented languages provide support that allows programmers to easily create new classes that acquire some or many of their properties from an existing class. The new, slightly different class is the __________________.

Back 47

subclass

Front 48

What statement about death function in section 14.2 is the most accurate?

Back 48

The organism’s current size and growth rate have been set to zero.

Front 49

Where can a protected member of a class be used?

Back 49

A protected member can be used and overridden by a derived class but cannot be used outside of a derived class.

Front 50

What statement about total_mass function in section 14.10 is the most accurate?

Back 50

The return value is the total mass of all the plants in the collection.

Front 51

What would be the best statement about set_time function of clock class in section 14.1?

Back 51

Before comming into this function the hour need to be greater than or equal 1 and less than and equal 12, and the minute need to be greater than or equal to 1 and less than and equal to 59. The function should set the given hour and minute . If the third parameter, morning, is true, then this time is from 12:00 midnight to 11:59 A.M. Otherwise this time is from 12:00 noon to 11:59 P.M.

Front 52

What is the best actions describtion of the the automatic assignment operator for a derived class?

Back 52

The automatic assignment operator calls the assignment operator for the base class and then calls the assignment operator for any member variables of the derived class.

Front 53

A cycle in a directed graph is a path that begins and ends at the same vertex. The length of the cycle is the number of edges. Which of the following has a length of 3 in the following airline graph?

Back 53

Canberra, Brisbane, Sydney, Canberra

Front 54

The following graph except changes the weight of the edge that goes from 0 to 5. Its new weight is 4. Using the Shortest-Path Algorithm to go through the new graph what would be the actual shortest path from vertex 0 to vertex 3?

Back 54

The shortest distance is 10. The path is vertex 0 to vertex 5, vertex 5 to vertex 4, vertex 4 to vertex 3.

Front 55

The following graph except changes the weight of the edge that goes from 0 to 5. Its new weight is 4. Using the Shortest-Path Algorithm to go through the new graph what would be the distance array?

Back 55

Front 56

Using the Shortest-Path Algorithm to go through the following graph what would be the distance array?

Back 56

Front 57

What would be the adjacency matrix for the graph below?

Back 57

Front 58

A vertex in a directed graph has an in-degree, which is the number of edges with v as the target vertex, and an out-degree, which is the number of edges with v as their source vertex. What is the in-degree of Canberra in the following airline graph?

Back 58

3

Front 59

A vertex in a directed graph has an in-degree, which is the number of edges with v as the target vertex, and an out-degree, which is the number of edges with v as their source vertex. What is the out-degree of Canberra in the following airline graph?

Back 59

3

Front 60

How many edges does the following airline graph have?

Back 60

14

Front 61

A is a class and B is a new class derived from A. Also, we have these variables: A a; B b; B b1; B b2;Consider the declarations above. Suppose there are two functions: f has an argument of type A and g has an argument of type B. Which statement is correct?

Back 61

Both f(b) and g(b) are legal function calls.

Front 62

Suppose you were going to quickly implement a Stack class. What class would be the best base class?

Back 62

List.

Front 63

Suppose you have a game with 5 coins in a row and each coin can be heads or tails. What number of vertices might you expect to find in the state graph?

Back 63

32

Front 64

Why is the state graph for tic-tac-toe a directed graph rather than an undirected graph?

Back 64

Once a move is made, it cannot be unmade.

Front 65

What would be the best statement about advance function of clock class in section 14.1?

Back 65

After this function the clock has been moved forward by the indicated number of minutes. A negative argument moves the clock backward.

Front 66

What statement about simulate_week function in section 14.2 is the most accurate?

Back 66

After the functiuon the size of the organism has been changed by its current growth rate. If the new size is less than zero, then the actual size is set to zero rather than to a negative value, and the growth rate is also set to zero.

Front 67

What statement about get_rate function in section 14.2 is the most accurate?

Back 67

The value returned is the organism’s current growth rate (in oz/week).

Front 68

What statement about a private base class is the most accurate?

Back 68

The public members of the base class are available to the derived class. In a private base class, the public members of the base class are only available as private members of the derived class.

Front 69

Object-oriented languages provide support that allows programmers to easily create new classes that acquire some or many of their properties from an existing class. The new, slightly different class is the __________________.

Back 69

child class

Front 70

What is the initial weeds size in the Pond Life Simulation of figure 14.10?

Back 70

2000

Front 71

Object-oriented languages provide support that allows programmers to easily create new classes that acquire some or many of their properties from an existing class. The original class is called the ________________.

Back 71

ancestor class

Front 72

Which statement of the following is the most appropriate one?

Back 72

An abstract base class (such as the game class) can provide a common framework that is needed by many derived classes. An abstract base class has one or more pure virtual functions, which are functions that must be overridden before the class can be used.

Front 73

Suppose you are doing a breadth-first search of a graph with n vertices. How large can the queue get?

Back 73

If n is 1, then the queue needs room for only one vertex. If n is more than 1, then the queue will never have more than n–1 entries.

Front 74

The degree of a vertex v in an undirected graph is the number of times v is an endpoint of an edge. A loop at the vertex contributes twice to the degree. What is the degree of vertex e in the graph in the margin?

Back 74

3

Front 75

Suppose that g is a graph with integer labels. The statements are as following and executed one after another, and i is an integer variable. What is the label of vertex 3 and i at the Point 1 marked here?g[3] = 42; // Point 1i = g[3]; // Point 2i = 43; // Point 3

Back 75

The label is 42 and i is unknown.

Front 76

How would you interpret a loop in the following graph?

Back 76

A loop would be an excursion flight that takes off and lands at the same city.

Front 77

Consider the following adjacency matrix where is (are) loop(s) in the graph?

Back 77

vertex 1 and 3.

Front 78

Is the following airline graph a directed graph and the reason?

Back 78

It is a directed graph because each edge (drawn as an arrow) has an orientation, going from its source to its target.

Front 79

What would be the adjacency matrix for the graph below?

Back 79

Front 80

Consider the following adjacency matrix, which node has the highest in-degree?

Back 80

note 0.

Front 81

A is a class and B is a new class derived from A. Also, we have these variables: A a; B b; B b1; B b2;Using the variable declarations at the top of this section, which of the following assignment statements are legal?

Back 81

Both (1) and (3) are legal, but not 2).

Front 82

Consider the assignment statement b=a; (with the variable declarations at the top of this section). Which answer is true?

Back 82

The assignment statement is illegal.

Front 83

What is the expected number of operations needed to loop through all the edges terminating at a particular vertex given an adjacency matrix representation of the graph? (Assume n vertices are in the graph and m edges terminate at the desired node.)

Back 83

O(n)

Front 84

Suppose you have a directed graph representing all the flights that an airline flies. What algorithm might be used to find the best sequence of connections from one city to another?

Back 84

A shortest-path algorithm

Front 85

What would be the best statement about get_minute function of clock class in section 14.1?

Back 85

The value returned is the current minute on the clock.

Front 86

What statement about the automatic copy constructor is the most accurate?

Back 86

If a derived class does not define a copy constructor of its own, then C++ will automatically provide a copy constructor. This copy constructor is similar to the automatic default constructor in that itcarries out two steps: (1) Activate the copy constructor for the base class (to copy any member variables that the base class uses), then (2) activate copy constructors for any new member variables that the derived class has but the base class does not have. The copy constructors that are activated in Steps 1 and 2 may

Front 87

What statement about is_alive function in section 14.2 is the most accurate?

Back 87

If the current size is greater than zero, then the return value is true. Otherwise the return value is false.

Front 88

Object-oriented languages provide support that allows programmers to easily create new classes that acquire some or many of their properties from an existing class. The original class is called the ________________.

Back 88

parent class

Front 89

What would be the best statement about is_morning function of clock class in section 14.1?

Back 89

After this function if the clock’s time lies from 12:00 midnight to 11:59 A.M. (inclusive), the function returns true; otherwise it returns false.

Front 90

What statement about a public base class is the most accurate?

Back 90

The public members of the base class are available to the derived class. In a public base class, the public members are available as public members of the derived class.

Front 91

Which statement of the following is the most appropriate one?

Back 91

All members of a base class are inherited by the derived class, but only the nonprivate members of the base class can be accessed by the programmer who implements the derived class.

Front 92

What statement about assign_need function in section 14.2 is the most accurate?

Back 92

Before comming into this function new_need >= 0. After this function, the animal’s weekly food requirement has been changed to new_need (measured in ounces per week).

Front 93

How many vertices does the following airline graph have?

Back 93

9

Front 94

The degree of a vertex v in an undirected graph is the number of times v is an endpoint of an edge. A loop at the vertex contributes twice to the degree. What is the degree of vertex c in the graph in the margin?

Back 94

2

Front 95

A vertex in a directed graph has an in-degree, which is the number of edges with v as the target vertex, and an in-degree, which is the number of edges with v as their source vertex. What is the out-degree of Melbourne in the following airline graph?

Back 95

2

Front 96

Consider the following adjacency matrix, which node has the highest out-degree?

Back 96

node 3.

Front 97

A cycle in a directed graph is a path that begins and ends at the same vertex. The length of the cycle is the number of edges. Which of the following has a length of 4 in the following airline graph?

Back 97

Sydney, Melbourne, Canberra, Brisbane, Sydney

Front 98

Consider the following adjacency matrix where is (are) loop(s) in the graph?

Back 98

vertex 0.

Front 99

A cycle in a directed graph is a path that begins and ends at the same vertex. The length of the cycle is the number of edges. Which of the following has a length of 3 in the following airline graph?

Back 99

Adelaide, Melbourne, Canberra, Adelaide

Front 100

What would happen if the visited vertices were not marked in the breadth-first and depth-first search?

Back 100

A traversal will loop indefinitely on a graph with a cycle if visited vertices are not marked

Front 101

A is a class and B is a new class derived from A. Also, we have these variables: A a; B b; B b1; B b2;Consider the declarations above. Suppose there are two functions: f has an argument of type A and g has an argument of type B. Which statement is correct?

Back 101

Both f(b) and g(b) are legal function calls.

Front 102

Consider the assignment statement b=a; (with the variable declarations at the top of this section). Which answer is true?

Back 102

The assignment statement is illegal.

Front 103

If G is an directed graph with 20 vertices, how many boolean values will be needed to represent G using an adjacency matrix?

Back 103

400

Front 104

What is the expected number of operations needed to loop through all the edges terminating at a particular vertex given an adjacency matrix representation of the graph? (Assume n vertices are in the graph and m edges terminate at the desired node.)

Back 104

O(n)

Front 105

What would be the best statement about the clock constructor in section 14.1?

Back 105

The clock is set to 12:00 (midnight).

Front 106

What statement about simulate_week function in section 14.2 is the most accurate?

Back 106

After the functiuon the size of the organism has been changed by its current growth rate. If the new size is less than zero, then the actual size is set to zero rather than to a negative value, and the growth rate is also set to zero.

Front 107

What would be the best statement about get_hour function of clock class in section 14.1?

Back 107

The value returned is the current hour using a 12-hour clock.

Front 108

What is BIRTH_RATE for in the Pond Life Simulation of figure 14.10?

Back 108

At the end of each week, some fish have babies. The total number of new fish born is the current number of fish times the BIRTH_RATE (rounded down to an integer).

Front 109

What statement about the automatic constructors of a derived class is the most accurate?

Back 109

A derived class may declare its own constructors, or it may use the automatic default constructor and the automatic copy constructor that are provided for every C++ class.

Front 110

Object-oriented languages provide support that allows programmers to easily create new classes that acquire some or many of their properties from an existing class. The new, slightly different class is the __________________.

Back 110

descendant class

Front 111

Object-oriented languages provide support that allows programmers to easily create new classes that acquire some or many of their properties from an existing class. The new, slightly different class is the __________________.

Back 111

derived class

Front 112

Object-oriented languages provide support that allows programmers to easily create new classes that acquire some or many of their properties from an existing class. The original class is called the ________________.

Back 112

superclass

Front 113

The degree of a vertex v in an undirected graph is the number of times v is an endpoint of an edge. A loop at the vertex contributes twice to the degree. What is the degree of vertex d in the graph in the margin?

Back 113

2

Front 114

Consider the following adjacency matrix, which node has the highest in-degree?

Back 114

node 1

Front 115

What is the breadth-first search of the following graph, starting at Sydney? List the order in which the cities are processed.

Back 115

Sydney, Canberra, Melbourne, Adelaide, Brisbane, Hobart, Perth, Black Stump, Darwin

Front 116

What value indicates that there is no path between vertices in Dijkstra’s algorithm?

Back 116

The infinity symbol indicates that there is no path between two vertices.

Front 117

What kind of search occurs if you replace a breadth-first search’s queue with a stack?

Back 117

A depth-first search

Front 118

Which statement of the following is the most appropriate one?

Back 118

There are several different kinds of graphs: undirected graphs (where edges have no particular orientation), directed graphs (where each edge goes from a source vertex to a target vertex), graphs with loops (i.e., an edge connecting a vertex to itself), graphs with multiple edges (i.e., more than one edge may connect the same pair of vertices), labeled graphs (where each vertex has an associated label), and graphs with weighted edges (where each edge has an associated number called its weight).

Front 119

A vertex in a directed graph has an in-degree, which is the number of edges with v as the target vertex, and an out-degree, which is the number of edges with v as their source vertex. What is the out-degree of Sydney in the following airline graph?

Back 119

2

Front 120

Which statement of the following is the most appropriate one?

Back 120

Graphs are a flexible data structure with many occurrences in computer science and in applications. Many problems can be solved by asking an appropriate question about paths in a graph.