Data Structures

  • Course Number: 2168
  • Subject: Computer and Information Science
  • Semester(s) Offered: Fall
  • Credit Hours: 4
  • Description:

    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.

  • Special Notes:

    Taught in English

  • Pre-requisites:

    Minimum grade of C- in program design and abstraction (at Temple CIS 1068 or 1968), and mathematical concepts in computing or basic concepts of math (at Temple CIS 1166, CIS 1966 or MATH 2111), and pre-calculus (at Temple MATH 1022), or equivalent