3 hours lecture per week
Prerequisite(s): A grade of “B” or higher in ICS 111 or consent of the instructor.
This course builds upon the topics covered in ICS 111 by reinforcing and strengthening problem-solving skills using more advanced features of programming languages and algorithms such as recursion, pointers, and memory management. ICS 211 emphasizes the use of data structures such as arrays, lists, stacks, and queues.
ICS211 – PDF
Hi! My name is Dr. David Nickles, an instructor here at Kapiolani Community College. In the ICS 111 video, I compared programming to learning to play a music instrument. In this respect, ICS 211 is similar to combining music appreciation and composition. In this course you will learn the many convention ways to create feature rich programs through data structures and algorithm development. Think of it as the rhythms and melodies that form complete songs. Learning by imitating the designs of others is a useful starting strategy. In this course you will consider design patterns for data and algorithms in thoughtful study. Remember as long as you program frequently, you will become an accomplished programmer. I look forward to seeing you in ICS 211, introduction to computer science II.