ATHABASCA UNIVERSITY COMP 410 Final Exam Study Guide Questions and Answers 2024BUNDLED !!

load lambda - how full the table currently is foo(N-1) time complexity - O(N) foo(N-1) - foo(N-2) - O(2^N) foo(foo(N-1)) - O(2N) or O(N) stable sort that is O(NlogN) worst case - merge sort unstable sort that is O(NlogN) worst case - heap sort sort algorithm that is O(N) worst case...

List Data Structure - general ops: get k items, insert at k, delete at K Implementing as List ins O(1) rem O(1) Get O(n) Find O(n) Empty O(1) Size O(n) or O(1) Implementing as Array ins O(N) rem O(N) Get O(1) Find O(n) Empty O(1) Size O(1) Ordered List - can assist in list s...

quick sort average case time complexity - n log n quick sort worst case time complexity - n^2 selection sort worst case time complexity - n^2 selection sort average case time complexity - n^2 merge sort worst case time complexity - n log n merge sort average case time complexity - n l...

A data structure is - a particular way of organizing data in a computer so that it can be used efficiently An Abstract Data Type is - A set of objects together with a set of operations (They are a mathematical abstraction) Common Trade-offs - Time vs Space Making one operation faster may m...

Unit 1 - In what year was the term software engineering coined by a NATO study group? - 1967 Why is so much of today's software not considered to have been engineered? - What is the life cycle of software engineering? - A life-cycle model is a description of the steps that should be perf...