CMPT 225

CMPT225 Final Review - MT 后 ppt22 Binary Heap ADT class ppt23 Priority Queue ADT class ppt26 Binary heap sort (见 MT 前 Sorting) ppt27-31 Hashing ADT class, Collision resolution strategies ppt32 Dictionary ADT class ppt33-34 Disk-bound data ppt34-36 Merge sort (见 MT 前 Sorting), B-tree external ADT class ADT Binary Heap Priority Queue Hashing Dictionary CDT Array Array: unsorted/ sorted LL: unsorted/ sorted BST ADT class Binary Heap ADT class: max/ min Array, Array+LL Arra...

CMPT 225, Spring 2018, Practice final Instructions: There are 7 questions worth 15 points each. Good luck! 1. Given two doubly linked lists, L 0 and L 00, give the pseudocode for a procedure for merging them into a single doubly linked list L that has all the nodes of L 0 followed by all the nodes of L 00, in the same order. What is the running time of your algorithm? 2. Suppose that a binary tree T is rooted at r and has n nodes. Provide a recursive or an iterative algorithm (your ch...

CMPT225, Spring 2021 Final Exam Name_________________________ SFU ID: |__|__|__|__|__|__|__|__|__| Problem 1 Problem 2 Problem 3 Problem 4 TOTAL Instructions: 1. You should write your solutions directly in this word file, and submit it to Coursys. Submitting a pdf is also ok. 2. Submit your solutions to Coursys before April 20, 23:59. No late submissions, no exceptions 3. Write your name and SFU ID on the top of this page. 4. This is an open book exam. You may use textbooks, calc...

CMPT 225 - Midterm 2 November 17, 2017 Time: 45 minutes DO NOT begin until told to do so. Fill in your name and student ID below. Turn off your phone and put it in your bag. Keep your student ID card on your desk at all times. You can't have anything other than a pen/pencil and your student ID card on you during the test. Before you begin, please check that your exam consists of 7 consecutively numbered questions and 2 pages of appendix. Read the questions carefully and more than once...

CMPT225 Final Review - MT 前 ppt2 ADT ppt3-7 List ADT class, Stack vs Heap memory allocation ppt9 Stack ADT class ppt10 Queue ADT class ppt11-12, 21, 26, 34 Searching, Sorting ppt14-18 BST ADT class ppt19-20 AVL ADT class ppt21 Tree sort (见 Sorting) ADT List Stack/ Queue BST CDT Array, LL Array LL, List ADT class Array, LL ppt2 1. ADT (1) 定义:  Abstract Data Type/ data collection  墙前能看: class interface in .h file - public 墙后不能看: data members in .h fi...

Simon Fraser University Computing Science 225 Fall 2019 Midterm Examination 2 Time: 50 minutes Circle the campus you attend most often: Burnaby Surrey Vancouver Last/Family Name (please, print): First Name (please, print): Student Number: Signature: Instructor: Anne Lavergne This examination has 7 pages.  No books, cheat sheets, calculators, computers, cell phones, or other materials may be used.  Read each question carefully before answering it.  List any assumptions you...