3000

Prerequisite: CSCI 1302. The internal organization of digital computers is introduced through the study of assembly language. Digital logic design, sequential and combinational circuit design and implementation are introduced. Laboratory projects include the implementation of circuits using integrated circuit technology and assembly language programming. Corequisite CSCI 3410. This course is non-repeatable.

Prerequisite: C or better in CSCI 3211. Study of computer architecture. Topics include CPU organization, memory addressing, internal bus organization, and control. Laboratory emphasis is given to design and construction of an operational digital computer system. This course is non-repeatable.

Prerequisite: C or better in CSCI 3410. Basic principles, structure, and functions of operating systems, especially UNIX. Topics include concurrency, multitasking and process synchronization, multiprogramming, and memory, processor, and device management. This course is non-repeatable.

Prerequisite: C or better in CSCI 3410. This course is a continuation of CSCI 3341 and is a study of the design and development of multitasking systems, client-server organizations, and distributed applications. Computer network design, implementations and protocols are included. This course is non-repeatable.

Prerequisite: C or better in CSCI 3341 Operating Systems. The course covers principles of computer systems security. We will discuss various attack techniques and how to defend against them. Topics include Network attacks and defenses, Operating system holes, application security (Web, e-mail, databases, viruses, social engineering attacks, privacy, digital rights management, cryptography, access control, and security protocols). Course projects will focus on building reliable code.

Prerequisite: C or better in CSCI 1302. Introduction to data structures and their applications. Topics include pointers and references, linked structures, stacks, queues, lists, graphs, trees, hashed tables, introductory algorithm analysis, and recursion. Basic implementation and algorithms for manipulating these structures in the context of typical problems are covered.

Prerequisite: Permission of instructor. Selected topics not available in other departmental courses.