Sheet1

Apalachian State University

Elizabeth City State University

East Carolina University

Falleteville state university

North Carolina A&T State University
North Carolina Central University
North Carolina State University at Raleigh

Page 1
Sheet1

Page 2
 Sheet1

CSC

Page 3
 Sheet1

University of north carolina at Ashville

The university of north carolina at Chapel Hill

UNC Charlotte

Page 4
 Sheet1

University of north carolina at Greensboro

Page 5
 Sheet1

University of north carolina at Pembroke

Western Carolina University
University of north carolina at Wilmington

Page 6
 Sheet1

Wiston Salem State University

Page 7
 Sheet1

http://www.graduate.appstate.edu/gradstudies/bulletin10/courses/compsci.html
CS 5630. Programming Language Translation/(4).F. Techniques for the translation
of programming languages into machine or assembly language. Each student will
participate in the writing of a compiler. Lecture three hours, laboratory three
hours. Prerequisites: CS 3482 (Computer Systems II) and CS 3490 (Programming
Languages). [Dual- listed with CS 4630.]
Sólo tiene Master in Mathematics
http://www.ecu.edu/cs-acad/grcat/coursesCSCI.cfm
6120. Computer Systems Architecture (3)
P: CSCI 4520 or consent of instructor. Sequential architectures, instruction sets,
addressing modes, and control structures. Introduces parallel architectures.
5210. Operating Systems II (3)
P: CSCI 4630 or consent of instructor. Theory and practice of concurrent processes
in computer operating systems. Process scheduling. Memory and auxiliary storage
management.
5220. Program Translation (3)
P: CSCI 4627 or consent of instructor. Formal language specification for
programming languages. Advanced parsing techniques. Code generation and
optimization.
6100. Cryptography and Information Security (3)
P: Consent of instructor. Cryptographic techniques to provide secrecy and
authenticity of information communicated over an insecure channel; private-key
cryptography, public-key cryptography and deployed cryptography.
6220. Topics in Language Design (3)
P: CSCI 3675 or consent of instructor. Semantics and implementation
characteristics of languages supporting modern computing paradigms such as
functional programming, logic programming, constraint programming, and object-
oriented programming.
6410. Design and Analysis of Algorithms (3)
P: CSCI 3650 or consent of instructor. Methods of designing efficient algorithms,
case studies. Analysis of complexity of algorithm.
Sólo tiene Master in Mathematics

No tiene computer science

http://www2.acs.ncsu.edu/reg_records/crs_cat/ECE.html#ECE%20109
UNITS: 3 -
Introduction Offered in
to Computer Fall Spring
ECE 109 Systems Summer
Introduction to key concepts in computer systems. Number representations, switching circuits, logic design,
microprocessor design, assembly language programming, input/output, interrupts and traps.
UNITS: 3 -
Introduction Offered in
to Computer Fall Spring
ECE 206 Organization Summer
Prerequisite: GPA 2.5 or above, with a C- or better in MA 241, PY 205, and CSC 116
http://www2.acs.ncsu.edu/reg_records/crs_cat/ECE.html#ECE%20109
UNITS: 3 -
Computer Offered in
Systems Fall Spring
ECE 209 Programming Summer
Prerequisite: Grade of C- or better in ECE 109

Page 8
 Sheet1
