Comp 410 study exam - Study guides, Class notes & Summaries
Looking for the best study guides, study notes and summaries about Comp 410 study exam? On this page you'll find 6 study documents about Comp 410 study exam.
All 6 results
Sort by
-
COMP 410 Study Exam Questions and Answers 2024
- Exam (elaborations) • 27 pages • 2024
- Available in package deal
-
- CA$24.38
- + learn more
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...
-
ATHABASCA UNIVERSITY COMP 410 Final Exam Study Guide Questions and Answers 2024BUNDLED !!
- Package deal • 6 items • 2024
-
- CA$55.20
- + learn more
ATHABASCA UNIVERSITY COMP 410 Final Exam Study Guide Questions and Answers 2024BUNDLED !!
-
COMP 410 Final Exam Study Guide Questions and Answers 2024
- Exam (elaborations) • 17 pages • 2024
- Available in package deal
-
- CA$22.95
- + learn more
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 ...
-
comp 410 final exam study questions and answers UPDATED 2024
- Exam (elaborations) • 12 pages • 2024
- Available in package deal
-
- CA$22.23
- + learn more
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 
 ...
-
UNC COMP 410 final exam study questions and answers solved 2024
- Exam (elaborations) • 4 pages • 2024
- Available in package deal
-
- CA$17.92
- + learn more
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 log n 
 
insertion sort worst case time complexity - n^2 
 
insertion sort average case time complexity - n^2 
 
skip list sort worst case time complexity - n^2 
 
skip list sort average case time comp...
Get paid weekly? You can!
-
NU 410 midterm (PCC) Exam Questions and Answers
- Exam (elaborations) • 16 pages • 2024
-
- CA$14.34
- + learn more
NU 410 midterm (PCC) Exam Questions 
and Answers 
leaders, safe practice, technology - Ans:-what are the 3 components needed to win the war of health 
care harm mentioned in the video? 
julie cow - Ans:-who was the nurse who mixed the medications up in the video and lost her license? 
the joint commission - Ans:-what is the nonprofit accrediting agency for hospitals? 
sentinel event - Ans:-what do you call a =n event that has potential for harm (death. loss of limb, 
assault, abduction...) 
what...
That summary you just bought made someone very happy. Also get paid weekly? Sell your study resources on Stuvia! Discover all about earning on Stuvia