Bradley Logo Schedule of Classes  
Summer Session II 2017  

Computer Science
Steven Dolins • Bradley Hall 185 • 677-3284
CS514Algorithms (3 hours)
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 Arr     Young Park  
CS532Advanced Java Computing (3 hours)
Prerequisite: Graduate standing in CS or CIS, or senior standing in CS or CIS, or CS 531 or equivalent.
 01 Arr     Jiang B Liu Online Course
CS561Artificial Intelligence (3 hours)
Prerequisite: Graduate standing in CS or CIS, or senior standing in CS or CIS, or CS 210 or equivalent.
 01 Arr     C Nikolopoulos  
CS612Automata, Computation and Complexity (3 hours)
Prerequisite: Graduate standing in CS or CIS, or CS 502 or equivalent.
 01 Arr     C Nikolopoulos  
CS635Data Communications and Networks (3 hours)
Prerequisite: Graduate standing in CS or CIS, or CS 330 or equivalent.
 01 Arr     Jiang B Liu Online Course
CS681Professional Practicum in Computer Science (0 hours)
Prerequisite: Graduate CS or CIS student in good standing; consent of department chair and graduate program director.
 01 *R* Arr     Steven Dolins  
CS698Directed Individual Studies in Computer Science (1 to 3 hours)
Prerequisite: Consent of instructor.
 01 *R* Arr     C Nikolopoulos  
 02 *R* Arr     Young Park  
 03 *R* Arr     Vladimir Uskov  
 04 *R* Arr     Jiang B Liu  
 05 *R* Arr     Alexander Uskov  
 06 *R* Arr     Steven Dolins  
 
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.
Developing Web-based systems using J2EE Java technologies. Topics include Java Security, Java GUI development using IDE, Java Servlets and JavaServer Pages, Java Enterprise JavaBeans, XML and Java Web Services, and Java Transaction Service and Java Message Service.
Pattern recognition, search strategies, game playing, knowledge representation; logic programming, uncertainty, vision, natural language processing, robotics, programming in LISP and PROLOG. Advanced topics in artificial intelligence.
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.
Fundamentals of data communication, computer network architectures and protocols, wireless networks, network programming, and network security. Emphasis on OSI, TCP/IP, ATM, and IEEE 802 LAN layered architectures, and TCP/IP network programming.
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.
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.
Picture of Instructor


Choose a different department

Choose a different semester

Search Class Database