Reference no: EM13938034

Question 1

What is the time-complexity of the overloaded assignment operator?

1. O(1)

2. O(n)

3. O(log n)

4. O(n^2)

Question 2

template<class Type>
void linkedStackType<Type>::linkedOperation1()
{
nodeType<Type> *temp;

if(stackTop!=NULL)
{
temp=stackTop;
stackTop=stackTop->link;
delete temp;
}
else
cerr<<"ERROR"<<endl;
}

Question 3

Which stack operation is defined by linkedOperation1 above?

1. push

2. pop

3. top

4. copy

Question 4

template<class Type>
void linkedStackType<Type>::linkedOperation1()
{
nodeType<Type> *temp;

if(stackTop!=NULL)
{
temp=stackTop;
stackTop=stackTop->link;
delete temp;
}
else
cerr<<"ERROR"<<endl;
}

Question 5

What does it mean if stackTop equals NULL in the operation above?

1. The stack is full

2. The stack is empty

3. The element does not exist

4. The stack is nonempty but not full

Question 6

In a linear representation of a stack, which of the following values points to the top item in the stack?

1. stackTop

2. stackTop - 1

3. 0

4. -1

Question 7

#include <iostream>
#include "myStack.h"

using namespace std;

int main()
{
stackType<int> intStack(50);
stackType<int> tempStack;

intStack.push(18);
intStack.push(21);
intStack.push(25);

tempStack = intStack;

while(!tempStack.isEmptyStack())
{
cout<<tempStack.top()<<""; //output 1
tempStack.pop();
}

cout<<endl;

cout<<intStack.top()<<endl; //output 2

return 0;
}

Question 8

What is output 2 above?

1. 18

2. 21

3. 25

4. 50

Question 9

template<class Type>
Type stackType<Type>::operation2()
{
assert(stackTop != 0);
return list[stackTop - 1];
}

Question 10

Which stack operation is defined by operation2 above?

1. top

2. pop

3. push

4. isEmptyStack

Question 11

____ pointer(s) are needed to keep track of the front and rear of the queue.

1. Two

2. Three

3. Four

4. Five

Question 12

In the STL class queue the ____ function returns the number of elements in the queue.

1. num

2. count

3. sizeOf

4. size

Question 13

A technique in which one system models the behavior of another system is called ____.

1. modulation

2. comparison

3. analysis

4. simulation

Question 14

In queuing systems, queues of objects are waiting to be served by various ____.

1. operations

2. lists

3. customers

4. servers