INT-2220 Computer Science II

Credits 4
Introduces theoretical and practical treatment of abstract data types and data structures including lists, strings, stacks, queues, search trees, and hash tables. Object oriented programming methodology and Java classes are used to implement ADT. Software life cycle is studied. Formal topics include introduction to theory of computation including parsing context-free grammars, Finite State Machines, expression evaluation and notation, program analysis and verification.
Prerequisite(s): INT-2210 (formerly INT-1210), MAT-2420, with grades of C or higher.
Formerly offered as INT 1220. Students may not receive credit for both INT 1220 and INT 2220.
3 class/ 3 lab hours.
(Offered spring only.)

Course Outcomes

Apply the major life cycle steps in software design to design software.
Explain the difference between the three levels of data abstractions.
Design abstract data types (ADTs) using Java.
Implement the ADTs of lists, stacks, queues, trees, graphs using data structures of arrays, linked list, multiply linked structures, binary search trees.
Explain how elements of data structures are accessed and stored.
Develop recursive steps to solve problems.
Build mathematical expressions using infix, prefix, postfix notations.
Analyze complexity of algorithms using Big O notations.
Classify searching and sorting algorithms based on their execution time performance.