Please if you are not sure dont answer the question thanks Q

Please if you are not sure don\'t answer the question. thanks

QUESTION 1

A B-tree can be ____ in three ways: inorder, preorder, and postorder.

copied

reversed

traversed

  

QUESTION 2

Because an AVL tree is a binary search tree, the search algorithm for an AVL tree is the same as the search algorithm for a binary search tree.

True

False

  

QUESTION 3

A ____ is a set of elements of the same type in which the elements are added at one end.

hash table

tree

queue

  

QUESTION 4

An ____ is an object that produces each element of a container, such as a linked list, one element at a time.

initiator

iterator

interpreter

  

QUESTION 5

A convenient and fast way to implement an associative container data structure is to use a ____.

linked list

binary search tree

priority queue

  

QUESTION 6

In a ____ queue, customers or jobs with higher priorities are pushed to the front of the queue.

structured

divided

priority

  

QUESTION 7

The order of the nodes in a linked list is determined by the data value stored in each node.

True

False

  

QUESTION 8

A(n) ____ is a data type that separates the logical properties from the implementation details.

public

abstract data type

private

QUESTION 9

The term asymptotic means the study of the function f as n becomes larger and larger without bound.

True

False

  

QUESTION 10

After inserting (or deleting) a node from an AVL tree, the resulting binary tree does not have to be an AVL tree.

True

False

  

QUESTION 11

The function that overloads any of the operators (), [], ->, or = for a class must be declared as a member of the class.

True

False

QUESTION 12

____ are systems in which queues of objects are waiting to be served by various servers

Queuing networks

Queuing systems

Holding systems

  

QUESTION 13

Indirect recursion requires the same careful analysis as direct recursion.

True

False

QUESTION 14

A binary search can be performed only on ____.

ordered lists

comparable lists

unordered lists

QUESTION 15

In 1736, Euler represented the Königsberg bridge problem as a graph, marking (as recorded) the birth of graph theory.

True

False

  

QUESTION 16

If we compare the push function of the stack with the insertFirst function for general lists, we see that the algorithms to implement these operations are similar.

True

False

  

QUESTION 17

The operation ____ is used to remove the top element from the stack.

pop

push

peek

  

QUESTION 18

The syntax for accessing a class (struct) member using the operator -> is ____.

pointerVariableName.classMemberName

pointerVariableName->classMemberName

&pointerVariableName.classMemberName

  

QUESTION 19

The ____ operation is used to add an element onto the stack.

push

pop

add

  

QUESTION 20

To speed up item insertion and deletion in a data set, use ____.

arrays

linked lists

classes

  

QUESTION 21

To simplify operations such as insert and delete, you can define the class to implement the node of a linked list as a struct.

True

False

QUESTION 22

Class objects cannot be passed as parameters to functions or returned as function values.

True

False

  

QUESTION 23

    complexity of the function seqSearch in an array list is O(n²).

True

False

  

QUESTION 24

Every customer has a customer number, arrival time, waiting time, transaction time, and departure time.

True

False

  

QUESTION 25

The statement ____ declares intList to be a vector and the component type to be int

vector<int> intList;

int.vector intList;

int.vector intList;

  

QUESTION 26

From the binary search algorithm, it follows that every iteration of the while loop cuts the size of the search list by half.

True

False

  

QUESTION 27

If the data needs to be processed in a First In First Out (FIFO) manner, we typically use a(n) ____.

stack

queue

map

  

QUESTION 28

Assuming vecList is a vector container, the expression ____ deletes all elements from the container.

vecList.erase(position)

vecList.erase(beg, end)

vecList.clear()

QUESTION 29

Open addressing can be implemented in several ways.

True

False

  

QUESTION 30

Random access iterators are ____ iterators that can randomly process elements of a container.

input

forward

bidirectional

  

QUESTION 31

The general case in a recursive function is the case for which the solution is obtained directly.

True

False

  

QUESTION 32

When an integer is subtracted from a pointer variable, the value of the pointer variable is decremented by the integer times half the size of the memory to which the pointer is pointing.

True

False

  

QUESTION 33

Assuming deq is a deque object, the expression deq.push_front(elem) deletes the first element from deq.

