|
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
Science, Health and Technology |
CS 100 Internet and Web Technologies 3 Class hours, 1 Laboratory hour This course provides students with practical knowledge about computer
hardware and software, and a basic understanding of the underlying
communication technology of the internet, while exploring numerous
research-related web sites using E-mail, FTP, WAIS, and Telnet services.
After exploring and using HTML to create Web pages, JavaScript introduced and used
for developing client-side applications for Web
browsers. A publishable home page or other Web document is produced by
students as their final project.
Prerequisite: MTH 120 Co requisites: MTH 130 and the completion of all developmental
requirements. CS 151 Introduction to Computing 3 class hours, 1 laboratory hour, 3 credits This course introduces the fundamental concepts of the discipline of computing, emphasizing elementary facts concerning computer architecture, programming languages, software methodology, and algorithms. Students learn how to solve problems using an appropriate block-structured high level programming language. Programming topics include: basic data structures, control structures, data and procedure abstraction, functions and function parameters, recursion, pointers, classes and file processing. Co requisite: MTH 151 Pre calculus Note: This is the first required course for prospective computer science majors. The C++ programming language is used to develop and implement algorithms. Back to the top
CS 241 Discrete Structures 3 class hours, 3 credits The objective of this course is to introduce the elements of discrete mathematical systems pertinent to the field of computer science. Through computer examples, exercises and case studies, students are taught the following mathematical concepts: sets and binary relations, functions, symbolic logic, Boolean algebra, elementary graph theory, matrices, proof techniques (including induction and contradictions), combinatorics, probability, random numbers, and Turing machines. Prerequisite: CS 151 Back to the top
CS 251 Fortran Programming (Computer Science Elective) 2 class hours, 2 laboratory hours This course is designed to introduce students to problem solving techniques and methods that they can use in mathematics. FORTRAN topics include: algorithm formulation, arithmetic computations, formatted input/output, control structures, array processing, functions, subroutines, file handling, and program development and testing. Prerequisite: CS 151 or MTH 151 Pre calculus Back to the top
CS 252 Assembly Language and Architecture 3 class hours, 1 laboratory hour, 3 credits In assembly language and architecture, students are exposed to the register level architecture of a modern processor and gain experience programming in the assembly language for that processor. ALU, memories, and interfaces are covered. Emphasis is placed on machine language, instructions, and digital representation of data. Program segmentation, linkage, subroutine calling conventions, and floating-point operations are also discussed. Prerequisite: CS 151 and CS 262 Back to the top
CS 260 Computer Organization and Logic Design 3 class hours, 3 laboratory hours, 4 credits This course presents the theoretical principles and mathematical techniques involved in the hardware design of digital systems. Number systems and codes, Boolean algebra, Boolean functions, canonical forms, logic gates realization, universal gates, combinational and sequential circuits, and minimization of functions using the Karnaugh map and the Quine-McCluskey method. Basic computer organization. Interactive circuit design software is used for Laboratory experiments. Prerequisite: CS 241 and CS 252 Back to the top
CS 262 Data Structures and Algorithms 3 class hours, 1 laboratory hour, 3 credits This course introduces the different ways that data is organized and stored in computer memory and the relevant procedures used in the manipulation of that data. The idea of abstract data types (ADTs) is first introduced, and then reinforced through the characterization of fundamental data structures in the discipline - stacks, queues, and trees. Recursive algorithms, dynamic storage, and complexity. Algorithms for searching and sorting are also implemented. Prerequisite: CS 151 and CS 241 Note: C++ is used to facilitate the design, implementation, and applications of data structures. Back to the top
CS 263 Object-Oriented Programming and Design 3 class hours, 1 laboratory hour, 3 credits This course presents an object-oriented approach to software development used in large-scale programming projects. A software engineering methodology, and functional modeling. Students learn how to implement a system using an appropriate object-oriented programming language. Programming topics include: Classes and data abstraction, operator overloading, inheritance, virtual functions and polymorphisms, templates, exception handling, and class libraries including GUI applications using the Java AWT. Prerequisites: CS 262 Note: C++ and java are used to implement the object-oriented design model. Back to the top
CS 265 UNIX/ C Systems Programming (Computer Science Elective) 3 class hours, 1 laboratory hour, 3 credits This course provides an in-depth introduction to the UNIX Operating System. Topics include: UNIX commands, the UNIX File System and its related structures, Editors, the UNIX Command Interpreter, Systems Administration, UNIX Applications Operating Environments, Communicating and Networking through UNIX. The UNIX/ C Systems Interface is studied via several examples of UNIX system calls from C Programs. The conventional core of the C programming language is covered. Prerequisite: CS 252 and CS 262 Back to the top
CS 275 Data Communications (Computer Science Elective) 3 class hours, 3 credits This course covers the theoretical foundations and some practical applications of data communications. Topics include data codes, error detecting codes, error correcting codes, Huffman codes, frequency division, multiplexing, time division multiplexing, synchronous and asynchronous communications, data link control protocols, data communications software design, programming asynchronous interfaces and synchronous communications hardware interfaces. Prerequisite: CS 151 Back to the top
CS 280 Artificial Intelligence 3 class hours, 1 laboratory hour, 3 credits This course examines the ideas and techniques underlying design of intelligent computer systems. Topics include knowledge representation, heuristic versus algorithmic search methods, problem solving, game playing, logical interfaces planning, reasoning under uncertainty, expert systems, learning, perception, natural language understanding, and intelligent agent. A functional programming language appropriate to Artificial Intelligence will be introduced. Prerequisite: CS 262 and MTH 201 Calculus I Back to the top
CS 281 Database Systems (Computer Science Elective) 3 class hours, 1 laboratory hour, 3 credits This course provides the basis for a solid education in the fundamentals of database technology. Database Management, Database System Architecture, Relational Data Base Systems (Query Languages, Application Development Systems), Software Specific (Self Contained) and Hardware Specific (Data Base Machines) are also covered. Prerequisite: CS 262 Back to the top
CS 310 Special Topics in Computer Science (Computer Science Elective) Courses on contemporary topics in computer science to be offered according to the latest developments in the field and the needs of the students. Students are taught the underlying principles of analysis, design, and implementational issues involved in computing. Several examples and applications are used to illustrate the theory and concepts covered. A detailed description for each special topic offering may be obtained in the Department office prior to registration. Students are also required to submit a research paper on an approved topic. Prerequisites: CS 262 and Permission of the Chair or Coordinator of Computer Science. Back to the top CS 319 Geographic Information Systems 3 class hours, 1 lab hour, 3 credits This course examines the automated systems for the capture,
storage, CS 321 REMOTE SENSING - Computer Methods for Satellite Data Analysis 3 class hours, 1 lab hour, 3 credits This course emphasize the scientific principles of satellite
data analysis and efficiency of computer methods for carrying out this analysis and
convert raw data into meaningful physical quantities. Topics include:
concepts and systems, electromagnetic energy, photographs from aircraft
and satellite, remote sensing in the visible and IR spectrum, active and
passive remote sensing, thermal IR images, Earth resources, image
processing and interpretation, meteorological, oceanographical and
environmental applications, and monitoring natural hazards, geographic
information system and overview of scatterometry. Course includes Hands-on
demonstrations and data analysis of satellite data.
*Students with mathematics skills deficiencies may be required to take CS 100 and its co requisite MTH 130. MATHEMATICS
PHYSICS
SCIENCE OPTION: SELECT ONE COURSE FROM C1, C2 or C3 C1. Computer Engineering Option:
C2. Software Option:
MATHEMATICS:
Semester I
Semester II
Semester
III
Semester
IV
*Note: Needed for articulation to B.S. degree programs requiring physics.
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| [../../../../mec_navlinks.htm] | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||