Skip Navigation

DEPARTMENT OF COMPUTER SCIENCE

(585) 395-2146

Chairperson and Professor: Kadathur B. Lakshmanan, PhD, Ohio State University; Professors: Kulathur S. Rajasethupathy, PhD, Tata Institute; Thambrahalli M. Rao, PhD, Indian Institute of Science; Associate Professors: Joan M. Lucas, PhD, Princeton University; Sandeep R. Mitra, PhD, SUNY Binghamton; Anthony Scime DA, George Mason University; Assistant Professors: Vishal Anand, PhD, SUNY Buffalo; Wan Huang, PhD, University of Alabama, Tuscaloosa; Alexander R. Yakhnis, PhD, Cornell University; Lecturer: Daniel F. Rogers, MS, Syracuse University.

bar

Computer science is the study of theory and practice of computation. It incorporates aspects of several other fields: mathematics, to analyze the properties of algorithms and data structures; engineering, to design and construct practical programs and machines; the experimental sciences, both to investigate the behavior of programs running on real machines and to use programs for modeling scientific phenomena; and the cognitive sciences, to develop "intelligent" programs and to study computation in relation to human intelligence.

Computer science is a young and rapidly developing field. Its chief areas of specialization, reflected in regular course offerings at SUNY Brockport, are: programming methodology; design and analysis of algorithms, software engineering and programming languages; database systems; e-commerce; computer architecture; systems programming; computer security; artificial intelligence; and networking. Other areas are covered in independent-study and topics courses.

Although the department does not offer a graduate degree program, a variety of courses are offered at the graduate level.

 

COMPUTER SCIENCE COURSES

CSC 501 Theory of Programming Languages (A). Prerequisite: CSC 311. Covers programming language concepts, description, design and evaluation. Includes these topics: language families and history; design principles; BNF and other syntax notations; compilation vs. interpretation; implementation concepts; comparison of features and conventions of various languages, including: data types, structures, declaration, abstraction, binding, scope, conversion and protection; computational primitives; control structures; sub-programs; I/0; exceptions; concurrency; preprocessors; and programming environments. Requires extensive programming. 3 Cr. Every Semester

CSC 506 Algorithms and Data Structures (A). Prerequisites: CSC 205 and MTH 481. Covers the design and analysis of data structures and associated algorithms. Includes these topics: arrays, strings, stacks, linear and generalized lists, multilists, multirings, queues, sets, hashing, trees, graphs, recursion, searching and sorting, and applications such as text processing, polynomials, sparse matrices, storage management and unlimited-precision arithmetic. Requires extensive programming and supervised lab sessions. 4 Cr. Every Semester

CSC 511 Computer Architecture (A). Prerequisites: CSC 303 and CSC 311. Covers the design and organization of digital computers. Includes these topics: digital logic and circuit design, data representation, registers, memories and memory management, CPU and ALU architectures, instruction sets, busses and I/0 systems, interrupt structure and microprogramming. Also includes virtual machines, parallelism, pipelining and data flow machines. 3 Cr. Every Semester

CSC 512 Operating Systems (A). Prerequisites: CSC 303 and CSC 311. Recommended: CSC 319 or knowledge of C and UNIX. Covers basic principles of operating systems. Includes these topics: file systems, CPU scheduling and context switching, memory management and virtual memory, disk scheduling, deadlock, concurrent processes and programming, protection mechanisms, design principles and attempts at standardization. Also includes an in-depth study of the UNIX operating system. Requires extensive programming. 3 Cr. Spring

CSC 519 Computer Networks (A). Prerequisites: CSC 303, CSC 311 and CSC 319. Offers a comprehensive study of the field of computer communications, with emphasis on theoretical aspects of local area networks. Compares specific LANs. Includes these topics: the ISO model, protocols, topologies, error detection and correction, routing, packet switching, virtual circuits, and datagrams. 3 Cr. Spring

CSC 521 Computer and Network Security (A). Prerequisite: CSC 319. Studies concepts, techniques and tools in computer and network security. Includes these topics: security, privacy, information assurance, threats, user authentication and access control; Unix and Windows NT/2000 examples; logs and intrusion detection; cryptography, public-key systems; Kerberos authentication; IP security, firewalls; Web and database access control and security issues; ethical issues. 3 Cr. Fall

CSC 522 Relational Data Base Design (A). Prerequisite: CSC 205. Examines the theory and practice of the relational approach to database design. Includes these topics: DBMS vs. a traditional file processing; relational algebra; normalization; lossless and/or dependency preserving decomposition; query languages such as SQL and a language that is available on the system; query optimization; integrity and security; and database project design. Requires extensive programming. 3 Cr. Fall

CSC 527 Software Systems Engineering (A). Prerequisite: CSC 311. Introduces software engineering and programming-in-the-large. Includes these topics: life cycle models, development standards, project organization, requirements engineering, configuration management, quality assurance, cost and manpower estimates, specification techniques, design methods and representations, human factors, structured programming, object-oriented programming, testing and integration, validation, maintenance and documentation. Allows students to work as a project team in class developing a system for an actual customer. Requires communication and writing skills, and extensive programming. 3 Cr. Fall

