현재 이 사이트는 활발히 개발 중입니다. 문제를 발견하시면 신고해 주세요! - 문제 신고하기

PROGRAMMING III

COMPSCI 400
과목 설명

The third course in our programming fundamentals sequence. Covers balanced search trees, graphs, graph traversal algorithms, hash tables and sets, and complexity analysis and about classes of problems that require each data type. Involves design and implementation using high quality professional code, a medium sized program, that demonstrates knowledge and use of latest language features, tools, and conventions. Additional topics may include inheritance and polymorphism; anonymous inner classes, lambda functions, performance analysis to discover and optimize critical code blocks. Introduces industry standards for writing high-quality, maintainable code.

선수과목

COMPSCI 300 , graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals

충족 요건
학점

미보고

개설 시기

미보고

평점
3.28

0.66% 과거 데이터 대비

수료율
95.68%

-0.4% 과거 데이터 대비

A 비율
31.25%

-9.4% 과거 데이터 대비

학급 규모
672

10.86% 과거 데이터 대비

Cumulative Grade Distribution

강사 (2026 Summr)

다음 사이트의 평점순으로 정렬 Rate My Professors

유사 과목

LEARNING A PROGRAMMING LANGUAGE

COMPSCI 368

For students interested in learning a particular programming language. Focuses on a specific language offered at one of three levels: beginner, intermediate, and advanced. Students may repeat the course if the topic title is different.

PROGRAMMING II

COMPSCI 300

Introduction to Object-Oriented Programming using classes and objects to solve more complex problems. Introduces array-based and linked data structures: including lists, stacks, and queues. Programming assignments require writing and developing multi-class (file) programs using interfaces, generics, and exception handling to solve challenging real world problems. Topics reviewed include reading/writing data and objects from/to files and exception handling, and command line arguments. Topics introduced: object-oriented design; class vs. object; create and define interfaces and iterators; searching and sorting; abstract data types (List,Stack,Queue,PriorityQueue(Heap),Binary Search Tree); generic interfaces (parametric polymorphism); how to design and write test methods and classes; array based vs. linked node implementations; introduction to complexity analysis; recursion.

PROGRAMMING I

COMPSCI 200

Learn the process of incrementally developing small (200-500 lines) programs along with the fundamental Computer Science topics. These topics include: problem abstraction and decomposition, the edit-compile-run cycle, using variables of primitive and more complex data types, conditional and loop-based flow control, basic testing and debugging techniques, how to define and call functions (methods), and IO processing techniques. Also teaches and reinforces good programming practices including the use of a consistent style, and meaningful documentation. Intended for students who have no prior programming experience.

INTRODUCTION TO PROGRAMMING LANGUAGES AND COMPILERS

COMPSCI 536

Introduction to the theory and practice of compiler design. Comparison of features of several programming languages and their implications for implementation techniques. Several programming projects required.

PRINCIPLES OF PROGRAMMING LANGUAGES

COMPSCI 704

Introduction to principles of advanced programming languages and programming-language theory. Topics include: lambda-calculus, functional languages, polymorphic functions, type inference, structural induction, lazy evaluation, operational semantics, denotational semantics, and axiomatic semantics. Students are strongly encouraged to have knowledge of programming languages, such as fromCOMP SCI 536.