Computer systems programming using the C language. Translation of C into assembly language. Introduction to
fundamental data structures: array, list, tree, hash table.
UNITS: 3 -
Fundamentals Offered in
of Logic Fall Spring
ECE 212 Design Summer
Prerequisite: C- or better in ECE 109 or ECE 206
Introduction to digital logic design. Boolean algebra, switching functions, Karnaugh maps, modular combinational
circuit design, latches, flip-flops, finite state machines, synchronous sequential circuit design, datapaths, memory
technologies, caches, and memory hierarchies. Use of several CAD tools for simulation, logic minimization, synthesis,
state assignment, and technology mapping.
UNITS: 3 -
Introduction Offered in
to Embedded Fall and
ECE 306 Systems Spring
Prerequisite: C- or better in ECE 209 and ECE 212
Introduction to designing microcontroller-based embedded computer systems using assembly and C programs to control
input/output peripherals. Use of embedded operating system.
Design of UNITS: 3 -
Complex Offered in
Digital Fall and
ECE 406 Systems Spring
Prerequisite: A grade of C- or better in ECE 212
Design principles for complex digital systems: Iteration, top-down/bottom-up, divide and conquer, and decomposition.
Descriptive techniques, including block diagrams, timing diagrams, register transfer, and hardware-description
languages. Consideration of transmission-line effects on digital systems.
UNITS: 3 -
Introduction Offered in
to Signal Fall and
ECE 421 Processing Spring
Prerequisite: ECE 301
Concepts of electrical digital signal processing: Discrete-Time Signals and Systems, Z-Transform, Frequency Analysis
of Signals and Systems, Digital Filter Design. Analog-to Digital-to-Analog Conversion, Discrete Fourier Transform. To
major design projects.
Digital
Systems
ECE (CSC) 460 Interfacing UNITS: 3
Prerequisite: ECE 406
Concepts of microcomputer system architecture and applications to fundamental computer hardware. Theoretical and
practical aspects of interfacing and a variety of microprocessor peripheral chips with specific
microprocessor/microcomputer systems from both hardware and software points of view.

Advanced UNITS: 3 -
Microprocess Offered in
or Systems Fall and
ECE 463 Design Spring
Prerequisite: ECE 406
Advanced topics in microprocessor systems design, including processor architectures, virtual-memory systems,
multiprocessor systems, and single-chip microcomputers. Architectural examples include a variety of processors of
current interest, both commercial and experimental. Major design project.
Compiler
Optimization UNITS: 3 -
and Offered in
ECE 466 Scheduling Fall Only
Prerequisite: ECE 306 and either ECE 309 or CSC 316

Page 9
 Sheet1
Provide insight into current compiler designs dealing with present and future generations of high performance processors
and embedded systems. Investigate dataflow analysis and memory disambiguation, classical and parallelism enhancing
optimizations, scheduling and speculative execution, and register allocation. Review of techniques used in current
research compilers.
UNITS: 3 -
VLSI Systems Offered in
ECE 546 Design Fall Only
Prerequisite: ECE 302
Digital systems design in CMOS VLSI technology: CMOS devise physics, fabrication, primitive components, design
and layout methodology, integrated system architectures, timing, testing future trends of VLSI technology.
UNITS: 3 -
ASIC Offered in
ECE 745 Verification Fall Only
Prerequisite: ECE 520
This course covers the verification process used in validating the functional correctness in today's complex ASICs
(application specific integrated circuits). Topics include the fundamentals of simulation based functional verification,
stimulus generation, results checking, coverage, debug, and formal verification. Provides the students with real world
verification problems to allow them to apply what they learn.
UNITS: 3 -
Digital Image Offered in
ECE 764 Processing Fall Only
Prerequisite: ECE 513, ECE 514
A study of advanced techniques of image processing. Image formation and perception, digitalization, Fourier transform
domain processing, restoration and tomographic reconstruction.
UNITS: 3 -
Computer Offered in
ECE 763 Vision Fall Only
Prerequisite: ECE 514 , MA 501 or MA 502
Analysis of images by computers. Specific attention given to analysis of the geometric features of objects in images,
such as region size, connectedness and topology. Topics include: segmentation, template matching, motion analysis,
boundary detection, region growing, shape representation, 3-D object recognition including graph matching.
Computer
Organization
and Assembly
CSC 234 Language UNITS: 3
Prerequisite: CSC 214 with a grade of C- or better
Number systems, von Neuman machines, instruction sets and machine code, data representation, assemblers and
assembly language programming, compilers, external and internal processor organization, memory, I/O organization and
devices. Detailed study of a contemporary processor architecture.
Computer
Organization
and Assembly UNITS: 3 -
Language for Offered in
Computer Fall and
CSC 236 Scientists Spring
Prerequisite: CSC 216 with a C- or better and CSC or CSU Majors and Minors.
Computer architecture topics required by professional software developers, including binary and hexadecimal numbers,
hardware component organization, machine instruction sets, assembler language programming, linking assembler
language with high-level languages, program testing, computer hardware design issues, computer software design issues,
and trends in current computer design.
Concepts and
Facilities of
Operating
CSC 244 Systems UNITS: 3
Corequisite: CSC 234

