CS2 Data Structures Activity
(Difference between revisions)
| Line 16: | Line 16: | ||
##Analyze the time complexity of an algorithm that uses the data structure. | ##Analyze the time complexity of an algorithm that uses the data structure. | ||
|- | |- | ||
| − | |'''Materials/Environment''' || | + | |'''Materials/Environment''' || Access to OpenMRS codebase |
|- | |- | ||
| − | |'''Rights''' || | + | |'''Rights''' || Licensed CC BY-SA |
|- | |- | ||
| − | |'''Turn In''' || | + | |'''Turn In''' || Written artifact to Instructor |
|} | |} | ||
Revision as of 15:13, 30 May 2014
Preparation:
| Description | Using the HFOSS OpenMRS project to illustrate the use of data structures in a complex system |
| Source | POSSE 201405 Workshop Activity |
| Prerequisite Knowledge | CS1 and Java |
| Estimated Time to Completion | Varies , designed as one assignment or laboratory activity |
| Learning Objectives | ##Describe the difference between a data structure and the implementation thereof.
|
| Materials/Environment | Access to OpenMRS codebase |
| Rights | Licensed CC BY-SA |
| Turn In | Written artifact to Instructor |
