Run-time AnalysisAlgorithmsHash TableTrees (Data Structures)Object-Oriented Programming (OOP)
Accelerated Computer Science Fundamentals 특화 과정
Data Structures and Algorithms in C++. Learn fundamentals of computer science while implementing efficient data structures in C++.
제공자:
Accelerated Computer Science Fundamentals 특화 과정일리노이대학교 어버너-섐페인캠퍼스배울 내용
Design and implement an object-oriented program in the C++ language, including defining classes that encapsulate data structures and algorithms.
Select and implement appropriate data structures that best utilize resources to solve a computational problem.
Analyze the running time and space needs of an algorithm, asymptotically to ensure it is appropriate at scale, including for big data.
Prepare for advanced courses in CS with the foundational knowledge of object data structures needed to implement and call advanced library functions.
귀하가 습득할 기술
이 전문 분야 정보
최근 조회 20,332회
Topics covered by this Specialization include basic object-oriented programming, the analysis of asymptotic algorithmic run times, and the implementation of basic data structures including arrays, hash tables, linked lists, trees, heaps and graphs, as well as algorithms for traversals, rebalancing and shortest paths.
This Specialization sequence is designed to help prospective applicants to the flexible and affordable Online Master of Computer Science (MCS) and MCS in Data Science prepare for the Online MCS Entrance Exam. The Online MCS Entrance Exam allows applicants who do not have graded and transcripted prerequisite CS coursework in the areas of data structures, algorithms, and object-oriented programming to strengthen their applications for admission. Learn more about the Online MCS Entrance Exam.
응용 학습 프로젝트
Students will solve weekly “challenge problems” by implementing fragments of C++ code in a web-based interface. Each course also features two longer-format coding projects where students will follow instructions to complete a C++ program that performs tasks such as editing images, efficiently manipulating data structures, or solving a graph search problem.
공유 가능한 수료증
완료 시 수료증 획득
100% 온라인 강좌
지금 바로 시작해 나만의 일정에 따라 학습을 진행하세요.
유동적 일정
유연한 마감을 설정하고 유지 관리합니다.
중급 단계
Learners should be able to write a program in a programming language (e.g. Python), and preferably have taken an introductory programming course.
완료하는 데 약 3개월이 걸립니다
권장 학습 속도: 주 5시간
영어
자막: 영어, 아랍어, 프랑스어, 포르투갈어 (유럽), 중국어 (간체자), 이탈리아어, 베트남어, 한국어, 독일어, 러시아어, 터키어, 스페인어
공유 가능한 수료증
완료 시 수료증 획득
100% 온라인 강좌
지금 바로 시작해 나만의 일정에 따라 학습을 진행하세요.
유동적 일정
유연한 마감을 설정하고 유지 관리합니다.
중급 단계
Learners should be able to write a program in a programming language (e.g. Python), and preferably have taken an introductory programming course.
완료하는 데 약 3개월이 걸립니다
권장 학습 속도: 주 5시간
영어
자막: 영어, 아랍어, 프랑스어, 포르투갈어 (유럽), 중국어 (간체자), 이탈리아어, 베트남어, 한국어, 독일어, 러시아어, 터키어, 스페인어
이 전문 분야에는 3개의 강좌가 있습니다.
Object-Oriented Data Structures in C++
1,838개의 평가
This course teaches learners how to write a program in the C++ language, including how to set up a development environment for writing and debugging C++ code and how to implement data structures as C++ classes. It is the first course in the Accelerated CS Fundamentals specialization, and subsequent courses in this specialization will be using C++ as the language for implementing the data structures covered in class.
Ordered Data Structures
570개의 평가
In this course, you will learn new data structures for efficiently storing and retrieving data that is structured in an ordered sequence. Such data includes an alphabetical list of names, a family tree, a calendar of events or an inventory organized by part numbers. The specific data structures covered by this course include arrays, linked lists, queues, stacks, trees, binary trees, AVL trees, B-trees and heaps. This course also shows, through algorithm complexity analysis, how these structures enable the fastest algorithms to search and sort data.
Unordered Data Structures
369개의 평가
The Unordered Data Structures course covers the data structures and algorithms needed to implement hash tables, disjoint sets and graphs. These fundamental data structures are useful for unordered data. For example, a hash table provides immediate access to data indexed by an arbitrary key value, that could be a number (such as a memory address for cached memory), a URL (such as for a web cache) or a dictionary. Graphs are used to represent relationships between items, and this course covers several different data structures for representing graphs and several different algorithms for traversing graphs, including finding the shortest route from one node to another node. These graph algorithms will also depend on another concept called disjoint sets, so this course will also cover its data structure and associated algorithms.
제공자:
일리노이대학교 어버너-섐페인캠퍼스
The University of Illinois at Urbana-Champaign is a world leader in research, teaching and public engagement, distinguished by the breadth of its programs, broad academic excellence, and internationally renowned faculty and alumni. Illinois serves the world by creating knowledge, preparing students for lives of impact, and finding solutions to critical societal needs.
자주 묻는 질문
환불 규정은 어떻게 되나요?
하나의 강좌에만 등록할 수 있나요?
재정 지원을 받을 수 있나요?
해당 강좌를 무료로 수강할 수 있나요?
이 강좌는 100% 온라인으로 진행되나요? 직접 참석해야 하는 수업이 있나요?
전문 분야를 완료하면 대학 학점을 받을 수 있나요?
전문 분야를 완료하면 대학 학점을 받을 수 있나요?
Do I need to take the courses in a specific order?
궁금한 점이 더 있으신가요? 학습자 도움말 센터를 방문해 보세요.
