Return to Previous New Search
Catalog Entries

Temple University

Go to Main Content

 

 

HELP | EXIT

Catalog Entries

 

2018 Fall
Apr 29, 2024
Transparent Image
Legend:
Click on Course Title for Details

= This course has restrictions
= There are pre-requisites to take this course
= This course has co-requisites.
= There are fees to take this course.

Information Select the Course Number to get further detail on the course. Select the desired Schedule Type to find available classes for the course.

CIS 2168 - Data Structures

This course is typically offered in Fall and Spring.

A continuation of CIS 1068. Program style organization and design with continued emphasis on the object-oriented design paradigm. Understanding and use of data abstraction through Java classes and class libraries. Understanding and use of the following Abstract Data Types: strings, stacks, queues, priority queues, lists, linked lists, binary trees, heaps, and hash tables. Introduction to expression evaluation and other applications. Introduction to recursion and comparative analysis of searching and sorting algorithms and data structures. Sorting algorithms include insertion sort, mergesort, heapsort, and quicksort. Searching algorithms include binary search, hashing, and Huffman coding. NOTE: For Computer Science and Information Science and Technology Majors.
Credit Hours: 4.000

Levels: Graduate, NonDegree Continuing Undergrad, Undergraduate
Schedule Types: Lecture and Lab

Division: Undergraduate
Department: CST:Computer & Info Sci


Return to Previous New Search XML Extract
Transparent Image
Skip to top of page
Release: 8.7.2.4