CSC 529 Object-Oriented Programming (A). Prerequisite: CSC 205. Introduces basic concepts in object-oriented programming (OOP) and how to apply OOP techniques using an appropriate OOP language such as Java or C++. Includes these topics: the OOP programming paradigm, including analysis and design, a survey of related languages, data hiding and encapsulation, inheritance and polymorphism. Entails implementation of these concepts using appropriate programming language constructs. Requires extensive programming. 3 Cr. Spring

CSC 534 Artificial Intelligence (A). Prerequisite: CSC 205. Introduces artificial intelligence and its languages. Includes these topics: history and state of the art in AI: programming techniques in the languages LISP and PROLOG; fundamental methods in AI, including heuristic search; knowledge representation using predicate logic and production systems; and classic basic problems involving games, graphs, theorem proving, symbolic algebra, expert systems, natural language, etc. Requires extensive programming. 3 Cr. Spring

CSC 542 Electronic Commerce Technology (A). Prerequisite: CSC 422 or CIS 422. Surveys electronic commerce technologies and realities and studies defining tools of e-business to understand the manner in which users, tools, needs and opportunities interact. Includes these topics: infrastructure of e-commerce and the design and implementation of e-business portals using network and database technologies; data/Web mining; and security/encryption techniques for finding and negotiating with trading partners to execute electronic transactions. 3 Cr. Fall

CSC 544 Introduction to Parallel Computing (A). Prerequisites: CSC 406 and MTH 481. Deals with design and analysis of parallel algorithms. Includes these topics: parallel models of computation; measures of complexity; parallel algorithms for selection, searching, sorting, and merging; matrix algorithms; transitive closure; connected components; and shortest path, minimum spanning tree and routing algorithms. Provides hands-on experience in a parallel programming environment. 3 Cr. Spring

CSC 583 Theory of Computation (A). Prerequisites: CSC 203 and MTH 481. Studies formal languages and theory of automata with an emphasis on Church's thesis, "algorithm = machine" point of view. Includes these topics: regular expressions and context-free languages, finite and pushdown automata, Turing machines, computability, undecidability and complexity of problems. 3 Cr. Spring

CSC 595 Topics in Computer Science (A). Prerequisites: Published prior to registration each semester. As an advanced course, addresses current topics in the field. Each offering is motivated by the expertise of the instructor and students' interests. Expects students to complete a major research, design or development project. Descriptions and prerequisites are published prior to the registration period for the course. Past topics covered included: networking, human factors, computational linguistics, advanced architecture, software engineering, logic programming, program validation, object-oriented programming and parallel algorithms. 3 Cr.

CSC 599 Independent Study in Computer Science (A). Prerequisite: Instructor's permission. Arranged in consultation with the instructor-sponsor prior to registration. 1-3 Cr. By Arrangement

CSC 601 Concepts of Programming Languages (A). Prerequisites: CSC 401, CSC 406 and MTH 481. Presents an advanced mathematical treatment of the underlying principles of programming languages and comparison of the issues as they relate to the main language paradigms: procedural, object oriented, declarative, functional and concurrent. Covers: lexical vs. syntactic vs. semantic structures of languages; objects and classes, inheritance, dynamic binding, and implementation issues; Lambda calculus and recursive functions; logic resolution and unification; and parallel processing, co-routines and message passing. 3 Cr.

CSC 611 Advanced Computer Architecture (A). Prerequisites: CSC 411, MTH 346 and MTH 481. As an advanced course in architecture of high-performance computer systems, emphasizes quantitative analysis. Includes: measuring performance, cost trends, CISC versus RISC, pipelined processors, branch penalties and prediction, memory hierarchy, cache organization, virtual memory, parallel processors, SIMD/MIMD systems, interconnection networks and distributed computing. 3 Cr.

CSC 683 Automata Theory and Formal Languages (A). Prerequisite: MTH 481. Provides an advanced treatment of the mathematical foundations of computer science, including the theories of automata, formal languages, computability and computational complexity. Includes some of the fundamental material regarding finite automata and context-free grammars as part of regularly accredited undergraduate programs, covering the material more quickly in this course. 3 Cr.

The information in this publication was current as of June 2005 when the text was compiled. Changes, including but not restricted to, tuition and fees, course descriptions, degree and program requirements, policies, and financial aid availability may have occurred since that time. Whether or not a specific course is scheduled for a given term is contingent on enrollment, budget and staffing. The college reserves the right to make any changes it finds necessary and may announce such changes for student notification in publications other than the College catalogs. For the purpose of degree and program completion, students are bound by the requirements in effect as stated in the printed catalog at the time of their matriculation at SUNY Brockport. Inquiries on the current status of requirements can be addressed to the appropriate College department of office. Also refer to the Brockport Web site home page at www.brockport.edu for current information.

Events

Sat, Apr 26

APA & Library Services
10:30 am - 11:30 am

Research & Database Searching
noon - 1 pm