True

False

  

QUESTION 34

Building a linked list forward places the new item to be added at the beginning of the linked list.

True

False

QUESTION 35

The algorithm ____ is used to find the elements in one range of elements that do not appear in another range of elements.

set_union

set_difference

set_join

  

QUESTION 36

In an array list the time complexity of the remove function is identical to the time complexity of the ____ function.

insert

isEmpty

isFull

QUESTION 37

The ____ algorithm tries to extend a partial solution toward completion

backtracking

recursive

backordering

  

QUESTION 38

Every call to a recursive function has its own code and its own set of ____ and local variables

headers

parameters

stack

  

QUESTION 39

A linked list in which the last node points to the first node is called a reverse linked list.

True

False

  

QUESTION 40

The expression vecCont.empty() empties the vector container of all elements.

True

False

  

QUESTION 41

The destructor automatically executes when the class object goes out of ____.

scope

use

phase

  

QUESTION 42

In the second form of ____, the binary operation op is applied to the elements in the range.

adjacent_find

adjacent_difference

adjacent_member

  

QUESTION 43

We need ____ pointers to build a linked list.

two

three

four

five

  

QUESTION 44

A class and its members can be described graphically using a notation known as Unified Modeling Language (UML) notation.

True

False

  

QUESTION 45

Using static arrays, depending on the number of servers specified by the user, a list of servers is created during program execution.

True

False

  

QUESTION 46

The ____ in a binary tree is the number of branches on the path from the root to the node.

size of a node

level of a node

depth of a node

  

QUESTION 47

A sequential search assumes that the data is in a particular order.

True

False

QUESTION 48

Mergesort uses the divide-and-conquer technique to sort a list.

True

False

QUESTION 49

The ____ operation on a queue returns the last element in the queue, but does not remove the element from the queue

front

back

pop

push

QUESTION 50

A queuing system only consists of queues of objects waiting to be served.

True

False

	A.	copied
	B.	reversed
	C.	traversed

Solution

Answer :

QUESTION 1

A B-tree can be ____ in three ways: inorder, preorder, and postorder.

Answer :

C.traversed

A B-tree can be traversed in three ways: inorder, preorder, and postorder.

QUESTION 2

Because an AVL tree is a binary search tree, the search algorithm for an AVL tree is the same as the search algorithm for a binary search tree.

True

False

Answer :

True

QUESTION 3

A ____ is a set of elements of the same type in which the elements are added at one end.

Answer :

C.queue

A Queue is a set of elements of the same type in which the elements are added at one end.

QUESTION 4

An ____ is an object that produces each element of a container, such as a linked list, one element at a time.

Answer :

B.iterator

An Iterator is an object that produces each element of a container, such as a linked list, one element at a time.

QUESTION 5

A convenient and fast way to implement an associative container data structure is to use a ____.

Answer :

B.binary search tree

A convenient and fast way to implement an associative container data structure is to use a Binary Search Tree.

QUESTION 6

In a ____ queue, customers or jobs with higher priorities are pushed to the front of the queue.

Answer :

C.priority

In a Priority queue, customers or jobs with higher priorities are pushed to the front of the queue.

QUESTION 7

The order of the nodes in a linked list is determined by the data value stored in each node.

True

False

Answer :

False

QUESTION 8

A(n) ____ is a data type that separates the logical properties from the implementation details.

Answer :

C.abstract data type

A(n) Abstract data type is a data type that separates the logical properties from the implementation details.

QUESTION 9

The term asymptotic means the study of the function f as n becomes larger and larger without bound.

True

False

Answer :

True

QUESTION 10

After inserting (or deleting) a node from an AVL tree, the resulting binary tree does not have to be an AVL tree.

True

False

Answer :

False

QUESTION 11

The function that overloads any of the operators (), [], ->, or = for a class must be declared as a member of the class.

True

False

Answer :

True

QUESTION 12

____ are systems in which queues of objects are waiting to be served by various servers

Answer :

B.Queuing systems

QUESTION 13

Indirect recursion requires the same careful analysis as direct recursion.

True

False

Answer :

True

QUESTION 14

A binary search can be performed only on ____.

Answer :

A.ordered lists

QUESTION 15

