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.
Repeatability: This course may not be repeated for additional credits.
Pre-requisites: Minimum grade of C- in (CIS 1068 or CIS 1968), (CIS 1166, CIS 1966, or MATH 2111), and (MATH 1022, any MATH course numbered 1038 to 4999 (may be taken concurrently), 'Y' in MC6, 'Y' in MA04, 'Y' in MC6A, 'Y' in MATW, or 'Y' in MC6T)
参考:https://bulletin.temple.edu/courses/cis/
>>CIS 1068. Program Design and Abstraction. 4 Credit Hours.
For any CIS prerequisite course taken prior to Spring 2012 a grade of C or better is required.
Repeatability: This course may not be repeated for additional credits.
Pre-requisites: Minimum grade of C- (except where noted) in (CIS 1051, CIS 1057, or 'Y' in CISA) and (MATH 0702 (C or higher), any MATH course numbered 1021 to 4999 (may be taken concurrently), 'Y' in MC4, 'Y' in MC5, 'Y' in MC6, 'Y' in MC6A, 'Y' in MC6T, or 'Y' in MATW)
>>CIS 1968. Honors Program Design and Abstraction. 4 Credit Hours.
Cohort Restrictions: Must be enrolled in one of the following Cohorts: SCHONORS, UHONORS, UHONORSTR.
Course Attributes: HO
Repeatability: This course may not be repeated for additional credits.
Pre-requisites: Minimum grade of C- (except where noted) in (CIS 1051, CIS 1057, or CIS 1951) and (MATH 1041 (C or higher; may be taken concurrently), MATH 1941 (C or higher; may be taken concurrently), MATH 1038 (C or higher; may be taken concurrently), MATH 1042 (may be taken concurrently), MATH 1044 (may be taken concurrently), MATH 1942 (may be taken concurrently), MATH 1951 (may be taken concurrently), any MATH course numbered 2043 to 3080 (D or higher; may be taken concurrently), 'Y' in MA06, 'Y' in MATW, 'Y' in CRMA08, or 'Y' in CRMA21)
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· 分享4款.NET开源、免费、实用的商城系统
· 全程不用写代码,我用AI程序员写了一个飞机大战
· MongoDB 8.0这个新功能碉堡了,比商业数据库还牛
· 白话解读 Dapr 1.15:你的「微服务管家」又秀新绝活了
· 上周热点回顾(2.24-3.2)
2022-09-09 java字符串中查找某个字符出现的位置
2021-09-09 Vuex:$store.state取不到值
2021-09-09 arcgis地理配准第二种方法:利用已知控制点 (Spatial Adjustment和Georeferencing的区别)
2017-09-09 用orb-slam2跑RGB-D Example中的TUM Dataset
2017-09-09 Matlab图像处理教程