6 courses with the subject CSE, each shown exactly as we captured it from the college's catalog, with every element we hold. Where the wording looks broken, that is our reading of the catalog, not the college's text.
CSE 110Computer Science College Seminar
Methods and techniques students can adopt to promote their perseverance and success at the College in general and in the Computer Science and Information Technology fields in particular. Specific topics include college procedures and resources, academic advisement, time management, goal-setting, test and note taking, health issues and other areas related to student success in a computer related fields in college. Students are expected to enroll in this class in their fi semester. No prerequisite. Offered on: A / 1 cr. hr.
An introductory programming course for the Computer Science major. Topics include basic computer and programming concepts such as hardware, software, numbering systems, identifiers, variables, constants, data types, and operations, standard input and output, selections, loops, functions and methods, single and multidimensional arrays, and objects and classes. The course consists of 100- minute face-to-face lecture and 100-minute instructor-led lab each week for 15 weeks. Weekly homework programming projects and a final project of at least 100 lines of source code are expected. (2 hrs. lecture, 2 hrs. laboratory) Offered on: A / 3 cr. hrs.
MAT111 or higher. Corequisite: MAT120 or MAT124 or higher.
CSE 148Object-Oriented Programming
An intermediate programming course for the Computer Science major. Topics include class abstraction and encapsulation, inheritance and polymorphism, exception handling and text IO, abstract classes and interfaces, graphical user interface, event-driven programming, binary I/0, and recursion. The course consists of 200-minute face-to-face lecture with some instructor-led lab practice each week. Weekly programming homework projects and a final project of at least 500 lines of source code are required. Prerequisites: MAT 120 or MAT124 or higher, CSE118 with a C or higher. Offered on: A / 4 cr. hrs.
An extension of programming methodology to cover data storage and manipulation on complex data sets. Topics include: programming and applications of data structures; stacks, queues, lists, binary trees, heaps, priority queues, balanced trees and graphs. Recursive programming is heavily utilized. Fundamental sorting and searching algorithms are examined along with informal rst efficiency comparisons. Students expected to be proficient with a professional IDE for coding and debugging. The course consists of 100-minute face-to-face lecture and 100-minute instructor-led lab each week. (2 hrs. lecture, 2 hrs. laboratory) Prerequisite: CSE148 with a C or higher. Offered on: A / 3 cr. hrs.
