Course Descriptions for Computer and Information Sciences

This course will teach programming by having students construct Web pages using HTML and JavaScript, then move to C++. The first few weeks will use HTML, most of the course will use JavaScript, the last week or weeks will introduce C++. By the end of the course students should understand the concepts and issues involved in programming and be able to use the software covered in the course. Programming constructs covered include syntax, control statements, arrays, strings, objects, and event handlers.

The student is required to complete a project under the supervision of the instructor. A topic chosen by mutual agreement of the student and instructor will be the basis for a final term project. One credit may be used in lieu of a Natural Science laboratory. No prerequisite.

 Introduction to the fundamentals of computer programming. Control structures, functions, arrays, pointers and strings, references, class and data abstraction, constructors and destructors, friend functions, and operator overloading. Prerequisite: Is180 and Prerequisite or Corequisite: Mal05 or Ma123 or Ma143.

Programming techniques and advanced features of the C++ language. File processing, inheritance, virtual functions and polymorphism, templates, class string, preprocessor, containers, linked lists, and stacks. Prerequisite: Cs231.

The design and construction of video games. Detailed video game programming concepts will be discussed including: fundamental artificial intelligence, user interface design, 2D and 3D game programming. Prerequisite: Is180, Cs230 or Cs231.

A comprehensive overview of the design and implementation of modern programming systems. Programming languages and compiling techniques, operating systems, database structures, artificial intelligence, and knowledge-based systems. Prerequisite: Cs335 or Cs232.

The implementation and use of data structures. Queues, binary and general trees, sorting and searching. Prerequisites: Cs335 or Cs232; Is340; Ma123 or Ma143.

Theory of computer implementation, circuits and Boolean algebra, switching theory; net reduction techniques: introduction to formal languages. Prerequisite: Is340.

Students will implement object-oriented techniques in the Java programming language.  Java applications and applets for the World Wide Web will be implemented in the course.  Topics on algorithms, data structures techniques on queues, binary and general trees, sorting and searching, and data abstraction will be presented as well. Prerequisite: Is180, Cs230 or Cs231.

Deterministic and nondeterministic finite automata; two-way finite automata; formal languages; normal forms; push-down automata; and Turing machines. Prerequisite: Cs370.

Windows systems programming: Windows and BIOS interrupts; File systems; utilities. Two-pass assemblers, loaders, and linkers. Macro processors. Prerequisite: Cs370.

An introduction to the design and implementation of compilers. Lexical and syntactic analysis; symbol table implementation; code generation. Prerequisite: Cs370.

Knowledge representation; cognitive simulation; machine learning; natural language processing; knowledge-rich problem solving. Prerequisite: Cs370.

This course will introduce students to neural networks and its applications. Architectures of neural networks as well as the learning structures will be presented. Prerequisite: Cs232

A survey of some current programming languages. Discussion of language design issues including syntax, semantics, virtual computers, translations, elementary and structured data types, subprograms, sequence control, data control, storage management and operating environment. Prerequisite: Cs370.

Introduction to algorithms and their complexity. Algorithms chosen from graph theory, searching and sorting, pattern matching, matrix operations. Analysis of algorithms with respect to time, space and other resources. Prerequisite: Cs370.

For the superior student to pursue, under supervision, independent study and research topics not covered in the scheduled class work. Prerequisite: permission of the Department chairperson.

This course is arranged as the need arises, to provide for materials of interest and use to groups of students. Prerequisite: permission of the Department chairperson.

This course gives a historical introduction to Cryptology, the science of secret codes. It begins with the oldest recorded codes, taken from hieroglyphic engravings, and ends with the encryption schemes used to maintain privacy during Internet credit card transactions. Since secret codes are based on mathematical ideas, each new kind of encryption method leads in this course to the study of new mathematical ideas and results.  The first part of the course deals with permutation-based codes: substitutional ciphers, transpositional codes, and Vigenere ciphers. In the second part of the course, the subject moves to bit stream encryption methods. These include block cipher schemes such as the Data Encryption Standard (DES).  Public key encryption is the subject of the final part of the course. We learn the mathematical underpinnings of Diffie-Hellman key exchange, RSA and Knapsack codes. Software packages and tools will also be studied. Prerequisite: CJ418