Course Search Results

  • CIS 301: Programming Languages

    3.00 Credits
    Cheyney University of Pennsylvania

    The study of programming languages examines the essential concepts that are common to modern programming languages. A broad range of issues is considered. Techniques for formal specification of syntax are presented. Several essential features of modern programming languages are discussed, including information binding, control structures, scope rules, data types and data abstraction, concurrency, recursion, input/output, and execution environment. Four different computational models or paradigms for programming languages are considered: the imperative, functional, logic-oriented and object-oriented models. Examples are drawn from a number of existing languages, such as Ada, LISP, FORTRAN, COBOL, Pascal and C. Pre-Requisite: CIS207 Offered: Spring Term Previous Course ID - CIS201
    ShareCIS 301 - Programming Languages

  • CIS 302: Computer Operating Systems

    3.00 Credits
    Cheyney University of Pennsylvania

    Study includes the basic principles of operating system design and implementation. Consideration is given to the general architecture of several representative computer systems; management of memory, processors and devices; file systems; protection; operating systems design techniques; performance measurement and evaluation. A case study of a representative operating system is used to illustrate these principles. Pre-Requisite:CIS207 Offered: Spring Term Previous Course ID - CIS211
    ShareCIS 302 - Computer Operating Systems

  • CIS 303: Compiler Construction

    3.00 Credits
    Cheyney University of Pennsylvania

    The study of compilers through programming language structures, translation, loading, execution, and storage allocation. Compilation of simple expressions and statements is covered. The organization of a compiler includes compile-time and scan-time, symbol tables, lexical scan, syntax scan, object code generation, errors, diagnostics, object code, optimization techniques, and overall design. This is illustrated through the use of compiler-writing languages and bootstrapping. Pre-Requisite: CIS207 Offered: Fall Term Previous Course ID - CIS231
    ShareCIS 303 - Compiler Construction

  • CIS 311: System Simulation

    3.00 Credits
    Cheyney University of Pennsylvania

    Study includes an introduction to simulation and a comparison of various techniques such as discrete simulation models, queuing theory and stochastic processes. Coverage includes simulation languages and simulation methodology for the generation of random numbers, design of simulation experiments for optimization, analysis of data generated by simulation experiments and the validation of simulation models and results. Pre-Requisite: CIS302
    ShareCIS 311 - System Simulation

  • CIS 321: Information Organization & Retrieval

    3.00 Credits
    Cheyney University of Pennsylvania

    The structure of semi-formal languages and models for the representation of structured information includes aspects of natural language processing on digital computers. The analysis of information content by statistical, syntactic, and logical methods is studied. Search and matching techniques, automatic retrieval systems, question/answering systems, production of secondary outputs and the evaluation of retrieval effectiveness is also studied. Pre-Requisites: CIS102 & MAT202. Offered: Fall Term
    ShareCIS 321 - Information Organization & Retrieval

  • CIS 330: Algorithms & Fortran

    3.00 Credits
    Cheyney University of Pennsylvania

    Study includes an introduction to abstract algorithms and to their design, analysis, and realization. The goal of the course is to develop skill with practical algorithm design and analysis techniques and to develop the ability to apply these techniques to the construction of real systems using the FORTRAN programming language. Pre-Requisite: CIS207
    ShareCIS 330 - Algorithms & Fortran

  • CIS 331: Theory Of Computability

    3.00 Credits
    Cheyney University of Pennsylvania

    Turing machines, unsolvability results, and the halting problem are discussed Consideration is given to the study of machines with restructured memory access, limited memory, and limited computing time. Study also includes recursive function theory and complexity classification. Comparisons of searching and sorting techniques are studied through the use of computation models including relationships to algorithms and programming.Pre-Requisite: CIS101 & MAT202
    ShareCIS 331 - Theory Of Computability

  • CIS 400: Topic Visual Basic

    3.00 Credits
    Cheyney University of Pennsylvania

    Seminar in which topics are determined by students and instructors. Pre-Requisite: CIS209
    ShareCIS 400 - Topic Visual Basic

  • CIS 401: Topic Computer & Information Science

    3.00 Credits
    Cheyney University of Pennsylvania

    A seminar course which includes topics that are determined by students and instructors. This course may be taken more than once if topics are different. Pre-requisite: CIS102 or Permission of Instructors. Offered: Spring Term 3.000CIS403Topics Java3.000Seminar in which topics are determined by students and instructors. Pre-Requisite: CIS102 or Permission of Instructors. "
    ShareCIS 401 - Topic Computer & Information Science

  • CIS 413: Software Engineering Using Ada

    3.00 Credits
    Cheyney University of Pennsylvania

    The student studies the nature of the program development task when many people, many modules, many versions, or many years are involved in designing, developing, and maintaining the system. The issues are both technical (e.g., design, specification, version control) and administrative (e.g., cost estimation and elementary management). The course will consist primarily of working on the cooperative creation and modification of software systems. Pre-Requisite: CIS102 or Permission of Instructor Prerequisite:    CIS 102
    ShareCIS 413 - Software Engineering Using Ada