Detailed Course Information

Select the desired Level or Schedule Type to find available classes for the course.

CIS 2168 - Data Structures
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 General Requirements: ( Course or Test: CIS 1068 \| Minimum Grade of C- \| May not be taken concurrently. ) OR ( Course or Test: CIS 1968 \| Minimum Grade of C- \| May not be taken concurrently. ) AND ( Course or Test: CIS 1166 \| Minimum Grade of C- \| May not be taken concurrently. ) OR ( Course or Test: CIS 1966 \| Minimum Grade of C- \| May not be taken concurrently. ) OR ( Course or Test: MATH 2111 \| Minimum Grade of C- \| May not be taken concurrently. ) AND ( Course or Test: MATH 1022 \| Minimum Grade of C- \| May not be taken concurrently. ) OR ( Course or Test: MATH 1038 to 4999 \| Required Courses: 1 \| Minimum Grade of C- \| May be taken concurrently. ) OR ( MC6 Y - May not be taken concurrently. ) OR ( MA04 Y - May not be taken concurrently. ) OR ( MC6A Y - May not be taken concurrently. ) OR ( MATW Y - May not be taken concurrently. ) OR ( MC6T Y - May not be taken concurrently. )

CIS 2168 - Data Structures

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

General Requirements:
( Course or Test: CIS 1068 | Minimum Grade of C- | May not be taken concurrently. )
OR
( Course or Test: CIS 1968 | Minimum Grade of C- | May not be taken concurrently. )
AND ( Course or Test: CIS 1166 | Minimum Grade of C- | May not be taken concurrently. )
OR
( Course or Test: CIS 1966 | Minimum Grade of C- | May not be taken concurrently. )
OR
( Course or Test: MATH 2111 | Minimum Grade of C- | May not be taken concurrently. )
AND ( Course or Test: MATH 1022 | Minimum Grade of C- | May not be taken concurrently. )
OR
( Course or Test: MATH 1038 to 4999 | Required Courses: 1 | Minimum Grade of C- | May be taken concurrently. )
OR
( MC6 Y - May not be taken concurrently. )
OR
( MA04 Y - May not be taken concurrently. )
OR
( MC6A Y - May not be taken concurrently. )
OR
( MATW Y - May not be taken concurrently. )
OR
( MC6T Y - May not be taken concurrently. )

Return to Previous	New Search

Return to Previous

New Search

Skip to top of page

Temple University

Detailed Course Information

© 2024 Ellucian Company L.P. and its affiliates.