Page 10
 Sheet1
The history and evolution of operating systems, concepts of process management, memory addressing and allocation,
files and protection, deadlocks and distributed systems.
UNITS: 3 -
Architecture Offered in
Of Parallel Fall and
CSC (ECE) 506 Computers Spring
Prerequisite: CSC 312, or CSC 456, or ECE 406.
The need for parallel and massively parallel computers. Taxonomy of parallel computer architecture, and programming
models for parallel architectures. Example parallel algorithms. Shared-memory vs. distributed-memory architectures.
Correctness and performance issues. Cache coherence and memory consistency. Bus-based and scalable directory-based
multiprocessors. Interconnection-network topologies and switch design. Brief overview of advanced topics such as
multiprocessor prefetching and speculative parallel execution.

al parecer no tienen maestrias sólo carreras

http://www.cs.unc.edu/Admin/Courses/
COMP 720 Compilers (3)
Prerequisites, COMP 455, 520, 524,. Tools and techniques of compiler construction.
Lexical, syntactic, and semantic analysis. Emphasis on code generation and optimization.
(Alternate years.)
COMP 740 Computer Architecture and Implementation (3)
Prerequisites, COMP 411, PHYS 352. Architecture and implementation of modern
single-processor computer systems. Performance measurement. Instruction set design.
Pipelining. Instruction-level parallelism. Memory hierarchy. I/O system. Floating-point
arithmetic. Case studies. Practicum. Fall.
http://www.coit.uncc.edu/cs/site/ms/ms_courses.cfm
ITCS 6220 Pattern Recognition
3 Credit hours
Prerequisites: Graduate standing
Topics include: Pattern pre-processing and feature extraction (entropy minimization,
orthogonal expansion, Fourier expansion, Karhunen-Loeve expansion, PCA); linear
decision functions; orthogonal and non-orthogonal systems of functions; pattern
classification by distance functions (Nearest Neighbor, K-means, ISODATA); pattern
classification by likelihood functions (Bayesian classifiers, estimation of probability
density function); trainable classifiers (LMSE, Perceptron, multi-layer perceptrons, fuzzy
classifiers); stochastic processes; classification on categorical attributes. (On Demand)

ITCS 6183 Computer Arithmetic

3 Credit hours
Prerequisite: consent of the department
Principles, architecture, and design of fast two operand adders; multioperand adders,
standard multipliers, and dividers. Cellular array multipliers and dividers. Floating point
processes, BCD, and excess three adders, multipliers, and dividers. (On demand)
ITCS 6182 Advanced Computer Architecture. (3)
3 Credit hours
Prerequisite: ITCS 5141 or Computer Science Graduate Standing or permission of the
Department.
Survey of existing and proposed architectures; pipelined, dataflow, and interconnection
network architectures. Impact of VLSI on architecture. (Fall, alternate years)

Page 11
 Sheet1

ITCS 6134 Digital Image Processing

