Queens, Hanoi, and Queues

Question 1

constructor for the general boardd

Answer 1

No inputs. assumes an 8 by 8 is desired
creates a board with all false.
sets boardSize to 8
sets queenscount to 0

Question 2

copy constructor for queens

Answer 2

board size is the input.
creates an n by n board with all false.
sets boardSize to input boardsize
sets queenscount to 0

Question 3

The key was that the count of the number of queens has dual meaning.

Answer 3

Besides the number of queens on the board, it is also the next row for placing a queen

Question 4

time for the towers of hanoi problem with recoursion

Answer 4

exponential time since the number of moves is 2n – 1 for n disks
even if you could do this iteratively, it would stay exponential time because the number of moves stays the same

Question 5

time for the fibbonacci sequence with recoursion

Answer 5

asking it to find the 100th term, it feels exponential time. Indeed it is exponential time although an iterative solution would be linear time. So, here recursion really hurts

Question 6

is solveQueensProblem a standard recoursive function

Answer 6

olveQueensProblem is NOT a standard recursive function because it contains iteration too. It needs both to implement the technique called backtracking

Question 7

rui = spike is equal to

Answer 7

rui.operator= (spike)

Question 8

this

Answer 8

address of the calling class object

Question 9

*this

Answer 9

this is a pointer that points to a clone of the current object

Question 10

3 things i need to delete when there is a circularly linked node of size 1

Answer 10

delete the connection(next is nullptr)
delete the node (delete node)
set it to null (node = nullptr)

Question 11

what do i need to do in order to delete the first item from a queue

Answer 11

delptr is first item(backptr next)
first item is now second item(backptr next is delptr next)
null delptrs connection(delptr next is nullptr)
delete delptr

Question 12

when getting the size of a queue when must i loop until

Answer 12

until backptr next is backptr

you must then add another count for the final node

Question 13

how to prevent work from a=a in the operator= member function

Answer 13

you only do copies in if(this != &rhsq)

then return *this at teh end

Question 14

write a client which did cascading =’s

Answer 14

zach = rui = spike;

Question 15

also saw that rui = spike; is equivalent to

Answer 15

rui.operator=(spike)

Question 16

o what part of the code allows the cascading of < Tried it and it worked with

Answer 16

cout &laquo_space;spike &laquo_space;rui;

Question 17

why is operator&laquo_space;not a method function

Answer 17

it is called on teh left with an ostream object not a queue object

Question 18

method function

Answer 18

called with a queue function on the left

Question 19

is operator= a queue function

Answer 19

yes

Question 20

what does making operator&laquo_space;a firend do

Answer 20

but designating this function as a friend in queue.h allows it to access data members of class Queue in its code

Question 21

designate operator&laquo_space;as a friend

Answer 21

friend ostream& operator&laquo_space;(ostream& output, const Queue& rhsq);

Question 22

• ADT Queue:

Answer 22

data object is a queue which is a First In First Out List

as opposed to a stack which is a Last In First Out List

Question 23

facts about queue

Answer 23

• queue.cpp using a circularly linked list with only a backptr
coded constructor, isEmpty, and the beginning of lineup

Question 24

towers of hanoi how many moves?

Answer 24

2^n-1