Engineering Academic Integrity website
Academic Integrity slides.
Wednesday, October 13, 2010
Wednesday, October 6, 2010
06 Oct, 2010: Lecture 7
Discussed computer architecture trends, and why multi-cores? What do multi-cores mean?
Wednesday, September 29, 2010
Wednesday, September 22, 2010
22 Sept, 2010: Lecture 5
A few tools to navigate through your curriculum, and monitor your progress towards your degree.
1. Presentation on DARS
2. Major Maps
3. Major Search
Although these look like zip files, they are .pptx.
Just open them with Powerpoint.
-Aviral
1. Presentation on DARS
2. Major Maps
3. Major Search
Although these look like zip files, they are .pptx.
Just open them with Powerpoint.
-Aviral
Homework from the class of Sept 22, 2010
Write a routine to test if a given list of numbers is sorted
IsSorted(n, a1, a2, …, an)
{
// return YES if a1, … an is sorted
// else return NO
}
Your algorithm should work for any 'n', any set of numbers, a1, ...., an, and for any permutation of numbers a1,... an, AND should finish in finite time.
Then answer the following questions
–Why will your solution work for any n?
–Why will your solution work for any given set of numbers?
–Why will your solution work for any permutation of those numbers?
–Why will your solution finish in finite time?
Deadline: Sunday, Sept 26, 2010.
IsSorted(n, a1, a2, …, an)
{
// return YES if a1, … an is sorted
// else return NO
}
Your algorithm should work for any 'n', any set of numbers, a1, ...., an, and for any permutation of numbers a1,... an, AND should finish in finite time.
Then answer the following questions
–Why will your solution work for any n?
–Why will your solution work for any given set of numbers?
–Why will your solution work for any permutation of those numbers?
–Why will your solution finish in finite time?
Deadline: Sunday, Sept 26, 2010.
Subscribe to:
Comments (Atom)