General InformationAdmissionGeneral GuidelinesFinancial InformationUniversity RegulationsServices & RecordsTemple CampusesCourse DescriptionsFacultyHome

College of Science and Technology

306 Barton Hall,
Philadelphia, PA 19122
(215) 204-2888

www.temple.edu/CST

Degree Programs: isc.temple.edu/grad/Programs /stgrid.htm
gradcst@blue.temple.edu

General Requirements

Departments:
Biology
--General Statement
--Graduate Faculty
--Application Deadline
--Course Descriptions

Chemistry
--General Statement
--Graduate Faculty
--Application Deadline
--Course Descriptions

Computer & Information
Sciences (CIS)

--General Statement
--Graduate Faculty
--Application Deadline
--Course Descriptions

Geology
--General Statement
--Graduate Faculty
--Application Deadline
--Course Descriptions

Mathematics
--General Statement
--Graduate Faculty
--Application Deadline
--Course Descriptions

Physics
--General Statement
--Graduate Faculty
--Application Deadline
--Course Descriptions

 

In addition, a statement of professional goals is required along with at least two letters of recommendation from the student's former Computer Science or related professors and/or supervisors in a professional position of employment. For students whose native language is not English, a TOEFL score of 575 or better is also required.

All application materials, including TOEFL and GRE scores, must be sent directly to the Department of Computer and Information Sciences. For application forms and any further admission information, write to the Graduate Chair.

Degree Requirements

For the M.S., students must complete 30 credits as approved by the graduate adviser. Additional undergraduate coursework can be required depending upon the area of concentration chosen by the student. Of the 30 credits, there are three required core courses and a required project course: CIS 551, Programming Techniques; CIS 561, Operating Systems; and CIS 573, Automata and Formal Languages, and project course, CIS 751.

The M.S. degree must be completed within five years of the matriculation date and enrollment must be continuous. Details concerning the specific M.S. program requirements can be obtained by contacting the Adviser of Graduate Programs, Department of Computer and Information Sciences.

Doctor of Philosophy

Admission Requirements

Admission to the Ph.D. program is given only to applicants with a master's degree in Computer Science or Management Information Systems (or related field) from an accredited institution. Minimum GRE Quantitative and Verbal (or equivalent GMAT) scores are 70th percentile or better. One of these two scores must be in the 75th percentile or better. For students whose native language is not English, the minimum TOEFL score is 575. A statement of goals and three letters of recommendation are required with the admission application.

Degree Requirements

A minimum of 21 credits beyond the master's degree is required for the Ph.D. Graduate credits from other institutions can be considered for transfer credits. The Ph.D. program focuses on three research tracks:

1.  Artificial Intelligence and Applications: concerned with systems that exhibit intelligent behavior.

2.  Information Systems: concerned with systems that provide information to improve the performance of organizations.

3.  Software Systems: concerned with the creation of software and its associated methodologies.

Students must select courses that satisfy the requirements of the track in which they were accepted.

Writing skills and teaching experience must be demonstrated.

Students must pass a Qualifier Examination that tests the student on the fundamentals of CIS and the basic body of knowledge in their track. It is a written examination covering theory and algorithms, systems, and track specific material. Passing this examination is a prerequisite for candidacy. To be admitted to candidacy, students must then pass two written and oral Preliminary Examinations.

After submission of an acceptable dissertation, a Ph.D. candidate must pass an oral defense of the dissertation.

The Ph.D. must be completed within seven years of the matriculation date and enrollment must be continuous.

Course Descriptions -Computer and Information Sciences

540. Discrete Structures of Computer Science. (3 s.h.)

Prerequisites: Math 75, Math 76, and CIS 66 or equivalent. (Graduate credit will not apply for MS/Ph.D. CIS programs.)

Concepts, techniques, results, and applications of discrete structures that are particularly fundamental to computer science are studied. Topics include: sets, relations and their closures, equivalence relations and partitions. Functions, cardinality, permutation. Trees, graphs, planarity, algorithms on graphs and their analysis. Big-O notation. Boolean Algebra and switching functions. Finite state machines and their minimizations. Algebraic structures, semigroups, groups, cosets, Chinese Remainder Theorem. Applications to error-correcting codes and speed of computation.

542. Programming and Data Structures. (3 s.h.)

Prerequisite: CIS 67 or 81, or equivalent. (Graduate credit will not apply for MS/Ph.D. CIS programs.)

Consideration of logical and physical structures of both programs and data. Topics include arrays, lists, trees, searching, sorting, file management, and their application to problem solving. Students will be expected to complete a variety of computer programs in a high-level language.

544. Systems Software and Operating Systems. (3 s.h.)

Prerequisites: CIS 67, 68 and 72, or CIS 542 and 72, or equivalent. (Graduate Credit will not apply for MS/Ph.D. CIS programs).

In depth review of assembly language concepts: programming models, addressing, instruction sets, arithmetics, conditionals, traps and interrupts, and device I/O. Systems software: compilers and assemblers, module linkers, library systems, system utilities, and operating system services. Operating systems: fundamental concepts including processes, file systems, CPU scheduling, memory management and virtual memory, deadlocks and concurrency. The influence of computer architecture on these issues is also discussed.

551. Programming Techniques. (3 s.h.)

Prerequisite: CIS 223 or 542.

Data structures their usefulness in algorithm construction and their efficient implementation. Theoretical results and programming techniques such as data abstraction and modularity are emphasized.

561. Operating Systems. (3 s.h.)

Prerequisite: CIS 307 or 544.

Operating system principles; scheduling; multi-tasking systems; task control and coordination; interprocess communication; deadlocks; mutual exclusion; memory management; virtual memory; file systems; performance evaluation.

573. Automata and Formal Languages. (3 s.h.)

Prerequisite: CIS 242.

Types of grammars. Finite automata and regular languages. Kleene's Theorem. Closure properties and decidable problems for regular languages. Derivation trees. Normal forms of context-free grammars. The self-embedding properties, closure properties and decidable problems for context-free languages. Methods of syntax analysis for context-free languages. Context-sensitive languages and linear bounded automata. Turing machines.

578. User Interface Design. (3 s.h.)

Prerequisite: CIS 535 or 551.

Focuses on the issues surrounding the design of interfaces and the integration of existing systems to form new systems. This course builds knowledge of networking, databases and programming.

580. Principles of Software Engineering. (3 s.h.)

Prerequisite: CIS 551 and 561.

Life-cycle and management of software systems. Topics include requirements, design, implementation, verification, documentation, and reliability.

581. Computer Graphics and Image Processing. (3 s.h.)

Prerequisite: CIS 220 or 551.

Analysis of the techniques used in computer manipulation of two- and three-dimensional images. Topics covered include hardware and software for displaying images, two- and three-dimensional transformation, the hidden line problem, picture processing, character recognition, and two-dimensional filtering.

587. Artificial Intelligence. (3 s.h.)

Prerequisite: CIS 203 or 551.

An introduction to the field of artificial intelligence. Computer game-playing, state-space representation and search, problem-reduction techniques, theorem-proving and natural language processing.

| NEXT | PREVIOUS | MAIN |