3 Credit hours
Prerequisite: full graduate standing or consent of the department. Cross-listed as ECGR
6118
Image perception; image types/applications; image restoration and enhancement;
edge/boundary detection; image transformation; image segmentation; statistical and
syntactical pattern recognition; image information measures and compression. (Fall)
(Evenings)
ITCS 6128 3D Display and Advanced Interfaces.
3G Credit hours
Prerequisites: ITCS 4120 or ITCS 6120.
The course covers the fundamentals of 3D display hardware and software technology.
Topics include: human visual spatial perception of natural and synthetic 3D images, 3D
display hardware, human computer interface algorithms for effective stereoscopic
display, 3D display rendering techniques. (On Demand).
ITCS 5181 Microcomputer Interfacing
3 Credit hours
Prerequisite: ITCS 3182 or equivalent, or permission of the department
Signal conditioning, A/D conversion, noise, transmission line effects, signal processing,
D/A conversion and serial/parallel interfaces. (On demand)
ITCS 5145 Parallel Computing
3 Credit hours
Prerequisites: ITCS 1215 and 3182 or consent of department
Types of parallel computers, programming techniques for multiprocessor and
multicomputer systems, parallel strategies, algorithms, and languages. (Once every 3
semesters)
ITCS 5141 Computer Organization and Architecture
3 Credit hours
Prerequisite: ITCS 3181 or equivalent
Fundamentals of computer design; instruction set design, basic processor implementation
techniques; pipelining; memory hierarchy; Input/Output. Cost/performance and
hardware/software trade-offs. ( Fall, alternate years)
ITCS 5128 Programming Languages and Compilers
3 Credit hours
Prerequisite: consent of the department
Introduction to the concepts and techniques used in describing, defining, and
implementing programming languages and their compilers. Introduction to parsing and
parser construction; LL and LR grammars; syntax directed translation; data object
representations; run time structures; intermediate languages; code optimization. (On
demand)
http://www.uncg.edu/grs/bulletin/computersci.html#csc
539 Introduction to Compiler Design (3:3)
Pr. grades of at least C in 261 and 330 or permission of instructor. Successful completion
of 553 helpful
Basic techniques of compiler design and implementation: lexical analysis, parsing, code
generation. Sizable programming project implementing a compiler for a block structured
language with strong typing.
561 Principles of Computer Architecture (3:2:3)
Pr. grades of at least C in 261, 330, and 350, or permission of instructor

Page 12
 Sheet1
Hardware and software components of computer systems, their organization and
operations. Topics: comparative instruction set architectures, microprogramming,
memory management, processor management, I/O, interrupts, and emulation of
processors.
562 Principles of Operating Systems (3:3)
Pr. grades of at least C in 261 and 340 or permission of instructor. Successful completion
of 561 helpful
Techniques and strategies used in operating system design and implementation:
managing processes, input/output, memory, scheduling, file systems, and protection.
656 Foundations of Computer Science (3:3)
Pr. MAT 353 or permission of instructor
Introduces the mathematical foundations that support advanced studies in computer
science including computer programming and the analysis of algorithms.
580 Cryptography and Security in Computing (3:3)
Pr. grades of at least C in 330 and one of the following: 471, 561, 562, or 567; or
permission of instructor
Modern development of cryptography and secure encryption protocols. Program security
and viruses, operating system protection, network and distributed system security,
database security, and administering security.
583 Firewall Architecture and Computer Security (3:3)
Pr. grades of at least C in 567 and 580, or permission of instructor
Firewall hardware and software technologies. Architectures, protocols and their
applications.
no hay maestria
no hay maestria
http://www.uncw.edu/catalogue/graduate/Interdisciplinary135_139.pdf
CSC 520. Digital Image Processing (3) Prerequisite: CSC 340 or equivalent.
This course introduces the methods and theory of digital image processing
beginning with image representations, storage formats, and data structures.
Students develop tools for reading image data, determining image properties
and performing common point, local, and global transforms. The course also
covers data compression, digital watermarking, morphological processing, and
steganography.
CSC 537. (437) Parallel Computing (3) Prerequisite: CSC 340. Implementation
of scientific algorithms in parallel. Use of shared-memory, distributed-memory,
and multicore technologies. Study of techniques for improved performance
and issues related to speedup and slowdown.
CSC 540. Advanced Scientific Computing (3) Prerequisite: CSC 340 or
equivalent. This course introduces the underlying theory, design,
implementation, application, and analysis of numerical algorithms
fundamental to scientific computation. Topics include Fourier and wavelet
transforms spectral analysis, energy distributions, convolution, correlation,
windowed transforms, and filtering. Other topics include constrained nonlinear
and combinatorial optimization, curve fitting, data mining, clustering, and
fuzzy logic.

CSC 577. Pattern Recognition (3) Prerequisite: CSC 340 or equivalent. This
course introduces pattern recognition methods and theory using conventional
statistical approaches, neural networks, fuzzy logic, support vectors, and
linear principal component analysis (PCA). The course also presents methods
for non-linear PCA, clustering, and feature extraction. Students implement
algorithms; apply methods to selected problems, and to document findings.

