Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

CSC 490 - Time & Space Complexity: SCAN vs STOR Algorithms - Prof. Gary Locklair, Assignments of Computer Science

Information about a computer science homework assignment from the csc 490 - computer science senior seminar i course taught by professor gary locklair during the fall 2006 semester. The assignment focuses on understanding the time and space complexity differences between the scan and stor algorithms. Students are required to explain the reasons for the difference in performance, write c++ code for both algorithms, and submit the code and project files to the chemnitz file server.

Typology: Assignments

Pre 2010

Uploaded on 07/23/2009

koofers-user-ke9
koofers-user-ke9 🇺🇸

10 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CSC 490 – Computer Science Senior Seminar I Professor Gary
Locklair
Written Homework Assignment #4 Fall
2006
Chapter 15 in The New Turing Omnibus – Time and Space Complexity
assignment A: Explain in words why SCAN is much slower than STOR by
examining the algorithms
B. Create C++ code for SCAN
C. Create C++ code for STOR
(for ease of coding assume maximum size of A array is 10 and the
maximum size of the B array is 100)
{30 points}
Please word process part A. Place code listing and Codewarrior project files
on Chemnitz file server (folder named “wassn4” under CSC490) for parts B
and C.
CSC 490 – Computer Science Senior Seminar I Professor Gary
Locklair
Written Homework Assignment #4 Fall
2006
Chapter 15 in The New Turing Omnibus – Time and Space Complexity
assignment A: Explain in words why SCAN is much slower than STOR by
examining the algorithms
B. Create C++ code for SCAN
C. Create C++ code for STOR
(for ease of coding assume maximum size of A array is 10 and the
maximum size of the B array is 100)
{30 points}
pf2

Partial preview of the text

Download CSC 490 - Time & Space Complexity: SCAN vs STOR Algorithms - Prof. Gary Locklair and more Assignments Computer Science in PDF only on Docsity!

CSC 490 – Computer Science Senior Seminar I Professor Gary Locklair Written Homework Assignment #4 Fall 2006 Chapter 15 in The New Turing Omnibus – Time and Space Complexity assignment A: Explain in words why SCAN is much slower than STOR by examining the algorithms B. Create C++ code for SCAN C. Create C++ code for STOR (for ease of coding assume maximum size of A array is 10 and the maximum size of the B array is 100) {30 points} Please word process part A. Place code listing and Codewarrior project files on Chemnitz file server (folder named “wassn4” under CSC490) for parts B and C. CSC 490 – Computer Science Senior Seminar I Professor Gary Locklair Written Homework Assignment #4 Fall 2006 Chapter 15 in The New Turing Omnibus – Time and Space Complexity assignment A: Explain in words why SCAN is much slower than STOR by examining the algorithms B. Create C++ code for SCAN C. Create C++ code for STOR (for ease of coding assume maximum size of A array is 10 and the maximum size of the B array is 100) {30 points}

Please word process part A. Place code listing and Codewarrior project files on Chemnitz file server (folder named “wassn4” under CSC490) for parts B and C.