= Calculus, probability, linear algebra, discrete mathematics, logic and proof, and models of computation examination paper by the University of Oxford (2003)
{c}
{title2=CCOM 4214}
{title2=2003-09-25}
Original seven-page Preliminary Examination in <computer science>, Long Vacation, 25 September 2003. Released in https://www.whatdotheyknow.com/request/past_exam_papers_for_1st_year_of/response/1398416/attach/2/Fakour%20Zip%20Final%201.zip?cookie_passthrough=1[the examination archive], member `4214-1.pdf`. The printed cover identifies Paper 2. Question 7's definition of a <directed set> does not exclude the empty set; under that convention its completeness assumption also requires a <least element>.
Back to article page