Page 13
 Sheet1

MIS 585. Copyright, Privacy, and Cyber Law (3) The legal aspects of managing
technology, such as intellectual property, e-commerce, contracting, cybertorts,
and technology policy are primary issues covered. Intellectual property law is
of particular importance to managers of technology, as well as online
contracting, privacy, employment law, and the scope of governmental
regulation of technology.
no tiene actualizada sus materias

Page 14
Sheet1

Page 15
 Sheet1

Page 16
Sheet1

Page 17
Sheet1

Page 18
Sheet1

Page 19
Sheet1

Page 20
Sheet1

Page 21
 Opcion 1

University of north carolina at Greensboro http://www.uncg.edu/grs/bulletin/computersci.html#csc

561 Principles of Computer Architecture (3:2:3)

Pr. grades of at least C in 261, 330, and 350, or permission
of instructor
1 Hardware and software components of computer systems,
their organization and operations. Topics: comparative
instruction set architectures, microprogramming, memory
management, processor management, I/O, interrupts, and
emulation of processors.

562 Principles of Operating Systems (3:3)

Pr. grades of at least C in 261 and 340 or permission of
instructor. Successful completion of 561 helpful
2

Techniques and strategies used in operating system design

and implementation: managing processes, input/output,
memory, scheduling, file systems, and protection.

539 Introduction to Compiler Design (3:3)

Pr. grades of at least C in 261 and 330 or permission of
instructor. Successful completion of 553 helpful
3
Basic techniques of compiler design and implementation:
lexical analysis, parsing, code generation. Sizable
programming project implementing a compiler for a block
structured language with strong typing.
522 Digital Image Processing (3:3)
Pr. grades of at least C in 330, 350, and MAT 292, or
permission of instructor. Successful completion of STA 271
or STA 290 recommended.
4

Image representation, enhancement, compression, coding,

restoration, wavelet transforms.

567 Principles of Computer Networks (3:3)

Pr. grades of at least C in 261 and 330, or permission of
instructor
5 Hardware and software components of computer
networks, their organization and operations. Topics: open
system interconnection; local area networks; TCP/IP
internetworking, routing, and packet switching; network
programming.
568 Principles of Wireless Networks (3:3)
Pr. grades of at least C in 330 and 567, or permission of
instructor
6
Digital communications, communication networks,
wireless communication technology, wireless networking,
wireless LANs and wireless network programming.

Page 22
 Opcion 1
580 Cryptography and Security in Computing (3:3)
Pr. grades of at least C in 330 and one of the following:
471, 561, 562, or 567; or permission of instructor
Modern development of cryptography and secure
7
encryption protocols. Program security and viruses,
operating system protection, network and distributed
system security, database security, and administering
security.
583 Firewall Architecture and Computer Security (3:3)

Pr. grades of at least C in 567 and 580, or permission of

instructor
8

Firewall hardware and software technologies.

Architectures, protocols and their applications.

Page 23
 Opcion 1
