Course info

Study of advanced programming topics focused on logical structures of data as well as the design, implementation and analysis of algorithms operating on these structures. Topics include linked lists, stacks, trees, queues, graphs and analysis of efficiency. Also covers searching, sorting and hashing techniques. 

Course Objectives. 

1. Develop algorithms for manipulating stacks, queues, linked lists, hash tables, trees, and graphs. 

2. Develop the data structures for implementing the above algorithms. 

3. Develop recursive algorithms. 

4. Familiarize the student with the issue

Critical thinking, problem solving and information literacy: Students will use critical thinking and problem-solving skills in analyzing information gathered through different media and from a variety of sources. Students will identify a problem and analyze it in terms of its significant parts and the information needed to solve it. Students will use computers to access, analyze or present information, solve problems, and communicate with others. Students will formulate and evaluate possible solutions to problems, and select and defend the chosen solutions. Students will recognize weaknesses in arguments, such as the use of false or disputable premises, suppression of contrary evidence, faulty reasoning, and emotional loading