This is an archived copy of the catalog. Introduction to the procedures and policies of Iowa State University and the Department of Computer Science, test-outs, honorary societies, etc. Issues relevant to student adjustment to college life will also be discussed. Offered on a satisfactory-fail basis only. Introduction to computer literacy and applications. Literacy: history of computing, structure of computers, telecommunications, computer ethics, computer crime, and history of programming languages.
No prior computer experience necessary. Course is offered online only. Students must attend an orientation session the first week of class. Offered first 8 weeks and last 8 weeks. Use of personal computer and workstation operating systems and beginning programming. Project-oriented approach to computer operation and programming, including use of tools to aid in programming. Topics from computer history, using basic Windows and Unix tools, program structure, expression, variables, decision and logic, and iteration.
Introduction to computer programming for non-majors using a language such as the Visual Basic language. Basics of good programming and algorithm development. Graphical user interfaces. Emphasis on the design, writing, debugging, and testing of business applications programs in a transaction-oriented environment.
Computer science as a profession. Introduction to career fields open to computer science majors. Relationship of coursework to careers. Presentations by computer science professionals. COM S Fundamentals of Computer Programming. Cross-listed with MIS. Emphasis on the basics of good programming techniques and style. Extensive practice in designing, implementing, and debugging small programs.
(mh=XL615XVruRv9Z8E0)1.jpg "Escort girls in Béziers")
Use of abstract data types. This course is not designed for computer science, software engineering, and computer engineering majors. Intermediate Computer Programming. Emphasis on designing, writing, testing, debugging, and documenting medium-sized programs. Data structures and their uses. Dynamic memory usage. Inheritance and polymorphism. Algorithm design and efficiency: recursion, searching, and sorting.