http://www.uncg.edu/cmp/academic/courses.html
CSC 261 Computer Organization and Assembly Language
(3:3)
Pr. grade of at least C (2.0) in CSC 230 and in CSC 250, or
permission of instructor
CPU, memory, I/O devices, digital logic design, psw. Number
representations and machine language. Assembly language
instruction types, registers, addressing, arithmetic, instruction
format, opcodes, pseudo-opcodes, assembler directives, system
calls, and macros.
CSC 261 Computer Organization and Assembly Language
(3:3)
Pr. grade of at least C (2.0) in CSC 230 and in CSC 250, or
permission of instructor
CPU, memory, I/O devices, digital logic design, psw. Number
representations and machine language. Assembly language
instruction types, registers, addressing, arithmetic, instruction
format, opcodes, pseudo-opcodes, assembler directives, system
calls, and macros.
CSC 261 Computer Organization and Assembly Language
(3:3)
Pr. grade of at least C (2.0) in CSC 230 and in CSC 250, or
permission of instructor
CPU, memory, I/O devices, digital logic design, psw. Number
representations and machine language. Assembly language
instruction types, registers, addressing, arithmetic, instruction
format, opcodes, pseudo-opcodes, assembler directives, system
calls, and macros.
CSC 330 Advanced Data Structures (3:3)
Pr. grade of at least C (2.0) in CSC 230 and in CSC 250
Static and dynamic data structures emphasizing binary trees
and graphs. Advanced programming techniques. Advanced
sorting and searching algorithms. Hashing techniques.
Performance analysis. Methods of developing large
applications programs.
CSC 261 Computer Organization and Assembly Language
(3:3)
Pr. grade of at least C (2.0) in CSC 230 and in CSC 250, or
permission of instructor
CPU, memory, I/O devices, digital logic design, psw. Number
representations and machine language. Assembly language
instruction types, registers, addressing, arithmetic, instruction
format, opcodes, pseudo-opcodes, assembler directives, system
calls, and macros.
CSC 330 Advanced Data Structures (3:3)
Pr. grade of at least C (2.0) in CSC 230 and in CSC 250
Static and dynamic data structures emphasizing binary trees
and graphs. Advanced programming techniques. Advanced
sorting and searching algorithms. Hashing techniques.
Performance analysis. Methods of developing large
applications programs.
Page 24
CSC 330 Advanced Data Structures (3:3)
Pr. grade of at least C (2.0) in CSC 230 and in CSC 250
Static and dynamic data structures emphasizing binary
trees and graphs. Advanced programming techniques.
Advanced sorting and searching algorithms. Hashing
techniques. Performance analysis. Methods of developing
large applications programs.
CSC 340 Software Engineering (3:3)
Pr. grade of at least C (2.0) in CSC 330
Practical and theoretical concepts of software
engineering.
CSC 330 Advanced Data Structures (3:3)
Pr. grade of at least C (2.0) in CSC 230 and in CSC 250
Static and dynamic data structures emphasizing binary
trees and graphs. Advanced programming techniques.
Advanced sorting and searching algorithms. Hashing
techniques. Performance analysis. Methods of developing
large applications programs.
CSC 350 Foundations of Computer Science II (3:3)
Pr. grade of at least C (2.0) in CSC 250, or permission of
instructor
High level concepts in the theoretical foundations of
computer science.
CSC 330 Advanced Data Structures (3:3)
Pr. grade of at least C (2.0) in CSC 230 and in CSC 250
Static and dynamic data structures emphasizing binary
trees and graphs. Advanced programming techniques.
Advanced sorting and searching algorithms. Hashing
techniques. Performance analysis. Methods of developing
large applications programs.
567 Principles of Computer Networks (3:3)
Pr. grades of at least C in 261 and 330, or permission
of instructor
Hardware and software components of computer
networks, their organization and operations. Topics:
open system interconnection; local area networks;
TCP/IP internetworking, routing, and packet
switching; network programming.
 Opcion 1
CSC 330 Advanced Data Structures (3:3) CSC 471 Principles of Database Systems (3:3)
Pr. grade of at least C (2.0) in CSC 330, or permission of
Pr. grade of at least C (2.0) in CSC 230 and in CSC 250 instructor
Static and dynamic data structures emphasizing binary trees
and graphs. Advanced programming techniques. Advanced Contemporary database systems. Emphasis on query
sorting and searching algorithms. Hashing techniques. processing, design, and implementation of applications in
Performance analysis. Methods of developing large relational (SQL) databases. Introduction to other database
applications programs. models such as XML, object-oriented, and deductive.
567 Principles of Computer Networks (3:3) 580 Cryptography and Security in Computing (3:3)
Pr. grades of at least C in 330 and one of the
Pr. grades of at least C in 261 and 330, or permission of following: 471, 561, 562, or 567; or permission of
instructor instructor
Hardware and software components of computer networks, Modern development of cryptography and secure
their organization and operations. Topics: open system encryption protocols. Program security and viruses,
interconnection; local area networks; TCP/IP operating system protection, network and distributed
internetworking, routing, and packet switching; network system security, database security, and administering
programming. security.

