CollegeTransfer.Net

Course Criteria

Add courses to your favorites to save, share, and find your best transfer school.

  • CS 110: Introduction to Information Technologies

    3.00 Credits
    Clarkson University

    This course is an introduction to underlying technology components of modern information systems across various areas, ranging from health care and education, to business and commerce to science and engineering. Emphasis is on introducing students of all backgrounds to the main building blocks of an information system in a practical and applied way, emphasizing commonalities in structure and function across multiple platforms. Students are introduced to fundamental concepts in information technology as well as common means of implementation and deployment. Students will learn how information systems support individual and organizational decision making in variety of contexts. The course consists of lectures and weekly computer laboratory sessions.
    ShareCS 110 - Introduction to Information Technologies
    Favorite

  • CS 141: Introduction to Computer Science I

    4.00 Credits
    Clarkson University

    This course is an introduction to basic concepts of computer science, with emphasis on programming. Computer programming is to the study of computer science what writing is to the study of literature. It is a primary tool for implementing algorithms in computer science. Fundamental techniques for software design and implementation will be covered and these concepts demonstrated in a programming language like C++. Additional topics include top-down modular design, developing general-purpose software tools, procedural and data abstraction, algorithms, and an introduction to recursion and dynamic data structures. The course consists of three hours of lecture and a one hour computer laboratory session per week.
    ShareCS 141 - Introduction to Computer Science I
    Favorite
    Show comparable courses

  • CS 142: Introduction to Computer Science II

    3.00 Credits
    Clarkson University

    This course will further develop and expand upon the topics introduced in CS 141. Advanced programming techniques will be covered, with extensive use of recursion and dynamic data structures. Abstract data types, including lists, queues, trees and graphs, will be studied. Specific emphasis will be given to tree traversals and binary search trees. Algorithms for searching and sorting will be explored along with methods of comparative analysis. The topics in this course provide an essential foundation for the further study of computer science.
    ShareCS 142 - Introduction to Computer Science II
    Favorite
    Show comparable courses

  • CS 241: Computer Organization

    3.00 Credits
    Clarkson University

    An introduction to computer organization and assembly language programming. Topics include the functional organization of computer hardware; data representation, and computer arithmetic; instruction sets, addressing modes and low-level I/O. Introduces machine and assembly language, and systems programming techniques in the programming language C. This course serves as a foundation for courses on operating systems, compilers, networks, and computer artchitecture.
    ShareCS 241 - Computer Organization
    Favorite
    Show comparable courses

  • CS 344: Algorithms and Data Structures

    3.00 Credits
    Clarkson University

    The primary goal of this course is to build on the programming skills gained in CS 141 and 142 to introduce students to more sophisticated algorithms and data structures and the notion of algorithm design. The course also introduces the basic formalism and concepts used in the analysis of algorithms. The relative efficiency of the algorithms studied is estimated by informal application of these ideas. The algorithms and data structures discussed include those for sorting and searching, pattern matching, set representation, graph problems, dynamic programming and others. Programming exercises based on "realistic" applications help students to understand the often difficult process of reducing a real-world problem to a standard algorithmic question.
    ShareCS 344 - Algorithms and Data Structures
    Favorite

  • CS 408: Directed Study in Computer Science

    1.00 - 15.00 Credits
    Clarkson University

    Prerequisites: consent of the instructor.
    ShareCS 408 - Directed Study in Computer Science
    Favorite

  • CS 412: Directed Study in Applied Computer Science

    1.00 - 15.00 Credits
    Clarkson University

    Prerequisites: consent of the instructor.
    ShareCS 412 - Directed Study in Applied Computer Science
    Favorite

  • CS 442: Computational Complexity

    3.00 Credits
    Clarkson University

    The complexity of a computational problem is the amount of computer resources it requires. Computational complexity theory studies the complexity of computational problems as well as relationships between different types of resources. This course will cover both classical and research-related topics in computational complexity, such as: complexity measures and complexity classes for sequential machines and Boolean circuits, reductions and completeness, hierarchy theorems, relativization, circuit complexity, and proof complexity.
    ShareCS 442 - Computational Complexity
    Favorite

  • CS 444: Operating Systems

    3.00 Credits
    Clarkson University

    This course is an introduction to the concepts of operating systems, their structures and organization. Major topics include process management (asynchronous processes, interprocess communication and synchronization, multithreading, deadlock and starvation, scheduling), storage management (paging/segmentation, virtual memory, file systems), protection and security issues, and an introduction to distributed systems. To demonstrate these concepts, case studies of operating systems will be presented, and a programming project will be an integral part of the course.
    ShareCS 444 - Operating Systems
    Favorite

  • CS 445: Compiler Construction

    3.00 Credits
    Clarkson University

    A study of compiler design. Overview of the compilation process. Formal definition of syntax, lexical scanning, parsing including LL and LR grammars, run-time structures, intermediate code generation, and storage allocation. Students are expected to develop a compiler for a substantial subset of a high-level language using compiler tools such as lex and a compiler yacc.
    ShareCS 445 - Compiler Construction
    Favorite
To find college, community college and university courses by keyword, enter some or all of the following, then select the Search button.
(Type the name of a College, University, Exam, or Corporation)
(For example: Accounting, Psychology)
(For example: ACCT 101, where Course Prefix is ACCT, and Course Number is 101)
(For example: Introduction To Accounting)
(For example: Sine waves, Hemingway, or Impressionism)
Distance:
of
(For example: Find all institutions within 5 miles of the selected Zip Code)