An introductory course in problem solving, using the programming language Java. Focuses on the fundamental concepts of problem solving and on computer imple-mentation. Satisfactory completion is a prerequisite for all higher-level computer science courses. Use of computer required. Prerequisite: high school algebra and basic math skills (R1). (Gen.Ed. R2)

An introductory course in problem solving, using the programming language Java. Focuses on the fundamental concepts of problem solving and on computer imple-mentation. Satisfactory completion is a prerequisite for all higher-level computer science courses. Use of computer required. Prerequisite: high school algebra and basic math skills (R1). (Gen.Ed. R2)

An introductory course in problem solving, using the programming language Java. Focuses on the fundamental concepts of problem solving and on computer imple-mentation. Satisfactory completion is a prerequisite for all higher-level computer science courses. Use of computer required. Prerequisite: high school algebra and basic math skills (R1). (Gen.Ed. R2)

Lecture, discussion. Basic concepts of discrete mathematics useful to computer science: set theory, strings and formal languages, propositional and predicate calculus, relations and functions, basic number theory. Induction and recursion: interplay of inductive definition, inductive proof, and recursive algorithms. Graphs, trees, and search. Finite-state machines, regular languages, nondeterministic finite automata, Kleene's Theorem. Problem sets, 2-3 midterm exams, timed final.

In this course, students will learn how to put "principles into practice," in a hands-on-networking lab course. The course will cover router, switches and end-system labs in the areas of Single Segment IP Networks, Multiple Segment IP Networks and Static Routing, Dynamic Routing Protocols (RIP, OSPF and BGP), LAN switching, Transport Layer Protocols: UDP and TCP, NAT, DHCP, DNS, and SNMP. Students will also get engaged in evaluating power consumption of network components as an aid in the design of energy efficient (green) networks.

Advanced programming techniques in the Java language focusing on abstract data types. Specific topics include linked structures, recursive structures and algorithms, tree-based structures, and hash tables. Elementary techniques of software engineering, including documentation, coding style, basic testing principles, and informal reasoning about correctness. Weekly programming assignments, discussion section exercises, and multiple exams.

This course introduces graduate students to basic ideas about conducting a personal research program. Students will learn basic methods for activities such as reading technical papers, selecting research topics, devising research questions, planning research, analyzing experimental results, modeling and simulating computational phenomena, and synthesizing broader theories. The course will be structured around three activities: lectures on basic concepts of research strategy and techniques, discussions of technical papers, and preparation and review of written assignments.

Introduces students to the principal activities involved in developing high-quality software systems. Topics include: requirements analysis, formal specification methods, process definition, software design, and risk management.

Not available at this time

This course offers an introduction to working with Unix, and it is intended to help students work with tools commonly used in CS courses. The class is comprised of both discussion and hands-on exercises in the EdLab. Topics covered include working with the command line, installing and maintaining the OS and software packages, version control systems, compiling programs, and more. No previous experience with Unix is required. This course is for CS minors and majors only, but it does not count towards either degree.