Page 25
 Opcion 1

CSC 350 Foundations of Computer Science II (3:3)

Pr. grade of at least C (2.0) in CSC 250, or permission of instructor

High level concepts in the theoretical foundations of computer

science.

292 Calculus II (3:3)

Pr. a grade of at least C in 191 or permission of the instructor

Continuation of the study of differential calculus of the elementary

transcendental functions, introductory integral calculus of the
algebraic and transcendental functions of one variable, techniques of
integration. (Fall & Spring)

561 Principles of Computer Architecture (3:2:3)

Pr. grades of at least C in 261, 330, and 350, or permission of
instructor
Hardware and software components of computer systems, their
organization and operations. Topics: comparative instruction set
architectures, microprogramming, memory management,
processor management, I/O, interrupts, and emulation of
processors.

Page 26
Opcion 1

Page 27
 Opcion 4

North Carolina University State at Raleighhttp://www2.acs.ncsu.edu/reg_records/crs_cat/CSC.html#CSC%20501

UNITS: 3 - Offered
CSC 501 Operating Systems Principles in Fall and Spring

Prerequisite: CSC 244, CSC 314 and MA 421

Fundamental issues related to the design of operating systems. Process

scheduling and coordination, deadlock, memory management and
elements of distributed systems.

CSC (ECE) Architecture Of Parallel UNITS: 3 - Offered

506 Computers in Fall and Spring
Prerequisite: CSC 312, or CSC 456, or ECE 406.
The need for parallel and massively parallel computers. Taxonomy of
parallel computer architecture, and programming models for parallel
architectures. Example parallel algorithms. Shared-memory vs.
distributed-memory architectures. Correctness and performance issues.
Cache coherence and memory consistency. Bus-based and scalable
directory-based multiprocessors. Interconnection-network topologies and
switch design. Brief overview of advanced topics such as multiprocessor
prefetching and speculative parallel execution.

Page 28
 Opcion 4

CSC 244 Concepts and Facilities of Operating Systems UNITS: 3 CSC 314 Data Structures
Prerequisite: CSC 214 and CSC 224 with a grade of C-
Corequisite: CSC 234 better
A survey of fundamental abstract data types along with
efficient implementations for each. Emphasizes asympto
running time as a measure of program performance. List
The history and evolution of operating systems, concepts of process management, stacks, queues, sparse arrays, binary trees, heaps, balance
memory addressing and allocation, files and protection, deadlocks and distributed search trees, and hash tables. Illustrative applications suc
systems. graph, text-processing, or geometric algorithms.
UNITS: 4 -
Offered in Computer
Fall and Architecture and
CSC 312 Computer Organization and Logic Spring CSC 456 Multiprocessors
Prerequisite: CSC 236 and a grade of C- or better in CSC 226 Prerequisite: CSC 236 and CSC 316

Combinational logic circuits and their relation to Boolean algebra. Functional
properties of combinational and sequential components and their realizations in
integrated circuit forms. Organization of digital computer components;
processors, controlunits, memories, switches, and peripherals. Architecture of
computer systems. Computer arithmetic. Microprogrammed control. Interrupt
mechanisms. Laboratory exercises involve logical, functional, and electrical
properties of components from gates tomicroprocessors
Major components of digital computers and the organiza
these components into systems. Begins with single proce
systems and extends to parallel systems for multiprocess
Topics include computer organization, instruction set de
cache memory, pipelined processors, and multiprocessor
Recent developments in PC and desktop architectures ar
studied.

Page 29
 Opcion 4

UNITS: 3 - Offered in UNITS: 3 - Offered in

Fall Spring Summer
and CSC 224 with a grade of C- or
al abstract data types along with
ns for each. Emphasizes asymptotic
ure of program performance. Lists,
arrays, binary trees, heaps, balanced
ables. Illustrative applications such as
or geometric algorithms.
MA 421 Introduction to Probability Fall Spring Summer
Prerequisite: MA 242
Axioms of probability, conditional probability and independence, basic
combinatorics, discrete and continuous random variables, joint densities
and mass functions, expectation, central, limit theorem, simple stochastic
processes.

