CSE 333 Midterm Exam
April 27th, 2012
Your Name:
_ Solution Set _
Student ID:
_
General Information:
This is a closed book examination. You have 50 minutes to answer as many
questions as possible. The numbers in parentheses at the beginning of each
questi
/*
* Copyright 2011 Steven Gribble
*
* This file is part of the UW CSE 333 course project sequence
* (333proj).
*
* 333proj is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* th
# define the commands we will use for compilation and library building
AR = ar
ARFLAGS = rcs
CC = gcc
CXX = g+
# define useful flags to cc/ld/etc.
CFLAGS += -g -Wall -Wpedantic -I. -I. -O0
LDFLAGS += -L. -lhw1
CPPUNITFLAGS = -L./gtest -lgtest
# define com
/*
* Copyright 2011 Steven Gribble
*
* This file is part of the UW CSE 333 course project sequence
* (333proj).
*
* 333proj is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* th
/*
* Copyright 2012 Steven Gribble
*
* This file is part of the UW CSE333 project sequence (333proj).
*
* 333proj is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published
* by the Free Sof
CSE 333 Final Exam
June 6th, 2012
Your Name:
_
Student ID:
_
This is a closed book examination. You have 90 minutes to answer as many questions
as possible. The numbers in parentheses at the beginning of each question indicate the
number of points given t
CSE 333 Final Exam Sample Solution 6/12/13
Question 1. (18 points) A little C+ hacking. On the following page, implement
function intersect. The input to the function is two lists of strings that are sorted in
ascending order and do not contain duplicates
CSE 333 Midterm Exam Sample Solution 7/23/12
Question 1. (20 points) A little C programming. A palindrome is a string that reads the
same forwards or backwards. For instance, madam, abba, and x are palindromes,
while ab, and foo are not. You are to comple
CSE 333 Midterm Exam 2/14/14 Sample Solution
Question 1. (36 points) C programming. Recall from CSE143 that a Binary Search Tree
(BST) is a binary tree where each node contains a value, and for each node n, every value
in the left subtree of n is less tha
CSE 333 Midterm Exam Sample Solution 5/10/13
Question 1. (18 points) Consider these two C files:
a.c
b.c
void f(int p);
void f(char *p) cfw_
*p = 'x';
int main() cfw_
f(17);
return 0;
(a) Why is the program made from a.c and b.c incorrect? What would yo
CSE 333 Final (i.e., 2nd midterm) Exam Sample Solution 8/17/12
Question 1. (20 points) A little C+ hacking. One of the summer interns has been
working on a small C+ class to hold a list of integers using an array to store the data.
Items are added at the
CSE 333 Midterm Exam
May 9th, 2011
Your Name:
_SOLUTION SET_
Student ID:
_
General Information:
This is a closed book examination. You have 50 minutes to answer as many
questions as possible. The number in parentheses at the beginning of each
question ind
CSE 333 Midterm Exam Sample Solution 7/29/13
Question 1. (44 points) C hacking a question of several parts.
The next several pages are questions about a linked list of 2-D points. Each point is
represented by a Point struct containing the points x and y c
CSE 333 Final Exam (2nd Midterm) Sample Solution 8/22/13
Question 1. (20 points) A little C+ hacking. On the following page, implement
function undup. The input to this function is a list of strings that are not sorted in any
particular order. The functio
/*
* Copyright 2011 Steven Gribble
*
* This file is part of the UW CSE 333 course project sequence
* (333proj).
*
* 333proj is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* th
/*
* Copyright 2012 Steven Gribble
*
* This file is part of the UW CSE 333 project sequence (333proj12).
*
* 333proj12 is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published
* by the Fre