Bradley Logo Schedule of Classes  
Fall Semester 2017  

Computer Science
Steven Dolins • Bradley Hall 185 • 677-3284
CS100Introduction to Programming Concepts and LanguagesGenEd: FS   Core: QR(3 hours)Seats
Avail
Prerequisite: MTH 109 or higher
 01 TT6:00 PM -7:15 PM BR290 Tim Applegren  5
CS101Introduction to ProgrammingGenEd: FS   Core: QR(4 hours)Seats
Avail
Prerequisite: MTH 109 or higher
 01 TT10:30 AM -12:15 PM BR160 Adam Byerly  0
 02 MW1:00 PM -2:45 PM BR160 Adam Byerly  0
 03 MW6:30 PM -8:15 PM BR180 Craig Cooper  0
 04 TT6:30 PM -8:15 PM BR150 Mark Sheehan  0
 05 MW4:30 PM -6:15 PM BR180 Craig Cooper  0
CS102Data Structures (3 hours)Seats
Avail
Prerequisite: A grade of C or better in CS 101.
 01 MW3:00 PM -4:15 PM BR150 Yun Wang  1
 02 MW10:00 AM -11:15 AM BR180 Yun Wang  4
CS140Advanced Programming Concepts and Languages (3 hours)Seats
Avail
Prerequisite: CS 102
 01 MW10:00 AM -11:15 AM BR290 Christopher Alvin  4
 02 MW5:00 PM -6:15 PM BR290 Christopher Alvin  0
 03 TT1:30 PM -2:45 PM BR290 Christopher Alvin  8
CS210Advanced Data Structures and Algorithms (3 hours)Seats
Avail
Prerequisite: grade of C or better in both CS 102 and CS 140 or equivalents; MTH 120 or equivalent.
 01 MW4:30 PM -5:45 PM BR150 Tachun Lin  1
CS215Computability, Formal Languages, and Heuristics (3 hours)Seats
Avail
Prerequisite: CS 210 or CIS 210 or equivalents; MTH 122 or equivalent.
 01 TT9:00 AM -10:15 AM BR156 C Nikolopoulos  1
 02 MW9:00 AM -10:15 AM BR156 C Nikolopoulos  7
CS220Computer Architecture (3 hours)Seats
Avail
Prerequisite: CS 140 or equivalent.
 01 TT4:30 PM -5:45 PM BR150 Jonathon Doran  0
CS321Operating Systems (3 hours)Seats
Avail
Prerequisite: CS 220.
 01 TT12:00 PM -1:15 PM BR180 Jonathon Doran  0
 02 MW1:00 PM -2:15 PM BR180 Jonathon Doran  3
CS480Social and Professional Issues in Computing (2 hours)Seats
Avail
Prerequisite: CS 210 or CIS 210 or equivalent; or consent of instructor.
 01 Tu6:00 PM -7:50 PM BR142 Christopher Glenn  0
CS481Professional Practicum in Computer Science (0 to 3 hours)Seats
Avail
Prerequisite: CS or CIS junior or senior student in good standing; consent of department chair.
 01 *R* Arr     Steven Dolins   
CS490Capstone Project I (3 hours)Seats
Avail
Prerequisite: CS 370, CS 390 or equivalents.
 01 Arr     Steven Dolins  5
 02 *R* Arr     Staff   
 03 *R* Arr     Christopher Alvin   
CS498Directed Individual Studies in Computer Science (1 to 3 hours)Seats
Avail
Prerequisite: Consent of instructor.
 01 *R* Arr     C Nikolopoulos   
 03 *R* Arr     Steven Dolins   
 04 *R* Arr     Jonathon Doran   
 05 *R* Arr     Tachun Lin   
 06 *R* Arr     Christopher Alvin   
CS502Advanced Programming (3 hours)Seats
Avail
Prerequisite: Graduate standing. Consent of graduate program coordinator; at least two semesters of programming experience.
 01 MW6:00 PM -7:15 PM BR150 Jason Monast  19
 02 *R* TT6:00 PM -7:15 PM BR156 Staff   
CS510Numerical Methods (3 hours)Seats
Avail
Prerequisite: Graduate standing in CS or CIS, or senior standing in CS or CIS, or CS 101 and MTH 207 and MTH 223.
 01 Canceled
CS514Algorithms (3 hours)Seats
Avail
Prerequisite: Graduate standing in CS or CIS, or senior standing in CS or CIS, or CS 210 or CIS 210 or equivalent and one semester of statistics.
 01 TT12:00 PM -1:15 PM BR100 Young Park  14
CS520Advanced Computer Architecture (3 hours)Seats
Avail
Prerequisite: Graduate standing in CS or CIS, or senior standing in CS or CIS, or CS 220 or equivalent.
 01 TT1:30 PM -2:45 PM BR160 Jiang B Liu  10
 02 *R* TT10:30 AM -11:45 AM BR160 Staff   
CS531Web Development Technologies (3 hours)Seats
Avail
Prerequisite: Graduate standing in CS or CIS, or senior standing in CS or CIS, or CS 102 or equivalent.
 01 *R* TT1:30 PM -2:45 PM BR150 Jiang B Liu   
 02 MW1:00 PM -2:15 PM BR150 Jiang B Liu  7
