Information Technology Concentration
This course is in line to provide the introductory IT student with a basic introduction to Computer programming technology and algorithmic problem solving using Java as the introductory programming language. Topics covered include control structures, arrays, functions, recursion, dynamic memory allocation, simple data structures, files, and structured program design. Elements of object-oriented design and programming are also introduced.
This course is a continuation of Programming I. This course introduces the student to object-oriented programming through a study of the concepts of program specification and design, algorithm development, and coding and testing using a modern software development environment. Students learn how to write programs in an object-oriented high-level programming language. Topics covered include fundamentals of algorithms, flowcharts, problem solving, programming concepts, classes and methods, control structures, arrays, and strings.
This course is a continuation of Programming I. This course includes an introduction to data structures such as queues and stacks. Students will use a structured programming language such as JAVA or C++ in problem solving. Examines advanced features of modern programming languages such as object oriented programming, string manipulation functions, and visual programming. Both procedural and event-driven programming is covered.
This is the laboratory activities section of BCIS 2304 and covers structured programming languages such as JAVA or C++ in problem solving. This course examines advanced features of modern programming languages such as object-oriented programming, string manipulation functions, and visual programming. Both procedural and event-driven programming is covered. This course will also include an introduction to data structures such as queues and stacks.
This course aims to introduce the student to the concept of data structures through abstract data structures including lists, sorted lists, stacks, queues, de-queues, sets/maps, directed acyclic graphs, and graphs; and implementations including the use of linked lists, arrays, binary search trees, M-way search trees, hash tables, complete trees, and adjacency matrices and lists.
This course will continue from BCIS 3301 and apply concept of algorithms design. This includes greedy, divide-and-conquer, random and backtracking algorithms and dynamic programming; and specific algorithms including, for example, resizing arrays, balancing search trees, shortest path, and spanning trees.
