|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
4.00 Credits
This course is concept-oriented, not specialized to a particular operating system, and not trying to teach how to code the kernel of an operating system. After reviewing a number of system programming issues, it examines the basic components of modern operating systems in terms of their function, domain, design, principles and implementation techniques, use and impact on systems programming. It describes and uses in programming homework two modern operating systems (UNIX and Windows NT). Design and implementation of a number of concurrent programs is examined. Hardware support for operating system functions is discussed. Performance issues are considered through the course. Note: For Computer Science Majors.
Prerequisite:
Grade of C or better in C+IN SC 1166 (0066) or MATH 2196 (W141), C+IN SC 2107 (0072), and C+IN SC 2168 (0068)
-
3.00 Credits
Finite automata, their limitations and capabilities, and Kleen’s theorem or regular expressions. Other types of automata and their events. Turing machine and computability, computable functions, and halting problems. Introduction to context-free languages. Syntactical analysis of such languages with application to translation. Note: For Computer Science Majors.
Prerequisite:
Grade of C or better in C+IN SC 1166 (0066) or MATH 2196 (W141), C+IN SC 2107 (0072), and C+IN SC 2168 (0068); Grade of C or better in MATH 1042 (0086)
-
4.00 Credits
An analysis of the techniques used in computer manipulation of two- and three-dimensional images. Hardware and software for displaying images, two- and three-dimensional transformations, the hidden line problem, picture processing, character recognition, and two-dimensional filtering. Note: For Computer Science Majors.
Prerequisite:
Grade of C or better in C+IN SC 1166 (0066) or MATH 2196 (W141), C+IN SC 2107 (0072), and C+IN SC 2168 (0068); Grade of C or better in MATH 1042 (0086)
-
4.00 Credits
Comparative analysis of algorithms and data structures. Data structures include heaps, priority queues, binary and general trees, binary search trees, AVL trees, Red-Black trees, B-trees, and graphs. Algorithms include heapsort, topological sort, breadth-first search, depth-first search, shortest path algorithms, and Greedy algorithms. Students will gain experience working in a group on at least one moderate-size project. Note: For Computer Science Majors (For BA CS Majors see your advisor).
Prerequisite:
Grade of C or better in the CS theory course (C+IN SC 2166 (0166), 3211 (0211), or 3242 (0242)) and in C+IN SC 2168 (0068); Grade of C or better in MATH 1042 (0086)
-
4.00 Credits
This course provides an introduction to computer system architecture, operating systems concepts, and network organization, structure, and management. Note: For Information Science and Technology Majors.
Prerequisite:
Grade of C or better in C+IN SC 1048 and 1073 (C081) or an equivalent first-semester programming course in C++, C#, Java or VB.Net
Corequisite:
C+IN SC 2173 (0083)
-
3.00 Credits
Introduction to algebraic structures fundamental to various areas of computer science. Graphs, planar graphs, algorithms on graphs and their analysis, sequential machines and their minimization, semi-groups, and groups and their application to computer science. Note: For Computer Science Majors.
Prerequisite:
Grade of C or better in C+IN SC 1166 (0066) or MATH 2196 (W141), C+IN SC 2107 (0072), C+IN SC 2168 (0068); Grade of C or better in MATH 1042 (0086)
-
4.00 Credits
In this course, students undertake directed study in Information Science and Technology, which integrates academic program and work experience. The course is coordinated by an Information Science & Technology faculty member, but supervised by the student’s work supervisor. At the end of the semester students will turn in a final report detailing the work done on the project. Note: For Information Science and Technology Majors.
Prerequisite:
Junior or Senior Standing and permission from the departmental Undergraduate Advisor
-
4.00 Credits
Provides direct experience in the design, development, documentation, testing and maintenance of medium size software projects, in the use of modern software problem solving abstractions and solution patterns, and in the use of software development environments. This course is the capstone of the programming course sequence. Note: For Computer Science Majors.
Prerequisite:
Grade of C or better in C+IN SC 2168 (0068) and C+IN SC 3207 (0207)
-
4.00 Credits
This course emphasizes component-based software development using Visual Basic .NET. Students are introduced to software development techniques applicable in a component (class)-based, integrated software development environment (IDE). Students will learn (and practice using) the VB .NET language, object-oriented software design techniques, and the principles of good user interface design. Students will also learn how to navigate in, and take full advantage of, an IDE in building quality software, including user interfaces to databases, sequential files, and graphics tools. Object-oriented concepts such as inheritance, polymorphism, static and dynamic binding, and interface (abstract class) components will be covered. The primary focus is on windows-based software products, but the use of ASP.NET for client-server systems development is also introduced. Note: (1) Duplicate Course: Students may not get credit for both C+IN SC 4309 and 3309. (2) For Information Science and Technology Majors.
Prerequisite:
Grade of C or better in C+IN SC 2173 (0083), 2109 (0109), and 3229 (0230)
-
4.00 Credits
Learn the techniques for creating quality systems. This course discusses the crucial steps to be taken to assure that systems: do what they are intended to do; work reliably; satisfy the client’s requirements; are completed on time and within budget. Quality practices will be introduced and reviewed to give you a perspective as to why some systems succeed and others fail. Most importantly, students will learn techniques for building quality systems. A number of software tools will be introduced and discussed. Participants will be expected to complete one research paper on test automation, write test plans, and develop the skills to improve the software development process. Note: For Information Science and Technology Majors.
Prerequisite:
Junior standing, programming experience equivalent to C+IN SC 2173, and approval by the instructor
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2024 AcademyOne, Inc.
|
|
|