CS563Knowledge Discovery and Data Mining (3 hours)Seats
Avail
Prerequisite: Graduate standing in CS or CIS, or senior standing in CS or CIS, or CS 210 or CIS 210 or equivalent and one course in statistics.
 01 TT10:30 AM -11:45 AM BR156 C Nikolopoulos  0
CS571Database Management Systems (3 hours)Seats
Avail
Prerequisite: Graduate standing in CS or CIS, or senior standing in CS or CIS, or CS 210 or CIS 210 or equivalent.
 01 Canceled
 02 *R* TT6:00 PM -7:15 PM BR370 Staff   
 03 TT6:00 PM -7:15 PM BR261 Adam Byerly  17
CS572Advanced Topics in Databases (3 hours)Seats
Avail
Prerequisite: Graduate standing in CS or CIS, or senior standing in CS or CIS, or CS 370 or equivalent.
 01 Th6:30 PM -9:15 PM BR100 Steven Dolins  0
CS590Fundamentals of Software Engineering (3 hours)Seats
Avail
Prerequisite: Graduate standing in CS or CIS, or senior standing in CS or CIS, or CS 390 or equivalent.
 01 *R* M4:30 PM -7:15 PM BR160 Vladimir Uskov   
 02 Tu4:30 PM -7:15 PM BR160 Vladimir Uskov  13
CS591Software Project Management (3 hours)Seats
Avail
Prerequisite: Graduate standing in CS or CIS, or senior standing in CS or CIS, or CS 390 or equivalent, or consent of instructor.
 01 W4:30 PM -7:15 PM BR160 Vladimir Uskov  0
CS592Requirements Development (3 hours)Seats
Avail
Prerequisite: Graduate standing in CS or CIS, or senior standing in CS or CIS, or CS 210 or CIS 210 or equivalent, or consent of instructor.
 01 Canceled
 02 Canceled
 03 TT3:00 PM -4:15 PM BR290 Young Park  7
CS612Automata, Computation and Complexity (3 hours)Seats
Avail
Prerequisite: Graduate standing in CS or CIS, or CS 502 or equivalent.
 01 MW10:30 AM -11:45 AM BR160 Young Park  21
CS625Operating Systems Design (3 hours)Seats
Avail
Prerequisite: Graduate standing in CS or CIS, or CS 321 or equivalent.
 01 TT3:00 PM -4:15 PM BR120 Jiang B Liu  16
CS681Professional Practicum in Computer Science (0 hours)Seats
Avail
Prerequisite: Graduate CS or CIS student in good standing; consent of department chair and graduate program director.
 01 *R* Arr     Steven Dolins   
CS697Advanced Topics in Computer Science (3 hours)Seats
Avail
Prerequisite: Consent of instructor.
 01 Arr     Vladimir Uskov  7
CS698Directed Individual Studies in Computer Science (1 to 3 hours)Seats
Avail
Prerequisite: Consent of instructor.
 01 *R* Arr     Steven Dolins   
 02 Arr     Vladimir Uskov  1
 03 *R* Arr     C Nikolopoulos   
 05 *R* Arr     C Nikolopoulos   
 06 *R* Arr     Young Park   
 07 *R* Arr     Alexander Uskov   
 08 *R* Arr     Tachun Lin   
CS699Thesis in Computer Science (0 to 6 hours)Seats
Avail
Prerequisite: Consent of department chair
 01 *R* Arr     Steven Dolins   
 