UNITS: 3 - Offered in
Spring Only
and CSC 316

igital computers and the organization of

systems. Begins with single processor
parallel systems for multiprocessing.
er organization, instruction set design,
ed processors, and multiprocessors.
n PC and desktop architectures are also

Page 30
 opcion 2

Charlotte http://www.coit.uncc.edu/cs/site/ms/ms_courses.cfm

ECGR 5101. Embedded Systems. (3) Prerequisite:

ITCS3182, ECGR3183, or equivalent. Introduction to
designing microcontroller-based embedded computer
systems using assembly and C programs. Examination of
real-time operating systems and their impact on
performance. Computer engineering applications will be
emphasized. Credit will not be given for ECGR 5101
where credit has been given for ECGR 4101. (Fall)
ECGR 5146. Introduction to VHDL. (3) Prerequisites:
ECGR 2182 or equivalent and knowledge of a computer
language. Introduction to VHSIC Hardware Description
Language (VHDL) including VHDL-based high-level
design of microelectronic systems, VHDL programming,
and VHDL synthesis; emphasis on learning and using
industry-standard VHDL tools running on VNIX
workstations. Credit will not be given for ECGR 5146
where credit has been given for ECGR 4146. (Fall)

ITCS 5141 Computer Organization and Architecture

3 Credit hours
Prerequisite: ITCS 3181 or equivalent
1 Fundamentals of computer design; instruction set design,
basic processor implementation techniques; pipelining;
memory hierarchy; Input/Output. Cost/performance and
hardware/software trade-offs. ( Fall, alternate years)
ITCS 6134 Digital Image Processing
3 Credit hours
Prerequisite: full graduate standing or consent of the
department. Cross-listed as ECGR 6118
2 Image perception; image types/applications; image
restoration and enhancement; edge/boundary detection;
image transformation; image segmentation; statistical and
syntactical pattern recognition; image information measures
and compression. (Fall) (Evenings)
ITCS 5102 Survey of Programming Languages
3 Credit hours
Prerequisite: consent of the department
Study of the concepts underlying various computer languages
and comparing and evaluating various language features.
History and development of various languages, such as
FORTRAN, ALGOL, PASCAL, MODULA-2, C, C++, Ada,
Lisp, Smalltalk, Prolog.; evaluation and comparison of
various algorithms and language suitability. Selection of
languages for problems/environments. Overview of various
languages. (On demand)
ITCS 6144 Operating Systems Design
3 Credit hours
Prerequisite: ITCS 6114 or consent of the department

Page 31
 opcion 2

Introduction to features of a large-scale operating system with

emphasis on resource-sharing environments. Computer
system organization; resource management;
multiprogramming; multi-processing; file systems; virtual
machine concepts; protection and efficiency. (On Demand)
ITCS 5128 Programming Languages and Compilers
3 Credit hours
Prerequisite: consent of the department
Introduction to the concepts and techniques used in
describing, defining, and implementing programming
languages and their compilers. Introduction to parsing and
parser construction; LL and LR grammars; syntax directed
translation; data object representations; run time structures;
intermediate languages; code optimization. (On demand)

Page 32
 opcion 2

http://provost.uncc.edu/catalogs/2009-2010/ITCS.htm

ITCS 3181. Logic and Computer Systems. (3) Prerequisites: ITCS

2175 and ITCS 2215. Corequisite: ITCS 3181L. Fundamental layers of
digital computer systems: Switch level network structure; digital logic
level including ALU, registers, buses; microprogramming level;
conventional Instruction Set Architecture level and assembly
language; memory organization and architecture; pipelining and
functional parallelism. (Fall, Spring, Summer) (Evenings)

ITCS 6114 Algorithms and Data Structures

3 Credit hours
Prerequisite: full graduate standing.

Page 33
 opcion 2

Introduction to techniques and structures used and useful in design of

sophisticated software systems. Records; arrays; linked lists; queues; stacks;
trees; graphs; storage management and garbage collection; recursive
algorithms; searching and sorting; graph algorithms; time and space
complexity. (Fall, Spring) (Evenings)

Page 34