Loading...
Syllabus: Data Structures, CIS 2168, Spring 2025
Li, Cindy
Li, Cindy
Citations
Altmetric:
Genre
Syllabus
Date
2025
Advisor
Committee member
Group
Department
Computer and Information Science
Permanent link to this record
Collections
Research Projects
Organizational Units
Journal Issue
DOI
https://doi.org/10.34944/xj2j-9h08
Abstract
Description
In this course, you will learn a number of commonly used data structures, such as array list, linked list, stack, queue, binary search tree, hash set, hash map, graph, etc. You will learn how these data structures can be used to organize items in a data collection for efficient access. You will find out how they work, how to implement them, and how to use them to solve problems using Java. In addition, you will learn different searching and sorting algorithms: such as insertion sort, merge sort, heap sort, quick sort, binary search, etc. You will also learn more about recursion as a problem solving method and a way to construct recursive data structure.
Citation
Li, Cindy. Syllabus for Data Structures. Department of Computer Information Sciences, Temple U. Philadelphia, Spring 2025.
Citation to related work
Has part
ADA compliance
For Americans with Disabilities Act (ADA) accommodation, including help with reading this content, please contact scholarshare@temple.edu