An introduction to programming concepts and languages for non-Computer Science (CS) majors. Topics include the structure and design of algorithms, variables, constants, data types, arithmetic operations, selection and repetition structures, functions, input/output, arrays, structures, files, libraries. Students will design, write, test and run computer programs using a modern programming language as the development tool.
Introduces the fundamental concepts of programming from an object-oriented perspective. Topics include simple data types, control structures (if-else loops, switch statements), introduction to array and string data structures, algorithms, debugging and testing techniques, and social implications of computing. The course emphasizes good software engineering principles and practices, breaking the programming process into analysis, design, implementation, and testing, with primary focus on implementation and development of fundamental programming skills.
Introduction to concepts of object-oriented programming with review of control structures and data types and array processing. Introduction to the object-oriented programming paradigm, focusing on the definition and use of classes along with the fundamentals of object-oriented design. Overview of programming principles, simple analysis of algorithms, searching and sorting techniques, and an introduction to software engineering issues.
Advanced programming concepts and languages appropriate to computer science and computer information systems. Topics include dynamic memory management, garbage collection, advanced object-oriented concepts, generic programming, exception handling, recursion, overloading.
Advanced topics in object-oriented programming with an emphasis on advanced data structures, algorithms, and software development.
Theory of computation and formal languages, grammars, computability, complexity, algorithms, heuristics, and foundations of intelligent systems.
Basics of logic circuit design, modern processor architecture, and assembly language. Overview of principle issues of internal system architecture, including memory, buses, and peripherals.
Fundamentals of operating systems concepts, design, and implementation. Topics include operating system components and structures, process and thread model, mutual exclusion and synchronization, scheduling algorithms, memory management, I/O controls, file systems, and security.
Introduction to the social and professional issues and practices that arise in the context of computing.
Special projects under staff supervision on professional practicum in computer science, with near-term economic benefit. Repeatable to a maximum of 3 credit hours.
Applies the concepts and skills learned by undergraduate computer science majors at Bradley University. Students are required to work on a team on a significant software project.
Individual study or research/development project under supervision of a CS&IS faculty member. May be repeated under a different topic once. Repeatable to a maximum of six semester hours.
Introduces the fundamental concepts of programming from an object-oriented perspective with emphasis on advanced programming skills and good software development principles in a closed laboratory setting. Covers topics including object-oriented paradigm, design and programming, fundamental data structures and computing algorithms, and software development principles. If needed, course should be taken during first regular semester at Bradley. Credit for this course does not count towards graduation requirements in any graduate program within the Department of Computer Science and Information Systems.
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.
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.
Fundamental computer sub-systems: central processing unit; memory systems; control and input/output units. General purpose computing systems design. Examples from existing typical computers.
ntroduction to PERL/CGI, XHTML, XML, JavaScript and scripting languages. Web page design and layout. Client and server side development of web applications. Database connectivity, Java Database Connectivity (JDBC).
Brings together the latest research in statistics, databases, machine learning, and artificial intelligence that are part of the rapidly growing field of knowledge discovery and data mining. Topics covered include fundamental issues, classification and clustering, machine learning algorithms, trend and deviation analysis, dependency modeling, integrated discovery systems, next generation database systems, data warehousing, and OLAP and application case studies.
Relational database design, including entity relationship modeling and normalization. Structured query language (SQL) for creating and querying databases. Other topics include the theory of relational databases, including relational algebra, various loading and reporting utilities, and the implementation of database management systems, e.g., how query optimization works.
Designing and building enterprise-wide data warehouses. Techniques for analyzing data in data warehouses. Study different types of data models including logic and object-oriented databases. Advanced topics in relational databases such as multimedia databases, distributed databases, concurrency, security, etc.
Software engineering: software product; prescriptive process models; system engineering; analysis modeling; design engineering; architectural design; user interface design; testing strategies and techniques; software systems' implementation; software systems' maintenance.
Methods of PMBOK-based management of software systems design and development projects, including systems view, main project management process groups and knowledge areas, management plans, project metrics and estimates, tools for project management, project reports and documentation. Cross listed with CIS 491 and CIS 591 courses. For cross listed undergraduate/graduate courses, the graduate level course will have additional academic requirements beyond those of the undergraduate course.
Covers topics including basic concepts and principles of software requirements engineering, the requirements engineering process, requirements elicitation, requirements analysis, requirements specification, system modeling, requirements validation and requirements management, and techniques, methods, and tools for requirements engineering and software systems requirements modeling (including structured, object-oriented and formal approaches to requirements modeling and analysis).
Theory of formal languages and computability, Automata, Turing machines, grammars. Context free and context sensitive languages; parsing. Recursion theory; limits of effective computability, P and NP class of problems, NP-complete problems. Non Turing computable problems, reducibility, complexity.
Advanced concepts in operating system design. Topics include process and thread management, virtual memory, interprocess communication, distributed systems, parallel and distributed file system designs, resource management, and security and protection.
Special projects under Smith Career Center supervision on student's professional practicum in corporate/business environment in computer science, with near-term economic benefit. Satisfactory/Unsatisfactory. Minimum of 5-10 hours per week required.
Special projects under staff supervision on advanced problems in numerical or non-numerical branches of computer science. May be taken more than once under different topics for a maximum of 6 semester hours.
Individual study in an area of computer science relevant to the student's professional goals and not covered in a formal course offered by the department. May be repeated twice for a maximum of 6 credit hours.
Computer science research and thesis preparation. Required of candidates choosing the thesis option. Total of 6 semester hrs. to be taken in one or two semesters.
This course meets a General Education requirement.
C1 - English Composition
C2 - English Composition
SP - Speech
MA - Mathematics
WC - Western Civilization
NW - Non-Western Civilization
FA - Fine Arts
HL - Human Values - Literary
HP - Human Values - Philosophical
CD - Cultural Diversity
SF - Social Forces
FS - Fundamental Concepts in Science
TS - Science & Technology in the Contemporary World
This course meets a Core Curriculum requirement.
OC - Communication - Oral Communication
W1 - Communication - Writing 1
W2 - Communication - Writing 2
FA - Fine Arts
GS - Global Perspective - Global Systems
WC - Global Perspective - World Cultures
HU - Humanities
NS - Knowledge and Reasoning in the Natural Sciences
SB - Knowledge and Reasoning in the Social and Behavioral Sciences
MI - Multidisciplinary Integration
QR - Quantitative Reasoning
This section meets a Core Curriculum requirement.
IL - Integrative Learning
WI - Writing Intensive
Picture of Instructor


Choose a different department

Choose a different semester

Search Class Database