CPSC 231: Final Exam Information L03

General information:

• Exam weight: 35% of overall course grade
  
• Duration: 120 minutes
  
• This is a closed book exam: No electronic devices (e.g., cell phones) or computational aids (e.g., calculators, laptops, hand computers, slide rules, abaci) will be allowed).
• The exam is scheduled by the Registrars Office and not me so to find additional time/location details you should either go to the university portal or the following url: www.ucalgary.ca/infonet

General instructions:

• Write your name on the outside cover of this exam and your name and student identification number on the inside (second page).
  

• Unless otherwise stated assume that all programs and program fragments will compile.
  

• When you are done hand in this exam booklet and your multiple choice bubble sheet at the front.
  

Instructions for the multiple choice questions:

• For each question pick the answer that best answers the question.
  

• Mark your answers with an HB pencil or darker
  

• Make sure that you fill in all the labelled categories regarding your contact information on the computerized bubble sheet.
  

• Make sure you fill in all your answers in the computerized bubble sheets and not in this exam.
  

Instructions for the short answer questions:

·         Make sure you fill in all your answers in the space provided in this exam booklet.

 

 

Review materials

• Final exam review session: Friday April 21st from 3 PM - 5 PM in ST141 (This is not the same as the final exam: Again if you want information for the final exam then go to the web site for the Registrars Office)

  Sample exam questions

  Solutions to the sample exam
  

Approximate exam breakdown by type of question
Question type	Percentage weight of exam
Multiple choice questions	~10%
Written questions (code traces, code writing, questions about programming concepts)	~90%

 

Topics that are likely candidates for the larger written questions

Problem decomposition / modular design

Arrays (1D, 2D)

Records

Arrays of records

File input and output

Pointers

Linked lists

 

Topics that are more likely to be included as multiple choice questions or for smaller written questions (worth fewer marks)

Material that was covered before the midterm (except for modular design)

Sorting

Recursion

Computer history (if we have time to get to it)