unh_logo

Undergraduate Courses -- Lower Division
CS Home CS Programs Contact CS UG Advisor
Undergrad-Lower Level
Undergrad-Upper Level
Graduate Core
Seniors and Graduates
Graduate Courses

Master of Science Computer Science
Bachelor of Science Computer Science
Associate of Science Computer Science
Minor in CS
Undergrad Certificate
Graduate Certificates
Bachelor of Science in Computer Technology

<< Back
CS 107 Introduction to Data Processing                        Syllabus     Offerings

An introduction to the concepts underlying modern application of computer systems. Use of application software for word processing, spread sheets, and data bases. Intended for business and humanities students taking only one computer course or as a basis for further work with computers. Not to be taken for credit by CS majors. 3 credit hours.

CS 110 Introduction to Programming/C                        Syllabus     Offerings

Prerequisite or corequisite: M 115. A first course in computer programming using the C language; for engineering, computer science, mathematics, and science students. Problem solving methods, algorithm development and good programming style. Expressions, functions, libraries, basic types, and arrays. Programming assignments will stress numeric applications. Lecture plus lab (3 contact hours) 2 credits.

CS 111 Introduction to C Prog. II (non-majors)             Syllabus     Offerings

Prerequisite: CS 110. Further topics in C language programming i. Problem solving methods, algorithm development, and good programming style. Strings, structured data, two dimensional arrays,   files, parameter passing mechanisms. Programming assignments will stress numeric applications. Lecture plus lab (3 contact hours for 7 weeks) 1 credit.

CS 112 Introduction to C Programming II                     Syllabus     Offerings

Prerequisite: CS 110. Further topics in C language programming for computer science majors. Problem solving methods, algorithm development and good programming style. Strings, structured data, two-dimensional arrays, files, recursion, dynamic memory allocation, parameter passing mechanisms, and the use of pointers to process arrays. Basic algorithms for searching, sorting, and simple numerical analysis. Programming assignments will include both numeric and non-numeric applications. Lecture plus lab (3 contact hours) 2 credits.

CS 166 Fundamentals of Digital Computing                 Syllabus     Offerings

Prerequisite: CS 106 or equivalent. A foundation course for computer science majors. Introduction to fundamentals, including logic, sets, functions, induction, and number representations. 3 credit hours.

CS 226 Data Structures and Algorithms I                     Syllabus     Offerings

Prerequisite: CS 112. Preferred also: CS166. Program design and debugging techniques. Dynamic memory allocation. Data structures and their applications: linked lists, stacks, queues, priority queues, trees. Recursion. Sorting and hashing algorithms. Substantial programs will be written in C. 3 credit hours.

CS 310 Computing Theory                                            Syllabus     Offerings

Prerequisite: CS 226. Central topics in theory of computation including: algebraic methods, proof procedures, and formal systems. Regular expressions, formal languages, grammars, the Chomsky hierarchy, finite automata, push-down automata, decidability, Church-Turing thesis, Turing machines, and other formal computer models. 3 credit hours.

CS 326 Data Structures and Algorithms II                    Syllabus    Offerings

Prerequisite: CS 166 and 226. Data structures--trees, graphs, hash tables. Recursive techniques--divide and conquer, backtracking, recursion elimination. Algorithms--sorting, searching, shortest paths. Analysis of the complexity of algorithms. Programming will be required. 3 credit hours.

Last updated: 11/29/01 Comments about this website should be directed to CS webmaster