CS 106B Study Guide - Midterm Guide: Cemex, Xkcd, Substring
9 Jan 2019
School
Department
Course
Professor
Document Summary
Review session: sunday, february 3, 7:00 9:00 p. m. , hewlett 201 (next door) Problem 1: tracing c++ programs and big-o (10 points) Tuesday, february 5, 3:15 5:15 p. m. , braun auditorium (chemistry) Tuesday, february 5, 7:00 9:00 p. m. , cemex auditorium (gsb) Assume that the function puzzle has been defined as follows: int puzzle(int n) { if (n == 0) { return 0; Problem 2: vectors, grids, stacks, and queues (10 points) A legal sudoko grid (taken from figure 5-13 of the reader on page 252) therefore looks something like this: When you write a program to check whether a sudoku grid is legal, it simplifies the code to decompose the problem into two phases. In the first phase, your program calls a. 2 function that extracts a row, column, or 3 3 subsquare from the entire grid and returns it as a vector of nine integers.
