Comp 410 - Study guides, Class notes & Summaries

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 performed when building a software product. What is the relationship between computer science and software engineering? - Name some of the problems resulting from team programming. - Interfacing pr...

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. requirements 2. analysis/specification 3. design phase 4. implementation phase 5. post-delievery phase 6. retirement what is modern view of maintenance software undergoes modifications to code and...

Athabasca University COMP 410 chapter 2 Software Life-Cycle Models quiz and answers

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 make another operation slower Providing more operations (making the data structure more general) may make some operations less efficient Operations are revealed through? - Interfaces and methods ...

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 - bucket sort traveling salesman problem - no efficient solution is known find a Hamiltonian path in a graph - no efficient solution is known complete graph with 12 vertices - dense graph ...

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 searching binary search O(logN) Stack - LIFO general ops: push, pop, top, empty, size keeps pointer to most recent slot, useful for reversing sequences top O(1) push O(1) pop O(1) Queue - F...

2024 COMP 410 tools of the Trade Answers chapter 5 actual solution Athabasca University

Athabasca University 2024 COMP 410 Teams Answers chapter 4 complete solution

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 make another operation slower Providing more operations (making the data structure more general) may make some operations less efficient Operations are revealed through? - Interfaces and methods

2024 COMP 410 Assignment 3 – Readings in Software Engineering Athabasca University