Resources

Data Structures

Data Structures

 

1. CSE 326: Data Structures

Abstract data types and their implementations as data structures. Efficient of algorithms employing these data structures; asymptotic analyses. Dictionaries: balanced search trees, hashing. Priority queues: heaps. Disjoint sets with union, find. Graph algorithms: shortest path, minimum spanning tree, topological sort, search. Sorting. Not available for credit for students who have completed CSE 373. Prerequisite: CSE 321.

Class description

This course will be about data structures, which are key to all efficient and effective programs one writes in practice. We will try to develop a clear theoretical understanding of the importance, strengths and weaknesses of various data structures such as stacks, graphs and dictionaries. There will also be a significant focus on implementations of these ideas to solve some interesting problems. The programming language used will be Java.

University of Washington Seattle

 

2. CSCE 270: Data Structures: Study of object-oriented programming techniques and fundamental data structure abstractions and implementations including list, stack, queue, and trees with applications to sorting, searching, and data storage. Prerequisite: CSCE 144. (4)

Pacific Lutheran University

 

3. CS 301 – Data Structures

Description:
Introduction to data structures, simple list processing, basic searching and sorting techniques, stacks, queues, and trees. Prerequisites & Notes: Prerequisites: CS 111 and MATH 154. Credits: (4)

Central Washington University

 

4. CSCD 300 Data Structures (4)

Prerequisites: CSCD 211 with a minimum grade of 2.5, MATH 105 or MATH 115 with a minimum grade of 2.0. This course covers fundamental abstract concepts of data structures as well as their implementation in a programming language. Topics include linked lists, stacks, queues, hashing, recursion, complexity analysis of algorithms, binary search trees and heaps. Programming projects with formal documentation are required.

And,

CSCD 303 Computer and Information Security (4)
Prerequisites: computer literacy clearance. This course covers fundamentals of computing security, including threat types, how computers become infected with viruses and malware, how to avoid viruses and malware, and how to secure your computers and the information stored on them. Possible topics include: operating system security, email security, internet security, virus and spyware scanners, browser tools, firewalls and other defensive techniques. The course includes hands-on practice with security tools and techniques.

Eastern Washington University

 

5. CSC 2430: Data Structures I

Prerequisite: CSC 1230 or equivalent. Develops discipline in program design, style, debugging, testing. Introduces object-oriented design with classes, methods, and encapsulation. Introduces dynamic storage allocation and pointers. Examines arrays, linked linear data structures, and recursion.

Seattle University

 

6. CS 280 Data Structures (3 Cr.)

Prerequisite(s): CS 225 This course introduces the classical abstract data types (ADT)  in computer science. ADTs provide the hierarchical views of data organization used in programming. Among the topics covered are the algorithms and primitives of the data structures for arrays, linked lists, stacks, queues, trees, hash tables, and graphs. In addition, the course provides an introduction to algorithm complexity and notation.

Digipin

 

 

 

7. ITC 255 SYSTEMS ANALYSIS    5

Identify when a system needs to be upgraded or replaced. Analyze system components and requirements, charting process flow and data structures, determining feasibilities and providing alternate solutions.

Seattle Central Community College

 

8. CS 280 — Data Structures (5 cr)

This course explores data types, abstract data types, and data structures. Efficiency of algorithms is discussed extensively. Sequential and linked lists will be implemented. Students will be able to create, represent, and traverse binary trees. Searching is extensively covered, including dictionaries, priority queues, and hashing. Directed graphs and depth-first algorithms will be introduced. Additional topics include: garbage collection, dynamic storage allocation and sorting. Prerequisite: CS 142. (SFCC)

Spokane Falls Community College

 

9. CIS 168 Programming Logic 5

An introduction to the mathematics of computer programming. Covers symbolic logic, set theory, truth tables, number systems, algorithm design, decision table and logic diagrams. Prerequisite: MATH 099.

South Puget Sound Community College

 

10.  BIT 265 5 credits Structures and Algorithms

E, Q- This course teaches the students about the design and analysis of algorithms. Students learn about big O notation, trees, tables, graphs, hashing, and methods of sorting and searching. Prerequisite(s): Completion of BIT 143 with a grade of 2.0 or higher.

Cascadia College

 

11. CIT 245 DATA & LOGIC STRUCTURES  5CR

Expand your understanding of object-oriented programming techniques by implementing abstract data types as data structures in solving complex computing problems. Study the fundamental algorithms of computer science while using mathematical principles to analyze the efficiency of their implementation. Prerequisite: CIT 143.

Clover Park Technical College

 

12.  CS 260 Data Structures in C++ • 5 Credits

This course is the third in a series of three in which students will learn the C++ programming language and how to implement and use different types of data-structures. This will lead students to create data-driven programs and algorithms. Students will also learn more about linked lists, stacks, queues, binary trees, and binary search, recursion, and sorting. The course starts at a level that assumes a good working knowledge of C++. Prerequisite: CS 162 or instructor’s permission. All prerequisites must be passed with a 2.0 or better before taking this class.

Columbia Basin College

 

13.  C SCI 252 – Advanced Data Structures with C++ 5 credits

Prereq: C SCI 152. Algorithms analysis using trees; stacks; linked lists; queues; priority queues; classes; templates and the STL; program specifications and contracts; object-oriented implementation; implementing data abstraction, encapsulation, abstract base classes, inheritance and polymorphism. Based on ACM (Association for Computing Machinery) curriculum guidelines for Computer Science II.

Highline Community College

 

14.  COMPUTER INFORMATION SYSTEMS* 173 Java II – Data Structures (5)

Continuation of Level I Programming course emphasizing design, algorithms, abstraction, analysis, classes, data structures, dynamic memory management, file processing, standard libraries, creating interactive solutions. Prerequisite: CIS 162 C++I or instructor’s permission. Student option grading.

scalaway@shoreline.edu

Shoreline Community College

 

15.  CS 212 C++ Data Structures • 5 Cr.

Completes one year sequence with data structures using C++, including lists, hash tables, stacks, queues, trees, and graphs. Contrasts the implementations of such data structures in different languages, specifically the differences between pointers versus references, templates versus generics, dynamic versus static memory allocation, multiple inheritance, and destructors. Prerequisite: CS 211.

Bellevue College

 

16.  122 Data Structures 4 (3-3)

Course Prerequisite: CPT S 121 with a C or better. Advanced programming techniques: data structures, recursion, sorting and searching, and basics of algorithm analysis.

Washington State University

 

 

 

Centers of Excellence

Developing partnerships among business, industry and education to meet the future needs of Washington State.