Introduction to problem-solving and algorithm development techniques based on the program development process. Students will apply these ideas by analyzing specifications, designing solutions, and implementing programs based on this analysis and design. A study of programming to include input and output procedures, arithmetic and logical operations, DO loops, branching procedures, arrays, declaration statements, and subroutines. Application of these ideas by writing, running, and correcting programs. Topics include input and output procedures, arithmetic expressions, conditional statements, table processing, and features of structured programming.
Emphasis is placed on the organization and processing of data files.
Programs with applications in business are written and debugged by the student. F, S. Introduction to problem-solving with algorithm and program development. F, S. Continuing study of algorithmic design, implementation, and analysis including object oriented design and implementation, abstract data types, stacks, queues, and linked structures. Topics include class structures, inheritance, polymorphism, encapsulation, data abstraction, type extensibility, class libraries, and reusable code design. Students will be required to write and run programs in assembler language.