hw2solution

hw2solution - Winter 2009 CS 32 Homework 2 Solution Problem...

Info icon This preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
Winter 2009 CS 32 Homework 2 Solution Problem 1 Problem 2 Problem 3 Problem 4 Problem 5 Problem 6 Problem 1: a. Some number in the range 8821 through 28817, depending on your student id. b. Some hexadecimal number. c. Some hexadecimal number greater than your answer to part b. The difference between those two numbers is a multiple of your answer to part a. d. Some hexdecimal number, one more than your answer to part c. e. Some hexadecimal number greater than your answer to part c. Depending on your processor type and compiler, the difference between these two numbers is, when expressed in decimal, 16 or 23, or 12 or 15 or 13, or (not likely) 11. f. The same hexadecimal number as in part c. [Some people's debuggers seem to give a wrong value here; we'll check that out.] g. Some hexadecimal number greater than your answer to part f. The difference between those two numbers is, when expressed in decimal, 24 if the difference between your answers to parts e and c is 16 or 23; 16 or 14 if that difference is 12; 16 if that difference is 15; 14 if that difference is 13; or (unlikely) 12 if that difference is 11. [Some people's debuggers seem to give the same answer as part f; we'll check that out.] Problem 2: #include <stack> using namespace std; const char WALL = 'X'; const char OPEN = '.'; const char SEEN = 'o'; class Coord { public: Coord(int rr, int cc) : m_r(rr), m_c(cc) {} int r() const { return m_r; } int c() const { return m_c; } private: int m_r; int m_c;
Image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
}; bool pathExists(char maze[][10], int sr, int sc, int er, int ec) { if (sr < 0 || sr > 9 || sc < 0 || sc > 9 || er < 0 || er > 9 || ec < 0 || ec > 9 || maze[sr][sc] != OPEN || maze[er][ec] != OPEN) return false; stack<Coord> toDo; toDo.push(Coord(sr,sc)); while ( ! toDo.empty() ) { Coord curr = toDo.top(); toDo.pop(); const int cr = curr.r(); const int cc = curr.c(); if (cr == er && cc == ec) return true; maze[cr][cc] = SEEN; // anything non-OPEN will do if (maze[cr-1][cc] == OPEN) toDo.push(Coord(cr-1,cc)); if (maze[cr+1][cc] == OPEN) toDo.push(Coord(cr+1,cc)); if (maze[cr][cc+1] == OPEN) toDo.push(Coord(cr,cc+1)); if (maze[cr][cc-1] == OPEN) toDo.push(Coord(cr,cc-1)); } return false; } Problem 3: (1,1) (1,2) (1,3) (1,4) (2,4) (3,4) (3,3) (3,5) (4,5) Problem 4: Make three changes to the Problem 2 solution:
Image of page 2
Change #include <stack> to #include <queue>
Image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern