|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
4.00 Credits
Computer programming is a way of thinking. A successful programmer needs to take a word problem, generate a pseudocode algorithm, and convert it to the syntax of a specific programming language. This course is an alternative to CSCI 1100 and is intended for students who want an introduction to this programming process but do not intend to do further course work in programming or computer science. Emphasis will be on the generation of the algorithms. Rather than using the complex syntax of a production language such as C or C++, this course will use Visual Basic. This allows us to concentrate on the fundamentals and not get sidetracked by language complexity. It also affords students a tool for creating useful personal applications or prototypes in the future. (Students cannot get credit for this course if they have already taken any other CSCI course.) When Offered: Spring term annually. Credit Hours: 4
-
4.00 Credits
An introduction to computer programming algorithm design and analysis. Additional topics include basic computer organization; internal representation of scalar and array data; use of top-down design and subprograms to tackle complex problems; abstract data types. Enrichment material as time allows. Interdisciplinary case studies, numerical and nonnumerical applications. Prerequisites/Corequisites: Prerequisites: none. Students who have passed CSCI 1200 cannot register for this course. When Offered: Fall and spring terms annually. Credit Hours: 4
-
1.00 Credits
This course will teach elementary programming concepts using the C language for engineering students with little or no prior programming experience. Students cannot get credit for this course and any other Computer Science course. When Offered: Fall and spring terms annually. Credit Hours: 1
-
4.00 Credits
Programming concepts: functions, parameter passing, pointers, arrays, strings, structs, classes, templates. Mathematical tools: sets, functions, and relations, order notation, complexity of algorithms, proof by induction. Data structures and their representations: data abstraction and internal representation, sequences, trees, binary search trees, associative structures. Algorithms: searching and sorting, generic algorithms, iterative and recursive algorithms. Methods of testing correctness and measuring performance. Prerequisites/Corequisites: Prerequisite: CSCI 1100 or permission of instructor. When Offered: Fall and spring terms annually. Credit Hours: 4
-
2.00 Credits
Introduction to programming in the Java language. Java is an object-oriented programming language widely used in developing World Wide Web applications. Topics include class declarations and definitions, graphics, threads, exceptions, and writing Web applets. Prerequisites/Corequisites: Prerequisite: CSCI 1200 or equivalent. When Offered: Fall and spring terms annually. Credit Hours: 2
-
2.00 Credits
Introduction to programming in the Perl language. Perl is a programming language widely used for complex shell scripts, Common GateWay Interface programs for World Wide Web pages, and rapid prototyping in more general application areas. Topics include text manipulation facilities, associative arrays, Unix system-call facilities, and application to Web and systems programming. Prerequisites/Corequisites: Prerequisite: CSCI 1200 or equivalent. When Offered: Fall and spring terms annually. Credit Hours: 2
-
4.00 Credits
Data structures and algorithms, and the mathematical techniques necessary to design and analyze them. Basic data structures: lists, associative structures, trees. Mathematical techniques for designing algorithms and analyzing worst-case and expected-case algorithm efficiency. Advanced data structures: balanced trees, tries, heaps, priority queues, graphs. Searching, sorting. Algorithm design techniques: dynamic programming, greedy algorithms, divide-and-conquer, backtracking. Example graph, string, geometric, and numeric algorithms. Prerequisites/Corequisites: Prerequisites: CSCI 1200, MATH 1010, and MATH 2800. When Offered: Fall and spring terms annually. Credit Hours: 4
-
4.00 Credits
This course introduces conceptual tools for reasoning about computational processes and the languages with which they are prescribed. It bears directly upon language translation, program verification, and computability. Topics to be covered include formal languages, finite automata, pushdown automata, nondeterminism, regular expressions, context-free grammars; parsing, compiler design basics; computability, Turing machines, Church's thesis, unsolvability and intractability. Prerequisites/Corequisites: Prerequisites: CSCI 2300 and MATH 2800. When Offered: Fall and spring terms annually. Credit Hours: 4
-
4.00 Credits
Introduction to computer organization, assembler language, and operating systems. Computer systems organization: processors, memory, I/O. Digital logic: gates, Boolean algebra, digital logic circuits, memory, buses. Microprogramming. Machine level: instruction formats, addressing modes, instruction types, flow of control. Operating systems: virtual memory, virtual I/O instructions, processes, interprocess communication. Numeric representation. Assembler language: the assembly process, macros, linking, loading. Advanced architectures: RISC architectures, parallel architectures. Prerequisites/Corequisites: Prerequisite: CSCI 1200. When Offered: Fall and spring terms annually. Credit Hours: 4
-
4.00 Credits
Basic algorithm design strategies such as greedy, dynamic programming, backtracking, and branch-and-bound; main approaches, including exact, probabilistic, approximate, and heuristic algorithms; sequential and parallel algorithms; algorithms for networks, string matching, matrix operations, and cryptography; learning algorithms. Prerequisites/Corequisites: Prerequisite: CSCI 2300. When Offered: Spring term annually. Credit Hours: 4
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2024 AcademyOne, Inc.
|
|
|