|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
Development tools and methodologies for modular programming with an emphasis on engineering applications using the C language. Software design using functional and data abstraction. Specification, use and implementation of abstract data types including stacks, queues, lists, trees and graphs. Programming language features such as recursion, dynamically allocated data structures and separate compilation. Introduction to algorithm analysis, searching and sorting. Exposure to C++ classes for implementing abstract data types. Prerequisite: CS 211.
-
3.00 Credits
The architecture and programming of digital computers. Data representation. Processor, memory and I/O organization. Instruction set architectures, encoding and addressing modes. I/O techniques. Interrupts. Assemblers, macro-processors, compilers, interpreters, linkers, loaders. Assembly and machine language programming. C programming language constructs (control and data structures, pointers, arrays and functions) and their relationship to the underlying architecture. Supervised laboratory work involves programming and debugging using machine language, assembly language and C. Prerequisite: CS 210. every sem.
-
3.00 Credits
Development tools and methodologies for modular programming. Emphasis on software design using functional and data abstraction. Specification, use and implementation of abstract data types including stacks, queues, lists, trees and graphs. Programming language features such as recursion, dynamically allocated data structures and separate compilation. Introduction to algorithm analysis, searching and sorting. Prerequisites: CS 140, CS 210. every sem.
-
3.00 Credits
C syntax. Programming techniques and applications appropriate for C language. Students write several programs. Prerequisite: CS 240 or equivalent. 2 cr.
-
3.00 Credits
Ada syntax. Programming techniques and applications appropriate for Ada language. Students write several programs. Prerequisite: CS 240 or equivalent. 2 cr.
-
3.00 Credits
Introduction to the principles of Java programming: object-oriented style, coding style, Java API libraries, code reuse, writing stand-alone applications and applets for the Web. Prerequisite: CS 240 or equivalent. 2 cr.
-
2.00 Credits
Overview of the UNIX operating system and shell programming. History and design of UNIX commands (sed, grep, chmod, pattern matching, etc.). 2 cr.
-
3.00 Credits
Processing and input/output overlapping techniques: interrupts, DMA and channels. Memory organization: cache memory, interleaving, secondary storage devices, paging and segmentation. Instruction set design. High-speed arithmetic circuits. Control design: hard-wired and microprogrammed control. Pipelined, array and multiprocessor systems. Fault-tolerant architectures. Case studies of contemporary microprocessors, medium/large-scale mainframes, and multiprocessors. Prerequisite: CS 220. every sem., 3 cr.
-
3.00 Credits
Definition of Internet protocol and how to write programs that use the Internet. Starting with sockets and the TCP and UDP protocols, covers basic Internet protocols and applications, including ping, telnet, ftp, mail and http. More advanced protocols include RMI and Cobra. Java-based clients (applets and applications) and server-side Java servlets also examined. Projects include practical use of these protocols. Prerequisites: CS 240 and a working knowledge of Java.
-
3.00 Credits
Analysis of common algorithms for processing strings, trees, graphs and networks. Comparison of sorting and searching algorithms. Algorithm design strategies: divide and conquer, dynamic, greedy, back tracking, branch and bound. Introduction to NP-completeness and parallel algorithms. Prerequisites: CS 240 and MATH 314. every sem.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2024 AcademyOne, Inc.
|
|
|