Package deal
ATHABASCA UNIVERSITY COMP 410 Final Exam Study Guide Questions and Answers 2024BUNDLED !!
ATHABASCA UNIVERSITY COMP 410 Final Exam Study Guide Questions and Answers 2024BUNDLED !!
[Show more]ATHABASCA UNIVERSITY COMP 410 Final Exam Study Guide Questions and Answers 2024BUNDLED !!
[Show more]What is software engineering? 
a discipline whose aim is the production of fault-free software, delivered on time and within budget, that satisfies the client's needs. The software must be easy to modify when the user's needs change 
What is classical software engineering life cycle model? 
1. req...
Preview 3 out of 29 pages
Add to cartWhat is software engineering? 
a discipline whose aim is the production of fault-free software, delivered on time and within budget, that satisfies the client's needs. The software must be easy to modify when the user's needs change 
What is classical software engineering life cycle model? 
1. req...
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...
Preview 2 out of 12 pages
Add to cartload 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...
Preview 2 out of 11 pages
Add to cartList 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...
Preview 1 out of 4 pages
Add to cartquick 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...
Preview 3 out of 17 pages
Add to cartA 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...
Preview 3 out of 27 pages
Add to cartUnit 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...
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Stuvia is a marketplace, so you are not buying this document from us, but from seller PossibleA. Stuvia facilitates payment to the seller.
No, you only buy these notes for CA$55.38. You're not tied to anything after your purchase.
4.6 stars on Google & Trustpilot (+1000 reviews)
84866 documents were sold in the last 30 days
Founded in 2010, the go-to place to buy study notes for 14 years now