|
NOTICE - This edition of the Catalog of Studies is provided as a courtesy to students who may be attending classes under these degree requirements. If you are a prospective student, or are attending class under a different set of degree requirements, please visit http://catalogofstudies.uark.edu/ to find your class year catalog. |
![]() |
![]() |
|
|
COMPUTER SCIENCE AND COMPUTER ENGINEERING Aicha Elshabini, Head of the Department, 313 Engineering Hall, 575-6036 Professors Brewer, Elshabini, Crisp,
Lala, Skeith, Starling Associate Professors Deaton, Li Visiting
Associate Professor Beavers Assistant Professors Apon, Blank, Cam,
Hexmoor, Parkerson, Simonson, Thompson Instructors Baker, Holmes,
Johnson,
The department offers the bachelor of science and bachelor of arts degrees in computer science, the bachelor of science degree in computer engineering, and master of science and doctor of philosophy degrees in both computer science and computer engineering. The undergraduate computer engineering degree is described in the listing for this department in the College of Engineering section of this catalog. The graduate degrees are described in the Graduate School Catalog. The discipline of computer science has evolved during the past three decades with the expanding role of computers in our society. Computer science is an essential component of information technology, and the information superhighway that will lead the economic development of the 21st century. A degree in computer science provides a unique diversity in career choices. Computer science graduates can design, implement, or manage computer systems, as well as adapt computers to new applications. Graduates are often employed in scientific and engineering applications or as systems programmers. The bachelor of science degree in computer science also prepares students for entry into graduate studies in the field. The computer science program combines scientific and engineering principles, theoretical analysis, and practical computing experience to provide undergraduate students a sold foundation in the discipline. Computer science core courses include the fundamentals of programming concepts, data structures, operating systems, boolean and digital logic, and programming languages. Requirements for a Major in Computer Science, Bachelor of Science Degree: At least 47 hours in the major department including CSCE 1113/1111L or CSCE 1113H/1111M, CSCE 1123/1121L, CENG 2113, CSCE 2133, CSCE 2143, CSCE 3213, CSCE 3313, CSCE 4413, CSCE 4513, and CSCE 4313, CSCE 4323; 12 hours of electives (at least nine at the senior level) to be selected from CSCE 4523, CSCE 4753, CSCE 4253, CSCE 4613, CSCE 490V, CSCE 4912H, CSCE 498V, CENG 4813, CENG 4423, CENG 4533, ELEG 3923, ELEG 4683, ELEG 4943, MATH 3353. The mathematics, statistics, and science requirements for the B.S. degree in computer science are MATH 2103, MATH 2554, MATH 2564, MATH 3083, MATH 3103 and STAT 4003/4001L or STAT 3013 and a two-course sequence in a laboratory science. The courses used to satisfy the science requirement must be chosen from the natural sciences and must be approved by the department; only courses thatmay be used to satisfy the requirements for a B.S. degree in the department offering the course will be approved. Requirements for Major in Computer Science, Bachelor of Arts Degree: At least 30 hours in computer science including CSCE 1113/1111L or CSCE 1113H/1111M, CSCE 1123/1121L, CSCE 2143, CSCE 3313, and CSCE 4313 plus 13 hours of electives to be selected from a list of courses numbered 3000 or higher offered by the department. The mathematics requirements of the degree are MATH 2043 or MATH 2554, MATH 2103, MATH 3103. Writing Requirement: The Fulbright College research paper requirement for either degree program may be fulfilled in CSCE 4313. Requirements for Departmental Honors in Computer Science: The Departmental Honors Program in Computer Science is designed for the superior student and is intended to help the student develop a more comprehensive view of the nature of computer science. The program provides a vehicle for the recognition of the achievements of work beyond the usual course of study. Acceptable performance in the program will earn the student the distinction "Computer Science Scholar Cum Laude" at graduation. Higher degree distinctions are recommended only in truly exceptional cases and are based upon the candidate's whole program of honors studies. The department considers the following requirements necessary for graduation with honors: 1. The candidate must satisfy the requirements set forth by the Honors Council, 2. A student must obtain at least a 3.50 grade-point average in the required computer science courses for the chosen degree program. In addition, a grade of "D" or "F" in any of the departmental offerings disqualifies a student for honors in computer science. 3. Candidates must take two semesters of honors seminar, CSCE 4912H, in their senior year. This course will require an acceptable paper and will carry two hours of credit per semester. Requirements for a Minor in Computer Science: CSCE 1113/1111L or CSCE 1113H/1111M, CSCE 1123/1121L, CSCE 2143, CSCE 3313, and either CSCE 2133 or CSCE 4313. For requirements for the M.S. degree in computer science, see the Graduate School Catalog.
COMPUTER SCIENCE & COMPUTER ENGINEERING (CSCE) CSCE1003 Survey of Computer Concepts (FA, SP, SU) (Formerly CSCI 1003) Vocabulary of computers, covering terminology and concepts of large and small computers. Uses of computers in science, business, and government. Introduction to use of a computer, but students wishing to learn programming language should take CSCE 1023/1021L. Credit will not be given for both this course and CSCE 1012. CSCE1012 College Computing Skills (FA, SP, SU) (Formerly CSCI 1012) Introduction to the computer; basic computing skills including operating systems, word processing, spreadsheet and data base management applications; Internet applications including electronic mail, remote computing via Telnet, file transfer via ftp, World Wide Web navigation and publication. No prior computing experience necessary. CSCE1023 Programming I (FA, SP) (Formerly CSCI 1023) Teaches how
to design, implement, and document computer programs using techniques
of good programming style. Pre- or Corequisite: CSCE 1021L. CSCE1021L Programming I Laboratory (FA, SP, SU) (Formerly CSCI 1021L) Laboratory exercises appropriate to Programming I. Pre- or Corequisite: CSCE 1023 or CSCE 1023H. CSCE1021M Honors Programming I Laboratory (FA) (Formerly CSCI 1021M) Laboratory exercises appropriate to Programming I, Honors. Pre- or Corequisite: CSCE 1023H. CSCE1113 Introduction to Computers (FA, SP) (Formerly CSEG 1113 and CSCI 1033.) Introductory course for students majoring in computer science or computer engineering. Topics include Von Neumann architecture, data representation, high-level languages, looping, functions, and pointers. (Same as CENG 1113) Pre- or Corequisite: CSCE 1111L or CENG 1111L. CSCE1113H Introduction to Computers (FA, SP) (Formerly CSEG 1113 and CSCI 1033) Introductory course for students majoring in computer science or computer engineering. Topics include Von Neumann architecture, data representation, high-level languages, looping, functions, and pointers. Corequisite: CSCE 1111M. CSCE1111L Introduction to Computers Laboratory (FA, SP) Laboratory experiences to accompany CSCE 1113. (Same as CENG 1111L) Corequisite: CSCE 1113 CSCE1111M Honors Introduction to Computers Laboratory (FA, SP) Laboratory experiences to accompany CSCE 1113 H. Corequisite: CSCE 1113 H CSCE1123 Introduction to Programming (FA, SP) Introductory course to programming. Topics include problem analysis and specification, design and test of programming solutions, toils, decomposition, abstraction, iteration and recursion, program I/O and files. Credit will be allowed for only one of CSCI 1023 and CSCE 1123. (Same as CENG 1123) Pre- or Corequisite: CSCE 1121L or CENG 1121L. Prerequisite: CSCE 1113 or CENG 1113. CSCE1123H Honors Introduction to Programming (FA, SP) Introductory course to programming. Topics include problem analysis and specification, design and test of programming solutions, toils, decomposition, abstraction, iteration and recursion, program I/O and files. Credit will be allowed for only one of CSCI 1023 and CSCE 1123H. Pre- or Corequisite: CSCE 1121M. Prerequisite: CSCE 1113. CSCE1121L Introduction to Programming Laboratory (FA, SP) (Formerly CSCI 1021L) Laboratory experiences appropriate to CSCE 1123. Corequisite: CSCE 1123 CSCE1121M Honors Introduction to Programming Laboratory (FA, SP) Laboratory experiences appropriate to CSCE 1123H Corequisite: CSCE 1123H. CSCE2133 Assembler Language Programming (FA, SP) (Formerly CSCI 2003 and CSEG 2533) Study of the connection between hardware and machine language and between assembler and high-level languages. Topics include internal data representation, instructions, memory, and data, I/O, hardware control, and high-level language interfacing. (Same as CENG 2133) Prerequisite: (CSCE 1123 or CENG 1123 or CSEG 1913 or CSCI 1033) and (CENG 2113 or CSEG 2513). CSCE2143 Data Structures (FA, SP) (Formerly CSCI 2013 and CSEG 3543) Applications of the element of data structures, arrays, linked lists, trees, stacks, and search techniques. (Same as CENG 2143) Prerequisite: (CSCE 1123 or CENG 1123) and (MATH 2554 or MATH 2043). CSCE2812 Introduction to Internet/World Wide Web (FA) (Formerly CSCI 2812) Introduction to Internet and World Wide Web tools and resources, including Web browsers, robots and search engines, multimedia authoring systems, electronic publishing systems, virtual reality systems, network compatible CD-ROMs, network telecommunication and security systems, digital watermarking, Web censors, internet authoring and programming languages. Corequisite: CSCE 2811L. Prerequisite: CSCE 1012 or equivalent computer experience. CSCE2811L Introduction to Internet/World Wide Web Laboratory (FA) (Formerly CSCI 2811L) Laboratory to accompany CSCE 2812. Students develop practical skills in, and learn to apply industry-wide standards and practices for, Web page design and layout, electronic publishing, network communications, cybermedia authoring systems, and such bandwidth-limiting enhancements as animation and applets. Corequisite: CSCE 2812. CSCE3213 Computer Organization (FA, SP) (Formerly CSCI 3303) An introductory course in computer organization including topics in digital logic, digital systems, and memory structure. (Same as CENG 3213) Prerequisite: (CSCE 2133 or CENG 2133 or CSEG 2533 or CSCI 2533) and (CENG 2113 or CSEG 2513). CSCE3313 Algorithms (FA, SP) (Formerly CSCI 2023 or CSCE3412 Internet Programming (SP) (Formerly CSCI 3412) HTML authoring to IETF and non-IETF standards, use of environment and SSI variables, CGI-Bin programming concepts with both scripting languages and interpreted and compiled languages, creating cybermedia documents, advanced form applications, search/index utilities, Web databases. Course presumes programming proficiency in one network language: Basic, C, C++, Perl. Corequisite: CSCE 3411L. Prerequisite: CSCE 3313. CSCE3411L Internet Programming Laboratory (SP) (Formerly CSCI 3411L) Lab will help student develop practical skills in , and learn to apply industry-wide standards and practices for, Web page design and layout, electronic publishing, network communications, cybermedia authoring systems, and such bandwidth-limiting enhancements as animation, applets, etc. Course presumes programming proficiency in one network language: Basic, C, C++, Perl. Corequisite: CSCE 3412. Prerequisite: CSCE 3313. CSCE390V Topics in Computer Science (1-6) (IR) (Formerly CSCI 390) Topics not offered in depth in other computer science courses. Prerequisite: junior standing. CSCE3923H Honors Colloquium (IR) (Formerly CSCI 3293H) Covers a special topic or issue, offered as part of the Honors Program. May be repeated. Prerequisite: honors candidacy (not restricted to candidacy in computer science). CSCE4253 Concurrent Computing (IR) (Formerly CSCI 4413) Programming concurrent processes; computer interconnection network topologies; loosely coupled and tightly coupled paralleled computer architectures; designing algorithms for concurrency; distributed computer architectures. Prerequisite: senior standing in computer science or engineering. CSCE4313 Introduction to Programming Languages (SP) (Formerly CSCI 3503) Comparison of the structure, features, compile and run-time characteristics of LISP, SNOBOL4, PASCAL, PL/1, FORTRAN, ALGOL, and APL. Syntax of programming languages, programming language structures, control structures, operators and operations, and language extensibility. The research paper in this class may fulfill the Fulbright College research paper requirement for computer science majors. Prerequisite: CSCE 2143 CSCE4323 Introduction to Formal Languages and Computability (IR) (Formerly CSCI 4603) Finite Automata and regular languages, regular expressions, context-free languages and pushdown automata, nondeterminism, grammars, Turing machines, primitive recursive and m-recursive functions. Church's thesis, halting problem, and undecidability. Prerequisite: CSCE 4313. CSCE4413 Operating Systems (FA, SP) (Formerly CSCI 4203) An introduction to operating systems including topics in system structures, process management, storage management, files, distributed systems, and case studies. (Same as CENG 4413) Prerequisite: CSCE 3213 and CSCE 2143. CSCE4513 Software Engineering (FA, SP) (Formerly CSCI 4003 and CSEG 2723) A modern approach to the current techniques used in software design and development. This course emphasizes the use of modern software development tools, multi-module programming, and team design and engineering. (Same as CENG 4513) Prerequisite: CSCE 3313 CSCE4523 Database Management Systems (IR) (Formerly CSCI 4103) What a database management system is; different data models used to structure the logical view of the database; relational, hierarchical, and network. Implementation techniques for database systems: concurrency control, rollback and recovery, integrity and consistency, and view implementation. Prerequisite: CSCE 3313. CSCE4613 Artificial Intelligence (FA) (Formerly CSCI 3603) Representation of information and knowledge search strategies and heuristics for problem solution. Concepts of computer vision and natural language understanding. Current work in robotics, medicine, psychology. Introduction to Al languages (SAIL, LISP, DENTRAL). Prerequisite: CSCE 2143. CSCE4623 Intelligent Robot Control (IR) (Formerly CSCI 4513) Examines software issues surrounding the creation and control of autonomous robots. Techniques include: genetic programming, artificial neural networks, reinforcement learning, and symbolic methods. Programs are run in simulation and on actual robotic controllers. Topics discussed include visual processing, spatial mapping, and learning. Prerequisite: CSCE 4613. CSCE4753 Computer Networks (IR) (Formerly CSCI 4403 and CSEG 4083) The Internationals Standards Organization layered model; network topology; public and proprietary networks. Prerequisite: CSCE 3213 and CSCE 2143. CSCE490V Special Problems (1-6) (IR) (Formerly CSCI CSCE4912H Honors Seminar (IR) (Formerly CSCI 4912H) Topics for students in the honors program. May be repeated for 4 hours. Prerequisite: acceptance into the honors program and senior standing. CSCE498V Senior Thesis (1-6) (IR) (Formerly CSCI 498V) CSCE4991 Computer Science Review (FA, SP) (Formerly CSCI 4991) A course to review and appraise the knowledge of the fundamental concepts of computer science. A standardized, comprehensive examination is administered at the end of the course. Prerequisite: senior standing with 18 semester credit hours of graduation. CSCE5003 Advanced Programming Languages (SP) (Formerly CSCI 5003) Abstraction, proof of correctness, functional languages, concurrent programming, exception handling, dataflow and object oriented programming, denotational semantics. Prerequisite: graduate standing. CSCE5023 Architecture of Computer Systems (FA) (Formerly CSCI 5023) An advanced study of both classical and recent computer hardware and software systems. Prerequisite: CSCE 3213 and CSCE 4413. CSCE5033 Design and Analysis of Algorithms (SP) (Formerly CSCI 5033) Design of computer algorithms, with primary emphasis on the development of efficient implementation. Prerequisite: graduate standing. CSCE5043 Artificial Intelligence (FA) (Formerly CSCI 5043 and CSEG 5003) Provides students with an introduction to the major subjects and techniques of artificial intelligence. Topics include: machine learning, computer vision, natural language understanding, and AI languages. Prerequisite: CSCE 4613 and graduate standing. CSCE5123 Databased Management systems (IR) (Formerly CSCI 5123) This course is an introduction to database systems for graduate students with no background on databases. We cover data modeling, basic concepts of the relational model, relational languages(algebra, SQL), databased design and database implementation. Prerequisite: CSCE 3313 and graduate standing. CSCE5203 Advanced Database Systems (IR) (Formerly CSCI 5203) Data and storage hierarchies, database models, user language designs, database manipulations. Prerequisite: CSCE 2143 and graduate standing. CSCE5233 Principles of Compiler Construction (IR) (Formerly CSCI 5233) Lexical analysis, parsing, symbol table construction, intermediate code generation, run-time simulation. Prerequisite: graduate standing. CSCE5243 Formal Languages (IR) (Formerly CSCI 5243) An advanced continuation of CSCE 4323. Prerequisite: CSCE 4323 and graduate standing. CSCE5263 Computational Complexity (IR) (Formerly CSCI 5263) Turing machines, recursion theory and computability, complexity measures, NP-completeness, analysis on NP-complete problems, pseudo-polynomial and approximation. algorithms. Prerequisite: graduate standing. CSCE5283 Graph and Combinatoric Algorithms (IR) (Formerly CSCI 5283) A study of algorithms for graphs and combinatorics with special attention to computer implementation and runtime efficiency. Prerequisites: Math 2103 and a programming language. CSCE5303 Parallel Programming (IR) (Formerly CSCI 5303) An analysis of parallel computer systems with respect to software engineering. Practical programming experience on pipelined, array, and multi-processor computers. Credit can be earned in only one of these three courses. CSCE 5303 or CENG 5303 or ELEG 5913. Prerequisite: working knowledge of 'C' language and CENG 4413 or equivalent. CSCE5313 Advanced Operating Systems (IR) (Formerly CSCI 5313) Concurrent processes and process communication; mutual exclusion and synchronization principles; kernel philosophy; resource allocation and deadlock; case studies of specific operating systems. Prerequisite: CSCE 4413 and graduate standing. CSCE5513 Intelligent Robot Control (IR) (Formerly CSCI 5513) This course is designed to examine software issues surrounding the creation and control of autonomous robots. Techniques include: genetic programming, artificial neural networks, reinforcement learning, and symbolic methods. Programs are run in simulation and on actual robotic controllers. Topic discussed include visual processing, spatial mapping, and learning. Prerequisite: graduate standing CSCE5713 Multimedia Systems Design (IR) (Formerly CSCI 5713) Overview of digital unified multimedia. Programming methodology involved in integration of all forms of digitized information (e.g., text, sound, graphics, animation, and process control) in a single computer-based interactive environment. CSCE5723 Client-Server Computing (IR) (Formerly CSCI 5723) Distributed computing paradigms: client-server, peer-to-peer, nomadic; client and server-side components, communications interface technology, interprocess-communications, development hardware and software. Prerequisite: graduate standing. CSCE5733 Information Agency (FA, SP, SU) (Formerly CSCI 5733) The study of software agents and their deployment on the internet: precursors to agents - viruses and worms, origins of software agents, delegate vs. representative agents, agency of the Internet and Web, operational guidelines for agents, HTTP, transaction security, MUD agency, intelligent agency, applications of agents: indexers, resource managers, search utilities, commercial applications. CSCE590V Advanced Topics in Computer Science (1-3) (IR) (Formerly CSCI 590) Topics not covered in depth in other courses. Prerequisite: graduate standing. CSCE5953 Real-time Systems (FA, SP, SU) (Formerly CSCI 5953) A study of real-time system design. The development of real-time systems will be examined from the standpoint of academia, government, and industry. Scheduling, operating systems, and architecture considerations are among other topics to be covered. CSCE610V Master's Thesis (1-6) (FA, SP, SU) (Formerly CSCI 610) CSCE620V Research in Computer Science (1-18) (IR) (Formerly CSCI 620) Prerequisite: graduate standing. CSCE690V Graduate Seminar (1-6) (IR) (Formerly CSCI 690) Concentrated study in selected areas of computer science research. May be repeated for 12 hours. Prerequisite: advanced graduate standing CSCE700V Doctoral Dissertation (1-18) (FA, SP, SU) (Formerly CSCI 700) May be repeated for 5 hours.
|
[Jump back to the top of this page][Go back to the 01-02 Catalog Home]