|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
1.00 Credits
A first-year seminar for beginning majors in Computer Science. Open to all beginning IUPUI students and transfer students with below 18 credit hours.
-
4.00 Credits
P or C: MATH 154 or MATH 159. The context of computing in history and society, information representation in digital computers, introduction to programming in a modern high-level language, introduction to algorithm and data structures, their implementation as programs.
-
4.00 Credits
P: 23000. Continues the introduction of programming began in CSCI 230, with particular focus on the ideas of data abstraction and object-oriented programming. Topics include programming paradigms, principle of language design, object-oriented programming, programming and debugging tools, documentation, recursion, linked data structures, and introduction to language translation.
-
3.00 Credits
P or C: ECE 26400 and CSCI 24200 or CSCI 23000. Spring. Learn advanced programming skills and concepts. Introduction to software engineering: problem specification and program design with emphasis on object-oriented programming, programming style, debugging, and documentation. A significant software project's required. (This course is for computer engineering and computer information systems majors.)
-
3.00 Credits
P or C: 23000 and 24000. Fall. Assembly language programming and structure of a simple and a typical computer. Pseudo operations, address structure, subroutines, and macros. File I/O and buffering techniques. Interfacing with high-level languages. Assemblers: one- and two-pass assemblers, system dependent and independent assembler features, and design options. Loaders, linkers, and macro processors.
-
3.00 Credits
P: 23000 and MATH 16500. Fall. Theory and application of discrete mathematics structures and their relationship to computer science. Topics include mathematical logic, sets, relations, functions, permutations, combinatorics, graphs, Boolean algebra, digital logic, recurrence relations, and finite-state automata.
-
3.00 Credits
P: MATH 16500 or equivalent and CSCI 23000 or equivalent, or instructor permission. Fall/Spring. Discrete structures introduces students to the vocabulary, notation, formalisms, constructs, and methods of abstraction in which almost all of the advanced thinking in and about computer science is carried out. Topics include basic logic, proof techniques, recursion and recurrence relations, sets and combinatorics, probability, relations and functions, graphs and trees, Boolean algebra, and models of computation. An advanced project is expected in this course.
-
3.00 Credits
P: 24000 and 34000. Spring. Programming language concepts and different paradigms of programming. Topics include syntax and semantics of high-level languages, parsing methods, subprograms and their implementation, data abstraction, language translation overview including lexical analysis, syntax-directed translation, symbol table handling, code generation, functional programming, logic programming, and object-oriented programming.
-
3.00 Credits
P: 24000 and 34000. Spring. A study of the design and analysis of data structures and algorithms. Abstract data types: arrays, stacks, queues, lists, trees, and graphs. Algorithms: sorting, searching, and hashing. File structures: organization and access methods.
-
3.00 Credits
P: CSCI 23000, CSCI 24000, and CSCI 34000 or CSCI 34050. Fall/Spring. This course includes fundamentals of data structures and algorithms, such as algorithm analysis, lists, stacks, and queues, trees, hashing and heaps, sorting, graph algorithms, and file structures. An advanced project is expected.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|