Âé¶¹¹ÙÍø

Skip to main content
Âé¶¹¹ÙÍø
John Rahme

faculty

John Rahme

Assistant Teaching Professor

Computer & Information Science

Contact

508-910-8353

508-999-9144

ksbinfAvnbtte/fev

Dion 302C

Teaching

Courses

Application of advanced object-oriented principles to practical software development. Topics include inheritance, polymorphism, abstract data types, exception handling, threads, and networking. Emphasis is placed on developing robust, reusable software through component libraries, code reuse strategies, and industry-relevant development practices.

Application of advanced object-oriented principles to practical software development. Topics include inheritance, polymorphism, abstract data types, exception handling, threads, and networking. Emphasis is placed on developing robust, reusable software through component libraries, code reuse strategies, and industry-relevant development practices.

Application of advanced object-oriented principles to practical software development. Topics include inheritance, polymorphism, abstract data types, exception handling, threads, and networking. Emphasis is placed on developing robust, reusable software through component libraries, code reuse strategies, and industry-relevant development practices.

Comprehensive coverage of all major groups of algorithms, including divide-and-conquer, dynamic programming, greedy, backtracking, branch-and-bound, and parallel algorithms. Discussion of the design and implementation of complex, dynamic data structures. The course also covers an introduction to the functional paradigm.

Comprehensive coverage of all major groups of algorithms, including divide-and-conquer, dynamic programming, greedy, backtracking, branch-and-bound, and parallel algorithms. Discussion of the design and implementation of complex, dynamic data structures. The course also covers an introduction to the functional paradigm.

Comprehensive coverage of all major groups of algorithms, including divide-and-conquer, dynamic programming, greedy, backtracking, branch-and-bound, and parallel algorithms. Discussion of the design and implementation of complex, dynamic data structures. The course also covers an introduction to the functional paradigm.

Specialized topics of interest and relevance to computer and information science. Course content may change from semester to semester according to instructor's preferences.

Back to top of page