Text
DATA STRUCTURE A Pseudocode Approach with C
Even the simplest program can be considered an application of data structures, but courses and texts with the words in the title have long been part of the computer science curriculum. The recommended curriculum is in the process of revision; guidelines for a new first course appeared in 1984, and those for the second course in 1985. In Curriculum '78 [1], there were three prerequisites to the data structures course, CS7. Much of the material from that syllabus is now included in the new CS2. The authors for both the new CS1 [2] and CS2 [3] curricula expect that most students “will have taken one or more programming courses in high school,” and that those who haven't will have to do extra work on their own. Existing textbooks reflect this situation, in that most were written for CS7, to be taught at the sophomore or junior level. Many texts for the new CS1 have appeared in the last few months, and publishers promise new choices for CS2 in the near future. It is also anticipated that a new syllabus for CS7 will be more advanced when it appears. Thus, we currently have data structures texts that are too hard for CS2 students, and too elementary for an upper-level data structures course. In addition to expecting very well-prepared freshmen, both the new CS1 and CS2 are organized for a four-credit format, including a two hour laboratory each week for at least CS1.
79212 | 005.73 GIL D | Lantai 2 | Tersedia |
Tidak tersedia versi lain