Department of Computer Science and Information Systems
Bradley University
Peoria, Illinois

Course Descriptions...

CIS 102, Introduction to Computer Information Systems with BASIC
3 hrs. (Basic Skills CU)
Fundamental concepts of computer programming and design of algorithms. Problem solving using BASIC. Introduction to flow chart language and use of software packages. Functional limitations and capacities of computers.
CIS 203, Data Processing with COBOL
3 hrs. (Basic Skills CU)
Solution of data processing problems using COBOL. Introduction to file handling and use of computers in a business environment.
Prerequisites: CIS 102 or CS 104 or CS 106.
CIS 300, Computers and Society
3 hrs. (Gen. Ed. TS)
History of computers. Their use, limitations, and impact on society. Guest lecturers for special topics.
Prerequisites: Junior standing or consent of instructor.
CIS 377, Advanced COBOL Systems and Environments
3 hrs.
Design and implementation of production-oriented COBOL system projects. Environments for development and implementation of COBOL systems in both batch and interactive modes. JCL for resource management, file processing and multi-key processing. Comparison and portability issues in different COBOL system environments. Cross-listed as BMA 377.
Prerequisites: CIS 203.
CIS 571, Computer Law
3 hrs.
Ethical considerations of computer scientists and computer related security and privacy issues; copyright, patent, trademark, and trade secret issues, deceptive trade practices, computer crime, contract issues, venture capitalists, tax issues, computer torts, constitutional issues, and international trade considerations.
Prerequisites: one semester of programming experience.
CIS 572, Computing Services Management
3 hrs.
Management of computer resources; planning for computing services; operational considerations; evaluation of service.
Prerequisite: CS 302 or CS 310.
CIS 588, Introduction to Expert Systems
3 hrs.
Knowledge-based systems design and implementation; expert systems shells and programming environments; validation and implementation of expert systems; case studies/laboratories. Cross-listed as IE 588.
Prerequisites: two semesters of computer programming and one semester of statistics, or consent of instructor.
CS 104, Computer and Programming with FORTRAN
3 hrs. (Basic Skills CU)
Problem Solving and algorithm implementation using FORTRAN: formatted I/O, arrays, character data, and subprograms. Assignments in numerical and non-numerical applications.
Prerequisite: MTH 105 or 109 or equivalent.
CS 105, Introduction to FORTRAN
1 hrs. (Basic Skills CU)
Problem solving using FORTRAN. Problem analysis, algorithm development, data types, control structures, input, output, arrays, functions, subroutines, file processing. Engineering-oriented problems and examples. Approved for General Education.
Prerequisite: MTH 121 or concurrent enrollment. Not open to students with credit in CS 104.
CS 106, Introduction to Programming and Computers
3 hrs. (Basic Skills CU)
Problem solving, algorithm development, and implementation using modern structured programming language. Software design methodologies. Introduction to Bradley University computer science software development environment. Programming language features: primitive and structured data types, data description, data and sequence control mechanisms, subprograms. In-depth introduction to computer science.
CS 120, Discrete Mathematics
3 hrs.
Introduction to graph theory, Boolean algebra, mathematical induction, and elementary combinatorics. Cross-listed as MTH 120.
Prerequisites: qualifying entrance and/or math precalculus placement scores as for MTH 121; or grade of C or better in MTH 112 or equivalent.
CS 121, Introduction to Data Structures
3 hrs.
Continuation of CS 106: introduction to file processing, searching, sorting, and simple data structures. Emphasis on using software methodologies for large programs. Data abstraction, validation, verification, and analysis or programs.
Prerequisite: CS 106 or equivalent.
CS 206, Assemble Language I
3 hrs. (Basic Skills CU)
Computer organization and assembler language programming.
Prerequisite: CS 106 or 104.
CS 216, Introduction to Programming Languages
3 hrs.
Formal languages, BNF, and compiling. Unusual languages such as LISP, SNOBOL, and APL. Conventional languages such as FORTRAN, PL/I, and ADA.
Prerequisites: CS 121, 206.
CS 221, Structured Programming with C
3 hrs.
C programming language: lexical elements, conversions, expression, declarations, statements, external definitions, preprocessing directives, and library. Introductory data structures including lists, stacks, queues, and binary trees. The C philosophy. Cross-listed at EE 221.
Prerequisites: EE 102 or CS 106; EE 201 or CS 206; or equivalents.
CS 302, Advanced Data Structures
3 hrs.
Extends coverage of CS 121 data structures. Applications include data structures for searching and sorting, memory management, graphs, and strings. Emphasis on understanding data abstraction and relationship to good programming practices in large programs. Implementation of data structures and evaluation of results.
Prerequisites: CS 121, 206; or equivalent.
CS 306, Assembler Language II
3 hrs.
Continuation of CS 206: macros, floating point, input/output, assemblers, loaders, and data files.
Prerequisite: CS 206.
CS 310, Information Structures and Management
3 hrs.
File organization and access methods. Sort/merge operations; hashing schemes for storage and retrieval. Projects involve data validation; creation and updating of files; simulation and/or implementation of direct or indexed files.
Prerequisite: CS 121.
CS 320, Symbolic Logic
3 hrs.
Logical systems; prepositional and predicate calculi. Truth tables, proofs, tautologies, principles or inference, Boolean algebra, DeMorgan's Laws, quantifiers, representations, and set theory. Cross-listed as PHL 320.
Prerequisite: MTH 116 or 122.
CS 343, Data Communications and Communication Networks
3 hrs.
Fundamentals of data communications: data transmissions, data encoding, digital data communication techniques, data link control, and multiplexing. Introduction to switched and shared medium communication networks.
Prerequisites: CS/MTH 120; CS 121; or consent of instructor.
CS 350, Computer Organization
3 hrs.
Transfer and coding of information. Basics of logic design. Structure, organization, and operational principles of modern computer systems. Case study of a simple mini/micro computer.
Prerequisite: CS 206.
CS 380, Foundations of Computer Science
3 hrs.
Fundamental concepts of computer science related to programming. Mathematical models used to represent control and data structures, and their interactions. Not open to students with credit in CS 280.
Prerequisites: CS 121; MTH/CS 120.
CS 403, Systems Design and Analysis
3 hrs.
Methodology of building a complete computer based system. Case studies.
Prerequisite: CS 310 or 302.
CS 405, Database Management Systems
3 hrs.
Database (DB) concepts. Relational, hierarchical, and network models. Comparisons of DBMS with file processing systems. Query languages, data sublanguages, and schema representations. DB environments: DB administration, security, dictionaries, integrity, and backup recovery. Commercial packages: IMS, TOTAL.
Prerequisite: CS 310.
CS 406, Introduction to Software Engineering
3 hrs.
Product engineering and control activities. Software engineering; relationship to other disciplines. Phases of software products and products of software engineering.
Prerequisite: CS 216 or 310.
CS 410, Directed Individual Studies
1-6 hrs.
Individual project developed under supervision of CS faculty member. May be repeated under a different topic once. Maximum of three semester hours per semester.
Prerequisite: consent of instructor.
CS 412, Topics in Computer Science
3 hrs.
Topics of special interest which may vary each time course is offered. Repeatable under a different topic for a maximum of six hours.
Prerequisites: consent of instructor and Department Chair.
CS 500, Computer and Society
3 hrs.
History of computing and technology; impact of computers on society and the individual; a survey of computer applications; legal issues; computer in decision making; futurists' views of computing. Primary emphasis on human values. This course is intended for those students with professional interests in computers and society. Credit will not be given for both CIS 300 and CS 500.
Prerequisites: 24 semester hours total in mathematics, logic, science, and technology courses, including at least 5 hours of CS.
CS 503, Programming Methodology
3 hrs.
Predicate calculus, Dijkstra's methodology of algorithm development. Algorithm development. Algorithmic language characteristic; syntax, semantics. Postconditions and preconditions. Verification of postcondition states satisfied by algorithmic programs executed from preconditions. Problems.
Prerequisites: CS 120, 302.
CS 510, Numerical Methods I
3 hrs.
Introduction to numerical and computational aspects of various mathematical topics: finite precision, solutions to nonlinear equations, and interpolation, approximation, linear systems of equations, and integration. Cross-listed as MTH 510.
Prerequisites: CS 104 or 106; MTH 207 and 223.
CS 511, Numerical Methods II
3 hrs.
Continuation of CS/MTH 510: further techniques of integration, ordinary differential equations, numerical linear algebra, nonlinear systems of equations, boundary value problems, and optimization.
Prerequisites: MTH 224 or 345; CS/MTH 510.
CS 514, Algorithms
3 hrs.
Design and analysis of algorithms. Dynamic structures maintenance and hashing. Searching, sorting, and traversal. Time and space requirements; simplification; computational complexity; proof theory and testing; NP-hard and NP-complete problems.
Prerequisites: CS 302; MTH 325 or IE 311 or BMA 262.
CS 516, Programming Languages
3 hrs.
Design concepts of high-level languages. Description languages; grammars and syntax; expressions and data structures; selection and control structures; constructs for input and output; subprograms and parameter communications.
Prerequisite: CS 302 or 310.
CS 517, Translator Systems I (Assemblers and Parsing)
3 hrs.
Introduction to programming language translation: assembly language translation; parsing methods for high level languages.
Prerequisite: CS 206. Co-requisite: CS 516.
CS 518, Translator Systems II
3 hrs.
Continuation of CS 517: code generation, error recovery, optimization, interpretation, and threaded interpreted languages.
Prerequisite: CS 517.
CS 519, Introduction to Operating Systems
3 hrs.
Design principles of software for operation of computers. Storage, processor, device, and file management as an integrated system; input/output control.
Prerequisites: CS 206 or equivalent.
CS 521, Artificial Intelligence I
3 hrs.
Basic concepts and techniques of artificial intelligence: philosophical considerations, examples, simple pattern recognition, introduction to expert systems, game playing, programming languages used in A.I.
Prerequisite: CS 302 or consent of instructor.
CS 522, Artificial Intelligence II
3 hrs.
A continuation of CS 521: heuristics, searching strategies,theorem proving, predicate calculus, natural language processing, pattern recognition, and machine learning.
Prerequisites: CS 521; BMA 262 or IE 311 or MTH 325.
CS 530, Microcomputer Systems
3 hrs.
Review of microcomputer architectures. Bus structures; examples. Operating system concepts. Practical use of a microcomputer. Text and screen editors; macro assemblers; conditional assembly.
Prerequisite: CS 306 or consent of instructor.
CS 535, Introduction to Computer Graphics
3 hrs.
Mathematics and algorithms of computer graphics. Device differences, lines, arcs, curves, transformations, input and output primitives. Data structures for geometric entities.
Prerequisites: MTH 207, 223, CS 302.
CS 550, Advanced Computer Architecture
3 hrs.
Fundamental computer sub-systems: central processing unit; memory systems; control and input/output units. General purpose computing systems design. Examples from existing typical computers.
Prerequisite: CS 350.
CS 570, Computer Systems Performance
3 hrs.
Techniques of modeling processes and the resources they share: intuitive, simulation, and mathematical approaches. Performance prediction, bench marking, and synthetic loading; hardware and software monitors.
Prerequisites: CS 519, IE 311.
CS 581, Formal Languages and Automata
3 hrs.
Introduction to finite state machines, push down automata, infinite machines, and Turing machines. Grammars, grammar classifications, equivalence to automata. Context-free languages, context sensitive languages, and applications in computer science.
Prerequisite: CS 380 or consent of instructor.
CS 582, Computability
3 hrs.
Introduction to recursion theory. Effective procedures and algorithms; abstract machines; limits of effective computability; unsolvability; reducibility; complexity.
Prerequisites: CS 120, 320; or consent of instructor.
ATG 157, Accounting Principles - Financial
3 hrs.
Accounting as a system of communicating to owners, creditors, governmental bodies, and others the financial results of the operation of business entities. Concepts, theories, and conventions underlying measurement, processing of business activities, and reporting of the financial results of those activities.
ATG 158, Accounting Principles - Managerial
3 hrs.
Use of accounting data for internal managerial decision- making and analysis, including accounting for planning and control; relevant cost and contribution approaches to decisions; capital budgeting; quantitative techniques.
Prerequisite: ATG 157.
BMA 352, Management and Organization Theory
3 hrs.
Interdisciplinary approach to management and organizations. Emphasis on @unctions of management and behavioral processes of leadership, communication, motivation, group dynamics, conflict, change, and development. International management, social responsibility, and ethics of business. Case studies.
Prerequisites: ATG 158; ECO 221 or 100; junior/senior standing.
ECO 100, Introduction to Economics
3 hrs. (Cen. Ed. SF)
Nature, scope, and methods of economics; current economic institutions, problems, and policies. Students who have already completed ECO 221 and/or 222 will not receive credit for this course. Not open to College of Business majors.
ECO 221, Principles of Microeconomics
3 hrs. (Gen. Ed. SF)
Institutions, problems, and policies of the market system and alternative systems: allocation of resources and distribution of income. Not open to students with ECO 100.
EE 311, Digital Hardware Organization
3 hrs.
Introduction to Boolean algebra, combinational and sequential circuit design, computer organization, and microprocessors. Not open to students with credit in EE 101 or EE 201.
FIN 322, Business Finance
3 hrs.
Capital budgeting and principles of financial management. External and internal sources of funds: costs and profitable uses in business organizations.
Prerequisites: ATG 158, QM 262, and junior/senior standing.
IE 313, Operations Research I
3 hrs.
Philosophy and techniques of operations research. Emphasis on elementary model building and concepts of optimization. Structure of problem solving; linear programming; transportation and assignment algorithms; game theory; network analysis; branch and bound theory; dynamic programming; decision theory involving one- stage problems.
Prerequisite: MTH 223.
IE 314, Operations Research II
3 hrs.
Application of IE 313 to probabilistic models of human- machine and unconstrained functions, inventory theory, queuing theory, replacement models, Markov Chain theory, and simulation.
Prerequisites: minimum grade of C in IE 311 or equivalent; minimum grade of C in IE 313.
MTH 105, Finite Mathematics
3 hrs. (Basic Skills MA)
Topics from finite mathematics: sets, matrices, systems of linear equations, linear programming, elementary probability, multistage processes, and Markov chains.
Prerequisite: 3 semesters of high school algebra, or equivalent.
MTH 112, Precalculus
4 hrs.
For students needing further background in mathematics before enrolling in calculus (especially MTH 121). Thorough study of algebraic, transcendental, and trigonometric functions; emphasis on graphing and use of algebra.
Prerequisites: 3 years of high school math including 3 semesters of high school algebra; appropriate entrance and/or math precalculus placement scores.
MTH 115, Techniques of Calculus I
4 hrs. (Basic Skills MA)
For students needing a non-rigorous introductory course in calculus: differential and integral calculus with emphasis on techniques. Topics in analytic geometry; limits; derivatives; antiderivatives; definite integral; logarithmic and exponential functions; partial derivatives; applications.
Prerequisite: grade of C or better in MTH 1O9 or 112.
MTH 116, Techniques of Calculus II
3 hrs. (Basic Skills MA)
Continuation of MTH 115; includes trigonometric functions; introductory theory; emphasis on techniques.
Prerequisites: MTH 11O or equivalent; grade of C or better in MTH 115.
MTH 120, Discrete Mathematics
3 hrs. (Basic Skills MA)
Introduction to graph theory, Boolean algebra, mathematical induction, and elementary combinatorics. Cross-listed as CS 120.
Prerequisites: qualifying entrance and/or math precalculus placement scores as for MTH 121; or grade of C or better in MTH 112.
MTH 121, Unified Calculus I
4 hrs. (Basic Skills MA)
Topics in analytic geometry; limits; continuity; differentiation; introduction to integration; applications.
Prerequisites: qualifying entrance and/or math precalculus placement scores; or grade or C or better in MTH 112.
MTH 122, Unified Calculus II
4 hrs. (Basic Skills MA)
Topics in calculus of logarithmic, exponential, and trigonometric functions; techniques of integration; analytic geometry; indeterminate forms; improper integrals; infinite series.
Prerequisite: grade of C or better in MTH 121.
MTH 2O7, Elementary Linear Algebra with Applications
3 hrs.
Matrix algebra, determinants, theory of simultaneous equations, vector spaces, bases, Gram-Schmidt orthogonalization, eigenvalues, eigenvectors, transformations, and applications.
Prerequisite: MTH 122, or consent of instructor.
MTH 223, Unified Calculus III
4 hrs. (Basic Skills MA)
Topics in vectors; calculus of functions of several variables; multiple integrals; vector calculus.
Prerequisite: grade of C or better in MTH 122.
MTH 325 & 326, Probability and Statistics I, II
3 hrs. each
Probability and statistical concepts, theory, and applications: random variables, sampling, central limit theorem, theories of estimation and the testing of hypotheses, linear models, and non-parametric methods.
Prerequisite: MTH 223; MTH 325 required for MTH 326.
PSY103, Principles of Psychology
3 hrs.
Cognitive, physiological and environmental factors that influence human behavior.
PSY 104, Social Forces and Individual Behavior: A Psychological Perspective
3 hrs. (Cen. Ed. SF)
Impact of social forces and institutions on individual behavior; interaction between individual and social environment.
QM 262, Quantitative Analysis I
3 hrs.
Data presentation and computation of descriptive measures. Probability theory, probability distributions, expectations, variance, covariance, and correlation coefficient. Sampling, central limit theorem, statistical estimation, one or two sample tests of hypotheses.
Prerequisite: MTH 115 or equivalent.
QM 263, Quantitative Analysis II
3 hrs.
Linear and multiple regression, correlation, analysis of variance, contingency tables, time series, decision theory, and non-parametric methods. Data analysis using statistical computer packages.
Prerequisite: QM 262.
Department of Computer Science and Information Systems
Information for this page was taken from the 1994-1995 Undergraduate Catalog. Please address comments and/or questions to Dr. James Miller, Chair.
Back to Computer Science and Information Systems Homepage.