UIC > Subjects > MCS
Filter Results
term offered
time offered
average grade
average rating
MCS 260: Introduction to Computer Science
Computer literacy, number systems, concepts of operation systems, storage, files, databases, logic gates, circuits, networks, internet. Introduction to programming in Python, variables, assignments, functions, objects. Natural World - No Lab course.
Professors: Cole, S; Lowman, R
Terms: N/A
.....
0 ratings
N/A
Unofficial
average grade reported by students
MCS 275: Programming Tools and File Management
Bit manipulation, screen and file input/output, separate compilation and linking, creating and using libraries, the ANSI C library, make utilities, interactive debuggers, introduction to C++ classes. 
Professors: Diochnos, D; Lowman, R
Terms: N/A
.....
0 ratings
N/A
Unofficial
average grade reported by students
MCS 320: Introduction to Symbolic Computation
Introduction to computer algebra systems (MAPLE), symbolic computation, and the mathematical algorithms employed in such computation, with examples and applications to topics in undergraduate mathematics. 
Professors: Verschelde, J
Terms: N/A
.....
0 ratings
N/A
Unofficial
average grade reported by students
MCS 360: Introduction to Data Structures
Pointers and dynamic memory allocation in C/C++, recursion, stacks, queues, heaps, binary and multiway trees, graphs, hash tables. Sorting and searching algorithms. 
Professors: N/A
Terms: N/A
.....
0 ratings
N/A
Unofficial
average grade reported by students
MCS 361: Discrete Mathematics
Discrete mathematical structures used in computer science: sets, functions and relations; induction, recursive definitions and relations, methods of proof, quantifiers; counting; graphs and trees; algorithms. 
Professors: Beissinger, J
Terms: N/A
.....
0 ratings
N/A
Unofficial
average grade reported by students
MCS 401: Computer Algorithms I
Design and analysis of computer algorithms. Divide-and-conquer, dynamic programming, greedy method, backtracking. Algorithms for sorting, searching, graph computations, pattern matching, NP-complete problems. 
Professors: DasGupta, B; Turan, G
Terms: N/A
.....
0 ratings
N/A
Unofficial
average grade reported by students
MCS 411: Compiler Design
Language translation: lexical analysis, parsing schemes, symbol table management, syntax and semantic error detection, and code generation. Development of fully-functional compiler. 
Professors: Venkatesan Natarajan, V
Terms: N/A
.....
0 ratings
N/A
Unofficial
average grade reported by students
MCS 415: Programming Language Design
Definition, design, and implementation of programming languages. Syntactic and semantic description; variable bindings, control and data structures, parsing, code generation, optimization; exception handling; data abstraction. 
Professors: Di Eugenio, B
Terms: N/A
.....
0 ratings
N/A
Unofficial
average grade reported by students
MCS 421: Combinatorics
The pigeonhole principle, permutations and combinations, binomial coefficients, inclusionexclusion principle, recurrence relations and generating functions, special counting sequences, Polya theory of counting. 
Professors: N/A
Terms: N/A
.....
0 ratings
N/A
Unofficial
average grade reported by students
MCS 423: Graph Theory
Basic concepts of graph theory including Eulerian and hamiltonian cycles, trees, colorings, connectivity, shortest paths, minimum spanning trees, network flows, bipartite matching, planar graphs. 
Professors: Friedland, S
Terms: N/A
.....
0 ratings
N/A
Unofficial
average grade reported by students
1 2 3