Programming with data structures
A Cheng
6 points * 4 hours per week * First semester * Caulfield * Prerequisites: First-year programming * Prohibitions: CFR2121, CSC1011, CSC1021, CSC1030, RDT1400, SFT1101, SFT1102, SFT2202, TEC2041, TEC2042, TEC2342
The subject aims firstly to introduce students to the syntax and style of the C programming language. Familiarity with the language is developed within a UNIX environment and UNIX program development and debugging tools are used. The nature and use of the language as both imperative and functional is explored. Once the basic concepts of C have been taught, its use in implementation of basic data structures is discussed and practised using both recursive and, where appropriate, iterative techniques. The UNIX screen-handling package `curses' is introduced and students are expected to spend some time on their own gaining familiarity with this product.
Assessment
Examination (3 hours): 40% * Practical work: 40% * Test: 20%
Prescribed texts
Kelley A and Phol I A book on C 2nd edn, Benjamin-Cummings, 1984
Recommended texts
Ammeraal L Programs and data structures in C Wiley, 1987
Goodheart B Unix curses explained Prentice-Hall, 1991
Hanly J R and others Problem solving and program design in C Addison-Wesley, 1993
Miller L H and Quilici A E Programming in C Wiley, 1986
Plauger P J The standard C library Prentice-Hall, 1992
Sobell M G A practical guide to Unix system V Benjamin-Cummings, 1991