In 1736, Euler represented the Königsberg bridge problem as a graph, marking (as recorded) the birth of graph theory.

True

False

Answer :

True

QUESTION 17

The operation ____ is used to remove the top element from the stack.

Answer :

A.pop

QUESTION 18

The syntax for accessing a class (struct) member using the operator -> is ____.

Answer :

B.pointerVariableName->classMemberName

QUESTION 19

The ____ operation is used to add an element onto the stack.

Answer :

A.push

  

QUESTION 20

To speed up item insertion and deletion in a data set, use ____.

Answer :

B.linked lists

QUESTION 21

To simplify operations such as insert and delete, you can define the class to implement the node of a linked list as a struct.

True

False

Answer :

True

QUESTION 22

Class objects cannot be passed as parameters to functions or returned as function values.

True

False

Answer :

False

QUESTION 23

    complexity of the function seqSearch in an array list is O(n²).

True

False

Answer :

False

QUESTION 24

Every customer has a customer number, arrival time, waiting time, transaction time, and departure time.

True

False

Answer :

True

QUESTION 25

The statement ____ declares intList to be a vector and the component type to be int

Answer :

A.vector<int> intList;

QUESTION 26

From the binary search algorithm, it follows that every iteration of the while loop cuts the size of the search list by half.

True

False

Answer :

True

QUESTION 27

If the data needs to be processed in a First In First Out (FIFO) manner, we typically use a(n) ____.

Answer:

B.queue

QUESTION 28

Assuming vecList is a vector container, the expression ____ deletes all elements from the container.

Answer:

C.vecList.erase(beg, end)

QUESTION 29

Open addressing can be implemented in several ways.

True

False

True

QUESTION 30

Random access iterators are ____ iterators that can randomly process elements of a container.

Answer :

C.Bidirectional

QUESTION 31

The general case in a recursive function is the case for which the solution is obtained directly.

True

False

Answer:

False

QUESTION 32

When an integer is subtracted from a pointer variable, the value of the pointer variable is decremented by the integer times half the size of the memory to which the pointer is pointing.

True

False

Answer :

False

QUESTION 33

Assuming deq is a deque object, the expression deq.push_front(elem) deletes the first element from deq.

True

False

Answer :

False

QUESTION 34

Building a linked list forward places the new item to be added at the beginning of the linked list.

True

False

Answer :

False

QUESTION 35

The algorithm ____ is used to find the elements in one range of elements that do not appear in another range of elements.

Answer :

B.set_difference

QUESTION 36

In an array list the time complexity of the remove function is identical to the time complexity of the ____ function.

Answer :

A.insert

QUESTION 37

The ____ algorithm tries to extend a partial solution toward completion

Answer :

A.backtracking

QUESTION 38

Every call to a recursive function has its own code and its own set of ____ and local variables

Answer :

B.parameters

QUESTION 39

A linked list in which the last node points to the first node is called a reverse linked list.

True

False

Answer :

False

QUESTION 40

The expression vecCont.empty() empties the vector container of all elements.

True

False

Answer :

False

QUESTION 41

The destructor automatically executes when the class object goes out of ____.

Answer :

A.scope

QUESTION 42

In the second form of ____, the binary operation op is applied to the elements in the range.

Answer :

B.adjacent_difference

QUESTION 43

We need ____ pointers to build a linked list.

Answer :

A.two

QUESTION 44

A class and its members can be described graphically using a notation known as Unified Modeling Language (UML) notation.

True

False

Answer :

True

QUESTION 45

Using static arrays, depending on the number of servers specified by the user, a list of servers is created during program execution.

True

QUESTION 46

The ____ in a binary tree is the number of branches on the path from the root to the node.

Answer :

C.depth of a node

QUESTION 47

A sequential search assumes that the data is in a particular order.

True

False

Answer :

False

QUESTION 48

Mergesort uses the divide-and-conquer technique to sort a list.

True

False

Answer :

True

QUESTION 49

The ____ operation on a queue returns the last element in the queue, but does not remove the element from the queue

Answer :

B.back

QUESTION 50

A queuing system only consists of queues of objects waiting to be served.

True

False

Answer :

False

False

Answer :

False